/src/openssl36/crypto/stack/stack.c

Source
/*
 * Copyright 1995-2025 The OpenSSL Project Authors. All Rights Reserved.
 *
 * Licensed under the Apache License 2.0 (the "License").  You may not use
 * this file except in compliance with the License.  You can obtain a copy
 * in the file LICENSE in the source distribution or at
 * https://www.openssl.org/source/license.html
 */

#include <stdio.h>
#include "internal/cryptlib.h"
#include "internal/numbers.h"
#include "internal/safe_math.h"
#include <openssl/stack.h>
#include <errno.h>
#include <openssl/e_os2.h> /* For ossl_inline */

OSSL_SAFE_MATH_SIGNED(int, int)

/*
 * The initial number of nodes in the array.
 */
static const int min_nodes = 4;
static const int max_nodes = SIZE_MAX / sizeof(void *) < INT_MAX
    ? (int)(SIZE_MAX / sizeof(void *))
    : INT_MAX;

struct stack_st {
    int num;
    const void **data;
    int sorted;
    int num_alloc;
    OPENSSL_sk_compfunc comp;
    OPENSSL_sk_freefunc_thunk free_thunk;
};

OPENSSL_sk_compfunc OPENSSL_sk_set_cmp_func(OPENSSL_STACK *sk,
    OPENSSL_sk_compfunc c)
{
    OPENSSL_sk_compfunc old = sk->comp;

    if (sk->comp != c)
        sk->sorted = 0;
    sk->comp = c;

    return old;
}

OPENSSL_STACK *OPENSSL_sk_dup(const OPENSSL_STACK *sk)
{
    OPENSSL_STACK *ret;

    if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL)
        goto err;

    if (sk == NULL) {
        ret->num = 0;
        ret->sorted = 0;
        ret->comp = NULL;
    } else {
        /* direct structure assignment */
        *ret = *sk;
    }

    if (sk == NULL || sk->num == 0) {
        /* postpone |ret->data| allocation */
        ret->data = NULL;
        ret->num_alloc = 0;
        return ret;
    }

    /* duplicate |sk->data| content */
    ret->data = OPENSSL_malloc_array(sk->num_alloc, sizeof(*ret->data));
    if (ret->data == NULL)
        goto err;
    memcpy(ret->data, sk->data, sizeof(void *) * sk->num);
    return ret;

err:
    OPENSSL_sk_free(ret);
    return NULL;
}

OPENSSL_STACK *OPENSSL_sk_deep_copy(const OPENSSL_STACK *sk,
    OPENSSL_sk_copyfunc copy_func,
    OPENSSL_sk_freefunc free_func)
{
    OPENSSL_STACK *ret;
    int i;

    if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL)
        goto err;

    if (sk == NULL) {
        ret->num = 0;
        ret->sorted = 0;
        ret->comp = NULL;
    } else {
        /* direct structure assignment */
        *ret = *sk;
    }

    if (sk == NULL || sk->num == 0) {
        /* postpone |ret| data allocation */
        ret->data = NULL;
        ret->num_alloc = 0;
        return ret;
    }

    ret->num_alloc = sk->num > min_nodes ? sk->num : min_nodes;
    ret->data = OPENSSL_calloc(ret->num_alloc, sizeof(*ret->data));
    if (ret->data == NULL)
        goto err;

    for (i = 0; i < ret->num; ++i) {
        if (sk->data[i] == NULL)
            continue;
        if ((ret->data[i] = copy_func(sk->data[i])) == NULL) {
            while (--i >= 0)
                if (ret->data[i] != NULL)
                    free_func((void *)ret->data[i]);
            goto err;
        }
    }
    return ret;

err:
    OPENSSL_sk_free(ret);
    return NULL;
}

OPENSSL_STACK *OPENSSL_sk_new_null(void)
{
    return OPENSSL_sk_new_reserve(NULL, 0);
}

OPENSSL_STACK *OPENSSL_sk_new(OPENSSL_sk_compfunc c)
{
    return OPENSSL_sk_new_reserve(c, 0);
}

