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