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 searched 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>
71 #include <openssl/objects.h>
76 const char STACK_version
[]="Stack" OPENSSL_VERSION_PTEXT
;
80 int (*sk_set_cmp_func(_STACK
*sk
, int (*c
)(const void *, const void *)))
81 (const void *, const void *)
83 int (*old
)(const void *,const void *)=sk
->comp
;
92 _STACK
*sk_dup(_STACK
*sk
)
97 if ((ret
=sk_new(sk
->comp
)) == NULL
) goto err
;
98 s
=(char **)OPENSSL_realloc((char *)ret
->data
,
99 (unsigned int)sizeof(char *)*sk
->num_alloc
);
100 if (s
== NULL
) goto err
;
104 memcpy(ret
->data
,sk
->data
,sizeof(char *)*sk
->num
);
105 ret
->sorted
=sk
->sorted
;
106 ret
->num_alloc
=sk
->num_alloc
;
115 _STACK
*sk_deep_copy(_STACK
*sk
, void *(*copy_func
)(void *),
116 void (*free_func
)(void *))
121 if ((ret
= OPENSSL_malloc(sizeof(_STACK
))) == NULL
)
123 ret
->comp
= sk
->comp
;
124 ret
->sorted
= sk
->sorted
;
126 ret
->num_alloc
= sk
->num
> MIN_NODES
? sk
->num
: MIN_NODES
;
127 ret
->data
= OPENSSL_malloc(sizeof(char *) * ret
->num_alloc
);
128 if (ret
->data
== NULL
)
133 for (i
= 0; i
< ret
->num_alloc
; i
++)
136 for (i
= 0; i
< ret
->num
; ++i
)
138 if (sk
->data
[i
] == NULL
)
140 if ((ret
->data
[i
] = copy_func(sk
->data
[i
])) == NULL
)
143 if (ret
->data
[i
] != NULL
)
144 free_func(ret
->data
[i
]);
152 _STACK
*sk_new_null(void)
154 return sk_new((int (*)(const void *, const void *))0);
157 _STACK
*sk_new(int (*c
)(const void *, const void *))
162 if ((ret
=OPENSSL_malloc(sizeof(_STACK
))) == NULL
)
164 if ((ret
->data
=OPENSSL_malloc(sizeof(char *)*MIN_NODES
)) == NULL
)
166 for (i
=0; i
<MIN_NODES
; i
++)
169 ret
->num_alloc
=MIN_NODES
;
179 int sk_insert(_STACK
*st
, void *data
, int loc
)
183 if(st
== NULL
) return 0;
184 if (st
->num_alloc
<= st
->num
+1)
186 s
=OPENSSL_realloc((char *)st
->data
,
187 (unsigned int)sizeof(char *)*st
->num_alloc
*2);
193 if ((loc
>= (int)st
->num
) || (loc
< 0))
194 st
->data
[st
->num
]=data
;
202 for (i
=st
->num
; i
>=loc
; i
--)
205 #ifdef undef /* no memmove on sunos :-( */
206 memmove(&(st
->data
[loc
+1]),
208 sizeof(char *)*(st
->num
-loc
));
217 void *sk_delete_ptr(_STACK
*st
, void *p
)
221 for (i
=0; i
<st
->num
; i
++)
222 if (st
->data
[i
] == p
)
223 return(sk_delete(st
,i
));
227 void *sk_delete(_STACK
*st
, int loc
)
232 if(!st
|| (loc
< 0) || (loc
>= st
->num
)) return NULL
;
235 if (loc
!= st
->num
-1)
238 for (i
=loc
; i
<j
; i
++)
239 st
->data
[i
]=st
->data
[i
+1];
240 /* In theory memcpy is not safe for this
241 * memcpy( &(st->data[loc]),
242 * &(st->data[loc+1]),
243 * sizeof(char *)*(st->num-loc-1));
250 static int internal_find(_STACK
*st
, void *data
, int ret_val_options
)
252 const void * const *r
;
255 if(st
== NULL
) return -1;
257 if (st
->comp
== NULL
)
259 for (i
=0; i
<st
->num
; i
++)
260 if (st
->data
[i
] == data
)
265 if (data
== NULL
) return(-1);
266 r
=OBJ_bsearch_ex_(&data
,st
->data
,st
->num
,sizeof(void *),st
->comp
,
268 if (r
== NULL
) return(-1);
269 return (int)((char **)r
-st
->data
);
272 int sk_find(_STACK
*st
, void *data
)
274 return internal_find(st
, data
, OBJ_BSEARCH_FIRST_VALUE_ON_MATCH
);
276 int sk_find_ex(_STACK
*st
, void *data
)
278 return internal_find(st
, data
, OBJ_BSEARCH_VALUE_ON_NOMATCH
);
281 int sk_push(_STACK
*st
, void *data
)
283 return(sk_insert(st
,data
,st
->num
));
286 int sk_unshift(_STACK
*st
, void *data
)
288 return(sk_insert(st
,data
,0));
291 void *sk_shift(_STACK
*st
)
293 if (st
== NULL
) return(NULL
);
294 if (st
->num
<= 0) return(NULL
);
295 return(sk_delete(st
,0));
298 void *sk_pop(_STACK
*st
)
300 if (st
== NULL
) return(NULL
);
301 if (st
->num
<= 0) return(NULL
);
302 return(sk_delete(st
,st
->num
-1));
305 void sk_zero(_STACK
*st
)
307 if (st
== NULL
) return;
308 if (st
->num
<= 0) return;
309 memset((char *)st
->data
,0,sizeof(st
->data
)*st
->num
);
313 void sk_pop_free(_STACK
*st
, void (*func
)(void *))
317 if (st
== NULL
) return;
318 for (i
=0; i
<st
->num
; i
++)
319 if (st
->data
[i
] != NULL
)
324 void sk_free(_STACK
*st
)
326 if (st
== NULL
) return;
327 if (st
->data
!= NULL
) OPENSSL_free(st
->data
);
331 int sk_num(const _STACK
*st
)
333 if(st
== NULL
) return -1;
337 void *sk_value(const _STACK
*st
, int i
)
339 if(!st
|| (i
< 0) || (i
>= st
->num
)) return NULL
;
343 void *sk_set(_STACK
*st
, int i
, void *value
)
345 if(!st
|| (i
< 0) || (i
>= st
->num
)) return NULL
;
346 return (st
->data
[i
] = value
);
349 void sk_sort(_STACK
*st
)
351 if (st
&& !st
->sorted
)
353 int (*comp_func
)(const void *,const void *);
355 /* same comment as in sk_find ... previously st->comp was declared
356 * as a (void*,void*) callback type, but this made the population
357 * of the callback pointer illogical - our callbacks compare
358 * type** with type**, so we leave the casting until absolutely
359 * necessary (ie. "now"). */
360 comp_func
=(int (*)(const void *,const void *))(st
->comp
);
361 qsort(st
->data
,st
->num
,sizeof(char *), comp_func
);
366 int sk_is_sorted(const _STACK
*st
)