recycle.c File Reference

Detailed Description

Memory recycling routines for frequently allocated structures.

Provides functions that manage pools of reusable memory blocks to reduce malloc overhead and memory fragmentation. Written by Bob Jenkins (September 1996) and released to the public domain with no warranty.

Definition in file recycle.c.

#include "standard.h"
#include "recycle.h"

Go to the source code of this file.

Functions
reroot *	remkroot (size_t size)
void	refree (struct reroot *r)
char *	renewx (struct reroot *r)
char *	remalloc (size_t len, char *purpose)

Function Documentation

refree()

void refree

(

struct reroot *

r

)

Definition at line 30 of file recycle.c.

{
  recycle *temp;
  if ((temp = r->list) != NULL)
    while (r->list) {
      temp = r->list->next;
      free((char *)r->list);
      r->list = temp;
    }
  free((char *)r);
  return;
}

remalloc()

char * remalloc	(	size_t	len,
		char *	purpose )

Definition at line 64 of file recycle.c.

{
  char *x = (char *)malloc(len);
  if (!x) {
    fprintf(stderr, "malloc of %d failed for %s\n", (int)len, purpose);
    exit(1);
  }
  return x;
}

remkroot()

reroot * remkroot

(

size_t

size

)

Definition at line 18 of file recycle.c.

{
  reroot *r = (reroot *)remalloc(sizeof(reroot), "recycle.c, root");
  r->list = (recycle *)0;
  r->trash = (recycle *)0;
  r->size = mdbalign(size);
  r->logsize = RESTART;
  r->numleft = 0;
  return r;
}

renewx()

char * renewx

(

struct reroot *

r

)

Definition at line 44 of file recycle.c.

{
  recycle *temp;
  if (r->trash) { /* pull a node off the trash heap */
    temp = r->trash;
    r->trash = temp->next;
    (void)memset((void *)temp, 0, r->size);
  } else { /* allocate a new block of nodes */
    r->numleft = r->size * ((size_t)1 << r->logsize);
    if (r->numleft < REMAX)
      ++r->logsize;
    temp = (recycle *)remalloc(sizeof(recycle) + r->numleft, "recycle.c, data");
    temp->next = r->list;
    r->list = temp;
    r->numleft -= r->size;
    temp = (recycle *)((char *)(r->list + 1) + r->numleft);
  }
  return (char *)temp;
}