256 lines
7.6 KiB
C
256 lines
7.6 KiB
C
|
#define JEMALLOC_THREAD_EVENT_C_
|
||
|
#include "jemalloc/internal/jemalloc_preamble.h"
|
||
|
#include "jemalloc/internal/jemalloc_internal_includes.h"
|
||
|
|
||
|
#include "jemalloc/internal/thread_event.h"
|
||
|
|
||
|
/*
|
||
|
* There's no lock for thread_event_active because write is only done in
|
||
|
* malloc_init(), where init_lock there serves as the guard, and ever since
|
||
|
* then thread_event_active becomes read only.
|
||
|
*/
|
||
|
static bool thread_event_active = false;
|
||
|
|
||
|
/* Event handler function signatures. */
|
||
|
#define E(event, condition) \
|
||
|
static void thread_##event##_event_handler(tsd_t *tsd);
|
||
|
|
||
|
ITERATE_OVER_ALL_EVENTS
|
||
|
#undef E
|
||
|
|
||
|
static uint64_t
|
||
|
thread_allocated_next_event_compute(tsd_t *tsd) {
|
||
|
uint64_t wait = THREAD_EVENT_MAX_START_WAIT;
|
||
|
bool no_event_on = true;
|
||
|
|
||
|
#define E(event, condition) \
|
||
|
if (condition) { \
|
||
|
no_event_on = false; \
|
||
|
uint64_t event_wait = \
|
||
|
event##_event_wait_get(tsd); \
|
||
|
assert(event_wait <= THREAD_EVENT_MAX_START_WAIT); \
|
||
|
if (event_wait > 0U && event_wait < wait) { \
|
||
|
wait = event_wait; \
|
||
|
} \
|
||
|
}
|
||
|
|
||
|
ITERATE_OVER_ALL_EVENTS
|
||
|
#undef E
|
||
|
|
||
|
assert(no_event_on == !thread_event_active);
|
||
|
assert(wait <= THREAD_EVENT_MAX_START_WAIT);
|
||
|
return wait;
|
||
|
}
|
||
|
|
||
|
void
|
||
|
thread_event_assert_invariants_debug(tsd_t *tsd) {
|
||
|
uint64_t thread_allocated = thread_allocated_get(tsd);
|
||
|
uint64_t last_event = thread_allocated_last_event_get(tsd);
|
||
|
uint64_t next_event = thread_allocated_next_event_get(tsd);
|
||
|
uint64_t next_event_fast = thread_allocated_next_event_fast_get(tsd);
|
||
|
|
||
|
assert(last_event != next_event);
|
||
|
if (next_event <= THREAD_ALLOCATED_NEXT_EVENT_FAST_MAX) {
|
||
|
assert(next_event_fast == next_event);
|
||
|
} else {
|
||
|
assert(next_event_fast == 0U);
|
||
|
}
|
||
|
|
||
|
/* The subtraction is intentionally susceptible to underflow. */
|
||
|
uint64_t interval = next_event - last_event;
|
||
|
|
||
|
/* The subtraction is intentionally susceptible to underflow. */
|
||
|
assert(thread_allocated - last_event < interval);
|
||
|
|
||
|
uint64_t min_wait = thread_allocated_next_event_compute(tsd);
|
||
|
|
||
|
/*
|
||
|
* next_event should have been pushed up only except when no event is
|
||
|
* on and the TSD is just initialized. The last_event == 0U guard
|
||
|
* below is stronger than needed, but having an exactly accurate guard
|
||
|
* is more complicated to implement.
|
||
|
*/
|
||
|
assert((!thread_event_active && last_event == 0U) ||
|
||
|
interval == min_wait ||
|
||
|
(interval < min_wait && interval == THREAD_EVENT_MAX_INTERVAL));
|
||
|
}
|
||
|
|
||
|
static void
|
||
|
thread_event_adjust_thresholds_helper(tsd_t *tsd, uint64_t wait) {
|
||
|
assert(wait <= THREAD_EVENT_MAX_START_WAIT);
|
||
|
uint64_t next_event = thread_allocated_last_event_get(tsd) + (wait <=
|
||
|
THREAD_EVENT_MAX_INTERVAL ? wait : THREAD_EVENT_MAX_INTERVAL);
|
||
|
thread_allocated_next_event_set(tsd, next_event);
|
||
|
uint64_t next_event_fast = (next_event <=
|
||
|
THREAD_ALLOCATED_NEXT_EVENT_FAST_MAX) ? next_event : 0U;
|
||
|
thread_allocated_next_event_fast_set(tsd, next_event_fast);
|
||
|
}
|
||
|
|
||
|
static void
|
||
|
thread_prof_sample_event_handler(tsd_t *tsd) {
|
||
|
assert(config_prof && opt_prof);
|
||
|
assert(prof_sample_event_wait_get(tsd) == 0U);
|
||
|
if (!prof_active_get_unlocked()) {
|
||
|
/*
|
||
|
* If prof_active is off, we reset prof_sample_event_wait to be
|
||
|
* the sample interval when it drops to 0, so that there won't
|
||
|
* be excessive routings to the slow path, and that when
|
||
|
* prof_active is turned on later, the counting for sampling
|
||
|
* can immediately resume as normal.
|
||
|
*/
|
||
|
thread_prof_sample_event_update(tsd,
|
||
|
(uint64_t)(1 << lg_prof_sample));
|
||
|
}
|
||
|
}
|
||
|
|
||
|
static uint64_t
|
||
|
thread_event_trigger_batch_update(tsd_t *tsd, uint64_t accumbytes,
|
||
|
bool allow_event_trigger) {
|
||
|
uint64_t wait = THREAD_EVENT_MAX_START_WAIT;
|
||
|
|
||
|
#define E(event, condition) \
|
||
|
if (condition) { \
|
||
|
uint64_t event_wait = event##_event_wait_get(tsd); \
|
||
|
assert(event_wait <= THREAD_EVENT_MAX_START_WAIT); \
|
||
|
if (event_wait > accumbytes) { \
|
||
|
event_wait -= accumbytes; \
|
||
|
} else { \
|
||
|
event_wait = 0U; \
|
||
|
if (!allow_event_trigger) { \
|
||
|
event_wait = \
|
||
|
THREAD_EVENT_MIN_START_WAIT; \
|
||
|
} \
|
||
|
} \
|
||
|
assert(event_wait <= THREAD_EVENT_MAX_START_WAIT); \
|
||
|
event##_event_wait_set(tsd, event_wait); \
|
||
|
/* \
|
||
|
* If there is a single event, then the remaining wait \
|
||
|
* time may become zero, and we rely on either the \
|
||
|
* event handler or a thread_event_update() call later \
|
||
|
* to properly set next_event; if there are multiple \
|
||
|
* events, then here we can get the minimum remaining \
|
||
|
* wait time to the next already set event. \
|
||
|
*/ \
|
||
|
if (event_wait > 0U && event_wait < wait) { \
|
||
|
wait = event_wait; \
|
||
|
} \
|
||
|
}
|
||
|
|
||
|
ITERATE_OVER_ALL_EVENTS
|
||
|
#undef E
|
||
|
|
||
|
assert(wait <= THREAD_EVENT_MAX_START_WAIT);
|
||
|
return wait;
|
||
|
}
|
||
|
|
||
|
void
|
||
|
thread_event_trigger(tsd_t *tsd, bool delay_event) {
|
||
|
/* usize has already been added to thread_allocated. */
|
||
|
uint64_t thread_allocated_after = thread_allocated_get(tsd);
|
||
|
|
||
|
/* The subtraction is intentionally susceptible to underflow. */
|
||
|
uint64_t accumbytes = thread_allocated_after -
|
||
|
thread_allocated_last_event_get(tsd);
|
||
|
|
||
|
/* Make sure that accumbytes cannot overflow uint64_t. */
|
||
|
cassert(THREAD_EVENT_MAX_INTERVAL <=
|
||
|
UINT64_MAX - SC_LARGE_MAXCLASS + 1);
|
||
|
|
||
|
thread_allocated_last_event_set(tsd, thread_allocated_after);
|
||
|
bool allow_event_trigger = !delay_event && tsd_nominal(tsd) &&
|
||
|
tsd_reentrancy_level_get(tsd) == 0;
|
||
|
uint64_t wait = thread_event_trigger_batch_update(tsd, accumbytes,
|
||
|
allow_event_trigger);
|
||
|
thread_event_adjust_thresholds_helper(tsd, wait);
|
||
|
|
||
|
thread_event_assert_invariants(tsd);
|
||
|
|
||
|
#define E(event, condition) \
|
||
|
if (condition && event##_event_wait_get(tsd) == 0U) { \
|
||
|
assert(allow_event_trigger); \
|
||
|
thread_##event##_event_handler(tsd); \
|
||
|
}
|
||
|
|
||
|
ITERATE_OVER_ALL_EVENTS
|
||
|
#undef E
|
||
|
|
||
|
thread_event_assert_invariants(tsd);
|
||
|
}
|
||
|
|
||
|
void
|
||
|
thread_event_rollback(tsd_t *tsd, size_t diff) {
|
||
|
thread_event_assert_invariants(tsd);
|
||
|
|
||
|
if (diff == 0U) {
|
||
|
return;
|
||
|
}
|
||
|
|
||
|
uint64_t thread_allocated = thread_allocated_get(tsd);
|
||
|
/* The subtraction is intentionally susceptible to underflow. */
|
||
|
uint64_t thread_allocated_rollback = thread_allocated - diff;
|
||
|
thread_allocated_set(tsd, thread_allocated_rollback);
|
||
|
|
||
|
uint64_t last_event = thread_allocated_last_event_get(tsd);
|
||
|
/* Both subtractions are intentionally susceptible to underflow. */
|
||
|
if (thread_allocated_rollback - last_event <=
|
||
|
thread_allocated - last_event) {
|
||
|
thread_event_assert_invariants(tsd);
|
||
|
return;
|
||
|
}
|
||
|
|
||
|
thread_allocated_last_event_set(tsd, thread_allocated_rollback);
|
||
|
|
||
|
/* The subtraction is intentionally susceptible to underflow. */
|
||
|
uint64_t wait_diff = last_event - thread_allocated_rollback;
|
||
|
assert(wait_diff <= diff);
|
||
|
|
||
|
#define E(event, condition) \
|
||
|
if (condition) { \
|
||
|
uint64_t event_wait = event##_event_wait_get(tsd); \
|
||
|
assert(event_wait <= THREAD_EVENT_MAX_START_WAIT); \
|
||
|
if (event_wait > 0U) { \
|
||
|
if (wait_diff > \
|
||
|
THREAD_EVENT_MAX_START_WAIT - event_wait) { \
|
||
|
event_wait = \
|
||
|
THREAD_EVENT_MAX_START_WAIT; \
|
||
|
} else { \
|
||
|
event_wait += wait_diff; \
|
||
|
} \
|
||
|
assert(event_wait <= \
|
||
|
THREAD_EVENT_MAX_START_WAIT); \
|
||
|
event##_event_wait_set(tsd, event_wait); \
|
||
|
} \
|
||
|
}
|
||
|
|
||
|
ITERATE_OVER_ALL_EVENTS
|
||
|
#undef E
|
||
|
|
||
|
thread_event_update(tsd);
|
||
|
}
|
||
|
|
||
|
void
|
||
|
thread_event_update(tsd_t *tsd) {
|
||
|
uint64_t wait = thread_allocated_next_event_compute(tsd);
|
||
|
thread_event_adjust_thresholds_helper(tsd, wait);
|
||
|
|
||
|
uint64_t last_event = thread_allocated_last_event_get(tsd);
|
||
|
|
||
|
/* Both subtractions are intentionally susceptible to underflow. */
|
||
|
if (thread_allocated_get(tsd) - last_event >=
|
||
|
thread_allocated_next_event_get(tsd) - last_event) {
|
||
|
thread_event_trigger(tsd, true);
|
||
|
} else {
|
||
|
thread_event_assert_invariants(tsd);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
void thread_event_boot() {
|
||
|
#define E(event, condition) \
|
||
|
if (condition) { \
|
||
|
thread_event_active = true; \
|
||
|
}
|
||
|
|
||
|
ITERATE_OVER_ALL_EVENTS
|
||
|
#undef E
|
||
|
}
|