/*
 * Calculate the array growth based on the target size.
 *
 * The growth factor is a rational number and is defined by a numerator
 * and a denominator.  According to Andrew Koenig in his paper "Why Are
 * Vectors Efficient?" from JOOP 11(5) 1998, this factor should be less
 * than the golden ratio (1.618...).
 *
 * Considering only the Fibonacci ratios less than the golden ratio, the
 * number of steps from the minimum allocation to integer overflow is:
 *      factor  decimal    growths
 *       3/2     1.5          51
 *       8/5     1.6          45
 *      21/13    1.615...     44
 *
 * All larger factors have the same number of growths.
 *
 * 3/2 and 8/5 have nice power of two shifts, so seem like a good choice.
 */
static ossl_inline int compute_growth(int target, int current)
{
    int err = 0;

    while (current < target) {
        if (current >= max_nodes)
            return 0;

        current = safe_muldiv_int(current, 8, 5, &err);
        if (err != 0)
            return 0;
        if (current >= max_nodes)
            current = max_nodes;
    }
    return current;
}

/* internal STACK storage allocation */
static int sk_reserve(OPENSSL_STACK *st, int n, int exact)
{
    const void **tmpdata;
    int num_alloc;

    /* Check to see the reservation isn't exceeding the hard limit */
    if (n > max_nodes - st->num) {
        ERR_raise(ERR_LIB_CRYPTO, CRYPTO_R_TOO_MANY_RECORDS);
        return 0;
    }

    /* Figure out the new size */
    num_alloc = st->num + n;
    if (num_alloc < min_nodes)
        num_alloc = min_nodes;

    /* If |st->data| allocation was postponed */
    if (st->data == NULL) {
        /*
         * At this point, |st->num_alloc| and |st->num| are 0;
         * so |num_alloc| value is |n| or |min_nodes| if greater than |n|.
         */
        if ((st->data = OPENSSL_calloc(num_alloc, sizeof(void *))) == NULL)
            return 0;
        st->num_alloc = num_alloc;
        return 1;
    }

    if (!exact) {
        if (num_alloc <= st->num_alloc)
            return 1;
        num_alloc = compute_growth(num_alloc, st->num_alloc);
        if (num_alloc == 0) {
            ERR_raise(ERR_LIB_CRYPTO, CRYPTO_R_TOO_MANY_RECORDS);
            return 0;
        }
    } else if (num_alloc == st->num_alloc) {
        return 1;
    }

    tmpdata = OPENSSL_realloc_array((void *)st->data, num_alloc, sizeof(void *));
    if (tmpdata == NULL)
        return 0;

    st->data = tmpdata;
    st->num_alloc = num_alloc;
    return 1;
}

OPENSSL_STACK *OPENSSL_sk_new_reserve(OPENSSL_sk_compfunc c, int n)
{
    OPENSSL_STACK *st = OPENSSL_zalloc(sizeof(OPENSSL_STACK));

    if (st == NULL)
        return NULL;

    st->comp = c;

    if (n <= 0)
        return st;

    if (!sk_reserve(st, n, 1)) {
        OPENSSL_sk_free(st);
        return NULL;
    }

    return st;
}

int OPENSSL_sk_reserve(OPENSSL_STACK *st, int n)
{
    if (st == NULL) {
        ERR_raise(ERR_LIB_CRYPTO, ERR_R_PASSED_NULL_PARAMETER);
        return 0;
    }

    if (n < 0)
        return 1;
    return sk_reserve(st, n, 1);
}

OPENSSL_STACK *OPENSSL_sk_set_thunks(OPENSSL_STACK *st, OPENSSL_sk_freefunc_thunk f_thunk)
{
    if (st != NULL)
        st->free_thunk = f_thunk;

    return st;
}

int OPENSSL_sk_insert(OPENSSL_STACK *st, const void *data, int loc)
{
    if (st == NULL) {
        ERR_raise(ERR_LIB_CRYPTO, ERR_R_PASSED_NULL_PARAMETER);
        return 0;
    }
    if (st->num == max_nodes) {
        ERR_raise(ERR_LIB_CRYPTO, CRYPTO_R_TOO_MANY_RECORDS);
        return 0;
    }

    if (!sk_reserve(st, 1, 0))
        return 0;

    if ((loc >= st->num) || (loc < 0)) {
        st->data[st->num] = data;
    } else {
        memmove(&st->data[loc + 1], &st->data[loc],
            sizeof(st->data[0]) * (st->num - loc));
        st->data[loc] = data;
    }
    st->num++;
    st->sorted = 0;
    return st->num;
}

