inline
void *Heap::Allok(int k)
{ // Try to alloc from the front-cache first
FreeLink *ptr = cache[k];
if(ptr) {
cachen[k]++;
cache[k] = ptr->next;
return DbgFreeCheckK(ptr, k);
}
return DbgFreeCheckK(AllocK(k), k);
}
inline
void *Heap::Allok(int k)
{
FreeLink *ptr = cache[k];
if(ptr) {
cachen[k]++;
cache[k] = ptr->next;
return DbgFreeCheckK(ptr, k);
}
return DbgFreeCheckK(AllocK(k), k);
}
int Heap::CheckPageFree(FreeLink *l, int k)
{
int n = 0;
while(l) {
DbgFreeCheckK(l, k);
l = l->next;
n++;
}
return n;
}
void Heap::Check() {
Mutex::Lock __(mutex);
Init();
if(!work[0]->next)
Init();
for(int i = 0; i < NKLASS; i++) {
DblCheck(work[i]);
DblCheck(full[i]);
Page *p = work[i]->next;
while(p != work[i]) {
Assert(p->heap == this);
Assert(CheckPageFree(p->freelist, p->klass) == p->Count() - p->active);
p = p->next;
}
p = full[i]->next;
while(p != full[i]) {
Assert(p->heap == this);
Assert(p->klass == i);
Assert(p->active == p->Count());
p = p->next;
}
p = empty[i];
if(p) {
for(;;) {
Assert(p->heap == this);
Assert(p->active == 0);
Assert(p->klass == i);
Assert(CheckPageFree(p->freelist, i) == p->Count());
if(this != &aux)
break;
p = p->next;
if(!p)
break;
}
}
FreeLink *l = cache[i];
while(l) {
DbgFreeCheckK(l, i);
l = l->next;
}
}
DLink *l = large->next;
while(l != large) {
Header *bh = (Header *)((byte *)l + LARGEHDRSZ);
while(bh->size) {
Assert((byte *)bh >= (byte *)l + LARGEHDRSZ && (byte *)bh < (byte *)l + 65536);
if(bh->free)
DbgFreeCheck(bh->GetBlock() + 1, bh->size - sizeof(DLink));
bh = bh->Next();
}
l = l->next;
}
if(this != &aux)
aux.Check();
}
