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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
|
/** BEGIN COPYRIGHT BLOCK
* Copyright (C) 2001 Sun Microsystems, Inc. Used by permission.
* Copyright (C) 2005 Red Hat, Inc.
* All rights reserved.
*
* License: GPL (version 3 or any later version).
* See LICENSE for details.
* END COPYRIGHT BLOCK **/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
/* DataList access functions */
#define INIT_ALLOC 8
#define ALLOC_INCREMENT 4
#include "slap.h"
DataList *
dl_new()
{
return (DataList *)slapi_ch_malloc(sizeof(DataList));
}
void
dl_free(DataList **dl)
{
slapi_ch_free((void **)dl);
}
void
dl_init(DataList *dl, int init_alloc)
{
PR_ASSERT(dl);
memset(dl, 0, sizeof(*dl));
if (init_alloc <= 0)
dl->alloc_count = INIT_ALLOC;
else
dl->alloc_count = init_alloc;
dl->elements = (void **)slapi_ch_calloc(dl->alloc_count, sizeof(void *));
}
void
dl_cleanup(DataList *dl, FREEFN freefn)
{
PR_ASSERT(dl);
if (freefn && dl->elements) {
int i;
for (i = 0; i < dl->element_count; i++) {
freefn(&(dl->elements[i]));
}
}
if (dl->elements) {
slapi_ch_free((void **)&dl->elements);
}
memset(dl, 0, sizeof(*dl));
}
/* index == 1 : insert first */
void
dl_add_index(DataList *dl, void *element, int index)
{
int i = 0;
PR_ASSERT(dl);
PR_ASSERT(element);
if (dl->element_count == dl->alloc_count) {
dl->alloc_count += ALLOC_INCREMENT;
dl->elements = (void **)slapi_ch_realloc((char *)dl->elements, dl->alloc_count * sizeof(void *));
}
dl->element_count++;
for (i = dl->element_count - 1; i >= index; i--) {
dl->elements[i] = dl->elements[i - 1];
}
if (dl->element_count < index) {
/* Means that we are adding the first element */
dl->elements[0] = element;
} else {
dl->elements[i] = element;
}
}
void
dl_add(DataList *dl, void *element)
{
PR_ASSERT(dl);
PR_ASSERT(element);
if (dl->element_count == dl->alloc_count) {
dl->alloc_count += ALLOC_INCREMENT;
dl->elements = (void **)slapi_ch_realloc((char *)dl->elements, dl->alloc_count * sizeof(void *));
}
dl->elements[dl->element_count] = element;
dl->element_count++;
}
void *
dl_get_first(const DataList *dl, int *cookie)
{
PR_ASSERT(dl);
PR_ASSERT(cookie);
if (dl->element_count == 0)
return NULL;
*cookie = 1;
return dl->elements[0];
}
void *
dl_get_next(const DataList *dl, int *cookie)
{
PR_ASSERT(dl);
PR_ASSERT(cookie && *cookie > 0);
if (*cookie >= dl->element_count)
return NULL;
return dl->elements[(*cookie)++];
}
void *
dl_get_prev(const DataList *dl, int *cookie)
{
PR_ASSERT(dl);
PR_ASSERT(cookie && *cookie > 0);
if (*cookie < 0)
return NULL;
if (*cookie > 0)
(*cookie)--;
return dl->elements[*cookie];
}
void *
dl_replace(const DataList *dl, const void *elementOld, void *elementNew, CMPFN cmpfn, FREEFN freefn)
{
int i;
void *save;
PR_ASSERT(dl);
PR_ASSERT(elementOld);
PR_ASSERT(elementNew);
PR_ASSERT(cmpfn);
for (i = 0; i < dl->element_count; i++) {
if (cmpfn(dl->elements[i], elementOld) == 0) {
/* if we have destructor - free the data; otherwise, return it to the client */
if (freefn) {
freefn(&dl->elements[i]);
save = NULL;
} else
save = dl->elements[i];
dl->elements[i] = elementNew;
return save;
}
}
return NULL;
}
void *
dl_get(const DataList *dl, const void *element, CMPFN cmpfn)
{
int i;
PR_ASSERT(dl);
PR_ASSERT(element);
PR_ASSERT(cmpfn);
for (i = 0; i < dl->element_count; i++) {
if (cmpfn(dl->elements[i], element) == 0) {
return dl->elements[i];
}
}
return NULL;
}
void *
dl_delete(DataList *dl, const void *element, CMPFN cmpfn, FREEFN freefn)
{
int i;
void *save;
PR_ASSERT(dl);
PR_ASSERT(element);
PR_ASSERT(cmpfn);
for (i = 0; i < dl->element_count; i++) {
if (cmpfn(dl->elements[i], element) == 0) {
/* if we have destructor - free the data; otherwise, return it to the client */
if (freefn) {
freefn(&dl->elements[i]);
save = NULL;
} else
save = dl->elements[i];
if (i != dl->element_count - 1) {
memmove(&dl->elements[i], &dl->elements[i + 1], (dl->element_count - i - 1) * sizeof(void *));
}
dl->element_count--;
return save;
}
}
return NULL;
}
int
dl_get_count(const DataList *dl)
{
PR_ASSERT(dl);
return dl->element_count;
}
|