static ossl_inline void *internal_delete(OPENSSL_STACK *st, int loc)
{
    const void *ret = st->data[loc];

    if (loc != st->num - 1)
        memmove(&st->data[loc], &st->data[loc + 1],
            sizeof(st->data[0]) * (st->num - loc - 1));
    st->num--;

    return (void *)ret;
}

void *OPENSSL_sk_delete_ptr(OPENSSL_STACK *st, const void *p)
{
    int i;

    if (st == NULL)
        return NULL;

    for (i = 0; i < st->num; i++)
        if (st->data[i] == p)
            return internal_delete(st, i);
    return NULL;
}

void *OPENSSL_sk_delete(OPENSSL_STACK *st, int loc)
{
    if (st == NULL || loc < 0 || loc >= st->num)
        return NULL;

    return internal_delete(st, loc);
}

static int internal_find(OPENSSL_STACK *st, const void *data,
    int ret_val_options, int *pnum_matched)
{
    const void *r;
    int i, count = 0;
    int *pnum = pnum_matched;

    if (st == NULL || st->num == 0)
        return -1;

    if (pnum == NULL)
        pnum = &count;

    if (st->comp == NULL) {
        for (i = 0; i < st->num; i++)
            if (st->data[i] == data) {
                *pnum = 1;
                return i;
            }
        *pnum = 0;
        return -1;
    }

    if (data == NULL)
        return -1;

    if (!st->sorted) {
        int res = -1;

        for (i = 0; i < st->num; i++)
            if (st->comp(&data, st->data + i) == 0) {
                if (res == -1)
                    res = i;
                ++*pnum;
                /* Check if only one result is wanted and exit if so */
                if (pnum_matched == NULL)
                    return i;
            }
        if (res == -1)
            *pnum = 0;
        return res;
    }

    if (pnum_matched != NULL)
        ret_val_options |= OSSL_BSEARCH_FIRST_VALUE_ON_MATCH;
    r = ossl_bsearch(&data, st->data, st->num, sizeof(void *), st->comp,
        ret_val_options);

    if (pnum_matched != NULL) {
        *pnum = 0;
        if (r != NULL) {
            const void **p = (const void **)r;

            while (p < st->data + st->num) {
                if (st->comp(&data, p) != 0)
                    break;
                ++*pnum;
                ++p;
            }
        }
    }

    return r == NULL ? -1 : (int)((const void **)r - st->data);
}

int OPENSSL_sk_find(OPENSSL_STACK *st, const void *data)
{
    return internal_find(st, data, OSSL_BSEARCH_FIRST_VALUE_ON_MATCH, NULL);
}

int OPENSSL_sk_find_ex(OPENSSL_STACK *st, const void *data)
{
    return internal_find(st, data, OSSL_BSEARCH_VALUE_ON_NOMATCH, NULL);
}

int OPENSSL_sk_find_all(OPENSSL_STACK *st, const void *data, int *pnum)
{
    return internal_find(st, data, OSSL_BSEARCH_FIRST_VALUE_ON_MATCH, pnum);
}

int OPENSSL_sk_push(OPENSSL_STACK *st, const void *data)
{
    if (st == NULL)
        return 0;
    return OPENSSL_sk_insert(st, data, st->num);
}

int OPENSSL_sk_unshift(OPENSSL_STACK *st, const void *data)
{
    return OPENSSL_sk_insert(st, data, 0);
}

void *OPENSSL_sk_shift(OPENSSL_STACK *st)
{
    if (st == NULL || st->num == 0)
        return NULL;
    return internal_delete(st, 0);
}

void *OPENSSL_sk_pop(OPENSSL_STACK *st)
{
    if (st == NULL || st->num == 0)
        return NULL;
    return internal_delete(st, st->num - 1);
}

void OPENSSL_sk_zero(OPENSSL_STACK *st)
{
    if (st == NULL || st->num == 0)
        return;
    memset(st->data, 0, sizeof(*st->data) * st->num);
    st->num = 0;
}

