mirror of
https://github.com/radareorg/radare2.git
synced 2024-10-11 12:54:45 +00:00
78dbab76d6
* Add _write and _puts methods for r_socket api - fgets -> gets - fix r_socket_printf * More random fixes * typedef all structures in r_util
67 lines
1.7 KiB
C
67 lines
1.7 KiB
C
/* radare - LGPL - Copyright 2009 pancake<nopcode.org> */
|
|
|
|
#include <r_util.h>
|
|
#include <stdlib.h>
|
|
|
|
#define ALLOC_POOL_SIZE 1024
|
|
#define ALLOC_POOL_COUNT 128
|
|
|
|
// TODO: add api to serialize/deserialize memory pools from/to disk
|
|
// This can be useful when the application is swapping (userland swapping?)
|
|
// Do user-swapping takes sense?
|
|
|
|
R_API struct r_mem_pool_t* r_mem_pool_deinit(struct r_mem_pool_t *pool)
|
|
{
|
|
int i;
|
|
for(i=0;i<pool->npool;i++)
|
|
free(pool->nodes[i]);
|
|
free(pool->nodes);
|
|
pool->nodes = NULL;
|
|
return pool;
|
|
}
|
|
|
|
R_API struct r_mem_pool_t* r_mem_pool_init(struct r_mem_pool_t *pool, int nsize, int psize, int pcount)
|
|
{
|
|
if (pool) {
|
|
if (psize < 1)
|
|
psize = ALLOC_POOL_SIZE;
|
|
if (pcount < 1)
|
|
pcount = ALLOC_POOL_COUNT;
|
|
// TODO: assert nodesize?;
|
|
pool->poolsize = psize;
|
|
pool->poolcount = pcount;
|
|
pool->nodesize = nsize;
|
|
pool->npool = -1;
|
|
pool->ncount = pool->poolsize; // force init
|
|
pool->nodes = (void**) malloc (sizeof (void*) * pool->poolcount);
|
|
}
|
|
return pool;
|
|
}
|
|
|
|
R_API struct r_mem_pool_t *r_mem_pool_new(int nodesize, int poolsize, int poolcount)
|
|
{
|
|
return r_mem_pool_init (MALLOC_STRUCT (struct r_mem_pool_t),
|
|
nodesize, poolsize, poolcount);
|
|
}
|
|
|
|
R_API struct r_mem_pool_t *r_mem_pool_free(struct r_mem_pool_t *pool)
|
|
{
|
|
return (r_mem_pool_deinit(pool),free(pool),NULL);
|
|
}
|
|
|
|
R_API void* r_mem_pool_alloc(struct r_mem_pool_t *pool)
|
|
{
|
|
if (pool->ncount >= pool->poolsize) {
|
|
if (++pool->npool >= pool->poolcount) {
|
|
fprintf (stderr, "FAIL: Cannot allocate more memory in the pool\n");
|
|
return NULL;
|
|
}
|
|
pool->nodes[pool->npool] = malloc (pool->nodesize*pool->poolsize);
|
|
if (pool->nodes[pool->npool] == NULL)
|
|
return NULL;
|
|
pool->ncount = 0;
|
|
}
|
|
// TODO: fix warning
|
|
return (void *)(&(pool->nodes[pool->npool][pool->ncount++]));
|
|
}
|