Lines Matching refs:hashval
561 * Update the btree to show the new hashval for this child.
735 btree[0].hashval = cpu_to_be32(blk1->hashval);
737 btree[1].hashval = cpu_to_be32(blk2->hashval);
818 * (updating last hashval in the process).
894 ((be32_to_cpu(btree2[0].hashval) < be32_to_cpu(btree1[0].hashval)) ||
895 (be32_to_cpu(btree2[nodehdr2.count - 1].hashval) <
896 be32_to_cpu(btree1[nodehdr1.count - 1].hashval)))) {
977 * Record the last hashval from each block for upward propagation.
988 blk1->hashval = be32_to_cpu(btree1[nodehdr1.count - 1].hashval);
989 blk2->hashval = be32_to_cpu(btree2[nodehdr2.count - 1].hashval);
1035 btree[oldblk->index].hashval = cpu_to_be32(newblk->hashval);
1050 oldblk->hashval = be32_to_cpu(btree[nodehdr.count - 1].hashval);
1374 return be32_to_cpu(nodehdr.btree[nodehdr.count - 1].hashval);
1421 if (be32_to_cpu(btree[blk->index].hashval) == lasthash)
1423 blk->hashval = lasthash;
1424 btree[blk->index].hashval = cpu_to_be32(lasthash);
1429 lasthash = be32_to_cpu(btree[nodehdr.count - 1].hashval);
1479 drop_blk->hashval = be32_to_cpu(btree[index - 1].hashval);
1517 if ((be32_to_cpu(drop_btree[0].hashval) <
1518 be32_to_cpu(save_btree[0].hashval)) ||
1519 (be32_to_cpu(drop_btree[drop_hdr.count - 1].hashval) <
1520 be32_to_cpu(save_btree[save_hdr.count - 1].hashval))) {
1550 * Save the last hashval in the remaining block for upward propagation.
1552 save_blk->hashval = be32_to_cpu(save_btree[save_hdr.count - 1].hashval);
1564 * in each of the nodes where either the hashval is or should be.
1566 * We support duplicate hashval's so for each entry in the current
1567 * node that could contain the desired hashval, descend. This is a
1582 xfs_dahash_t hashval;
1597 * node to use, until the right hashval is found.
1620 blk->hashval = xfs_attr_leaf_lasthash(blk->bp, NULL);
1627 blk->hashval = xfs_dir2_leaf_lasthash(args->dp,
1662 blk->hashval = be32_to_cpu(btree[max - 1].hashval);
1668 hashval = args->hashval;
1671 btreehashval = be32_to_cpu(btree[probe].hashval);
1672 if (btreehashval < hashval)
1674 else if (btreehashval > hashval)
1681 (be32_to_cpu(btree[probe].hashval) == hashval));
1684 * Since we may have duplicate hashval's, find the first
1685 * matching hashval in the node.
1688 be32_to_cpu(btree[probe].hashval) >= hashval) {
1692 be32_to_cpu(btree[probe].hashval) < hashval) {
1716 * A leaf block that ends in the hashval that we are interested in
1717 * (final hashval == search hashval) means that the next block may
1718 * contain more entries with the same hashval, shift upward to the
1734 (blk->hashval == args->hashval)) {
1780 ((be32_to_cpu(btree2[0].hashval) < be32_to_cpu(btree1[0].hashval)) ||
1781 (be32_to_cpu(btree2[node2hdr.count - 1].hashval) <
1782 be32_to_cpu(btree1[node1hdr.count - 1].hashval)))) {
2060 blk->hashval = be32_to_cpu(btree[nodehdr.count - 1].hashval);
2072 blk->hashval = xfs_attr_leaf_lasthash(blk->bp, NULL);
2079 blk->hashval = xfs_dir2_leaf_lasthash(args->dp,
2324 dead_hash = be32_to_cpu(ents[leafhdr.count - 1].hashval);
2332 dead_hash = be32_to_cpu(btree[deadhdr.count - 1].hashval);
2395 be32_to_cpu(btree[entno].hashval) < dead_hash;