IABSD.fr/src/lib/libcrypto/stack/stack.h

Branch : - branch - master - tag -

• Show log

  Commit

• Author : tb
  Date : 2024-03-02 11:20:36
  Hash : bc8b9123
  Message : Remove sk_find_ex() This API intends to find the closest match to the needle. M2Crypto exposes it because it can. This will be fixed by patching the port. ok jsing

• lib/libcrypto/stack/stack.h

• /* $OpenBSD: stack.h,v 1.11 2024/03/02 11:20:36 tb Exp $ */
  /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
   * All rights reserved.
   *
   * This package is an SSL implementation written
   * by Eric Young (eay@cryptsoft.com).
   * 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 (tjh@cryptsoft.com).
   *
   * 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 (eay@cryptsoft.com)"
   *    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 (tjh@cryptsoft.com)"
   *
   * 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.]
   */
  
  #ifndef HEADER_STACK_H
  #define HEADER_STACK_H
  
  #ifdef  __cplusplus
  extern "C" {
  #endif
  
  typedef struct stack_st _STACK;
  
  #define M_sk_num(sk)		((sk) ? (sk)->num:-1)
  #define M_sk_value(sk,n)	((sk) ? (sk)->data[n] : NULL)
  
  int sk_num(const _STACK *);
  void *sk_value(const _STACK *, int);
  
  void *sk_set(_STACK *, int, void *);
  
  _STACK *sk_new(int (*cmp)(const void *, const void *));
  _STACK *sk_new_null(void);
  void sk_free(_STACK *);
  void sk_pop_free(_STACK *st, void (*func)(void *));
  int sk_insert(_STACK *sk, void *data, int where);
  void *sk_delete(_STACK *st, int loc);
  void *sk_delete_ptr(_STACK *st, void *p);
  int sk_find(_STACK *st, void *data);
  int sk_push(_STACK *st, void *data);
  int sk_unshift(_STACK *st, void *data);
  void *sk_shift(_STACK *st);
  void *sk_pop(_STACK *st);
  void sk_zero(_STACK *st);
  int (*sk_set_cmp_func(_STACK *sk, int (*c)(const void *, const void *)))(
      const void *, const void *);
  _STACK *sk_dup(_STACK *st);
  void sk_sort(_STACK *st);
  int sk_is_sorted(const _STACK *st);
  
  #ifdef  __cplusplus
  }
  #endif
  
  #endif