void OPENSSL_sk_pop_free(OPENSSL_STACK *st, OPENSSL_sk_freefunc func)
{
    int i;

    if (st == NULL)
        return;

    for (i = 0; i < st->num; i++) {
        if (st->data[i] != NULL) {
            if (st->free_thunk != NULL)
                st->free_thunk(func, (void *)st->data[i]);
            else
                func((void *)st->data[i]);
        }
    }
    OPENSSL_sk_free(st);
}

void OPENSSL_sk_free(OPENSSL_STACK *st)
{
    if (st == NULL)
        return;
    OPENSSL_free(st->data);
    OPENSSL_free(st);
}

int OPENSSL_sk_num(const OPENSSL_STACK *st)
{
    return st == NULL ? -1 : st->num;
}

void *OPENSSL_sk_value(const OPENSSL_STACK *st, int i)
{
    if (st == NULL || i < 0 || i >= st->num)
        return NULL;
    return (void *)st->data[i];
}

void *OPENSSL_sk_set(OPENSSL_STACK *st, int i, const void *data)
{
    if (st == NULL) {
        ERR_raise(ERR_LIB_CRYPTO, ERR_R_PASSED_NULL_PARAMETER);
        return NULL;
    }
    if (i < 0 || i >= st->num) {
        ERR_raise_data(ERR_LIB_CRYPTO, ERR_R_PASSED_INVALID_ARGUMENT,
            "i=%d", i);
        return NULL;
    }
    st->data[i] = data;
    st->sorted = 0;
    return (void *)st->data[i];
}

void OPENSSL_sk_sort(OPENSSL_STACK *st)
{
    if (st != NULL && !st->sorted && st->comp != NULL) {
        if (st->num > 1)
            qsort(st->data, st->num, sizeof(void *), st->comp);
        st->sorted = 1; /* empty or single-element stack is considered sorted */
    }
}

int OPENSSL_sk_is_sorted(const OPENSSL_STACK *st)
{
    return st == NULL ? 1 : st->sorted;
}

Coverage Report

Created: 2026-07-12 07:21

