372 	struct rtree_node *node;  member
406 	struct rtree_node *node;  in alloc_rtree_node()  local
408 	node = chain_alloc(ca, sizeof(struct rtree_node));  in alloc_rtree_node()
409 	if (!node)  in alloc_rtree_node()
412 	node->data = get_image_page(gfp_mask, safe_needed);  in alloc_rtree_node()
413 	if (!node->data)  in alloc_rtree_node()
416 	list_add_tail(&node->list, list);  in alloc_rtree_node()
418 	return node;  in alloc_rtree_node()
431 	struct rtree_node *node, *block, **dst;  in add_rtree_block()  local
446 		node = alloc_rtree_node(gfp_mask, safe_needed, ca,  in add_rtree_block()
448 		if (!node)  in add_rtree_block()
451 		node->data[0] = (unsigned long)zone->rtree;  in add_rtree_block()
452 		zone->rtree = node;  in add_rtree_block()
462 	node = zone->rtree;  in add_rtree_block()
468 		if (!node) {  in add_rtree_block()
469 			node = alloc_rtree_node(gfp_mask, safe_needed, ca,  in add_rtree_block()
471 			if (!node)  in add_rtree_block()
473 			*dst = node;  in add_rtree_block()
479 		node = *dst;  in add_rtree_block()
539 	struct rtree_node *node;  in free_zone_bm_rtree()  local
541 	list_for_each_entry(node, &zone->nodes, list)  in free_zone_bm_rtree()
542 		free_image_page(node->data, clear_nosave_free);  in free_zone_bm_rtree()
544 	list_for_each_entry(node, &zone->leaves, list)  in free_zone_bm_rtree()
545 		free_image_page(node->data, clear_nosave_free);  in free_zone_bm_rtree()
552 	bm->cur.node = list_entry(bm->cur.zone->leaves.next,  in memory_bm_position_reset()
711 	struct rtree_node *node;  in memory_bm_find_bit()  local
743 	node = bm->cur.node;  in memory_bm_find_bit()
748 	node      = zone->rtree;  in memory_bm_find_bit()
756 		BUG_ON(node->data[index] == 0);  in memory_bm_find_bit()
757 		node = (struct rtree_node *)node->data[index];  in memory_bm_find_bit()
763 	bm->cur.node = node;  in memory_bm_find_bit()
767 	*addr = node->data;  in memory_bm_find_bit()
813 	clear_bit(bit, bm->cur.node->data);  in memory_bm_clear_current()
847 	if (!list_is_last(&bm->cur.node->list, &bm->cur.zone->leaves)) {  in rtree_next_node()
848 		bm->cur.node = list_entry(bm->cur.node->list.next,  in rtree_next_node()
860 		bm->cur.node = list_entry(bm->cur.zone->leaves.next,  in rtree_next_node()
890 		bit	  = find_next_bit(bm->cur.node->data, bits,  in memory_bm_next_pfn()
916 	struct rtree_node *node;  in recycle_zone_bm_rtree()  local
918 	list_for_each_entry(node, &zone->nodes, list)  in recycle_zone_bm_rtree()
919 		recycle_safe_page(node->data);  in recycle_zone_bm_rtree()
921 	list_for_each_entry(node, &zone->leaves, list)  in recycle_zone_bm_rtree()
922 		recycle_safe_page(node->data);  in recycle_zone_bm_rtree()