Home
last modified time | relevance | path

Searched refs:SMOOTHSTEP_NSTEPS (Results 1 – 5 of 5) 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.c293 #define NPS (SMOOTHSTEP_NSTEPS + 1) in TEST_BEGIN()
/external/jemalloc/include/jemalloc/internal/
Dsmoothstep.h25 #define SMOOTHSTEP_NSTEPS 200 macro
Darena.h434 size_t decay_backlog[SMOOTHSTEP_NSTEPS];
/external/jemalloc/src/
Darena.c1266 for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) in arena_decay_backlog_npages_limit()
1297 if (nadvance >= SMOOTHSTEP_NSTEPS) { in arena_decay_epoch_advance()
1298 memset(arena->decay_backlog, 0, (SMOOTHSTEP_NSTEPS-1) * in arena_decay_epoch_advance()
1302 (SMOOTHSTEP_NSTEPS - nadvance) * sizeof(size_t)); in arena_decay_epoch_advance()
1304 memset(&arena->decay_backlog[SMOOTHSTEP_NSTEPS - in arena_decay_epoch_advance()
1311 arena->decay_backlog[SMOOTHSTEP_NSTEPS-1] = ndirty_delta; in arena_decay_epoch_advance()
1339 nstime_idivide(&arena->decay_interval, SMOOTHSTEP_NSTEPS); in arena_decay_init()
1348 memset(arena->decay_backlog, 0, SMOOTHSTEP_NSTEPS * sizeof(size_t)); in arena_decay_init()