crypto/stack/stack.c

   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 const char *STACK_version="Stack" OPENSSL_VERSION_PTEXT;
  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 int (*sk_set_cmp_func(STACK *sk, int (*c)()))(void)
  86         {
  87         int (*old)()=sk->comp;
  88
  89         if (sk->comp != c)
  90                 sk->sorted=0;
  91         sk->comp=c;
  92
  93         return old;
  94         }
  95
  96 STACK *sk_dup(STACK *sk)
  97         {
  98         STACK *ret;
  99         char **s;
 100
 101         if ((ret=sk_new(sk->comp)) == NULL) goto err;
 102         s=(char **)Realloc((char *)ret->data,
 103                 (unsigned int)sizeof(char *)*sk->num_alloc);
 104         if (s == NULL) goto err;
 105         ret->data=s;
 106
 107         ret->num=sk->num;
 108         memcpy(ret->data,sk->data,sizeof(char *)*sk->num);
 109         ret->sorted=sk->sorted;
 110         ret->num_alloc=sk->num_alloc;
 111         ret->comp=sk->comp;
 112         return(ret);
 113 err:
 114         return(NULL);
 115         }
 116
 117 STACK *sk_new(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(STACK *st, char *data, int loc)
 140         {
 141         char **s;
 142
 143         if (st->num_alloc <= st->num+1)
 144                 {
 145                 s=(char **)Realloc((char *)st->data,
 146                         (unsigned int)sizeof(char *)*st->num_alloc*2);
 147                 if (s == NULL)
 148                         return(0);
 149                 st->data=s;
 150                 st->num_alloc*=2;
 151                 }
 152         if ((loc >= (int)st->num) || (loc < 0))
 153                 st->data[st->num]=data;
 154         else
 155                 {
 156                 int i;
 157                 char **f,**t;
 158
 159                 f=(char **)st->data;
 160                 t=(char **)&(st->data[1]);
 161                 for (i=st->num; i>=loc; i--)
 162                         t[i]=f[i];
 163
 164 #ifdef undef /* no memmove on sunos :-( */
 165                 memmove( (char *)&(st->data[loc+1]),
 166                         (char *)&(st->data[loc]),
 167                         sizeof(char *)*(st->num-loc));
 168 #endif
 169                 st->data[loc]=data;
 170                 }
 171         st->num++;
 172         st->sorted=0;
 173         return(st->num);
 174         }
 175
 176 char *sk_delete_ptr(STACK *st, char *p)
 177         {
 178         int i;
 179
 180         for (i=0; i<st->num; i++)
 181                 if (st->data[i] == p)
 182                         return(sk_delete(st,i));
 183         return(NULL);
 184         }
 185
 186 char *sk_delete(STACK *st, int loc)
 187         {
 188         char *ret;
 189         int i,j;
 190
 191         if ((st->num == 0) || (loc < 0) || (loc >= st->num)) return(NULL);
 192
 193         ret=st->data[loc];
 194         if (loc != st->num-1)
 195                 {
 196                 j=st->num-1;
 197                 for (i=loc; i<j; i++)
 198                         st->data[i]=st->data[i+1];
 199                 /* In theory memcpy is not safe for this
 200                  * memcpy( &(st->data[loc]),
 201                  *      &(st->data[loc+1]),
 202                  *      sizeof(char *)*(st->num-loc-1));
 203                  */
 204                 }
 205         st->num--;
 206         return(ret);
 207         }
 208
 209 int sk_find(STACK *st, char *data)
 210         {
 211         char **r;
 212         int i;
 213         int (*comp_func)();
 214
 215         if (st->comp == NULL)
 216                 {
 217                 for (i=0; i<st->num; i++)
 218                         if (st->data[i] == data)
 219                                 return(i);
 220                 return(-1);
 221                 }
 222         comp_func=(int (*)())st->comp;
 223         if (!st->sorted)
 224                 {
 225                 qsort((char *)st->data,st->num,sizeof(char *),FP_ICC comp_func);
 226                 st->sorted=1;
 227                 }
 228         if (data == NULL) return(-1);
 229         r=(char **)bsearch(&data,(char *)st->data,
 230                 st->num,sizeof(char *),FP_ICC comp_func);
 231         if (r == NULL) return(-1);
 232         i=(int)(r-st->data);
 233         for ( ; i>0; i--)
 234                 if ((*st->comp)(&(st->data[i-1]),&data) < 0)
 235                         break;
 236         return(i);
 237         }
 238
 239 int sk_push(STACK *st, char *data)
 240         {
 241         return(sk_insert(st,data,st->num));
 242         }
 243
 244 int sk_unshift(STACK *st, char *data)
 245         {
 246         return(sk_insert(st,data,0));
 247         }
 248
 249 char *sk_shift(STACK *st)
 250         {
 251         if (st == NULL) return(NULL);
 252         if (st->num <= 0) return(NULL);
 253         return(sk_delete(st,0));
 254         }
 255
 256 char *sk_pop(STACK *st)
 257         {
 258         if (st == NULL) return(NULL);
 259         if (st->num <= 0) return(NULL);
 260         return(sk_delete(st,st->num-1));
 261         }
 262
 263 void sk_zero(STACK *st)
 264         {
 265         if (st == NULL) return;
 266         if (st->num <= 0) return;
 267         memset((char *)st->data,0,sizeof(st->data)*st->num);
 268         st->num=0;
 269         }
 270
 271 void sk_pop_free(STACK *st, void (*func)())
 272         {
 273         int i;
 274
 275         if (st == NULL) return;
 276         for (i=0; i<st->num; i++)
 277                 if (st->data[i] != NULL)
 278                         func(st->data[i]);
 279         sk_free(st);
 280         }
 281
 282 void sk_free(STACK *st)
 283         {
 284         if (st == NULL) return;
 285         if (st->data != NULL) Free((char *)st->data);
 286         Free((char *)st);
 287         }
 288