Lines Matching refs:height
16 unsigned bits_in_leaf, height, i;
23 height = 1 + (bits - bits_in_leaf) / RTREE_BITS_PER_LEVEL;
24 if ((height-1) * RTREE_BITS_PER_LEVEL + bits_in_leaf != bits)
25 height++;
27 height = 1;
28 assert((height-1) * RTREE_BITS_PER_LEVEL + bits_in_leaf == bits);
32 rtree->height = height;
36 rtree->levels[0].bits = (height > 1) ? RTREE_BITS_PER_LEVEL :
40 for (i = 1; i < height-1; i++) {
47 if (height > 1) {
48 rtree->levels[height-1].subtree = NULL;
49 rtree->levels[height-1].bits = bits_in_leaf;
50 rtree->levels[height-1].cumbits = bits;
55 rtree->start_level[i] = hmin(RTREE_HEIGHT_MAX - 1 - i, height -
66 if (level + 1 < rtree->height) {
84 for (i = 0; i < rtree->height; i++) {
