node_maxindex     234 lib/radix-tree.c 	return (index & ~node_maxindex(node)) + (offset << node->shift);
node_maxindex     406 lib/radix-tree.c 		*maxindex = node_maxindex(node);
node_maxindex    1222 lib/radix-tree.c 			index &= ~node_maxindex(node);
node_maxindex    1239 lib/radix-tree.c 	iter->index = (index &~ node_maxindex(node)) | offset;
node_maxindex    1240 lib/radix-tree.c 	iter->next_index = (index | node_maxindex(node)) + 1;
node_maxindex    1548 lib/radix-tree.c 		iter->next_index = 1 + min(max, (start | node_maxindex(node)));
node_maxindex     280 tools/testing/radix-tree/test.c 	assert(maxindex <= node_maxindex(node));
node_maxindex      56 tools/testing/radix-tree/test.h unsigned long node_maxindex(struct radix_tree_node *);