350 struct rtree_node {  struct
365 	struct rtree_node *rtree;	/* Radix Tree Root             */  argument
374 	struct rtree_node *node;
404 static struct rtree_node *alloc_rtree_node(gfp_t gfp_mask, int safe_needed,  in alloc_rtree_node()
408 	struct rtree_node *node;  in alloc_rtree_node()
410 	node = chain_alloc(ca, sizeof(struct rtree_node));  in alloc_rtree_node()
433 	struct rtree_node *node, *block, **dst;  in add_rtree_block()
480 		dst = (struct rtree_node **)&((*dst)->data[index]);  in add_rtree_block()
541 	struct rtree_node *node;  in free_zone_bm_rtree()
555 				  struct rtree_node, list);  in memory_bm_position_reset()
713 	struct rtree_node *node;  in memory_bm_find_bit()
752 		node = (struct rtree_node *)node->data[index];  in memory_bm_find_bit()
844 					  struct rtree_node, list);  in rtree_next_node()
856 					  struct rtree_node, list);  in rtree_next_node()
911 	struct rtree_node *node;  in recycle_zone_bm_rtree()
1174 	rtree += DIV_ROUND_UP(rtree * sizeof(struct rtree_node),  in snapshot_additional_pages()