Lines Matching defs:bits
11 * Only the most significant bits of keys passed to rtree_{read,write}() are
15 rtree_new(rtree_t *rtree, unsigned bits)
21 assert(bits > 0 && bits <= (sizeof(uintptr_t) << 3));
23 bits_in_leaf = (bits % RTREE_BITS_PER_LEVEL) == 0 ? RTREE_BITS_PER_LEVEL
24 : (bits % RTREE_BITS_PER_LEVEL);
25 if (bits > bits_in_leaf) {
26 height = 1 + (bits - bits_in_leaf) / RTREE_BITS_PER_LEVEL;
27 if ((height-1) * RTREE_BITS_PER_LEVEL + bits_in_leaf != bits)
31 assert((height-1) * RTREE_BITS_PER_LEVEL + bits_in_leaf == bits);
37 rtree->levels[0].bits = (height > 1) ? RTREE_BITS_PER_LEVEL :
39 rtree->levels[0].cumbits = rtree->levels[0].bits;
43 rtree->levels[i].bits = RTREE_BITS_PER_LEVEL;
50 rtree->levels[height-1].bits = bits_in_leaf;
51 rtree->levels[height-1].cumbits = bits;
106 nchildren = ZU(1) << rtree->levels[level].bits;
141 rtree->levels[level].bits);