/linux-master/arch/mips/mobileye/ |
H A D | board-epm5.its.S | 10 hash {
|
/linux-master/lib/ |
H A D | hashtable_test.c | 37 DEFINE_HASHTABLE(hash, 1); 39 KUNIT_EXPECT_TRUE(test, hash_empty(hash)); 43 hash_add(hash, &a.node, a.key); 46 KUNIT_EXPECT_FALSE(test, hash_empty(hash)); 52 DEFINE_HASHTABLE(hash, 4); 56 hash_add(hash, &a.node, a.key); 59 hash_add(hash, &b.node, b.key); 69 DEFINE_HASHTABLE(hash, 3); 74 hash_add(hash, &a.node, a.key); 78 hash_add(hash, [all...] |
H A D | oid_registry.c | 31 unsigned i, j, k, hash; local 35 hash = datasize - 1; 38 hash += octets[i] * 33; 39 hash = (hash >> 24) ^ (hash >> 16) ^ (hash >> 8) ^ hash; 40 hash &= 0xff; 43 * of hash valu [all...] |
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/lib/ |
H A D | mpfs.h | 39 /* L2 -mac address based- hash helpers */ 48 #define for_each_l2hash_node(hn, tmp, hash, i) \ 50 hlist_for_each_entry_safe(hn, tmp, &(hash)[i], hlist) 52 #define l2addr_hash_find(hash, mac, type) ({ \ 57 hlist_for_each_entry(ptr, &(hash)[ix], node.hlist) \ 67 #define l2addr_hash_add(hash, mac, type, gfp) ({ \ 74 hlist_add_head(&ptr->node.hlist, &(hash)[ix]);\
|
/linux-master/include/net/ |
H A D | rps.h | 53 * of flow hash, lower part is CPU number. 57 * meaning we use 32-6=26 bits for the hash. 69 u32 hash) 71 unsigned int index = hash & table->mask; 72 u32 val = hash & ~net_hotdata.rps_cpu_mask; 86 static inline void sock_rps_record_flow_hash(__u32 hash) argument 91 if (!hash) 96 rps_record_sock_flow(sock_flow_table, hash); 68 rps_record_sock_flow(struct rps_sock_flow_table *table, u32 hash) argument
|
/linux-master/arch/powerpc/crypto/ |
H A D | aes-gcm-p10-glue.c | 17 #include <crypto/internal/hash.h> 77 static void set_subkey(unsigned char *hash) argument 79 *(u64 *)&hash[0] = be64_to_cpup((__be64 *)&hash[0]); 80 *(u64 *)&hash[8] = be64_to_cpup((__be64 *)&hash[8]); 87 static void set_aad(struct gcm_ctx *gctx, struct Hash_ctx *hash, argument 96 gcm_ghash_p10(nXi, hash->Htable+32, aad, i); 105 gcm_ghash_p10(gctx->aad_hash, hash->Htable+32, nXi, 16); 110 memcpy(hash 113 gcmp10_init(struct gcm_ctx *gctx, u8 *iv, unsigned char *rdkey, struct Hash_ctx *hash, u8 *assoc, unsigned int assoclen) argument 141 finish_tag(struct gcm_ctx *gctx, struct Hash_ctx *hash, int len) argument 208 struct Hash_ctx *hash = PTR_ALIGN((void *)hashbuf, PPC_ALIGN); local [all...] |
H A D | md5-glue.c | 10 #include <crypto/internal/hash.h> 34 sctx->hash[0] = MD5_H0; 35 sctx->hash[1] = MD5_H1; 36 sctx->hash[2] = MD5_H2; 37 sctx->hash[3] = MD5_H3; 60 ppc_md5_transform(sctx->hash, (const u8 *)sctx->block, 1); 66 ppc_md5_transform(sctx->hash, src, len >> 6); 89 ppc_md5_transform(sctx->hash, src, 1); 96 ppc_md5_transform(sctx->hash, src, 1); 98 dst[0] = cpu_to_le32(sctx->hash[ [all...] |
/linux-master/include/linux/ |
H A D | rhashtable.h | 32 * which is linked into as hash chain from the hash table - or one 33 * of two or more hash tables when the rhashtable is being resized. 36 * the hash bucket. This allows us to be sure we've found the end 38 * The value stored in the hash bucket has BIT(0) used as a lock bit. 51 * The maximum (not average) chain length grows with the size of the hash 54 * The value of 16 is selected so that even if the hash table grew to 65 * struct bucket_table - Table of hash buckets 66 * @size: Number of hash buckets 69 * @hash_rnd: Random seed to fold into hash 119 rht_bucket_index(const struct bucket_table *tbl, unsigned int hash) argument 129 unsigned int hash; local 159 unsigned int hash = rht_key_get_hash(ht, key, params, tbl->hash_rnd); local 235 lockdep_rht_bucket_is_held(const struct bucket_table *tbl, u32 hash) argument 286 rht_bucket( const struct bucket_table *tbl, unsigned int hash) argument 293 rht_bucket_var( struct bucket_table *tbl, unsigned int hash) argument 300 rht_bucket_insert( struct rhashtable *ht, struct bucket_table *tbl, unsigned int hash) argument 379 rht_ptr( struct rhash_lock_head __rcu *const *bkt, struct bucket_table *tbl, unsigned int hash) argument 600 unsigned int hash; local 718 unsigned int hash; local 1004 unsigned int hash; local 1157 unsigned int hash; local [all...] |
/linux-master/tools/testing/selftests/bpf/ |
H A D | bpf_arena_htab.h | 19 static inline htab_bucket_t *__select_bucket(htab_t *htab, __u32 hash) argument 24 return &b[hash & (htab->n_buckets - 1)]; 27 static inline arena_list_head_t *select_bucket(htab_t *htab, __u32 hash) argument 29 return &__select_bucket(htab, hash)->head; 33 int hash; member in struct:hashtab_elem 40 static hashtab_elem_t *lookup_elem_raw(arena_list_head_t *head, __u32 hash, int key) argument 45 if (l->hash == hash && l->key == key) 82 l_new->hash = htab_hash(key);
|
/linux-master/arch/powerpc/mm/book3s64/ |
H A D | hash_hugepage.c | 16 * PPC64 THP Support for hash based MMUs 30 unsigned long vpn, hash, shift, slot; local 82 * hash page table entries. 89 * respect to all the 64K hash pte mapping the 16MB 102 hash = hpt_hash(vpn, shift, ssize); 105 hash = ~hash; 106 slot = (hash & htab_hash_mask) * HPTES_PER_GROUP; 128 hash = hpt_hash(vpn, shift, ssize); 134 hpte_group = (hash [all...] |
/linux-master/arch/loongarch/kernel/ |
H A D | relocate.c | 70 static inline __init unsigned long rotate_xor(unsigned long hash, argument 74 const typeof(hash) *ptr = PTR_ALIGN(area, sizeof(hash)); 77 if (size < diff + sizeof(hash)) 78 return hash; 80 size = ALIGN_DOWN(size - diff, sizeof(hash)); 82 for (i = 0; i < size / sizeof(hash); i++) { 84 hash = (hash << ((sizeof(hash) * 93 unsigned long hash = 0; local [all...] |
/linux-master/mm/ |
H A D | mm_slot.h | 10 * struct mm_slot - hash lookup from mm to mm_slot 11 * @hash: link to the mm_slots hash list 16 struct hlist_node hash; member in struct:mm_slot 40 hash_for_each_possible(_hashtable, tmp_slot, hash, (unsigned long)_mm) \ 52 hash_add(_hashtable, &_mm_slot->hash, (unsigned long)_mm); \
|
/linux-master/drivers/accessibility/speakup/ |
H A D | utils.h | 58 int hash = 0; local 61 hash = (hash * 17) & 0xfffffff; 64 hash += (int)*pn; 67 hash %= HASHSIZE; 68 return &key_table[hash];
|
/linux-master/fs/ntfs3/ |
H A D | lznt.c | 35 struct lznt_hash hash[LZNT_CHUNK_SIZE]; member in struct:lznt 52 const u8 **hash; local 58 hash = &(ctx->hash[hash_index].p1); 60 if (hash[0] >= ctx->unc && hash[0] < src && hash[0][0] == src[0] && 61 hash[0][1] == src[1] && hash[0][2] == src[2]) { 65 hash[ [all...] |
/linux-master/security/selinux/ss/ |
H A D | mls.h | 88 static inline u32 mls_range_hash(const struct mls_range *r, u32 hash) argument 90 hash = jhash_2words(r->level[0].sens, r->level[1].sens, hash); 91 hash = ebitmap_hash(&r->level[0].cat, hash); 92 hash = ebitmap_hash(&r->level[1].cat, hash); 93 return hash;
|
/linux-master/crypto/ |
H A D | hmac.c | 15 #include <crypto/internal/hash.h> 26 struct crypto_shash *hash; member in struct:hmac_ctx 38 struct crypto_shash *hash = tctx->hash; local 41 SHASH_DESC_ON_STACK(shash, hash); 47 shash->tfm = hash; 88 desc->tfm = tctx->hash; 140 struct crypto_shash *hash; local 145 hash = crypto_spawn_shash(spawn); 146 if (IS_ERR(hash)) 160 struct crypto_shash *hash; local [all...] |
H A D | md4.c | 23 #include <crypto/internal/hash.h> 37 u32 hash[MD4_HASH_WORDS]; member in struct:md4_ctx 67 static void md4_transform(u32 *hash, u32 const *in) argument 71 a = hash[0]; 72 b = hash[1]; 73 c = hash[2]; 74 d = hash[3]; 127 hash[0] += a; 128 hash[1] += b; 129 hash[ [all...] |
/linux-master/security/integrity/ima/ |
H A D | ima_api.c | 89 * Calculate the hash of a template entry, add the template entry 129 * Violations are flagged in the measurement list with zero hash values. 175 * @allowed_algos: allowlist of hash algorithms for the IMA xattr 206 struct ima_max_digest_data *hash) 213 * hash containing 0's. 215 digest_len = fsverity_get_digest(inode, hash->digest, NULL, &alg); 220 * Unlike in the case of actually calculating the file hash, in 221 * the fsverity case regardless of the hash algorithm, return 226 hash->hdr.algo = alg; 227 hash 204 ima_get_verity_digest(struct ima_iint_cache *iint, struct inode *inode, struct ima_max_digest_data *hash) argument 249 struct ima_max_digest_data hash; local 390 char *hash; local [all...] |
/linux-master/arch/mips/kernel/ |
H A D | relocate.c | 194 static inline __init unsigned long rotate_xor(unsigned long hash, argument 197 const typeof(hash) *ptr = PTR_ALIGN(area, sizeof(hash)); 201 if (unlikely(size < diff + sizeof(hash))) 202 return hash; 204 size = ALIGN_DOWN(size - diff, sizeof(hash)); 206 for (i = 0; i < size / sizeof(hash); i++) { 208 hash = (hash << ((sizeof(hash) * 218 unsigned long hash = 0; local [all...] |
/linux-master/arch/x86/um/vdso/ |
H A D | vdso-layout.lds.S | 12 .hash : { *(.hash) } :text 13 .gnu.hash : { *(.gnu.hash) }
|
/linux-master/arch/sh/kernel/vsyscall/ |
H A D | vsyscall.lds.S | 23 .hash : { *(.hash) } :text 24 .gnu.hash : { *(.gnu.hash) }
|
/linux-master/arch/arm/crypto/ |
H A D | sha256_glue.h | 13 unsigned int len, u8 *hash);
|
/linux-master/arch/sparc/vdso/ |
H A D | vdso-layout.lds.S | 31 .hash : { *(.hash) } :text 32 .gnu.hash : { *(.gnu.hash) }
|
/linux-master/include/crypto/ |
H A D | md5.h | 20 u32 hash[MD5_HASH_WORDS]; member in struct:md5_state
|
H A D | streebog.h | 30 struct streebog_uint512 hash; member in struct:streebog_state
|