2 * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.
4 * Licensed under the OpenSSL license (the "License"). You may not use
5 * this file except in compliance with the License. You can obtain a copy
6 * in the file LICENSE in the source distribution or at
7 * https://www.openssl.org/source/license.html
11 #include "internal/cryptlib.h"
12 #include <openssl/stack.h>
13 #include <openssl/objects.h>
20 OPENSSL_sk_compfunc comp;
28 OPENSSL_sk_compfunc OPENSSL_sk_set_cmp_func(OPENSSL_STACK *sk, OPENSSL_sk_compfunc c)
30 OPENSSL_sk_compfunc old = sk->comp;
39 OPENSSL_STACK *OPENSSL_sk_dup(const OPENSSL_STACK *sk)
43 if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL)
46 /* direct structure assignment */
49 if ((ret->data = OPENSSL_malloc(sizeof(*ret->data) * sk->num_alloc)) == NULL)
51 memcpy(ret->data, sk->data, sizeof(char *) * sk->num);
58 OPENSSL_STACK *OPENSSL_sk_deep_copy(const OPENSSL_STACK *sk,
59 OPENSSL_sk_copyfunc copy_func,
60 OPENSSL_sk_freefunc free_func)
65 if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL)
68 /* direct structure assignment */
71 ret->num_alloc = sk->num > MIN_NODES ? sk->num : MIN_NODES;
72 ret->data = OPENSSL_zalloc(sizeof(*ret->data) * ret->num_alloc);
73 if (ret->data == NULL) {
78 for (i = 0; i < ret->num; ++i) {
79 if (sk->data[i] == NULL)
81 if ((ret->data[i] = copy_func(sk->data[i])) == NULL) {
83 if (ret->data[i] != NULL)
84 free_func(ret->data[i]);
92 OPENSSL_STACK *OPENSSL_sk_new_null(void)
94 return OPENSSL_sk_new((OPENSSL_sk_compfunc)NULL);
97 OPENSSL_STACK *OPENSSL_sk_new(OPENSSL_sk_compfunc c)
101 if ((ret = OPENSSL_zalloc(sizeof(*ret))) == NULL)
103 if ((ret->data = OPENSSL_zalloc(sizeof(*ret->data) * MIN_NODES)) == NULL)
106 ret->num_alloc = MIN_NODES;
114 int OPENSSL_sk_insert(OPENSSL_STACK *st, void *data, int loc)
120 if (st->num_alloc <= st->num + 1) {
121 s = OPENSSL_realloc((char *)st->data,
122 (unsigned int)sizeof(char *) * st->num_alloc * 2);
128 if ((loc >= (int)st->num) || (loc < 0))
129 st->data[st->num] = data;
131 memmove(&(st->data[loc + 1]),
132 &(st->data[loc]), sizeof(char *) * (st->num - loc));
133 st->data[loc] = data;
140 void *OPENSSL_sk_delete_ptr(OPENSSL_STACK *st, const void *p)
144 for (i = 0; i < st->num; i++)
145 if (st->data[i] == p)
146 return OPENSSL_sk_delete(st, i);
150 void *OPENSSL_sk_delete(OPENSSL_STACK *st, int loc)
155 if (st == NULL || loc < 0 || loc >= st->num)
159 if (loc != st->num - 1) {
161 for (i = loc; i < j; i++)
162 st->data[i] = st->data[i + 1];
164 * In theory memcpy is not safe for this memcpy( &(st->data[loc]),
165 * &(st->data[loc+1]), sizeof(char *)*(st->num-loc-1));
172 static int internal_find(OPENSSL_STACK *st, const void *data,
175 const void *const *r;
181 if (st->comp == NULL) {
182 for (i = 0; i < st->num; i++)
183 if (st->data[i] == data)
190 r = OBJ_bsearch_ex_(&data, st->data, st->num, sizeof(void *), st->comp,
194 return (int)((char **)r - st->data);
197 int OPENSSL_sk_find(OPENSSL_STACK *st, const void *data)
199 return internal_find(st, data, OBJ_BSEARCH_FIRST_VALUE_ON_MATCH);
202 int OPENSSL_sk_find_ex(OPENSSL_STACK *st, const void *data)
204 return internal_find(st, data, OBJ_BSEARCH_VALUE_ON_NOMATCH);
207 int OPENSSL_sk_push(OPENSSL_STACK *st, void *data)
209 return (OPENSSL_sk_insert(st, data, st->num));
212 int OPENSSL_sk_unshift(OPENSSL_STACK *st, void *data)
214 return (OPENSSL_sk_insert(st, data, 0));
217 void *OPENSSL_sk_shift(OPENSSL_STACK *st)
223 return (OPENSSL_sk_delete(st, 0));
226 void *OPENSSL_sk_pop(OPENSSL_STACK *st)
232 return (OPENSSL_sk_delete(st, st->num - 1));
235 void OPENSSL_sk_zero(OPENSSL_STACK *st)
241 memset(st->data, 0, sizeof(*st->data) * st->num);
245 void OPENSSL_sk_pop_free(OPENSSL_STACK *st, OPENSSL_sk_freefunc func)
251 for (i = 0; i < st->num; i++)
252 if (st->data[i] != NULL)
257 void OPENSSL_sk_free(OPENSSL_STACK *st)
261 OPENSSL_free(st->data);
265 int OPENSSL_sk_num(const OPENSSL_STACK *st)
272 void *OPENSSL_sk_value(const OPENSSL_STACK *st, int i)
274 if (st == NULL || i < 0 || i >= st->num)
279 void *OPENSSL_sk_set(OPENSSL_STACK *st, int i, void *value)
281 if (st == NULL || i < 0 || i >= st->num)
283 return (st->data[i] = value);
286 void OPENSSL_sk_sort(OPENSSL_STACK *st)
288 if (st && !st->sorted && st->comp != NULL) {
289 qsort(st->data, st->num, sizeof(char *), st->comp);
294 int OPENSSL_sk_is_sorted(const OPENSSL_STACK *st)