348 struct rtree_node {  struct
363 	struct rtree_node *rtree;	/* Radix Tree Root             */  argument
372 	struct rtree_node *node;
402 static struct rtree_node *alloc_rtree_node(gfp_t gfp_mask, int safe_needed,  in alloc_rtree_node()
406 	struct rtree_node *node;  in alloc_rtree_node()
408 	node = chain_alloc(ca, sizeof(struct rtree_node));  in alloc_rtree_node()
431 	struct rtree_node *node, *block, **dst;  in add_rtree_block()
478 		dst = (struct rtree_node **)&((*dst)->data[index]);  in add_rtree_block()
539 	struct rtree_node *node;  in free_zone_bm_rtree()
553 				  struct rtree_node, list);  in memory_bm_position_reset()
711 	struct rtree_node *node;  in memory_bm_find_bit()
750 		node = (struct rtree_node *)node->data[index];  in memory_bm_find_bit()
842 					  struct rtree_node, list);  in rtree_next_node()
854 					  struct rtree_node, list);  in rtree_next_node()
909 	struct rtree_node *node;  in recycle_zone_bm_rtree()
1176 	rtree += DIV_ROUND_UP(rtree * sizeof(struct rtree_node),  in snapshot_additional_pages()