project-base/server-skynet-source-3rd-jemalloc
2
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add a fill/flush microbenchmark.

Browse Source
This commit is contained in:
David Goldblatt 2020-05-11 13:05:36 -07:00 committed by David Goldblatt
parent 33372cbd40
commit 97b7a9cf77
2 changed files with 78 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
Makefile.in
View File

@ -289,6 +289,7 @@ CPP_SRCS :=
TESTS_INTEGRATION_CPP := TESTS_INTEGRATION_CPP :=
endif endif
TESTS_STRESS := $(srcroot)test/stress/microbench.c \ TESTS_STRESS := $(srcroot)test/stress/microbench.c \
$(srcroot)test/stress/fill_flush.c \
$(srcroot)test/stress/large_microbench.c \ $(srcroot)test/stress/large_microbench.c \
$(srcroot)test/stress/hookbench.c $(srcroot)test/stress/hookbench.c

77
test/stress/fill_flush.c Normal file
View File

@ -0,0 +1,77 @@
#include "test/jemalloc_test.h"
#include "test/bench.h"
#define SMALL_ALLOC_SIZE 128
#define LARGE_ALLOC_SIZE SC_LARGE_MINCLASS
#define NALLOCS 1000
/*
* We make this volatile so the 1-at-a-time variants can't leave the allocation
* in a register, just to try to get the cache behavior closer.
*/
void *volatile allocs[NALLOCS];
static void
array_alloc_dalloc_small(void) {
for (int i = 0; i < NALLOCS; i++) {
void *p = mallocx(SMALL_ALLOC_SIZE, 0);
assert_ptr_not_null(p, "mallocx shouldn't fail");
allocs[i] = p;
}
for (int i = 0; i < NALLOCS; i++) {
sdallocx(allocs[i], SMALL_ALLOC_SIZE, 0);
}
}
static void
item_alloc_dalloc_small(void) {
for (int i = 0; i < NALLOCS; i++) {
void *p = mallocx(SMALL_ALLOC_SIZE, 0);
assert_ptr_not_null(p, "mallocx shouldn't fail");
allocs[i] = p;
sdallocx(allocs[i], SMALL_ALLOC_SIZE, 0);
}
}
TEST_BEGIN(test_array_vs_item_small) {
compare_funcs(1 * 1000, 10 * 1000,
"array of small allocations", array_alloc_dalloc_small,
"small item allocation", item_alloc_dalloc_small);
}
TEST_END
static void
array_alloc_dalloc_large(void) {
for (int i = 0; i < NALLOCS; i++) {
void *p = mallocx(LARGE_ALLOC_SIZE, 0);
assert_ptr_not_null(p, "mallocx shouldn't fail");
allocs[i] = p;
}
for (int i = 0; i < NALLOCS; i++) {
sdallocx(allocs[i], LARGE_ALLOC_SIZE, 0);
}
}
static void
item_alloc_dalloc_large(void) {
for (int i = 0; i < NALLOCS; i++) {
void *p = mallocx(LARGE_ALLOC_SIZE, 0);
assert_ptr_not_null(p, "mallocx shouldn't fail");
allocs[i] = p;
sdallocx(allocs[i], LARGE_ALLOC_SIZE, 0);
}
}
TEST_BEGIN(test_array_vs_item_large) {
compare_funcs(100, 1000,
"array of large allocations", array_alloc_dalloc_large,
"large item allocation", item_alloc_dalloc_large);
}
TEST_END
int main(void) {
return test_no_reentrancy(
test_array_vs_item_small,
test_array_vs_item_large);
}