371 	struct rtree_node *node;  member
405 	struct rtree_node *node;  in alloc_rtree_node()  local
407 	node = chain_alloc(ca, sizeof(struct rtree_node));  in alloc_rtree_node()
408 	if (!node)  in alloc_rtree_node()
411 	node->data = get_image_page(gfp_mask, safe_needed);  in alloc_rtree_node()
412 	if (!node->data)  in alloc_rtree_node()
415 	list_add_tail(&node->list, list);  in alloc_rtree_node()
417 	return node;  in alloc_rtree_node()
430 	struct rtree_node *node, *block, **dst;  in add_rtree_block()  local
445 		node = alloc_rtree_node(gfp_mask, safe_needed, ca,  in add_rtree_block()
447 		if (!node)  in add_rtree_block()
450 		node->data[0] = (unsigned long)zone->rtree;  in add_rtree_block()
451 		zone->rtree = node;  in add_rtree_block()
461 	node = zone->rtree;  in add_rtree_block()
467 		if (!node) {  in add_rtree_block()
468 			node = alloc_rtree_node(gfp_mask, safe_needed, ca,  in add_rtree_block()
470 			if (!node)  in add_rtree_block()
472 			*dst = node;  in add_rtree_block()
478 		node = *dst;  in add_rtree_block()
538 	struct rtree_node *node;  in free_zone_bm_rtree()  local
540 	list_for_each_entry(node, &zone->nodes, list)  in free_zone_bm_rtree()
541 		free_image_page(node->data, clear_nosave_free);  in free_zone_bm_rtree()
543 	list_for_each_entry(node, &zone->leaves, list)  in free_zone_bm_rtree()
544 		free_image_page(node->data, clear_nosave_free);  in free_zone_bm_rtree()
551 	bm->cur.node = list_entry(bm->cur.zone->leaves.next,  in memory_bm_position_reset()
710 	struct rtree_node *node;  in memory_bm_find_bit()  local
742 	node = bm->cur.node;  in memory_bm_find_bit()
747 	node      = zone->rtree;  in memory_bm_find_bit()
755 		BUG_ON(node->data[index] == 0);  in memory_bm_find_bit()
756 		node = (struct rtree_node *)node->data[index];  in memory_bm_find_bit()
762 	bm->cur.node = node;  in memory_bm_find_bit()
766 	*addr = node->data;  in memory_bm_find_bit()
812 	clear_bit(bit, bm->cur.node->data);  in memory_bm_clear_current()
846 	if (!list_is_last(&bm->cur.node->list, &bm->cur.zone->leaves)) {  in rtree_next_node()
847 		bm->cur.node = list_entry(bm->cur.node->list.next,  in rtree_next_node()
859 		bm->cur.node = list_entry(bm->cur.zone->leaves.next,  in rtree_next_node()
889 		bit	  = find_next_bit(bm->cur.node->data, bits,  in memory_bm_next_pfn()
915 	struct rtree_node *node;  in recycle_zone_bm_rtree()  local
917 	list_for_each_entry(node, &zone->nodes, list)  in recycle_zone_bm_rtree()
918 		recycle_safe_page(node->data);  in recycle_zone_bm_rtree()
920 	list_for_each_entry(node, &zone->leaves, list)  in recycle_zone_bm_rtree()
921 		recycle_safe_page(node->data);  in recycle_zone_bm_rtree()