Lines Matching defs:height
16 unsigned bits_in_leaf, height, i;
25 height = 1 + (bits - bits_in_leaf) / RTREE_BITS_PER_LEVEL;
26 if ((height-1) * RTREE_BITS_PER_LEVEL + bits_in_leaf != bits)
27 height++;
29 height = 1;
30 assert((height-1) * RTREE_BITS_PER_LEVEL + bits_in_leaf == bits);
34 rtree->height = height;
38 rtree->levels[0].bits = (height > 1) ? RTREE_BITS_PER_LEVEL :
42 for (i = 1; i < height-1; i++) {
49 if (height > 1) {
50 rtree->levels[height-1].subtree = NULL;
51 rtree->levels[height-1].bits = bits_in_leaf;
52 rtree->levels[height-1].cumbits = bits;
57 rtree->start_level[i] = hmin(RTREE_HEIGHT_MAX - 1 - i, height -
68 if (level + 1 < rtree->height) {
86 for (i = 0; i < rtree->height; i++) {