/* Copyright (C) 1995-1998 Eric Young ([email protected]) * All rights reserved. * * This package is an SSL implementation written * by Eric Young ([email protected]). * The implementation was written so as to conform with Netscapes SSL. * * This library is free for commercial and non-commercial use as long as * the following conditions are aheared to. The following conditions * apply to all code found in this distribution, be it the RC4, RSA, * lhash, DES, etc., code; not just the SSL code. The SSL documentation * included with this distribution is covered by the same copyright terms * except that the holder is Tim Hudson ([email protected]). * * Copyright remains Eric Young's, and as such any Copyright notices in * the code are not to be removed. * If this package is used in a product, Eric Young should be given attribution * as the author of the parts of the library used. * This can be in the form of a textual message at program startup or * in documentation (online or textual) provided with the package. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * "This product includes cryptographic software written by * Eric Young ([email protected])" * The word 'cryptographic' can be left out if the rouines from the library * being used are not cryptographic related :-). * 4. If you include any Windows specific code (or a derivative thereof) from * the apps directory (application code) you must include an acknowledgement: * "This product includes software written by Tim Hudson ([email protected])" * * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * The licence and distribution terms for any publically available version or * derivative of this code cannot be changed. i.e. this code cannot simply be * copied and put under another distribution licence * [including the GNU Public Licence.] */ #include <openssl/stack.h> #include <assert.h> #include <limits.h> #include <openssl/err.h> #include <openssl/mem.h> #include "../internal.h" struct stack_st { … }; // kMinSize is the number of pointers that will be initially allocated in a new // stack. static const size_t kMinSize = …; OPENSSL_STACK *OPENSSL_sk_new(OPENSSL_sk_cmp_func comp) { … } OPENSSL_STACK *OPENSSL_sk_new_null(void) { … } size_t OPENSSL_sk_num(const OPENSSL_STACK *sk) { … } void OPENSSL_sk_zero(OPENSSL_STACK *sk) { … } void *OPENSSL_sk_value(const OPENSSL_STACK *sk, size_t i) { … } void *OPENSSL_sk_set(OPENSSL_STACK *sk, size_t i, void *value) { … } void OPENSSL_sk_free(OPENSSL_STACK *sk) { … } void OPENSSL_sk_pop_free_ex(OPENSSL_STACK *sk, OPENSSL_sk_call_free_func call_free_func, OPENSSL_sk_free_func free_func) { … } // Historically, |sk_pop_free| called the function as |OPENSSL_sk_free_func| // directly. This is undefined in C. Some callers called |sk_pop_free| directly, // so we must maintain a compatibility version for now. static void call_free_func_legacy(OPENSSL_sk_free_func func, void *ptr) { … } void sk_pop_free(OPENSSL_STACK *sk, OPENSSL_sk_free_func free_func) { … } size_t OPENSSL_sk_insert(OPENSSL_STACK *sk, void *p, size_t where) { … } void *OPENSSL_sk_delete(OPENSSL_STACK *sk, size_t where) { … } void *OPENSSL_sk_delete_ptr(OPENSSL_STACK *sk, const void *p) { … } void OPENSSL_sk_delete_if(OPENSSL_STACK *sk, OPENSSL_sk_call_delete_if_func call_func, OPENSSL_sk_delete_if_func func, void *data) { … } int OPENSSL_sk_find(const OPENSSL_STACK *sk, size_t *out_index, const void *p, OPENSSL_sk_call_cmp_func call_cmp_func) { … } void *OPENSSL_sk_shift(OPENSSL_STACK *sk) { … } size_t OPENSSL_sk_push(OPENSSL_STACK *sk, void *p) { … } void *OPENSSL_sk_pop(OPENSSL_STACK *sk) { … } OPENSSL_STACK *OPENSSL_sk_dup(const OPENSSL_STACK *sk) { … } static size_t parent_idx(size_t idx) { … } static size_t left_idx(size_t idx) { … } // down_heap fixes the subtree rooted at |i|. |i|'s children must each satisfy // the heap property. Only the first |num| elements of |sk| are considered. static void down_heap(OPENSSL_STACK *sk, OPENSSL_sk_call_cmp_func call_cmp_func, size_t i, size_t num) { … } void OPENSSL_sk_sort(OPENSSL_STACK *sk, OPENSSL_sk_call_cmp_func call_cmp_func) { … } int OPENSSL_sk_is_sorted(const OPENSSL_STACK *sk) { … } OPENSSL_sk_cmp_func OPENSSL_sk_set_cmp_func(OPENSSL_STACK *sk, OPENSSL_sk_cmp_func comp) { … } OPENSSL_STACK *OPENSSL_sk_deep_copy(const OPENSSL_STACK *sk, OPENSSL_sk_call_copy_func call_copy_func, OPENSSL_sk_copy_func copy_func, OPENSSL_sk_call_free_func call_free_func, OPENSSL_sk_free_func free_func) { … } OPENSSL_STACK *sk_new_null(void) { … } size_t sk_num(const OPENSSL_STACK *sk) { … } void *sk_value(const OPENSSL_STACK *sk, size_t i) { … } void sk_free(OPENSSL_STACK *sk) { … } size_t sk_push(OPENSSL_STACK *sk, void *p) { … } void *sk_pop(OPENSSL_STACK *sk) { … } void sk_pop_free_ex(OPENSSL_STACK *sk, OPENSSL_sk_call_free_func call_free_func, OPENSSL_sk_free_func free_func) { … }
Codebase Browser
chromium