Home
last modified time | relevance | path

Searched refs:levels (Results 1 – 10 of 10) sorted by relevance

/third_party/ulib/jemalloc/src/
A Dbitmap.c22 binfo->levels[0].group_offset = 0; in bitmap_info_init()
26 binfo->levels[i].group_offset = binfo->levels[i-1].group_offset in bitmap_info_init()
30 binfo->levels[i].group_offset = binfo->levels[i-1].group_offset in bitmap_info_init()
32 assert(binfo->levels[i].group_offset <= BITMAP_GROUPS_MAX); in bitmap_info_init()
40 return (binfo->levels[binfo->nlevels].group_offset); in bitmap_info_ngroups()
60 bitmap[binfo->levels[1].group_offset - 1] >>= extra; in bitmap_init()
62 size_t group_count = binfo->levels[i].group_offset - in bitmap_init()
63 binfo->levels[i-1].group_offset; in bitmap_init()
67 bitmap[binfo->levels[i+1].group_offset - 1] >>= extra; in bitmap_init()
A Drtree.c36 rtree->levels[0].subtree = NULL; in rtree_new()
39 rtree->levels[0].cumbits = rtree->levels[0].bits; in rtree_new()
42 rtree->levels[i].subtree = NULL; in rtree_new()
43 rtree->levels[i].bits = RTREE_BITS_PER_LEVEL; in rtree_new()
44 rtree->levels[i].cumbits = rtree->levels[i-1].cumbits + in rtree_new()
49 rtree->levels[height-1].subtree = NULL; in rtree_new()
50 rtree->levels[height-1].bits = bits_in_leaf; in rtree_new()
51 rtree->levels[height-1].cumbits = bits; in rtree_new()
106 nchildren = ZU(1) << rtree->levels[level].bits; in rtree_delete_subtree()
141 rtree->levels[level].bits); in rtree_node_init()
[all …]
/third_party/ulib/jemalloc/include/jemalloc/internal/
A Dbitmap_inlines.h17 size_t rgoff = binfo->levels[binfo->nlevels].group_offset - 1; in bitmap_full()
67 gp = &bitmap[binfo->levels[i].group_offset + goff]; in bitmap_set()
91 g = bitmap[binfo->levels[i].group_offset]; in bitmap_sfu()
95 g = bitmap[binfo->levels[i].group_offset + bit]; in bitmap_sfu()
136 gp = &bitmap[binfo->levels[i].group_offset + goff]; in bitmap_unset()
A Dbitmap_structs.h21 bitmap_level_t levels[BITMAP_MAX_LEVELS+1]; member
A Drtree_structs.h82 rtree_level_t levels[RTREE_HEIGHT_MAX]; member
A Drtree_inlines.h78 rtree->levels[level].cumbits)) & ((ZU(1) << in rtree_subkey()
79 rtree->levels[level].bits) - 1)); in rtree_subkey()
154 subtree = rtree->levels[level].subtree; in rtree_subtree_tryread()
157 &rtree->levels[level].subtree_pun); in rtree_subtree_tryread()
/third_party/ulib/jemalloc/test/unit/
A Dbitmap.c115 assert_zu_eq(binfo->levels[i].group_offset, in test_bitmap_initializer_body()
116 binfo_dyn.levels[i].group_offset, in test_bitmap_initializer_body()
/third_party/ulib/jemalloc/bin/
A Djeprof.in3570 my $levels = log($items) / log(2);
3576 if ((2 ** $levels) < $items) {
3577 $levels++;
3584 FetchDynamicProfilesRecurse($levels, 0, 0);
/third_party/ulib/jemalloc/
A DChangeLog411 levels. This resolves what was a concurrency bottleneck for per arena huge
/third_party/lib/acpica/
A Dchanges.txt872 iASL: Added debug options (-bp, -bt) to dynamically prune levels of the
4072 Reduce default optimization levels to improve compatibility
6697 Removed the obsolete debug levels ACPI_DB_WARN and ACPI_DB_ERROR. These
6699 levels were made obsolete by the ACPI_WARNING, ACPI_ERROR, and
8787 levels
9239 levels with the ACPI_REPORT_ERROR and ACPI_REPORT_WARNING macros,
15151 modified to allow individual GPE levels to be flagged as wake-

Completed in 642 milliseconds