xfs/libxfs/xfs_da_btree.c

602 		 * 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)))) {
997 	 * Record the last hashval from each block for upward propagation.
1008 	blk1->hashval = be32_to_cpu(btree1[nodehdr1.count - 1].hashval);
1009 	blk2->hashval = be32_to_cpu(btree2[nodehdr2.count - 1].hashval);
1055 	btree[oldblk->index].hashval = cpu_to_be32(newblk->hashval);
1070 	oldblk->hashval = be32_to_cpu(btree[nodehdr.count - 1].hashval);
1387 	return be32_to_cpu(nodehdr.btree[nodehdr.count - 1].hashval);
1434 		if (be32_to_cpu(btree[blk->index].hashval) == lasthash)
1436 		blk->hashval = lasthash;
1437 		btree[blk->index].hashval = cpu_to_be32(lasthash);
1442 		lasthash = be32_to_cpu(btree[nodehdr.count - 1].hashval);
1492 	drop_blk->hashval = be32_to_cpu(btree[index - 1].hashval);
1530 	if ((be32_to_cpu(drop_btree[0].hashval) <
1531 			be32_to_cpu(save_btree[0].hashval)) ||
1532 	    (be32_to_cpu(drop_btree[drop_hdr.count - 1].hashval) <
1533 			be32_to_cpu(save_btree[save_hdr.count - 1].hashval))) {
1563 	 * Save the last hashval in the remaining block for upward propagation.
1565 	save_blk->hashval = be32_to_cpu(save_btree[save_hdr.count - 1].hashval);
1577  * in each of the nodes where either the hashval is or should be.
1579  * We support duplicate hashval's so for each entry in the current
1580  * node that could contain the desired hashval, descend.  This is a
1595 	xfs_dahash_t		hashval;
1610 	 * node to use, until the right hashval is found.
1633 			blk->hashval = xfs_attr_leaf_lasthash(blk->bp, NULL);
1640 			blk->hashval = xfs_dir2_leaf_lasthash(args->dp,
1678 		blk->hashval = be32_to_cpu(btree[max - 1].hashval);
1684 		hashval = args->hashval;
1687 			btreehashval = be32_to_cpu(btree[probe].hashval);
1688 			if (btreehashval < hashval)
1690 			else if (btreehashval > hashval)
1697 			(be32_to_cpu(btree[probe].hashval) == hashval));
1700 		 * Since we may have duplicate hashval's, find the first
1701 		 * matching hashval in the node.
1704 		       be32_to_cpu(btree[probe].hashval) >= hashval) {
1708 		       be32_to_cpu(btree[probe].hashval) < hashval) {
1736 	 * A leaf block that ends in the hashval that we are interested in
1737 	 * (final hashval == search hashval) means that the next block may
1738 	 * contain more entries with the same hashval, shift upward to the
1755 		    (blk->hashval == args->hashval)) {
1801 	    ((be32_to_cpu(btree2[0].hashval) < be32_to_cpu(btree1[0].hashval)) ||
1802 	     (be32_to_cpu(btree2[node2hdr.count - 1].hashval) <
1803 	      be32_to_cpu(btree1[node1hdr.count - 1].hashval)))) {
2081 			blk->hashval = be32_to_cpu(btree[nodehdr.count - 1].hashval);
2093 			blk->hashval = xfs_attr_leaf_lasthash(blk->bp, NULL);
2100 			blk->hashval = xfs_dir2_leaf_lasthash(args->dp,
2349 		dead_hash = be32_to_cpu(ents[leafhdr.count - 1].hashval);
2357 		dead_hash = be32_to_cpu(btree[deadhdr.count - 1].hashval);
2423 		     be32_to_cpu(btree[entno].hashval) < dead_hash;