Home
last modified time | relevance | path

Searched refs:hash (Results 301 - 325 of 4194) sorted by relevance

1...<<11121314151617181920>>...168

/kernel/linux/linux-5.10/security/integrity/platform_certs/
H A Dkeyring_handler.c19 * Blacklist a hash.
25 char *hash, *p; in uefi_blacklist_hash() local
27 hash = kmalloc(type_len + len * 2 + 1, GFP_KERNEL); in uefi_blacklist_hash()
28 if (!hash) in uefi_blacklist_hash()
30 p = memcpy(hash, type, type_len); in uefi_blacklist_hash()
36 mark_hash_blacklisted(hash); in uefi_blacklist_hash()
37 kfree(hash); in uefi_blacklist_hash()
41 * Blacklist an X509 TBS hash.
50 * Blacklist the hash of an executable.
/kernel/linux/linux-6.6/drivers/accessibility/speakup/
H A Dutils.h58 int hash = 0; in hash_name() local
61 hash = (hash * 17) & 0xfffffff; in hash_name()
64 hash += (int)*pn; in hash_name()
67 hash %= HASHSIZE; in hash_name()
68 return &key_table[hash]; in hash_name()
/third_party/skia/third_party/externals/swiftshader/src/Device/
H A DVertexProcessor.cpp38 uint32_t hash = 0; in computeHash() local
42 hash ^= state[i]; in computeHash()
45 return hash; in computeHash()
50 if(hash != state.hash) in operator ==()
86 state.hash = state.computeHash(); in update()
/kernel/linux/linux-5.10/net/netfilter/
H A Dnft_set_hash.c24 /* We target a hash table size of 4, element hint is 75% of final size */
475 u32 hash; in nft_hash_lookup() local
477 hash = jhash(key, set->klen, priv->seed); in nft_hash_lookup()
478 hash = reciprocal_scale(hash, priv->buckets); in nft_hash_lookup()
479 hlist_for_each_entry_rcu(he, &priv->table[hash], node) { in nft_hash_lookup()
495 u32 hash; in nft_hash_get() local
497 hash = jhash(elem->key.val.data, set->klen, priv->seed); in nft_hash_get()
498 hash = reciprocal_scale(hash, pri in nft_hash_get()
514 u32 hash, k1, k2; nft_hash_lookup_fast() local
534 u32 hash, k1; nft_jhash() local
554 u32 hash; nft_hash_insert() local
593 u32 hash; nft_hash_deactivate() local
[all...]
/kernel/linux/linux-6.6/net/netfilter/
H A Dnft_set_hash.c21 /* We target a hash table size of 4, element hint is 75% of final size */
490 u32 hash; in nft_hash_lookup() local
492 hash = jhash(key, set->klen, priv->seed); in nft_hash_lookup()
493 hash = reciprocal_scale(hash, priv->buckets); in nft_hash_lookup()
494 hlist_for_each_entry_rcu(he, &priv->table[hash], node) { in nft_hash_lookup()
510 u32 hash; in nft_hash_get() local
512 hash = jhash(elem->key.val.data, set->klen, priv->seed); in nft_hash_get()
513 hash = reciprocal_scale(hash, pri in nft_hash_get()
530 u32 hash, k1, k2; nft_hash_lookup_fast() local
550 u32 hash, k1; nft_jhash() local
570 u32 hash; nft_hash_insert() local
609 u32 hash; nft_hash_deactivate() local
[all...]
/kernel/linux/linux-5.10/kernel/bpf/
H A Dhashtab.c99 u32 n_buckets; /* number of hash buckets */
121 u32 hash; member
236 u32 hash) in prealloc_lru_pop()
238 struct bpf_lru_node *node = bpf_lru_pop_free(&htab->lru, hash); in prealloc_lru_pop()
282 offsetof(struct htab_elem, hash) - in prealloc_init()
446 /* hash table size must be power of 2; roundup_pow_of_two() can overflow in htab_map_alloc()
527 static inline struct bucket *__select_bucket(struct bpf_htab *htab, u32 hash) in __select_bucket() argument
529 return &htab->buckets[hash & (htab->n_buckets - 1)]; in __select_bucket()
532 static inline struct hlist_nulls_head *select_bucket(struct bpf_htab *htab, u32 hash) in select_bucket() argument
534 return &__select_bucket(htab, hash) in select_bucket()
235 prealloc_lru_pop(struct bpf_htab *htab, void *key, u32 hash) prealloc_lru_pop() argument
538 lookup_elem_raw(struct hlist_nulls_head *head, u32 hash, void *key, u32 key_size) lookup_elem_raw() argument
555 lookup_nulls_elem_raw(struct hlist_nulls_head *head, u32 hash, void *key, u32 key_size, u32 n_buckets) lookup_nulls_elem_raw() argument
583 u32 hash, key_size; __htab_map_lookup_elem() local
718 u32 hash, key_size; htab_map_get_next_key() local
860 alloc_htab_elem(struct bpf_htab *htab, void *key, void *value, u32 key_size, u32 hash, bool percpu, bool onallcpus, struct htab_elem *old_elem) alloc_htab_elem() argument
967 u32 key_size, hash; htab_map_update_elem() local
1058 u32 key_size, hash; htab_lru_map_update_elem() local
1122 u32 key_size, hash; __htab_percpu_map_update_elem() local
1174 u32 key_size, hash; __htab_lru_percpu_map_update_elem() local
1250 u32 hash, key_size; htab_map_delete_elem() local
1282 u32 hash, key_size; htab_lru_map_delete_elem() local
[all...]
/third_party/rust/crates/libc/src/unix/bsd/freebsdlike/freebsd/
H A Dmod.rs1259 impl ::hash::Hash for utmpx {
1260 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
1261 self.ut_type.hash(state); in hash()
1262 self.ut_tv.hash(state); in hash()
1263 self.ut_id.hash(state); in hash()
1264 self.ut_pid.hash(state); in hash()
1265 self.ut_user.hash(state); in hash()
1266 self.ut_line.hash(state); in hash()
1267 self.ut_host.hash(stat in hash()
1290 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1327 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1371 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1403 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1433 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1461 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1565 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1599 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1630 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1656 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1689 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1723 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1753 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1783 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
1853 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { hash() functions
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/vmwgfx/
H A Dvmwgfx_validation.c35 * @hash: A hash entry used for the duplicate detection hash table.
46 struct drm_hash_item hash; member
55 * @hash: A hash entry used for the duplicate detection hash table.
74 struct drm_hash_item hash; member
186 struct drm_hash_item *hash; in vmw_validation_find_bo_dup() local
188 if (!drm_ht_find_item(ctx->ht, (unsigned long) vbo, &hash)) in vmw_validation_find_bo_dup()
223 struct drm_hash_item *hash; vmw_validation_find_res_dup() local
[all...]
/third_party/node/test/fixtures/wpt/WebCryptoAPI/sign_verify/
H A Decdsa.js19 var algorithm = {name: vector.algorithmName, hash: vector.hashName};
46 var algorithm = {name: vector.algorithmName, hash: vector.hashName};
72 var algorithm = {name: vector.algorithmName, hash: vector.hashName};
98 var algorithm = {name: vector.algorithmName, hash: vector.hashName};
121 var algorithm = {name: vector.algorithmName, hash: vector.hashName};
145 var algorithm = {name: vector.algorithmName, hash: vector.hashName};
167 var algorithm = {name: vector.algorithmName, hash: vector.hashName};
198 var promise = subtle.generateKey({name: "HMAC", hash: "SHA-1"}, false, ["sign", "verify"])
200 var algorithm = {name: vector.algorithmName, hash: vector.hashName};
233 var promise = subtle.generateKey({name: "HMAC", hash
[all...]
/third_party/node/deps/openssl/openssl/crypto/sm2/
H A Dsm2_crypt.c121 EVP_MD_CTX *hash = EVP_MD_CTX_new();
141 if (hash == NULL || C3_size <= 0) {
222 if (EVP_DigestInit(hash, fetched_digest) == 0
223 || EVP_DigestUpdate(hash, x2y2, field_size) == 0
224 || EVP_DigestUpdate(hash, msg, msg_len) == 0
225 || EVP_DigestUpdate(hash, x2y2 + field_size, field_size) == 0
226 || EVP_DigestFinal(hash, C3, NULL) == 0) {
263 EVP_MD_CTX_free(hash);
291 EVP_MD_CTX *hash = NULL;
370 hash
[all...]
/third_party/rust/crates/libc/src/unix/linux_like/android/b32/
H A Darm.rs79 impl ::hash::Hash for __c_anonymous_uc_sigmask_with_padding {
80 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
81 self.uc_sigmask.hash(state) in hash()
99 impl ::hash::Hash for __c_anonymous_uc_sigmask {
100 fn hash<H: ::hash::Hasher>(&self, state: &mut H) { in hash() functions
101 unsafe { self.uc_sigmask.hash(state) } in hash()
134 impl ::hash::Hash for ucontext_t {
135 fn hash< functions
[all...]
/third_party/openssl/crypto/sm2/
H A Dsm2_crypt.c121 EVP_MD_CTX *hash = EVP_MD_CTX_new();
141 if (hash == NULL || C3_size <= 0) {
222 if (EVP_DigestInit(hash, fetched_digest) == 0
223 || EVP_DigestUpdate(hash, x2y2, field_size) == 0
224 || EVP_DigestUpdate(hash, msg, msg_len) == 0
225 || EVP_DigestUpdate(hash, x2y2 + field_size, field_size) == 0
226 || EVP_DigestFinal(hash, C3, NULL) == 0) {
263 EVP_MD_CTX_free(hash);
291 EVP_MD_CTX *hash = NULL;
370 hash
[all...]
/third_party/skia/third_party/externals/freetype/src/cache/
H A Dftccache.c86 /* get a top bucket for specified hash from cache,
87 * body for FTC_NODE_TOP_FOR_HASH( cache, hash )
91 FT_Offset hash ) in ftc_get_top_node_for_hash()
96 idx = hash & cache->mask; in ftc_get_top_node_for_hash()
98 idx = hash & ( 2 * cache->mask + 1 ); in ftc_get_top_node_for_hash()
107 * buckets array appropriately, we simply degrade the hash table's
151 if ( node->hash & ( mask + 1 ) ) in ftc_cache_resize()
213 /* otherwise, the hash table is balanced */ in ftc_cache_resize()
220 /* remove a node from its cache's hash table */
225 FTC_Node *pnode = FTC_NODE_TOP_FOR_HASH( cache, node0->hash ); in ftc_node_hash_unlink()
414 ftc_cache_add( FTC_Cache cache, FT_Offset hash, FTC_Node node ) ftc_cache_add() argument
[all...]
/device/qemu/riscv32_virt/liteos_m/board/driver/video/
H A Dkey_cache.c72 PRINTK(" keyCache dump hash %d item %s %p %d\n", i, in KeyCacheDump()
98 uint32_t hash; in NameHash() local
99 hash = LOS_HashFNV32aBuf(name, len, FNV1_32A_INIT); in NameHash()
100 return hash; in NameHash()
105 int hash = NameHash(name, len) & PATH_CACHE_HASH_MASK; in KeyCacheInsert() local
106 LOS_ListAdd(&g_keyCacheHashEntrys[hash], &cache->hashEntry); in KeyCacheInsert()
152 int hash = NameHash(name, len) & PATH_CACHE_HASH_MASK; in KeyCacheLookup() local
153 LIST_HEAD *dhead = &g_keyCacheHashEntrys[hash]; in KeyCacheLookup()
/kernel/linux/linux-5.10/arch/sparc/crypto/
H A Dmd5_glue.c17 #include <crypto/internal/hash.h>
36 mctx->hash[0] = cpu_to_le32(MD5_H0); in md5_sparc64_init()
37 mctx->hash[1] = cpu_to_le32(MD5_H1); in md5_sparc64_init()
38 mctx->hash[2] = cpu_to_le32(MD5_H2); in md5_sparc64_init()
39 mctx->hash[3] = cpu_to_le32(MD5_H3); in md5_sparc64_init()
54 md5_sparc64_transform(sctx->hash, (u8 *)sctx->block, 1); in __md5_sparc64_update()
59 md5_sparc64_transform(sctx->hash, data + done, rounds); in __md5_sparc64_update()
108 dst[i] = sctx->hash[i]; in md5_sparc64_final()
/kernel/linux/linux-5.10/fs/coda/
H A Dcnode.c65 unsigned long hash = coda_f2i(fid); in coda_iget() local
67 inode = iget5_locked(sb, hash, coda_test_inode, coda_set_inode, fid); in coda_iget()
75 inode->i_ino = hash; in coda_iget()
122 unsigned long hash = coda_f2i(newfid); in coda_replace_fid() local
130 inode->i_ino = hash; in coda_replace_fid()
131 __insert_inode_hash(inode, hash); in coda_replace_fid()
138 unsigned long hash = coda_f2i(fid); in coda_fid_to_inode() local
140 inode = ilookup5(sb, hash, coda_test_inode, fid); in coda_fid_to_inode()
/kernel/linux/linux-6.6/fs/coda/
H A Dcnode.c65 unsigned long hash = coda_f2i(fid); in coda_iget() local
69 inode = iget5_locked(sb, hash, coda_test_inode, coda_set_inode, fid); in coda_iget()
76 inode->i_ino = hash; in coda_iget()
127 unsigned long hash = coda_f2i(newfid); in coda_replace_fid() local
135 inode->i_ino = hash; in coda_replace_fid()
136 __insert_inode_hash(inode, hash); in coda_replace_fid()
143 unsigned long hash = coda_f2i(fid); in coda_fid_to_inode() local
145 inode = ilookup5(sb, hash, coda_test_inode, fid); in coda_fid_to_inode()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DCachedHashString.h10 // and not-owning string types that store their hash in addition to their string
28 /// A container which contains a StringRef plus a precomputed hash.
47 uint32_t hash() const { return Hash; } in hash() function in llvm::CachedHashStringRef
58 assert(!isEqual(S, getEmptyKey()) && "Cannot hash the empty key!"); in getHashValue()
59 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!"); in getHashValue()
60 return S.hash(); in getHashValue()
64 return LHS.hash() == RHS.hash() && in isEqual()
69 /// A container which contains a string, which it owns, plus a precomputed hash.
138 uint32_t hash() cons in size() function in llvm::CachedHashString
[all...]
/third_party/protobuf/csharp/src/Google.Protobuf/Reflection/
H A DDescriptor.cs264 int hash = 1; in GetHashCode()
265 hash ^= file_.GetHashCode(); in GetHashCode()
267 hash ^= _unknownFields.GetHashCode(); in GetHashCode()
269 return hash; in GetHashCode()
630 int hash = 1; in GetHashCode()
631 if (HasName) hash ^= Name.GetHashCode(); in GetHashCode()
632 if (HasPackage) hash ^= Package.GetHashCode(); in GetHashCode()
633 hash ^= dependency_.GetHashCode(); in GetHashCode()
634 hash ^= publicDependency_.GetHashCode(); in GetHashCode()
635 hash in GetHashCode()
[all...]
/kernel/linux/linux-6.6/fs/ext2/
H A Dxattr.c523 __u32 hash = le32_to_cpu(header->h_hash); in ext2_xattr_set() local
527 hash, bh->b_blocknr); in ext2_xattr_set()
661 __u32 hash = le32_to_cpu(HDR(bh)->h_hash); in ext2_xattr_release_block() local
668 oe = mb_cache_entry_delete_or_get(ea_block_cache, hash, in ext2_xattr_release_block()
874 __u32 hash = le32_to_cpu(HDR(bh)->h_hash); in ext2_xattr_cache_insert() local
877 error = mb_cache_entry_create(cache, GFP_NOFS, hash, bh->b_blocknr, in ext2_xattr_cache_insert()
885 ea_bdebug(bh, "inserting [%x]", (int)hash); in ext2_xattr_cache_insert()
940 __u32 hash = le32_to_cpu(header->h_hash); in ext2_xattr_cache_find() local
946 ea_idebug(inode, "looking for cached blocks [%x]", (int)hash); in ext2_xattr_cache_find()
948 ce = mb_cache_entry_find_first(ea_block_cache, hash); in ext2_xattr_cache_find()
991 __u32 hash = 0; ext2_xattr_hash_entry() local
1028 __u32 hash = 0; ext2_xattr_rehash() local
[all...]
/third_party/vk-gl-cts/external/vulkancts/framework/vulkan/
H A DvkPrograms.cpp423 deUint32 hash = 0; in shaderCacheFirstRunCheck() local
430 if (ok) ok = fread(&hash, 1, 4, file) == 4; in shaderCacheFirstRunCheck()
431 if (ok) cacheInsert(hash, offset); in shaderCacheFirstRunCheck()
452 // 32-bit FNV-1 hash
455 deUint32 hash = 0x811c9dc5; in shadercacheHash() local
459 hash *= 16777619; in shadercacheHash()
460 hash ^= c; in shadercacheHash()
462 return hash; in shadercacheHash()
465 vk::ProgramBinary* shadercacheLoad (const std::string& shaderstring, const char* shaderCacheFilename, deUint32 hash) in shadercacheLoad() argument
478 node = cacheSearch(hash); in shadercacheLoad()
524 shadercacheSave(const vk::ProgramBinary* binary, const std::string& shaderstring, const char* shaderCacheFilename, deUint32 hash) shadercacheSave() argument
647 deUint32 hash = 0; buildProgram() local
735 deInt32 hash = 0; buildProgram() local
824 deUint32 hash = 0; assembleProgram() local
[all...]
/third_party/python/Python/
H A Dhamt.c34 hash of K, let's say it's 19830128, or in binary:
38 Now let's partition this bit representation of the hash into blocks of
48 For example, storing the key K with hash 19830128, results in the following
80 To rehash: for a K/V pair, the hash of K encodes where in the tree V will
83 To optimize memory footprint and handle hash collisions, our implementation
191 key/value. When there's a hash collision, say for k1/v1 and k2/v2
192 we have `hash(k1)==hash(k2)`. Then our collision node will be:
345 uint32_t shift, int32_t hash,
350 uint32_t shift, int32_t hash,
402 Py_hash_t hash = PyObject_Hash(o); hamt_hash() local
435 hamt_mask(int32_t hash, uint32_t shift) hamt_mask() argument
441 hamt_bitpos(int32_t hash, uint32_t shift) hamt_bitpos() argument
687 hamt_node_bitmap_assoc(PyHamtNode_Bitmap *self, uint32_t shift, int32_t hash, PyObject *key, PyObject *val, int* added_leaf) hamt_node_bitmap_assoc() argument
955 hamt_node_bitmap_without(PyHamtNode_Bitmap *self, uint32_t shift, int32_t hash, PyObject *key, PyHamtNode **new_node) hamt_node_bitmap_without() argument
1095 hamt_node_bitmap_find(PyHamtNode_Bitmap *self, uint32_t shift, int32_t hash, PyObject *key, PyObject **val) hamt_node_bitmap_find() argument
1260 hamt_node_collision_new(int32_t hash, Py_ssize_t size) hamt_node_collision_new() argument
1316 hamt_node_collision_assoc(PyHamtNode_Collision *self, uint32_t shift, int32_t hash, PyObject *key, PyObject *val, int* added_leaf) hamt_node_collision_assoc() argument
1434 hamt_node_collision_without(PyHamtNode_Collision *self, uint32_t shift, int32_t hash, PyObject *key, PyHamtNode **new_node) hamt_node_collision_without() argument
1528 hamt_node_collision_find(PyHamtNode_Collision *self, uint32_t shift, int32_t hash, PyObject *key, PyObject **val) hamt_node_collision_find() argument
1677 hamt_node_array_assoc(PyHamtNode_Array *self, uint32_t shift, int32_t hash, PyObject *key, PyObject *val, int* added_leaf) hamt_node_array_assoc() argument
1761 hamt_node_array_without(PyHamtNode_Array *self, uint32_t shift, int32_t hash, PyObject *key, PyHamtNode **new_node) hamt_node_array_without() argument
1919 hamt_node_array_find(PyHamtNode_Array *self, uint32_t shift, int32_t hash, PyObject *key, PyObject **val) hamt_node_array_find() argument
2021 hamt_node_assoc(PyHamtNode *node, uint32_t shift, int32_t hash, PyObject *key, PyObject *val, int* added_leaf) hamt_node_assoc() argument
2055 hamt_node_without(PyHamtNode *node, uint32_t shift, int32_t hash, PyObject *key, PyHamtNode **new_node) hamt_node_without() argument
2082 hamt_node_find(PyHamtNode *node, uint32_t shift, int32_t hash, PyObject *key, PyObject **val) hamt_node_find() argument
[all...]
/third_party/libsnd/Octave/
H A Dsndfile.cc239 int hash = 0 ; in hash_of_str() local
242 hash = (hash * 3) + tolower (str [k]) ; in hash_of_str()
244 return hash ; in hash_of_str()
249 { int hash ; in major_format_of_hash() local
251 hash = hash_of_str (str) ; in major_format_of_hash()
253 switch (hash) in major_format_of_hash()
279 printf ("%s : hash '%s' -> 0x%x\n", __func__, str.c_str (), hash) ; in major_format_of_hash()
286 { int hash ; in minor_format_of_hash() local
[all...]
/third_party/node/deps/v8/src/objects/
H A Dordered-hash-table-inl.h8 #include "src/objects/ordered-hash-table.h"
23 #include "torque-generated/src/objects/ordered-hash-table-tq-inl.inc"
224 inline void SmallOrderedNameDictionary::SetHash(int hash) { in SetHash() argument
225 DCHECK(PropertyArray::HashField::is_valid(hash)); in SetHash()
226 WriteField<int>(PrefixOffset(), hash); in SetHash() local
230 int hash = ReadField<int>(PrefixOffset()); in Hash() local
231 DCHECK(PropertyArray::HashField::is_valid(hash)); in Hash()
232 return hash; in Hash()
235 inline void OrderedNameDictionary::SetHash(int hash) { in SetHash() argument
236 DCHECK(PropertyArray::HashField::is_valid(hash)); in SetHash()
242 int hash = Smi::ToInt(hash_obj); Hash() local
[all...]
H A Dswiss-hash-table-helpers.h80 ProbeSequence(uint32_t hash, uint32_t mask) { in ProbeSequence() argument
84 offset_ = hash & mask_; in ProbeSequence()
210 // Extracts H1 from the given overall hash, which means discarding the lowest 7
211 // bits of the overall hash. H1 is used to determine the first group to probe.
212 inline static uint32_t H1(uint32_t hash) { return (hash >> kH2Bits); }
214 // Extracts H2 from the given overall hash, which means using only the lowest 7
215 // bits of the overall hash. H2 is stored in the control table byte for each
217 inline static swiss_table::ctrl_t H2(uint32_t hash) {
218 return hash
[all...]

Completed in 32 milliseconds

1...<<11121314151617181920>>...168