80 get_slot_offset(const struct radix_tree_node *parent, void __rcu **slot)  in get_slot_offset()  argument
82 	return parent ? slot - parent->slots : 0;  in get_slot_offset()
85 static unsigned int radix_tree_descend(const struct radix_tree_node *parent,  in radix_tree_descend()  argument
88 	unsigned int offset = (index >> parent->shift) & RADIX_TREE_MAP_MASK;  in radix_tree_descend()
89 	void __rcu **entry = rcu_dereference_raw(parent->slots[offset]);  in radix_tree_descend()
233 radix_tree_node_alloc(gfp_t gfp_mask, struct radix_tree_node *parent,  in radix_tree_node_alloc()  argument
266 			rtp->nodes = ret->parent;  in radix_tree_node_alloc()
284 		ret->parent = parent;  in radix_tree_node_alloc()
344 			node->parent = rtp->nodes;  in __radix_tree_preload()
446 			entry_to_node(entry)->parent = node;  in radix_tree_extend()
499 			entry_to_node(child)->parent = NULL;  in radix_tree_shrink()
549 		struct radix_tree_node *parent;  in delete_node()  local
558 		parent = node->parent;  in delete_node()
559 		if (parent) {  in delete_node()
560 			parent->slots[node->offset] = NULL;  in delete_node()
561 			parent->count--;  in delete_node()
576 		node = parent;  in delete_node()
672 			child = child->parent;  in radix_tree_free_nodes()
751 	struct radix_tree_node *node, *parent;  in __radix_tree_lookup()  local
756 	parent = NULL;  in __radix_tree_lookup()
765 		parent = entry_to_node(node);  in __radix_tree_lookup()
766 		offset = radix_tree_descend(parent, &node, index);  in __radix_tree_lookup()
767 		slot = parent->slots + offset;  in __radix_tree_lookup()
770 		if (parent->shift == 0)  in __radix_tree_lookup()
775 		*nodep = parent;  in __radix_tree_lookup()
947 		node = node->parent;  in node_tag_set()
970 	struct radix_tree_node *node, *parent;  in radix_tree_tag_set()  local
979 		parent = entry_to_node(node);  in radix_tree_tag_set()
980 		offset = radix_tree_descend(parent, &node, index);  in radix_tree_tag_set()
983 		if (!tag_get(parent, tag, offset))  in radix_tree_tag_set()
984 			tag_set(parent, tag, offset);  in radix_tree_tag_set()
1007 		node = node->parent;  in node_tag_clear()
1032 	struct radix_tree_node *node, *parent;  in radix_tree_tag_clear()  local
1040 	parent = NULL;  in radix_tree_tag_clear()
1043 		parent = entry_to_node(node);  in radix_tree_tag_clear()
1044 		offset = radix_tree_descend(parent, &node, index);  in radix_tree_tag_clear()
1048 		node_tag_clear(root, parent, tag, offset);  in radix_tree_tag_clear()
1084 	struct radix_tree_node *node, *parent;  in radix_tree_tag_get()  local
1097 		parent = entry_to_node(node);  in radix_tree_tag_get()
1098 		offset = radix_tree_descend(parent, &node, index);  in radix_tree_tag_get()
1100 		if (!tag_get(parent, tag, offset))  in radix_tree_tag_get()
1527 				node = node->parent;  in idr_get_free()
1587 		rtp->nodes = node->parent;  in radix_tree_cpu_dead()