arena.h revision be8e59f5a64ef775c9694aee0d6a87d92336d303
179e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka/******************************************************************************/ 279e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka#ifdef JEMALLOC_H_TYPES 379e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka 479e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka/* 579e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * RUN_MAX_OVRHD indicates maximum desired run header overhead. Runs are sized 679e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * as small as possible such that this setting is still honored, without 779e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * violating other constraints. The goal is to make runs as small as possible 879e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * without exceeding a per run external fragmentation threshold. 979e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * 1079e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * We use binary fixed point math for overhead computations, where the binary 1179e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * point is implicitly RUN_BFP bits to the left. 1279e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * 1379e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * Note that it is possible to set RUN_MAX_OVRHD low enough that it cannot be 1479e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * honored for some/all object sizes, since when heap profiling is enabled 1579e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * there is one pointer of header overhead per object (plus a constant). This 1679e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * constraint is relaxed (ignored) for runs that are so small that the 1779e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * per-region overhead is greater than: 1879e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * 1979e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * (RUN_MAX_OVRHD / (reg_interval << (3+RUN_BFP)) 2079e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka */ 2179e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka#define RUN_BFP 12 2279e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka/* \/ Implicit binary fixed point. */ 2379e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka#define RUN_MAX_OVRHD 0x0000003dU 2479e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka#define RUN_MAX_OVRHD_RELAX 0x00001800U 2579e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka 2679e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka/* Maximum number of regions in one run. */ 2779e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka#define LG_RUN_MAXREGS 11 2879e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka#define RUN_MAXREGS (1U << LG_RUN_MAXREGS) 2979e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka 3079e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka/* 3179e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * Minimum redzone size. Redzones may be larger than this if necessary to 3279e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * preserve region alignment. 3379e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka */ 3479e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka#define REDZONE_MINSIZE 16 3579e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka 3679e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka/* 3779e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * The minimum ratio of active:dirty pages per arena is computed as: 3879e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * 3979e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * (nactive >> opt_lg_dirty_mult) >= ndirty 4079e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * 4179e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * So, supposing that opt_lg_dirty_mult is 3, there can be no less than 8 times 4279e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * as many active pages as dirty pages. 4379e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka */ 4479e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka#define LG_DIRTY_MULT_DEFAULT 3 4579e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka 4679e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadkatypedef struct arena_chunk_map_s arena_chunk_map_t; 4779e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadkatypedef struct arena_chunk_s arena_chunk_t; 4879e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadkatypedef struct arena_run_s arena_run_t; 4979e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadkatypedef struct arena_bin_info_s arena_bin_info_t; 5079e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadkatypedef struct arena_bin_s arena_bin_t; 5179e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadkatypedef struct arena_s arena_t; 5279e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka 5379e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka#endif /* JEMALLOC_H_TYPES */ 5479e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka/******************************************************************************/ 5579e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka#ifdef JEMALLOC_H_STRUCTS 5679e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka 5779e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka/* Each element of the chunk map corresponds to one page within the chunk. */ 5879e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadkastruct arena_chunk_map_s { 5979e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka#ifndef JEMALLOC_PROF 6079e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka /* 6179e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * Overlay prof_ctx in order to allow it to be referenced by dead code. 6279e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * Such antics aren't warranted for per arena data structures, but 6379e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * chunk map overhead accounts for a percentage of memory, rather than 6479e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * being just a fixed cost. 6579e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka */ 6679e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka union { 6779e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka#endif 6879e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka union { 6979e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka /* 7079e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * Linkage for run trees. There are two disjoint uses: 7179e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * 7279e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * 1) arena_t's runs_avail tree. 7379e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * 2) arena_run_t conceptually uses this linkage for in-use 7479e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * non-full runs, rather than directly embedding linkage. 7579e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka */ 7679e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka rb_node(arena_chunk_map_t) rb_link; 7779e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka /* 7879e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * List of runs currently in purgatory. arena_chunk_purge() 7979e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * temporarily allocates runs that contain dirty pages while 8079e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * purging, so that other threads cannot use the runs while the 8179e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka * purging thread is operating without the arena lock held. 8279e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka */ 8379e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka ql_elm(arena_chunk_map_t) ql_link; 8479e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka } u; 8579e99afe468407e9ff9f0820df7190cb069eabebZoltan Szabadka 86 /* Profile counters, used for large object runs. */ 87 prof_ctx_t *prof_ctx; 88#ifndef JEMALLOC_PROF 89 }; /* union { ... }; */ 90#endif 91 92 /* 93 * Run address (or size) and various flags are stored together. The bit 94 * layout looks like (assuming 32-bit system): 95 * 96 * ???????? ???????? ????nnnn nnnndula 97 * 98 * ? : Unallocated: Run address for first/last pages, unset for internal 99 * pages. 100 * Small: Run page offset. 101 * Large: Run size for first page, unset for trailing pages. 102 * n : binind for small size class, BININD_INVALID for large size class. 103 * d : dirty? 104 * u : unzeroed? 105 * l : large? 106 * a : allocated? 107 * 108 * Following are example bit patterns for the three types of runs. 109 * 110 * p : run page offset 111 * s : run size 112 * n : binind for size class; large objects set these to BININD_INVALID 113 * except for promoted allocations (see prof_promote) 114 * x : don't care 115 * - : 0 116 * + : 1 117 * [DULA] : bit set 118 * [dula] : bit unset 119 * 120 * Unallocated (clean): 121 * ssssssss ssssssss ssss++++ ++++du-a 122 * xxxxxxxx xxxxxxxx xxxxxxxx xxxx-Uxx 123 * ssssssss ssssssss ssss++++ ++++dU-a 124 * 125 * Unallocated (dirty): 126 * ssssssss ssssssss ssss++++ ++++D--a 127 * xxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxx 128 * ssssssss ssssssss ssss++++ ++++D--a 129 * 130 * Small: 131 * pppppppp pppppppp ppppnnnn nnnnd--A 132 * pppppppp pppppppp ppppnnnn nnnn---A 133 * pppppppp pppppppp ppppnnnn nnnnd--A 134 * 135 * Large: 136 * ssssssss ssssssss ssss++++ ++++D-LA 137 * xxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxx 138 * -------- -------- ----++++ ++++D-LA 139 * 140 * Large (sampled, size <= PAGE): 141 * ssssssss ssssssss ssssnnnn nnnnD-LA 142 * 143 * Large (not sampled, size == PAGE): 144 * ssssssss ssssssss ssss++++ ++++D-LA 145 */ 146 size_t bits; 147#define CHUNK_MAP_BININD_SHIFT 4 148#define BININD_INVALID ((size_t)0xffU) 149/* CHUNK_MAP_BININD_MASK == (BININD_INVALID << CHUNK_MAP_BININD_SHIFT) */ 150#define CHUNK_MAP_BININD_MASK ((size_t)0xff0U) 151#define CHUNK_MAP_BININD_INVALID CHUNK_MAP_BININD_MASK 152#define CHUNK_MAP_FLAGS_MASK ((size_t)0xcU) 153#define CHUNK_MAP_DIRTY ((size_t)0x8U) 154#define CHUNK_MAP_UNZEROED ((size_t)0x4U) 155#define CHUNK_MAP_LARGE ((size_t)0x2U) 156#define CHUNK_MAP_ALLOCATED ((size_t)0x1U) 157#define CHUNK_MAP_KEY CHUNK_MAP_ALLOCATED 158}; 159typedef rb_tree(arena_chunk_map_t) arena_avail_tree_t; 160typedef rb_tree(arena_chunk_map_t) arena_run_tree_t; 161typedef ql_head(arena_chunk_map_t) arena_chunk_mapelms_t; 162 163/* Arena chunk header. */ 164struct arena_chunk_s { 165 /* Arena that owns the chunk. */ 166 arena_t *arena; 167 168 /* Linkage for tree of arena chunks that contain dirty runs. */ 169 rb_node(arena_chunk_t) dirty_link; 170 171 /* Number of dirty pages. */ 172 size_t ndirty; 173 174 /* Number of available runs. */ 175 size_t nruns_avail; 176 177 /* 178 * Number of available run adjacencies that purging could coalesce. 179 * Clean and dirty available runs are not coalesced, which causes 180 * virtual memory fragmentation. The ratio of 181 * (nruns_avail-nruns_adjac):nruns_adjac is used for tracking this 182 * fragmentation. 183 */ 184 size_t nruns_adjac; 185 186 /* 187 * Map of pages within chunk that keeps track of free/large/small. The 188 * first map_bias entries are omitted, since the chunk header does not 189 * need to be tracked in the map. This omission saves a header page 190 * for common chunk sizes (e.g. 4 MiB). 191 */ 192 arena_chunk_map_t map[1]; /* Dynamically sized. */ 193}; 194typedef rb_tree(arena_chunk_t) arena_chunk_tree_t; 195 196struct arena_run_s { 197 /* Bin this run is associated with. */ 198 arena_bin_t *bin; 199 200 /* Index of next region that has never been allocated, or nregs. */ 201 uint32_t nextind; 202 203 /* Number of free regions in run. */ 204 unsigned nfree; 205}; 206 207/* 208 * Read-only information associated with each element of arena_t's bins array 209 * is stored separately, partly to reduce memory usage (only one copy, rather 210 * than one per arena), but mainly to avoid false cacheline sharing. 211 * 212 * Each run has the following layout: 213 * 214 * /--------------------\ 215 * | arena_run_t header | 216 * | ... | 217 * bitmap_offset | bitmap | 218 * | ... | 219 * ctx0_offset | ctx map | 220 * | ... | 221 * |--------------------| 222 * | redzone | 223 * reg0_offset | region 0 | 224 * | redzone | 225 * |--------------------| \ 226 * | redzone | | 227 * | region 1 | > reg_interval 228 * | redzone | / 229 * |--------------------| 230 * | ... | 231 * | ... | 232 * | ... | 233 * |--------------------| 234 * | redzone | 235 * | region nregs-1 | 236 * | redzone | 237 * |--------------------| 238 * | alignment pad? | 239 * \--------------------/ 240 * 241 * reg_interval has at least the same minimum alignment as reg_size; this 242 * preserves the alignment constraint that sa2u() depends on. Alignment pad is 243 * either 0 or redzone_size; it is present only if needed to align reg0_offset. 244 */ 245struct arena_bin_info_s { 246 /* Size of regions in a run for this bin's size class. */ 247 size_t reg_size; 248 249 /* Redzone size. */ 250 size_t redzone_size; 251 252 /* Interval between regions (reg_size + (redzone_size << 1)). */ 253 size_t reg_interval; 254 255 /* Total size of a run for this bin's size class. */ 256 size_t run_size; 257 258 /* Total number of regions in a run for this bin's size class. */ 259 uint32_t nregs; 260 261 /* 262 * Offset of first bitmap_t element in a run header for this bin's size 263 * class. 264 */ 265 uint32_t bitmap_offset; 266 267 /* 268 * Metadata used to manipulate bitmaps for runs associated with this 269 * bin. 270 */ 271 bitmap_info_t bitmap_info; 272 273 /* 274 * Offset of first (prof_ctx_t *) in a run header for this bin's size 275 * class, or 0 if (config_prof == false || opt_prof == false). 276 */ 277 uint32_t ctx0_offset; 278 279 /* Offset of first region in a run for this bin's size class. */ 280 uint32_t reg0_offset; 281}; 282 283struct arena_bin_s { 284 /* 285 * All operations on runcur, runs, and stats require that lock be 286 * locked. Run allocation/deallocation are protected by the arena lock, 287 * which may be acquired while holding one or more bin locks, but not 288 * vise versa. 289 */ 290 malloc_mutex_t lock; 291 292 /* 293 * Current run being used to service allocations of this bin's size 294 * class. 295 */ 296 arena_run_t *runcur; 297 298 /* 299 * Tree of non-full runs. This tree is used when looking for an 300 * existing run when runcur is no longer usable. We choose the 301 * non-full run that is lowest in memory; this policy tends to keep 302 * objects packed well, and it can also help reduce the number of 303 * almost-empty chunks. 304 */ 305 arena_run_tree_t runs; 306 307 /* Bin statistics. */ 308 malloc_bin_stats_t stats; 309}; 310 311struct arena_s { 312 /* This arena's index within the arenas array. */ 313 unsigned ind; 314 315 /* 316 * Number of threads currently assigned to this arena. This field is 317 * protected by arenas_lock. 318 */ 319 unsigned nthreads; 320 321 /* 322 * There are three classes of arena operations from a locking 323 * perspective: 324 * 1) Thread asssignment (modifies nthreads) is protected by 325 * arenas_lock. 326 * 2) Bin-related operations are protected by bin locks. 327 * 3) Chunk- and run-related operations are protected by this mutex. 328 */ 329 malloc_mutex_t lock; 330 331 arena_stats_t stats; 332 /* 333 * List of tcaches for extant threads associated with this arena. 334 * Stats from these are merged incrementally, and at exit. 335 */ 336 ql_head(tcache_t) tcache_ql; 337 338 uint64_t prof_accumbytes; 339 340 dss_prec_t dss_prec; 341 342 /* Tree of dirty-page-containing chunks this arena manages. */ 343 arena_chunk_tree_t chunks_dirty; 344 345 /* 346 * In order to avoid rapid chunk allocation/deallocation when an arena 347 * oscillates right on the cusp of needing a new chunk, cache the most 348 * recently freed chunk. The spare is left in the arena's chunk trees 349 * until it is deleted. 350 * 351 * There is one spare chunk per arena, rather than one spare total, in 352 * order to avoid interactions between multiple threads that could make 353 * a single spare inadequate. 354 */ 355 arena_chunk_t *spare; 356 357 /* Number of pages in active runs. */ 358 size_t nactive; 359 360 /* 361 * Current count of pages within unused runs that are potentially 362 * dirty, and for which madvise(... MADV_DONTNEED) has not been called. 363 * By tracking this, we can institute a limit on how much dirty unused 364 * memory is mapped for each arena. 365 */ 366 size_t ndirty; 367 368 /* 369 * Approximate number of pages being purged. It is possible for 370 * multiple threads to purge dirty pages concurrently, and they use 371 * npurgatory to indicate the total number of pages all threads are 372 * attempting to purge. 373 */ 374 size_t npurgatory; 375 376 /* 377 * Size/address-ordered trees of this arena's available runs. The trees 378 * are used for first-best-fit run allocation. 379 */ 380 arena_avail_tree_t runs_avail; 381 382 /* bins is used to store trees of free regions. */ 383 arena_bin_t bins[NBINS]; 384}; 385 386#endif /* JEMALLOC_H_STRUCTS */ 387/******************************************************************************/ 388#ifdef JEMALLOC_H_EXTERNS 389 390extern ssize_t opt_lg_dirty_mult; 391/* 392 * small_size2bin is a compact lookup table that rounds request sizes up to 393 * size classes. In order to reduce cache footprint, the table is compressed, 394 * and all accesses are via the SMALL_SIZE2BIN macro. 395 */ 396extern uint8_t const small_size2bin[]; 397#define SMALL_SIZE2BIN(s) (small_size2bin[(s-1) >> LG_TINY_MIN]) 398 399extern arena_bin_info_t arena_bin_info[NBINS]; 400 401/* Number of large size classes. */ 402#define nlclasses (chunk_npages - map_bias) 403 404void arena_purge_all(arena_t *arena); 405void arena_tcache_fill_small(arena_t *arena, tcache_bin_t *tbin, 406 size_t binind, uint64_t prof_accumbytes); 407void arena_alloc_junk_small(void *ptr, arena_bin_info_t *bin_info, 408 bool zero); 409#ifdef JEMALLOC_JET 410typedef void (arena_redzone_corruption_t)(void *, size_t, bool, size_t, 411 uint8_t); 412extern arena_redzone_corruption_t *arena_redzone_corruption; 413typedef void (arena_dalloc_junk_small_t)(void *, arena_bin_info_t *); 414extern arena_dalloc_junk_small_t *arena_dalloc_junk_small; 415#else 416void arena_dalloc_junk_small(void *ptr, arena_bin_info_t *bin_info); 417#endif 418void arena_quarantine_junk_small(void *ptr, size_t usize); 419void *arena_malloc_small(arena_t *arena, size_t size, bool zero); 420void *arena_malloc_large(arena_t *arena, size_t size, bool zero); 421void *arena_palloc(arena_t *arena, size_t size, size_t alignment, bool zero); 422void arena_prof_promoted(const void *ptr, size_t size); 423void arena_dalloc_bin_locked(arena_t *arena, arena_chunk_t *chunk, void *ptr, 424 arena_chunk_map_t *mapelm); 425void arena_dalloc_bin(arena_t *arena, arena_chunk_t *chunk, void *ptr, 426 size_t pageind, arena_chunk_map_t *mapelm); 427void arena_dalloc_small(arena_t *arena, arena_chunk_t *chunk, void *ptr, 428 size_t pageind); 429#ifdef JEMALLOC_JET 430typedef void (arena_dalloc_junk_large_t)(void *, size_t); 431extern arena_dalloc_junk_large_t *arena_dalloc_junk_large; 432#endif 433void arena_dalloc_large_locked(arena_t *arena, arena_chunk_t *chunk, 434 void *ptr); 435void arena_dalloc_large(arena_t *arena, arena_chunk_t *chunk, void *ptr); 436#ifdef JEMALLOC_JET 437typedef void (arena_ralloc_junk_large_t)(void *, size_t, size_t); 438extern arena_ralloc_junk_large_t *arena_ralloc_junk_large; 439#endif 440bool arena_ralloc_no_move(void *ptr, size_t oldsize, size_t size, 441 size_t extra, bool zero); 442void *arena_ralloc(arena_t *arena, void *ptr, size_t oldsize, size_t size, 443 size_t extra, size_t alignment, bool zero, bool try_tcache_alloc, 444 bool try_tcache_dalloc); 445dss_prec_t arena_dss_prec_get(arena_t *arena); 446void arena_dss_prec_set(arena_t *arena, dss_prec_t dss_prec); 447void arena_stats_merge(arena_t *arena, const char **dss, size_t *nactive, 448 size_t *ndirty, arena_stats_t *astats, malloc_bin_stats_t *bstats, 449 malloc_large_stats_t *lstats); 450bool arena_new(arena_t *arena, unsigned ind); 451void arena_boot(void); 452void arena_prefork(arena_t *arena); 453void arena_postfork_parent(arena_t *arena); 454void arena_postfork_child(arena_t *arena); 455 456#endif /* JEMALLOC_H_EXTERNS */ 457/******************************************************************************/ 458#ifdef JEMALLOC_H_INLINES 459 460#ifndef JEMALLOC_ENABLE_INLINE 461arena_chunk_map_t *arena_mapp_get(arena_chunk_t *chunk, size_t pageind); 462size_t *arena_mapbitsp_get(arena_chunk_t *chunk, size_t pageind); 463size_t arena_mapbitsp_read(size_t *mapbitsp); 464size_t arena_mapbits_get(arena_chunk_t *chunk, size_t pageind); 465size_t arena_mapbits_unallocated_size_get(arena_chunk_t *chunk, 466 size_t pageind); 467size_t arena_mapbits_large_size_get(arena_chunk_t *chunk, size_t pageind); 468size_t arena_mapbits_small_runind_get(arena_chunk_t *chunk, size_t pageind); 469size_t arena_mapbits_binind_get(arena_chunk_t *chunk, size_t pageind); 470size_t arena_mapbits_dirty_get(arena_chunk_t *chunk, size_t pageind); 471size_t arena_mapbits_unzeroed_get(arena_chunk_t *chunk, size_t pageind); 472size_t arena_mapbits_large_get(arena_chunk_t *chunk, size_t pageind); 473size_t arena_mapbits_allocated_get(arena_chunk_t *chunk, size_t pageind); 474void arena_mapbitsp_write(size_t *mapbitsp, size_t mapbits); 475void arena_mapbits_unallocated_set(arena_chunk_t *chunk, size_t pageind, 476 size_t size, size_t flags); 477void arena_mapbits_unallocated_size_set(arena_chunk_t *chunk, size_t pageind, 478 size_t size); 479void arena_mapbits_large_set(arena_chunk_t *chunk, size_t pageind, 480 size_t size, size_t flags); 481void arena_mapbits_large_binind_set(arena_chunk_t *chunk, size_t pageind, 482 size_t binind); 483void arena_mapbits_small_set(arena_chunk_t *chunk, size_t pageind, 484 size_t runind, size_t binind, size_t flags); 485void arena_mapbits_unzeroed_set(arena_chunk_t *chunk, size_t pageind, 486 size_t unzeroed); 487bool arena_prof_accum_impl(arena_t *arena, uint64_t accumbytes); 488bool arena_prof_accum_locked(arena_t *arena, uint64_t accumbytes); 489bool arena_prof_accum(arena_t *arena, uint64_t accumbytes); 490size_t arena_ptr_small_binind_get(const void *ptr, size_t mapbits); 491size_t arena_bin_index(arena_t *arena, arena_bin_t *bin); 492unsigned arena_run_regind(arena_run_t *run, arena_bin_info_t *bin_info, 493 const void *ptr); 494prof_ctx_t *arena_prof_ctx_get(const void *ptr); 495void arena_prof_ctx_set(const void *ptr, size_t usize, prof_ctx_t *ctx); 496void *arena_malloc(arena_t *arena, size_t size, bool zero, bool try_tcache); 497size_t arena_salloc(const void *ptr, bool demote); 498void arena_dalloc(arena_chunk_t *chunk, void *ptr, bool try_tcache); 499#endif 500 501#if (defined(JEMALLOC_ENABLE_INLINE) || defined(JEMALLOC_ARENA_C_)) 502# ifdef JEMALLOC_ARENA_INLINE_A 503JEMALLOC_ALWAYS_INLINE arena_chunk_map_t * 504arena_mapp_get(arena_chunk_t *chunk, size_t pageind) 505{ 506 507 assert(pageind >= map_bias); 508 assert(pageind < chunk_npages); 509 510 return (&chunk->map[pageind-map_bias]); 511} 512 513JEMALLOC_ALWAYS_INLINE size_t * 514arena_mapbitsp_get(arena_chunk_t *chunk, size_t pageind) 515{ 516 517 return (&arena_mapp_get(chunk, pageind)->bits); 518} 519 520JEMALLOC_ALWAYS_INLINE size_t 521arena_mapbitsp_read(size_t *mapbitsp) 522{ 523 524 return (*mapbitsp); 525} 526 527JEMALLOC_ALWAYS_INLINE size_t 528arena_mapbits_get(arena_chunk_t *chunk, size_t pageind) 529{ 530 531 return (arena_mapbitsp_read(arena_mapbitsp_get(chunk, pageind))); 532} 533 534JEMALLOC_ALWAYS_INLINE size_t 535arena_mapbits_unallocated_size_get(arena_chunk_t *chunk, size_t pageind) 536{ 537 size_t mapbits; 538 539 mapbits = arena_mapbits_get(chunk, pageind); 540 assert((mapbits & (CHUNK_MAP_LARGE|CHUNK_MAP_ALLOCATED)) == 0); 541 return (mapbits & ~PAGE_MASK); 542} 543 544JEMALLOC_ALWAYS_INLINE size_t 545arena_mapbits_large_size_get(arena_chunk_t *chunk, size_t pageind) 546{ 547 size_t mapbits; 548 549 mapbits = arena_mapbits_get(chunk, pageind); 550 assert((mapbits & (CHUNK_MAP_LARGE|CHUNK_MAP_ALLOCATED)) == 551 (CHUNK_MAP_LARGE|CHUNK_MAP_ALLOCATED)); 552 return (mapbits & ~PAGE_MASK); 553} 554 555JEMALLOC_ALWAYS_INLINE size_t 556arena_mapbits_small_runind_get(arena_chunk_t *chunk, size_t pageind) 557{ 558 size_t mapbits; 559 560 mapbits = arena_mapbits_get(chunk, pageind); 561 assert((mapbits & (CHUNK_MAP_LARGE|CHUNK_MAP_ALLOCATED)) == 562 CHUNK_MAP_ALLOCATED); 563 return (mapbits >> LG_PAGE); 564} 565 566JEMALLOC_ALWAYS_INLINE size_t 567arena_mapbits_binind_get(arena_chunk_t *chunk, size_t pageind) 568{ 569 size_t mapbits; 570 size_t binind; 571 572 mapbits = arena_mapbits_get(chunk, pageind); 573 binind = (mapbits & CHUNK_MAP_BININD_MASK) >> CHUNK_MAP_BININD_SHIFT; 574 assert(binind < NBINS || binind == BININD_INVALID); 575 return (binind); 576} 577 578JEMALLOC_ALWAYS_INLINE size_t 579arena_mapbits_dirty_get(arena_chunk_t *chunk, size_t pageind) 580{ 581 size_t mapbits; 582 583 mapbits = arena_mapbits_get(chunk, pageind); 584 return (mapbits & CHUNK_MAP_DIRTY); 585} 586 587JEMALLOC_ALWAYS_INLINE size_t 588arena_mapbits_unzeroed_get(arena_chunk_t *chunk, size_t pageind) 589{ 590 size_t mapbits; 591 592 mapbits = arena_mapbits_get(chunk, pageind); 593 return (mapbits & CHUNK_MAP_UNZEROED); 594} 595 596JEMALLOC_ALWAYS_INLINE size_t 597arena_mapbits_large_get(arena_chunk_t *chunk, size_t pageind) 598{ 599 size_t mapbits; 600 601 mapbits = arena_mapbits_get(chunk, pageind); 602 return (mapbits & CHUNK_MAP_LARGE); 603} 604 605JEMALLOC_ALWAYS_INLINE size_t 606arena_mapbits_allocated_get(arena_chunk_t *chunk, size_t pageind) 607{ 608 size_t mapbits; 609 610 mapbits = arena_mapbits_get(chunk, pageind); 611 return (mapbits & CHUNK_MAP_ALLOCATED); 612} 613 614JEMALLOC_ALWAYS_INLINE void 615arena_mapbitsp_write(size_t *mapbitsp, size_t mapbits) 616{ 617 618 *mapbitsp = mapbits; 619} 620 621JEMALLOC_ALWAYS_INLINE void 622arena_mapbits_unallocated_set(arena_chunk_t *chunk, size_t pageind, size_t size, 623 size_t flags) 624{ 625 size_t *mapbitsp = arena_mapbitsp_get(chunk, pageind); 626 627 assert((size & PAGE_MASK) == 0); 628 assert((flags & ~CHUNK_MAP_FLAGS_MASK) == 0); 629 assert((flags & (CHUNK_MAP_DIRTY|CHUNK_MAP_UNZEROED)) == flags); 630 arena_mapbitsp_write(mapbitsp, size | CHUNK_MAP_BININD_INVALID | flags); 631} 632 633JEMALLOC_ALWAYS_INLINE void 634arena_mapbits_unallocated_size_set(arena_chunk_t *chunk, size_t pageind, 635 size_t size) 636{ 637 size_t *mapbitsp = arena_mapbitsp_get(chunk, pageind); 638 size_t mapbits = arena_mapbitsp_read(mapbitsp); 639 640 assert((size & PAGE_MASK) == 0); 641 assert((mapbits & (CHUNK_MAP_LARGE|CHUNK_MAP_ALLOCATED)) == 0); 642 arena_mapbitsp_write(mapbitsp, size | (mapbits & PAGE_MASK)); 643} 644 645JEMALLOC_ALWAYS_INLINE void 646arena_mapbits_large_set(arena_chunk_t *chunk, size_t pageind, size_t size, 647 size_t flags) 648{ 649 size_t *mapbitsp = arena_mapbitsp_get(chunk, pageind); 650 size_t mapbits = arena_mapbitsp_read(mapbitsp); 651 size_t unzeroed; 652 653 assert((size & PAGE_MASK) == 0); 654 assert((flags & CHUNK_MAP_DIRTY) == flags); 655 unzeroed = mapbits & CHUNK_MAP_UNZEROED; /* Preserve unzeroed. */ 656 arena_mapbitsp_write(mapbitsp, size | CHUNK_MAP_BININD_INVALID | flags 657 | unzeroed | CHUNK_MAP_LARGE | CHUNK_MAP_ALLOCATED); 658} 659 660JEMALLOC_ALWAYS_INLINE void 661arena_mapbits_large_binind_set(arena_chunk_t *chunk, size_t pageind, 662 size_t binind) 663{ 664 size_t *mapbitsp = arena_mapbitsp_get(chunk, pageind); 665 size_t mapbits = arena_mapbitsp_read(mapbitsp); 666 667 assert(binind <= BININD_INVALID); 668 assert(arena_mapbits_large_size_get(chunk, pageind) == PAGE); 669 arena_mapbitsp_write(mapbitsp, (mapbits & ~CHUNK_MAP_BININD_MASK) | 670 (binind << CHUNK_MAP_BININD_SHIFT)); 671} 672 673JEMALLOC_ALWAYS_INLINE void 674arena_mapbits_small_set(arena_chunk_t *chunk, size_t pageind, size_t runind, 675 size_t binind, size_t flags) 676{ 677 size_t *mapbitsp = arena_mapbitsp_get(chunk, pageind); 678 size_t mapbits = arena_mapbitsp_read(mapbitsp); 679 size_t unzeroed; 680 681 assert(binind < BININD_INVALID); 682 assert(pageind - runind >= map_bias); 683 assert((flags & CHUNK_MAP_DIRTY) == flags); 684 unzeroed = mapbits & CHUNK_MAP_UNZEROED; /* Preserve unzeroed. */ 685 arena_mapbitsp_write(mapbitsp, (runind << LG_PAGE) | (binind << 686 CHUNK_MAP_BININD_SHIFT) | flags | unzeroed | CHUNK_MAP_ALLOCATED); 687} 688 689JEMALLOC_ALWAYS_INLINE void 690arena_mapbits_unzeroed_set(arena_chunk_t *chunk, size_t pageind, 691 size_t unzeroed) 692{ 693 size_t *mapbitsp = arena_mapbitsp_get(chunk, pageind); 694 size_t mapbits = arena_mapbitsp_read(mapbitsp); 695 696 arena_mapbitsp_write(mapbitsp, (mapbits & ~CHUNK_MAP_UNZEROED) | 697 unzeroed); 698} 699 700JEMALLOC_INLINE bool 701arena_prof_accum_impl(arena_t *arena, uint64_t accumbytes) 702{ 703 704 cassert(config_prof); 705 assert(prof_interval != 0); 706 707 arena->prof_accumbytes += accumbytes; 708 if (arena->prof_accumbytes >= prof_interval) { 709 arena->prof_accumbytes -= prof_interval; 710 return (true); 711 } 712 return (false); 713} 714 715JEMALLOC_INLINE bool 716arena_prof_accum_locked(arena_t *arena, uint64_t accumbytes) 717{ 718 719 cassert(config_prof); 720 721 if (prof_interval == 0) 722 return (false); 723 return (arena_prof_accum_impl(arena, accumbytes)); 724} 725 726JEMALLOC_INLINE bool 727arena_prof_accum(arena_t *arena, uint64_t accumbytes) 728{ 729 730 cassert(config_prof); 731 732 if (prof_interval == 0) 733 return (false); 734 735 { 736 bool ret; 737 738 malloc_mutex_lock(&arena->lock); 739 ret = arena_prof_accum_impl(arena, accumbytes); 740 malloc_mutex_unlock(&arena->lock); 741 return (ret); 742 } 743} 744 745JEMALLOC_ALWAYS_INLINE size_t 746arena_ptr_small_binind_get(const void *ptr, size_t mapbits) 747{ 748 size_t binind; 749 750 binind = (mapbits & CHUNK_MAP_BININD_MASK) >> CHUNK_MAP_BININD_SHIFT; 751 752 if (config_debug) { 753 arena_chunk_t *chunk; 754 arena_t *arena; 755 size_t pageind; 756 size_t actual_mapbits; 757 arena_run_t *run; 758 arena_bin_t *bin; 759 size_t actual_binind; 760 arena_bin_info_t *bin_info; 761 762 assert(binind != BININD_INVALID); 763 assert(binind < NBINS); 764 chunk = (arena_chunk_t *)CHUNK_ADDR2BASE(ptr); 765 arena = chunk->arena; 766 pageind = ((uintptr_t)ptr - (uintptr_t)chunk) >> LG_PAGE; 767 actual_mapbits = arena_mapbits_get(chunk, pageind); 768 assert(mapbits == actual_mapbits); 769 assert(arena_mapbits_large_get(chunk, pageind) == 0); 770 assert(arena_mapbits_allocated_get(chunk, pageind) != 0); 771 run = (arena_run_t *)((uintptr_t)chunk + (uintptr_t)((pageind - 772 (actual_mapbits >> LG_PAGE)) << LG_PAGE)); 773 bin = run->bin; 774 actual_binind = bin - arena->bins; 775 assert(binind == actual_binind); 776 bin_info = &arena_bin_info[actual_binind]; 777 assert(((uintptr_t)ptr - ((uintptr_t)run + 778 (uintptr_t)bin_info->reg0_offset)) % bin_info->reg_interval 779 == 0); 780 } 781 782 return (binind); 783} 784# endif /* JEMALLOC_ARENA_INLINE_A */ 785 786# ifdef JEMALLOC_ARENA_INLINE_B 787JEMALLOC_INLINE size_t 788arena_bin_index(arena_t *arena, arena_bin_t *bin) 789{ 790 size_t binind = bin - arena->bins; 791 assert(binind < NBINS); 792 return (binind); 793} 794 795JEMALLOC_INLINE unsigned 796arena_run_regind(arena_run_t *run, arena_bin_info_t *bin_info, const void *ptr) 797{ 798 unsigned shift, diff, regind; 799 size_t interval; 800 801 /* 802 * Freeing a pointer lower than region zero can cause assertion 803 * failure. 804 */ 805 assert((uintptr_t)ptr >= (uintptr_t)run + 806 (uintptr_t)bin_info->reg0_offset); 807 808 /* 809 * Avoid doing division with a variable divisor if possible. Using 810 * actual division here can reduce allocator throughput by over 20%! 811 */ 812 diff = (unsigned)((uintptr_t)ptr - (uintptr_t)run - 813 bin_info->reg0_offset); 814 815 /* Rescale (factor powers of 2 out of the numerator and denominator). */ 816 interval = bin_info->reg_interval; 817 shift = ffs(interval) - 1; 818 diff >>= shift; 819 interval >>= shift; 820 821 if (interval == 1) { 822 /* The divisor was a power of 2. */ 823 regind = diff; 824 } else { 825 /* 826 * To divide by a number D that is not a power of two we 827 * multiply by (2^21 / D) and then right shift by 21 positions. 828 * 829 * X / D 830 * 831 * becomes 832 * 833 * (X * interval_invs[D - 3]) >> SIZE_INV_SHIFT 834 * 835 * We can omit the first three elements, because we never 836 * divide by 0, and 1 and 2 are both powers of two, which are 837 * handled above. 838 */ 839#define SIZE_INV_SHIFT ((sizeof(unsigned) << 3) - LG_RUN_MAXREGS) 840#define SIZE_INV(s) (((1U << SIZE_INV_SHIFT) / (s)) + 1) 841 static const unsigned interval_invs[] = { 842 SIZE_INV(3), 843 SIZE_INV(4), SIZE_INV(5), SIZE_INV(6), SIZE_INV(7), 844 SIZE_INV(8), SIZE_INV(9), SIZE_INV(10), SIZE_INV(11), 845 SIZE_INV(12), SIZE_INV(13), SIZE_INV(14), SIZE_INV(15), 846 SIZE_INV(16), SIZE_INV(17), SIZE_INV(18), SIZE_INV(19), 847 SIZE_INV(20), SIZE_INV(21), SIZE_INV(22), SIZE_INV(23), 848 SIZE_INV(24), SIZE_INV(25), SIZE_INV(26), SIZE_INV(27), 849 SIZE_INV(28), SIZE_INV(29), SIZE_INV(30), SIZE_INV(31) 850 }; 851 852 if (interval <= ((sizeof(interval_invs) / sizeof(unsigned)) + 853 2)) { 854 regind = (diff * interval_invs[interval - 3]) >> 855 SIZE_INV_SHIFT; 856 } else 857 regind = diff / interval; 858#undef SIZE_INV 859#undef SIZE_INV_SHIFT 860 } 861 assert(diff == regind * interval); 862 assert(regind < bin_info->nregs); 863 864 return (regind); 865} 866 867JEMALLOC_INLINE prof_ctx_t * 868arena_prof_ctx_get(const void *ptr) 869{ 870 prof_ctx_t *ret; 871 arena_chunk_t *chunk; 872 size_t pageind, mapbits; 873 874 cassert(config_prof); 875 assert(ptr != NULL); 876 assert(CHUNK_ADDR2BASE(ptr) != ptr); 877 878 chunk = (arena_chunk_t *)CHUNK_ADDR2BASE(ptr); 879 pageind = ((uintptr_t)ptr - (uintptr_t)chunk) >> LG_PAGE; 880 mapbits = arena_mapbits_get(chunk, pageind); 881 assert((mapbits & CHUNK_MAP_ALLOCATED) != 0); 882 if ((mapbits & CHUNK_MAP_LARGE) == 0) { 883 if (prof_promote) 884 ret = (prof_ctx_t *)(uintptr_t)1U; 885 else { 886 arena_run_t *run = (arena_run_t *)((uintptr_t)chunk + 887 (uintptr_t)((pageind - (mapbits >> LG_PAGE)) << 888 LG_PAGE)); 889 size_t binind = arena_ptr_small_binind_get(ptr, 890 mapbits); 891 arena_bin_info_t *bin_info = &arena_bin_info[binind]; 892 unsigned regind; 893 894 regind = arena_run_regind(run, bin_info, ptr); 895 ret = *(prof_ctx_t **)((uintptr_t)run + 896 bin_info->ctx0_offset + (regind * 897 sizeof(prof_ctx_t *))); 898 } 899 } else 900 ret = arena_mapp_get(chunk, pageind)->prof_ctx; 901 902 return (ret); 903} 904 905JEMALLOC_INLINE void 906arena_prof_ctx_set(const void *ptr, size_t usize, prof_ctx_t *ctx) 907{ 908 arena_chunk_t *chunk; 909 size_t pageind; 910 911 cassert(config_prof); 912 assert(ptr != NULL); 913 assert(CHUNK_ADDR2BASE(ptr) != ptr); 914 915 chunk = (arena_chunk_t *)CHUNK_ADDR2BASE(ptr); 916 pageind = ((uintptr_t)ptr - (uintptr_t)chunk) >> LG_PAGE; 917 assert(arena_mapbits_allocated_get(chunk, pageind) != 0); 918 919 if (usize > SMALL_MAXCLASS || (prof_promote && 920 ((uintptr_t)ctx != (uintptr_t)1U || arena_mapbits_large_get(chunk, 921 pageind) != 0))) { 922 assert(arena_mapbits_large_get(chunk, pageind) != 0); 923 arena_mapp_get(chunk, pageind)->prof_ctx = ctx; 924 } else { 925 assert(arena_mapbits_large_get(chunk, pageind) == 0); 926 if (prof_promote == false) { 927 size_t mapbits = arena_mapbits_get(chunk, pageind); 928 arena_run_t *run = (arena_run_t *)((uintptr_t)chunk + 929 (uintptr_t)((pageind - (mapbits >> LG_PAGE)) << 930 LG_PAGE)); 931 size_t binind; 932 arena_bin_info_t *bin_info; 933 unsigned regind; 934 935 binind = arena_ptr_small_binind_get(ptr, mapbits); 936 bin_info = &arena_bin_info[binind]; 937 regind = arena_run_regind(run, bin_info, ptr); 938 939 *((prof_ctx_t **)((uintptr_t)run + 940 bin_info->ctx0_offset + (regind * sizeof(prof_ctx_t 941 *)))) = ctx; 942 } 943 } 944} 945 946JEMALLOC_ALWAYS_INLINE void * 947arena_malloc(arena_t *arena, size_t size, bool zero, bool try_tcache) 948{ 949 tcache_t *tcache; 950 951 assert(size != 0); 952 assert(size <= arena_maxclass); 953 954 if (size <= SMALL_MAXCLASS) { 955 if (try_tcache && (tcache = tcache_get(true)) != NULL) 956 return (tcache_alloc_small(tcache, size, zero)); 957 else { 958 return (arena_malloc_small(choose_arena(arena), size, 959 zero)); 960 } 961 } else { 962 /* 963 * Initialize tcache after checking size in order to avoid 964 * infinite recursion during tcache initialization. 965 */ 966 if (try_tcache && size <= tcache_maxclass && (tcache = 967 tcache_get(true)) != NULL) 968 return (tcache_alloc_large(tcache, size, zero)); 969 else { 970 return (arena_malloc_large(choose_arena(arena), size, 971 zero)); 972 } 973 } 974} 975 976/* Return the size of the allocation pointed to by ptr. */ 977JEMALLOC_ALWAYS_INLINE size_t 978arena_salloc(const void *ptr, bool demote) 979{ 980 size_t ret; 981 arena_chunk_t *chunk; 982 size_t pageind, binind; 983 984 assert(ptr != NULL); 985 assert(CHUNK_ADDR2BASE(ptr) != ptr); 986 987 chunk = (arena_chunk_t *)CHUNK_ADDR2BASE(ptr); 988 pageind = ((uintptr_t)ptr - (uintptr_t)chunk) >> LG_PAGE; 989 assert(arena_mapbits_allocated_get(chunk, pageind) != 0); 990 binind = arena_mapbits_binind_get(chunk, pageind); 991 if (binind == BININD_INVALID || (config_prof && demote == false && 992 prof_promote && arena_mapbits_large_get(chunk, pageind) != 0)) { 993 /* 994 * Large allocation. In the common case (demote == true), and 995 * as this is an inline function, most callers will only end up 996 * looking at binind to determine that ptr is a small 997 * allocation. 998 */ 999 assert(((uintptr_t)ptr & PAGE_MASK) == 0); 1000 ret = arena_mapbits_large_size_get(chunk, pageind); 1001 assert(ret != 0); 1002 assert(pageind + (ret>>LG_PAGE) <= chunk_npages); 1003 assert(ret == PAGE || arena_mapbits_large_size_get(chunk, 1004 pageind+(ret>>LG_PAGE)-1) == 0); 1005 assert(binind == arena_mapbits_binind_get(chunk, 1006 pageind+(ret>>LG_PAGE)-1)); 1007 assert(arena_mapbits_dirty_get(chunk, pageind) == 1008 arena_mapbits_dirty_get(chunk, pageind+(ret>>LG_PAGE)-1)); 1009 } else { 1010 /* 1011 * Small allocation (possibly promoted to a large object due to 1012 * prof_promote). 1013 */ 1014 assert(arena_mapbits_large_get(chunk, pageind) != 0 || 1015 arena_ptr_small_binind_get(ptr, arena_mapbits_get(chunk, 1016 pageind)) == binind); 1017 ret = arena_bin_info[binind].reg_size; 1018 } 1019 1020 return (ret); 1021} 1022 1023JEMALLOC_ALWAYS_INLINE void 1024arena_dalloc(arena_chunk_t *chunk, void *ptr, bool try_tcache) 1025{ 1026 size_t pageind, mapbits; 1027 tcache_t *tcache; 1028 1029 assert(ptr != NULL); 1030 assert(CHUNK_ADDR2BASE(ptr) != ptr); 1031 1032 pageind = ((uintptr_t)ptr - (uintptr_t)chunk) >> LG_PAGE; 1033 mapbits = arena_mapbits_get(chunk, pageind); 1034 assert(arena_mapbits_allocated_get(chunk, pageind) != 0); 1035 if ((mapbits & CHUNK_MAP_LARGE) == 0) { 1036 /* Small allocation. */ 1037 if (try_tcache && (tcache = tcache_get(false)) != NULL) { 1038 size_t binind; 1039 1040 binind = arena_ptr_small_binind_get(ptr, mapbits); 1041 tcache_dalloc_small(tcache, ptr, binind); 1042 } else 1043 arena_dalloc_small(chunk->arena, chunk, ptr, pageind); 1044 } else { 1045 size_t size = arena_mapbits_large_size_get(chunk, pageind); 1046 1047 assert(((uintptr_t)ptr & PAGE_MASK) == 0); 1048 1049 if (try_tcache && size <= tcache_maxclass && (tcache = 1050 tcache_get(false)) != NULL) { 1051 tcache_dalloc_large(tcache, ptr, size); 1052 } else 1053 arena_dalloc_large(chunk->arena, chunk, ptr); 1054 } 1055} 1056# endif /* JEMALLOC_ARENA_INLINE_B */ 1057#endif 1058 1059#endif /* JEMALLOC_H_INLINES */ 1060/******************************************************************************/ 1061