epoc32/include/stdapis/openssl/stack.h
author William Roberts <williamr@symbian.org>
Wed, 31 Mar 2010 12:33:34 +0100
branchSymbian3
changeset 4 837f303aceeb
parent 0 061f57f2323e
permissions -rw-r--r--
Current Symbian^3 public API header files (from PDK 3.0.h)
This is the epoc32/include tree with the "platform" subtrees removed, and
all but a selected few mbg and rsg files removed.
williamr@2
     1
/* crypto/stack/stack.h */
williamr@2
     2
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
williamr@2
     3
 * All rights reserved.
williamr@2
     4
 *
williamr@2
     5
 * This package is an SSL implementation written
williamr@2
     6
 * by Eric Young (eay@cryptsoft.com).
williamr@2
     7
 * The implementation was written so as to conform with Netscapes SSL.
williamr@2
     8
 * 
williamr@2
     9
 * This library is free for commercial and non-commercial use as long as
williamr@2
    10
 * the following conditions are aheared to.  The following conditions
williamr@2
    11
 * apply to all code found in this distribution, be it the RC4, RSA,
williamr@2
    12
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
williamr@2
    13
 * included with this distribution is covered by the same copyright terms
williamr@2
    14
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
williamr@2
    15
 * 
williamr@2
    16
 * Copyright remains Eric Young's, and as such any Copyright notices in
williamr@2
    17
 * the code are not to be removed.
williamr@2
    18
 * If this package is used in a product, Eric Young should be given attribution
williamr@2
    19
 * as the author of the parts of the library used.
williamr@2
    20
 * This can be in the form of a textual message at program startup or
williamr@2
    21
 * in documentation (online or textual) provided with the package.
williamr@2
    22
 * 
williamr@2
    23
 * Redistribution and use in source and binary forms, with or without
williamr@2
    24
 * modification, are permitted provided that the following conditions
williamr@2
    25
 * are met:
williamr@2
    26
 * 1. Redistributions of source code must retain the copyright
williamr@2
    27
 *    notice, this list of conditions and the following disclaimer.
williamr@2
    28
 * 2. Redistributions in binary form must reproduce the above copyright
williamr@2
    29
 *    notice, this list of conditions and the following disclaimer in the
williamr@2
    30
 *    documentation and/or other materials provided with the distribution.
williamr@2
    31
 * 3. All advertising materials mentioning features or use of this software
williamr@2
    32
 *    must display the following acknowledgement:
williamr@2
    33
 *    "This product includes cryptographic software written by
williamr@2
    34
 *     Eric Young (eay@cryptsoft.com)"
williamr@2
    35
 *    The word 'cryptographic' can be left out if the rouines from the library
williamr@2
    36
 *    being used are not cryptographic related :-).
williamr@2
    37
 * 4. If you include any Windows specific code (or a derivative thereof) from 
williamr@2
    38
 *    the apps directory (application code) you must include an acknowledgement:
williamr@2
    39
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
williamr@2
    40
 * 
williamr@2
    41
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
williamr@2
    42
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
williamr@2
    43
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
williamr@2
    44
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
williamr@2
    45
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
williamr@2
    46
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
williamr@2
    47
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
williamr@2
    48
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
williamr@2
    49
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
williamr@2
    50
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
williamr@2
    51
 * SUCH DAMAGE.
williamr@2
    52
 * 
williamr@2
    53
 * The licence and distribution terms for any publically available version or
williamr@2
    54
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
williamr@2
    55
 * copied and put under another distribution licence
williamr@2
    56
 * [including the GNU Public Licence.]
williamr@2
    57
 */
williamr@2
    58
/*
williamr@2
    59
 © Portions copyright (c) 2006 Nokia Corporation.  All rights reserved.
williamr@2
    60
 */
williamr@2
    61
williamr@2
    62
#ifndef HEADER_STACK_H
williamr@2
    63
#define HEADER_STACK_H
williamr@2
    64
williamr@2
    65
#if (defined(__SYMBIAN32__) && !defined(SYMBIAN))
williamr@2
    66
#define SYMBIAN
williamr@2
    67
#endif
williamr@2
    68
williamr@2
    69
#ifdef SYMBIAN
williamr@2
    70
#include <e32def.h>
williamr@2
    71
#endif
williamr@2
    72
#ifdef  __cplusplus
williamr@2
    73
extern "C" {
williamr@2
    74
#endif
williamr@2
    75
williamr@2
    76
typedef struct stack_st
williamr@2
    77
	{
williamr@2
    78
	int num;
williamr@2
    79
	char **data;
williamr@2
    80
	int sorted;
williamr@2
    81
williamr@2
    82
	int num_alloc;
williamr@2
    83
	int (*comp)(const char * const *, const char * const *);
williamr@2
    84
	} STACK;
williamr@2
    85
williamr@2
    86
#define M_sk_num(sk)		((sk) ? (sk)->num:-1)
williamr@2
    87
#define M_sk_value(sk,n)	((sk) ? (sk)->data[n] : NULL)
williamr@2
    88
williamr@2
    89
IMPORT_C int sk_num(const STACK *);
williamr@2
    90
IMPORT_C char *sk_value(const STACK *, int);
williamr@2
    91
williamr@2
    92
IMPORT_C char *sk_set(STACK *, int, char *);
williamr@2
    93
williamr@2
    94
IMPORT_C STACK *sk_new(int (*cmp)(const char * const *, const char * const *));
williamr@2
    95
IMPORT_C STACK *sk_new_null(void);
williamr@2
    96
IMPORT_C void sk_free(STACK *);
williamr@2
    97
IMPORT_C void sk_pop_free(STACK *st, void (*func)(void *));
williamr@2
    98
IMPORT_C int sk_insert(STACK *sk,char *data,int where);
williamr@2
    99
IMPORT_C char *sk_delete(STACK *st,int loc);
williamr@2
   100
IMPORT_C char *sk_delete_ptr(STACK *st, char *p);
williamr@2
   101
IMPORT_C int sk_find(STACK *st,char *data);
williamr@2
   102
IMPORT_C int sk_find_ex(STACK *st,char *data);
williamr@2
   103
IMPORT_C int sk_push(STACK *st,char *data);
williamr@2
   104
IMPORT_C int sk_unshift(STACK *st,char *data);
williamr@2
   105
IMPORT_C char *sk_shift(STACK *st);
williamr@2
   106
IMPORT_C char *sk_pop(STACK *st);
williamr@2
   107
IMPORT_C void sk_zero(STACK *st);
williamr@2
   108
IMPORT_C int (*sk_set_cmp_func(STACK *sk, int (*c)(const char * const *,
williamr@2
   109
			const char * const *)))
williamr@2
   110
			(const char * const *, const char * const *);
williamr@2
   111
IMPORT_C STACK *sk_dup(STACK *st);
williamr@2
   112
IMPORT_C void sk_sort(STACK *st);
williamr@2
   113
IMPORT_C int sk_is_sorted(const STACK *st);
williamr@2
   114
#ifdef  __cplusplus
williamr@2
   115
}
williamr@2
   116
#endif
williamr@2
   117
williamr@2
   118
#endif