#include "jemalloc/internal/jemalloc_preamble.h" #include "jemalloc/internal/arena.h" #include "jemalloc/internal/background_thread.h" #include "jemalloc/internal/extent.h" #include "jemalloc/internal/pac.h" #include "jemalloc/internal/san.h" #include "jemalloc/internal/witness.h" static inline uint8_t pac_sec_shard_pick(tsdn_t *tsdn, sec_t *sec) { if (sec->opts.nshards <= 1) { return 0; } if (tsdn_null(tsdn)) { return 0; } tsd_t *tsd = tsdn_tsd(tsdn); return sec_shard_pick(tsd, sec, tsd_pac_sec_shardp_get(tsd)); } static inline void pac_decay_data_get(pac_t *pac, extent_state_t state, decay_t **r_decay, pac_decay_stats_t **r_decay_stats, ecache_t **r_ecache) { switch (state) { case extent_state_dirty: *r_decay = &pac->decay_dirty; *r_decay_stats = &pac->stats->decay_dirty; *r_ecache = &pac->ecache_dirty; return; case extent_state_muzzy: *r_decay = &pac->decay_muzzy; *r_decay_stats = &pac->stats->decay_muzzy; *r_ecache = &pac->ecache_muzzy; return; case extent_state_active: case extent_state_retained: case extent_state_pinned: case extent_state_transition: case extent_state_merging: default: unreachable(); } } bool pac_init(tsdn_t *tsdn, pac_t *pac, base_t *base, emap_t *emap, edata_cache_t *edata_cache, nstime_t *cur_time, size_t pac_oversize_threshold, ssize_t dirty_decay_ms, ssize_t muzzy_decay_ms, pac_stats_t *pac_stats, malloc_mutex_t *stats_mtx) { unsigned ind = base_ind_get(base); /* * Delay coalescing for dirty extents despite the disruptive effect on * memory layout for best-fit extent allocation, since cached extents * are likely to be reused soon after deallocation, and the cost of * merging/splitting extents is non-trivial. */ if (ecache_init(tsdn, &pac->ecache_dirty, extent_state_dirty, ind, /* delay_coalesce */ true)) { return true; } /* * Coalesce muzzy extents immediately, because operations on them are in * the critical path much less often than for dirty extents. */ if (ecache_init(tsdn, &pac->ecache_muzzy, extent_state_muzzy, ind, /* delay_coalesce */ false)) { return true; } /* * Coalesce retained extents immediately, in part because they will * never be evicted (and therefore there's no opportunity for delayed * coalescing), but also because operations on retained extents are not * in the critical path. */ if (ecache_init(tsdn, &pac->ecache_retained, extent_state_retained, ind, /* delay_coalesce */ false)) { return true; } /* Pinned extents: no decay, delayed coalesce. */ if (ecache_init(tsdn, &pac->ecache_pinned, extent_state_pinned, ind, /* delay_coalesce */ true)) { return true; } atomic_store_b(&pac->has_pinned, false, ATOMIC_RELAXED); exp_grow_init(&pac->exp_grow); if (malloc_mutex_init(&pac->grow_mtx, "extent_grow", WITNESS_RANK_EXTENT_GROW, malloc_mutex_rank_exclusive)) { return true; } atomic_store_zu( &pac->oversize_threshold, pac_oversize_threshold, ATOMIC_RELAXED); if (decay_init(&pac->decay_dirty, cur_time, dirty_decay_ms)) { return true; } if (decay_init(&pac->decay_muzzy, cur_time, muzzy_decay_ms)) { return true; } if (san_bump_alloc_init(&pac->sba)) { return true; } pac->base = base; pac->emap = emap; pac->edata_cache = edata_cache; pac->stats = pac_stats; pac->stats_mtx = stats_mtx; atomic_store_zu(&pac->extent_sn_next, 0, ATOMIC_RELAXED); if (sec_init(tsdn, &pac->sec, base, &opt_pac_sec_opts)) { /* sec_init already zeroed nshards and max_alloc. */ } if (!sec_is_used(&pac->sec) || dirty_decay_ms == 0) { atomic_store_zu(&pac->sec_max_alloc, 0, ATOMIC_RELAXED); } else { atomic_store_zu(&pac->sec_max_alloc, pac->sec.opts.max_alloc, ATOMIC_RELAXED); } return false; } static inline bool pac_may_have_muzzy(pac_t *pac) { return pac_decay_ms_get(pac, extent_state_muzzy) != 0; } static inline void pac_ecache_dalloc(tsdn_t *tsdn, pac_t *pac, ehooks_t *ehooks, edata_t *edata) { ecache_dalloc(tsdn, pac, ehooks, edata_pinned_get(edata) ? &pac->ecache_pinned : &pac->ecache_dirty, edata); } static size_t pac_alloc_retained_batched_size(size_t size) { if (size > SC_LARGE_MAXCLASS) { /* * A valid input with usize SC_LARGE_MAXCLASS could still * reach here because of sz_large_pad. Such a request is valid * but we should not further increase it. Thus, directly * return size for such cases. */ return size; } size_t batched_size = sz_s2u_compute_using_delta(size); size_t next_hugepage_size = HUGEPAGE_CEILING(size); return batched_size > next_hugepage_size ? next_hugepage_size : batched_size; } static edata_t * pac_alloc_real(tsdn_t *tsdn, pac_t *pac, ehooks_t *ehooks, size_t size, size_t alignment, bool zero, bool guarded) { assert(!guarded || alignment <= PAGE); size_t newly_mapped_size = 0; edata_t *edata = NULL; if (!guarded && !zero && alignment <= PAGE && size <= atomic_load_zu(&pac->sec_max_alloc, ATOMIC_RELAXED)) { /* * sec_max_alloc mirrors sec.opts.max_alloc when SEC is * enabled, 0 when dirty decay is disabled. */ edata = sec_alloc(tsdn, &pac->sec, size, pac_sec_shard_pick(tsdn, &pac->sec)); if (edata != NULL) { return edata; } /* * Unlike HPA, PAC has no batch allocation primitive; we * intentionally do not refill SEC on a miss. Extents enter the * cache only through the dalloc path. */ } /* * Guarded allocations need surrounding guard pages, which the pinned * pool does not maintain; skip ecache_pinned in that case. */ if (!guarded && atomic_load_b(&pac->has_pinned, ATOMIC_RELAXED) && ecache_npages_get(&pac->ecache_pinned) > 0) { edata = ecache_alloc(tsdn, pac, ehooks, &pac->ecache_pinned, NULL, size, alignment, zero, guarded); } if (edata == NULL) { edata = ecache_alloc(tsdn, pac, ehooks, &pac->ecache_dirty, NULL, size, alignment, zero, guarded); } if (edata == NULL && pac_may_have_muzzy(pac)) { edata = ecache_alloc(tsdn, pac, ehooks, &pac->ecache_muzzy, NULL, size, alignment, zero, guarded); } /* * We batched allocate a larger extent with large size classes disabled * because the reuse of extents in the dirty pool is worse without size * classes for large allocs. For instance, when * disable_large_size_classes is false, 1.1MB, 1.15MB, and 1.2MB allocs * will all be ceiled to 1.25MB and can reuse the same buffer if they * are alloc & dalloc sequentially. However, with * disable_large_size_classes being true, they cannot reuse the same * buffer and their sequential allocs & dallocs will result in three * different extents. Thus, we cache extra mergeable extents in the * dirty pool to improve the reuse. We skip this optimization if both * maps_coalesce and opt_retain are disabled because VM is not cheap * enough in such cases to be used aggressively and extents cannot be * merged at will (only extents from the same VirtualAlloc can be * merged). Note that it could still be risky to cache more extents * when either mpas_coalesce or opt_retain is enabled. Yet doing * so is still beneficial in improving the reuse of extents with some * limits. This choice should be reevaluated if * pac_alloc_retained_batched_size is changed to be more aggressive. */ if (sz_large_size_classes_disabled() && edata == NULL && (maps_coalesce || opt_retain)) { size_t batched_size = pac_alloc_retained_batched_size(size); /* * Note that ecache_alloc_grow will try to retrieve virtual * memory from both retained pool and directly from OS through * extent_alloc_wrapper if the retained pool has no qualified * extents. This is also why the overcaching still works even * with opt_retain off. */ edata = ecache_alloc_grow(tsdn, pac, ehooks, &pac->ecache_retained, NULL, batched_size, alignment, zero, guarded); if (edata != NULL && batched_size > size) { edata_t *trail = extent_split_wrapper(tsdn, pac, ehooks, edata, size, batched_size - size, /* holding_core_locks */ false); if (trail == NULL) { pac_record_grown(tsdn, pac, ehooks, edata); edata = NULL; } else { pac_ecache_dalloc(tsdn, pac, ehooks, trail); } } if (edata != NULL) { newly_mapped_size = batched_size; } } if (edata == NULL) { edata = ecache_alloc_grow(tsdn, pac, ehooks, &pac->ecache_retained, NULL, size, alignment, zero, guarded); if (edata != NULL) { newly_mapped_size = size; } } if (config_stats && newly_mapped_size != 0) { atomic_fetch_add_zu( &pac->stats->pac_mapped, newly_mapped_size, ATOMIC_RELAXED); } return edata; } static edata_t * pac_alloc_new_guarded(tsdn_t *tsdn, pac_t *pac, ehooks_t *ehooks, size_t size, size_t alignment, bool zero, bool frequent_reuse) { assert(alignment <= PAGE); edata_t *edata; if (san_bump_enabled() && frequent_reuse) { edata = san_bump_alloc( tsdn, &pac->sba, pac, ehooks, size, zero); } else { size_t size_with_guards = san_two_side_guarded_sz(size); /* Alloc a non-guarded extent first.*/ edata = pac_alloc_real(tsdn, pac, ehooks, size_with_guards, /* alignment */ PAGE, zero, /* guarded */ false); if (edata != NULL) { /* Add guards around it. */ assert(edata_size_get(edata) == size_with_guards); san_guard_pages_two_sided( tsdn, ehooks, edata, pac->emap, true); } } assert(edata == NULL || (edata_guarded_get(edata) && edata_size_get(edata) == size)); return edata; } edata_t * pac_alloc(tsdn_t *tsdn, pac_t *pac, size_t size, size_t alignment, bool zero, bool guarded, bool frequent_reuse, bool *deferred_work_generated) { ehooks_t *ehooks = pac_ehooks_get(pac); edata_t *edata = NULL; /* * The condition is an optimization - not frequently reused guarded * allocations are never put in the ecache. pac_alloc_real also * doesn't grow retained for guarded allocations. So pac_alloc_real * for such allocations would always return NULL. * */ if (!guarded || frequent_reuse) { edata = pac_alloc_real( tsdn, pac, ehooks, size, alignment, zero, guarded); } if (edata == NULL && guarded) { /* No cached guarded extents; creating a new one. */ edata = pac_alloc_new_guarded( tsdn, pac, ehooks, size, alignment, zero, frequent_reuse); } return edata; } bool pac_expand(tsdn_t *tsdn, pac_t *pac, edata_t *edata, size_t old_size, size_t new_size, bool zero, bool *deferred_work_generated) { assert(edata_pai_get(edata) == EXTENT_PAI_PAC); ehooks_t *ehooks = pac_ehooks_get(pac); size_t mapped_add = 0; size_t expand_amount = new_size - old_size; if (ehooks_merge_will_fail(ehooks)) { return true; } edata_t *trail = NULL; if (edata_pinned_get(edata)) { trail = ecache_alloc(tsdn, pac, ehooks, &pac->ecache_pinned, edata, expand_amount, PAGE, zero, /* guarded */ false); if (trail == NULL) { /* * Only ecache_pinned can hold a mergeable neighbor; * dirty, muzzy, and retained extents are non-pinned. * Pinned memory is already committed, and hooks are * unlikely to reserve adjacent pinned space for growth, * so don't consult the hook to grow in place. */ return true; } assert(edata_pinned_get(trail)); } else { trail = ecache_alloc(tsdn, pac, ehooks, &pac->ecache_dirty, edata, expand_amount, PAGE, zero, /* guarded */ false); if (trail == NULL) { trail = ecache_alloc(tsdn, pac, ehooks, &pac->ecache_muzzy, edata, expand_amount, PAGE, zero, /* guarded */ false); } if (trail == NULL) { trail = ecache_alloc_grow(tsdn, pac, ehooks, &pac->ecache_retained, edata, expand_amount, PAGE, zero, /* guarded */ false); mapped_add = expand_amount; } if (trail == NULL) { return true; } } /* extent_merge_wrapper requires matching pinnedness. */ if ((edata_pinned_get(edata) != edata_pinned_get(trail)) || extent_merge_wrapper(tsdn, pac, ehooks, edata, trail)) { if (edata_pinned_get(trail)) { if (config_stats) { atomic_fetch_add_zu(&pac->stats->pac_mapped, mapped_add, ATOMIC_RELAXED); } ecache_dalloc(tsdn, pac, ehooks, &pac->ecache_pinned, trail); } else { extent_dalloc_wrapper(tsdn, pac, ehooks, trail); } return true; } if (config_stats && mapped_add > 0) { atomic_fetch_add_zu( &pac->stats->pac_mapped, mapped_add, ATOMIC_RELAXED); } return false; } bool pac_shrink(tsdn_t *tsdn, pac_t *pac, edata_t *edata, size_t old_size, size_t new_size, bool *deferred_work_generated) { assert(edata_pai_get(edata) == EXTENT_PAI_PAC); ehooks_t *ehooks = pac_ehooks_get(pac); size_t shrink_amount = old_size - new_size; if (ehooks_split_will_fail(ehooks)) { return true; } edata_t *trail = extent_split_wrapper(tsdn, pac, ehooks, edata, new_size, shrink_amount, /* holding_core_locks */ false); if (trail == NULL) { return true; } bool pinned = edata_pinned_get(trail); pac_ecache_dalloc(tsdn, pac, ehooks, trail); if (!pinned) { *deferred_work_generated = true; } return false; } void pac_dalloc(tsdn_t *tsdn, pac_t *pac, edata_t *edata, bool *deferred_work_generated) { assert(edata_pai_get(edata) == EXTENT_PAI_PAC); ehooks_t *ehooks = pac_ehooks_get(pac); if (edata_guarded_get(edata)) { /* * Because cached guarded extents do exact fit only, large * guarded extents are restored on dalloc eagerly (otherwise * they will not be reused efficiently). Slab sizes have a * limited number of size classes, and tend to cycle faster. * * In the case where coalesce is restrained (VirtualFree on * Windows), guarded extents are also not cached -- otherwise * during arena destroy / reset, the retained extents would not * be whole regions (i.e. they are split between regular and * guarded). */ if (!edata_slab_get(edata) || !maps_coalesce) { assert(edata_size_get(edata) >= SC_LARGE_MINCLASS || !maps_coalesce); san_unguard_pages_two_sided( tsdn, ehooks, edata, pac->emap); } } else if (edata_size_get(edata) <= atomic_load_zu(&pac->sec_max_alloc, ATOMIC_RELAXED)) { /* * A dalloc can race with disabling SEC and cache an extent after * the flush. Avoid a hot-path gate lock; such extents remain * stats-tracked and are flushed by reset/destroy or a later * disable. */ edata_list_active_t dalloc_list; edata_list_active_init(&dalloc_list); edata_list_active_append(&dalloc_list, edata); sec_dalloc(tsdn, &pac->sec, &dalloc_list, pac_sec_shard_pick(tsdn, &pac->sec)); if (edata_list_active_empty(&dalloc_list)) { *deferred_work_generated = false; return; } /* Flush overflow extents to their backing ecaches. */ bool any_deferred_work = false; edata_t *flush_edata; while ((flush_edata = edata_list_active_first(&dalloc_list)) != NULL) { edata_list_active_remove(&dalloc_list, flush_edata); if (!edata_pinned_get(flush_edata)) { any_deferred_work = true; } pac_ecache_dalloc(tsdn, pac, ehooks, flush_edata); } *deferred_work_generated = any_deferred_work; return; } bool pinned = edata_pinned_get(edata); pac_ecache_dalloc(tsdn, pac, ehooks, edata); if (!pinned) { *deferred_work_generated = true; } } static inline uint64_t pac_ns_until_purge(tsdn_t *tsdn, decay_t *decay, size_t npages) { if (malloc_mutex_trylock(tsdn, &decay->mtx)) { /* Use minimal interval if decay is contended. */ return BACKGROUND_THREAD_DEFERRED_MIN; } uint64_t result = decay_ns_until_purge( decay, npages, ARENA_DEFERRED_PURGE_NPAGES_THRESHOLD); malloc_mutex_unlock(tsdn, &decay->mtx); return result; } uint64_t pac_time_until_deferred_work(tsdn_t *tsdn, pac_t *pac) { uint64_t time; time = pac_ns_until_purge( tsdn, &pac->decay_dirty, ecache_npages_get(&pac->ecache_dirty)); if (time == BACKGROUND_THREAD_DEFERRED_MIN) { return time; } uint64_t muzzy = pac_ns_until_purge( tsdn, &pac->decay_muzzy, ecache_npages_get(&pac->ecache_muzzy)); if (muzzy < time) { time = muzzy; } return time; } bool pac_retain_grow_limit_get_set( tsdn_t *tsdn, pac_t *pac, size_t *old_limit, size_t *new_limit) { pszind_t new_ind JEMALLOC_CC_SILENCE_INIT(0); if (new_limit != NULL) { size_t limit = *new_limit; /* Grow no more than the new limit. */ if ((new_ind = sz_psz2ind(limit + 1) - 1) >= SC_NPSIZES) { return true; } } malloc_mutex_lock(tsdn, &pac->grow_mtx); if (old_limit != NULL) { *old_limit = sz_pind2sz(pac->exp_grow.limit); } if (new_limit != NULL) { pac->exp_grow.limit = new_ind; } malloc_mutex_unlock(tsdn, &pac->grow_mtx); return false; } static size_t pac_stash_decayed(tsdn_t *tsdn, pac_t *pac, ecache_t *ecache, size_t npages_limit, size_t npages_decay_max, edata_list_inactive_t *result) { witness_assert_depth_to_rank( tsdn_witness_tsdp_get(tsdn), WITNESS_RANK_CORE, 0); ehooks_t *ehooks = pac_ehooks_get(pac); /* Stash extents according to npages_limit. */ size_t nstashed = 0; while (nstashed < npages_decay_max) { edata_t *edata = ecache_evict( tsdn, pac, ehooks, ecache, npages_limit); if (edata == NULL) { break; } edata_list_inactive_append(result, edata); nstashed += edata_size_get(edata) >> LG_PAGE; } return nstashed; } static bool decay_with_process_madvise(edata_list_inactive_t *decay_extents) { cassert(have_process_madvise); assert(opt_process_madvise_max_batch > 0); #ifndef JEMALLOC_HAVE_PROCESS_MADVISE return true; #else assert( opt_process_madvise_max_batch <= PROCESS_MADVISE_MAX_BATCH_LIMIT); size_t len = opt_process_madvise_max_batch; VARIABLE_ARRAY(struct iovec, vec, len); size_t cur = 0, total_bytes = 0; for (edata_t *edata = edata_list_inactive_first(decay_extents); edata != NULL; edata = edata_list_inactive_next(decay_extents, edata)) { size_t pages_bytes = edata_size_get(edata); vec[cur].iov_base = edata_base_get(edata); vec[cur].iov_len = pages_bytes; total_bytes += pages_bytes; cur++; if (cur == len) { bool err = pages_purge_process_madvise( vec, len, total_bytes); if (err) { return true; } cur = 0; total_bytes = 0; } } if (cur > 0) { return pages_purge_process_madvise(vec, cur, total_bytes); } return false; #endif } static size_t pac_decay_stashed(tsdn_t *tsdn, pac_t *pac, decay_t *decay, pac_decay_stats_t *decay_stats, ecache_t *ecache, bool fully_decay, edata_list_inactive_t *decay_extents) { bool err; size_t nmadvise = 0; size_t nunmapped = 0; size_t npurged = 0; ehooks_t *ehooks = pac_ehooks_get(pac); bool try_muzzy = !fully_decay && pac_decay_ms_get(pac, extent_state_muzzy) != 0; bool purge_to_retained = !try_muzzy || ecache->state == extent_state_muzzy; /* * Attempt process_madvise only if 1) enabled, 2) purging to retained, * and 3) not using custom hooks. */ bool try_process_madvise = (opt_process_madvise_max_batch > 0) && purge_to_retained && ehooks_dalloc_will_fail(ehooks); bool already_purged; if (try_process_madvise) { /* * If anything unexpected happened during process_madvise * (e.g. not supporting MADV_DONTNEED, or partial success for * some reason), we will consider nothing is purged and fallback * to the regular madvise. */ already_purged = !decay_with_process_madvise(decay_extents); } else { already_purged = false; } for (edata_t *edata = edata_list_inactive_first(decay_extents); edata != NULL; edata = edata_list_inactive_first(decay_extents)) { edata_list_inactive_remove(decay_extents, edata); size_t size = edata_size_get(edata); size_t npages = size >> LG_PAGE; nmadvise++; npurged += npages; switch (ecache->state) { case extent_state_dirty: if (try_muzzy) { err = extent_purge_lazy_wrapper( tsdn, ehooks, edata, /* offset */ 0, size); if (!err) { ecache_dalloc(tsdn, pac, ehooks, &pac->ecache_muzzy, edata); break; } } JEMALLOC_FALLTHROUGH; case extent_state_muzzy: if (already_purged) { extent_dalloc_wrapper_purged( tsdn, pac, ehooks, edata); } else { extent_dalloc_wrapper(tsdn, pac, ehooks, edata); } nunmapped += npages; break; case extent_state_active: case extent_state_retained: case extent_state_pinned: case extent_state_transition: case extent_state_merging: default: not_reached(); } } if (config_stats) { LOCKEDINT_MTX_LOCK(tsdn, *pac->stats_mtx); locked_inc_u64(tsdn, LOCKEDINT_MTX(*pac->stats_mtx), &decay_stats->npurge, 1); locked_inc_u64(tsdn, LOCKEDINT_MTX(*pac->stats_mtx), &decay_stats->nmadvise, nmadvise); locked_inc_u64(tsdn, LOCKEDINT_MTX(*pac->stats_mtx), &decay_stats->purged, npurged); LOCKEDINT_MTX_UNLOCK(tsdn, *pac->stats_mtx); atomic_fetch_sub_zu(&pac->stats->pac_mapped, nunmapped << LG_PAGE, ATOMIC_RELAXED); } return npurged; } /* * npages_limit: Decay at most npages_decay_max pages without violating the * invariant: (ecache_npages_get(ecache) >= npages_limit). We need an upper * bound on number of pages in order to prevent unbounded growth (namely in * stashed), otherwise unbounded new pages could be added to extents during the * current decay run, so that the purging thread never finishes. */ static void pac_decay_to_limit(tsdn_t *tsdn, pac_t *pac, decay_t *decay, pac_decay_stats_t *decay_stats, ecache_t *ecache, bool fully_decay, size_t npages_limit, size_t npages_decay_max) { witness_assert_depth_to_rank( tsdn_witness_tsdp_get(tsdn), WITNESS_RANK_CORE, 1); if (decay->purging || npages_decay_max == 0) { return; } decay->purging = true; malloc_mutex_unlock(tsdn, &decay->mtx); edata_list_inactive_t decay_extents; edata_list_inactive_init(&decay_extents); size_t npurge = pac_stash_decayed( tsdn, pac, ecache, npages_limit, npages_decay_max, &decay_extents); if (npurge != 0) { size_t npurged = pac_decay_stashed(tsdn, pac, decay, decay_stats, ecache, fully_decay, &decay_extents); assert(npurged == npurge); } malloc_mutex_lock(tsdn, &decay->mtx); decay->purging = false; } void pac_decay_all(tsdn_t *tsdn, pac_t *pac, decay_t *decay, pac_decay_stats_t *decay_stats, ecache_t *ecache, bool fully_decay) { malloc_mutex_assert_owner(tsdn, &decay->mtx); pac_decay_to_limit(tsdn, pac, decay, decay_stats, ecache, fully_decay, /* npages_limit */ 0, ecache_npages_get(ecache)); } static void pac_decay_try_purge(tsdn_t *tsdn, pac_t *pac, decay_t *decay, pac_decay_stats_t *decay_stats, ecache_t *ecache, size_t current_npages, size_t npages_limit) { if (current_npages > npages_limit) { pac_decay_to_limit(tsdn, pac, decay, decay_stats, ecache, /* fully_decay */ false, npages_limit, current_npages - npages_limit); } } bool pac_maybe_decay_purge(tsdn_t *tsdn, pac_t *pac, decay_t *decay, pac_decay_stats_t *decay_stats, ecache_t *ecache, pac_purge_eagerness_t eagerness) { malloc_mutex_assert_owner(tsdn, &decay->mtx); /* Purge all or nothing if the option is disabled. */ ssize_t decay_ms = decay_ms_read(decay); if (decay_ms <= 0) { if (decay_ms == 0) { pac_decay_to_limit(tsdn, pac, decay, decay_stats, ecache, /* fully_decay */ false, /* npages_limit */ 0, ecache_npages_get(ecache)); } return false; } /* * If the deadline has been reached, advance to the current epoch and * purge to the new limit if necessary. Note that dirty pages created * during the current epoch are not subject to purge until a future * epoch, so as a result purging only happens during epoch advances, or * being triggered by background threads (scheduled event). */ nstime_t time; nstime_init_update(&time); size_t npages_current = ecache_npages_get(ecache); bool epoch_advanced = decay_maybe_advance_epoch( decay, &time, npages_current); if (eagerness == PAC_PURGE_ALWAYS || (epoch_advanced && eagerness == PAC_PURGE_ON_EPOCH_ADVANCE)) { size_t npages_limit = decay_npages_limit_get(decay); pac_decay_try_purge(tsdn, pac, decay, decay_stats, ecache, npages_current, npages_limit); } return epoch_advanced; } bool pac_decay_ms_set(tsdn_t *tsdn, pac_t *pac, extent_state_t state, ssize_t decay_ms, pac_purge_eagerness_t eagerness) { decay_t *decay; pac_decay_stats_t *decay_stats; ecache_t *ecache; pac_decay_data_get(pac, state, &decay, &decay_stats, &ecache); if (!decay_ms_valid(decay_ms)) { return true; } bool update_pac_sec = (state == extent_state_dirty) && sec_is_used(&pac->sec); if (update_pac_sec && decay_ms == 0) { atomic_store_zu(&pac->sec_max_alloc, 0, ATOMIC_RELAXED); pac_sec_flush(tsdn, pac); } malloc_mutex_lock(tsdn, &decay->mtx); /* * Restart decay backlog from scratch, which may cause many dirty pages * to be immediately purged. It would conceptually be possible to map * the old backlog onto the new backlog, but there is no justification * for such complexity since decay_ms changes are intended to be * infrequent, either between the {-1, 0, >0} states, or a one-time * arbitrary change during initial arena configuration. */ nstime_t cur_time; nstime_init_update(&cur_time); decay_reinit(decay, &cur_time, decay_ms); pac_maybe_decay_purge(tsdn, pac, decay, decay_stats, ecache, eagerness); malloc_mutex_unlock(tsdn, &decay->mtx); if (update_pac_sec && decay_ms != 0) { atomic_store_zu(&pac->sec_max_alloc, pac->sec.opts.max_alloc, ATOMIC_RELAXED); } return false; } ssize_t pac_decay_ms_get(pac_t *pac, extent_state_t state) { decay_t *decay; pac_decay_stats_t *decay_stats; ecache_t *ecache; pac_decay_data_get(pac, state, &decay, &decay_stats, &ecache); return decay_ms_read(decay); } void pac_destroy(tsdn_t *tsdn, pac_t *pac) { assert(ecache_npages_get(&pac->ecache_dirty) == 0); assert(ecache_npages_get(&pac->ecache_muzzy) == 0); /* * Iterate over the retained extents and destroy them. This gives the * extent allocator underlying the extent hooks an opportunity to unmap * all retained memory without having to keep its own metadata * structures. In practice, virtual memory for dss-allocated extents is * leaked here, so best practice is to avoid dss for arenas to be * destroyed, or provide custom extent hooks that track retained * dss-based extents for later reuse. */ ehooks_t *ehooks = pac_ehooks_get(pac); edata_t *edata; if (atomic_load_b(&pac->has_pinned, ATOMIC_RELAXED)) { /* * Reroute pinned extents through ecache_retained: clearing the * pinned bit lets retained's eager coalesce merge fragments * back to their original OS-allocation bases, so the destroy * hook can release whole reservations (required on platforms * like Windows where VirtualFree only accepts the original * VirtualAlloc base). Subtract from pac_mapped along the way * because retained is excluded from stats.mapped. */ edata_list_inactive_t pinned_list; edata_list_inactive_init(&pinned_list); malloc_mutex_lock(tsdn, &pac->ecache_pinned.mtx); assert(eset_npages_get(&pac->ecache_pinned.guarded_eset) == 0); size_t pinned_bytes = eset_npages_get(&pac->ecache_pinned.eset) << LG_PAGE; while (eset_npages_get(&pac->ecache_pinned.eset) > 0) { edata = eset_fit(&pac->ecache_pinned.eset, PAGE, PAGE, /* exact_only */ false, SC_PTR_BITS, /* prefer_small */ false); assert(edata != NULL); assert(edata_pinned_get(edata)); eset_remove(&pac->ecache_pinned.eset, edata); emap_update_edata_state(tsdn, pac->emap, edata, extent_state_active); edata_pinned_set(edata, false); edata_list_inactive_append(&pinned_list, edata); } malloc_mutex_unlock(tsdn, &pac->ecache_pinned.mtx); if (config_stats && pinned_bytes > 0) { atomic_fetch_sub_zu(&pac->stats->pac_mapped, pinned_bytes, ATOMIC_RELAXED); } while ((edata = edata_list_inactive_first(&pinned_list)) != NULL) { edata_list_inactive_remove(&pinned_list, edata); extent_record(tsdn, pac, ehooks, &pac->ecache_retained, edata); } } assert(ecache_npages_get(&pac->ecache_pinned) == 0); while ( (edata = ecache_evict(tsdn, pac, ehooks, &pac->ecache_retained, 0)) != NULL) { extent_destroy_wrapper(tsdn, pac, ehooks, edata); } } void pac_sec_flush(tsdn_t *tsdn, pac_t *pac) { ehooks_t *ehooks = pac_ehooks_get(pac); edata_list_active_t to_flush; edata_list_active_init(&to_flush); sec_flush(tsdn, &pac->sec, &to_flush); edata_t *edata; while ((edata = edata_list_active_first(&to_flush)) != NULL) { edata_list_active_remove(&to_flush, edata); pac_ecache_dalloc(tsdn, pac, ehooks, edata); } }