/src/openssl/crypto/stack/stack.c

Source (jump to first uncovered line)
/*
 * Copyright 1995-2023 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_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(sizeof(*ret->data) * sk->num_alloc);
    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_zalloc(sizeof(*ret->data) * ret->num_alloc);
    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_zalloc(sizeof(void *) * num_alloc)) == 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((void *)st->data, sizeof(void *) * num_alloc);
    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);
}

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 -1;
    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)
            func((char *)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: 2024-09-08 06:32

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