void* je_memalign_round_up_boundary(size_t boundary, size_t size) { // The man page for memalign says it fails if boundary is not a power of 2, // but this is not true. Both glibc and dlmalloc round up to the next power // of 2, so we'll do the same.
boundary = stdc_bit_ceil(boundary);
// The aligned_alloc function requires that size is a multiple of alignment. // jemalloc doesn't enforce this, so add enforcement here. void* je_aligned_alloc_wrapper(size_t alignment, size_t size) { if ((size % alignment) != 0) {
errno = EINVAL; return nullptr;
} return je_aligned_alloc(alignment, size);
}
int je_mallopt(int param, int value) { // The only parameter we currently understand is M_DECAY_TIME. if (param == M_DECAY_TIME) { // Only support setting the value to -1 or 0 or 1.
ssize_t decay_time_ms; if (value < 0) { // Given that SSIZE_MAX may not be supported in jemalloc, set this to a // sufficiently large number that essentially disables the decay timer.
decay_time_ms = 10000000;
} elseif (value) {
decay_time_ms = 1000;
} else {
decay_time_ms = 0;
} // First get the total number of arenas. unsigned narenas;
size_t sz = sizeof(unsigned); if (je_mallctl("arenas.narenas", &narenas, &sz, nullptr, 0) != 0) { return0;
}
// Set the decay time for any arenas that will be created in the future. if (je_mallctl("arenas.dirty_decay_ms", nullptr, nullptr, &decay_time_ms, sizeof(decay_time_ms)) != 0) { return0;
} if (je_mallctl("arenas.muzzy_decay_ms", nullptr, nullptr, &decay_time_ms, sizeof(decay_time_ms)) != 0) { return0;
}
// Change the decay on the already existing arenas. char buffer[100]; for (unsigned i = 0; i < narenas; i++) {
snprintf(buffer, sizeof(buffer), "arena.%d.dirty_decay_ms", i); if (je_mallctl(buffer, nullptr, nullptr, &decay_time_ms, sizeof(decay_time_ms)) != 0) { break;
}
snprintf(buffer, sizeof(buffer), "arena.%d.muzzy_decay_ms", i); if (je_mallctl(buffer, nullptr, nullptr, &decay_time_ms, sizeof(decay_time_ms)) != 0) { break;
}
} return1;
} elseif (param == M_PURGE || param == M_PURGE_ALL || param == M_PURGE_FAST) { // Only clear the current thread cache since there is no easy way to // clear the caches of other threads. // This must be done first so that cleared allocations get purged // in the next calls. // Ignore the return call since this will fail if the tcache is disabled.
je_mallctl("thread.tcache.flush", nullptr, nullptr, nullptr, 0);
unsigned narenas;
size_t sz = sizeof(unsigned); if (je_mallctl("arenas.narenas", &narenas, &sz, nullptr, 0) != 0) { return0;
} char buffer[100];
snprintf(buffer, sizeof(buffer), "arena.%u.purge", narenas); if (je_mallctl(buffer, nullptr, nullptr, nullptr, 0) != 0) { return0;
} return1;
} elseif (param == M_LOG_STATS) {
size_t total_bytes = 0; for (size_t i = 0; i < je_mallinfo_narenas(); i++) { struct mallinfo mi = je_mallinfo_arena_info(i);
size_t arena_bytes = mi.fsmblks + mi.ordblks + mi.uordblks;
async_safe_format_log(ANDROID_LOG_INFO, "jemalloc", "Arena %zu: bin bytes=%zu large bytes=%zu total bytes=%zu", i,
mi.fsmblks, mi.ordblks, arena_bytes);
int je_malloc_info(int options, FILE* fp) { if (options != 0) {
errno = EINVAL; return -1;
}
fflush(fp); int fd = fileno(fp);
MallocXmlElem root(fd, "malloc", "version=\"jemalloc-1\"");
// Dump all of the large allocations in the arenas. for (size_t i = 0; i < je_mallinfo_narenas(); i++) { struct mallinfo mi = je_mallinfo_arena_info(i); if (mi.hblkhd != 0) {
MallocXmlElem arena_elem(fd, "heap", "nr=\"%d\"", i);
{
MallocXmlElem(fd, "allocated-large").Contents("%zu", mi.ordblks);
MallocXmlElem(fd, "allocated-huge").Contents("%zu", mi.uordblks);
MallocXmlElem(fd, "allocated-bins").Contents("%zu", mi.fsmblks);
size_t total = 0; for (size_t j = 0; j < je_mallinfo_nbins(); j++) { struct mallinfo mi = je_mallinfo_bin_info(i, j); if (mi.ordblks != 0) {
MallocXmlElem bin_elem(fd, "bin", "nr=\"%d\"", j);
MallocXmlElem(fd, "allocated").Contents("%zu", mi.ordblks);
MallocXmlElem(fd, "nmalloc").Contents("%zu", mi.uordblks);
MallocXmlElem(fd, "ndalloc").Contents("%zu", mi.fordblks);
total += mi.ordblks;
}
}
MallocXmlElem(fd, "bins-total").Contents("%zu", total);
}
}
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.