Aren/haiku
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Implemented freeing of blocks, though it's not very efficient yet.

Browse Source 
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@16833 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Axel Dörfler 2006-03-18 18:37:37 +00:00
parent 16c7939643
commit bc9902cf98
1 changed files with 41 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
src/servers/app/ClientMemoryAllocator.cpp
View File

@ -110,7 +110,47 @@ ClientMemoryAllocator::Free(void *cookie)
if (cookie == NULL)
return;
// TODO: implement me!!!
struct block* freeBlock = (struct block*)cookie;
// search for an adjacent free block
block_iterator iterator = fFreeBlocks.GetIterator();
struct block* before = NULL;
struct block* after = NULL;
struct block* block;
// TODO: this could be done better if free blocks are sorted,
// and if we had one free blocks list per chunk!
// IOW this is a bit slow...
while ((block = iterator.Next()) != NULL) {
if (block->chunk != freeBlock->chunk)
continue;
if (block->base + block->size == freeBlock->base)
before = block;
if (block->base == freeBlock->base + freeBlock->size)
after = block;
}
if (before != NULL && after != NULL) {
// merge with adjacent blocks
before->size += after->size + freeBlock->size;
fFreeBlocks.Remove(after);
free(after);
free(freeBlock);
} else if (before != NULL) {
before->size += freeBlock->size;
free(freeBlock);
} else if (after != NULL) {
after->base -= freeBlock->size;
after->size += freeBlock->size;
free(freeBlock);
} else
fFreeBlocks.Add(freeBlock);
// TODO: check if the whole chunk is free now (we could delete it then)
}