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)
42 if ( sk->num_alloc < 0 || sk->num < 0 ) {
46 if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL)
49 /* direct structure assignment */
52 if ((ret->data = OPENSSL_malloc(sizeof(*ret->data) * sk->num_alloc)) == NULL)
54 memcpy(ret->data, sk->data, sizeof(char *) * sk->num);
61 OPENSSL_STACK *OPENSSL_sk_deep_copy(const OPENSSL_STACK *sk,
62 OPENSSL_sk_copyfunc copy_func,
63 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 ? 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 || st->num_alloc < 0 ) {
127 if (st->num_alloc <= st->num + 1) {
129 /* Overflow checks by Guido
130 * Cast to size_t to avoid triggering -ftrapv via overflow of st->num_alloc
132 if ( (size_t)(st->num_alloc) * 2 < (size_t)(st->num_alloc) ) {
136 if ( (size_t)(st->num_alloc) * 2 > INT_MAX )
141 /* Avond overflow due to multiplication by sizeof(char*) */
142 if ( (size_t)(st->num_alloc) * 2 > (~(size_t)0) / sizeof(char*) ) {
146 /* Remove cast to unsigned int to avoid undersized allocations on > 32 bit. */
147 st->data = OPENSSL_realloc((char *)st->data,
148 sizeof(char *) * st->num_alloc * 2);
149 if (st->data == NULL) {
150 /* Reset these counters to prevent subsequent operations on
151 * (now non-existing) heap memory
159 if ((loc >= (int)st->num) || (loc < 0))
160 st->data[st->num] = data;
162 if ( loc == INT_MAX ) {
165 memmove(&st->data[loc + 1], &st->data[loc],
166 sizeof(st->data[0]) * (st->num - loc));
167 st->data[loc] = data;
174 void *OPENSSL_sk_delete_ptr(OPENSSL_STACK *st, const void *p)
178 for (i = 0; i < st->num; i++)
179 if (st->data[i] == p)
180 return OPENSSL_sk_delete(st, i);
184 void *OPENSSL_sk_delete(OPENSSL_STACK *st, int loc)
188 if (st == NULL || loc < 0 || loc >= st->num )
192 if (loc != st->num - 1)
193 memmove(&st->data[loc], &st->data[loc + 1],
194 sizeof(st->data[0]) * (st->num - loc - 1));
199 static int internal_find(OPENSSL_STACK *st, const void *data,
208 if (st->comp == NULL) {
209 for (i = 0; i < st->num; i++)
210 if (st->data[i] == data)
217 r = OBJ_bsearch_ex_(&data, st->data, st->num, sizeof(void *), st->comp,
221 return (int)((const char **)r - st->data);
224 int OPENSSL_sk_find(OPENSSL_STACK *st, const void *data)
226 return internal_find(st, data, OBJ_BSEARCH_FIRST_VALUE_ON_MATCH);
229 int OPENSSL_sk_find_ex(OPENSSL_STACK *st, const void *data)
231 return internal_find(st, data, OBJ_BSEARCH_VALUE_ON_NOMATCH);
234 int OPENSSL_sk_push(OPENSSL_STACK *st, const void *data)
236 return (OPENSSL_sk_insert(st, data, st->num));
239 int OPENSSL_sk_unshift(OPENSSL_STACK *st, const void *data)
241 return (OPENSSL_sk_insert(st, data, 0));
244 void *OPENSSL_sk_shift(OPENSSL_STACK *st)
250 return (OPENSSL_sk_delete(st, 0));
253 void *OPENSSL_sk_pop(OPENSSL_STACK *st)
259 return (OPENSSL_sk_delete(st, st->num - 1));
262 void OPENSSL_sk_zero(OPENSSL_STACK *st)
268 memset(st->data, 0, sizeof(*st->data) * st->num);
272 void OPENSSL_sk_pop_free(OPENSSL_STACK *st, OPENSSL_sk_freefunc func)
278 for (i = 0; i < st->num; i++)
279 if (st->data[i] != NULL)
280 func((char *)st->data[i]);
284 void OPENSSL_sk_free(OPENSSL_STACK *st)
288 OPENSSL_free(st->data);
292 int OPENSSL_sk_num(const OPENSSL_STACK *st)
299 void *OPENSSL_sk_value(const OPENSSL_STACK *st, int i)
301 if (st == NULL || i < 0 || i >= st->num)
303 return (void *)st->data[i];
306 void *OPENSSL_sk_set(OPENSSL_STACK *st, int i, const void *data)
308 if (st == NULL || i < 0 || i >= st->num)
311 return (void *)st->data[i];
314 void OPENSSL_sk_sort(OPENSSL_STACK *st)
316 if (st && !st->sorted && st->comp != NULL) {
317 qsort(st->data, st->num, sizeof(char *), st->comp);
322 int OPENSSL_sk_is_sorted(const OPENSSL_STACK *st)