Home
last modified time | relevance | path

Searched refs:SMOOTHSTEP_NSTEPS (Results 1 – 12 of 12) sorted by relevance

/external/jemalloc/test/unit/
Dsmoothstep.c23 for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) in TEST_BEGIN()
26 max = (KQU(1) << (SMOOTHSTEP_BFP-1)) * (SMOOTHSTEP_NSTEPS+1); in TEST_BEGIN()
27 min = max - SMOOTHSTEP_NSTEPS; in TEST_BEGIN()
34 max - sum, SMOOTHSTEP_NSTEPS); in TEST_BEGIN()
51 for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) { in TEST_BEGIN()
56 assert_u64_eq(smoothstep_tab[SMOOTHSTEP_NSTEPS-1], in TEST_BEGIN()
74 for (i = 0; i < SMOOTHSTEP_NSTEPS / 2 + SMOOTHSTEP_NSTEPS % 2; i++) { in TEST_BEGIN()
86 for (i = SMOOTHSTEP_NSTEPS-1; i >= SMOOTHSTEP_NSTEPS / 2; i--) { in TEST_BEGIN()
Ddecay.c304 #define NPS (SMOOTHSTEP_NSTEPS + 1) in TEST_BEGIN()
/external/jemalloc_new/test/unit/
Dsmoothstep.c22 for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) { in TEST_BEGIN()
26 max = (KQU(1) << (SMOOTHSTEP_BFP-1)) * (SMOOTHSTEP_NSTEPS+1); in TEST_BEGIN()
27 min = max - SMOOTHSTEP_NSTEPS; in TEST_BEGIN()
34 max - sum, SMOOTHSTEP_NSTEPS); in TEST_BEGIN()
50 for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) { in TEST_BEGIN()
55 assert_u64_eq(smoothstep_tab[SMOOTHSTEP_NSTEPS-1], in TEST_BEGIN()
72 for (i = 0; i < SMOOTHSTEP_NSTEPS / 2 + SMOOTHSTEP_NSTEPS % 2; i++) { in TEST_BEGIN()
84 for (i = SMOOTHSTEP_NSTEPS-1; i >= SMOOTHSTEP_NSTEPS / 2; i--) { in TEST_BEGIN()
Ddecay.c485 #define NPS (SMOOTHSTEP_NSTEPS + 1) in TEST_BEGIN()
/external/jemalloc_new/src/
Dbackground_thread.c110 for (; i < SMOOTHSTEP_NSTEPS; i++) {
138 for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) {
143 if (i == SMOOTHSTEP_NSTEPS) {
151 interval = decay_interval_ns * SMOOTHSTEP_NSTEPS;
156 size_t ub = SMOOTHSTEP_NSTEPS;
191 assert(n_search++ < lg_floor(SMOOTHSTEP_NSTEPS) + 1);
692 if (n_epoch >= SMOOTHSTEP_NSTEPS) {
695 uint64_t h_steps_max = h_steps[SMOOTHSTEP_NSTEPS - 1];
697 h_steps[SMOOTHSTEP_NSTEPS - 1 - n_epoch]);
699 h_steps[SMOOTHSTEP_NSTEPS - 1 - n_epoch]);
Darena.c36 const uint64_t h_steps[SMOOTHSTEP_NSTEPS] = {
462 for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) { in arena_decay_backlog_npages_limit()
474 decay->backlog[SMOOTHSTEP_NSTEPS-1] = npages_delta; in arena_decay_backlog_update_last()
491 if (nadvance_u64 >= SMOOTHSTEP_NSTEPS) { in arena_decay_backlog_update()
492 memset(decay->backlog, 0, (SMOOTHSTEP_NSTEPS-1) * in arena_decay_backlog_update()
500 (SMOOTHSTEP_NSTEPS - nadvance_z) * sizeof(size_t)); in arena_decay_backlog_update()
502 memset(&decay->backlog[SMOOTHSTEP_NSTEPS - in arena_decay_backlog_update()
568 nstime_idivide(&decay->interval, SMOOTHSTEP_NSTEPS); in arena_decay_reinit()
576 memset(decay->backlog, 0, SMOOTHSTEP_NSTEPS * sizeof(size_t)); in arena_decay_reinit()
869 npages_new = decay->backlog[SMOOTHSTEP_NSTEPS-1]; in arena_decay_impl()
/external/jemalloc_new/include/jemalloc/internal/
Darena_structs_b.h64 size_t backlog[SMOOTHSTEP_NSTEPS];
Darena_externs.h16 extern const uint64_t h_steps[SMOOTHSTEP_NSTEPS];
Dsmoothstep.h27 #define SMOOTHSTEP_NSTEPS 200 macro
/external/jemalloc/include/jemalloc/internal/
Dsmoothstep.h25 #define SMOOTHSTEP_NSTEPS 200 macro
Darena.h324 size_t backlog[SMOOTHSTEP_NSTEPS];
/external/jemalloc/src/
Darena.c1296 for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) in arena_decay_backlog_npages_limit()
1308 arena->decay.backlog[SMOOTHSTEP_NSTEPS-1] = ndirty_delta; in arena_decay_backlog_update_last()
1315 if (nadvance_u64 >= SMOOTHSTEP_NSTEPS) { in arena_decay_backlog_update()
1316 memset(arena->decay.backlog, 0, (SMOOTHSTEP_NSTEPS-1) * in arena_decay_backlog_update()
1324 (SMOOTHSTEP_NSTEPS - nadvance_z) * sizeof(size_t)); in arena_decay_backlog_update()
1326 memset(&arena->decay.backlog[SMOOTHSTEP_NSTEPS - in arena_decay_backlog_update()
1385 nstime_idivide(&arena->decay.interval, SMOOTHSTEP_NSTEPS); in arena_decay_init()
1393 memset(arena->decay.backlog, 0, SMOOTHSTEP_NSTEPS * sizeof(size_t)); in arena_decay_init()