Searched refs:levels (Results 1 – 9 of 9) sorted by relevance
20 binfo->levels[0].group_offset = 0; in bitmap_info_init()24 binfo->levels[i].group_offset = binfo->levels[i-1].group_offset in bitmap_info_init()28 binfo->levels[i].group_offset = binfo->levels[i-1].group_offset in bitmap_info_init()30 assert(binfo->levels[i].group_offset <= BITMAP_GROUPS_MAX); in bitmap_info_init()39 return (binfo->levels[binfo->nlevels].group_offset << LG_SIZEOF_BITMAP); in bitmap_info_ngroups()64 memset(bitmap, 0xffU, binfo->levels[binfo->nlevels].group_offset << in bitmap_init()69 bitmap[binfo->levels[1].group_offset - 1] >>= extra; in bitmap_init()71 size_t group_count = binfo->levels[i].group_offset - in bitmap_init()72 binfo->levels[i-1].group_offset; in bitmap_init()76 bitmap[binfo->levels[i+1].group_offset - 1] >>= extra; in bitmap_init()
35 rtree->levels[0].subtree = NULL; in rtree_new()38 rtree->levels[0].cumbits = rtree->levels[0].bits; in rtree_new()41 rtree->levels[i].subtree = NULL; in rtree_new()42 rtree->levels[i].bits = RTREE_BITS_PER_LEVEL; in rtree_new()43 rtree->levels[i].cumbits = rtree->levels[i-1].cumbits + 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()69 nchildren = ZU(1) << rtree->levels[level].bits; in rtree_delete_subtree()85 rtree_node_elm_t *subtree = rtree->levels[i].subtree; in rtree_delete()[all …]
88 bitmap_level_t levels[BITMAP_MAX_LEVELS+1]; member116 unsigned rgoff = binfo->levels[binfo->nlevels].group_offset - 1; in bitmap_full()156 gp = &bitmap[binfo->levels[i].group_offset + goff]; in bitmap_set()178 g = bitmap[binfo->levels[i].group_offset]; in bitmap_sfu()182 g = bitmap[binfo->levels[i].group_offset + bit]; in bitmap_sfu()214 gp = &bitmap[binfo->levels[i].group_offset + goff]; in bitmap_unset()
90 rtree_level_t levels[RTREE_HEIGHT_MAX]; member148 rtree->levels[level].cumbits)) & ((ZU(1) << in rtree_subkey()149 rtree->levels[level].bits) - 1)); in rtree_subkey()217 subtree = rtree->levels[level].subtree; in rtree_subtree_tryread()219 subtree = atomic_read_p(&rtree->levels[level].subtree_pun); in rtree_subtree_tryread()
54 6 - Two levels of API. The Redis API has two levels: 1) a subset of the API fits
12 …atures that are natural to find in a database, like replication, tunable levels of durability, clu…
5 Upgrade urgency levels:
3472 my $levels = log($items) / log(2);3478 if ((2 ** $levels) < $items) {3479 $levels++;3486 FetchDynamicProfilesRecurse($levels, 0, 0);
191 levels. This resolves what was a concurrency bottleneck for per arena huge