mimalloc/test/main-override.cpp

178 lines
3.0 KiB
C++
Raw Normal View History

2019-06-20 02:26:12 +03:00
#include <stdlib.h>
#include <stdio.h>
#include <assert.h>
#include <string.h>
#include <stdint.h>
2019-06-20 02:26:12 +03:00
#include <mimalloc.h>
#include <new>
#include <vector>
#include <thread>
#include <mimalloc.h>
#include <assert.h>
#ifdef _WIN32
#include <windows.h>
static void msleep(unsigned long msecs) { Sleep(msecs); }
#else
#include <unistd.h>
static void msleep(unsigned long msecs) { usleep(msecs * 1000UL); }
#endif
2020-04-06 19:19:26 +03:00
void heap_thread_free_large(); // issue #221
2020-04-06 18:32:25 +03:00
void heap_no_delete(); // issue #202
void heap_late_free(); // issue #204
void padding_shrink(); // issue #209
void various_tests();
int main() {
mi_stats_reset(); // ignore earlier allocations
2020-04-06 18:32:25 +03:00
heap_thread_free_large();
/*
2020-04-06 18:32:25 +03:00
heap_no_delete();
heap_late_free();
padding_shrink();
various_tests();
*/
mi_stats_print(NULL);
return 0;
}
2019-06-20 02:26:12 +03:00
static void* p = malloc(8);
void free_p() {
free(p);
return;
}
class Test {
private:
int i;
public:
Test(int x) { i = x; }
~Test() { }
};
void various_tests() {
2019-06-20 02:26:12 +03:00
atexit(free_p);
void* p1 = malloc(78);
2019-07-22 11:36:16 +03:00
void* p2 = mi_malloc_aligned(16,24);
free(p1);
2019-06-20 02:26:12 +03:00
p1 = malloc(8);
2019-07-22 11:36:16 +03:00
char* s = mi_strdup("hello\n");
//char* s = _strdup("hello\n");
//char* buf = NULL;
//size_t len;
//_dupenv_s(&buf,&len,"MIMALLOC_VERBOSE");
//mi_free(buf);
mi_free(p2);
2019-06-20 02:26:12 +03:00
p2 = malloc(16);
p1 = realloc(p1, 32);
free(p1);
2019-10-17 19:21:20 +03:00
free(p2);
mi_free(s);
Test* t = new Test(42);
delete t;
t = new (std::nothrow) Test(42);
2019-07-22 20:27:14 +03:00
delete t;
2019-06-20 02:26:12 +03:00
}
class Static {
private:
void* p;
public:
Static() {
p = malloc(64);
return;
}
~Static() {
free(p);
return;
}
};
static Static s = Static();
bool test_stl_allocator1() {
2020-01-21 04:34:29 +03:00
std::vector<int, mi_stl_allocator<int> > vec;
vec.push_back(1);
vec.pop_back();
return vec.size() == 0;
}
2020-01-21 04:34:29 +03:00
struct some_struct { int i; int j; double z; };
2020-01-21 04:34:29 +03:00
bool test_stl_allocator2() {
std::vector<some_struct, mi_stl_allocator<some_struct> > vec;
vec.push_back(some_struct());
vec.pop_back();
return vec.size() == 0;
}
// Issue #202
void heap_no_delete_worker() {
mi_heap_t* heap = mi_heap_new();
void* q = mi_heap_malloc(heap,1024);
// mi_heap_delete(heap); // uncomment to prevent assertion
}
void heap_no_delete() {
auto t1 = std::thread(heap_no_delete_worker);
t1.join();
}
// Issue #204
volatile void* global_p;
void t1main() {
mi_heap_t* heap = mi_heap_new();
global_p = mi_heap_malloc(heap, 1024);
mi_heap_delete(heap);
}
void heap_late_free() {
auto t1 = std::thread(t1main);
msleep(2000);
assert(global_p);
mi_free((void*)global_p);
t1.join();
}
// issue #209
static void* shared_p;
static void alloc0(/* void* arg */)
{
shared_p = mi_malloc(8);
}
void padding_shrink(void)
{
auto t1 = std::thread(alloc0);
t1.join();
mi_free(shared_p);
}
2020-04-06 18:32:25 +03:00
// Issue #221
void heap_thread_free_large_worker() {
mi_free(shared_p);
}
void heap_thread_free_large() {
for (int i = 0; i < 100; i++) {
shared_p = mi_malloc_aligned(2*1024*1024 + 1, 8);
2020-04-06 18:32:25 +03:00
auto t1 = std::thread(heap_thread_free_large_worker);
t1.join();
}
}