Lines Matching refs:radix_tree_node
67 static inline struct radix_tree_node *entry_to_node(void *ptr) in entry_to_node()
80 get_slot_offset(const struct radix_tree_node *parent, void __rcu **slot) in get_slot_offset()
85 static unsigned int radix_tree_descend(const struct radix_tree_node *parent, in radix_tree_descend()
86 struct radix_tree_node **nodep, unsigned long index) in radix_tree_descend()
100 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set()
106 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear()
112 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag, in tag_get()
152 static inline int any_tag_set(const struct radix_tree_node *node, in any_tag_set()
163 static inline void all_tag_set(struct radix_tree_node *node, unsigned int tag) in all_tag_set()
180 radix_tree_find_next_bit(struct radix_tree_node *node, unsigned int tag, in radix_tree_find_next_bit()
216 static inline unsigned long node_maxindex(const struct radix_tree_node *node) in node_maxindex()
222 const struct radix_tree_node *node, in next_index()
232 static struct radix_tree_node *
233 radix_tree_node_alloc(gfp_t gfp_mask, struct radix_tree_node *parent, in radix_tree_node_alloc()
238 struct radix_tree_node *ret = NULL; in radix_tree_node_alloc()
292 struct radix_tree_node *node = in radix_tree_node_rcu_free()
293 container_of(head, struct radix_tree_node, rcu_head); in radix_tree_node_rcu_free()
308 radix_tree_node_free(struct radix_tree_node *node) in radix_tree_node_free()
325 struct radix_tree_node *node; in __radix_tree_preload()
389 struct radix_tree_node **nodep, unsigned long *maxindex) in radix_tree_load_root()
391 struct radix_tree_node *node = rcu_dereference_raw(root->xa_head); in radix_tree_load_root()
425 struct radix_tree_node *node = radix_tree_node_alloc(gfp, NULL, in radix_tree_extend()
473 struct radix_tree_node *node = rcu_dereference_raw(root->xa_head); in radix_tree_shrink()
474 struct radix_tree_node *child; in radix_tree_shrink()
544 struct radix_tree_node *node) in delete_node()
549 struct radix_tree_node *parent; in delete_node()
599 unsigned long index, struct radix_tree_node **nodep, in __radix_tree_create()
602 struct radix_tree_node *node = NULL, *child; in __radix_tree_create()
656 static void radix_tree_free_nodes(struct radix_tree_node *node) in radix_tree_free_nodes()
659 struct radix_tree_node *child = entry_to_node(node); in radix_tree_free_nodes()
670 struct radix_tree_node *old = child; in radix_tree_free_nodes()
681 static inline int insert_entries(struct radix_tree_node *node, in insert_entries()
706 struct radix_tree_node *node; in radix_tree_insert()
748 unsigned long index, struct radix_tree_node **nodep, in __radix_tree_lookup()
751 struct radix_tree_node *node, *parent; in __radix_tree_lookup()
824 struct radix_tree_node *node, int count, int values) in replace_slot()
835 const struct radix_tree_node *node, in node_tag_get()
851 struct radix_tree_node *node, void __rcu **slot, in calculate_count()
876 struct radix_tree_node *node, in __radix_tree_replace()
939 struct radix_tree_node *node, in node_tag_set()
970 struct radix_tree_node *node, *parent; in radix_tree_tag_set()
996 struct radix_tree_node *node, in node_tag_clear()
1032 struct radix_tree_node *node, *parent; in radix_tree_tag_clear()
1084 struct radix_tree_node *node, *parent; in radix_tree_tag_get()
1112 struct radix_tree_node *node, unsigned offset, in set_iter_tags()
1158 struct radix_tree_node *node, *child; in radix_tree_next_chunk()
1365 struct radix_tree_node *node, void __rcu **slot) in __radix_tree_delete()
1416 struct radix_tree_node *node = NULL; in radix_tree_delete_item()
1480 struct radix_tree_node *node = NULL, *child; in idr_get_free()
1561 struct radix_tree_node *node = rcu_dereference_raw(idr->idr_rt.xa_head); in idr_destroy()
1572 struct radix_tree_node *node = arg; in radix_tree_node_ctor()
1581 struct radix_tree_node *node; in radix_tree_cpu_dead()
1602 sizeof(struct radix_tree_node), 0, in radix_tree_init()