Searched refs:hashval (Results 1 - 25 of 29) sorted by relevance

12

/linux-master/fs/xfs/
H A Dxfs_attr_list.c44 (!((cursor)->initted) && !((cursor)->hashval) && \
48 * Shortform attribute lists are not stored in hashval sorted order.
112 * It didn't all fit, so we have to sort everything on hashval.
159 if (sbp->hash == cursor->hashval) {
164 } else if (sbp->hash > cursor->hashval) {
175 if (cursor->hashval != sbp->hash) {
176 cursor->hashval = sbp->hash;
257 if (cursor->hashval <= be32_to_cpu(btree->hashval)) {
308 * If anything is amiss, ignore the cursor and look up the hashval
[all...]
H A Dxfs_trace.h97 __field(u32, hashval)
110 __entry->hashval = ctx->cursor.hashval;
123 __entry->hashval,
321 __field(u32, hashval)
336 __entry->hashval = ctx->cursor.hashval;
344 __entry->bt_hashval = be32_to_cpu(btree->hashval);
349 "node hashval %u, node before %u",
352 __entry->hashval,
[all...]
H A Dxfs_attr_item.c539 args->hashval = xfs_da_hashname(args->name, args->namelen);
/linux-master/fs/xfs/libxfs/
H A Dxfs_da_btree.c602 * Update the btree to show the new hashval for this child.
758 btree[0].hashval = cpu_to_be32(blk1->hashval);
760 btree[1].hashval = cpu_to_be32(blk2->hashval);
841 * (updating last hashval in the process).
916 ((be32_to_cpu(btree2[0].hashval) < be32_to_cpu(btree1[0].hashval)) ||
917 (be32_to_cpu(btree2[nodehdr2.count - 1].hashval) <
918 be32_to_cpu(btree1[nodehdr1.count - 1].hashval)))) {
1595 xfs_dahash_t hashval; local
[all...]
H A Dxfs_attr_leaf.c253 __u32 hashval; local
256 hashval = be32_to_cpu(ent->hashval);
257 if (hashval < *last_hashval)
259 *last_hashval = hashval;
914 nargs.hashval = xfs_da_hashname(sfe->nameval,
1121 nargs.hashval = be32_to_cpu(entry->hashval);
1189 icnodehdr.btree[0].hashval = entries[icleafhdr.count - 1].hashval;
2336 xfs_dahash_t hashval; local
[all...]
H A Dxfs_dir2_block.c456 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval)
458 if (hash < args->hashval)
463 while (mid >= 0 && be32_to_cpu(blp[mid].hashval) >= args->hashval) {
557 blp[mid].hashval = cpu_to_be32(args->hashval);
715 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval)
717 if (hash < args->hashval)
[all...]
H A Dxfs_da_btree.h64 xfs_dahash_t hashval; /* hash value of name */ member in struct:xfs_da_args
120 xfs_dahash_t hashval; /* last hash value in block */ member in struct:xfs_da_state_blk
H A Dxfs_dir2_node.c540 ASSERT(index == 0 || be32_to_cpu(ents[index - 1].hashval) <= args->hashval);
542 be32_to_cpu(ents[index].hashval) >= args->hashval);
568 lep->hashval = cpu_to_be32(args->hashval);
621 return be32_to_cpu(leafhdr.ents[leafhdr.count - 1].hashval);
681 index < leafhdr.count && be32_to_cpu(lep->hashval) == args->hashval;
831 index < leafhdr.count && be32_to_cpu(lep->hashval)
[all...]
H A Dxfs_da_format.h82 __be32 hashval; /* hash value for this descendant */ member in struct:xfs_da_node_entry
440 __be32 hashval; /* hash value of name */ member in struct:xfs_dir2_leaf_entry
560 * then that int is used as the index into the Btree. Since the hashval
630 __be32 hashval; /* hash value of name */ member in struct:xfs_attr_leaf_entry
H A Dxfs_attr.h16 * 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 in struct:xfs_attrlist_cursor_kern
H A Dxfs_dir2.c291 args->hashval = xfs_dir2_hashname(dp->i_mount, name);
381 args->hashval = xfs_dir2_hashname(dp->i_mount, name);
453 args->hashval = xfs_dir2_hashname(dp->i_mount, name);
514 args->hashval = xfs_dir2_hashname(dp->i_mount, name);
H A Dxfs_dir2_leaf.c174 if (be32_to_cpu(hdr->ents[i].hashval) >
175 be32_to_cpu(hdr->ents[i + 1].hashval))
675 index < leafhdr.count && be32_to_cpu(lep->hashval) == args->hashval;
901 lep->hashval = cpu_to_be32(args->hashval);
1260 be32_to_cpu(lep->hashval) == args->hashval;
1567 hashwant = args->hashval;
1570 if ((hash = be32_to_cpu(lep[mid].hashval))
[all...]
H A Dxfs_dir2_data.c242 be32_to_cpu(lep[i].hashval) == hash)
261 if (i > 0 && be32_to_cpu(lep[i].hashval) <
262 be32_to_cpu(lep[i - 1].hashval))
H A Dxfs_attr.c269 args->hashval = xfs_da_hashname(args->name, args->namelen);
942 args->hashval = xfs_da_hashname(args->name, args->namelen);
/linux-master/fs/xfs/scrub/
H A Ddabtree.c117 parent_hash = be32_to_cpu(entry->hashval);
393 blk->hashval = xfs_attr_leaf_lasthash(blk->bp, pmaxrecs);
402 blk->hashval = xfs_dir2_leaf_lasthash(ip, blk->bp, pmaxrecs);
411 blk->hashval = xfs_dir2_leaf_lasthash(ip, blk->bp, pmaxrecs);
424 blk->hashval = be32_to_cpu(btree[*pmaxrecs - 1].hashval);
447 * its hashval match what the parent block expected to see?
453 if (be32_to_cpu(key->hashval) != blk->hashval) {
562 error = xchk_da_btree_hash(ds, level, &key->hashval);
[all...]
H A Dattr.c169 .hashval = xfs_da_hashname(name, namelen),
327 if (be32_to_cpu(ent->hashval) < *last_hashval)
329 *last_hashval = be32_to_cpu(ent->hashval);
481 error = xchk_da_btree_hash(ds, level, &ent->hashval);
495 hash = be32_to_cpu(ent->hashval);
H A Dreaddir.c324 .hashval = xfs_dir2_hashname(dp->i_mount, name),
H A Ddir.c181 error = xchk_da_btree_hash(ds, level, &ent->hashval);
242 hash = be32_to_cpu(ent->hashval);
518 hash = be32_to_cpu(leafhdr.ents[i].hashval);
/linux-master/fs/
H A Dinode.c510 static unsigned long hash(struct super_block *sb, unsigned long hashval) argument
514 tmp = (hashval * (unsigned long)sb) ^ (GOLDEN_RATIO_PRIME + hashval) /
523 * @hashval: unsigned long value used to locate this object in the
528 void __insert_inode_hash(struct inode *inode, unsigned long hashval) argument
530 struct hlist_head *b = inode_hashtable + hash(inode->i_sb, hashval);
1138 * @hashval: hash value (usually inode number) to get
1143 * Search for the inode specified by @hashval and @data in the inode cache,
1155 struct inode *inode_insert5(struct inode *inode, unsigned long hashval, argument
1159 struct hlist_head *head = inode_hashtable + hash(inode->i_sb, hashval);
1228 iget5_locked(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), int (*set)(struct inode *, void *), void *data) argument
1415 ilookup5_nowait(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), void *data) argument
1446 ilookup5(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), void *data) argument
1516 find_inode_nowait(struct super_block *sb, unsigned long hashval, int (*match)(struct inode *, unsigned long, void *), void *data) argument
1564 find_inode_rcu(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), void *data) argument
1668 insert_inode_locked4(struct inode *inode, unsigned long hashval, int (*test)(struct inode *, void *), void *data) argument
[all...]
/linux-master/include/trace/events/
H A Dkmem.h352 unsigned long hashval; local
354 ret = ptr_to_hashval(ptr, &hashval);
359 return (unsigned int)hashval;
/linux-master/lib/
H A Dvsprintf.c780 unsigned long hashval; local
789 hashval = (unsigned long)siphash_1u64((u64)ptr, &ptr_key);
794 hashval = hashval & 0xffffffff;
796 hashval = (unsigned long)siphash_1u32((u32)ptr, &ptr_key);
798 *hashval_out = hashval;
811 unsigned long hashval; local
823 hashval = hash_long((unsigned long)ptr, 32);
824 return pointer_string(buf, end, (const void *)hashval, spec);
827 ret = __ptr_to_hashval(ptr, &hashval);
[all...]
/linux-master/fs/smb/server/
H A Dvfs_cache.c59 static unsigned long inode_hash(struct super_block *sb, unsigned long hashval) argument
63 tmp = (hashval * (unsigned long)sb) ^ (GOLDEN_RATIO_PRIME + hashval) /
/linux-master/fs/isofs/
H A Dinode.c1538 unsigned long hashval; local
1549 hashval = (block << sb->s_blocksize_bits) | offset;
1551 inode = iget5_locked(sb, hashval, &isofs_iget5_test,
/linux-master/include/linux/
H A Dfs.h3023 unsigned long hashval, int (*test)(struct inode *, void *),
3025 extern struct inode *ilookup5(struct super_block *sb, unsigned long hashval,
3029 extern struct inode *inode_insert5(struct inode *inode, unsigned long hashval,
3094 extern void __insert_inode_hash(struct inode *, unsigned long hashval);
/linux-master/fs/ext4/
H A Dnamei.c1192 __u32 hashval; local
1267 hashval = ~0;
1269 frame, frames, &hashval);
1270 *next_hash = hashval;
1281 (count && ((hashval & 1) == 0)))

Completed in 413 milliseconds

12