122 #define INIT_RADIX_TREE(root, mask)					\  argument
124 	(root)->height = 0;						\
125 	(root)->gfp_mask = (mask);					\
126 	(root)->rnode = NULL;						\
263 int __radix_tree_create(struct radix_tree_root *root, unsigned long index,
266 void *__radix_tree_lookup(struct radix_tree_root *root, unsigned long index,
270 bool __radix_tree_delete_node(struct radix_tree_root *root,
275 radix_tree_gang_lookup(struct radix_tree_root *root, void **results,
277 unsigned int radix_tree_gang_lookup_slot(struct radix_tree_root *root,
283 void *radix_tree_tag_set(struct radix_tree_root *root,
285 void *radix_tree_tag_clear(struct radix_tree_root *root,
287 int radix_tree_tag_get(struct radix_tree_root *root,
290 radix_tree_gang_lookup_tag(struct radix_tree_root *root, void **results,
294 radix_tree_gang_lookup_tag_slot(struct radix_tree_root *root, void ***results,
297 unsigned long radix_tree_range_tag_if_tagged(struct radix_tree_root *root,
301 int radix_tree_tagged(struct radix_tree_root *root, unsigned int tag);
302 unsigned long radix_tree_locate_item(struct radix_tree_root *root, void *item);
369 void **radix_tree_next_chunk(struct radix_tree_root *root,
456 #define radix_tree_for_each_chunk(slot, root, iter, start, flags)	\  argument
458 	      (slot = radix_tree_next_chunk(root, iter, flags)) ;)
483 #define radix_tree_for_each_slot(slot, root, iter, start)		\  argument
485 	     slot || (slot = radix_tree_next_chunk(root, iter, 0)) ;	\
498 #define radix_tree_for_each_contig(slot, root, iter, start)		\  argument
500 	     slot || (slot = radix_tree_next_chunk(root, iter,		\
516 #define radix_tree_for_each_tagged(slot, root, iter, start, tag)	\  argument
518 	     slot || (slot = radix_tree_next_chunk(root, iter,		\