Home
last modified time | relevance | path

Searched refs:hash (Results 51 - 75 of 4163) sorted by relevance

12345678910>>...167

/third_party/rust/crates/cxx/gen/cmd/src/syntax/
H A Dimpls.rs4 use std::hash::{Hash, Hasher};
43 fn hash<H: Hasher>(&self, state: &mut H) { in hash() functions
44 mem::discriminant(self).hash(state); in hash()
46 Type::Ident(t) => t.hash(state), in hash()
47 Type::RustBox(t) => t.hash(state), in hash()
48 Type::UniquePtr(t) => t.hash(state), in hash()
49 Type::SharedPtr(t) => t.hash(state), in hash()
50 Type::WeakPtr(t) => t.hash(state), in hash()
51 Type::Ref(t) => t.hash(state), in hash()
52 Type::Ptr(t) => t.hash(stat in hash()
105 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
139 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
178 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
218 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
256 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
294 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
366 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
432 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/ltp/metadata/
H A Ddata_storage.h53 struct data_node_hash hash; member
66 return "hash"; in data_type_name()
115 node->hash.elems_len = MAX_ELEMS; in data_node_hash()
116 node->hash.elems_used = 0; in data_node_hash()
142 struct data_node_hash *hash = &self->hash; in data_node_hash_add() local
144 if (hash->elems_used == hash->elems_len) in data_node_hash_add()
147 struct data_hash_elem *elem = &hash->elems[hash in data_node_hash_add()
181 struct data_node_hash *hash = &self->hash; data_node_hash_del() local
202 struct data_node_hash *hash = &self->hash; data_node_hash_get() local
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/freescale/fman/
H A Dfman_mac.h224 static inline void free_hash_table(struct eth_hash_t *hash) in free_hash_table() argument
229 if (hash) { in free_hash_table()
230 if (hash->lsts) { in free_hash_table()
231 for (i = 0; i < hash->size; i++) { in free_hash_table()
233 dequeue_addr_from_hash_entry(&hash->lsts[i]); in free_hash_table()
237 dequeue_addr_from_hash_entry(&hash-> in free_hash_table()
242 kfree(hash->lsts); in free_hash_table()
245 kfree(hash); in free_hash_table()
252 struct eth_hash_t *hash; in alloc_hash_table() local
254 /* Allocate address hash tabl in alloc_hash_table()
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/freescale/fman/
H A Dfman_mac.h196 static inline void free_hash_table(struct eth_hash_t *hash) in free_hash_table() argument
201 if (hash) { in free_hash_table()
202 if (hash->lsts) { in free_hash_table()
203 for (i = 0; i < hash->size; i++) { in free_hash_table()
205 dequeue_addr_from_hash_entry(&hash->lsts[i]); in free_hash_table()
209 dequeue_addr_from_hash_entry(&hash-> in free_hash_table()
214 kfree(hash->lsts); in free_hash_table()
217 kfree(hash); in free_hash_table()
224 struct eth_hash_t *hash; in alloc_hash_table() local
226 /* Allocate address hash tabl in alloc_hash_table()
[all...]
/third_party/gn/src/gn/
H A Dstring_atom.cc44 // A HashTableBase node type that stores one hash value and one string pointer.
46 size_t hash; member
52 size_t hash_value() const { return hash; } in hash_value()
58 // This is a trivial hash table of string pointers, using open addressing.
64 // 1) Compute string hash value.
66 // 2) Call Lookup() with the hash value and the string_view key,
71 // and call Insert(), passing the |node|, |hash| and new string
78 // Compute hash for |str|. Replace with faster hash function if available.
80 return std::hash<st in Hash()
101 Insert(Node* node, size_t hash, KeyType key) Insert() argument
118 size_t hash = set_.Hash(""); StringAtomSet() local
126 size_t hash = set_.Hash(key); find() local
193 size_t hash = local_set_.Hash(key); find() local
[all...]
/third_party/rust/crates/libc/src/unix/bsd/freebsdlike/freebsd/
H A Driscv64.rs80 impl ::hash::Hash for gpregs {
81 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
82 self.gp_ra.hash(state); in hash()
83 self.gp_sp.hash(state); in hash()
84 self.gp_gp.hash(state); in hash()
85 self.gp_tp.hash(state); in hash()
86 self.gp_t.hash(state); in hash()
87 self.gp_s.hash(state); in hash()
88 self.gp_a.hash(stat in hash()
113 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
142 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/node/deps/v8/src/base/
H A Dhashmap-entry.h20 // HashMap entries are (key, value, hash) triplets, with a boolean indicating if
30 uint32_t hash; // The full hash value for key member
32 TemplateHashMapEntry(Key key, Value value, uint32_t hash) in TemplateHashMapEntry()
33 : key(key), value(value), hash(hash), exists_(true) {} in TemplateHashMapEntry()
50 uint32_t hash; // The full hash value for key member
52 TemplateHashMapEntry(Key* key, Value value, uint32_t hash) in TemplateHashMapEntry()
53 : key(key), value(value), hash(has in TemplateHashMapEntry()
67 uint32_t hash; // The full hash value for key global() member
87 uint32_t hash; // The full hash value for key global() member
[all...]
/third_party/rust/crates/libc/src/unix/bsd/freebsdlike/freebsd/x86_64/
H A Dmod.rs139 impl ::hash::Hash for fpreg32 {
140 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
141 self.fpr_env.hash(state); in hash()
142 self.fpr_acc.hash(state); in hash()
143 self.fpr_ex_sw.hash(state); in hash()
144 self.fpr_pad.hash(state); in hash()
167 impl ::hash::Hash for fpreg {
168 fn hash<H: ::hash functions
199 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
290 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/skia/third_party/externals/tint/src/utils/
H A Dhash.h48 /// HashCombine "hashes" together an existing hash and hashable values.
50 void HashCombine(size_t* hash, const T& value) { in HashCombine() argument
52 *hash ^= std::hash<T>()(value) + offset + (*hash << 6) + (*hash >> 2); in HashCombine()
55 /// HashCombine "hashes" together an existing hash and hashable values.
57 void HashCombine(size_t* hash, const std::vector<T>& vector) { in HashCombine() argument
58 HashCombine(hash, vector.size()); in HashCombine()
60 HashCombine(hash, e in HashCombine()
66 HashCombine(size_t* hash, const T& value, const ARGS&... args) HashCombine() argument
75 size_t hash = 102931; // seed with an arbitrary prime Hash() local
[all...]
/kernel/linux/linux-6.6/lib/
H A Dhashtable_test.c37 DEFINE_HASHTABLE(hash, 1); in hashtable_test_hash_empty()
39 KUNIT_EXPECT_TRUE(test, hash_empty(hash)); in hashtable_test_hash_empty()
43 hash_add(hash, &a.node, a.key); in hashtable_test_hash_empty()
46 KUNIT_EXPECT_FALSE(test, hash_empty(hash)); in hashtable_test_hash_empty()
52 DEFINE_HASHTABLE(hash, 4); in hashtable_test_hash_hashed()
56 hash_add(hash, &a.node, a.key); in hashtable_test_hash_hashed()
59 hash_add(hash, &b.node, b.key); in hashtable_test_hash_hashed()
69 DEFINE_HASHTABLE(hash, 3); in hashtable_test_hash_add()
74 hash_add(hash, &a.node, a.key); in hashtable_test_hash_add()
78 hash_add(hash, in hashtable_test_hash_add()
[all...]
/third_party/mbedtls/tests/src/drivers/
H A Dtest_driver_signature.c20 #include "test/drivers/hash.h"
22 #include "test/drivers/hash.h"
46 const uint8_t *hash, in sign_hash()
61 alg, hash, hash_length, in sign_hash()
68 alg, hash, hash_length, in sign_hash()
82 alg, hash, hash_length, in sign_hash()
89 alg, hash, hash_length, in sign_hash()
101 (void) hash; in sign_hash()
114 const uint8_t *hash, in verify_hash()
128 alg, hash, hash_lengt in verify_hash()
41 sign_hash( const psa_key_attributes_t *attributes, const uint8_t *key_buffer, size_t key_buffer_size, psa_algorithm_t alg, const uint8_t *hash, size_t hash_length, uint8_t *signature, size_t signature_size, size_t *signature_length) sign_hash() argument
109 verify_hash( const psa_key_attributes_t *attributes, const uint8_t *key_buffer, size_t key_buffer_size, psa_algorithm_t alg, const uint8_t *hash, size_t hash_length, const uint8_t *signature, size_t signature_length) verify_hash() argument
188 uint8_t hash[PSA_HASH_MAX_SIZE]; mbedtls_test_transparent_signature_sign_message() local
267 uint8_t hash[PSA_HASH_MAX_SIZE]; mbedtls_test_transparent_signature_verify_message() local
320 mbedtls_test_transparent_signature_sign_hash( const psa_key_attributes_t *attributes, const uint8_t *key_buffer, size_t key_buffer_size, psa_algorithm_t alg, const uint8_t *hash, size_t hash_length, uint8_t *signature, size_t signature_size, size_t *signature_length) mbedtls_test_transparent_signature_sign_hash() argument
348 mbedtls_test_opaque_signature_sign_hash( const psa_key_attributes_t *attributes, const uint8_t *key, size_t key_length, psa_algorithm_t alg, const uint8_t *hash, size_t hash_length, uint8_t *signature, size_t signature_size, size_t *signature_length) mbedtls_test_opaque_signature_sign_hash() argument
368 mbedtls_test_transparent_signature_verify_hash( const psa_key_attributes_t *attributes, const uint8_t *key_buffer, size_t key_buffer_size, psa_algorithm_t alg, const uint8_t *hash, size_t hash_length, const uint8_t *signature, size_t signature_length) mbedtls_test_transparent_signature_verify_hash() argument
386 mbedtls_test_opaque_signature_verify_hash( const psa_key_attributes_t *attributes, const uint8_t *key, size_t key_length, psa_algorithm_t alg, const uint8_t *hash, size_t hash_length, const uint8_t *signature, size_t signature_length) mbedtls_test_opaque_signature_verify_hash() argument
[all...]
/third_party/node/test/pummel/
H A Dtest-webcrypto-derivebits-pbkdf2.js16 function getDeriveKeyInfo(name, length, hash, ...usages) {
17 return [{ name, length, hash }, usages];
417 hash,
422 hash,
431 kDerivations[size][saltSize][hash][iterations]);
438 hash,
444 hash,
474 hash,
484 hash: hash
[all...]
/third_party/rust/crates/libc/src/unix/bsd/freebsdlike/freebsd/freebsd13/
H A Dmod.rs340 impl ::hash::Hash for statfs {
341 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
342 self.f_version.hash(state); in hash()
343 self.f_type.hash(state); in hash()
344 self.f_flags.hash(state); in hash()
345 self.f_bsize.hash(state); in hash()
346 self.f_iosize.hash(state); in hash()
347 self.f_blocks.hash(state); in hash()
348 self.f_bfree.hash(stat in hash()
394 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
437 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/rust/crates/libc/src/unix/bsd/freebsdlike/freebsd/freebsd14/
H A Dmod.rs340 impl ::hash::Hash for statfs {
341 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
342 self.f_version.hash(state); in hash()
343 self.f_type.hash(state); in hash()
344 self.f_flags.hash(state); in hash()
345 self.f_bsize.hash(state); in hash()
346 self.f_iosize.hash(state); in hash()
347 self.f_blocks.hash(state); in hash()
348 self.f_bfree.hash(stat in hash()
394 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
437 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/rust/crates/libc/src/unix/bsd/freebsdlike/freebsd/freebsd12/
H A Dmod.rs330 impl ::hash::Hash for statfs {
331 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
332 self.f_version.hash(state); in hash()
333 self.f_type.hash(state); in hash()
334 self.f_flags.hash(state); in hash()
335 self.f_bsize.hash(state); in hash()
336 self.f_iosize.hash(state); in hash()
337 self.f_blocks.hash(state); in hash()
338 self.f_bfree.hash(stat in hash()
384 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
427 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/pulseaudio/src/pulsecore/
H A Didxset.c62 unsigned hash = 0; in pa_idxset_string_hash_func() local
66 hash = 31 * hash + (unsigned) *c; in pa_idxset_string_hash_func()
68 return hash; in pa_idxset_string_hash_func()
113 /* Remove from data hash table */ in remove_entry()
120 unsigned hash = s->hash_func(e->data) % NBUCKETS; in remove_entry() local
121 BY_DATA(s)[hash] = e->data_next; in remove_entry()
124 /* Remove from index hash table */ in remove_entry()
147 static struct idxset_entry* data_scan(pa_idxset *s, unsigned hash, const void *p) { in data_scan() argument
150 pa_assert(hash < NBUCKET in data_scan()
160 index_scan(pa_idxset *s, unsigned hash, uint32_t idx) index_scan() argument
173 unsigned hash; pa_idxset_put() local
231 unsigned hash; pa_idxset_get_by_index() local
245 unsigned hash; pa_idxset_get_by_data() local
263 unsigned hash; pa_idxset_remove_by_index() local
281 unsigned hash; pa_idxset_remove_by_data() local
315 unsigned hash; pa_idxset_rrobin() local
405 unsigned hash; pa_idxset_next() local
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/vboxvideo/
H A Dvbox_hgsmi.c11 /* One-at-a-Time Hash from https://www.burtleburtle.net/bob/hash/doobs.html */
12 static u32 hgsmi_hash_process(u32 hash, const u8 *data, int size) in hgsmi_hash_process() argument
15 hash += *data++; in hgsmi_hash_process()
16 hash += (hash << 10); in hgsmi_hash_process()
17 hash ^= (hash >> 6); in hgsmi_hash_process()
20 return hash; in hgsmi_hash_process()
23 static u32 hgsmi_hash_end(u32 hash) in hgsmi_hash_end() argument
25 hash in hgsmi_hash_end()
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/vboxvideo/
H A Dvbox_hgsmi.c11 /* One-at-a-Time Hash from https://www.burtleburtle.net/bob/hash/doobs.html */
12 static u32 hgsmi_hash_process(u32 hash, const u8 *data, int size) in hgsmi_hash_process() argument
15 hash += *data++; in hgsmi_hash_process()
16 hash += (hash << 10); in hgsmi_hash_process()
17 hash ^= (hash >> 6); in hgsmi_hash_process()
20 return hash; in hgsmi_hash_process()
23 static u32 hgsmi_hash_end(u32 hash) in hgsmi_hash_end() argument
25 hash in hgsmi_hash_end()
[all...]
/third_party/lzma/C/
H A DLzFind.c238 p->hash = NULL; in MatchFinder_Construct()
256 ISzAlloc_Free(alloc, p->hash); in MatchFinder_FreeThisClassMemory()
257 p->hash = NULL; in MatchFinder_FreeThisClassMemory()
474 if (p->hash && p->numRefs >= newSize) in MatchFinder_Create()
479 p->hash = AllocRefs(newSize, alloc); in MatchFinder_Create()
481 if (p->hash) in MatchFinder_Create()
483 p->son = p->hash + hashSizeSum; in MatchFinder_Create()
536 CLzRef *items = p->hash; in MatchFinder_Init_LowHash()
546 CLzRef *items = p->hash + p->fixedHashSize; in MatchFinder_Init_HighHash()
558 /* kEmptyHashValue = 0 (Zero) is used in hash table in MatchFinder_Init_4()
1166 UInt32 *hash; Bt3_MatchFinder_GetMatches() local
1171 hash = p->hash; Bt3_MatchFinder_GetMatches() local
1207 UInt32 *hash; Bt4_MatchFinder_GetMatches() local
1212 hash = p->hash; Bt4_MatchFinder_GetMatches() local
1274 UInt32 *hash; Bt5_MatchFinder_GetMatches() local
1279 hash = p->hash; Bt5_MatchFinder_GetMatches() local
1347 UInt32 *hash; Hc4_MatchFinder_GetMatches() local
1352 hash = p->hash; Hc4_MatchFinder_GetMatches() local
1414 UInt32 *hash; Hc5_MatchFinder_GetMatches() local
1419 hash = p->hash; Hc5_MatchFinder_GetMatches() local
1519 UInt32 *hash; Bt3_MatchFinder_Skip() local
1521 hash = p->hash; Bt3_MatchFinder_Skip() local
1534 UInt32 *hash; Bt4_MatchFinder_Skip() local
1536 hash = p->hash; Bt4_MatchFinder_Skip() local
1550 UInt32 *hash; Bt5_MatchFinder_Skip() local
1552 hash = p->hash; Bt5_MatchFinder_Skip() local
[all...]
/third_party/rust/crates/syn/src/
H A Dtt.rs2 use std::hash::{Hash, Hasher};
49 fn hash<H: Hasher>(&self, h: &mut H) { in hash() functions
54 0u8.hash(h); in hash()
56 Delimiter::Parenthesis => 0u8.hash(h), in hash()
57 Delimiter::Brace => 1u8.hash(h), in hash()
58 Delimiter::Bracket => 2u8.hash(h), in hash()
59 Delimiter::None => 3u8.hash(h), in hash()
63 TokenTreeHelper(&item).hash(h); in hash()
65 0xffu8.hash(h); // terminator w/ a variant we don't normally hash in hash()
100 fn hash<H: Hasher>(&self, state: &mut H) { hash() functions
[all...]
/third_party/mesa3d/src/mesa/program/
H A Dprog_cache.c40 GLuint hash; member
57 * Compute hash index from state key.
63 GLuint hash = 0, i; in hash_key() local
67 /* Make a slightly better attempt at a hash function: in hash_key()
71 hash += ikey[i]; in hash_key()
72 hash += (hash << 10); in hash_key()
73 hash ^= (hash >> 6); in hash_key()
76 return hash; in hash_key()
185 const GLuint hash = hash_key(key, keysize); _mesa_search_program_cache() local
209 const GLuint hash = hash_key(key, keysize); _mesa_program_cache_insert() local
238 const GLuint hash = hash_key(key, keysize); _mesa_shader_cache_insert() local
[all...]
/third_party/rust/crates/libc/src/unix/bsd/freebsdlike/freebsd/freebsd11/
H A Dmod.rs321 impl ::hash::Hash for statfs {
322 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
323 self.f_version.hash(state); in hash()
324 self.f_type.hash(state); in hash()
325 self.f_flags.hash(state); in hash()
326 self.f_bsize.hash(state); in hash()
327 self.f_iosize.hash(state); in hash()
328 self.f_blocks.hash(state); in hash()
329 self.f_bfree.hash(stat in hash()
372 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
414 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
[all...]
/kernel/linux/linux-6.6/arch/powerpc/crypto/
H A Daes-gcm-p10-glue.c17 #include <crypto/internal/hash.h>
77 static void set_subkey(unsigned char *hash) in set_subkey() argument
79 *(u64 *)&hash[0] = be64_to_cpup((__be64 *)&hash[0]); in set_subkey()
80 *(u64 *)&hash[8] = be64_to_cpup((__be64 *)&hash[8]); in set_subkey()
87 static void set_aad(struct gcm_ctx *gctx, struct Hash_ctx *hash, in set_aad() argument
96 gcm_ghash_p10(nXi, hash->Htable+32, aad, i); in set_aad()
105 gcm_ghash_p10(gctx->aad_hash, hash->Htable+32, nXi, 16); in set_aad()
110 memcpy(hash in set_aad()
113 gcmp10_init(struct gcm_ctx *gctx, u8 *iv, unsigned char *rdkey, struct Hash_ctx *hash, u8 *assoc, unsigned int assoclen) gcmp10_init() argument
141 finish_tag(struct gcm_ctx *gctx, struct Hash_ctx *hash, int len) finish_tag() argument
208 struct Hash_ctx *hash = PTR_ALIGN((void *)hashbuf, PPC_ALIGN); p10_aes_gcm_crypt() local
[all...]
/third_party/rust/crates/rust-openssl/openssl/src/
H A Dsha.rs7 //! This property makes hash algorithms like these excellent for uses such as verifying the
8 //! contents of a file- if you know the hash you expect beforehand, then you can verify that the
24 //! let hash = hasher.finish();
25 //! println!("Hashed \"Hello, world\" to {}", hex::encode(hash));
28 //! On the other hand, if you already have access to all of the data you would like to hash, you
29 //! may prefer to use the slightly simpler method of simply calling the hash function corresponding
35 //! let hash = sha256(b"your data or message");
36 //! println!("Hash = {}", hex::encode(hash));
43 /// Computes the SHA1 hash of some data.
53 let mut hash variables
64 let mut hash = MaybeUninit::<[u8; 28]>::uninit(); global() variables
75 let mut hash = MaybeUninit::<[u8; 32]>::uninit(); global() variables
86 let mut hash = MaybeUninit::<[u8; 48]>::uninit(); global() variables
97 let mut hash = MaybeUninit::<[u8; 64]>::uninit(); global() variables
149 let mut hash = MaybeUninit::<[u8; 20]>::uninit(); global() variables
195 let mut hash = MaybeUninit::<[u8; 28]>::uninit(); global() variables
241 let mut hash = MaybeUninit::<[u8; 32]>::uninit(); global() variables
287 let mut hash = MaybeUninit::<[u8; 48]>::uninit(); global() variables
333 let mut hash= MaybeUninit::<[u8; 64]>::uninit(); global() variables
[all...]
/third_party/rust/crates/rustc-hash/src/
H A Dlib.rs11 //! Fast, non-cryptographic hash used by rustc and Firefox.
34 use core::hash::BuildHasherDefault;
35 use core::hash::Hasher;
41 /// Type alias for a hashmap using the `fx` hash algorithm.
45 /// Type alias for a hashmap using the `fx` hash algorithm.
49 /// A speedy hash algorithm for use within rustc. The hashmap in liballoc
52 /// non-cryptographic hash.
56 /// 64-bit hash values instead of 32-bit hash values. It consistently
57 /// out-performs an FNV-based hash withi
91 let mut hash = FxHasher { hash: self.hash }; write() variables
[all...]

Completed in 13 milliseconds

12345678910>>...167