HomeSort by: relevance | last modified time | path
    Searched refs:slabs (Results 1 - 10 of 10) sorted by relevancy

  /src/external/bsd/jemalloc/dist/test/unit/
psset.c 330 /* Insert both slabs. */
364 * Now both slabs have 1-page holes. Free up a second one in the later
459 expect_zu_eq(0, psset.stats.slabs[huge].npageslabs, "");
460 expect_zu_eq(0, psset.stats.slabs[huge].nactive, "");
461 expect_zu_eq(0, psset.stats.slabs[huge].ndirty, "");
467 expect_zu_eq(1, psset.stats.slabs[0].npageslabs, "");
468 expect_zu_eq(i, psset.stats.slabs[0].nactive, "");
469 expect_zu_eq(0, psset.stats.slabs[0].ndirty, "");
471 expect_zu_eq(0, psset.stats.slabs[1].npageslabs, "");
472 expect_zu_eq(0, psset.stats.slabs[1].nactive, "")
    [all...]
mallctl.c 1202 TEST_STATS_ARENAS_HPA_SHARD_SLABS(size_t, slabs, npageslabs);
1203 TEST_STATS_ARENAS_HPA_SHARD_SLABS(size_t, slabs, nactive);
1204 TEST_STATS_ARENAS_HPA_SHARD_SLABS(size_t, slabs, ndirty);
hpa.c 808 stat->empty_slabs[1].npageslabs, 0, "Expected zero huge slabs");
1005 expect_zu_eq(shard->psset.stats.slabs[1].npageslabs, 1, "Huge nonfull");
1038 shard->psset.stats.slabs[0].npageslabs, 1, "Nonhuge nonfull");
  /src/external/bsd/unbound/dist/util/storage/
slabhash.c 156 int slabhash_is_size(struct slabhash* sl, size_t size, size_t slabs)
158 /* divide by slabs and then multiply by the number of slabs,
159 * because if the size is not an even multiple of slabs, the
162 if(sl->size != slabs) return 0;
163 if(slabs == 0) return 0;
164 if( (size/slabs)*slabs == slabhash_get_size(sl))
slabhash.h 48 /** default number of slabs */
156 * See if slabhash is of given (size, slabs) configuration.
159 * @param slabs: slab count to test for.
162 int slabhash_is_size(struct slabhash* table, size_t size, size_t slabs);
  /src/external/bsd/jemalloc/dist/src/
psset.c 34 psset_bin_stats_accum(&dst->slabs[huge], &src->slabs[huge]);
75 stats->slabs[huge_idx].npageslabs += mul * 1;
76 stats->slabs[huge_idx].nactive += mul * nactive;
77 stats->slabs[huge_idx].ndirty += mul * ndirty;
104 assert(stats->slabs[huge].npageslabs
106 assert(stats->slabs[huge].nactive
108 assert(stats->slabs[huge].ndirty
194 * means we implement LIFO ordering for the empty slabs set,
200 * We don't need to keep track of the full slabs; we're neve
    [all...]
ctl.c 276 /* Set of stats for non-hugified and hugified slabs. */
284 /* A parallel set of stats for full slabs. */
292 /* A parallel set for the empty slabs. */
301 * And one for the slabs that are neither empty nor full, but indexed by how
786 {NAME("slabs"), CHILD(named, stats_arenas_i_hpa_shard_slabs)},
4060 /* Nonhuge slabs */
4062 arenas_i(mib[2])->astats->hpastats.psset_stats.slabs[0].npageslabs, size_t)
4064 arenas_i(mib[2])->astats->hpastats.psset_stats.slabs[0].nactive, size_t)
4066 arenas_i(mib[2])->astats->hpastats.psset_stats.slabs[0].ndirty, size_t)
4068 /* Huge slabs */
    [all...]
  /src/external/bsd/jemalloc/dist/include/jemalloc/internal/
psset.h 9 * a collection of page-slabs (the intent being that they are backed by
35 * We reserve the last two indices for empty slabs, in that case purging
65 /* Non-huge and huge slabs. */
66 psset_bin_stats_t slabs[PSSET_NHUGE]; member in struct:psset_stats_s
70 * stats for the non-huge slabs in bucket pszind, while
71 * nonfull_slabs[pszind][1] contains stats for the huge slabs.
76 * Full slabs don't live in any edata heap, but we still track their
81 /* Empty slabs are similar. */
96 * Slabs with no active allocations, but which are allowed to serve new
101 * Slabs which are available to be purged, ordered by how much we wan
    [all...]
  /src/external/bsd/jemalloc/include/jemalloc/internal/
psset.h 9 * a collection of page-slabs (the intent being that they are backed by
35 * We reserve the last two indices for empty slabs, in that case purging
65 /* Non-huge and huge slabs. */
66 psset_bin_stats_t slabs[PSSET_NHUGE]; member in struct:psset_stats_s
70 * stats for the non-huge slabs in bucket pszind, while
71 * nonfull_slabs[pszind][1] contains stats for the huge slabs.
76 * Full slabs don't live in any edata heap, but we still track their
81 /* Empty slabs are similar. */
96 * Slabs with no active allocations, but which are allowed to serve new
101 * Slabs which are available to be purged, ordered by how much we wan
    [all...]
  /src/external/bsd/unbound/dist/services/cache/
rrset.c 64 size_t slabs = (cfg?cfg->rrset_cache_slabs:HASH_DEFAULT_SLABS); local
68 struct rrset_cache *r = (struct rrset_cache*)slabhash_create(slabs,

Completed in 25 milliseconds