stack.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334
  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. /* Code for stacks
  59. * Author - Eric Young v 1.0
  60. * 1.2 eay 12-Mar-97 - Modified sk_find so that it _DOES_ return the
  61. * lowest index for the searched item.
  62. *
  63. * 1.1 eay - Take from netdb and added to SSLeay
  64. *
  65. * 1.0 eay - First version 29/07/92
  66. */
  67. #include <stdio.h>
  68. #include "cryptlib.h"
  69. #include <openssl/stack.h>
  70. #include <openssl/objects.h>
  71. #undef MIN_NODES
  72. #define MIN_NODES 4
  73. const char STACK_version[]="Stack" OPENSSL_VERSION_PTEXT;
  74. #include <errno.h>
  75. int (*sk_set_cmp_func(_STACK *sk, int (*c)(const void *, const void *)))
  76. (const void *, const void *)
  77. {
  78. int (*old)(const void *,const void *)=sk->comp;
  79. if (sk->comp != c)
  80. sk->sorted=0;
  81. sk->comp=c;
  82. return old;
  83. }
  84. _STACK *sk_dup(_STACK *sk)
  85. {
  86. _STACK *ret;
  87. char **s;
  88. if ((ret=sk_new(sk->comp)) == NULL) goto err;
  89. s=(char **)OPENSSL_realloc((char *)ret->data,
  90. (unsigned int)sizeof(char *)*sk->num_alloc);
  91. if (s == NULL) goto err;
  92. ret->data=s;
  93. ret->num=sk->num;
  94. memcpy(ret->data,sk->data,sizeof(char *)*sk->num);
  95. ret->sorted=sk->sorted;
  96. ret->num_alloc=sk->num_alloc;
  97. ret->comp=sk->comp;
  98. return(ret);
  99. err:
  100. if(ret)
  101. sk_free(ret);
  102. return(NULL);
  103. }
  104. _STACK *sk_new_null(void)
  105. {
  106. return sk_new((int (*)(const void *, const void *))0);
  107. }
  108. _STACK *sk_new(int (*c)(const void *, const void *))
  109. {
  110. _STACK *ret;
  111. int i;
  112. if ((ret=OPENSSL_malloc(sizeof(_STACK))) == NULL)
  113. goto err;
  114. if ((ret->data=OPENSSL_malloc(sizeof(char *)*MIN_NODES)) == NULL)
  115. goto err;
  116. for (i=0; i<MIN_NODES; i++)
  117. ret->data[i]=NULL;
  118. ret->comp=c;
  119. ret->num_alloc=MIN_NODES;
  120. ret->num=0;
  121. ret->sorted=0;
  122. return(ret);
  123. err:
  124. if(ret)
  125. OPENSSL_free(ret);
  126. return(NULL);
  127. }
  128. int sk_insert(_STACK *st, void *data, int loc)
  129. {
  130. char **s;
  131. if(st == NULL) return 0;
  132. if (st->num_alloc <= st->num+1)
  133. {
  134. s=OPENSSL_realloc((char *)st->data,
  135. (unsigned int)sizeof(char *)*st->num_alloc*2);
  136. if (s == NULL)
  137. return(0);
  138. st->data=s;
  139. st->num_alloc*=2;
  140. }
  141. if ((loc >= (int)st->num) || (loc < 0))
  142. st->data[st->num]=data;
  143. else
  144. {
  145. int i;
  146. char **f,**t;
  147. f=st->data;
  148. t=&(st->data[1]);
  149. for (i=st->num; i>=loc; i--)
  150. t[i]=f[i];
  151. #ifdef undef /* no memmove on sunos :-( */
  152. memmove(&(st->data[loc+1]),
  153. &(st->data[loc]),
  154. sizeof(char *)*(st->num-loc));
  155. #endif
  156. st->data[loc]=data;
  157. }
  158. st->num++;
  159. st->sorted=0;
  160. return(st->num);
  161. }
  162. void *sk_delete_ptr(_STACK *st, void *p)
  163. {
  164. int i;
  165. for (i=0; i<st->num; i++)
  166. if (st->data[i] == p)
  167. return(sk_delete(st,i));
  168. return(NULL);
  169. }
  170. void *sk_delete(_STACK *st, int loc)
  171. {
  172. char *ret;
  173. int i,j;
  174. if(!st || (loc < 0) || (loc >= st->num)) return NULL;
  175. ret=st->data[loc];
  176. if (loc != st->num-1)
  177. {
  178. j=st->num-1;
  179. for (i=loc; i<j; i++)
  180. st->data[i]=st->data[i+1];
  181. /* In theory memcpy is not safe for this
  182. * memcpy( &(st->data[loc]),
  183. * &(st->data[loc+1]),
  184. * sizeof(char *)*(st->num-loc-1));
  185. */
  186. }
  187. st->num--;
  188. return(ret);
  189. }
  190. static int internal_find(_STACK *st, void *data, int ret_val_options)
  191. {
  192. const void * const *r;
  193. int i;
  194. if(st == NULL) return -1;
  195. if (st->comp == NULL)
  196. {
  197. for (i=0; i<st->num; i++)
  198. if (st->data[i] == data)
  199. return(i);
  200. return(-1);
  201. }
  202. sk_sort(st);
  203. if (data == NULL) return(-1);
  204. r=OBJ_bsearch_ex_(&data,st->data,st->num,sizeof(void *),st->comp,
  205. ret_val_options);
  206. if (r == NULL) return(-1);
  207. return (int)((char **)r-st->data);
  208. }
  209. int sk_find(_STACK *st, void *data)
  210. {
  211. return internal_find(st, data, OBJ_BSEARCH_FIRST_VALUE_ON_MATCH);
  212. }
  213. int sk_find_ex(_STACK *st, void *data)
  214. {
  215. return internal_find(st, data, OBJ_BSEARCH_VALUE_ON_NOMATCH);
  216. }
  217. int sk_push(_STACK *st, void *data)
  218. {
  219. return(sk_insert(st,data,st->num));
  220. }
  221. int sk_unshift(_STACK *st, void *data)
  222. {
  223. return(sk_insert(st,data,0));
  224. }
  225. void *sk_shift(_STACK *st)
  226. {
  227. if (st == NULL) return(NULL);
  228. if (st->num <= 0) return(NULL);
  229. return(sk_delete(st,0));
  230. }
  231. void *sk_pop(_STACK *st)
  232. {
  233. if (st == NULL) return(NULL);
  234. if (st->num <= 0) return(NULL);
  235. return(sk_delete(st,st->num-1));
  236. }
  237. void sk_zero(_STACK *st)
  238. {
  239. if (st == NULL) return;
  240. if (st->num <= 0) return;
  241. memset((char *)st->data,0,sizeof(st->data)*st->num);
  242. st->num=0;
  243. }
  244. void sk_pop_free(_STACK *st, void (*func)(void *))
  245. {
  246. int i;
  247. if (st == NULL) return;
  248. for (i=0; i<st->num; i++)
  249. if (st->data[i] != NULL)
  250. func(st->data[i]);
  251. sk_free(st);
  252. }
  253. void sk_free(_STACK *st)
  254. {
  255. if (st == NULL) return;
  256. if (st->data != NULL) OPENSSL_free(st->data);
  257. OPENSSL_free(st);
  258. }
  259. int sk_num(const _STACK *st)
  260. {
  261. if(st == NULL) return -1;
  262. return st->num;
  263. }
  264. void *sk_value(const _STACK *st, int i)
  265. {
  266. if(!st || (i < 0) || (i >= st->num)) return NULL;
  267. return st->data[i];
  268. }
  269. void *sk_set(_STACK *st, int i, void *value)
  270. {
  271. if(!st || (i < 0) || (i >= st->num)) return NULL;
  272. return (st->data[i] = value);
  273. }
  274. void sk_sort(_STACK *st)
  275. {
  276. if (st && !st->sorted)
  277. {
  278. int (*comp_func)(const void *,const void *);
  279. /* same comment as in sk_find ... previously st->comp was declared
  280. * as a (void*,void*) callback type, but this made the population
  281. * of the callback pointer illogical - our callbacks compare
  282. * type** with type**, so we leave the casting until absolutely
  283. * necessary (ie. "now"). */
  284. comp_func=(int (*)(const void *,const void *))(st->comp);
  285. qsort(st->data,st->num,sizeof(char *), comp_func);
  286. st->sorted=1;
  287. }
  288. }
  289. int sk_is_sorted(const _STACK *st)
  290. {
  291. if (!st)
  292. return 1;
  293. return st->sorted;
  294. }