/src/openssl111/crypto/stack/stack.c

Source (jump to first uncovered line)
/*
 * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.
 *
 * Licensed under the OpenSSL license (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 <openssl/stack.h>
#include <openssl/objects.h>
#include <errno.h>
#include <openssl/e_os2.h>      /* For ossl_inline */

/*
 * 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) {
        CRYPTOerr(CRYPTO_F_OPENSSL_SK_DUP, ERR_R_MALLOC_FAILURE);
        return NULL;
    }

    /* direct structure assignment */
    *ret = *sk;

    if (sk->num == 0) {
        /* postpone |ret->data| allocation */
        ret->data = NULL;
        ret->num_alloc = 0;
        return ret;
    }
    /* duplicate |sk->data| content */
    if ((ret->data = OPENSSL_malloc(sizeof(*ret->data) * sk->num_alloc)) == 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) {
        CRYPTOerr(CRYPTO_F_OPENSSL_SK_DEEP_COPY, ERR_R_MALLOC_FAILURE);
        return NULL;
    }

    /* direct structure assignment */
    *ret = *sk;

    if (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) {
        OPENSSL_free(ret);
        return NULL;
    }

    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]);
            OPENSSL_sk_free(ret);
            return NULL;
        }
    }
    return ret;
}

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 fraction 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...).
 *
 * We use 3/2 = 1.5 for simplicity of calculation and overflow checking.
 * Another option 8/5 = 1.6 allows for slightly faster growth, although safe
 * computation is more difficult.
 *
 * The limit to avoid overflow is spot on.  The modulo three correction term
 * ensures that the limit is the largest number than can be expanded by the
 * growth factor without exceeding the hard limit.
 *
 * Do not call it with |current| lower than 2, or it will infinitely loop.
 */
static ossl_inline int compute_growth(int target, int current)
{
    const int limit = (max_nodes / 3) * 2 + (max_nodes % 3 ? 1 : 0);

    while (current < target) {
        /* Check to see if we're at the hard limit */
        if (current >= max_nodes)
            return 0;

        /* Expand the size by a factor of 3/2 if it is within range */
        current = current < limit ? current + current / 2 : 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)
        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) {
            CRYPTOerr(CRYPTO_F_SK_RESERVE, ERR_R_MALLOC_FAILURE);
            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)
            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)
        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 || st->num == max_nodes)
        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;

    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)
{
    const void *r;
    int i;

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

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

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

    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, OBJ_BSEARCH_FIRST_VALUE_ON_MATCH);
}

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

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 || i < 0 || i >= st->num)
        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: 2023-06-08 06:43

