/linux-master/drivers/net/ethernet/chelsio/cxgb3/ |
H A D | xgmac.c | 286 /* Calculate the RX hash filter index of an Ethernet address */ 289 int hash = 0, octet, bit, i = 0, c; local 293 hash ^= (c & 1) << i; 297 return hash; 323 int hash = hash_hw_addr(ha->addr); local 325 if (hash < 32) 326 hash_lo |= (1 << hash); 328 hash_hi |= (1 << (hash - 32));
|
/linux-master/net/ceph/crush/ |
H A D | mapper.c | 19 # include <linux/crush/hash.h> 24 # include "hash.h" 88 s = crush_hash32_3(bucket->hash, x, bucket->id, 0) % 113 i = crush_hash32_3(bucket->hash, x, bucket->id, p) % 148 __u64 w = crush_hash32_4(bucket->h.hash, x, bucket->h.items[i], 210 t = (__u64)crush_hash32_4(bucket->h.hash, x, n, r, 237 draw = crush_hash32_3(bucket->h.hash, x, bucket->h.items[i], r); 340 u = crush_hash32_3(bucket->h.hash, x, ids[i], r); 886 * @x: hash input
|
/linux-master/fs/fat/ |
H A D | namei_vfat.c | 117 * Compute the hash for the vfat name corresponding to the dentry. 118 * Note: if the name is invalid, we leave the hash code unchanged so 124 qstr->hash = full_name_hash(dentry, qstr->name, vfat_striptail_len(qstr)); 129 * Compute the hash for the vfat name corresponding to the dentry. 130 * Note: if the name is invalid, we leave the hash code unchanged so 139 unsigned long hash; local 144 hash = init_name_hash(dentry); 146 hash = partial_name_hash(nls_tolower(t, *name++), hash); 147 qstr->hash [all...] |
/linux-master/drivers/firmware/arm_scmi/ |
H A D | notify.c | 44 * hash-keys. 116 * Assumes that the stored obj includes its own hash-key in a field named 'key': 131 hash_for_each_possible((__ht), obj_, hash, k_) \ 351 * @hash: The hlist_node used for collision handling 365 struct hlist_node hash; member in struct:scmi_event_handler 894 hash_add(ni->pending_events_handlers, &hndl->hash, hndl->key); 908 hash_del(&hndl->hash); 938 hash_del(&hndl->hash); 951 &hndl->hash, hndl->key); 1573 hash_for_each_safe(ni->pending_events_handlers, bkt, tmp, hndl, hash) { [all...] |
/linux-master/net/netfilter/ |
H A D | nf_conntrack_standalone.c | 102 struct hlist_nulls_head *hash; member in struct:ct_iter_state 117 hlist_nulls_first_rcu(&st->hash[st->bucket])); 136 hlist_nulls_first_rcu(&st->hash[st->bucket])); 159 nf_conntrack_get_ht(&st->hash, &st->htable_size); 297 struct nf_conntrack_tuple_hash *hash = v; local 298 struct nf_conn *ct = nf_ct_tuplehash_to_ctrack(hash); 316 if (NF_CT_DIRECTION(hash))
|
/linux-master/net/unix/ |
H A D | af_unix.c | 126 * hash table is protected with spinlock. 132 unsigned long hash = (unsigned long)sk; local 134 hash ^= hash >> 16; 135 hash ^= hash >> 8; 136 hash ^= sk->sk_type; 138 return hash & UNIX_HASH_MOD; 150 unsigned int hash; local 152 hash 325 __unix_set_addr_hash(struct net *net, struct sock *sk, struct unix_address *addr, unsigned int hash) argument 367 __unix_find_socket_byname(struct net *net, struct sockaddr_un *sunname, int len, unsigned int hash) argument 383 unix_find_socket_byname(struct net *net, struct sockaddr_un *sunname, int len, unsigned int hash) argument 399 unsigned int hash = unix_bsd_hash(i); local 1103 unsigned int hash = unix_abstract_hash(sunaddr, addr_len, type); local [all...] |
/linux-master/fs/xfs/scrub/ |
H A D | dir.c | 260 /* Verify that we can look up this name by hash. */ 262 /* ENOENT means the hash lookup failed and the dir is corrupt */ 328 xfs_dahash_t hash; local 339 /* Check the hash of the entry. */ 344 /* Valid hash pointer? */ 401 hash = be32_to_cpu(ent->hashval); 410 /* Does the directory hash match? */ 414 if (calc_hash != hash) 625 __u32 hash; local 676 /* Check hash valu [all...] |
/linux-master/arch/arm64/crypto/ |
H A D | poly1305-armv8.pl | 9 # This module implements Poly1305 hash for ARMv8. 66 stp xzr,xzr,[$ctx] // zero hash value 118 ldp $h0,$h1,[$ctx] // load hash value 195 stp $h0,$h1,[$ctx] // store hash value 206 ldp $h0,$h1,[$ctx] // load hash base 2^64 359 ldp w10,w11,[$ctx] // load hash value base 2^26 404 ldp $h0,$h1,[$ctx] // load hash value base 2^64 632 // (hash+inp[0:1])*r^4 and accumulate 744 // multiply (inp[0:1]+hash) or inp[2:3] by r^2:r^1 793 // (hash [all...] |
/linux-master/net/batman-adv/ |
H A D | multicast.c | 55 #include "hash.h" 2018 * @hash: hash to dump 2027 struct batadv_hashtable *hash, 2033 spin_lock_bh(&hash->list_locks[bucket]); 2034 cb->seq = atomic_read(&hash->generation) << 1 | 1; 2036 hlist_for_each_entry(orig_node, &hash->table[bucket], hash_entry) { 2045 spin_unlock_bh(&hash->list_locks[bucket]); 2054 spin_unlock_bh(&hash->list_locks[bucket]); 2075 struct batadv_hashtable *hash local 2025 batadv_mcast_flags_dump_bucket(struct sk_buff *msg, u32 portid, struct netlink_callback *cb, struct batadv_hashtable *hash, unsigned int bucket, long *idx_skip) argument [all...] |
/linux-master/net/ipv6/ |
H A D | ip6_vti.c | 33 #include <linux/hash.h> 55 u32 hash = ipv6_addr_hash(addr1) ^ ipv6_addr_hash(addr2); local 57 return hash_32(hash, IP6_VTI_HASH_SIZE_SHIFT); 92 unsigned int hash = HASH(remote, local); local 97 for_each_vti6_tunnel_rcu(ip6n->tnls_r_l[hash]) { 105 hash = HASH(&any, local); 106 for_each_vti6_tunnel_rcu(ip6n->tnls_r_l[hash]) { 112 hash = HASH(remote, &any); 113 for_each_vti6_tunnel_rcu(ip6n->tnls_r_l[hash]) {
|
/linux-master/tools/testing/ktest/ |
H A D | config-bisect.pl | 249 my ($hash, $config) = @_; 259 ${$hash}{$2} = $1; 261 ${$hash}{$2} = $1;
|
/linux-master/fs/autofs/ |
H A D | waitq.c | 185 if (wq->name.hash == qstr->hash && 362 qstr.hash = full_name_hash(dentry, qstr.name, qstr.len);
|
/linux-master/fs/omfs/ |
H A D | dir.c | 14 int i, hash = 0; local 16 hash ^= tolower(name[i]) << (i % 24); 17 return hash % mod; 325 printk(KERN_WARNING "omfs: bad hash chain detected\n"); 427 /* high 12 bits store bucket + 1 and low 20 bits store hash index */
|
/linux-master/fs/ |
H A D | inode.c | 11 #include <linux/hash.h> 510 static unsigned long hash(struct super_block *sb, unsigned long hashval) function 521 * __insert_inode_hash - hash an inode 526 * Add an inode to the inode hash for this superblock. 530 struct hlist_head *b = inode_hashtable + hash(inode->i_sb, hashval); 541 * __remove_inode_hash - remove an inode from the hash 1138 * @hashval: hash value (usually inode number) to get 1159 struct hlist_head *head = inode_hashtable + hash(inode->i_sb, hashval); 1211 * @hashval: hash value (usually inode number) to get 1263 struct hlist_head *head = inode_hashtable + hash(s [all...] |
/linux-master/fs/gfs2/ |
H A D | dir.c | 47 * When a leaf is completely full, the size of the hash table can be 50 * but never before the maximum hash table size has been reached. 328 * gfs2_dir_get_hash_table - Get pointer to the dir hash table 331 * Returns: The hash table or an error 379 * gfs2_dir_hash_inval - Invalidate dir hash 405 be32_to_cpu(dent->de_hash) == name->hash && 498 * hash is correct for example, but that would take a lot of extra time. 775 * @index: hash table index of the targeted leaf 783 __be64 *hash; local 786 hash 1536 u32 hash, index; local [all...] |
/linux-master/fs/bcachefs/ |
H A D | movinggc.c | 38 .head_offset = offsetof(struct move_bucket_in_flight, hash), 54 ret = rhashtable_lookup_insert_fast(&list->table, &new->hash, 125 ret = rhashtable_remove_fast(&list->table, &i->hash,
|
/linux-master/net/ipv4/ |
H A D | fib_semantics.c | 32 #include <linux/hash.h> 168 struct fnhe_hash_bucket *hash; local 171 hash = rcu_dereference_protected(nhc->nhc_exceptions, 1); 172 if (!hash) 177 fnhe = rcu_dereference_protected(hash[i].chain, 1); 191 kfree(hash); 382 unsigned int hash; local 384 hash = fib_info_hashfn_1(fib_devindex_hashfn(cfg->fc_nh_id), 388 hash = fib_info_hashfn_result(hash); 413 unsigned int hash; local 2221 fib_select_multipath(struct fib_result *res, int hash) argument [all...] |
H A D | route.c | 58 * Ilia Sotnikov : Removed TOS from hash calculations 458 static u32 ip_idents_reserve(u32 hash, int segs) argument 465 bucket = hash & ip_idents_mask; 482 u32 hash, id; local 489 hash = siphash_3u32((__force u32)iph->daddr, 493 id = ip_idents_reserve(hash, segs); 581 static void fnhe_remove_oldest(struct fnhe_hash_bucket *hash) argument 586 for (fnhe_p = &hash->chain; ; fnhe_p = &fnhe->fnhe_next) { 630 struct fnhe_hash_bucket *hash; local 642 hash 1318 struct fnhe_hash_bucket *hash; local 1353 struct fnhe_hash_bucket *hash = rcu_dereference(nhc->nhc_exceptions); local [all...] |
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/ |
H A D | eswitch.c | 59 /* Vport UC/MC hash node */ 417 struct hlist_head *hash = esw->mc_table; local 425 esw_mc = l2addr_hash_find(hash, mac, struct esw_mc_addr); 429 esw_mc = l2addr_hash_add(hash, mac, struct esw_mc_addr, GFP_KERNEL); 457 struct hlist_head *hash = esw->mc_table; local 465 esw_mc = l2addr_hash_find(hash, mac, struct esw_mc_addr); 506 struct hlist_head *hash; local 515 hash = is_uc ? vport->uc_list : vport->mc_list; 516 for_each_l2hash_node(node, tmp, hash, hi) { 539 struct hlist_head *hash; local 624 struct hlist_head *hash; local [all...] |
/linux-master/drivers/misc/vmw_vmci/ |
H A D | vmci_resource.c | 9 #include <linux/hash.h> 36 * Gets a resource (if one exists) matching given handle from the hash table. 143 /* Remove resource from hash table. */ 195 /* Verify the resource has been unlinked from hash table */ 205 * can increment the count again (it's gone from the resource hash
|
/linux-master/crypto/ |
H A D | crypto_null.c | 16 #include <crypto/internal/hash.h>
|
H A D | ghash-generic.c | 3 * GHASH: hash function for GCM (Galois/Counter Mode). 11 * GHASH is a keyed hash function used in GCM authentication tag generation. 14 * takes a 16-byte hash key H, additional authenticated data A, and a ciphertext 22 * since the API supports only a single data stream per hash. Thus, the 28 * an "��-almost-XOR-universal hash function", not a cryptographic hash function. 40 #include <crypto/internal/hash.h> 182 MODULE_DESCRIPTION("GHASH hash function");
|
H A D | poly1305_generic.c | 15 #include <crypto/internal/hash.h>
|
/linux-master/drivers/crypto/marvell/octeontx/ |
H A D | otx_cptvf_algs.h | 14 #include <crypto/hash.h>
|
/linux-master/include/linux/ |
H A D | hashtable.h | 3 * Statically sized hash table implementation 13 #include <linux/hash.h> 43 * hash_init - initialize a hash table 145 * hash entry
|