github-starred/ultimatepp
2
0
Fork 0
mirror of https://github.com/ultimatepp/ultimatepp.git synced 2026-08-02 06:06:59 -06:00
Code Issues 33 Projects Packages Wiki Activity Actions

reorganizing repo

Browse source 
git-svn-id: svn://ultimatepp.org/upp/trunk@9206 f0d560ea-af0d-0410-9eb7-867de7ffcac7
This commit is contained in:
cxl 2015-11-22 11:23:48 +00:00
parent 7d17505cfe
commit e3e8d627f5
3840 changed files with 0 additions and 1161578 deletions
Download patch file Download diff file Expand all files Collapse all files

128
uppdev/Malloc/HeapTest.cpp
View file

@ -1,128 +0,0 @@
#include "Malloc.h"
using namespace Upp;
void HeapCheckDebug() { HeapCheck(); }
void HSet(byte *ptr, int sz)
{
if(!ptr) return;
// Allocator specific!
size_t l = (uintptr_t)ptr & ~4095;
size_t qp = (uintptr_t)ptr;
int q = 0; // (uintptr_t)ptr % 257;
while(sz--)
*ptr++ = (byte)q++;
}
void HCheck(byte *ptr, int sz)
{
if(!ptr) return;
int q = 0; // (uintptr_t)ptr % 257;
while(sz--)
ASSERT(*ptr++ == (byte)q++);
}
int bcount;
byte *ptr[8192];
size_t sz[8192];
void MCheck()
{
HeapCheckDebug();
// for(int i = 0; i < bcount; i++)
// HCheck(ptr[i], sz[i]);
}
void HClear() {
for(int i = 0; i < bcount; i++) {
HCheck(ptr[i], sz[i]);
delete ptr[i];
ptr[i] = NULL;
sz[i] = 0;
MCheck();
}
HeapCheckDebug();
}
void MClear(bool del = false) {
for(int i = 0; i < bcount; i++) {
HCheck(ptr[i], sz[i]);
MemFree(ptr[i]);
ptr[i] = NULL;
sz[i] = 0;
MCheck();
}
HeapCheckDebug();
}
int RndSize()
{
// return rand() + rand();
return rand() & 7 ? rand() & 255 : rand() & 1 ? rand() & 8191 : rand() + rand() + rand();
}
void HeapTest(int cnt, int N, bool chk)
{
int mask = cnt - 1;
bcount = cnt;
memset(ptr, 0, sizeof(ptr));
memset(sz, 0, sizeof(sz));
MemFree(MemAlloc(0));
for(int n = 1; n < N; n++) {
if(n % 1000 == 0)
LOG(n);
LOG(n);
if(n == 53)
LOG("BP");
int q = n & mask;
if(chk)
MCheck();
else
HCheck(ptr[q], sz[q]);
MemFree((byte *)ptr[q]);
ptr[q] = NULL;
if(chk) MCheck();
sz[q] = RndSize();
ptr[q] = (byte *)MemAlloc(sz[q]);
// HSet(ptr[q], sz[q]);
if(chk) MCheck();
}
MClear();
MCheck();
LOG("Stage 1 passed\r\n");
for(int n2 = 1; n2 < N; n2++) {
if(n2 % 1000 == 0)
LOG(n2);
int q = n2 & mask;
if(chk)
MCheck();
else
HCheck(ptr[q], sz[q]);
// LOGF("Free: %p\n", (void *)ptr[q]);
MemFree((byte *)ptr[q]);
ptr[q] = NULL;
if(chk) MCheck();
sz[q] = RndSize();
ptr[q] = (byte *)MemAlloc(sz[q]);
// LOGF("Alloc: %d %p\n", sz[q], (void *)ptr[q]);
HSet(ptr[q], sz[q]);
if(chk) MCheck();
}
MClear();
LOG("Stage 2 (MemAlloc/MemFree) passed");
}
void HeapTest()
{
StdLogSetup(LOG_FILE|LOG_COUT);
for(;;) {
LOG("Allocator test:");
HeapTest(256, 100000, true);
LOG("Checked allocator test Passed");
HeapTest(8192, 1000000, false);
LOG("Quick allocator test Passed");
HeapTest(8192, 100 * 1000000, false);
LOG("Allocator test Passed");
}
}