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 /* Code for stacks 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. 63 * 64 * 1.1 eay - Take from netdb and added to SSLeay 65 * 66 * 1.0 eay - First version 29/07/92 67 */ 68 #include <stdio.h> 69 #include "cryptlib.h" 70 #include "stack.h" 71 72 #undef MIN_NODES 73 #define MIN_NODES 4 74 75 char *STACK_version="STACK part of SSLeay 0.9.0b 29-Jun-1998"; 76 77 #ifndef NOPROTO 78 #define FP_ICC (int (*)(const void *,const void *)) 79 #else 80 #define FP_ICC 81 #endif 82 83 #include <errno.h> 84 85 void sk_set_cmp_func(sk,c) 86 STACK *sk; 87 int (*c)(); 88 { 89 if (sk->comp != c) 90 sk->sorted=0; 91 sk->comp=c; 92 } 93 94 STACK *sk_dup(sk) 95 STACK *sk; 96 { 97 STACK *ret; 98 char **s; 99 100 if ((ret=sk_new(sk->comp)) == NULL) goto err; 101 s=(char **)Realloc((char *)ret->data, 102 (unsigned int)sizeof(char *)*sk->num_alloc); 103 if (s == NULL) 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 return(NULL); 114 } 115 116 STACK *sk_new(c) 117 int (*c)(); 118 { 119 STACK *ret; 120 int i; 121 122 if ((ret=(STACK *)Malloc(sizeof(STACK))) == NULL) 123 goto err0; 124 if ((ret->data=(char **)Malloc(sizeof(char *)*MIN_NODES)) == NULL) 125 goto err1; 126 for (i=0; i<MIN_NODES; i++) 127 ret->data[i]=NULL; 128 ret->comp=c; 129 ret->num_alloc=MIN_NODES; 130 ret->num=0; 131 ret->sorted=0; 132 return(ret); 133 err1: 134 Free((char *)ret); 135 err0: 136 return(NULL); 137 } 138 139 int sk_insert(st,data,loc) 140 STACK *st; 141 char *data; 142 int loc; 143 { 144 char **s; 145 146 if (st->num_alloc <= st->num+1) 147 { 148 s=(char **)Realloc((char *)st->data, 149 (unsigned int)sizeof(char *)*st->num_alloc*2); 150 if (s == NULL) 151 return(0); 152 st->data=s; 153 st->num_alloc*=2; 154 } 155 if ((loc >= (int)st->num) || (loc < 0)) 156 st->data[st->num]=data; 157 else 158 { 159 int i; 160 char **f,**t; 161 162 f=(char **)st->data; 163 t=(char **)&(st->data[1]); 164 for (i=st->num; i>loc; i--) 165 t[i]=f[i]; 166 167 #ifdef undef /* no memmove on sunos :-( */ 168 memmove( (char *)&(st->data[loc+1]), 169 (char *)&(st->data[loc]), 170 sizeof(char *)*(st->num-loc)); 171 #endif 172 st->data[loc]=data; 173 } 174 st->num++; 175 st->sorted=0; 176 return(st->num); 177 } 178 179 char *sk_delete_ptr(st,p) 180 STACK *st; 181 char *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 191 char *sk_delete(st,loc) 192 STACK *st; 193 int loc; 194 { 195 char *ret; 196 int i,j; 197 198 if ((st->num == 0) || (loc < 0) || (loc >= st->num)) return(NULL); 199 200 ret=st->data[loc]; 201 if (loc != st->num-1) 202 { 203 j=st->num-1; 204 for (i=loc; i<j; i++) 205 st->data[i]=st->data[i+1]; 206 /* In theory memcpy is not safe for this 207 * memcpy( &(st->data[loc]), 208 * &(st->data[loc+1]), 209 * sizeof(char *)*(st->num-loc-1)); 210 */ 211 } 212 st->num--; 213 return(ret); 214 } 215 216 int sk_find(st,data) 217 STACK *st; 218 char *data; 219 { 220 char **r; 221 int i; 222 int (*comp_func)(); 223 224 if (st->comp == NULL) 225 { 226 for (i=0; i<st->num; i++) 227 if (st->data[i] == data) 228 return(i); 229 return(-1); 230 } 231 comp_func=(int (*)())st->comp; 232 if (!st->sorted) 233 { 234 qsort((char *)st->data,st->num,sizeof(char *),FP_ICC comp_func); 235 st->sorted=1; 236 } 237 if (data == NULL) return(-1); 238 r=(char **)bsearch(&data,(char *)st->data, 239 st->num,sizeof(char *),FP_ICC comp_func); 240 if (r == NULL) return(-1); 241 i=(int)(r-st->data); 242 for ( ; i>0; i--) 243 if ((*st->comp)(&(st->data[i-1]),&data) < 0) 244 break; 245 return(i); 246 } 247 248 int sk_push(st,data) 249 STACK *st; 250 char *data; 251 { 252 return(sk_insert(st,data,st->num)); 253 } 254 255 int sk_unshift(st,data) 256 STACK *st; 257 char *data; 258 { 259 return(sk_insert(st,data,0)); 260 } 261 262 char *sk_shift(st) 263 STACK *st; 264 { 265 if (st == NULL) return(NULL); 266 if (st->num <= 0) return(NULL); 267 return(sk_delete(st,0)); 268 } 269 270 char *sk_pop(st) 271 STACK *st; 272 { 273 if (st == NULL) return(NULL); 274 if (st->num <= 0) return(NULL); 275 return(sk_delete(st,st->num-1)); 276 } 277 278 void sk_zero(st) 279 STACK *st; 280 { 281 if (st == NULL) return; 282 if (st->num <= 0) return; 283 memset((char *)st->data,0,sizeof(st->data)*st->num); 284 st->num=0; 285 } 286 287 void sk_pop_free(st,func) 288 STACK *st; 289 void (*func)(); 290 { 291 int i; 292 293 if (st == NULL) return; 294 for (i=0; i<st->num; i++) 295 if (st->data[i] != NULL) 296 func(st->data[i]); 297 sk_free(st); 298 } 299 300 void sk_free(st) 301 STACK *st; 302 { 303 if (st == NULL) return; 304 if (st->data != NULL) Free((char *)st->data); 305 Free((char *)st); 306 } 307 308