1 /* crypto/stack/stack.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
60 * Author - Eric Young v 1.0
61 * 1.2 eay 12-Mar-97 - Modified sk_find so that it _DOES_ return the
62 * lowest index for the searched item.
64 * 1.1 eay - Take from netdb and added to SSLeay
66 * 1.0 eay - First version 29/07/92
70 #include <openssl/stack.h>
75 const char *STACK_version="Stack" OPENSSL_VERSION_PTEXT;
79 int (*sk_set_cmp_func(STACK *sk, int (*c)(const void *,const void *)))(const void *, const void *)
81 int (*old)(const void *,const void *)=sk->comp;
90 STACK *sk_dup(STACK *sk)
95 if ((ret=sk_new(sk->comp)) == NULL) goto err;
96 s=(char **)Realloc((char *)ret->data,
97 (unsigned int)sizeof(char *)*sk->num_alloc);
98 if (s == NULL) goto err;
102 memcpy(ret->data,sk->data,sizeof(char *)*sk->num);
103 ret->sorted=sk->sorted;
104 ret->num_alloc=sk->num_alloc;
111 STACK *sk_new(int (*c)(const void *, const void *))
116 if ((ret=(STACK *)Malloc(sizeof(STACK))) == NULL)
118 if ((ret->data=(char **)Malloc(sizeof(char *)*MIN_NODES)) == NULL)
120 for (i=0; i<MIN_NODES; i++)
123 ret->num_alloc=MIN_NODES;
133 int sk_insert(STACK *st, char *data, int loc)
137 if(st == NULL) return 0;
138 if (st->num_alloc <= st->num+1)
140 s=(char **)Realloc((char *)st->data,
141 (unsigned int)sizeof(char *)*st->num_alloc*2);
147 if ((loc >= (int)st->num) || (loc < 0))
148 st->data[st->num]=data;
155 t=(char **)&(st->data[1]);
156 for (i=st->num; i>=loc; i--)
159 #ifdef undef /* no memmove on sunos :-( */
160 memmove( (char *)&(st->data[loc+1]),
161 (char *)&(st->data[loc]),
162 sizeof(char *)*(st->num-loc));
171 char *sk_delete_ptr(STACK *st, char *p)
175 for (i=0; i<st->num; i++)
176 if (st->data[i] == p)
177 return(sk_delete(st,i));
181 char *sk_delete(STACK *st, int loc)
186 if ((st == NULL) || (st->num == 0) || (loc < 0)
187 || (loc >= st->num)) return(NULL);
190 if (loc != st->num-1)
193 for (i=loc; i<j; i++)
194 st->data[i]=st->data[i+1];
195 /* In theory memcpy is not safe for this
196 * memcpy( &(st->data[loc]),
197 * &(st->data[loc+1]),
198 * sizeof(char *)*(st->num-loc-1));
205 int sk_find(STACK *st, char *data)
209 int (*comp_func)(const void *,const void *);
210 if(st == NULL) return -1;
212 if (st->comp == NULL)
214 for (i=0; i<st->num; i++)
215 if (st->data[i] == data)
220 if (data == NULL) return(-1);
222 r=(char **)bsearch(&data,(char *)st->data,
223 st->num,sizeof(char *), comp_func);
224 if (r == NULL) return(-1);
227 if ((*st->comp)(&(st->data[i-1]),&data) < 0)
232 int sk_push(STACK *st, char *data)
234 return(sk_insert(st,data,st->num));
237 int sk_unshift(STACK *st, char *data)
239 return(sk_insert(st,data,0));
242 char *sk_shift(STACK *st)
244 if (st == NULL) return(NULL);
245 if (st->num <= 0) return(NULL);
246 return(sk_delete(st,0));
249 char *sk_pop(STACK *st)
251 if (st == NULL) return(NULL);
252 if (st->num <= 0) return(NULL);
253 return(sk_delete(st,st->num-1));
256 void sk_zero(STACK *st)
258 if (st == NULL) return;
259 if (st->num <= 0) return;
260 memset((char *)st->data,0,sizeof(st->data)*st->num);
264 void sk_pop_free(STACK *st, void (*func)(void *))
268 if (st == NULL) return;
269 for (i=0; i<st->num; i++)
270 if (st->data[i] != NULL)
275 void sk_free(STACK *st)
277 if (st == NULL) return;
278 if (st->data != NULL) Free(st->data);
282 int sk_num(STACK *st)
284 if(st == NULL) return -1;
288 char *sk_value(STACK *st, int i)
290 if(st == NULL) return NULL;
294 char *sk_set(STACK *st, int i, char *value)
296 if(st == NULL) return NULL;
297 return (st->data[i] = value);
300 void sk_sort(STACK *st)
304 int (*comp_func)(const void *,const void *);
307 qsort(st->data,st->num,sizeof(char *), comp_func);