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 seached 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;
77 #define FP_ICC (int (*)(const void *,const void *))
80 int (*sk_set_cmp_func(STACK *sk, int (*c)()))(void)
82 int (*old)()=sk->comp;
91 STACK *sk_dup(STACK *sk)
96 if ((ret=sk_new(sk->comp)) == NULL) goto err;
97 s=(char **)Realloc((char *)ret->data,
98 (unsigned int)sizeof(char *)*sk->num_alloc);
99 if (s == NULL) goto err;
103 memcpy(ret->data,sk->data,sizeof(char *)*sk->num);
104 ret->sorted=sk->sorted;
105 ret->num_alloc=sk->num_alloc;
112 STACK *sk_new(int (*c)())
117 if ((ret=(STACK *)Malloc(sizeof(STACK))) == NULL)
119 if ((ret->data=(char **)Malloc(sizeof(char *)*MIN_NODES)) == NULL)
121 for (i=0; i<MIN_NODES; i++)
124 ret->num_alloc=MIN_NODES;
134 int sk_insert(STACK *st, char *data, int loc)
138 if(st == NULL) return 0;
139 if (st->num_alloc <= st->num+1)
141 s=(char **)Realloc((char *)st->data,
142 (unsigned int)sizeof(char *)*st->num_alloc*2);
148 if ((loc >= (int)st->num) || (loc < 0))
149 st->data[st->num]=data;
156 t=(char **)&(st->data[1]);
157 for (i=st->num; i>=loc; i--)
160 #ifdef undef /* no memmove on sunos :-( */
161 memmove( (char *)&(st->data[loc+1]),
162 (char *)&(st->data[loc]),
163 sizeof(char *)*(st->num-loc));
172 char *sk_delete_ptr(STACK *st, char *p)
176 for (i=0; i<st->num; i++)
177 if (st->data[i] == p)
178 return(sk_delete(st,i));
182 char *sk_delete(STACK *st, int loc)
187 if ((st == NULL) || (st->num == 0) || (loc < 0)
188 || (loc >= st->num)) return(NULL);
191 if (loc != st->num-1)
194 for (i=loc; i<j; i++)
195 st->data[i]=st->data[i+1];
196 /* In theory memcpy is not safe for this
197 * memcpy( &(st->data[loc]),
198 * &(st->data[loc+1]),
199 * sizeof(char *)*(st->num-loc-1));
206 int sk_find(STACK *st, char *data)
211 if(st == NULL) return -1;
213 if (st->comp == NULL)
215 for (i=0; i<st->num; i++)
216 if (st->data[i] == data)
221 if (data == NULL) return(-1);
222 comp_func=(int (*)())st->comp;
223 r=(char **)bsearch(&data,(char *)st->data,
224 st->num,sizeof(char *),FP_ICC comp_func);
225 if (r == NULL) return(-1);
228 if ((*st->comp)(&(st->data[i-1]),&data) < 0)
233 int sk_push(STACK *st, char *data)
235 return(sk_insert(st,data,st->num));
238 int sk_unshift(STACK *st, char *data)
240 return(sk_insert(st,data,0));
243 char *sk_shift(STACK *st)
245 if (st == NULL) return(NULL);
246 if (st->num <= 0) return(NULL);
247 return(sk_delete(st,0));
250 char *sk_pop(STACK *st)
252 if (st == NULL) return(NULL);
253 if (st->num <= 0) return(NULL);
254 return(sk_delete(st,st->num-1));
257 void sk_zero(STACK *st)
259 if (st == NULL) return;
260 if (st->num <= 0) return;
261 memset((char *)st->data,0,sizeof(st->data)*st->num);
265 void sk_pop_free(STACK *st, void (*func)())
269 if (st == NULL) return;
270 for (i=0; i<st->num; i++)
271 if (st->data[i] != NULL)
276 void sk_free(STACK *st)
278 if (st == NULL) return;
279 if (st->data != NULL) Free((char *)st->data);
283 int sk_num(STACK *st)
285 if(st == NULL) return -1;
289 char *sk_value(STACK *st, int i)
291 if(st == NULL) return NULL;
295 char *sk_set(STACK *st, int i, char *value)
297 if(st == NULL) return NULL;
298 return (st->data[i] = value);
301 void sk_sort(STACK *st)
307 comp_func=(int (*)())st->comp;
308 qsort(st->data,st->num,sizeof(char *),FP_ICC comp_func);