405 	struct rtree_node *node;  member
444 	struct rtree_node *node;  in alloc_rtree_node()  local
446 	node = chain_alloc(ca, sizeof(struct rtree_node));  in alloc_rtree_node()
447 	if (!node)  in alloc_rtree_node()
450 	node->data = get_image_page(gfp_mask, safe_needed);  in alloc_rtree_node()
451 	if (!node->data)  in alloc_rtree_node()
454 	list_add_tail(&node->list, list);  in alloc_rtree_node()
456 	return node;  in alloc_rtree_node()
469 	struct rtree_node *node, *block, **dst;  in add_rtree_block()  local
484 		node = alloc_rtree_node(gfp_mask, safe_needed, ca,  in add_rtree_block()
486 		if (!node)  in add_rtree_block()
489 		node->data[0] = (unsigned long)zone->rtree;  in add_rtree_block()
490 		zone->rtree = node;  in add_rtree_block()
500 	node = zone->rtree;  in add_rtree_block()
506 		if (!node) {  in add_rtree_block()
507 			node = alloc_rtree_node(gfp_mask, safe_needed, ca,  in add_rtree_block()
509 			if (!node)  in add_rtree_block()
511 			*dst = node;  in add_rtree_block()
517 		node = *dst;  in add_rtree_block()
577 	struct rtree_node *node;  in free_zone_bm_rtree()  local
579 	list_for_each_entry(node, &zone->nodes, list)  in free_zone_bm_rtree()
580 		free_image_page(node->data, clear_nosave_free);  in free_zone_bm_rtree()
582 	list_for_each_entry(node, &zone->leaves, list)  in free_zone_bm_rtree()
583 		free_image_page(node->data, clear_nosave_free);  in free_zone_bm_rtree()
590 	bm->cur.node = list_entry(bm->cur.zone->leaves.next,  in memory_bm_position_reset()
750 	struct rtree_node *node;  in memory_bm_find_bit()  local
782 	node = bm->cur.node;  in memory_bm_find_bit()
787 	node      = zone->rtree;  in memory_bm_find_bit()
795 		BUG_ON(node->data[index] == 0);  in memory_bm_find_bit()
796 		node = (struct rtree_node *)node->data[index];  in memory_bm_find_bit()
802 	bm->cur.node = node;  in memory_bm_find_bit()
807 	*addr = node->data;  in memory_bm_find_bit()
853 	clear_bit(bit, bm->cur.node->data);  in memory_bm_clear_current()
892 	if (!list_is_last(&bm->cur.node->list, &bm->cur.zone->leaves)) {  in rtree_next_node()
893 		bm->cur.node = list_entry(bm->cur.node->list.next,  in rtree_next_node()
905 		bm->cur.node = list_entry(bm->cur.zone->leaves.next,  in rtree_next_node()
935 		bit	  = find_next_bit(bm->cur.node->data, bits,  in memory_bm_next_pfn()
963 	struct rtree_node *node;  in recycle_zone_bm_rtree()  local
965 	list_for_each_entry(node, &zone->nodes, list)  in recycle_zone_bm_rtree()
966 		recycle_safe_page(node->data);  in recycle_zone_bm_rtree()
968 	list_for_each_entry(node, &zone->leaves, list)  in recycle_zone_bm_rtree()
969 		recycle_safe_page(node->data);  in recycle_zone_bm_rtree()