Home
last modified time | relevance | path

Searched refs:NPSIZES (Results 1 – 9 of 9) sorted by relevance

/external/jemalloc_new/include/jemalloc/internal/
Dsz.h29 extern size_t const sz_pind2sz_tab[NPSIZES+1];
53 return NPSIZES; in sz_psz2ind()
75 if (unlikely(pind == NPSIZES)) { in sz_pind2sz_compute()
104 assert(pind < NPSIZES+1); in sz_pind2sz()
Dextent_structs.h183 extent_heap_t heaps[NPSIZES+1];
190 bitmap_t bitmap[BITMAP_GROUPS(NPSIZES+1)];
Dextent_types.h9 #define EXTENT_GROW_MAX_PIND (NPSIZES - 1)
Dsize_classes.h183 #define NPSIZES 71 macro
332 #define NPSIZES 71 macro
479 #define NPSIZES 71 macro
791 #define NPSIZES 199 macro
1100 #define NPSIZES 199 macro
1407 #define NPSIZES 199 macro
Dsize_classes.sh305 * NPSIZES: Number of size classes that are a multiple of (1U << LG_PAGE).
/external/jemalloc_new/test/unit/
Dsize_classes.c159 assert_u_eq(sz_psz2ind(max_size_class+1), NPSIZES, in TEST_BEGIN()
161 assert_u_eq(sz_psz2ind(ZU(PTRDIFF_MAX)+1), NPSIZES, in TEST_BEGIN()
163 assert_u_eq(sz_psz2ind(SIZE_T_MAX), NPSIZES, in TEST_BEGIN()
/external/jemalloc_new/src/
Dsz.c5 const size_t sz_pind2sz_tab[NPSIZES+1] = {
Dextent.c23 BITMAP_INFO_INITIALIZER(NPSIZES+1);
287 for (unsigned i = 0; i < NPSIZES+1; i++) { in extents_init()
374 assert(i < NPSIZES); in extents_fit_alignment()
410 if (i < NPSIZES+1) {
439 &extents_bitmap_info, (size_t)pind); i < NPSIZES+1; i = in extents_first_fit_locked()
448 if (i == NPSIZES) { in extents_first_fit_locked()
451 assert(i < NPSIZES); in extents_first_fit_locked()
1263 if (arena->extent_grow_next + egn_skip == NPSIZES) { in extent_grow_retained()
1267 assert(arena->extent_grow_next + egn_skip < NPSIZES); in extent_grow_retained()
Dbase.c265 pszind_t pind_next = (*pind_last + 1 < NPSIZES) ? *pind_last + 1 : in base_block_alloc()