Lines Matching full:levels
37 rtree->levels[0].subtree = NULL;
38 rtree->levels[0].bits = (height > 1) ? RTREE_BITS_PER_LEVEL :
40 rtree->levels[0].cumbits = rtree->levels[0].bits;
41 /* Interior levels. */
43 rtree->levels[i].subtree = NULL;
44 rtree->levels[i].bits = RTREE_BITS_PER_LEVEL;
45 rtree->levels[i].cumbits = rtree->levels[i-1].cumbits +
50 rtree->levels[height-1].subtree = NULL;
51 rtree->levels[height-1].bits = bits_in_leaf;
52 rtree->levels[height-1].cumbits = bits;
71 nchildren = ZU(1) << rtree->levels[level].bits;
87 rtree_node_elm_t *subtree = rtree->levels[i].subtree;
111 node = rtree->alloc(ZU(1) << rtree->levels[level].bits);
124 return (rtree_node_init(rtree, level, &rtree->levels[level].subtree));
