Lines Matching defs:rtree

380  * of the rtree together for easy linear iteration over
398 	struct rtree_node *rtree;	/* Radix Tree Root             */
484 	/* Make sure the rtree has enough levels */
491 		node->data[0] = (unsigned long)zone->rtree;
492 		zone->rtree = node;
501 	/* Now walk the rtree to insert the block */
502 	node = zone->rtree;
503 	dst = &zone->rtree;
789 	node      = zone->rtree;
1226 	unsigned int rtree, nodes;
1228 	rtree = nodes = DIV_ROUND_UP(zone->spanned_pages, BM_BITS_PER_BLOCK);
1229 	rtree += DIV_ROUND_UP(rtree * sizeof(struct rtree_node),
1233 		rtree += nodes;
1236 	return 2 * rtree;