Line	Count	Source (jump to first uncovered line)
1		/*
2		* Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.
3		*
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
8		*/
9
10		#include <stdio.h>
11		#include "internal/cryptlib.h"
12		#include "internal/numbers.h"
13		#include <openssl/stack.h>
14		#include <openssl/objects.h>
15		#include <errno.h>
16		#include <openssl/e_os2.h> /* For ossl_inline */
17
18		/*
19		* The initial number of nodes in the array.
20		*/
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 *))
24		: INT_MAX;
25
26		struct stack_st {
27		int num;
28		const void **data;
29		int sorted;
30		int num_alloc;
31		OPENSSL_sk_compfunc comp;
32		};
33
34		OPENSSL_sk_compfunc OPENSSL_sk_set_cmp_func(OPENSSL_STACK *sk, OPENSSL_sk_compfunc c)
35	89.6k	{
36	89.6k	OPENSSL_sk_compfunc old = sk->comp;
37
38	89.6k	if (sk->comp != c)
39	89.6k	sk->sorted = 0;
40	89.6k	sk->comp = c;
41
42	89.6k	return old;
43	89.6k	}
44
45		OPENSSL_STACK OPENSSL_sk_dup(const OPENSSL_STACK sk)
46	47.0k	{
47	47.0k	OPENSSL_STACK *ret;
48
49	47.0k	if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL) {
50	0	CRYPTOerr(CRYPTO_F_OPENSSL_SK_DUP, ERR_R_MALLOC_FAILURE);
51	0	return NULL;
52	0	}
53
54		/* direct structure assignment */
55	47.0k	ret = sk;
56
57	47.0k	if (sk->num == 0) {
58		/* postpone \|ret->data\| allocation */
59	0	ret->data = NULL;
60	0	ret->num_alloc = 0;
61	0	return ret;
62	0	}
63		/* duplicate \|sk->data\| content */
64	47.0k	if ((ret->data = OPENSSL_malloc(sizeof(ret->data) sk->num_alloc)) == NULL)
65	0	goto err;
66	47.0k	memcpy(ret->data, sk->data, sizeof(void ) sk->num);
67	47.0k	return ret;
68	0	err:
69	0	OPENSSL_sk_free(ret);
70	0	return NULL;
71	47.0k	}
72
73		OPENSSL_STACK OPENSSL_sk_deep_copy(const OPENSSL_STACK sk,
74		OPENSSL_sk_copyfunc copy_func,
75		OPENSSL_sk_freefunc free_func)
76		{
77		OPENSSL_STACK *ret;
78		int i;
79
80		if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL) {
81		CRYPTOerr(CRYPTO_F_OPENSSL_SK_DEEP_COPY, ERR_R_MALLOC_FAILURE);
82		return NULL;
83		}
84
85		/* direct structure assignment */
86		ret = sk;
87
88		if (sk->num == 0) {
89		/* postpone \|ret\| data allocation */
90		ret->data = NULL;
91		ret->num_alloc = 0;
92		return ret;
93		}
94
95		ret->num_alloc = sk->num > min_nodes ? sk->num : min_nodes;
96		ret->data = OPENSSL_zalloc(sizeof(ret->data) ret->num_alloc);
97		if (ret->data == NULL) {
98		OPENSSL_free(ret);
99		return NULL;
100		}
101
102		for (i = 0; i < ret->num; ++i) {
103		if (sk->data[i] == NULL)
104		continue;
105		if ((ret->data[i] = copy_func(sk->data[i])) == NULL) {
106		while (--i >= 0)
107		if (ret->data[i] != NULL)
108		free_func((void *)ret->data[i]);
109		OPENSSL_sk_free(ret);
110		return NULL;
111		}
112		}
113		return ret;
114		}
115
116		OPENSSL_STACK *OPENSSL_sk_new_null(void)
117	65.0M	{
118	65.0M	return OPENSSL_sk_new_reserve(NULL, 0);
119	65.0M	}
120
121		OPENSSL_STACK *OPENSSL_sk_new(OPENSSL_sk_compfunc c)
122	3.79M	{
123	3.79M	return OPENSSL_sk_new_reserve(c, 0);
124	3.79M	}
125
126		/*
127		* Calculate the array growth based on the target size.
128		*
129		* The growth fraction 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...).
133		*
134		* We use 3/2 = 1.5 for simplicity of calculation and overflow checking.
135		* Another option 8/5 = 1.6 allows for slightly faster growth, although safe
136		* computation is more difficult.
137		*
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.
141		*
142		* Do not call it with \|current\| lower than 2, or it will infinitely loop.
143		*/
144		static ossl_inline int compute_growth(int target, int current)
145	5.01M	{
146	5.01M	const int limit = (max_nodes / 3) * 2 + (max_nodes % 3 ? 1 : 0);
147
148	10.0M	while (current < target) {
149		/* Check to see if we're at the hard limit */
150	5.01M	if (current >= max_nodes)
151	0	return 0;
152
153		/* Expand the size by a factor of 3/2 if it is within range */
154	5.01M	current = current < limit ? current + current / 2 : max_nodes;
155	5.01M	}
156	5.01M	return current;
157	5.01M	}
158
159		/* internal STACK storage allocation */
160		static int sk_reserve(OPENSSL_STACK *st, int n, int exact)
161	151M	{
162	151M	const void **tmpdata;
163	151M	int num_alloc;
164
165		/* Check to see the reservation isn't exceeding the hard limit */
166	151M	if (n > max_nodes - st->num)
167	0	return 0;
168
169		/* Figure out the new size */
170	151M	num_alloc = st->num + n;
171	151M	if (num_alloc < min_nodes)
172	11.4M	num_alloc = min_nodes;
173
174		/* If \|st->data\| allocation was postponed */
175	151M	if (st->data == NULL) {
176		/*
177		* At this point, \|st->num_alloc\| and \|st->num\| are 0;
178		* so \|num_alloc\| value is \|n\| or \|min_nodes\| if greater than \|n\|.
179		*/
180	6.99M	if ((st->data = OPENSSL_zalloc(sizeof(void ) num_alloc)) == NULL) {
181	0	CRYPTOerr(CRYPTO_F_SK_RESERVE, ERR_R_MALLOC_FAILURE);
182	0	return 0;
183	0	}
184	6.99M	st->num_alloc = num_alloc;
185	6.99M	return 1;
186	6.99M	}
187
188	144M	if (!exact) {
189	144M	if (num_alloc <= st->num_alloc)
190	137M	return 1;
191	7.06M	num_alloc = compute_growth(num_alloc, st->num_alloc);
192	7.06M	if (num_alloc == 0)
193	0	return 0;
194	7.06M	} else if (num_alloc == st->num_alloc) {
195	0	return 1;
196	0	}
197
198	7.06M	tmpdata = OPENSSL_realloc((void )st->data, sizeof(void ) * num_alloc);
199	7.06M	if (tmpdata == NULL)
200	0	return 0;
201
202	7.06M	st->data = tmpdata;
203	7.06M	st->num_alloc = num_alloc;
204	7.06M	return 1;
205	7.06M	}
206
207		OPENSSL_STACK *OPENSSL_sk_new_reserve(OPENSSL_sk_compfunc c, int n)
208	68.8M	{
209	68.8M	OPENSSL_STACK *st = OPENSSL_zalloc(sizeof(OPENSSL_STACK));
210
211	68.8M	if (st == NULL)
212	0	return NULL;
213
214	68.8M	st->comp = c;
215
216	68.8M	if (n <= 0)
217	68.8M	return st;
218
219	0	if (!sk_reserve(st, n, 1)) {
220	0	OPENSSL_sk_free(st);
221	0	return NULL;
222	0	}
223
224	0	return st;
225	0	}
226
227		int OPENSSL_sk_reserve(OPENSSL_STACK *st, int n)
228	0	{
229	0	if (st == NULL)
230	0	return 0;
231
232	0	if (n < 0)
233	0	return 1;
234	0	return sk_reserve(st, n, 1);
235	0	}
236
237		int OPENSSL_sk_insert(OPENSSL_STACK st, const void data, int loc)
238	37.4M	{
239	37.4M	if (st == NULL \|\| st->num == max_nodes)
240	0	return 0;
241
242	37.4M	if (!sk_reserve(st, 1, 0))
243	0	return 0;
244
245	37.4M	if ((loc >= st->num) \|\| (loc < 0)) {
246	37.4M	st->data[st->num] = data;
247	37.4M	} else {
248	0	memmove(&st->data[loc + 1], &st->data[loc],
249	0	sizeof(st->data[0]) * (st->num - loc));
250	0	st->data[loc] = data;
251	0	}
252	37.4M	st->num++;
253	37.4M	st->sorted = 0;
254	37.4M	return st->num;
255	37.4M	}
256
257		static ossl_inline void internal_delete(OPENSSL_STACK st, int loc)
258	450k	{
259	450k	const void *ret = st->data[loc];
260
261	450k	if (loc != st->num - 1)
262	22.8k	memmove(&st->data[loc], &st->data[loc + 1],
263	22.8k	sizeof(st->data[0]) * (st->num - loc - 1));
264	450k	st->num--;
265
266	450k	return (void *)ret;
267	450k	}
268
269		void OPENSSL_sk_delete_ptr(OPENSSL_STACK st, const void *p)
270	5.64k	{
271	5.64k	int i;
272
273	10.2k	for (i = 0; i < st->num; i++)
274	10.2k	if (st->data[i] == p)
275	5.64k	return internal_delete(st, i);
276	0	return NULL;
277	5.64k	}
278
279		void OPENSSL_sk_delete(OPENSSL_STACK st, int loc)
280	82	{
281	82	if (st == NULL \|\| loc < 0 \|\| loc >= st->num)
282	0	return NULL;
283
284	82	return internal_delete(st, loc);
285	82	}
286
287		static int internal_find(OPENSSL_STACK st, const void data,
288		int ret_val_options)
289	22.7k	{
290	22.7k	const void *r;
291	22.7k	int i;
292
293	22.7k	if (st == NULL \|\| st->num == 0)
294	11.8k	return -1;
295
296	10.9k	if (st->comp == NULL) {
297	354k	for (i = 0; i < st->num; i++)
298	354k	if (st->data[i] == data)
299	4.09k	return i;
300	34	return -1;
301	4.13k	}
302
303	6.78k	if (!st->sorted) {
304	0	if (st->num > 1)
305	0	qsort(st->data, st->num, sizeof(void *), st->comp);
306	0	st->sorted = 1; /* empty or single-element stack is considered sorted */
307	0	}
308	6.78k	if (data == NULL)
309	0	return -1;
310	6.78k	r = OBJ_bsearch_ex_(&data, st->data, st->num, sizeof(void *), st->comp,
311	6.78k	ret_val_options);
312
313	6.78k	return r == NULL ? -1 : (int)((const void **)r - st->data);
314	6.78k	}
315
316		int OPENSSL_sk_find(OPENSSL_STACK st, const void data)
317	53.7k	{
318	53.7k	return internal_find(st, data, OBJ_BSEARCH_FIRST_VALUE_ON_MATCH);
319	53.7k	}
320
321		int OPENSSL_sk_find_ex(OPENSSL_STACK st, const void data)
322	0	{
323	0	return internal_find(st, data, OBJ_BSEARCH_VALUE_ON_NOMATCH);
324	0	}
325
326		int OPENSSL_sk_push(OPENSSL_STACK st, const void data)
327	151M	{
328	151M	if (st == NULL)
329	0	return -1;
330	151M	return OPENSSL_sk_insert(st, data, st->num);
331	151M	}
332
333		int OPENSSL_sk_unshift(OPENSSL_STACK st, const void data)
334	0	{
335	0	return OPENSSL_sk_insert(st, data, 0);
336	0	}
337
338		void OPENSSL_sk_shift(OPENSSL_STACK st)
339	0	{
340	0	if (st == NULL \|\| st->num == 0)
341	0	return NULL;
342	0	return internal_delete(st, 0);
343	0	}
344
345		void OPENSSL_sk_pop(OPENSSL_STACK st)
346	432k	{
347	432k	if (st == NULL \|\| st->num == 0)
348	5.35k	return NULL;
349	426k	return internal_delete(st, st->num - 1);
350	432k	}
351
352		void OPENSSL_sk_zero(OPENSSL_STACK *st)
353	0	{
354	0	if (st == NULL \|\| st->num == 0)
355	0	return;
356	0	memset(st->data, 0, sizeof(st->data) st->num);
357	0	st->num = 0;
358	0	}
359
360		void OPENSSL_sk_pop_free(OPENSSL_STACK *st, OPENSSL_sk_freefunc func)
361	21.7M	{
362	21.7M	int i;
363
364	21.7M	if (st == NULL)
365	5.17M	return;
366	116M	for (i = 0; i < st->num; i++)
367	99.6M	if (st->data[i] != NULL)
368	99.3M	func((char *)st->data[i]);
369	16.5M	OPENSSL_sk_free(st);
370	16.5M	}
371
372		void OPENSSL_sk_free(OPENSSL_STACK *st)
373	99.2M	{
374	99.2M	if (st == NULL)
375	28.4M	return;
376	70.7M	OPENSSL_free(st->data);
377	70.7M	OPENSSL_free(st);
378	70.7M	}
379
380		int OPENSSL_sk_num(const OPENSSL_STACK *st)
381	690M	{
382	690M	return st == NULL ? -1 : st->num;
383	690M	}
384
385		void OPENSSL_sk_value(const OPENSSL_STACK st, int i)
386	1.14G	{
387	1.14G	if (st == NULL \|\| i < 0 \|\| i >= st->num)
388	4.35k	return NULL;
389	1.14G	return (void *)st->data[i];
390	1.14G	}
391
392		void OPENSSL_sk_set(OPENSSL_STACK st, int i, const void *data)
393	3.67M	{
394	3.67M	if (st == NULL \|\| i < 0 \|\| i >= st->num)
395	0	return NULL;
396	3.67M	st->data[i] = data;
397	3.67M	st->sorted = 0;
398	3.67M	return (void *)st->data[i];
399	3.67M	}
400
401		void OPENSSL_sk_sort(OPENSSL_STACK *st)
402	3.83M	{
403	3.83M	if (st != NULL && !st->sorted && st->comp != NULL) {
404	3.83M	if (st->num > 1)
405	80.0k	qsort(st->data, st->num, sizeof(void *), st->comp);
406	3.83M	st->sorted = 1; /* empty or single-element stack is considered sorted */
407	3.83M	}
408	3.83M	}
409
410		int OPENSSL_sk_is_sorted(const OPENSSL_STACK *st)
411	6.79k	{
412	6.79k	return st == NULL ? 1 : st->sorted;
413	6.79k	}