| /kernel/linux/linux-5.10/fs/nfsd/ |
| H A D | filecache.c | 173 nfsd_file_alloc(struct inode *inode, unsigned int may, unsigned int hashval, in nfsd_file_alloc() argument
187 nf->nf_hashval = hashval; in nfsd_file_alloc()
508 __nfsd_file_close_inode(struct inode *inode, unsigned int hashval, in __nfsd_file_close_inode() argument
514 spin_lock(&nfsd_file_hashtbl[hashval].nfb_lock); in __nfsd_file_close_inode()
515 hlist_for_each_entry_safe(nf, tmp, &nfsd_file_hashtbl[hashval].nfb_head, nf_node) { in __nfsd_file_close_inode()
519 spin_unlock(&nfsd_file_hashtbl[hashval].nfb_lock); in __nfsd_file_close_inode()
534 unsigned int hashval = (unsigned int)hash_long(inode->i_ino, in nfsd_file_close_inode_sync() local
538 __nfsd_file_close_inode(inode, hashval, &dispose); in nfsd_file_close_inode_sync()
539 trace_nfsd_file_close_inode_sync(inode, hashval, !list_empty(&dispose)); in nfsd_file_close_inode_sync()
554 unsigned int hashval in nfsd_file_close_inode() local
883 nfsd_file_find_locked(struct inode *inode, unsigned int may_flags, unsigned int hashval, struct net *net) nfsd_file_find_locked() argument
919 unsigned int hashval; nfsd_file_is_cached() local
944 unsigned int hashval; nfsd_file_acquire() local
[all...] |
| /kernel/linux/linux-5.10/fs/xfs/ |
| H A D | xfs_attr_list.c | 42 (!((cursor)->initted) && !((cursor)->hashval) && \
46 * Shortform attribute lists are not stored in hashval sorted order.
110 * It didn't all fit, so we have to sort everything on hashval. in xfs_attr_shortform_list()
156 if (sbp->hash == cursor->hashval) { in xfs_attr_shortform_list()
161 } else if (sbp->hash > cursor->hashval) { in xfs_attr_shortform_list()
172 if (cursor->hashval != sbp->hash) { in xfs_attr_shortform_list()
173 cursor->hashval = sbp->hash; in xfs_attr_shortform_list()
253 if (cursor->hashval <= be32_to_cpu(btree->hashval)) { in xfs_attr_node_list_lookup()
301 * If anything is amiss, ignore the cursor and look up the hashval in xfs_attr_node_list()
[all...] |
| /kernel/linux/linux-6.6/fs/xfs/ |
| H A D | xfs_attr_list.c | 43 (!((cursor)->initted) && !((cursor)->hashval) && \
47 * Shortform attribute lists are not stored in hashval sorted order.
110 * It didn't all fit, so we have to sort everything on hashval. in xfs_attr_shortform_list()
156 if (sbp->hash == cursor->hashval) { in xfs_attr_shortform_list()
161 } else if (sbp->hash > cursor->hashval) { in xfs_attr_shortform_list()
172 if (cursor->hashval != sbp->hash) { in xfs_attr_shortform_list()
173 cursor->hashval = sbp->hash; in xfs_attr_shortform_list()
253 if (cursor->hashval <= be32_to_cpu(btree->hashval)) { in xfs_attr_node_list_lookup()
301 * If anything is amiss, ignore the cursor and look up the hashval in xfs_attr_node_list()
[all...] |
| /kernel/linux/linux-5.10/fs/xfs/libxfs/ |
| H A D | xfs_da_btree.c | 561 * Update the btree to show the new hashval for this child. in xfs_da3_split()
735 btree[0].hashval = cpu_to_be32(blk1->hashval); in xfs_da3_root_split()
737 btree[1].hashval = cpu_to_be32(blk2->hashval); in xfs_da3_root_split()
818 * (updating last hashval in the process). in xfs_da3_node_split()
894 ((be32_to_cpu(btree2[0].hashval) < be32_to_cpu(btree1[0].hashval)) || in xfs_da3_node_rebalance()
895 (be32_to_cpu(btree2[nodehdr2.count - 1].hashval) < in xfs_da3_node_rebalance()
896 be32_to_cpu(btree1[nodehdr1.count - 1].hashval)))) { in xfs_da3_node_rebalance()
1582 xfs_dahash_t hashval; xfs_da3_node_lookup_int() local
[all...] |
| H A D | xfs_attr_leaf.c | 250 __u32 hashval; in xfs_attr3_leaf_verify_entry() local
253 hashval = be32_to_cpu(ent->hashval); in xfs_attr3_leaf_verify_entry()
254 if (hashval < *last_hashval) in xfs_attr3_leaf_verify_entry()
256 *last_hashval = hashval; in xfs_attr3_leaf_verify_entry()
951 nargs.hashval = xfs_da_hashname(sfe->nameval, in xfs_attr_shortform_to_leaf()
1159 nargs.hashval = be32_to_cpu(entry->hashval); in xfs_attr3_leaf_to_shortform()
1226 icnodehdr.btree[0].hashval = entries[icleafhdr.count - 1].hashval; in xfs_attr3_leaf_to_node()
2373 xfs_dahash_t hashval; xfs_attr3_leaf_lookup_int() local
[all...] |
| H A D | xfs_dir2_block.c | 454 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) in xfs_dir2_block_addname()
456 if (hash < args->hashval) in xfs_dir2_block_addname()
461 while (mid >= 0 && be32_to_cpu(blp[mid].hashval) >= args->hashval) { in xfs_dir2_block_addname()
555 blp[mid].hashval = cpu_to_be32(args->hashval); in xfs_dir2_block_addname()
713 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) in xfs_dir2_block_lookup_int()
715 if (hash < args->hashval) in xfs_dir2_block_lookup_int()
[all...] |
| H A D | xfs_dir2_node.c | 536 ASSERT(index == 0 || be32_to_cpu(ents[index - 1].hashval) <= args->hashval); in xfs_dir2_leafn_add()
538 be32_to_cpu(ents[index].hashval) >= args->hashval); in xfs_dir2_leafn_add()
564 lep->hashval = cpu_to_be32(args->hashval); in xfs_dir2_leafn_add()
617 return be32_to_cpu(leafhdr.ents[leafhdr.count - 1].hashval); in xfs_dir2_leaf_lasthash()
677 index < leafhdr.count && be32_to_cpu(lep->hashval) == args->hashval; in xfs_dir2_leafn_lookup_for_addname()
825 index < leafhdr.count && be32_to_cpu(lep->hashval) in xfs_dir2_leafn_lookup_for_entry()
[all...] |
| H A D | xfs_da_btree.h | 64 xfs_dahash_t hashval; /* hash value of name */ member
114 xfs_dahash_t hashval; /* last hash value in block */ member
|
| H A D | xfs_da_format.h | 82 __be32 hashval; /* hash value for this descendant */ member
428 __be32 hashval; /* hash value of name */ member
548 * then that int is used as the index into the Btree. Since the hashval
613 __be32 hashval; /* hash value of name */ member
|
| H A D | xfs_attr.h | 16 * then that int is used as the index into the Btree. Since the hashval
35 __u32 hashval; /* hash value of next entry to add */ member
|
| /kernel/linux/linux-6.6/fs/xfs/libxfs/ |
| H A D | xfs_da_btree.c | 576 * Update the btree to show the new hashval for this child. in xfs_da3_split()
750 btree[0].hashval = cpu_to_be32(blk1->hashval); in xfs_da3_root_split()
752 btree[1].hashval = cpu_to_be32(blk2->hashval); in xfs_da3_root_split()
833 * (updating last hashval in the process). in xfs_da3_node_split()
908 ((be32_to_cpu(btree2[0].hashval) < be32_to_cpu(btree1[0].hashval)) || in xfs_da3_node_rebalance()
909 (be32_to_cpu(btree2[nodehdr2.count - 1].hashval) < in xfs_da3_node_rebalance()
910 be32_to_cpu(btree1[nodehdr1.count - 1].hashval)))) { in xfs_da3_node_rebalance()
1594 xfs_dahash_t hashval; xfs_da3_node_lookup_int() local
[all...] |
| H A D | xfs_attr_leaf.c | 252 __u32 hashval; in xfs_attr3_leaf_verify_entry() local
255 hashval = be32_to_cpu(ent->hashval); in xfs_attr3_leaf_verify_entry()
256 if (hashval < *last_hashval) in xfs_attr3_leaf_verify_entry()
258 *last_hashval = hashval; in xfs_attr3_leaf_verify_entry()
984 nargs.hashval = xfs_da_hashname(sfe->nameval, in xfs_attr_shortform_to_leaf()
1199 nargs.hashval = be32_to_cpu(entry->hashval); in xfs_attr3_leaf_to_shortform()
1271 icnodehdr.btree[0].hashval = entries[icleafhdr.count - 1].hashval; in xfs_attr3_leaf_to_node()
2417 xfs_dahash_t hashval; xfs_attr3_leaf_lookup_int() local
[all...] |
| H A D | xfs_dir2_block.c | 454 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) in xfs_dir2_block_addname()
456 if (hash < args->hashval) in xfs_dir2_block_addname()
461 while (mid >= 0 && be32_to_cpu(blp[mid].hashval) >= args->hashval) { in xfs_dir2_block_addname()
555 blp[mid].hashval = cpu_to_be32(args->hashval); in xfs_dir2_block_addname()
713 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval) in xfs_dir2_block_lookup_int()
715 if (hash < args->hashval) in xfs_dir2_block_lookup_int()
[all...] |
| H A D | xfs_dir2_node.c | 536 ASSERT(index == 0 || be32_to_cpu(ents[index - 1].hashval) <= args->hashval); in xfs_dir2_leafn_add()
538 be32_to_cpu(ents[index].hashval) >= args->hashval); in xfs_dir2_leafn_add()
564 lep->hashval = cpu_to_be32(args->hashval); in xfs_dir2_leafn_add()
617 return be32_to_cpu(leafhdr.ents[leafhdr.count - 1].hashval); in xfs_dir2_leaf_lasthash()
677 index < leafhdr.count && be32_to_cpu(lep->hashval) == args->hashval; in xfs_dir2_leafn_lookup_for_addname()
825 index < leafhdr.count && be32_to_cpu(lep->hashval) in xfs_dir2_leafn_lookup_for_entry()
[all...] |
| H A D | xfs_da_btree.h | 64 xfs_dahash_t hashval; /* hash value of name */ member
120 xfs_dahash_t hashval; /* last hash value in block */ member
|
| H A D | xfs_da_format.h | 82 __be32 hashval; /* hash value for this descendant */ member
429 __be32 hashval; /* hash value of name */ member
549 * then that int is used as the index into the Btree. Since the hashval
614 __be32 hashval; /* hash value of name */ member
|
| /kernel/linux/linux-5.10/fs/xfs/scrub/ |
| H A D | dabtree.c | 116 parent_hash = be32_to_cpu(entry->hashval); in xchk_da_btree_hash()
392 blk->hashval = xfs_attr_leaf_lasthash(blk->bp, pmaxrecs); in xchk_da_btree_block()
401 blk->hashval = xfs_dir2_leaf_lasthash(ip, blk->bp, pmaxrecs); in xchk_da_btree_block()
410 blk->hashval = xfs_dir2_leaf_lasthash(ip, blk->bp, pmaxrecs); in xchk_da_btree_block()
423 blk->hashval = be32_to_cpu(btree[*pmaxrecs - 1].hashval); in xchk_da_btree_block()
446 * its hashval match what the parent block expected to see? in xchk_da_btree_block()
452 if (be32_to_cpu(key->hashval) != blk->hashval) { in xchk_da_btree_block()
558 error = xchk_da_btree_hash(&ds, level, &key->hashval); in xchk_da_btree()
[all...] |
| H A D | attr.c | 157 args.hashval = xfs_da_hashname(args.name, args.namelen); in xchk_xattr_listent()
265 if (be32_to_cpu(ent->hashval) < *last_hashval) in xchk_xattr_entry()
267 *last_hashval = be32_to_cpu(ent->hashval); in xchk_xattr_entry()
428 error = xchk_da_btree_hash(ds, level, &ent->hashval); in xchk_xattr_rec()
442 hash = be32_to_cpu(ent->hashval); in xchk_xattr_rec()
|
| /kernel/linux/linux-6.6/fs/xfs/scrub/ |
| H A D | dabtree.c | 117 parent_hash = be32_to_cpu(entry->hashval); in xchk_da_btree_hash()
393 blk->hashval = xfs_attr_leaf_lasthash(blk->bp, pmaxrecs); in xchk_da_btree_block()
402 blk->hashval = xfs_dir2_leaf_lasthash(ip, blk->bp, pmaxrecs); in xchk_da_btree_block()
411 blk->hashval = xfs_dir2_leaf_lasthash(ip, blk->bp, pmaxrecs); in xchk_da_btree_block()
424 blk->hashval = be32_to_cpu(btree[*pmaxrecs - 1].hashval); in xchk_da_btree_block()
447 * its hashval match what the parent block expected to see? in xchk_da_btree_block()
453 if (be32_to_cpu(key->hashval) != blk->hashval) { in xchk_da_btree_block()
562 error = xchk_da_btree_hash(ds, level, &key->hashval); in xchk_da_btree()
[all...] |
| H A D | attr.c | 169 .hashval = xfs_da_hashname(name, namelen), in xchk_xattr_listent()
327 if (be32_to_cpu(ent->hashval) < *last_hashval) in xchk_xattr_entry()
329 *last_hashval = be32_to_cpu(ent->hashval); in xchk_xattr_entry()
481 error = xchk_da_btree_hash(ds, level, &ent->hashval); in xchk_xattr_rec()
495 hash = be32_to_cpu(ent->hashval); in xchk_xattr_rec()
|
| /kernel/linux/linux-5.10/fs/ |
| H A D | inode.c | 512 static unsigned long hash(struct super_block *sb, unsigned long hashval) in hash() argument
516 tmp = (hashval * (unsigned long)sb) ^ (GOLDEN_RATIO_PRIME + hashval) / in hash()
525 * @hashval: unsigned long value used to locate this object in the
530 void __insert_inode_hash(struct inode *inode, unsigned long hashval) in __insert_inode_hash() argument
532 struct hlist_head *b = inode_hashtable + hash(inode->i_sb, hashval); in __insert_inode_hash()
1135 * @hashval: hash value (usually inode number) to get
1140 * Search for the inode specified by @hashval and @data in the inode cache,
1152 struct inode *inode_insert5(struct inode *inode, unsigned long hashval, in inode_insert5() argument
1156 struct hlist_head *head = inode_hashtable + hash(inode->i_sb, hashval); in inode_insert5()
1221 iget5_locked(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), int (*set)(struct inode *, void *), void *data) iget5_locked() argument
1408 ilookup5_nowait(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), void *data) ilookup5_nowait() argument
1439 ilookup5(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), void *data) ilookup5() argument
1509 find_inode_nowait(struct super_block *sb, unsigned long hashval, int (*match)(struct inode *, unsigned long, void *), void *data) find_inode_nowait() argument
1557 find_inode_rcu(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), void *data) find_inode_rcu() argument
1661 insert_inode_locked4(struct inode *inode, unsigned long hashval, int (*test)(struct inode *, void *), void *data) insert_inode_locked4() argument
[all...] |
| /kernel/linux/linux-6.6/fs/ |
| H A D | inode.c | 510 static unsigned long hash(struct super_block *sb, unsigned long hashval) in hash() argument
514 tmp = (hashval * (unsigned long)sb) ^ (GOLDEN_RATIO_PRIME + hashval) / in hash()
523 * @hashval: unsigned long value used to locate this object in the
528 void __insert_inode_hash(struct inode *inode, unsigned long hashval) in __insert_inode_hash() argument
530 struct hlist_head *b = inode_hashtable + hash(inode->i_sb, hashval); in __insert_inode_hash()
1174 * @hashval: hash value (usually inode number) to get
1179 * Search for the inode specified by @hashval and @data in the inode cache,
1191 struct inode *inode_insert5(struct inode *inode, unsigned long hashval, in inode_insert5() argument
1195 struct hlist_head *head = inode_hashtable + hash(inode->i_sb, hashval); in inode_insert5()
1264 iget5_locked(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), int (*set)(struct inode *, void *), void *data) iget5_locked() argument
1451 ilookup5_nowait(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), void *data) ilookup5_nowait() argument
1482 ilookup5(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), void *data) ilookup5() argument
1552 find_inode_nowait(struct super_block *sb, unsigned long hashval, int (*match)(struct inode *, unsigned long, void *), void *data) find_inode_nowait() argument
1600 find_inode_rcu(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), void *data) find_inode_rcu() argument
1704 insert_inode_locked4(struct inode *inode, unsigned long hashval, int (*test)(struct inode *, void *), void *data) insert_inode_locked4() argument
[all...] |
| /kernel/linux/linux-5.10/include/trace/events/ |
| H A D | kmem.h | 326 unsigned long hashval; in mm_ptr_to_hash() local
328 ret = ptr_to_hashval(ptr, &hashval); in mm_ptr_to_hash()
333 return (unsigned int)hashval; in mm_ptr_to_hash()
|
| /kernel/linux/linux-6.6/include/trace/events/ |
| H A D | kmem.h | 314 unsigned long hashval; in mm_ptr_to_hash() local
316 ret = ptr_to_hashval(ptr, &hashval); in mm_ptr_to_hash()
321 return (unsigned int)hashval; in mm_ptr_to_hash()
|
| /kernel/linux/linux-5.10/net/ipv4/netfilter/ |
| H A D | ipt_CLUSTERIP.c | 341 unsigned long hashval; in clusterip_hashfn() local
361 hashval = jhash_1word(ntohl(iph->saddr), in clusterip_hashfn()
365 hashval = jhash_2words(ntohl(iph->saddr), sport, in clusterip_hashfn()
369 hashval = jhash_3words(ntohl(iph->saddr), sport, dport, in clusterip_hashfn()
374 hashval = 0; in clusterip_hashfn()
383 return reciprocal_scale(hashval, config->num_total_nodes) + 1; in clusterip_hashfn()
|