106 bool is_sibling_entry(const struct radix_tree_node *parent, void *node)  in is_sibling_entry()
114 bool is_sibling_entry(const struct radix_tree_node *parent, void *node)  in is_sibling_entry()
152 static inline void tag_set(struct radix_tree_node *node, unsigned int tag,  in tag_set()
158 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag,  in tag_clear()
164 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag,  in tag_get()
204 static inline int any_tag_set(const struct radix_tree_node *node,  in any_tag_set()
215 static inline void all_tag_set(struct radix_tree_node *node, unsigned int tag)  in all_tag_set()
232 radix_tree_find_next_bit(struct radix_tree_node *node, unsigned int tag,  in radix_tree_find_next_bit()
268 static inline unsigned long node_maxindex(const struct radix_tree_node *node)  in node_maxindex()
274 				const struct radix_tree_node *node,  in next_index()
281 static void dump_node(struct radix_tree_node *node, unsigned long index)  in dump_node()
332 		struct radix_tree_node *node = entry_to_node(entry);  in dump_ida_node()  local
437 	struct radix_tree_node *node =  in radix_tree_node_rcu_free()  local
453 radix_tree_node_free(struct radix_tree_node *node)  in radix_tree_node_free()
470 	struct radix_tree_node *node;  in __radix_tree_preload()  local
603 	struct radix_tree_node *node = rcu_dereference_raw(root->rnode);  in radix_tree_load_root()  local
637 		struct radix_tree_node *node = radix_tree_node_alloc(gfp, NULL,  in radix_tree_extend()  local
686 		struct radix_tree_node *node = rcu_dereference_raw(root->rnode);  in radix_tree_shrink()  local
754 			struct radix_tree_node *node,  in delete_node()
815 	struct radix_tree_node *node = NULL, *child;  in __radix_tree_create()  local
871 static void radix_tree_free_nodes(struct radix_tree_node *node)  in radix_tree_free_nodes()
898 static inline int insert_entries(struct radix_tree_node *node,  in insert_entries()
961 static inline int insert_entries(struct radix_tree_node *node,  in insert_entries()
988 	struct radix_tree_node *node;  in __radix_tree_insert()  local
1033 	struct radix_tree_node *node, *parent;  in __radix_tree_lookup()  local
1103 static inline void replace_sibling_entries(struct radix_tree_node *node,  in replace_sibling_entries()
1124 		struct radix_tree_node *node, int count, int exceptional)  in replace_slot()
1139 				const struct radix_tree_node *node,  in node_tag_get()
1155 				struct radix_tree_node *node, void __rcu **slot,  in calculate_count()
1181 			  struct radix_tree_node *node,  in __radix_tree_replace()
1265 	struct radix_tree_node *node;  in radix_tree_join()  local
1300 	struct radix_tree_node *parent, *node, *child;  in radix_tree_split()  local
1394 				struct radix_tree_node *node,  in node_tag_set()
1425 	struct radix_tree_node *node, *parent;  in radix_tree_tag_set()  local
1463 				struct radix_tree_node *node,  in node_tag_clear()
1499 	struct radix_tree_node *node, *parent;  in radix_tree_tag_clear()  local
1551 	struct radix_tree_node *node, *parent;  in radix_tree_tag_get()  local
1587 				struct radix_tree_node *node, unsigned offset,  in set_iter_tags()
1632 	struct radix_tree_node *node;  in __radix_tree_next_slot()  local
1692 	struct radix_tree_node *node;  in radix_tree_iter_resume()  local
1715 	struct radix_tree_node *node, *child;  in radix_tree_next_chunk()  local
1978 			      struct radix_tree_node *node,  in __radix_tree_delete_node()
1985 				struct radix_tree_node *node, void __rcu **slot)  in __radix_tree_delete()
2036 	struct radix_tree_node *node = NULL;  in radix_tree_delete_item()  local
2072 			   struct radix_tree_node *node,  in radix_tree_clear_tags()
2134 	struct radix_tree_node *node = NULL, *child;  in idr_get_free()  local
2214 	struct radix_tree_node *node = rcu_dereference_raw(idr->idr_rt.rnode);  in idr_destroy()  local
2225 	struct radix_tree_node *node = arg;  in radix_tree_node_ctor()  local
2259 	struct radix_tree_node *node;  in radix_tree_cpu_dead()  local