radix_tree_node
struct radix_tree_node *node;
struct radix_tree_node **nodep, void __rcu ***slotp);
void __radix_tree_replace(struct radix_tree_root *, struct radix_tree_node *,
struct radix_tree_node *nodes;
struct radix_tree_node *node;
static inline void tag_set(struct radix_tree_node *node, unsigned int tag,
struct radix_tree_node *node, *parent;
static inline void tag_clear(struct radix_tree_node *node, unsigned int tag,
struct radix_tree_node *node, *parent;
struct radix_tree_node *node, unsigned offset,
static inline int tag_get(const struct radix_tree_node *node, unsigned int tag,
struct radix_tree_node *node, *child;
struct radix_tree_node *node, void __rcu **slot)
struct radix_tree_node *node = NULL;
struct radix_tree_node *node = NULL, *child;
static inline int any_tag_set(const struct radix_tree_node *node,
struct radix_tree_node *node = rcu_dereference_raw(idr->idr_rt.xa_head);
struct radix_tree_node *node = arg;
struct radix_tree_node *node;
sizeof(struct radix_tree_node), 0,
static inline void all_tag_set(struct radix_tree_node *node, unsigned int tag)
radix_tree_find_next_bit(struct radix_tree_node *node, unsigned int tag,
static inline unsigned long node_maxindex(const struct radix_tree_node *node)
const struct radix_tree_node *node,
static struct radix_tree_node *
radix_tree_node_alloc(gfp_t gfp_mask, struct radix_tree_node *parent,
struct radix_tree_node *ret = NULL;
struct radix_tree_node *node =
container_of(head, struct radix_tree_node, rcu_head);
radix_tree_node_free(struct radix_tree_node *node)
struct radix_tree_node *node;
struct radix_tree_node **nodep, unsigned long *maxindex)
struct radix_tree_node *node = rcu_dereference_raw(root->xa_head);
struct radix_tree_node *node = radix_tree_node_alloc(gfp, NULL,
struct radix_tree_node *node = rcu_dereference_raw(root->xa_head);
struct radix_tree_node *child;
struct radix_tree_node *node)
struct radix_tree_node *parent;
unsigned long index, struct radix_tree_node **nodep,
struct radix_tree_node *node = NULL, *child;
static void radix_tree_free_nodes(struct radix_tree_node *node)
struct radix_tree_node *child = entry_to_node(node);
static inline struct radix_tree_node *entry_to_node(void *ptr)
struct radix_tree_node *old = child;
static inline int insert_entries(struct radix_tree_node *node,
struct radix_tree_node *node;
unsigned long index, struct radix_tree_node **nodep,
struct radix_tree_node *node, *parent;
get_slot_offset(const struct radix_tree_node *parent, void __rcu **slot)
struct radix_tree_node *node, int count, int values)
const struct radix_tree_node *node,
static unsigned int radix_tree_descend(const struct radix_tree_node *parent,
struct radix_tree_node *node, void __rcu **slot,
struct radix_tree_node **nodep, unsigned long index)
struct radix_tree_node *node,
struct radix_tree_node *node,
struct radix_tree_node *node, *parent;
struct radix_tree_node *node,
static int verify_node(struct radix_tree_node *slot, unsigned int tag,
struct radix_tree_node *node = root->xa_head;
struct radix_tree_node *node = root->xa_head;
struct radix_tree_node *entry_to_node(void *ptr);
unsigned long node_maxindex(struct radix_tree_node *);
struct radix_tree_node *node = objp;
struct radix_tree_node *node;
struct radix_tree_node *node = cachep->objs;
offsetof(struct radix_tree_node, rcu_head));