/linux-master/arch/x86/kernel/ |
H A D | kvm.c | 23 #include <linux/hash.h>
|
/linux-master/tools/objtool/ |
H A D | check.c | 43 hash_for_each_possible(file->insn_hash, insn, hash, sec_offset_hash(sec, offset)) { 309 return memcmp((void *)cfi1 + sizeof(cfi1->hash), 310 (void *)cfi2 + sizeof(cfi2->hash), 316 return jhash((void *)cfi + sizeof(cfi->hash), 317 sizeof(*cfi) - sizeof(cfi->hash), 0); 325 hlist_for_each_entry(obj, head, hash) { 334 hlist_add_head(&obj->hash, head); 343 hlist_add_head(&cfi->hash, head); 440 hash_add(file->insn_hash, &insn->hash, sec_offset_hash(sec, insn->offset));
|
/linux-master/scripts/mod/ |
H A D | modpost.c | 202 /* A hash of all exported symbols, 223 /* This is based on the hash algorithm from gdbm, via tdb */ 226 unsigned value; /* Used to compute the hash value. */ 237 * Allocate a new symbols for use in the hash of exported symbols or 250 /* For the hash of exported symbols */ 253 unsigned int hash; local 255 hash = tdb_hash(sym->name) % SYMBOL_HASH_SIZE; 256 sym->next = symbolhash[hash]; 257 symbolhash[hash] = sym;
|
/linux-master/drivers/md/ |
H A D | dm-integrity.c | 22 #include <crypto/hash.h> 1690 /* this shouldn't happen anyway, the hash functions have no reason to fail */ 2000 DMERR("Unexpected integrity data when using internal hash"); 3801 static int get_mac(struct crypto_shash **hash, struct alg_spec *a, char **error, argument 3807 *hash = crypto_alloc_shash(a->alg_string, 0, CRYPTO_ALG_ALLOCATES_MEMORY); 3808 if (IS_ERR(*hash)) { 3810 r = PTR_ERR(*hash); 3811 *hash = NULL; 3816 r = crypto_shash_setkey(*hash, a->key, a->key_size); 3821 } else if (crypto_shash_get_flags(*hash) [all...] |
/linux-master/block/ |
H A D | blk-mq.c | 320 INIT_HLIST_NODE(&rq->hash); 393 INIT_HLIST_NODE(&rq->hash);
|
/linux-master/net/sunrpc/auth_gss/ |
H A D | gss_krb5_crypto.c | 37 #include <crypto/hash.h> 297 * @tfm: an initialized hash transform 914 * @tfm: an initialized hash transform
|
/linux-master/net/ipv4/ |
H A D | nexthop.c | 473 unsigned int hash; local 477 hash = nh_dev_hashfn(dev->ifindex); 478 head = &net->nexthop.devhash[hash]; 1388 static struct nexthop *nexthop_select_path_fdb(struct nh_group *nhg, int hash) argument 1395 if (hash > atomic_read(&nhge->hthr.upper_bound)) 1406 static struct nexthop *nexthop_select_path_hthr(struct nh_group *nhg, int hash) argument 1412 return nexthop_select_path_fdb(nhg, hash); 1426 if (hash > atomic_read(&nhge->hthr.upper_bound)) 1439 static struct nexthop *nexthop_select_path_res(struct nh_group *nhg, int hash) argument 1442 u16 bucket_index = hash 1456 nexthop_select_path(struct nexthop *nh, int hash) argument 2626 unsigned int hash = nh_dev_hashfn(dev->ifindex); local 3802 unsigned int hash = nh_dev_hashfn(dev->ifindex); local [all...] |
H A D | inet_hashtables.c | 62 * The bindhash mutex for snum's hash chain must be held here. 298 u32 hash; local 302 hash = ipv6_portaddr_hash(sock_net(sk), 307 hash = ipv4_portaddr_hash(sock_net(sk), 310 return inet_lhash2_bucket(h, hash); 346 * @ehashfn: hash function used to generate the fallback hash. 504 unsigned int hash = inet_ehashfn(net, daddr, hnum, saddr, sport); local 505 unsigned int slot = hash & hashinfo->ehash_mask; 510 if (sk->sk_hash != hash) 551 unsigned int hash = inet_ehashfn(net, daddr, lport, local 864 u32 hash; local [all...] |
/linux-master/net/core/ |
H A D | sock.c | 3741 * A. Remove from hash tables. 3749 * did hash table lookup before we unhashed socket. They will achieve 4094 proto_method_implemented(proto->hash),
|
/linux-master/mm/ |
H A D | userfaultfd.c | 475 u32 hash; local 545 hash = hugetlb_fault_mutex_hash(mapping, idx); 546 mutex_lock(&hugetlb_fault_mutex_table[hash]); 553 mutex_unlock(&hugetlb_fault_mutex_table[hash]); 561 mutex_unlock(&hugetlb_fault_mutex_table[hash]); 569 mutex_unlock(&hugetlb_fault_mutex_table[hash]);
|
H A D | filemap.c | 31 #include <linux/hash.h> 1029 * waitqueues associated with pages. By using a hash table of 1034 * at a cost of "thundering herd" phenomena during rare hash
|
/linux-master/kernel/bpf/ |
H A D | bloom_filter.c | 23 static u32 hash(struct bpf_bloom_filter *bloom, void *value, function 43 h = hash(bloom, value, map->value_size, i); 61 h = hash(bloom, value, map->value_size, i); 106 * of hash functions 113 /* Default to using 5 hash functions if unspecified */ 118 * expected entries in the bloom filter and k is the number of hash
|
/linux-master/tools/objtool/include/objtool/ |
H A D | elf.h | 35 struct elf_hash_node hash; member in struct:section 52 struct elf_hash_node hash; member in struct:symbol 76 struct elf_hash_node hash; member in struct:reloc
|
/linux-master/scripts/kconfig/ |
H A D | util.c | 16 /* fnv32 hash */ 17 unsigned int hash = 2166136261U; local 20 hash = (hash ^ *s) * 0x01000193; 21 return hash; 24 /* hash table of all parsed Kconfig files */ 37 int hash = strhash(name); local 39 hash_for_each_possible(file_hashtable, file, node, hash) 49 hash_add(file_hashtable, &file->node, hash);
|
H A D | symbol.c | 814 int hash; local 824 hash = strhash(name); 826 hash_for_each_possible(sym_hashtable, symbol, node, hash) { 836 hash = 0; 846 hash_add(sym_hashtable, &symbol->node, hash); 854 int hash = 0; local 866 hash = strhash(name); 868 hash_for_each_possible(sym_hashtable, symbol, node, hash) {
|
/linux-master/net/rds/ |
H A D | send.c | 1047 int hash; local 1050 hash = RDS_MPATH_HASH(rs, RDS_MPATH_WORKERS); 1052 hash = RDS_MPATH_HASH(rs, conn->c_npaths); 1053 if (conn->c_npaths == 0 && hash != 0) { 1069 hash = 0; 1072 hash = 0; 1074 return hash;
|
/linux-master/net/ipv6/ |
H A D | raw.c | 149 __u8 hash; local 154 hash = raw_hashfunc(net, nexthdr); 155 hlist = &raw_v6_hashinfo.ht[hash]; 202 /* Not releasing hash table! */ 341 int hash; local 343 hash = raw_hashfunc(net, nexthdr); 344 hlist = &raw_v6_hashinfo.ht[hash]; 1216 .hash = raw_hash_sk,
|
/linux-master/include/linux/ |
H A D | kernfs.h | 39 * NR_KERNFS_LOCK_BITS determines size (NR_KERNFS_LOCKS) of hash 41 * Having a small hash table would impact scalability, since 43 * and having a very large hash table would waste memory. 45 * At the moment size of hash table of locks is being set based on 82 * object address as hash keys to get the index of these locks. 88 * kernfs_global_locks acts as a holder for all such hash tables. 208 unsigned int hash; /* ns + name hash */ member in struct:kernfs_node
|
/linux-master/fs/ubifs/ |
H A D | ubifs.h | 33 #include <crypto/hash.h> 718 * @log_hash: the log hash from the commit start node up to this bud 734 * @log_hash: the log hash from the commit start node up to this journal head 752 * @hash: the hash of the target node 763 u8 hash[UBIFS_HASH_ARR_SZ]; member in struct:ubifs_zbranch 1060 * @double_hash: flag indicating that we can do lookups by hash 1112 * @key_hash_type: type of the key hash 1113 * @key_hash: direntry key hash function 1251 * @hash_tfm: the hash transformatio 1588 ubifs_node_calc_hash(const struct ubifs_info *c, const void *buf, u8 *hash) argument 1634 ubifs_bad_hash(const struct ubifs_info *c, const void *node, const u8 *hash, int lnum, int offs) argument [all...] |
H A D | tnc_misc.c | 306 err = ubifs_node_check_hash(c, idx, zzbr->hash); 308 ubifs_bad_hash(c, idx, zzbr->hash, lnum, offs); 336 ubifs_copy_hash(c, ubifs_branch_hash(c, br), zbr->hash); 402 /* These can only be keys with colliding hash */ 517 err = ubifs_node_check_hash(c, node, zbr->hash); 519 ubifs_bad_hash(c, node, zbr->hash, zbr->lnum, zbr->offs);
|
H A D | tnc.c | 332 * cache directory entries for readdir and for resolving hash collisions. The 417 * (in it is there) or from the hash media, in which case the node is also 515 err = ubifs_node_check_hash(c, buf, zbr->hash); 517 ubifs_bad_hash(c, buf, zbr->hash, lnum, offs); 1746 err = ubifs_node_check_hash(c, buf, zbr->hash); 1748 ubifs_bad_hash(c, buf, zbr->hash, zbr->lnum, zbr->offs); 1840 * This function looks up and reads a node which contains name hash in the key. 1841 * Since the hash may have collisions, there may be many nodes with the same 1888 * This function looks up and reads a node which contains name hash in the key. 1889 * Since the hash ma 2311 ubifs_tnc_add(struct ubifs_info *c, const union ubifs_key *key, int lnum, int offs, int len, const u8 *hash) argument 2446 ubifs_tnc_add_nm(struct ubifs_info *c, const union ubifs_key *key, int lnum, int offs, int len, const u8 *hash, const struct fscrypt_name *nm) argument [all...] |
H A D | journal.c | 226 int len, struct shash_desc *hash) 243 err = ubifs_shash_update(c, hash, (void *)node, nodelen); 251 return ubifs_prepare_auth_node(c, node, hash); 719 dent_key_init_hash(c, &dent_key, dir->i_ino, nm->hash); 859 u8 hash[UBIFS_HASH_ARR_SZ]; local 926 err = ubifs_node_calc_hash(c, data, hash); 935 err = ubifs_tnc_add(c, key, lnum, offs, dlen, hash); 976 u8 hash[UBIFS_HASH_ARR_SZ]; local 1057 err = ubifs_node_calc_hash(c, ino, hash); 1081 err = ubifs_tnc_add(c, &key, lnum, offs, ilen, hash); 225 ubifs_hash_nodes(struct ubifs_info *c, void *node, int len, struct shash_desc *hash) argument 1855 u8 hash[UBIFS_HASH_ARR_SZ]; local 1976 u8 hash[UBIFS_HASH_ARR_SZ]; local [all...] |
H A D | dir.c | 225 if (nm.hash & ~UBIFS_S_KEY_HASH_MASK) 227 dent_key_init_hash(c, &key, dir->i_ino, nm.hash); 545 * UBIFS uses directory entry hash value for directory offsets, so
|
H A D | debug.c | 38 static const char *get_key_hash(int hash) argument 40 switch (hash) { 46 return "unknown/invalid name hash"; 1410 /* This can only be keys with colliding hash */ 2440 * ascending (parent ino, hash) order. 2457 ubifs_err(c, "larger hash %u goes before %u",
|
/linux-master/fs/kernfs/ |
H A D | dir.c | 16 #include <linux/hash.h> 306 * kernfs_name_hash - calculate hash of @ns + @name 307 * @name: Null terminated string to hash 308 * @ns: Namespace tag to hash 310 * Return: 31-bit hash of ns + name (so it fits in an off_t) 314 unsigned long hash = init_name_hash(ns); local 317 hash = partial_name_hash(*name++, hash); 318 hash = end_name_hash(hash); 328 kernfs_name_compare(unsigned int hash, const char *name, const void *ns, const struct kernfs_node *kn) argument 843 unsigned int hash; local 1792 kernfs_dir_pos(const void *ns, struct kernfs_node *parent, loff_t hash, struct kernfs_node *pos) argument [all...] |