2 * Copyright 1995-2017 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>
16 #include <openssl/e_os2.h> /* For ossl_inline */
19 * The initial number of nodes in the array.
21 static const int min_nodes = 4;
22 static const int max_nodes = SIZE_MAX / sizeof(void *) < INT_MAX
23 ? (int)(SIZE_MAX / sizeof(void *))
31 OPENSSL_sk_compfunc comp;
34 OPENSSL_sk_compfunc OPENSSL_sk_set_cmp_func(OPENSSL_STACK *sk, OPENSSL_sk_compfunc c)
36 OPENSSL_sk_compfunc old = sk->comp;
45 OPENSSL_STACK *OPENSSL_sk_dup(const OPENSSL_STACK *sk)
52 if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL)
55 /* direct structure assignment */
58 if ((ret->data = OPENSSL_malloc(sizeof(*ret->data) * sk->num_alloc)) == NULL)
60 memcpy(ret->data, sk->data, sizeof(void *) * sk->num);
67 OPENSSL_STACK *OPENSSL_sk_deep_copy(const OPENSSL_STACK *sk,
68 OPENSSL_sk_copyfunc copy_func,
69 OPENSSL_sk_freefunc free_func)
77 if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL)
80 /* direct structure assignment */
83 ret->num_alloc = sk->num > min_nodes ? sk->num : min_nodes;
84 ret->data = OPENSSL_zalloc(sizeof(*ret->data) * ret->num_alloc);
85 if (ret->data == NULL) {
90 for (i = 0; i < ret->num; ++i) {
91 if (sk->data[i] == NULL)
93 if ((ret->data[i] = copy_func(sk->data[i])) == NULL) {
95 if (ret->data[i] != NULL)
96 free_func((void *)ret->data[i]);
104 OPENSSL_STACK *OPENSSL_sk_new_null(void)
106 return OPENSSL_sk_new((OPENSSL_sk_compfunc)NULL);
109 OPENSSL_STACK *OPENSSL_sk_new(OPENSSL_sk_compfunc c)
113 if ((ret = OPENSSL_zalloc(sizeof(*ret))) == NULL)
115 if ((ret->data = OPENSSL_zalloc(sizeof(*ret->data) * min_nodes)) == NULL)
118 ret->num_alloc = min_nodes;
127 * Calculate the array growth based on the target size.
129 * The growth faction is a rational number and is defined by a numerator
130 * and a denominator. According to Andrew Koenig in his paper "Why Are
131 * Vectors Efficient?" from JOOP 11(5) 1998, this factor should be less
132 * than the golden ratio (1.618...).
134 * We use 3/2 = 1.5 for simplicty of calculation and overflow checking.
135 * Another option 8/5 = 1.6 allows for slightly faster growth, although safe
136 * computation is more difficult.
138 * The limit to avoid overflow is spot on. The modulo three correction term
139 * ensures that the limit is the largest number than can be expanded by the
140 * growth factor without exceeding the hard limit.
142 static ossl_inline int compute_growth(int target, int current)
144 const int limit = (max_nodes / 3) * 2 + (max_nodes % 3 ? 1 : 0);
146 while (current < target) {
147 /* Check to see if we're at the hard limit */
148 if (current >= max_nodes)
151 /* Expand the size by a factor of 3/2 if it is within range */
152 current = current < limit ? current + current / 2 : max_nodes;
157 static int sk_reserve(OPENSSL_STACK *st, int n, int exact)
159 const void **tmpdata;
162 /* Check to see the reservation isn't exceeding the hard limit */
163 if (n > max_nodes - st->num)
166 /* Figure out the new size */
167 num_alloc = st->num + n;
168 if (num_alloc < min_nodes)
169 num_alloc = min_nodes;
172 if (num_alloc <= st->num_alloc)
174 num_alloc = compute_growth(num_alloc, st->num_alloc);
177 } else if (num_alloc == st->num_alloc) {
181 tmpdata = OPENSSL_realloc((void *)st->data, sizeof(void *) * num_alloc);
186 st->num_alloc = num_alloc;
190 int OPENSSL_sk_reserve(OPENSSL_STACK *st, int n)
192 if (st == NULL || st->num < 0)
197 return sk_reserve(st, n, 1);
200 int OPENSSL_sk_insert(OPENSSL_STACK *st, const void *data, int loc)
202 if (st == NULL || st->num < 0 || st->num == max_nodes)
205 if (!sk_reserve(st, 1, 0))
208 if ((loc >= st->num) || (loc < 0)) {
209 st->data[st->num] = data;
211 memmove(&st->data[loc + 1], &st->data[loc],
212 sizeof(st->data[0]) * (st->num - loc));
213 st->data[loc] = data;
220 void *OPENSSL_sk_delete_ptr(OPENSSL_STACK *st, const void *p)
224 for (i = 0; i < st->num; i++)
225 if (st->data[i] == p)
226 return OPENSSL_sk_delete(st, i);
230 void *OPENSSL_sk_delete(OPENSSL_STACK *st, int loc)
234 if (st == NULL || loc < 0 || loc >= st->num)
238 if (loc != st->num - 1)
239 memmove(&st->data[loc], &st->data[loc + 1],
240 sizeof(st->data[0]) * (st->num - loc - 1));
245 static int internal_find(OPENSSL_STACK *st, const void *data,
254 if (st->comp == NULL) {
255 for (i = 0; i < st->num; i++)
256 if (st->data[i] == data)
263 r = OBJ_bsearch_ex_(&data, st->data, st->num, sizeof(void *), st->comp,
267 return (int)((const void **)r - st->data);
270 int OPENSSL_sk_find(OPENSSL_STACK *st, const void *data)
272 return internal_find(st, data, OBJ_BSEARCH_FIRST_VALUE_ON_MATCH);
275 int OPENSSL_sk_find_ex(OPENSSL_STACK *st, const void *data)
277 return internal_find(st, data, OBJ_BSEARCH_VALUE_ON_NOMATCH);
280 int OPENSSL_sk_push(OPENSSL_STACK *st, const void *data)
282 return (OPENSSL_sk_insert(st, data, st->num));
285 int OPENSSL_sk_unshift(OPENSSL_STACK *st, const void *data)
287 return (OPENSSL_sk_insert(st, data, 0));
290 void *OPENSSL_sk_shift(OPENSSL_STACK *st)
296 return (OPENSSL_sk_delete(st, 0));
299 void *OPENSSL_sk_pop(OPENSSL_STACK *st)
305 return (OPENSSL_sk_delete(st, st->num - 1));
308 void OPENSSL_sk_zero(OPENSSL_STACK *st)
314 memset(st->data, 0, sizeof(*st->data) * st->num);
318 void OPENSSL_sk_pop_free(OPENSSL_STACK *st, OPENSSL_sk_freefunc func)
324 for (i = 0; i < st->num; i++)
325 if (st->data[i] != NULL)
326 func((char *)st->data[i]);
330 void OPENSSL_sk_free(OPENSSL_STACK *st)
334 OPENSSL_free(st->data);
338 int OPENSSL_sk_num(const OPENSSL_STACK *st)
345 void *OPENSSL_sk_value(const OPENSSL_STACK *st, int i)
347 if (st == NULL || i < 0 || i >= st->num)
349 return (void *)st->data[i];
352 void *OPENSSL_sk_set(OPENSSL_STACK *st, int i, const void *data)
354 if (st == NULL || i < 0 || i >= st->num)
357 return (void *)st->data[i];
360 void OPENSSL_sk_sort(OPENSSL_STACK *st)
362 if (st && !st->sorted && st->comp != NULL) {
363 qsort(st->data, st->num, sizeof(void *), st->comp);
368 int OPENSSL_sk_is_sorted(const OPENSSL_STACK *st)