1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/ossrv/ssl/libcrypto/src/crypto/stack/stack.h Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,113 @@
1.4 +/* crypto/stack/stack.h */
1.5 +/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
1.6 + * All rights reserved.
1.7 + *
1.8 + * This package is an SSL implementation written
1.9 + * by Eric Young (eay@cryptsoft.com).
1.10 + * The implementation was written so as to conform with Netscapes SSL.
1.11 + *
1.12 + * This library is free for commercial and non-commercial use as long as
1.13 + * the following conditions are aheared to. The following conditions
1.14 + * apply to all code found in this distribution, be it the RC4, RSA,
1.15 + * lhash, DES, etc., code; not just the SSL code. The SSL documentation
1.16 + * included with this distribution is covered by the same copyright terms
1.17 + * except that the holder is Tim Hudson (tjh@cryptsoft.com).
1.18 + *
1.19 + * Copyright remains Eric Young's, and as such any Copyright notices in
1.20 + * the code are not to be removed.
1.21 + * If this package is used in a product, Eric Young should be given attribution
1.22 + * as the author of the parts of the library used.
1.23 + * This can be in the form of a textual message at program startup or
1.24 + * in documentation (online or textual) provided with the package.
1.25 + *
1.26 + * Redistribution and use in source and binary forms, with or without
1.27 + * modification, are permitted provided that the following conditions
1.28 + * are met:
1.29 + * 1. Redistributions of source code must retain the copyright
1.30 + * notice, this list of conditions and the following disclaimer.
1.31 + * 2. Redistributions in binary form must reproduce the above copyright
1.32 + * notice, this list of conditions and the following disclaimer in the
1.33 + * documentation and/or other materials provided with the distribution.
1.34 + * 3. All advertising materials mentioning features or use of this software
1.35 + * must display the following acknowledgement:
1.36 + * "This product includes cryptographic software written by
1.37 + * Eric Young (eay@cryptsoft.com)"
1.38 + * The word 'cryptographic' can be left out if the rouines from the library
1.39 + * being used are not cryptographic related :-).
1.40 + * 4. If you include any Windows specific code (or a derivative thereof) from
1.41 + * the apps directory (application code) you must include an acknowledgement:
1.42 + * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
1.43 + *
1.44 + * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
1.45 + * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.46 + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1.47 + * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
1.48 + * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1.49 + * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1.50 + * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1.51 + * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1.52 + * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1.53 + * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1.54 + * SUCH DAMAGE.
1.55 + *
1.56 + * The licence and distribution terms for any publically available version or
1.57 + * derivative of this code cannot be changed. i.e. this code cannot simply be
1.58 + * copied and put under another distribution licence
1.59 + * [including the GNU Public Licence.]
1.60 + */
1.61 +/*
1.62 + © Portions copyright (c) 2006 Nokia Corporation. All rights reserved.
1.63 + */
1.64 +
1.65 +#ifndef HEADER_STACK_H
1.66 +#define HEADER_STACK_H
1.67 +#ifdef SYMBIAN
1.68 +#include <e32def.h>
1.69 +#endif
1.70 +#ifdef __cplusplus
1.71 +extern "C" {
1.72 +#endif
1.73 +
1.74 +typedef struct stack_st
1.75 + {
1.76 + int num;
1.77 + char **data;
1.78 + int sorted;
1.79 +
1.80 + int num_alloc;
1.81 + int (*comp)(const char * const *, const char * const *);
1.82 + } STACK;
1.83 +
1.84 +#define M_sk_num(sk) ((sk) ? (sk)->num:-1)
1.85 +#define M_sk_value(sk,n) ((sk) ? (sk)->data[n] : NULL)
1.86 +
1.87 +IMPORT_C int sk_num(const STACK *);
1.88 +IMPORT_C char *sk_value(const STACK *, int);
1.89 +
1.90 +IMPORT_C char *sk_set(STACK *, int, char *);
1.91 +
1.92 +IMPORT_C STACK *sk_new(int (*cmp)(const char * const *, const char * const *));
1.93 +IMPORT_C STACK *sk_new_null(void);
1.94 +IMPORT_C void sk_free(STACK *);
1.95 +IMPORT_C void sk_pop_free(STACK *st, void (*func)(void *));
1.96 +IMPORT_C int sk_insert(STACK *sk,char *data,int where);
1.97 +IMPORT_C char *sk_delete(STACK *st,int loc);
1.98 +IMPORT_C char *sk_delete_ptr(STACK *st, char *p);
1.99 +IMPORT_C int sk_find(STACK *st,char *data);
1.100 +IMPORT_C int sk_find_ex(STACK *st,char *data);
1.101 +IMPORT_C int sk_push(STACK *st,char *data);
1.102 +IMPORT_C int sk_unshift(STACK *st,char *data);
1.103 +IMPORT_C char *sk_shift(STACK *st);
1.104 +IMPORT_C char *sk_pop(STACK *st);
1.105 +IMPORT_C void sk_zero(STACK *st);
1.106 +IMPORT_C int (*sk_set_cmp_func(STACK *sk, int (*c)(const char * const *,
1.107 + const char * const *)))
1.108 + (const char * const *, const char * const *);
1.109 +IMPORT_C STACK *sk_dup(STACK *st);
1.110 +IMPORT_C void sk_sort(STACK *st);
1.111 +IMPORT_C int sk_is_sorted(const STACK *st);
1.112 +#ifdef __cplusplus
1.113 +}
1.114 +#endif
1.115 +
1.116 +#endif