Line	Count	Source
1		/*
2		* Copyright 1995-2025 The OpenSSL Project Authors. All Rights Reserved.
3		*
4		* Licensed under the Apache License 2.0 (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
8		*/
9
10		#include <stdio.h>
11		#include "internal/cryptlib.h"
12		#include "internal/numbers.h"
13		#include "internal/safe_math.h"
14		#include <openssl/stack.h>
15		#include <errno.h>
16		#include <openssl/e_os2.h> /* For ossl_inline */
17
18		OSSL_SAFE_MATH_SIGNED(int, int)
19
20		/*
21		* The initial number of nodes in the array.
22		*/
23		static const int min_nodes = 4;
24		static const int max_nodes = SIZE_MAX / sizeof(void *) < INT_MAX
25		? (int)(SIZE_MAX / sizeof(void *))
26		: INT_MAX;
27
28		struct stack_st {
29		int num;
30		const void **data;
31		int sorted;
32		int num_alloc;
33		OPENSSL_sk_compfunc comp;
34		OPENSSL_sk_freefunc_thunk free_thunk;
35		};
36
37		OPENSSL_sk_compfunc OPENSSL_sk_set_cmp_func(OPENSSL_STACK *sk,
38		OPENSSL_sk_compfunc c)
39	264k	{
40	264k	OPENSSL_sk_compfunc old = sk->comp;
41
42	264k	if (sk->comp != c)
43	264k	sk->sorted = 0;
44	264k	sk->comp = c;
45
46	264k	return old;
47	264k	}
48
49		OPENSSL_STACK OPENSSL_sk_dup(const OPENSSL_STACK sk)
50	38.7M	{
51	38.7M	OPENSSL_STACK *ret;
52
53	38.7M	if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL)
54	0	goto err;
55
56	38.7M	if (sk == NULL) {
57	196	ret->num = 0;
58	196	ret->sorted = 0;
59	196	ret->comp = NULL;
60	38.7M	} else {
61		/* direct structure assignment */
62	38.7M	ret = sk;
63	38.7M	}
64
65	38.7M	if (sk == NULL \|\| sk->num == 0) {
66		/* postpone \|ret->data\| allocation */
67	242	ret->data = NULL;
68	242	ret->num_alloc = 0;
69	242	return ret;
70	242	}
71
72		/* duplicate \|sk->data\| content */
73	38.7M	ret->data = OPENSSL_malloc_array(sk->num_alloc, sizeof(*ret->data));
74	38.7M	if (ret->data == NULL)
75	0	goto err;
76	38.7M	memcpy(ret->data, sk->data, sizeof(void ) sk->num);
77	38.7M	return ret;
78
79	0	err:
80	0	OPENSSL_sk_free(ret);
81	0	return NULL;
82	38.7M	}
83
84		OPENSSL_STACK OPENSSL_sk_deep_copy(const OPENSSL_STACK sk,
85		OPENSSL_sk_copyfunc copy_func,
86		OPENSSL_sk_freefunc free_func)
87	1.75M	{
88	1.75M	OPENSSL_STACK *ret;
89	1.75M	int i;
90
91	1.75M	if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL)
92	0	goto err;
93
94	1.75M	if (sk == NULL) {
95	188	ret->num = 0;
96	188	ret->sorted = 0;
97	188	ret->comp = NULL;
98	1.75M	} else {
99		/* direct structure assignment */
100	1.75M	ret = sk;
101	1.75M	}
102
103	1.75M	if (sk == NULL \|\| sk->num == 0) {
104		/* postpone \|ret\| data allocation */
105	188	ret->data = NULL;
106	188	ret->num_alloc = 0;
107	188	return ret;
108	188	}
109
110	1.75M	ret->num_alloc = sk->num > min_nodes ? sk->num : min_nodes;
111	1.75M	ret->data = OPENSSL_calloc(ret->num_alloc, sizeof(*ret->data));
112	1.75M	if (ret->data == NULL)
113	0	goto err;
114
115	17.4M	for (i = 0; i < ret->num; ++i) {
116	15.7M	if (sk->data[i] == NULL)
117	0	continue;
118	15.7M	if ((ret->data[i] = copy_func(sk->data[i])) == NULL) {
119	0	while (--i >= 0)
120	0	if (ret->data[i] != NULL)
121	0	free_func((void *)ret->data[i]);
122	0	goto err;
123	0	}
124	15.7M	}
125	1.75M	return ret;
126
127	0	err:
128	0	OPENSSL_sk_free(ret);
129	0	return NULL;
130	1.75M	}
131
132		OPENSSL_STACK *OPENSSL_sk_new_null(void)
133	197M	{
134	197M	return OPENSSL_sk_new_reserve(NULL, 0);
135	197M	}
136
137		OPENSSL_STACK *OPENSSL_sk_new(OPENSSL_sk_compfunc c)
138	27.0M	{
139	27.0M	return OPENSSL_sk_new_reserve(c, 0);
140	27.0M	}
141
142		/*
143		* Calculate the array growth based on the target size.
144		*
145		* The growth factor is a rational number and is defined by a numerator
146		* and a denominator. According to Andrew Koenig in his paper "Why Are
147		* Vectors Efficient?" from JOOP 11(5) 1998, this factor should be less
148		* than the golden ratio (1.618...).
149		*
150		* Considering only the Fibonacci ratios less than the golden ratio, the
151		* number of steps from the minimum allocation to integer overflow is:
152		* factor decimal growths
153		* 3/2 1.5 51
154		* 8/5 1.6 45
155		* 21/13 1.615... 44
156		*
157		* All larger factors have the same number of growths.
158		*
159		* 3/2 and 8/5 have nice power of two shifts, so seem like a good choice.
160		*/
161		static ossl_inline int compute_growth(int target, int current)
162	5.40M	{
163	5.40M	int err = 0;
164
165	10.8M	while (current < target) {
166	5.40M	if (current >= max_nodes)
167	0	return 0;
168
169	5.40M	current = safe_muldiv_int(current, 8, 5, &err);
170	5.40M	if (err != 0)
171	0	return 0;
172	5.40M	if (current >= max_nodes)
173	0	current = max_nodes;
174	5.40M	}
175	5.40M	return current;
176	5.40M	}
177
178		/* internal STACK storage allocation */
179		static int sk_reserve(OPENSSL_STACK *st, int n, int exact)
180	444M	{
181	444M	const void **tmpdata;
182	444M	int num_alloc;
183
184		/* Check to see the reservation isn't exceeding the hard limit */
185	444M	if (n > max_nodes - st->num) {
186	0	ERR_raise(ERR_LIB_CRYPTO, CRYPTO_R_TOO_MANY_RECORDS);
187	0	return 0;
188	0	}
189
190		/* Figure out the new size */
191	444M	num_alloc = st->num + n;
192	444M	if (num_alloc < min_nodes)
193	39.6M	num_alloc = min_nodes;
194
195		/* If \|st->data\| allocation was postponed */
196	444M	if (st->data == NULL) {
197		/*
198		* At this point, \|st->num_alloc\| and \|st->num\| are 0;
199		* so \|num_alloc\| value is \|n\| or \|min_nodes\| if greater than \|n\|.
200		*/
201	28.4M	if ((st->data = OPENSSL_calloc(num_alloc, sizeof(void *))) == NULL)
202	0	return 0;
203	28.4M	st->num_alloc = num_alloc;
204	28.4M	return 1;
205	28.4M	}
206
207	415M	if (!exact) {
208	415M	if (num_alloc <= st->num_alloc)
209	406M	return 1;
210	9.18M	num_alloc = compute_growth(num_alloc, st->num_alloc);
211	9.18M	if (num_alloc == 0) {
212	0	ERR_raise(ERR_LIB_CRYPTO, CRYPTO_R_TOO_MANY_RECORDS);
213	0	return 0;
214	0	}
215	9.18M	} else if (num_alloc == st->num_alloc) {
216	0	return 1;
217	0	}
218
219	9.18M	tmpdata = OPENSSL_realloc_array((void )st->data, num_alloc, sizeof(void ));
220	9.18M	if (tmpdata == NULL)
221	0	return 0;
222
223	9.18M	st->data = tmpdata;
224	9.18M	st->num_alloc = num_alloc;
225	9.18M	return 1;
226	9.18M	}
227
228		OPENSSL_STACK *OPENSSL_sk_new_reserve(OPENSSL_sk_compfunc c, int n)
229	225M	{
230	225M	OPENSSL_STACK *st = OPENSSL_zalloc(sizeof(OPENSSL_STACK));
231
232	225M	if (st == NULL)
233	0	return NULL;
234
235	225M	st->comp = c;
236
237	225M	if (n <= 0)
238	224M	return st;
239
240	1.01M	if (!sk_reserve(st, n, 1)) {
241	0	OPENSSL_sk_free(st);
242	0	return NULL;
243	0	}
244
245	1.01M	return st;
246	1.01M	}
247
248		int OPENSSL_sk_reserve(OPENSSL_STACK *st, int n)
249	0	{
250	0	if (st == NULL) {
251	0	ERR_raise(ERR_LIB_CRYPTO, ERR_R_PASSED_NULL_PARAMETER);
252	0	return 0;
253	0	}
254
255	0	if (n < 0)
256	0	return 1;
257	0	return sk_reserve(st, n, 1);
258	0	}
259
260		OPENSSL_STACK OPENSSL_sk_set_thunks(OPENSSL_STACK st, OPENSSL_sk_freefunc_thunk f_thunk)
261	52.9M	{
262	52.9M	if (st != NULL)
263	51.1M	st->free_thunk = f_thunk;
264
265	52.9M	return st;
266	52.9M	}
267
268		int OPENSSL_sk_insert(OPENSSL_STACK st, const void data, int loc)
269	371M	{
270	371M	if (st == NULL) {
271	0	ERR_raise(ERR_LIB_CRYPTO, ERR_R_PASSED_NULL_PARAMETER);
272	0	return 0;
273	0	}
274	371M	if (st->num == max_nodes) {
275	0	ERR_raise(ERR_LIB_CRYPTO, CRYPTO_R_TOO_MANY_RECORDS);
276	0	return 0;
277	0	}
278
279	371M	if (!sk_reserve(st, 1, 0))
280	0	return 0;
281
282	371M	if ((loc >= st->num) \|\| (loc < 0)) {
283	371M	st->data[st->num] = data;
284	371M	} else {
285	5.19k	memmove(&st->data[loc + 1], &st->data[loc],
286	5.19k	sizeof(st->data[0]) * (st->num - loc));
287	5.19k	st->data[loc] = data;
288	5.19k	}
289	371M	st->num++;
290	371M	st->sorted = 0;
291	371M	return st->num;
292	371M	}
293
294		static ossl_inline void internal_delete(OPENSSL_STACK st, int loc)
295	2.28M	{
296	2.28M	const void *ret = st->data[loc];
297
298	2.28M	if (loc != st->num - 1)
299	247k	memmove(&st->data[loc], &st->data[loc + 1],
300	247k	sizeof(st->data[0]) * (st->num - loc - 1));
301	2.28M	st->num--;
302
303	2.28M	return (void *)ret;
304	2.28M	}
305
306		void OPENSSL_sk_delete_ptr(OPENSSL_STACK st, const void *p)
307	162k	{
308	162k	int i;
309
310	162k	if (st == NULL)
311	0	return NULL;
312
313	654k	for (i = 0; i < st->num; i++)
314	654k	if (st->data[i] == p)
315	162k	return internal_delete(st, i);
316	0	return NULL;
317	162k	}
318
319		void OPENSSL_sk_delete(OPENSSL_STACK st, int loc)
320	286k	{
321	286k	if (st == NULL \|\| loc < 0 \|\| loc >= st->num)
322	0	return NULL;
323
324	286k	return internal_delete(st, loc);
325	286k	}
326
327		static int internal_find(OPENSSL_STACK st, const void data,
328		int ret_val_options, int *pnum_matched)
329	289k	{
330	289k	const void *r;
331	289k	int i, count = 0;
332	289k	int *pnum = pnum_matched;
333
334	289k	if (st == NULL \|\| st->num == 0)
335	108k	return -1;
336
337	181k	if (pnum == NULL)
338	175k	pnum = &count;
339
340	181k	if (st->comp == NULL) {
341	3.05M	for (i = 0; i < st->num; i++)
342	3.04M	if (st->data[i] == data) {
343	28.8k	*pnum = 1;
344	28.8k	return i;
345	28.8k	}
346	2.48k	*pnum = 0;
347	2.48k	return -1;
348	31.3k	}
349
350	149k	if (data == NULL)
351	0	return -1;
352
353	149k	if (!st->sorted) {
354	0	int res = -1;
355
356	0	for (i = 0; i < st->num; i++)
357	0	if (st->comp(&data, st->data + i) == 0) {
358	0	if (res == -1)
359	0	res = i;
360	0	++*pnum;
361		/* Check if only one result is wanted and exit if so */
362	0	if (pnum_matched == NULL)
363	0	return i;
364	0	}
365	0	if (res == -1)
366	0	*pnum = 0;
367	0	return res;
368	0	}
369
370	149k	if (pnum_matched != NULL)
371	5.90k	ret_val_options \|= OSSL_BSEARCH_FIRST_VALUE_ON_MATCH;
372	149k	r = ossl_bsearch(&data, st->data, st->num, sizeof(void *), st->comp,
373	149k	ret_val_options);
374
375	149k	if (pnum_matched != NULL) {
376	5.90k	*pnum = 0;
377	5.90k	if (r != NULL) {
378	3.95k	const void p = (const void )r;
379
380	7.91k	while (p < st->data + st->num) {
381	3.95k	if (st->comp(&data, p) != 0)
382	0	break;
383	3.95k	++*pnum;
384	3.95k	++p;
385	3.95k	}
386	3.95k	}
387	5.90k	}
388
389	149k	return r == NULL ? -1 : (int)((const void **)r - st->data);
390	149k	}
391
392		int OPENSSL_sk_find(OPENSSL_STACK st, const void data)
393	208k	{
394	208k	return internal_find(st, data, OSSL_BSEARCH_FIRST_VALUE_ON_MATCH, NULL);
395	208k	}
396
397		int OPENSSL_sk_find_ex(OPENSSL_STACK st, const void data)
398	0	{
399	0	return internal_find(st, data, OSSL_BSEARCH_VALUE_ON_NOMATCH, NULL);
400	0	}
401
402		int OPENSSL_sk_find_all(OPENSSL_STACK st, const void data, int *pnum)
403	101k	{
404	101k	return internal_find(st, data, OSSL_BSEARCH_FIRST_VALUE_ON_MATCH, pnum);
405	101k	}
406
407		int OPENSSL_sk_push(OPENSSL_STACK st, const void data)
408	443M	{
409	443M	if (st == NULL)
410	0	return 0;
411	443M	return OPENSSL_sk_insert(st, data, st->num);
412	443M	}
413
414		int OPENSSL_sk_unshift(OPENSSL_STACK st, const void data)
415	0	{
416	0	return OPENSSL_sk_insert(st, data, 0);
417	0	}
418
419		void OPENSSL_sk_shift(OPENSSL_STACK st)
420	60	{
421	60	if (st == NULL \|\| st->num == 0)
422	60	return NULL;
423	0	return internal_delete(st, 0);
424	60	}
425
426		void OPENSSL_sk_pop(OPENSSL_STACK st)
427	2.11M	{
428	2.11M	if (st == NULL \|\| st->num == 0)
429	10.1k	return NULL;
430	2.10M	return internal_delete(st, st->num - 1);
431	2.11M	}
432
433		void OPENSSL_sk_zero(OPENSSL_STACK *st)
434	0	{
435	0	if (st == NULL \|\| st->num == 0)
436	0	return;
437	0	memset(st->data, 0, sizeof(st->data) st->num);
438	0	st->num = 0;
439	0	}
440
441		void OPENSSL_sk_pop_free(OPENSSL_STACK *st, OPENSSL_sk_freefunc func)
442	12.6M	{
443	12.6M	int i;
444
445	12.6M	if (st == NULL)
446	3.13M	return;
447
448	54.6M	for (i = 0; i < st->num; i++) {
449	45.1M	if (st->data[i] != NULL) {
450	45.0M	if (st->free_thunk != NULL)
451	36.6M	st->free_thunk(func, (void *)st->data[i]);
452	8.42M	else
453	8.42M	func((void *)st->data[i]);
454	45.0M	}
455	45.1M	}
456	9.54M	OPENSSL_sk_free(st);
457	9.54M	}
458
459		void OPENSSL_sk_free(OPENSSL_STACK *st)
460	318M	{
461	318M	if (st == NULL)
462	52.9M	return;
463	265M	OPENSSL_free(st->data);
464	265M	OPENSSL_free(st);
465	265M	}
466
467		int OPENSSL_sk_num(const OPENSSL_STACK *st)
468	1.28G	{
469	1.28G	return st == NULL ? -1 : st->num;
470	1.28G	}
471
472		void OPENSSL_sk_value(const OPENSSL_STACK st, int i)
473	1.36G	{
474	1.36G	if (st == NULL \|\| i < 0 \|\| i >= st->num)
475	5.11k	return NULL;
476	1.36G	return (void *)st->data[i];
477	1.36G	}
478
479		void OPENSSL_sk_set(OPENSSL_STACK st, int i, const void *data)
480	14.0M	{
481	14.0M	if (st == NULL) {
482	0	ERR_raise(ERR_LIB_CRYPTO, ERR_R_PASSED_NULL_PARAMETER);
483	0	return NULL;
484	0	}
485	14.0M	if (i < 0 \|\| i >= st->num) {
486	0	ERR_raise_data(ERR_LIB_CRYPTO, ERR_R_PASSED_INVALID_ARGUMENT,
487	0	"i=%d", i);
488	0	return NULL;
489	0	}
490	14.0M	st->data[i] = data;
491	14.0M	st->sorted = 0;
492	14.0M	return (void *)st->data[i];
493	14.0M	}
494
495		void OPENSSL_sk_sort(OPENSSL_STACK *st)
496	27.2M	{
497	27.2M	if (st != NULL && !st->sorted && st->comp != NULL) {
498	23.6M	if (st->num > 1)
499	299k	qsort(st->data, st->num, sizeof(void *), st->comp);
500	23.6M	st->sorted = 1; /* empty or single-element stack is considered sorted */
501	23.6M	}
502	27.2M	}
503
504		int OPENSSL_sk_is_sorted(const OPENSSL_STACK *st)
505	85.9k	{
506	85.9k	return st == NULL ? 1 : st->sorted;
507	85.9k	}