276 struct rtree_node {  struct
291 	struct rtree_node *rtree;	/* Radix Tree Root             */  argument
300 	struct rtree_node *node;
331 static struct rtree_node *alloc_rtree_node(gfp_t gfp_mask, int safe_needed,  in alloc_rtree_node()
335 	struct rtree_node *node;  in alloc_rtree_node()
337 	node = chain_alloc(ca, sizeof(struct rtree_node));  in alloc_rtree_node()
360 	struct rtree_node *node, *block, **dst;  in add_rtree_block()
407 		dst = (struct rtree_node **)&((*dst)->data[index]);  in add_rtree_block()
467 	struct rtree_node *node;  in free_zone_bm_rtree()
481 				  struct rtree_node, list);  in memory_bm_position_reset()
638 	struct rtree_node *node;  in memory_bm_find_bit()
678 		node = (struct rtree_node *)node->data[index];  in memory_bm_find_bit()
769 				  struct rtree_node, list);  in rtree_next_node()
782 					  struct rtree_node, list);  in rtree_next_node()
1046 	rtree += DIV_ROUND_UP(rtree * sizeof(struct rtree_node),  in snapshot_additional_pages()