13 rtree_new(rtree_t *rtree, unsigned bits, rtree_node_alloc_t *alloc,  in rtree_new()  argument
18 	assert(bits > 0 && bits <= (sizeof(uintptr_t) << 3));  in rtree_new()
20 	bits_in_leaf = (bits % RTREE_BITS_PER_LEVEL) == 0 ? RTREE_BITS_PER_LEVEL  in rtree_new()
21 	    : (bits % RTREE_BITS_PER_LEVEL);  in rtree_new()
22 	if (bits > bits_in_leaf) {  in rtree_new()
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()
28 	assert((height-1) * RTREE_BITS_PER_LEVEL + bits_in_leaf == bits);  in rtree_new()
36 	rtree->levels[0].bits = (height > 1) ? RTREE_BITS_PER_LEVEL :  in rtree_new()
38 	rtree->levels[0].cumbits = rtree->levels[0].bits;  in rtree_new()
42 		rtree->levels[i].bits = RTREE_BITS_PER_LEVEL;  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()
69 		nchildren = ZU(1) << rtree->levels[level].bits;  in rtree_delete_subtree()
106 		node = rtree->alloc(ZU(1) << rtree->levels[level].bits);  in rtree_node_init()