]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* crypto/stack/stack.c */ |
58964a49 | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
3 | * All rights reserved. |
4 | * | |
5 | * This package is an SSL implementation written | |
6 | * by Eric Young (eay@cryptsoft.com). | |
7 | * The implementation was written so as to conform with Netscapes SSL. | |
0f113f3e | 8 | * |
d02b48c6 RE |
9 | * This library is free for commercial and non-commercial use as long as |
10 | * the following conditions are aheared to. The following conditions | |
11 | * apply to all code found in this distribution, be it the RC4, RSA, | |
12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
13 | * included with this distribution is covered by the same copyright terms | |
14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
0f113f3e | 15 | * |
d02b48c6 RE |
16 | * Copyright remains Eric Young's, and as such any Copyright notices in |
17 | * the code are not to be removed. | |
18 | * If this package is used in a product, Eric Young should be given attribution | |
19 | * as the author of the parts of the library used. | |
20 | * This can be in the form of a textual message at program startup or | |
21 | * in documentation (online or textual) provided with the package. | |
0f113f3e | 22 | * |
d02b48c6 RE |
23 | * Redistribution and use in source and binary forms, with or without |
24 | * modification, are permitted provided that the following conditions | |
25 | * are met: | |
26 | * 1. Redistributions of source code must retain the copyright | |
27 | * notice, this list of conditions and the following disclaimer. | |
28 | * 2. Redistributions in binary form must reproduce the above copyright | |
29 | * notice, this list of conditions and the following disclaimer in the | |
30 | * documentation and/or other materials provided with the distribution. | |
31 | * 3. All advertising materials mentioning features or use of this software | |
32 | * must display the following acknowledgement: | |
33 | * "This product includes cryptographic software written by | |
34 | * Eric Young (eay@cryptsoft.com)" | |
35 | * The word 'cryptographic' can be left out if the rouines from the library | |
36 | * being used are not cryptographic related :-). | |
0f113f3e | 37 | * 4. If you include any Windows specific code (or a derivative thereof) from |
d02b48c6 RE |
38 | * the apps directory (application code) you must include an acknowledgement: |
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
0f113f3e | 40 | * |
d02b48c6 RE |
41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND |
42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
51 | * SUCH DAMAGE. | |
0f113f3e | 52 | * |
d02b48c6 RE |
53 | * The licence and distribution terms for any publically available version or |
54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
55 | * copied and put under another distribution licence | |
56 | * [including the GNU Public Licence.] | |
57 | */ | |
d02b48c6 RE |
58 | #include <stdio.h> |
59 | #include "cryptlib.h" | |
ec577822 | 60 | #include <openssl/stack.h> |
d584fd6b | 61 | #include <openssl/objects.h> |
d02b48c6 | 62 | |
31c2b6ee DSH |
63 | struct stack_st { |
64 | int num; | |
65 | char **data; | |
66 | int sorted; | |
67 | int num_alloc; | |
68 | int (*comp) (const void *, const void *); | |
69 | }; | |
70 | ||
d02b48c6 | 71 | #undef MIN_NODES |
0f113f3e | 72 | #define MIN_NODES 4 |
d02b48c6 | 73 | |
0f113f3e | 74 | const char STACK_version[] = "Stack" OPENSSL_VERSION_PTEXT; |
d02b48c6 | 75 | |
d02b48c6 RE |
76 | #include <errno.h> |
77 | ||
0f113f3e MC |
78 | int (*sk_set_cmp_func(_STACK *sk, int (*c) (const void *, const void *))) |
79 | (const void *, const void *) { | |
80 | int (*old) (const void *, const void *) = sk->comp; | |
eb90a483 | 81 | |
0f113f3e MC |
82 | if (sk->comp != c) |
83 | sk->sorted = 0; | |
84 | sk->comp = c; | |
eb90a483 | 85 | |
0f113f3e MC |
86 | return old; |
87 | } | |
d02b48c6 | 88 | |
5ce278a7 | 89 | _STACK *sk_dup(_STACK *sk) |
0f113f3e MC |
90 | { |
91 | _STACK *ret; | |
92 | char **s; | |
93 | ||
94 | if ((ret = sk_new(sk->comp)) == NULL) | |
95 | goto err; | |
b196e7d9 RS |
96 | s = OPENSSL_realloc((char *)ret->data, |
97 | (unsigned int)sizeof(char *) * sk->num_alloc); | |
0f113f3e MC |
98 | if (s == NULL) |
99 | goto err; | |
100 | ret->data = s; | |
101 | ||
102 | ret->num = sk->num; | |
103 | memcpy(ret->data, sk->data, sizeof(char *) * sk->num); | |
104 | ret->sorted = sk->sorted; | |
105 | ret->num_alloc = sk->num_alloc; | |
106 | ret->comp = sk->comp; | |
107 | return (ret); | |
108 | err: | |
109 | if (ret) | |
110 | sk_free(ret); | |
111 | return (NULL); | |
112 | } | |
113 | ||
114 | _STACK *sk_deep_copy(_STACK *sk, void *(*copy_func) (void *), | |
115 | void (*free_func) (void *)) | |
116 | { | |
117 | _STACK *ret; | |
118 | int i; | |
119 | ||
120 | if ((ret = OPENSSL_malloc(sizeof(_STACK))) == NULL) | |
121 | return ret; | |
122 | ret->comp = sk->comp; | |
123 | ret->sorted = sk->sorted; | |
124 | ret->num = sk->num; | |
125 | ret->num_alloc = sk->num > MIN_NODES ? sk->num : MIN_NODES; | |
126 | ret->data = OPENSSL_malloc(sizeof(char *) * ret->num_alloc); | |
127 | if (ret->data == NULL) { | |
128 | OPENSSL_free(ret); | |
129 | return NULL; | |
130 | } | |
131 | for (i = 0; i < ret->num_alloc; i++) | |
132 | ret->data[i] = NULL; | |
133 | ||
134 | for (i = 0; i < ret->num; ++i) { | |
135 | if (sk->data[i] == NULL) | |
136 | continue; | |
137 | if ((ret->data[i] = copy_func(sk->data[i])) == NULL) { | |
138 | while (--i >= 0) | |
139 | if (ret->data[i] != NULL) | |
140 | free_func(ret->data[i]); | |
141 | sk_free(ret); | |
142 | return NULL; | |
143 | } | |
144 | } | |
145 | return ret; | |
146 | } | |
66d884f0 | 147 | |
5ce278a7 | 148 | _STACK *sk_new_null(void) |
0f113f3e MC |
149 | { |
150 | return sk_new((int (*)(const void *, const void *))0); | |
151 | } | |
152 | ||
153 | _STACK *sk_new(int (*c) (const void *, const void *)) | |
154 | { | |
155 | _STACK *ret; | |
156 | int i; | |
157 | ||
158 | if ((ret = OPENSSL_malloc(sizeof(_STACK))) == NULL) | |
159 | goto err; | |
160 | if ((ret->data = OPENSSL_malloc(sizeof(char *) * MIN_NODES)) == NULL) | |
161 | goto err; | |
162 | for (i = 0; i < MIN_NODES; i++) | |
163 | ret->data[i] = NULL; | |
164 | ret->comp = c; | |
165 | ret->num_alloc = MIN_NODES; | |
166 | ret->num = 0; | |
167 | ret->sorted = 0; | |
168 | return (ret); | |
169 | err: | |
b548a1f1 | 170 | OPENSSL_free(ret); |
0f113f3e MC |
171 | return (NULL); |
172 | } | |
d02b48c6 | 173 | |
5ce278a7 | 174 | int sk_insert(_STACK *st, void *data, int loc) |
0f113f3e MC |
175 | { |
176 | char **s; | |
177 | ||
178 | if (st == NULL) | |
179 | return 0; | |
180 | if (st->num_alloc <= st->num + 1) { | |
181 | s = OPENSSL_realloc((char *)st->data, | |
182 | (unsigned int)sizeof(char *) * st->num_alloc * 2); | |
183 | if (s == NULL) | |
184 | return (0); | |
185 | st->data = s; | |
186 | st->num_alloc *= 2; | |
187 | } | |
188 | if ((loc >= (int)st->num) || (loc < 0)) | |
189 | st->data[st->num] = data; | |
190 | else { | |
0f113f3e MC |
191 | memmove(&(st->data[loc + 1]), |
192 | &(st->data[loc]), sizeof(char *) * (st->num - loc)); | |
0f113f3e MC |
193 | st->data[loc] = data; |
194 | } | |
195 | st->num++; | |
196 | st->sorted = 0; | |
197 | return (st->num); | |
198 | } | |
d02b48c6 | 199 | |
5ce278a7 | 200 | void *sk_delete_ptr(_STACK *st, void *p) |
0f113f3e MC |
201 | { |
202 | int i; | |
d02b48c6 | 203 | |
0f113f3e MC |
204 | for (i = 0; i < st->num; i++) |
205 | if (st->data[i] == p) | |
206 | return (sk_delete(st, i)); | |
207 | return (NULL); | |
208 | } | |
d02b48c6 | 209 | |
5ce278a7 | 210 | void *sk_delete(_STACK *st, int loc) |
0f113f3e MC |
211 | { |
212 | char *ret; | |
213 | int i, j; | |
214 | ||
215 | if (!st || (loc < 0) || (loc >= st->num)) | |
216 | return NULL; | |
217 | ||
218 | ret = st->data[loc]; | |
219 | if (loc != st->num - 1) { | |
220 | j = st->num - 1; | |
221 | for (i = loc; i < j; i++) | |
222 | st->data[i] = st->data[i + 1]; | |
223 | /* | |
224 | * In theory memcpy is not safe for this memcpy( &(st->data[loc]), | |
225 | * &(st->data[loc+1]), sizeof(char *)*(st->num-loc-1)); | |
226 | */ | |
227 | } | |
228 | st->num--; | |
229 | return (ret); | |
230 | } | |
d02b48c6 | 231 | |
5ce278a7 | 232 | static int internal_find(_STACK *st, void *data, int ret_val_options) |
0f113f3e MC |
233 | { |
234 | const void *const *r; | |
235 | int i; | |
236 | ||
237 | if (st == NULL) | |
238 | return -1; | |
239 | ||
240 | if (st->comp == NULL) { | |
241 | for (i = 0; i < st->num; i++) | |
242 | if (st->data[i] == data) | |
243 | return (i); | |
244 | return (-1); | |
245 | } | |
246 | sk_sort(st); | |
247 | if (data == NULL) | |
248 | return (-1); | |
249 | r = OBJ_bsearch_ex_(&data, st->data, st->num, sizeof(void *), st->comp, | |
250 | ret_val_options); | |
251 | if (r == NULL) | |
252 | return (-1); | |
253 | return (int)((char **)r - st->data); | |
254 | } | |
26851b6b | 255 | |
5ce278a7 | 256 | int sk_find(_STACK *st, void *data) |
0f113f3e MC |
257 | { |
258 | return internal_find(st, data, OBJ_BSEARCH_FIRST_VALUE_ON_MATCH); | |
259 | } | |
260 | ||
5ce278a7 | 261 | int sk_find_ex(_STACK *st, void *data) |
0f113f3e MC |
262 | { |
263 | return internal_find(st, data, OBJ_BSEARCH_VALUE_ON_NOMATCH); | |
264 | } | |
d02b48c6 | 265 | |
5ce278a7 | 266 | int sk_push(_STACK *st, void *data) |
0f113f3e MC |
267 | { |
268 | return (sk_insert(st, data, st->num)); | |
269 | } | |
d02b48c6 | 270 | |
5ce278a7 | 271 | int sk_unshift(_STACK *st, void *data) |
0f113f3e MC |
272 | { |
273 | return (sk_insert(st, data, 0)); | |
274 | } | |
d02b48c6 | 275 | |
5ce278a7 | 276 | void *sk_shift(_STACK *st) |
0f113f3e MC |
277 | { |
278 | if (st == NULL) | |
279 | return (NULL); | |
280 | if (st->num <= 0) | |
281 | return (NULL); | |
282 | return (sk_delete(st, 0)); | |
283 | } | |
d02b48c6 | 284 | |
5ce278a7 | 285 | void *sk_pop(_STACK *st) |
0f113f3e MC |
286 | { |
287 | if (st == NULL) | |
288 | return (NULL); | |
289 | if (st->num <= 0) | |
290 | return (NULL); | |
291 | return (sk_delete(st, st->num - 1)); | |
292 | } | |
d02b48c6 | 293 | |
5ce278a7 | 294 | void sk_zero(_STACK *st) |
0f113f3e MC |
295 | { |
296 | if (st == NULL) | |
297 | return; | |
298 | if (st->num <= 0) | |
299 | return; | |
7132ac83 | 300 | memset((char *)st->data, 0, sizeof(*st->data) * st->num); |
0f113f3e MC |
301 | st->num = 0; |
302 | } | |
303 | ||
304 | void sk_pop_free(_STACK *st, void (*func) (void *)) | |
305 | { | |
306 | int i; | |
307 | ||
308 | if (st == NULL) | |
309 | return; | |
310 | for (i = 0; i < st->num; i++) | |
311 | if (st->data[i] != NULL) | |
312 | func(st->data[i]); | |
313 | sk_free(st); | |
314 | } | |
d02b48c6 | 315 | |
5ce278a7 | 316 | void sk_free(_STACK *st) |
0f113f3e MC |
317 | { |
318 | if (st == NULL) | |
319 | return; | |
b548a1f1 | 320 | OPENSSL_free(st->data); |
0f113f3e MC |
321 | OPENSSL_free(st); |
322 | } | |
d02b48c6 | 323 | |
5ce278a7 | 324 | int sk_num(const _STACK *st) |
e84240d4 | 325 | { |
0f113f3e MC |
326 | if (st == NULL) |
327 | return -1; | |
328 | return st->num; | |
e84240d4 DSH |
329 | } |
330 | ||
5ce278a7 | 331 | void *sk_value(const _STACK *st, int i) |
e84240d4 | 332 | { |
0f113f3e MC |
333 | if (!st || (i < 0) || (i >= st->num)) |
334 | return NULL; | |
335 | return st->data[i]; | |
e84240d4 DSH |
336 | } |
337 | ||
5ce278a7 | 338 | void *sk_set(_STACK *st, int i, void *value) |
e84240d4 | 339 | { |
0f113f3e MC |
340 | if (!st || (i < 0) || (i >= st->num)) |
341 | return NULL; | |
342 | return (st->data[i] = value); | |
e84240d4 | 343 | } |
ee8ba0b2 | 344 | |
5ce278a7 | 345 | void sk_sort(_STACK *st) |
0f113f3e MC |
346 | { |
347 | if (st && !st->sorted) { | |
348 | int (*comp_func) (const void *, const void *); | |
349 | ||
350 | /* | |
351 | * same comment as in sk_find ... previously st->comp was declared as | |
352 | * a (void*,void*) callback type, but this made the population of the | |
353 | * callback pointer illogical - our callbacks compare type** with | |
354 | * type**, so we leave the casting until absolutely necessary (ie. | |
355 | * "now"). | |
356 | */ | |
357 | comp_func = (int (*)(const void *, const void *))(st->comp); | |
358 | qsort(st->data, st->num, sizeof(char *), comp_func); | |
359 | st->sorted = 1; | |
360 | } | |
361 | } | |
2f605e8d | 362 | |
5ce278a7 | 363 | int sk_is_sorted(const _STACK *st) |
0f113f3e MC |
364 | { |
365 | if (!st) | |
366 | return 1; | |
367 | return st->sorted; | |
368 | } |