mirror of
https://github.com/microsoft/mimalloc.git
synced 2025-05-05 06:59:32 +03:00
commit
af5e0dff9e
6 changed files with 420 additions and 63 deletions
|
@ -373,21 +373,17 @@ endif()
|
||||||
# -----------------------------------------------------------------------------
|
# -----------------------------------------------------------------------------
|
||||||
|
|
||||||
if (MI_BUILD_TESTS)
|
if (MI_BUILD_TESTS)
|
||||||
add_executable(mimalloc-test-api test/test-api.c)
|
|
||||||
target_compile_definitions(mimalloc-test-api PRIVATE ${mi_defines})
|
|
||||||
target_compile_options(mimalloc-test-api PRIVATE ${mi_cflags})
|
|
||||||
target_include_directories(mimalloc-test-api PRIVATE include)
|
|
||||||
target_link_libraries(mimalloc-test-api PRIVATE mimalloc ${mi_libraries})
|
|
||||||
|
|
||||||
add_executable(mimalloc-test-stress test/test-stress.c)
|
|
||||||
target_compile_definitions(mimalloc-test-stress PRIVATE ${mi_defines})
|
|
||||||
target_compile_options(mimalloc-test-stress PRIVATE ${mi_cflags})
|
|
||||||
target_include_directories(mimalloc-test-stress PRIVATE include)
|
|
||||||
target_link_libraries(mimalloc-test-stress PRIVATE mimalloc ${mi_libraries})
|
|
||||||
|
|
||||||
enable_testing()
|
enable_testing()
|
||||||
add_test(test_api, mimalloc-test-api)
|
|
||||||
add_test(test_stress, mimalloc-test-stress)
|
foreach(TEST_NAME api api-fill stress)
|
||||||
|
add_executable(mimalloc-test-${TEST_NAME} test/test-${TEST_NAME}.c)
|
||||||
|
target_compile_definitions(mimalloc-test-${TEST_NAME} PRIVATE ${mi_defines})
|
||||||
|
target_compile_options(mimalloc-test-${TEST_NAME} PRIVATE ${mi_cflags})
|
||||||
|
target_include_directories(mimalloc-test-${TEST_NAME} PRIVATE include)
|
||||||
|
target_link_libraries(mimalloc-test-${TEST_NAME} PRIVATE mimalloc ${mi_libraries})
|
||||||
|
|
||||||
|
add_test(NAME test-${TEST_NAME} COMMAND mimalloc-test-${TEST_NAME})
|
||||||
|
endforeach()
|
||||||
endif()
|
endif()
|
||||||
|
|
||||||
# -----------------------------------------------------------------------------
|
# -----------------------------------------------------------------------------
|
||||||
|
|
|
@ -43,7 +43,7 @@ jobs:
|
||||||
solution: $(BuildType)/libmimalloc.sln
|
solution: $(BuildType)/libmimalloc.sln
|
||||||
configuration: '$(MSBuildConfiguration)'
|
configuration: '$(MSBuildConfiguration)'
|
||||||
msbuildArguments: -m
|
msbuildArguments: -m
|
||||||
- script: ctest --verbose --timeout 120
|
- script: ctest --verbose --timeout 120 -C $(MSBuildConfiguration)
|
||||||
workingDirectory: $(BuildType)
|
workingDirectory: $(BuildType)
|
||||||
displayName: CTest
|
displayName: CTest
|
||||||
#- script: $(BuildType)\$(BuildType)\mimalloc-test-stress
|
#- script: $(BuildType)\$(BuildType)\mimalloc-test-stress
|
||||||
|
|
41
src/init.c
41
src/init.c
|
@ -493,6 +493,14 @@ void mi_process_init(void) mi_attr_noexcept {
|
||||||
#endif
|
#endif
|
||||||
_mi_verbose_message("secure level: %d\n", MI_SECURE);
|
_mi_verbose_message("secure level: %d\n", MI_SECURE);
|
||||||
mi_thread_init();
|
mi_thread_init();
|
||||||
|
#if defined(_WIN32) && !defined(MI_SHARED_LIB)
|
||||||
|
/* When building as a static lib the FLS cleanup happens to early for the main thread.
|
||||||
|
* To avoid that set the FLS value for the main thread to NULL; the eventual
|
||||||
|
* mi_fls_done() execution won't call _mi_thread_done().
|
||||||
|
* The latter function is later called explicitly from mi_process_done().
|
||||||
|
* See GitHub issue #508 for more background and explanation. */
|
||||||
|
FlsSetValue(mi_fls_key, NULL);
|
||||||
|
#endif
|
||||||
mi_stats_reset(); // only call stat reset *after* thread init (or the heap tld == NULL)
|
mi_stats_reset(); // only call stat reset *after* thread init (or the heap tld == NULL)
|
||||||
|
|
||||||
if (mi_option_is_enabled(mi_option_reserve_huge_os_pages)) {
|
if (mi_option_is_enabled(mi_option_reserve_huge_os_pages)) {
|
||||||
|
@ -522,7 +530,8 @@ static void mi_process_done(void) {
|
||||||
process_done = true;
|
process_done = true;
|
||||||
|
|
||||||
#if defined(_WIN32) && !defined(MI_SHARED_LIB)
|
#if defined(_WIN32) && !defined(MI_SHARED_LIB)
|
||||||
FlsSetValue(mi_fls_key, NULL); // don't call main-thread callback
|
// Explicitly clean up main thread. See comment in mi_process_init() for reason
|
||||||
|
_mi_thread_done(_mi_heap_default);
|
||||||
FlsFree(mi_fls_key); // call thread-done on all threads to prevent dangling callback pointer if statically linked with a DLL; Issue #208
|
FlsFree(mi_fls_key); // call thread-done on all threads to prevent dangling callback pointer if statically linked with a DLL; Issue #208
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
@ -557,20 +566,6 @@ static void mi_process_done(void) {
|
||||||
return TRUE;
|
return TRUE;
|
||||||
}
|
}
|
||||||
|
|
||||||
#elif defined(__cplusplus)
|
|
||||||
// C++: use static initialization to detect process start
|
|
||||||
static bool _mi_process_init(void) {
|
|
||||||
mi_process_load();
|
|
||||||
return (_mi_heap_main.thread_id != 0);
|
|
||||||
}
|
|
||||||
static bool mi_initialized = _mi_process_init();
|
|
||||||
|
|
||||||
#elif defined(__GNUC__) || defined(__clang__)
|
|
||||||
// GCC,Clang: use the constructor attribute
|
|
||||||
static void __attribute__((constructor)) _mi_process_init(void) {
|
|
||||||
mi_process_load();
|
|
||||||
}
|
|
||||||
|
|
||||||
#elif defined(_MSC_VER)
|
#elif defined(_MSC_VER)
|
||||||
// MSVC: use data section magic for static libraries
|
// MSVC: use data section magic for static libraries
|
||||||
// See <https://www.codeguru.com/cpp/misc/misc/applicationcontrol/article.php/c6945/Running-Code-Before-and-After-Main.htm>
|
// See <https://www.codeguru.com/cpp/misc/misc/applicationcontrol/article.php/c6945/Running-Code-Before-and-After-Main.htm>
|
||||||
|
@ -586,9 +581,23 @@ static void mi_process_done(void) {
|
||||||
__pragma(comment(linker, "/include:" "__mi_msvc_initu"))
|
__pragma(comment(linker, "/include:" "__mi_msvc_initu"))
|
||||||
#endif
|
#endif
|
||||||
#pragma data_seg(".CRT$XIU")
|
#pragma data_seg(".CRT$XIU")
|
||||||
_crt_cb _mi_msvc_initu[] = { &_mi_process_init };
|
extern "C" _crt_cb _mi_msvc_initu[] = { &_mi_process_init };
|
||||||
#pragma data_seg()
|
#pragma data_seg()
|
||||||
|
|
||||||
|
#elif defined(__cplusplus)
|
||||||
|
// C++: use static initialization to detect process start
|
||||||
|
static bool _mi_process_init(void) {
|
||||||
|
mi_process_load();
|
||||||
|
return (_mi_heap_main.thread_id != 0);
|
||||||
|
}
|
||||||
|
static bool mi_initialized = _mi_process_init();
|
||||||
|
|
||||||
|
#elif defined(__GNUC__) || defined(__clang__)
|
||||||
|
// GCC,Clang: use the constructor attribute
|
||||||
|
static void __attribute__((constructor)) _mi_process_init(void) {
|
||||||
|
mi_process_load();
|
||||||
|
}
|
||||||
|
|
||||||
#else
|
#else
|
||||||
#pragma message("define a way to call mi_process_load on your platform")
|
#pragma message("define a way to call mi_process_load on your platform")
|
||||||
#endif
|
#endif
|
||||||
|
|
332
test/test-api-fill.c
Normal file
332
test/test-api-fill.c
Normal file
|
@ -0,0 +1,332 @@
|
||||||
|
/* ----------------------------------------------------------------------------
|
||||||
|
Copyright (c) 2018-2020, Microsoft Research, Daan Leijen
|
||||||
|
This is free software; you can redistribute it and/or modify it under the
|
||||||
|
terms of the MIT license. A copy of the license can be found in the file
|
||||||
|
"LICENSE" at the root of this distribution.
|
||||||
|
-----------------------------------------------------------------------------*/
|
||||||
|
#include "mimalloc.h"
|
||||||
|
#include "mimalloc-types.h"
|
||||||
|
|
||||||
|
#include "testhelper.h"
|
||||||
|
|
||||||
|
// ---------------------------------------------------------------------------
|
||||||
|
// Helper functions
|
||||||
|
// ---------------------------------------------------------------------------
|
||||||
|
bool check_zero_init(uint8_t* p, size_t size);
|
||||||
|
#if MI_DEBUG >= 2
|
||||||
|
bool check_debug_fill_uninit(uint8_t* p, size_t size);
|
||||||
|
bool check_debug_fill_freed(uint8_t* p, size_t size);
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// ---------------------------------------------------------------------------
|
||||||
|
// Main testing
|
||||||
|
// ---------------------------------------------------------------------------
|
||||||
|
int main(void) {
|
||||||
|
mi_option_disable(mi_option_verbose);
|
||||||
|
|
||||||
|
// ---------------------------------------------------
|
||||||
|
// Zeroing allocation
|
||||||
|
// ---------------------------------------------------
|
||||||
|
CHECK_BODY("zeroinit-zalloc-small", {
|
||||||
|
size_t zalloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_zalloc(zalloc_size);
|
||||||
|
result = check_zero_init(p, zalloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("zeroinit-zalloc-large", {
|
||||||
|
size_t zalloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_zalloc(zalloc_size);
|
||||||
|
result = check_zero_init(p, zalloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("zeroinit-zalloc_small", {
|
||||||
|
size_t zalloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_zalloc_small(zalloc_size);
|
||||||
|
result = check_zero_init(p, zalloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
CHECK_BODY("zeroinit-calloc-small", {
|
||||||
|
size_t calloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_calloc(calloc_size, 1);
|
||||||
|
result = check_zero_init(p, calloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("zeroinit-calloc-large", {
|
||||||
|
size_t calloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_calloc(calloc_size, 1);
|
||||||
|
result = check_zero_init(p, calloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
CHECK_BODY("zeroinit-rezalloc-small", {
|
||||||
|
size_t zalloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_zalloc(zalloc_size);
|
||||||
|
result = check_zero_init(p, zalloc_size);
|
||||||
|
zalloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_rezalloc(p, zalloc_size);
|
||||||
|
result &= check_zero_init(p, zalloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("zeroinit-rezalloc-large", {
|
||||||
|
size_t zalloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_zalloc(zalloc_size);
|
||||||
|
result = check_zero_init(p, zalloc_size);
|
||||||
|
zalloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_rezalloc(p, zalloc_size);
|
||||||
|
result &= check_zero_init(p, zalloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
CHECK_BODY("zeroinit-recalloc-small", {
|
||||||
|
size_t calloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_calloc(calloc_size, 1);
|
||||||
|
result = check_zero_init(p, calloc_size);
|
||||||
|
calloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_recalloc(p, calloc_size, 1);
|
||||||
|
result &= check_zero_init(p, calloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("zeroinit-recalloc-large", {
|
||||||
|
size_t calloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_calloc(calloc_size, 1);
|
||||||
|
result = check_zero_init(p, calloc_size);
|
||||||
|
calloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_recalloc(p, calloc_size, 1);
|
||||||
|
result &= check_zero_init(p, calloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
// ---------------------------------------------------
|
||||||
|
// Zeroing in aligned API
|
||||||
|
// ---------------------------------------------------
|
||||||
|
CHECK_BODY("zeroinit-zalloc_aligned-small", {
|
||||||
|
size_t zalloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_zalloc_aligned(zalloc_size, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result = check_zero_init(p, zalloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("zeroinit-zalloc_aligned-large", {
|
||||||
|
size_t zalloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_zalloc_aligned(zalloc_size, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result = check_zero_init(p, zalloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
CHECK_BODY("zeroinit-calloc_aligned-small", {
|
||||||
|
size_t calloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_calloc_aligned(calloc_size, 1, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result = check_zero_init(p, calloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("zeroinit-calloc_aligned-large", {
|
||||||
|
size_t calloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_calloc_aligned(calloc_size, 1, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result = check_zero_init(p, calloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
CHECK_BODY("zeroinit-rezalloc_aligned-small", {
|
||||||
|
size_t zalloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_zalloc_aligned(zalloc_size, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result = check_zero_init(p, zalloc_size);
|
||||||
|
zalloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_rezalloc_aligned(p, zalloc_size, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result &= check_zero_init(p, zalloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("zeroinit-rezalloc_aligned-large", {
|
||||||
|
size_t zalloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_zalloc_aligned(zalloc_size, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result = check_zero_init(p, zalloc_size);
|
||||||
|
zalloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_rezalloc_aligned(p, zalloc_size, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result &= check_zero_init(p, zalloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
CHECK_BODY("zeroinit-recalloc_aligned-small", {
|
||||||
|
size_t calloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_calloc_aligned(calloc_size, 1, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result = check_zero_init(p, calloc_size);
|
||||||
|
calloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_recalloc_aligned(p, calloc_size, 1, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result &= check_zero_init(p, calloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("zeroinit-recalloc_aligned-large", {
|
||||||
|
size_t calloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_calloc_aligned(calloc_size, 1, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result = check_zero_init(p, calloc_size);
|
||||||
|
calloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_recalloc_aligned(p, calloc_size, 1, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result &= check_zero_init(p, calloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
#if MI_DEBUG >= 2
|
||||||
|
// ---------------------------------------------------
|
||||||
|
// Debug filling
|
||||||
|
// ---------------------------------------------------
|
||||||
|
CHECK_BODY("uninit-malloc-small", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_malloc(malloc_size);
|
||||||
|
result = check_debug_fill_uninit(p, malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("uninit-malloc-large", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_malloc(malloc_size);
|
||||||
|
result = check_debug_fill_uninit(p, malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
CHECK_BODY("uninit-malloc_small", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_malloc_small(malloc_size);
|
||||||
|
result = check_debug_fill_uninit(p, malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
CHECK_BODY("uninit-realloc-small", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_malloc(malloc_size);
|
||||||
|
result = check_debug_fill_uninit(p, malloc_size);
|
||||||
|
malloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_realloc(p, malloc_size);
|
||||||
|
result &= check_debug_fill_uninit(p, malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("uninit-realloc-large", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_malloc(malloc_size);
|
||||||
|
result = check_debug_fill_uninit(p, malloc_size);
|
||||||
|
malloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_realloc(p, malloc_size);
|
||||||
|
result &= check_debug_fill_uninit(p, malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
CHECK_BODY("uninit-mallocn-small", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_mallocn(malloc_size, 1);
|
||||||
|
result = check_debug_fill_uninit(p, malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("uninit-mallocn-large", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_mallocn(malloc_size, 1);
|
||||||
|
result = check_debug_fill_uninit(p, malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
CHECK_BODY("uninit-reallocn-small", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_mallocn(malloc_size, 1);
|
||||||
|
result = check_debug_fill_uninit(p, malloc_size);
|
||||||
|
malloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_reallocn(p, malloc_size, 1);
|
||||||
|
result &= check_debug_fill_uninit(p, malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("uninit-reallocn-large", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_mallocn(malloc_size, 1);
|
||||||
|
result = check_debug_fill_uninit(p, malloc_size);
|
||||||
|
malloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_reallocn(p, malloc_size, 1);
|
||||||
|
result &= check_debug_fill_uninit(p, malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
CHECK_BODY("uninit-malloc_aligned-small", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_malloc_aligned(malloc_size, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result = check_debug_fill_uninit(p, malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("uninit-malloc_aligned-large", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_malloc_aligned(malloc_size, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result = check_debug_fill_uninit(p, malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
CHECK_BODY("uninit-realloc_aligned-small", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_malloc_aligned(malloc_size, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result = check_debug_fill_uninit(p, malloc_size);
|
||||||
|
malloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_realloc_aligned(p, malloc_size, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result &= check_debug_fill_uninit(p, malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
CHECK_BODY("uninit-realloc_aligned-large", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_malloc_aligned(malloc_size, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result = check_debug_fill_uninit(p, malloc_size);
|
||||||
|
malloc_size *= 3;
|
||||||
|
p = (uint8_t*)mi_realloc_aligned(p, malloc_size, MI_MAX_ALIGN_SIZE * 2);
|
||||||
|
result &= check_debug_fill_uninit(p, malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
});
|
||||||
|
|
||||||
|
|
||||||
|
CHECK_BODY("fill-freed-small", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX / 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_malloc(malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
// First sizeof(void*) bytes will contain housekeeping data, skip these
|
||||||
|
result = check_debug_fill_freed(p + sizeof(void*), malloc_size - sizeof(void*));
|
||||||
|
});
|
||||||
|
CHECK_BODY("fill-freed-large", {
|
||||||
|
size_t malloc_size = MI_SMALL_SIZE_MAX * 2;
|
||||||
|
uint8_t* p = (uint8_t*)mi_malloc(malloc_size);
|
||||||
|
mi_free(p);
|
||||||
|
// First sizeof(void*) bytes will contain housekeeping data, skip these
|
||||||
|
result = check_debug_fill_freed(p + sizeof(void*), malloc_size - sizeof(void*));
|
||||||
|
});
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// ---------------------------------------------------
|
||||||
|
// Done
|
||||||
|
// ---------------------------------------------------[]
|
||||||
|
return print_test_summary();
|
||||||
|
}
|
||||||
|
|
||||||
|
// ---------------------------------------------------------------------------
|
||||||
|
// Helper functions
|
||||||
|
// ---------------------------------------------------------------------------
|
||||||
|
bool check_zero_init(uint8_t* p, size_t size) {
|
||||||
|
if(!p)
|
||||||
|
return false;
|
||||||
|
bool result = true;
|
||||||
|
for (size_t i = 0; i < size; ++i) {
|
||||||
|
result &= p[i] == 0;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
#if MI_DEBUG >= 2
|
||||||
|
bool check_debug_fill_uninit(uint8_t* p, size_t size) {
|
||||||
|
if(!p)
|
||||||
|
return false;
|
||||||
|
|
||||||
|
bool result = true;
|
||||||
|
for (size_t i = 0; i < size; ++i) {
|
||||||
|
result &= p[i] == MI_DEBUG_UNINIT;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool check_debug_fill_freed(uint8_t* p, size_t size) {
|
||||||
|
if(!p)
|
||||||
|
return false;
|
||||||
|
|
||||||
|
bool result = true;
|
||||||
|
for (size_t i = 0; i < size; ++i) {
|
||||||
|
result &= p[i] == MI_DEBUG_FREED;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
#endif
|
|
@ -23,7 +23,6 @@ we therefore test the API over various inputs. Please add more tests :-)
|
||||||
[1] https://github.com/daanx/mimalloc-bench
|
[1] https://github.com/daanx/mimalloc-bench
|
||||||
*/
|
*/
|
||||||
|
|
||||||
#include <stdio.h>
|
|
||||||
#include <assert.h>
|
#include <assert.h>
|
||||||
#include <stdbool.h>
|
#include <stdbool.h>
|
||||||
#include <stdint.h>
|
#include <stdint.h>
|
||||||
|
@ -35,34 +34,9 @@ we therefore test the API over various inputs. Please add more tests :-)
|
||||||
|
|
||||||
#include "mimalloc.h"
|
#include "mimalloc.h"
|
||||||
// #include "mimalloc-internal.h"
|
// #include "mimalloc-internal.h"
|
||||||
|
#include "mimalloc-types.h" // for MI_DEBUG
|
||||||
|
|
||||||
// ---------------------------------------------------------------------------
|
#include "testhelper.h"
|
||||||
// Test macros: CHECK(name,predicate) and CHECK_BODY(name,body)
|
|
||||||
// ---------------------------------------------------------------------------
|
|
||||||
static int ok = 0;
|
|
||||||
static int failed = 0;
|
|
||||||
|
|
||||||
#define CHECK_BODY(name,body) \
|
|
||||||
do { \
|
|
||||||
fprintf(stderr,"test: %s... ", name ); \
|
|
||||||
bool result = true; \
|
|
||||||
do { body } while(false); \
|
|
||||||
if (!(result)) { \
|
|
||||||
failed++; \
|
|
||||||
fprintf(stderr, \
|
|
||||||
"\n FAILED: %s:%d:\n %s\n", \
|
|
||||||
__FILE__, \
|
|
||||||
__LINE__, \
|
|
||||||
#body); \
|
|
||||||
/* exit(1); */ \
|
|
||||||
} \
|
|
||||||
else { \
|
|
||||||
ok++; \
|
|
||||||
fprintf(stderr,"ok.\n"); \
|
|
||||||
} \
|
|
||||||
} while (false)
|
|
||||||
|
|
||||||
#define CHECK(name,expr) CHECK_BODY(name,{ result = (expr); })
|
|
||||||
|
|
||||||
// ---------------------------------------------------------------------------
|
// ---------------------------------------------------------------------------
|
||||||
// Test functions
|
// Test functions
|
||||||
|
@ -219,10 +193,7 @@ int main(void) {
|
||||||
// ---------------------------------------------------
|
// ---------------------------------------------------
|
||||||
// Done
|
// Done
|
||||||
// ---------------------------------------------------[]
|
// ---------------------------------------------------[]
|
||||||
fprintf(stderr,"\n\n---------------------------------------------\n"
|
return print_test_summary();
|
||||||
"succeeded: %i\n"
|
|
||||||
"failed : %i\n\n", ok, failed);
|
|
||||||
return failed;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// ---------------------------------------------------
|
// ---------------------------------------------------
|
||||||
|
|
49
test/testhelper.h
Normal file
49
test/testhelper.h
Normal file
|
@ -0,0 +1,49 @@
|
||||||
|
/* ----------------------------------------------------------------------------
|
||||||
|
Copyright (c) 2018-2020, Microsoft Research, Daan Leijen
|
||||||
|
This is free software; you can redistribute it and/or modify it under the
|
||||||
|
terms of the MIT license. A copy of the license can be found in the file
|
||||||
|
"LICENSE" at the root of this distribution.
|
||||||
|
-----------------------------------------------------------------------------*/
|
||||||
|
#ifndef TESTHELPER_H_
|
||||||
|
#define TESTHELPER_H_
|
||||||
|
|
||||||
|
#include <stdio.h>
|
||||||
|
|
||||||
|
// ---------------------------------------------------------------------------
|
||||||
|
// Test macros: CHECK(name,predicate) and CHECK_BODY(name,body)
|
||||||
|
// ---------------------------------------------------------------------------
|
||||||
|
static int ok = 0;
|
||||||
|
static int failed = 0;
|
||||||
|
|
||||||
|
#define CHECK_BODY(name,body) \
|
||||||
|
do { \
|
||||||
|
fprintf(stderr,"test: %s... ", name ); \
|
||||||
|
bool result = true; \
|
||||||
|
do { body } while(false); \
|
||||||
|
if (!(result)) { \
|
||||||
|
failed++; \
|
||||||
|
fprintf(stderr, \
|
||||||
|
"\n FAILED: %s:%d:\n %s\n", \
|
||||||
|
__FILE__, \
|
||||||
|
__LINE__, \
|
||||||
|
#body); \
|
||||||
|
/* exit(1); */ \
|
||||||
|
} \
|
||||||
|
else { \
|
||||||
|
ok++; \
|
||||||
|
fprintf(stderr,"ok.\n"); \
|
||||||
|
} \
|
||||||
|
} while (false)
|
||||||
|
|
||||||
|
#define CHECK(name,expr) CHECK_BODY(name,{ result = (expr); })
|
||||||
|
|
||||||
|
// Print summary of test. Return value can be directly use as a return value for main().
|
||||||
|
static inline int print_test_summary(void)
|
||||||
|
{
|
||||||
|
fprintf(stderr,"\n\n---------------------------------------------\n"
|
||||||
|
"succeeded: %i\n"
|
||||||
|
"failed : %i\n\n", ok, failed);
|
||||||
|
return failed;
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif // TESTHELPER_H_
|
Loading…
Add table
Reference in a new issue