Mercurial > repos > dawe > srf2fastq
view srf2fastq/io_lib-1.12.2/io_lib/pooled_alloc.c @ 0:d901c9f41a6a default tip
Migrated tool version 1.0.1 from old tool shed archive to new tool shed repository
author | dawe |
---|---|
date | Tue, 07 Jun 2011 17:48:05 -0400 |
parents | |
children |
line wrap: on
line source
#include <stdlib.h> #include <stdio.h> #include <stdint.h> #include "io_lib/pooled_alloc.h" //#define TEST_MAIN #define PSIZE 1024*1024 pool_alloc_t *pool_create(size_t dsize) { pool_alloc_t *p; if (NULL == (p = (pool_alloc_t *)malloc(sizeof(*p)))) return NULL; /* Minimum size is a pointer, for free list */ dsize = (dsize + sizeof(void *) - 1) & ~(sizeof(void *)-1); if (dsize < sizeof(void *)) dsize = sizeof(void *); p->dsize = dsize; p->npools = 0; p->pools = NULL; p->free = NULL; return p; } static pool_t *new_pool(pool_alloc_t *p) { size_t i, n = PSIZE / p->dsize; pool_t *pool; char *cp; pool = realloc(p->pools, (p->npools + 1) * sizeof(*p->pools)); if (NULL == pool) return NULL; p->pools = pool; pool = &p->pools[p->npools]; pool->pool = malloc(n * p->dsize); if (NULL == pool->pool) return NULL; pool->used = 0; p->npools++; return pool; } void pool_destroy(pool_alloc_t *p) { size_t i; for (i = 0; i < p->npools; i++) { free(p->pools[i].pool); } free(p->pools); free(p); } void *pool_alloc(pool_alloc_t *p) { size_t i; pool_t *pool; void *ret; /* Look on free list */ if (NULL != p->free) { ret = p->free; p->free = *((void **)p->free); return ret; } /* Look for space in the last pool */ if (p->npools) { pool = &p->pools[p->npools - 1]; if (pool->used + p->dsize < PSIZE) { ret = ((char *) pool->pool) + pool->used; pool->used += p->dsize; return ret; } } /* Need a new pool */ pool = new_pool(p); if (NULL == pool) return NULL; pool->used = p->dsize; return pool->pool; } void pool_free(pool_alloc_t *p, void *ptr) { size_t psize, i; *(void **)ptr = p->free; p->free = ptr; } #ifdef TEST_MAIN typedef struct { int x, y, z; } xyz; #define NP 10000 int main(void) { int i; xyz *item; xyz **items; pool_alloc_t *p = pool_create(sizeof(xyz)); items = (xyz **)malloc(NP * sizeof(*items)); for (i = 0; i < NP; i++) { item = pool_alloc(p); item->x = i; item->y = i+1; item->z = i+2; items[i] = item; } for (i = 0; i < NP; i++) { item = items[i]; if (i % 3) pool_free(p, item); } for (i = 0; i < NP; i++) { item = pool_alloc(p); item->x = 1000000+i; item->y = 1000000+i+1; item->z = 1000000+i+2; } for (i = 0; i < NP; i++) { item = items[i]; printf("%d\t%d\t%d\t%d\n", i, item->x, item->y, item->z); pool_free(p, item); } return 0; } #endif