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
|
/* memory.c
Memory-resident database... */
/*
* Copyright (c) 1995-2000 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 in cooperation with Vixie Enterprises and Nominum, Inc.
* To learn more about the Internet Software Consortium, see
* ``http://www.isc.org/''. To learn more about Vixie Enterprises,
* see ``http://www.vix.com''. To learn more about Nominum, Inc., see
* ``http://www.nominum.com''.
*/
#ifndef lint
static char copyright[] =
"$Id: memory.c,v 1.66 2000/05/16 23:02:23 mellon Exp $ Copyright (c) 1995-2000 The Internet Software Consortium. All rights reserved.\n";
#endif /* not lint */
#include "dhcpd.h"
struct group *root_group;
struct hash_table *group_name_hash;
int (*group_write_hook) (struct group_object *);
isc_result_t delete_group (struct group_object *group, int writep)
{
struct group_object *d;
/* The group should exist and be hashed - if not, it's invalid. */
if (group_name_hash) {
d = (struct group_object *)0;
group_hash_lookup (&d, group_name_hash, group -> name,
strlen (group -> name), MDL);
} else
return ISC_R_INVALIDARG;
if (!d)
return ISC_R_INVALIDARG;
/* Also not okay to delete a group that's not the one in
the hash table. */
if (d != group)
return ISC_R_INVALIDARG;
/* If it's dynamic, and we're deleting it, we can just blow away the
hash table entry. */
if ((group -> flags & GROUP_OBJECT_DYNAMIC) &&
!(group -> flags & GROUP_OBJECT_STATIC)) {
group_hash_delete (group_name_hash,
group -> name, strlen (group -> name), MDL);
} else {
group -> flags |= GROUP_OBJECT_DELETED;
if (group -> group)
group_dereference (&group -> group, MDL);
}
/* Store the group declaration in the lease file. */
if (writep && group_write_hook) {
if (!(*group_write_hook) (group))
return ISC_R_IOERROR;
}
return ISC_R_SUCCESS;
}
isc_result_t supersede_group (struct group_object *group, int writep)
{
struct group_object *t, *u;
isc_result_t status;
/* Register the group in the group name hash table,
so we can look it up later. */
if (group_name_hash) {
t = (struct group_object *)0;
group_hash_lookup (&t, group_name_hash,
group -> name,
strlen (group -> name), MDL);
if (t && t != group) {
/* If this isn't a dynamic entry, then we need to flag
the replacement as not dynamic either - otherwise,
if the dynamic entry is deleted later, the static
entry will come back next time the server is stopped
and restarted. */
if (!(t -> flags & GROUP_OBJECT_DYNAMIC))
group -> flags |= GROUP_OBJECT_STATIC;
/* Delete the old object if it hasn't already been
deleted. If it has already been deleted, get rid of
the hash table entry. This is a legitimate
situation - a deleted static object needs to be kept
around so we remember it's deleted. */
if (!(t -> flags & GROUP_OBJECT_DELETED))
delete_group (t, 0);
else {
group_hash_delete (group_name_hash,
group -> name,
strlen (group -> name),
MDL);
group_object_dereference (&t, MDL);
}
}
} else {
group_name_hash = new_hash ((hash_reference)
group_object_reference,
(hash_dereference)
group_object_dereference, 0);
t = (struct group_object *)0;
}
/* Add the group to the group name hash if it's not
already there, and also thread it into the list of
dynamic groups if appropriate. */
if (!t) {
group_hash_add (group_name_hash, group -> name,
strlen (group -> name), group, MDL);
}
/* Store the group declaration in the lease file. */
if (writep && group_write_hook) {
if (!(*group_write_hook) (group))
return ISC_R_IOERROR;
}
return ISC_R_SUCCESS;
}
int clone_group (struct group **gp, struct group *group,
const char *file, int line)
{
isc_result_t status;
struct group *g = (struct group *)0;
/* Normally gp should contain the null pointer, but for convenience
it's permissible to clone a group into itself. */
if (*gp && *gp != group)
return 0;
if (!group_allocate (&g, file, line))
return 0;
if (group == *gp)
*gp = (struct group *)0;
group_reference (gp, g, MDL);
g -> authoritative = group -> authoritative;
if (group -> shared_network) {
shared_network_reference (&g -> shared_network,
group -> shared_network, MDL);
}
group_reference (&g -> next, group, MDL);
group_dereference (&g, MDL);
return 1;
}
|
