Lines Matching refs:hashval
576 * Update the btree to show the new hashval for this child.
750 btree[0].hashval = cpu_to_be32(blk1->hashval);
752 btree[1].hashval = cpu_to_be32(blk2->hashval);
833 * (updating last hashval in the process).
908 ((be32_to_cpu(btree2[0].hashval) < be32_to_cpu(btree1[0].hashval)) ||
909 (be32_to_cpu(btree2[nodehdr2.count - 1].hashval) <
910 be32_to_cpu(btree1[nodehdr1.count - 1].hashval)))) {
989 * Record the last hashval from each block for upward propagation.
1000 blk1->hashval = be32_to_cpu(btree1[nodehdr1.count - 1].hashval);
1001 blk2->hashval = be32_to_cpu(btree2[nodehdr2.count - 1].hashval);
1047 btree[oldblk->index].hashval = cpu_to_be32(newblk->hashval);
1062 oldblk->hashval = be32_to_cpu(btree[nodehdr.count - 1].hashval);
1386 return be32_to_cpu(nodehdr.btree[nodehdr.count - 1].hashval);
1433 if (be32_to_cpu(btree[blk->index].hashval) == lasthash)
1435 blk->hashval = lasthash;
1436 btree[blk->index].hashval = cpu_to_be32(lasthash);
1441 lasthash = be32_to_cpu(btree[nodehdr.count - 1].hashval);
1491 drop_blk->hashval = be32_to_cpu(btree[index - 1].hashval);
1529 if ((be32_to_cpu(drop_btree[0].hashval) <
1530 be32_to_cpu(save_btree[0].hashval)) ||
1531 (be32_to_cpu(drop_btree[drop_hdr.count - 1].hashval) <
1532 be32_to_cpu(save_btree[save_hdr.count - 1].hashval))) {
1562 * Save the last hashval in the remaining block for upward propagation.
1564 save_blk->hashval = be32_to_cpu(save_btree[save_hdr.count - 1].hashval);
1576 * in each of the nodes where either the hashval is or should be.
1578 * We support duplicate hashval's so for each entry in the current
1579 * node that could contain the desired hashval, descend. This is a
1594 xfs_dahash_t hashval;
1609 * node to use, until the right hashval is found.
1632 blk->hashval = xfs_attr_leaf_lasthash(blk->bp, NULL);
1639 blk->hashval = xfs_dir2_leaf_lasthash(args->dp,
1674 blk->hashval = be32_to_cpu(btree[max - 1].hashval);
1680 hashval = args->hashval;
1683 btreehashval = be32_to_cpu(btree[probe].hashval);
1684 if (btreehashval < hashval)
1686 else if (btreehashval > hashval)
1693 (be32_to_cpu(btree[probe].hashval) == hashval));
1696 * Since we may have duplicate hashval's, find the first
1697 * matching hashval in the node.
1700 be32_to_cpu(btree[probe].hashval) >= hashval) {
1704 be32_to_cpu(btree[probe].hashval) < hashval) {
1728 * A leaf block that ends in the hashval that we are interested in
1729 * (final hashval == search hashval) means that the next block may
1730 * contain more entries with the same hashval, shift upward to the
1746 (blk->hashval == args->hashval)) {
1792 ((be32_to_cpu(btree2[0].hashval) < be32_to_cpu(btree1[0].hashval)) ||
1793 (be32_to_cpu(btree2[node2hdr.count - 1].hashval) <
1794 be32_to_cpu(btree1[node1hdr.count - 1].hashval)))) {
2072 blk->hashval = be32_to_cpu(btree[nodehdr.count - 1].hashval);
2084 blk->hashval = xfs_attr_leaf_lasthash(blk->bp, NULL);
2091 blk->hashval = xfs_dir2_leaf_lasthash(args->dp,
2336 dead_hash = be32_to_cpu(ents[leafhdr.count - 1].hashval);
2344 dead_hash = be32_to_cpu(btree[deadhdr.count - 1].hashval);
2407 be32_to_cpu(btree[entno].hashval) < dead_hash;