148 	int max, action, error, i;  in xfs_da_split()  local
156 	max = state->path.active - 1;  in xfs_da_split()
157 	ASSERT((max >= 0) && (max < XFS_DA_NODE_MAXDEPTH));  in xfs_da_split()
158 	ASSERT(state->path.blk[max].magic == XFS_ATTR_LEAF_MAGIC ||  in xfs_da_split()
159 	       state->path.blk[max].magic == XFS_DIR2_LEAFN_MAGIC);  in xfs_da_split()
161 	addblk = &state->path.blk[max];		/* initial dummy value */  in xfs_da_split()
162 	for (i = max; (i >= 0) && addblk; state->path.active--, i--) {  in xfs_da_split()
207 							 max - i, &action);  in xfs_da_split()
1056 	int probe, span, max, error, retval;  in xfs_da_node_lookup_int()  local
1092 			max = be16_to_cpu(node->hdr.count);  in xfs_da_node_lookup_int()
1093 			blk->hashval = be32_to_cpu(node->btree[max-1].hashval);  in xfs_da_node_lookup_int()
1098 			probe = span = max / 2;  in xfs_da_node_lookup_int()
1111 			ASSERT((probe >= 0) && (probe < max));  in xfs_da_node_lookup_int()
1122 			while ((probe < max) && (be32_to_cpu(btree->hashval) < hashval)) {  in xfs_da_node_lookup_int()
1130 			if (probe == max) {  in xfs_da_node_lookup_int()
1131 				blk->index = max-1;  in xfs_da_node_lookup_int()
1132 				blkno = be32_to_cpu(node->btree[max-1].before);  in xfs_da_node_lookup_int()