stack.c revision 280304 
1/* crypto/stack/stack.c */
2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
8 *
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).
15 *
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.
22 *
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 :-).
37 * 4. If you include any Windows specific code (or a derivative thereof) from
38 *    the apps directory (application code) you must include an acknowledgement:
39 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40 *
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.
52 *
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 */
58
59/*-
60 * Code for stacks
61 * Author - Eric Young v 1.0
62 * 1.2 eay 12-Mar-97 -  Modified sk_find so that it _DOES_ return the
63 *                      lowest index for the searched item.
64 *
65 * 1.1 eay - Take from netdb and added to SSLeay
66 *
67 * 1.0 eay - First version 29/07/92
68 */
69#include <stdio.h>
70#include "cryptlib.h"
71#include <openssl/stack.h>
72#include <openssl/objects.h>
73
74#undef MIN_NODES
75#define MIN_NODES       4
76
77const char STACK_version[] = "Stack" OPENSSL_VERSION_PTEXT;
78
79#include <errno.h>
80
81int (*sk_set_cmp_func(_STACK *sk, int (*c) (const void *, const void *)))
82 (const void *, const void *) {
83    int (*old) (const void *, const void *) = sk->comp;
84
85    if (sk->comp != c)
86        sk->sorted = 0;
87    sk->comp = c;
88
89    return old;
90}
91
92_STACK *sk_dup(_STACK *sk)
93{
94    _STACK *ret;
95    char **s;
96
97    if ((ret = sk_new(sk->comp)) == NULL)
98        goto err;
99    s = (char **)OPENSSL_realloc((char *)ret->data,
100                                 (unsigned int)sizeof(char *) *
101                                 sk->num_alloc);
102    if (s == NULL)
103        goto err;
104    ret->data = s;
105
106    ret->num = sk->num;
107    memcpy(ret->data, sk->data, sizeof(char *) * sk->num);
108    ret->sorted = sk->sorted;
109    ret->num_alloc = sk->num_alloc;
110    ret->comp = sk->comp;
111    return (ret);
112 err:
113    if (ret)
114        sk_free(ret);
115    return (NULL);
116}
117
118_STACK *sk_new_null(void)
119{
120    return sk_new((int (*)(const void *, const void *))0);
121}
122
123_STACK *sk_new(int (*c) (const void *, const void *))
124{
125    _STACK *ret;
126    int i;
127
128    if ((ret = OPENSSL_malloc(sizeof(_STACK))) == NULL)
129        goto err;
130    if ((ret->data = OPENSSL_malloc(sizeof(char *) * MIN_NODES)) == NULL)
131        goto err;
132    for (i = 0; i < MIN_NODES; i++)
133        ret->data[i] = NULL;
134    ret->comp = c;
135    ret->num_alloc = MIN_NODES;
136    ret->num = 0;
137    ret->sorted = 0;
138    return (ret);
139 err:
140    if (ret)
141        OPENSSL_free(ret);
142    return (NULL);
143}
144
145int sk_insert(_STACK *st, void *data, int loc)
146{
147    char **s;
148
149    if (st == NULL)
150        return 0;
151    if (st->num_alloc <= st->num + 1) {
152        s = OPENSSL_realloc((char *)st->data,
153                            (unsigned int)sizeof(char *) * st->num_alloc * 2);
154        if (s == NULL)
155            return (0);
156        st->data = s;
157        st->num_alloc *= 2;
158    }
159    if ((loc >= (int)st->num) || (loc < 0))
160        st->data[st->num] = data;
161    else {
162        int i;
163        char **f, **t;
164
165        f = st->data;
166        t = &(st->data[1]);
167        for (i = st->num; i >= loc; i--)
168            t[i] = f[i];
169
170#ifdef undef                    /* no memmove on sunos :-( */
171        memmove(&(st->data[loc + 1]),
172                &(st->data[loc]), sizeof(char *) * (st->num - loc));
173#endif
174        st->data[loc] = data;
175    }
176    st->num++;
177    st->sorted = 0;
178    return (st->num);
179}
180
181void *sk_delete_ptr(_STACK *st, void *p)
182{
183    int i;
184
185    for (i = 0; i < st->num; i++)
186        if (st->data[i] == p)
187            return (sk_delete(st, i));
188    return (NULL);
189}
190
191void *sk_delete(_STACK *st, int loc)
192{
193    char *ret;
194    int i, j;
195
196    if (!st || (loc < 0) || (loc >= st->num))
197        return NULL;
198
199    ret = st->data[loc];
200    if (loc != st->num - 1) {
201        j = st->num - 1;
202        for (i = loc; i < j; i++)
203            st->data[i] = st->data[i + 1];
204        /*
205         * In theory memcpy is not safe for this memcpy( &(st->data[loc]),
206         * &(st->data[loc+1]), sizeof(char *)*(st->num-loc-1));
207         */
208    }
209    st->num--;
210    return (ret);
211}
212
213static int internal_find(_STACK *st, void *data, int ret_val_options)
214{
215    const void *const *r;
216    int i;
217
218    if (st == NULL)
219        return -1;
220
221    if (st->comp == NULL) {
222        for (i = 0; i < st->num; i++)
223            if (st->data[i] == data)
224                return (i);
225        return (-1);
226    }
227    sk_sort(st);
228    if (data == NULL)
229        return (-1);
230    r = OBJ_bsearch_ex_(&data, st->data, st->num, sizeof(void *), st->comp,
231                        ret_val_options);
232    if (r == NULL)
233        return (-1);
234    return (int)((char **)r - st->data);
235}
236
237int sk_find(_STACK *st, void *data)
238{
239    return internal_find(st, data, OBJ_BSEARCH_FIRST_VALUE_ON_MATCH);
240}
241
242int sk_find_ex(_STACK *st, void *data)
243{
244    return internal_find(st, data, OBJ_BSEARCH_VALUE_ON_NOMATCH);
245}
246
247int sk_push(_STACK *st, void *data)
248{
249    return (sk_insert(st, data, st->num));
250}
251
252int sk_unshift(_STACK *st, void *data)
253{
254    return (sk_insert(st, data, 0));
255}
256
257void *sk_shift(_STACK *st)
258{
259    if (st == NULL)
260        return (NULL);
261    if (st->num <= 0)
262        return (NULL);
263    return (sk_delete(st, 0));
264}
265
266void *sk_pop(_STACK *st)
267{
268    if (st == NULL)
269        return (NULL);
270    if (st->num <= 0)
271        return (NULL);
272    return (sk_delete(st, st->num - 1));
273}
274
275void sk_zero(_STACK *st)
276{
277    if (st == NULL)
278        return;
279    if (st->num <= 0)
280        return;
281    memset((char *)st->data, 0, sizeof(*st->data) * st->num);
282    st->num = 0;
283}
284
285void sk_pop_free(_STACK *st, void (*func) (void *))
286{
287    int i;
288
289    if (st == NULL)
290        return;
291    for (i = 0; i < st->num; i++)
292        if (st->data[i] != NULL)
293            func(st->data[i]);
294    sk_free(st);
295}
296
297void sk_free(_STACK *st)
298{
299    if (st == NULL)
300        return;
301    if (st->data != NULL)
302        OPENSSL_free(st->data);
303    OPENSSL_free(st);
304}
305
306int sk_num(const _STACK *st)
307{
308    if (st == NULL)
309        return -1;
310    return st->num;
311}
312
313void *sk_value(const _STACK *st, int i)
314{
315    if (!st || (i < 0) || (i >= st->num))
316        return NULL;
317    return st->data[i];
318}
319
320void *sk_set(_STACK *st, int i, void *value)
321{
322    if (!st || (i < 0) || (i >= st->num))
323        return NULL;
324    return (st->data[i] = value);
325}
326
327void sk_sort(_STACK *st)
328{
329    if (st && !st->sorted) {
330        int (*comp_func) (const void *, const void *);
331
332        /*
333         * same comment as in sk_find ... previously st->comp was declared as
334         * a (void*,void*) callback type, but this made the population of the
335         * callback pointer illogical - our callbacks compare type** with
336         * type**, so we leave the casting until absolutely necessary (ie.
337         * "now").
338         */
339        comp_func = (int (*)(const void *, const void *))(st->comp);
340        qsort(st->data, st->num, sizeof(char *), comp_func);
341        st->sorted = 1;
342    }
343}
344
345int sk_is_sorted(const _STACK *st)
346{
347    if (!st)
348        return 1;
349    return st->sorted;
350}
351