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