lib/radix-tree.c

1213

index &= ~node_maxindex(node);

lib/radix-tree.c

1230

iter->index = (index &~ node_maxindex(node)) | offset;

lib/radix-tree.c

1231

iter->next_index = (index | node_maxindex(node)) + 1;

lib/radix-tree.c

1539

iter->next_index = 1 + min(max, (start | node_maxindex(node)));

lib/radix-tree.c

225

return (index & ~node_maxindex(node)) + (offset << node->shift);

lib/radix-tree.c

397

*maxindex = node_maxindex(node);

tools/testing/radix-tree/test.c

280

assert(maxindex <= node_maxindex(node));

tools/testing/radix-tree/test.h

56

unsigned long node_maxindex(struct radix_tree_node *);