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 "internal/numbers.h"
13 #include <openssl/stack.h>
14 #include <openssl/objects.h>
21 OPENSSL_sk_compfunc comp;
29 OPENSSL_sk_compfunc OPENSSL_sk_set_cmp_func(OPENSSL_STACK *sk, OPENSSL_sk_compfunc c)
31 OPENSSL_sk_compfunc old = sk->comp;
40 OPENSSL_STACK *OPENSSL_sk_dup(const OPENSSL_STACK *sk)
47 if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL)
50 /* direct structure assignment */
53 if ((ret->data = OPENSSL_malloc(sizeof(*ret->data) * sk->num_alloc)) == NULL)
55 memcpy(ret->data, sk->data, sizeof(char *) * sk->num);
62 OPENSSL_STACK *OPENSSL_sk_deep_copy(const OPENSSL_STACK *sk,
63 OPENSSL_sk_copyfunc copy_func,
64 OPENSSL_sk_freefunc free_func)
72 if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL)
75 /* direct structure assignment */
78 ret->num_alloc = sk->num > MIN_NODES ? (size_t)sk->num : MIN_NODES;
79 ret->data = OPENSSL_zalloc(sizeof(*ret->data) * ret->num_alloc);
80 if (ret->data == NULL) {
85 for (i = 0; i < ret->num; ++i) {
86 if (sk->data[i] == NULL)
88 if ((ret->data[i] = copy_func(sk->data[i])) == NULL) {
90 if (ret->data[i] != NULL)
91 free_func((void *)ret->data[i]);
99 OPENSSL_STACK *OPENSSL_sk_new_null(void)
101 return OPENSSL_sk_new((OPENSSL_sk_compfunc)NULL);
104 OPENSSL_STACK *OPENSSL_sk_new(OPENSSL_sk_compfunc c)
108 if ((ret = OPENSSL_zalloc(sizeof(*ret))) == NULL)
110 if ((ret->data = OPENSSL_zalloc(sizeof(*ret->data) * MIN_NODES)) == NULL)
113 ret->num_alloc = MIN_NODES;
121 int OPENSSL_sk_insert(OPENSSL_STACK *st, const void *data, int loc)
123 if (st == NULL || st->num < 0 || st->num == INT_MAX) {
127 if (st->num_alloc <= (size_t)(st->num + 1)) {
128 size_t doub_num_alloc = st->num_alloc * 2;
130 /* Overflow checks */
131 if (doub_num_alloc < st->num_alloc)
134 /* Avoid overflow due to multiplication by sizeof(char *) */
135 if (doub_num_alloc > SIZE_MAX / sizeof(char *))
138 st->data = OPENSSL_realloc((char *)st->data,
139 sizeof(char *) * doub_num_alloc);
140 if (st->data == NULL) {
142 * Reset these counters to prevent subsequent operations on
143 * (now non-existing) heap memory
149 st->num_alloc = doub_num_alloc;
151 if ((loc >= st->num) || (loc < 0)) {
152 st->data[st->num] = data;
154 memmove(&st->data[loc + 1], &st->data[loc],
155 sizeof(st->data[0]) * (st->num - loc));
156 st->data[loc] = data;
163 void *OPENSSL_sk_delete_ptr(OPENSSL_STACK *st, const void *p)
167 for (i = 0; i < st->num; i++)
168 if (st->data[i] == p)
169 return OPENSSL_sk_delete(st, i);
173 void *OPENSSL_sk_delete(OPENSSL_STACK *st, int loc)
177 if (st == NULL || loc < 0 || loc >= st->num)
181 if (loc != st->num - 1)
182 memmove(&st->data[loc], &st->data[loc + 1],
183 sizeof(st->data[0]) * (st->num - loc - 1));
188 static int internal_find(OPENSSL_STACK *st, const void *data,
197 if (st->comp == NULL) {
198 for (i = 0; i < st->num; i++)
199 if (st->data[i] == data)
206 r = OBJ_bsearch_ex_(&data, st->data, st->num, sizeof(void *), st->comp,
210 return (int)((const char **)r - st->data);
213 int OPENSSL_sk_find(OPENSSL_STACK *st, const void *data)
215 return internal_find(st, data, OBJ_BSEARCH_FIRST_VALUE_ON_MATCH);
218 int OPENSSL_sk_find_ex(OPENSSL_STACK *st, const void *data)
220 return internal_find(st, data, OBJ_BSEARCH_VALUE_ON_NOMATCH);
223 int OPENSSL_sk_push(OPENSSL_STACK *st, const void *data)
225 return (OPENSSL_sk_insert(st, data, st->num));
228 int OPENSSL_sk_unshift(OPENSSL_STACK *st, const void *data)
230 return (OPENSSL_sk_insert(st, data, 0));
233 void *OPENSSL_sk_shift(OPENSSL_STACK *st)
239 return (OPENSSL_sk_delete(st, 0));
242 void *OPENSSL_sk_pop(OPENSSL_STACK *st)
248 return (OPENSSL_sk_delete(st, st->num - 1));
251 void OPENSSL_sk_zero(OPENSSL_STACK *st)
257 memset(st->data, 0, sizeof(*st->data) * st->num);
261 void OPENSSL_sk_pop_free(OPENSSL_STACK *st, OPENSSL_sk_freefunc func)
267 for (i = 0; i < st->num; i++)
268 if (st->data[i] != NULL)
269 func((char *)st->data[i]);
273 void OPENSSL_sk_free(OPENSSL_STACK *st)
277 OPENSSL_free(st->data);
281 int OPENSSL_sk_num(const OPENSSL_STACK *st)
288 void *OPENSSL_sk_value(const OPENSSL_STACK *st, int i)
290 if (st == NULL || i < 0 || i >= st->num)
292 return (void *)st->data[i];
295 void *OPENSSL_sk_set(OPENSSL_STACK *st, int i, const void *data)
297 if (st == NULL || i < 0 || i >= st->num)
300 return (void *)st->data[i];
303 void OPENSSL_sk_sort(OPENSSL_STACK *st)
305 if (st && !st->sorted && st->comp != NULL) {
306 qsort(st->data, st->num, sizeof(char *), st->comp);
311 int OPENSSL_sk_is_sorted(const OPENSSL_STACK *st)