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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
|
/* $OpenBSD: alloc.c,v 1.3 2004/05/04 20:28:40 deraadt Exp $ */
/* Memory allocation... */
/*
* Copyright (c) 1995, 1996, 1998 The Internet Software Consortium.
* 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. Neither the name of The Internet Software Consortium nor the names
* of its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INTERNET SOFTWARE CONSORTIUM AND
* CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE INTERNET SOFTWARE CONSORTIUM OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* This software has been written for the Internet Software Consortium
* by Ted Lemon <mellon@fugue.com> in cooperation with Vixie
* Enterprises. To learn more about the Internet Software Consortium,
* see ``http://www.vix.com/isc''. To learn more about Vixie
* Enterprises, see ``http://www.vix.com''.
*/
#include "dhcpd.h"
struct lease_state *free_lease_states;
void *
dmalloc(int size, char *name)
{
void *foo = calloc(size, sizeof(char));
if (!foo)
warn("No memory for %s.", name);
return (foo);
}
void
dfree(void *ptr, char *name)
{
if (!ptr) {
warn("dfree %s: free on null pointer.", name);
return;
}
free(ptr);
}
struct tree *
new_tree(char *name)
{
struct tree *rval = dmalloc(sizeof(struct tree), name);
return (rval);
}
struct tree_cache *free_tree_caches;
struct tree_cache *
new_tree_cache(char *name)
{
struct tree_cache *rval;
if (free_tree_caches) {
rval = free_tree_caches;
free_tree_caches = (struct tree_cache *)(rval->value);
} else {
rval = dmalloc(sizeof(struct tree_cache), name);
if (!rval)
error("unable to allocate tree cache for %s.", name);
}
return (rval);
}
struct hash_table *
new_hash_table(int count, char *name)
{
struct hash_table *rval;
rval = dmalloc(sizeof(struct hash_table) -
(DEFAULT_HASH_SIZE * sizeof(struct hash_bucket *)) +
(count * sizeof(struct hash_bucket *)), name);
if (rval == NULL)
return (NULL);
rval->hash_count = count;
return (rval);
}
struct hash_bucket *
new_hash_bucket(char *name)
{
struct hash_bucket *rval = dmalloc(sizeof(struct hash_bucket), name);
return (rval);
}
void
free_hash_bucket(struct hash_bucket *ptr, char *name)
{
dfree(ptr, name);
}
void
free_tree_cache(struct tree_cache *ptr)
{
ptr->value = (unsigned char *)free_tree_caches;
free_tree_caches = ptr;
}
void
free_tree(struct tree *ptr, char *name)
{
dfree(ptr, name);
}
struct shared_network *
new_shared_network(char *name)
{
struct shared_network *rval =
dmalloc(sizeof(struct shared_network), name);
return (rval);
}
struct subnet *
new_subnet(char *name)
{
struct subnet *rval = dmalloc(sizeof(struct subnet), name);
return (rval);
}
struct class *
new_class(char *name)
{
struct class *rval = dmalloc(sizeof(struct class), name);
return (rval);
}
struct lease_state *
new_lease_state(char *name)
{
struct lease_state *rval;
if (free_lease_states) {
rval = free_lease_states;
free_lease_states =
(struct lease_state *)(free_lease_states->next);
} else
rval = dmalloc (sizeof (struct lease_state), name);
return (rval);
}
void
free_lease_state(struct lease_state *ptr, char *name)
{
if (ptr->prl)
dfree(ptr->prl, name);
ptr->next = free_lease_states;
free_lease_states = ptr;
}
struct lease *
new_leases(int n, char *name)
{
struct lease *rval = dmalloc(n * sizeof(struct lease), name);
return (rval);
}
struct lease *
new_lease(char *name)
{
struct lease *rval = dmalloc(sizeof(struct lease), name);
return (rval);
}
struct group *
new_group(char *name)
{
struct group *rval =
dmalloc(sizeof(struct group), name);
return (rval);
}
void
free_lease(struct lease *ptr, char *name)
{
dfree(ptr, name);
}
|
