381 struct rtree_node {  struct
396 	struct rtree_node *rtree;	/* Radix Tree Root             */  argument
405 	struct rtree_node *node;
440 static struct rtree_node *alloc_rtree_node(gfp_t gfp_mask, int safe_needed,  in alloc_rtree_node()
444 	struct rtree_node *node;  in alloc_rtree_node()
446 	node = chain_alloc(ca, sizeof(struct rtree_node));  in alloc_rtree_node()
469 	struct rtree_node *node, *block, **dst;  in add_rtree_block()
516 		dst = (struct rtree_node **)&((*dst)->data[index]);  in add_rtree_block()
577 	struct rtree_node *node;  in free_zone_bm_rtree()
591 				  struct rtree_node, list);  in memory_bm_position_reset()
750 	struct rtree_node *node;  in memory_bm_find_bit()
796 		node = (struct rtree_node *)node->data[index];  in memory_bm_find_bit()
894 					  struct rtree_node, list);  in rtree_next_node()
906 					  struct rtree_node, list);  in rtree_next_node()
963 	struct rtree_node *node;  in recycle_zone_bm_rtree()
1231 	rtree += DIV_ROUND_UP(rtree * sizeof(struct rtree_node),  in snapshot_additional_pages()