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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
/* mpool.c memory pool management
*
* $Id: mpool.c,v 1.1 2003/09/16 04:08:24 rjs3 Exp $
* Copyright (c) 1998-2003 Carnegie Mellon University. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. The name "Carnegie Mellon University" must not be used to
* endorse or promote products derived from this software without
* prior written permission. For permission or any other legal
* details, please contact
* Office of Technology Transfer
* Carnegie Mellon University
* 5000 Forbes Avenue
* Pittsburgh, PA 15213-3890
* (412) 268-4387, fax: (412) 268-7395
* tech-transfer@andrew.cmu.edu
*
* 4. Redistributions of any form whatsoever must retain the following
* acknowledgment:
* "This product includes software developed by Computing Services
* at Carnegie Mellon University (http://www.cmu.edu/computing/)."
*
* CARNEGIE MELLON UNIVERSITY DISCLAIMS ALL WARRANTIES WITH REGARD TO
* THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS, IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY BE LIABLE
* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN
* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
* OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <config.h>
#include <sys/time.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <signal.h>
#include <time.h>
#include <stdlib.h>
#include <assert.h>
#include <syslog.h>
#include <errno.h>
#include "mpool.h"
#include "xmalloc.h"
#include "exitcodes.h"
struct mpool
{
struct mpool_blob *blob;
};
struct mpool_blob
{
size_t size;
unsigned char *base; /* Base of allocated section */
unsigned char *ptr; /* End of allocated section */
struct mpool_blob *next; /* Next Pool */
};
static struct mpool_blob *new_mpool_blob(size_t size)
{
struct mpool_blob *blob = xmalloc(sizeof(struct mpool_blob));
if(!size) size = DEFAULT_MPOOL_SIZE;
blob->base = blob->ptr = xmalloc(size);
blob->size = size;
blob->next = NULL;
return blob;
}
/* Create a new pool */
struct mpool *new_mpool(size_t size)
{
struct mpool *ret = xmalloc(sizeof(struct mpool));
ret->blob = new_mpool_blob(size);
return ret;
}
/* Free a pool */
void free_mpool(struct mpool *pool)
{
struct mpool_blob *p, *p_next;
if (!pool) return;
if (!pool->blob) {
fatal("memory pool without a blob", EC_TEMPFAIL);
return;
}
p = pool->blob;
while(p) {
p_next = p->next;
free(p->base);
free(p);
p = p_next;
}
free(pool);
}
#ifdef ROUNDUP
#undef ROUNDUP
#endif
/* round up to the next multiple of 16 bytes if necessary */
/* 0xFF...FFF0 = ~0 ^ 0xF */
#define ROUNDUP(num) (((num) + 15) & (~((unsigned long) 0x0) ^ 0xF))
/* Allocate from a pool */
void *mpool_malloc(struct mpool *pool, size_t size)
{
void *ret = NULL;
struct mpool_blob *p;
size_t remain;
if(!pool || !pool->blob) {
fatal("mpool_malloc called without a valid pool", EC_TEMPFAIL);
}
if(!size) {
/* This is legal under ANSI C, so we should allow it too */
size = 1;
}
p = pool->blob;
/* This is a bit tricky, not only do we have to make sure that the current
* pool has enough room, we need to be sure that we haven't rounded p->ptr
* outside of the current pool anyway */
remain = p->size - ((char *)p->ptr - (char *)p->base);
if (remain < size ||
(char *) p->ptr > (p->size + (char *) p->base)) {
/* Need a new pool */
struct mpool_blob *new_pool;
size_t new_pool_size = 2 * ((size > p->size) ? size : p->size);
new_pool = new_mpool_blob(new_pool_size);
new_pool->next = p;
p = pool->blob = new_pool;
}
ret = p->ptr;
/* make sure that the next thing we allocate is align on
a ROUNDUP boundary */
p->ptr = p->base + ROUNDUP(p->ptr - p->base + size);
return ret;
}
char *mpool_strdup(struct mpool *pool, const char *str)
{
char *ret;
size_t len;
if(!str) return NULL;
len = strlen(str);
ret = mpool_malloc(pool, len+1);
strcpy(ret, str);
return ret;
}
|
