1
0
mirror of https://github.com/Yours3lf/rpi-vk-driver.git synced 2024-12-01 13:24:20 +01:00
rpi-vk-driver/driver/PoolAllocator.c

74 lines
1.4 KiB
C
Raw Normal View History

2018-08-26 15:11:43 +02:00
#include "PoolAllocator.h"
#include "CustomAssert.h"
#include <stdint.h>
PoolAllocator createPoolAllocator(char* b, unsigned bs, unsigned s)
{
assert(b); //only allocated memory
assert(bs >= sizeof(void*)); //we need to be able to store
assert(s%bs==0); //we want a size that is the exact multiple of block size
assert(s > bs); //at least 1 element
PoolAllocator pa =
{
.buf = b,
.nextFreeBlock = (uint32_t*)b,
.blockSize = bs,
.size = s
};
//initialize linked list of free pointers
uint32_t* ptr = pa.nextFreeBlock;
2018-09-29 16:59:17 +02:00
unsigned last = s/bs - 1;
for(unsigned c = 0; c < last; ++c)
2018-08-26 15:11:43 +02:00
{
2018-09-29 16:59:17 +02:00
*ptr = (char*)ptr + bs;
ptr = (char*)ptr + bs;
2018-08-26 15:11:43 +02:00
}
*ptr = 0; //last element
return pa;
}
void destroyPoolAllocator(PoolAllocator* pa)
{
//actual memory freeing is done by caller
pa->buf = 0;
pa->nextFreeBlock = 0;
pa->blockSize = 0;
pa->size = 0;
}
void* poolAllocate(PoolAllocator* pa)
{
assert(pa->buf);
if(!pa->nextFreeBlock)
{
return 0; //no free blocks
}
//next free block will be allocated
void* ret = pa->nextFreeBlock;
//set next free block to the one the current next points to
pa->nextFreeBlock = (uint32_t*)*pa->nextFreeBlock;
return ret;
}
void poolFree(PoolAllocator* pa, void* p)
{
assert(pa->buf);
assert(p);
//set block to be freed to point to the current next free block
*(uint32_t*)p = (uint32_t)pa->nextFreeBlock;
//set next free block to the freshly freed block
pa->nextFreeBlock = p;
}