407 	struct rtree_node *node;  member
446 	struct rtree_node *node;  in alloc_rtree_node()  local
448 	node = chain_alloc(ca, sizeof(struct rtree_node));  in alloc_rtree_node()
449 	if (!node)  in alloc_rtree_node()
452 	node->data = get_image_page(gfp_mask, safe_needed);  in alloc_rtree_node()
453 	if (!node->data)  in alloc_rtree_node()
456 	list_add_tail(&node->list, list);  in alloc_rtree_node()
458 	return node;  in alloc_rtree_node()
471 	struct rtree_node *node, *block, **dst;  in add_rtree_block()  local
486 		node = alloc_rtree_node(gfp_mask, safe_needed, ca,  in add_rtree_block()
488 		if (!node)  in add_rtree_block()
491 		node->data[0] = (unsigned long)zone->rtree;  in add_rtree_block()
492 		zone->rtree = node;  in add_rtree_block()
502 	node = zone->rtree;  in add_rtree_block()
508 		if (!node) {  in add_rtree_block()
509 			node = alloc_rtree_node(gfp_mask, safe_needed, ca,  in add_rtree_block()
511 			if (!node)  in add_rtree_block()
513 			*dst = node;  in add_rtree_block()
519 		node = *dst;  in add_rtree_block()
579 	struct rtree_node *node;  in free_zone_bm_rtree()  local
581 	list_for_each_entry(node, &zone->nodes, list)  in free_zone_bm_rtree()
582 		free_image_page(node->data, clear_nosave_free);  in free_zone_bm_rtree()
584 	list_for_each_entry(node, &zone->leaves, list)  in free_zone_bm_rtree()
585 		free_image_page(node->data, clear_nosave_free);  in free_zone_bm_rtree()
592 	bm->cur.node = list_entry(bm->cur.zone->leaves.next,  in memory_bm_position_reset()
752 	struct rtree_node *node;  in memory_bm_find_bit()  local
784 	node = bm->cur.node;  in memory_bm_find_bit()
789 	node      = zone->rtree;  in memory_bm_find_bit()
797 		BUG_ON(node->data[index] == 0);  in memory_bm_find_bit()
798 		node = (struct rtree_node *)node->data[index];  in memory_bm_find_bit()
804 	bm->cur.node = node;  in memory_bm_find_bit()
809 	*addr = node->data;  in memory_bm_find_bit()
855 	clear_bit(bit, bm->cur.node->data);  in memory_bm_clear_current()
894 	if (!list_is_last(&bm->cur.node->list, &bm->cur.zone->leaves)) {  in rtree_next_node()
895 		bm->cur.node = list_entry(bm->cur.node->list.next,  in rtree_next_node()
907 		bm->cur.node = list_entry(bm->cur.zone->leaves.next,  in rtree_next_node()
937 		bit	  = find_next_bit(bm->cur.node->data, bits,  in memory_bm_next_pfn()
965 	struct rtree_node *node;  in recycle_zone_bm_rtree()  local
967 	list_for_each_entry(node, &zone->nodes, list)  in recycle_zone_bm_rtree()
968 		recycle_safe_page(node->data);  in recycle_zone_bm_rtree()
970 	list_for_each_entry(node, &zone->leaves, list)  in recycle_zone_bm_rtree()
971 		recycle_safe_page(node->data);  in recycle_zone_bm_rtree()