Home
last modified time | relevance | path

Searched refs:hash (Results 176 - 200 of 3945) sorted by relevance

12345678910>>...158

/third_party/mesa3d/src/gallium/auxiliary/translate/
H A Dtranslate_cache.c37 struct cso_hash hash; member
47 cso_hash_init(&cache->hash); in translate_cache_create()
54 struct cso_hash *hash = &cache->hash; in delete_translates() local
55 struct cso_hash_iter iter = cso_hash_first_node(hash); in delete_translates()
68 cso_hash_deinit(&cache->hash); in translate_cache_destroy()
95 cso_hash_find_data_from_template(&cache->hash, in translate_cache_find()
102 cso_hash_insert(&cache->hash, hash_key, translate); in translate_cache_find()
/third_party/rust/crates/libc/src/unix/linux_like/linux/gnu/b32/arm/
H A Dalign.rs43 impl ::hash::Hash for ucontext_t {
44 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
45 self.uc_flags.hash(state); in hash()
46 self.uc_link.hash(state); in hash()
47 self.uc_stack.hash(state); in hash()
48 self.uc_mcontext.hash(state); in hash()
49 self.uc_sigmask.hash(state); in hash()
/third_party/ffmpeg/tools/
H A Dffhash.c26 #include "libavutil/hash.h"
43 static struct AVHashContext *hash; variable
52 printf("Supported hash algorithms:"); in usage()
66 printf("%s=", av_hash_get_name(hash)); in finish()
68 av_hash_final_b64(hash, res, sizeof(res)); in finish()
71 av_hash_final_hex(hash, res, sizeof(res)); in finish()
88 printf("%s=OPEN-FAILED: %s:", av_hash_get_name(hash), strerror(errno)); in check()
93 av_hash_init(hash); in check()
105 av_hash_update(hash, buffer, size); in check()
131 if ((ret = av_hash_alloc(&hash, hash_nam in main()
[all...]
/third_party/rust/crates/libc/src/unix/hermit/
H A Dmod.rs126 impl ::hash::Hash for dirent {
127 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
128 self.d_ino.hash(state); in hash()
129 self.d_off.hash(state); in hash()
130 self.d_reclen.hash(state); in hash()
131 self.d_name.hash(state); in hash()
154 impl ::hash::Hash for sockaddr_un {
155 fn hash<H: ::hash functions
183 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
216 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
242 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
278 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
337 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/node/deps/v8/src/base/
H A Dhashmap.h5 // The reason we write our own hash map instead of using unordered_map in STL,
44 // initial_capacity is the size of the initial hash map;
66 Entry* Lookup(const Key& key, uint32_t hash) const;
70 // corresponding key, key hash, and default initialized value.
71 Entry* LookupOrInsert(const Key& key, uint32_t hash);
75 // corresponding key, key hash, and value created by func.
77 Entry* LookupOrInsert(const Key& key, uint32_t hash, const Func& value_func);
87 // a key created by key_func, key hash, and value created by
90 Entry* LookupOrInsert(const LookupKey& lookup_key, uint32_t hash,
93 Entry* InsertNew(const Key& key, uint32_t hash);
223 LookupOrInsert( const Key& key, uint32_t hash) LookupOrInsert() argument
232 LookupOrInsert( const Key& key, uint32_t hash, const Func& value_func) LookupOrInsert() argument
242 LookupOrInsert( const LookupKey& lookup_key, uint32_t hash, const KeyFunc& key_func, const ValueFunc& value_func) LookupOrInsert() argument
257 InsertNew( const Key& key, uint32_t hash) InsertNew() argument
265 Remove( const Key& key, uint32_t hash) Remove() argument
[all...]
/kernel/linux/linux-5.10/drivers/net/wireguard/
H A Dnoise.c82 memset(&handshake->hash, 0, NOISE_HASH_LEN); in handshake_zero()
432 static void mix_hash(u8 hash[NOISE_HASH_LEN], const u8 *src, size_t src_len) in mix_hash() argument
437 blake2s_update(&blake, hash, NOISE_HASH_LEN); in mix_hash()
439 blake2s_final(&blake, hash); in mix_hash()
442 static void mix_psk(u8 chaining_key[NOISE_HASH_LEN], u8 hash[NOISE_HASH_LEN], in mix_psk() argument
450 mix_hash(hash, temp_hash, NOISE_HASH_LEN); in mix_psk()
455 u8 hash[NOISE_HASH_LEN], in handshake_init()
458 memcpy(hash, handshake_init_hash, NOISE_HASH_LEN); in handshake_init()
460 mix_hash(hash, remote_static, NOISE_PUBLIC_KEY_LEN); in handshake_init()
465 u8 hash[NOISE_HASH_LE in message_encrypt()
454 handshake_init(u8 chaining_key[NOISE_HASH_LEN], u8 hash[NOISE_HASH_LEN], const u8 remote_static[NOISE_PUBLIC_KEY_LEN]) handshake_init() argument
463 message_encrypt(u8 *dst_ciphertext, const u8 *src_plaintext, size_t src_len, u8 key[NOISE_SYMMETRIC_KEY_LEN], u8 hash[NOISE_HASH_LEN]) message_encrypt() argument
473 message_decrypt(u8 *dst_plaintext, const u8 *src_ciphertext, size_t src_len, u8 key[NOISE_SYMMETRIC_KEY_LEN], u8 hash[NOISE_HASH_LEN]) message_decrypt() argument
485 message_ephemeral(u8 ephemeral_dst[NOISE_PUBLIC_KEY_LEN], const u8 ephemeral_src[NOISE_PUBLIC_KEY_LEN], u8 chaining_key[NOISE_HASH_LEN], u8 hash[NOISE_HASH_LEN]) message_ephemeral() argument
592 u8 hash[NOISE_HASH_LEN]; wg_noise_handshake_consume_initiation() local
735 u8 hash[NOISE_HASH_LEN]; wg_noise_handshake_consume_response() local
[all...]
/kernel/linux/linux-6.6/drivers/net/wireguard/
H A Dnoise.c82 memset(&handshake->hash, 0, NOISE_HASH_LEN); in handshake_zero()
432 static void mix_hash(u8 hash[NOISE_HASH_LEN], const u8 *src, size_t src_len) in mix_hash() argument
437 blake2s_update(&blake, hash, NOISE_HASH_LEN); in mix_hash()
439 blake2s_final(&blake, hash); in mix_hash()
442 static void mix_psk(u8 chaining_key[NOISE_HASH_LEN], u8 hash[NOISE_HASH_LEN], in mix_psk() argument
450 mix_hash(hash, temp_hash, NOISE_HASH_LEN); in mix_psk()
455 u8 hash[NOISE_HASH_LEN], in handshake_init()
458 memcpy(hash, handshake_init_hash, NOISE_HASH_LEN); in handshake_init()
460 mix_hash(hash, remote_static, NOISE_PUBLIC_KEY_LEN); in handshake_init()
465 u8 hash[NOISE_HASH_LE in message_encrypt()
454 handshake_init(u8 chaining_key[NOISE_HASH_LEN], u8 hash[NOISE_HASH_LEN], const u8 remote_static[NOISE_PUBLIC_KEY_LEN]) handshake_init() argument
463 message_encrypt(u8 *dst_ciphertext, const u8 *src_plaintext, size_t src_len, u8 key[NOISE_SYMMETRIC_KEY_LEN], u8 hash[NOISE_HASH_LEN]) message_encrypt() argument
473 message_decrypt(u8 *dst_plaintext, const u8 *src_ciphertext, size_t src_len, u8 key[NOISE_SYMMETRIC_KEY_LEN], u8 hash[NOISE_HASH_LEN]) message_decrypt() argument
485 message_ephemeral(u8 ephemeral_dst[NOISE_PUBLIC_KEY_LEN], const u8 ephemeral_src[NOISE_PUBLIC_KEY_LEN], u8 chaining_key[NOISE_HASH_LEN], u8 hash[NOISE_HASH_LEN]) message_ephemeral() argument
592 u8 hash[NOISE_HASH_LEN]; wg_noise_handshake_consume_initiation() local
735 u8 hash[NOISE_HASH_LEN]; wg_noise_handshake_consume_response() local
[all...]
/third_party/protobuf/csharp/src/Google.Protobuf/
H A DUnknownField.cs86 /// Get the hash code of the unknown field.
90 int hash = 43; in GetHashCode()
91 hash = hash * 47 + Lists.GetHashCode(varintList); in GetHashCode()
92 hash = hash * 47 + Lists.GetHashCode(fixed32List); in GetHashCode()
93 hash = hash * 47 + Lists.GetHashCode(fixed64List); in GetHashCode()
94 hash = hash * 4 in GetHashCode()
[all...]
/kernel/linux/linux-5.10/kernel/trace/
H A Dftrace.c35 #include <linux/hash.h>
64 /* hash bits for specific function selection */
403 struct hlist_head *hash; member
580 memset(stat->hash, 0, in ftrace_profile_reset()
647 if (stat->hash) { in ftrace_profile_init_cpu()
655 * functions are hit. We'll make a hash of 1024 items. in ftrace_profile_init_cpu()
659 stat->hash = kcalloc(size, sizeof(struct hlist_head), GFP_KERNEL); in ftrace_profile_init_cpu()
661 if (!stat->hash) in ftrace_profile_init_cpu()
666 kfree(stat->hash); in ftrace_profile_init_cpu()
667 stat->hash in ftrace_profile_init_cpu()
1104 ftrace_hash_key(struct ftrace_hash *hash, unsigned long ip) ftrace_hash_key() argument
1114 __ftrace_lookup_ip(struct ftrace_hash *hash, unsigned long ip) __ftrace_lookup_ip() argument
1141 ftrace_lookup_ip(struct ftrace_hash *hash, unsigned long ip) ftrace_lookup_ip() argument
1149 __add_hash_entry(struct ftrace_hash *hash, struct ftrace_func_entry *entry) __add_hash_entry() argument
1161 add_hash_entry(struct ftrace_hash *hash, unsigned long ip) add_hash_entry() argument
1176 free_hash_entry(struct ftrace_hash *hash, struct ftrace_func_entry *entry) free_hash_entry() argument
1185 remove_hash_entry(struct ftrace_hash *hash, struct ftrace_func_entry *entry) remove_hash_entry() argument
1192 ftrace_hash_clear(struct ftrace_hash *hash) ftrace_hash_clear() argument
1233 free_ftrace_hash(struct ftrace_hash *hash) free_ftrace_hash() argument
1244 struct ftrace_hash *hash; __free_ftrace_hash_rcu() local
1250 free_ftrace_hash_rcu(struct ftrace_hash *hash) free_ftrace_hash_rcu() argument
1266 struct ftrace_hash *hash; alloc_ftrace_hash() local
1317 alloc_and_copy_ftrace_hash(int size_bits, struct ftrace_hash *hash) alloc_and_copy_ftrace_hash() argument
1450 hash_contains_ip(unsigned long ip, struct ftrace_ops_hash *hash) hash_contains_ip() argument
1480 struct ftrace_ops_hash hash; ftrace_ops_test() local
1645 struct ftrace_hash *hash; __ftrace_hash_rec_update() local
1941 struct ftrace_hash *hash = ops->func_hash->filter_hash; ftrace_hash_ipmodify_enable() local
1952 struct ftrace_hash *hash = ops->func_hash->filter_hash; ftrace_hash_ipmodify_disable() local
3272 struct ftrace_hash *hash; global() member
3287 struct ftrace_hash *hash; t_probe_next() local
3776 struct ftrace_hash *hash; ftrace_regex_open() local
3933 enter_record(struct ftrace_hash *hash, struct dyn_ftrace *rec, int clear_filter) enter_record() argument
3956 add_rec_by_index(struct ftrace_hash *hash, struct ftrace_glob *func_g, int clear_filter) add_rec_by_index() argument
4019 match_records(struct ftrace_hash *hash, char *func, int len, char *mod) match_records() argument
4074 ftrace_match_records(struct ftrace_hash *hash, char *buff, int len) ftrace_match_records() argument
4110 ftrace_hash_move_and_update_ops(struct ftrace_ops *ops, struct ftrace_hash **orig_hash, struct ftrace_hash *hash, int enable) ftrace_hash_move_and_update_ops() argument
4294 ftrace_mod_callback(struct trace_array *tr, struct ftrace_hash *hash, char *func_orig, char *cmd, char *module, int enable) ftrace_mod_callback() argument
4358 struct ftrace_hash hash; global() member
4368 struct ftrace_hash *hash; allocate_ftrace_func_mapper() local
4539 struct ftrace_hash *hash; register_ftrace_function_probe() local
4683 struct ftrace_hash *hash = NULL; unregister_ftrace_function_probe_func() local
4862 struct ftrace_hash *hash = iter->hash; ftrace_process_regex() local
4950 ftrace_match_addr(struct ftrace_hash *hash, unsigned long ip, int remove) ftrace_match_addr() argument
4973 struct ftrace_hash *hash; ftrace_set_hash() local
5587 struct ftrace_hash *hash; set_ftrace_early_graph() local
5740 struct ftrace_hash *hash; global() member
6026 ftrace_graph_set_hash(struct ftrace_hash *hash, char *buffer) ftrace_graph_set_hash() argument
6381 clear_mod_from_hash(struct ftrace_page *pg, struct ftrace_hash *hash) clear_mod_from_hash() argument
6763 clear_func_from_hash(struct ftrace_init_func *func, struct ftrace_hash *hash) clear_func_from_hash() argument
[all...]
/third_party/pulseaudio/src/pulsecore/
H A Dhashmap.c94 /* Remove from hash table bucket list */ in remove_entry()
101 unsigned hash = h->hash_func(e->key) % NBUCKETS; in remove_entry() local
102 BY_HASH(h)[hash] = e->bucket_next; in remove_entry()
122 static struct hashmap_entry *hash_scan(const pa_hashmap *h, unsigned hash, const void *key) { in hash_scan() argument
125 pa_assert(hash < NBUCKETS); in hash_scan()
127 for (e = BY_HASH(h)[hash]; e; e = e->bucket_next) in hash_scan()
136 unsigned hash; in pa_hashmap_put() local
140 hash = h->hash_func(key) % NBUCKETS; in pa_hashmap_put()
142 if (hash_scan(h, hash, key)) in pa_hashmap_put()
151 /* Insert into hash tabl in pa_hashmap_put()
177 unsigned hash; pa_hashmap_get() local
192 unsigned hash; pa_hashmap_remove() local
[all...]
/third_party/mesa3d/src/util/
H A Dhash_table.c36 * Implements an open-addressing, linear-reprobing hash table.
60 * The hash table needs a particular pointer to be the marker for a key that
65 * struct hash_table. We tell the hash table to use "1" as the deleted key
79 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
81 * free to avoid exponential performance degradation as the hash table fills
179 /* mem_ctx is used to allocate the hash table, but the hash table is used in _mesa_hash_table_create()
237 * Frees the given hash table.
265 * Deletes all entries of the given hash table without deleting the table
309 hash_table_search(struct hash_table *ht, uint32_t hash, cons argument
352 _mesa_hash_table_search_pre_hashed(struct hash_table *ht, uint32_t hash, const void *key) _mesa_hash_table_search_pre_hashed() argument
364 hash_table_insert_rehash(struct hash_table *ht, uint32_t hash, const void *key, void *data) hash_table_insert_rehash() argument
430 hash_table_insert(struct hash_table *ht, uint32_t hash, const void *key, void *data) hash_table_insert() argument
513 _mesa_hash_table_insert_pre_hashed(struct hash_table *ht, uint32_t hash, const void *key, void *data) _mesa_hash_table_insert_pre_hashed() argument
668 uint32_t hash = 0; _mesa_hash_string_with_length() local
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/vmwgfx/
H A Dttm_object.c67 * ref_hash hash tables.
106 * @hash: Hash entry for the per-file object reference hash.
116 * This is similar to an idr object, but it also has a hash table entry
126 struct vmwgfx_hash_item hash; member
146 struct vmwgfx_hash_item *hash; in ttm_tfile_find_ref_rcu() local
148 hash_for_each_possible_rcu(tfile->ref_hash, hash, head, key) { in ttm_tfile_find_ref_rcu()
149 if (hash->key == key) { in ttm_tfile_find_ref_rcu()
150 *p_hash = hash; in ttm_tfile_find_ref_rcu()
161 struct vmwgfx_hash_item *hash; in ttm_tfile_find_ref() local
261 struct vmwgfx_hash_item *hash; ttm_base_object_lookup() local
299 struct vmwgfx_hash_item *hash; ttm_ref_object_add() local
368 struct vmwgfx_hash_item *hash; ttm_ref_object_base_unref() local
[all...]
/third_party/mbedtls/programs/psa/
H A Dpsa_hash.c2 * Example computing a SHA-256 hash using the PSA Crypto API
4 * The example computes the SHA-256 hash of a test string using the
8 * devices where a rolling hash needs to be computed.
31 * the hash data in the EXAMPLE_HASH_VALUE macro below. */
62 uint8_t hash[PSA_HASH_LENGTH(HASH_ALG)]; in main() local
75 /* Compute hash using multi-part operation */ in main()
78 mbedtls_printf("unknown hash algorithm supplied\n"); in main()
93 mbedtls_printf("PSA hash clone failed\n"); in main()
97 status = psa_hash_finish(&hash_operation, hash, sizeof(hash), in main()
[all...]
/kernel/linux/linux-5.10/security/selinux/ss/
H A Dcontext.c16 u32 hash = 0; in context_compute_hash() local
22 * policies should never meet, it is safe to hash valid and in context_compute_hash()
29 hash = jhash_3words(c->user, c->role, c->type, hash); in context_compute_hash()
30 hash = mls_range_hash(&c->range, hash); in context_compute_hash()
31 return hash; in context_compute_hash()
/kernel/linux/linux-6.6/security/selinux/ss/
H A Dcontext.c16 u32 hash = 0; in context_compute_hash() local
22 * policies should never meet, it is safe to hash valid and in context_compute_hash()
29 hash = jhash_3words(c->user, c->role, c->type, hash); in context_compute_hash()
30 hash = mls_range_hash(&c->range, hash); in context_compute_hash()
31 return hash; in context_compute_hash()
/kernel/liteos_a/fs/jffs2/include/
H A Dvfs_jffs2.h63 unsigned hash = 0; in full_name_hash() local
65 hash = (hash << 4) | (hash >> 28); in full_name_hash()
66 hash ^= *(name++); in full_name_hash()
68 return hash; in full_name_hash()
/third_party/node/deps/v8/src/utils/
H A Dutils.h243 uint32_t hash = key; in ComputeUnseededHash() local
244 hash = ~hash + (hash << 15); // hash = (hash << 15) - hash - 1; in ComputeUnseededHash()
245 hash = hash ^ (hash >> 1 in ComputeUnseededHash()
254 uint64_t hash = key; ComputeLongHash() local
[all...]
/kernel/linux/linux-5.10/net/batman-adv/
H A Dbridge_loop_avoidance.c46 #include "hash.h"
62 * @data: data to hash
63 * @size: size of the hash table
65 * Return: the hash index of the claim
70 u32 hash = 0; in batadv_choose_claim() local
72 hash = jhash(&claim->addr, sizeof(claim->addr), hash); in batadv_choose_claim()
73 hash = jhash(&claim->vid, sizeof(claim->vid), hash); in batadv_choose_claim()
75 return hash in batadv_choose_claim()
88 u32 hash = 0; batadv_choose_backbone_gw() local
222 struct batadv_hashtable *hash = bat_priv->bla.claim_hash; batadv_claim_hash_find() local
262 struct batadv_hashtable *hash = bat_priv->bla.backbone_hash; batadv_backbone_hash_find() local
301 struct batadv_hashtable *hash; batadv_bla_del_backbone_claims() local
600 struct batadv_hashtable *hash; batadv_bla_answer_request() local
1229 struct batadv_hashtable *hash; batadv_bla_purge_backbone_gw() local
1284 struct batadv_hashtable *hash; batadv_bla_purge_claims() local
1339 struct batadv_hashtable *hash; batadv_bla_update_orig_address() local
1437 struct batadv_hashtable *hash; batadv_bla_periodic_work() local
1741 struct batadv_hashtable *hash = bat_priv->bla.backbone_hash; batadv_bla_is_backbone_gw_orig() local
2140 struct batadv_hashtable *hash = bat_priv->bla.claim_hash; batadv_bla_claim_table_seq_print_text() local
2268 batadv_bla_claim_dump_bucket(struct sk_buff *msg, u32 portid, struct netlink_callback *cb, struct batadv_hard_iface *primary_if, struct batadv_hashtable *hash, unsigned int bucket, int *idx_skip) batadv_bla_claim_dump_bucket() argument
2312 struct batadv_hashtable *hash; batadv_bla_claim_dump() local
2374 struct batadv_hashtable *hash = bat_priv->bla.backbone_hash; batadv_bla_backbone_table_seq_print_text() local
2506 batadv_bla_backbone_dump_bucket(struct sk_buff *msg, u32 portid, struct netlink_callback *cb, struct batadv_hard_iface *primary_if, struct batadv_hashtable *hash, unsigned int bucket, int *idx_skip) batadv_bla_backbone_dump_bucket() argument
2550 struct batadv_hashtable *hash; batadv_bla_backbone_dump() local
[all...]
H A Ddistributed-arp-table.c45 #include "hash.h"
162 spinlock_t *list_lock; /* protects write access to the hash lists */ in __batadv_dat_purge()
168 if (!bat_priv->dat.hash) in __batadv_dat_purge()
171 for (i = 0; i < bat_priv->dat.hash->size; i++) { in __batadv_dat_purge()
172 head = &bat_priv->dat.hash->table[i]; in __batadv_dat_purge()
173 list_lock = &bat_priv->dat.hash->list_locks[i]; in __batadv_dat_purge()
193 * DAT hash table
211 * batadv_compare_dat() - comparing function used in the local DAT hash table
281 * batadv_hash_dat() - compute the hash value for an IP address
282 * @data: data to hash
289 u32 hash = 0; batadv_hash_dat() local
332 struct batadv_hashtable *hash = bat_priv->dat.hash; batadv_dat_entry_hash_find() local
569 struct batadv_hashtable *hash = bat_priv->orig_hash; batadv_choose_next_candidate() local
860 struct batadv_hashtable *hash = bat_priv->dat.hash; batadv_dat_cache_seq_print_text() local
957 batadv_dat_cache_dump_bucket(struct sk_buff *msg, u32 portid, struct netlink_callback *cb, struct batadv_hashtable *hash, unsigned int bucket, int *idx_skip) batadv_dat_cache_dump_bucket() argument
1000 struct batadv_hashtable *hash; batadv_dat_cache_dump() local
[all...]
/third_party/node/test/fixtures/crypto/
H A Drsa_pss.js86 hash: 'SHA-1',
94 hash: 'SHA-256',
102 hash: 'SHA-384',
110 hash: 'SHA-512',
118 hash: 'SHA-1',
126 hash: 'SHA-256',
134 hash: 'SHA-384',
142 hash: 'SHA-512',
/third_party/node/test/fixtures/wpt/WebCryptoAPI/sign_verify/
H A Drsa_pss_vectors.js27 // For verification tests. Note that "salted" signatures use a salt length equal to the hash size
49 hash: "SHA-1",
62 hash: "SHA-256",
75 hash: "SHA-384",
88 hash: "SHA-512",
101 hash: "SHA-1",
114 hash: "SHA-256",
127 hash: "SHA-384",
140 hash: "SHA-512",
/third_party/rust/crates/libc/src/unix/bsd/netbsdlike/netbsd/
H A Daarch64.rs75 impl ::hash::Hash for __c_anonymous__freg {
76 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
78 self.__b8.hash(state); in hash()
79 self.__h16.hash(state); in hash()
80 self.__s32.hash(state); in hash()
81 self.__d64.hash(state); in hash()
82 self.__q128.hash(state); in hash()
/third_party/vk-gl-cts/framework/delibs/depool/
H A DdePoolHashArray.h23 * \brief Memory pool hash-array class.
37 * \brief Declare a template pool hash-array (array with hash) class interface.
38 * \param TYPENAME Type name of the declared hash-array.
46 * The functions for operating the hash are:
66 TYPENAME##Hash* hash; \
85 int* ndxPtr = TYPENAME##Hash_find(hashArray->hash, key); \
102 TYPENAME##Hash_reset(hashArray->hash); \
109 * \brief Implement a template pool hash-array class.
110 * \param TYPENAME Type name of the declared hash
[all...]
/third_party/mesa3d/src/gallium/drivers/zink/
H A Dzink_descriptors.c59 uint32_t hash; member
128 sampler_view->buffer_view->hash : sampler_view->image_view->hash; in get_sampler_view_hash()
137 image_view->buffer_view->hash : image_view->surface->hash; in get_image_view_hash()
160 return dsurf->is_buffer ? (dsurf->bufferview ? dsurf->bufferview->hash : zink_screen(ctx->base.screen)->null_descriptor_hashes.buffer_view) : in get_descriptor_surface_hash()
161 (dsurf->surface ? dsurf->surface->hash : zink_screen(ctx->base.screen)->null_descriptor_hashes.image_view); in get_descriptor_surface_hash()
185 uint32_t hash = 0; in desc_state_hash() local
190 hash ^= d_key->state[i]; in desc_state_hash()
192 hash in desc_state_hash()
389 uint32_t hash = 0; hash_descriptor_layout() local
442 uint32_t hash = 0; zink_descriptor_util_layout_get() local
468 uint32_t hash = 0; hash_descriptor_pool_key() local
494 uint32_t hash = 0; zink_descriptor_util_pool_key_get() local
592 uint32_t hash = 0; descriptor_pool_get() local
797 uint32_t hash = push_set ? ctx->dd->push_state[is_compute] : zink_descriptor_set_get() local
1613 calc_descriptor_state_hash_ubo(struct zink_context *ctx, struct zink_shader *zs, enum pipe_shader_type shader, int i, int idx, uint32_t hash, bool need_offset) calc_descriptor_state_hash_ubo() argument
1629 calc_descriptor_state_hash_ssbo(struct zink_context *ctx, struct zink_shader *zs, enum pipe_shader_type shader, int i, int idx, uint32_t hash) calc_descriptor_state_hash_ssbo() argument
1650 calc_descriptor_state_hash_sampler(struct zink_context *ctx, struct zink_shader *zs, enum pipe_shader_type shader, int i, int idx, uint32_t hash) calc_descriptor_state_hash_sampler() argument
1672 calc_descriptor_state_hash_image(struct zink_context *ctx, struct zink_shader *zs, enum pipe_shader_type shader, int i, int idx, uint32_t hash) calc_descriptor_state_hash_image() argument
1688 uint32_t hash = 0; update_descriptor_stage_state() local
1767 uint32_t hash = 0; zink_context_update_descriptor_states() local
1808 uint32_t hash = 0; zink_context_update_descriptor_states() local
[all...]
/kernel/linux/linux-6.6/fs/ext4/
H A Dhash.c3 * linux/fs/ext4/hash.c
102 /* The old legacy hash */
105 __u32 hash, hash0 = 0x12a3fe2d, hash1 = 0x37abe8f9; in dx_hack_hash_unsigned() local
109 hash = hash1 + (hash0 ^ (((int) *ucp++) * 7152373)); in dx_hack_hash_unsigned()
111 if (hash & 0x80000000) in dx_hack_hash_unsigned()
112 hash -= 0x7fffffff; in dx_hack_hash_unsigned()
114 hash0 = hash; in dx_hack_hash_unsigned()
121 __u32 hash, hash0 = 0x12a3fe2d, hash1 = 0x37abe8f9; in dx_hack_hash_signed() local
125 hash = hash1 + (hash0 ^ (((int) *scp++) * 7152373)); in dx_hack_hash_signed()
127 if (hash in dx_hack_hash_signed()
203 __u32 hash; __ext4fs_dirhash() local
[all...]

Completed in 21 milliseconds

12345678910>>...158