diff options
Diffstat (limited to 'include/recycle.h')
| -rw-r--r-- | include/recycle.h | 69 | 
1 files changed, 69 insertions, 0 deletions
diff --git a/include/recycle.h b/include/recycle.h new file mode 100644 index 0000000..875eb21 --- /dev/null +++ b/include/recycle.h @@ -0,0 +1,69 @@ +/* +-------------------------------------------------------------------- +By Bob Jenkins, September 1996.  recycle.h +You may use this code in any way you wish, and it is free.  No warranty. + +This manages memory for commonly-allocated structures. +It allocates RESTART to REMAX items at a time. +Timings have shown that, if malloc is used for every new structure, +  malloc will consume about 90% of the time in a program.  This +  module cuts down the number of mallocs by an order of magnitude. +This also decreases memory fragmentation, and freeing all structures +  only requires freeing the root. +-------------------------------------------------------------------- +*/ + +#ifndef RECYCLE +#define RECYCLE + +#define RESTART    0 +#define REMAX      32000 + +#ifdef __cplusplus +extern "C" { +#endif + +struct recycle +{ +   struct recycle *next; +}; +typedef  struct recycle  recycle; + +struct reroot +{ +   struct recycle *list;     /* list of malloced blocks */ +   struct recycle *trash;    /* list of deleted items */ +   size_t          size;     /* size of an item */ +   size_t          logsize;  /* log_2 of number of items in a block */ +   int             numleft;  /* number of bytes left in this block */ +}; +typedef  struct reroot  reroot; + +/* make a new recycling root */ +reroot  *remkroot(size_t mysize); + +/* free a recycling root and all the items it has made */ +void     refree(struct reroot *r); + +/* get a new (cleared) item from the root */ +#define renew(r) ((r)->numleft ? \ +   (((char *)((r)->list+1))+((r)->numleft-=(r)->size)) : renewx(r)) + +char    *renewx(struct reroot *r); + +/* delete an item; let the root recycle it */ +/* void     redel(/o_ struct reroot *r, struct recycle *item _o/); */ +#define redel(root,item) { \ +   ((recycle *)item)->next=(root)->trash; \ +   (root)->trash=(recycle *)(item); \ +} + +/* malloc, but complain to stderr and exit program if no joy */ +/* use plain free() to free memory allocated by remalloc() */ +char    *remalloc(size_t len, char *purpose); + +#ifdef __cplusplus +} +#endif + +#endif  /* RECYCLE */  | 
