summaryrefslogtreecommitdiffstats
path: root/lib/mempool.c
blob: d2f2c092d4cc27bf5cc1ae923ab0d32840246b29 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
/*
 *	BIRD Resource Manager -- Memory Pools
 *
 *	(c) 1998 Martin Mares <mj@ucw.cz>
 *
 *	Can be freely distributed and used under the terms of the GNU GPL.
 */

#include <stdlib.h>
#include <string.h>

#include "nest/bird.h"
#include "lib/resource.h"

struct mp_chunk {
  struct mp_chunk *next;
  byte data[0];
};

struct mempool {
  resource r;
  byte *ptr, *end;
  struct mp_chunk *first, **plast;
  unsigned chunk_size, threshold, total;
};

void mp_free(resource *);
void mp_dump(resource *);

struct resclass mp_class = {
  "MemPool",
  sizeof(struct mempool),
  mp_free,
  mp_dump
};

mempool
*mp_new(pool *p, unsigned blk)
{
  mempool *m = ralloc(p, &mp_class);
  m->ptr = m->end = NULL;
  m->first = NULL;
  m->plast = &m->first;
  m->chunk_size = blk;
  m->threshold = 3*blk/4;
  m->total = 0;
  return m;
}

void *
mp_alloc(mempool *m, unsigned size)
{
  byte *a = (byte *) ALIGN((unsigned long) m->ptr, CPU_STRUCT_ALIGN);
  byte *e = a + size;

  if (e <= m->end)
    {
      m->ptr = e;
      return a;
    }
  else
    {
      struct mp_chunk *c;
      if (size >= m->threshold)
	{
	  c = xmalloc(sizeof(struct mp_chunk) + size);
	  m->total += size;
	}
      else
	{
	  c = xmalloc(sizeof(struct mp_chunk) + m->chunk_size);
	  m->ptr = c->data + size;
	  m->end = c->data + m->chunk_size;
	  m->total += m->chunk_size;
	}
      *m->plast = c;
      m->plast = &c->next;
      c->next = NULL;
      return c->data;
    }
}

void *
mp_allocu(mempool *m, unsigned size)
{
  byte *a = m->ptr;
  byte *e = a + size;

  if (e <= m->end)
    {
      m->ptr = e;
      return a;
    }
  return mp_alloc(m, size);
}

void *
mp_allocz(mempool *m, unsigned size)
{
  void *z = mp_alloc(m, size);

  bzero(z, size);
  return z;
}

void
mp_free(resource *r)
{
  mempool *m = (mempool *) r;
  struct mp_chunk *c, *d;

  for(d=m->first; d; d = c)
    {
      c = d->next;
      xfree(d);
    }
}

void
mp_dump(resource *r)
{
  mempool *m = (mempool *) r;
  struct mp_chunk *c;
  int cnt;

  for(cnt=0, c=m->first; c; c=c->next, cnt++)
    ;
  debug("(chunk=%d threshold=%d count=%d total=%d)\n",
	m->chunk_size,
	m->threshold,
	cnt,
	m->total);
}