Lines Matching defs:rtree
357 * of the rtree together for easy linear iteration over
375 struct rtree_node *rtree; /* Radix Tree Root */
456 /* Make sure the rtree has enough levels */
463 node->data[0] = (unsigned long)zone->rtree;
464 zone->rtree = node;
474 /* Now walk the rtree to insert the block */
475 node = zone->rtree;
476 dst = &zone->rtree;
760 node = zone->rtree;
1200 unsigned int rtree, nodes;
1202 rtree = nodes = DIV_ROUND_UP(zone->spanned_pages, BM_BITS_PER_BLOCK);
1203 rtree += DIV_ROUND_UP(rtree * sizeof(struct rtree_node), LINKED_PAGE_DATA_SIZE);
1206 rtree += nodes;
1209 return 0x2 * rtree;