00001 /* crypto/stack/stack.h */ 00002 /* Copyright (C) 1995-1998 Eric Young ([email protected]) 00003 * All rights reserved. 00004 * 00005 * This package is an SSL implementation written 00006 * by Eric Young ([email protected]). 00007 * The implementation was written so as to conform with Netscapes SSL. 00008 * 00009 * This library is free for commercial and non-commercial use as long as 00010 * the following conditions are aheared to. The following conditions 00011 * apply to all code found in this distribution, be it the RC4, RSA, 00012 * lhash, DES, etc., code; not just the SSL code. The SSL documentation 00013 * included with this distribution is covered by the same copyright terms 00014 * except that the holder is Tim Hudson ([email protected]). 00015 * 00016 * Copyright remains Eric Young's, and as such any Copyright notices in 00017 * the code are not to be removed. 00018 * If this package is used in a product, Eric Young should be given attribution 00019 * as the author of the parts of the library used. 00020 * This can be in the form of a textual message at program startup or 00021 * in documentation (online or textual) provided with the package. 00022 * 00023 * Redistribution and use in source and binary forms, with or without 00024 * modification, are permitted provided that the following conditions 00025 * are met: 00026 * 1. Redistributions of source code must retain the copyright 00027 * notice, this list of conditions and the following disclaimer. 00028 * 2. Redistributions in binary form must reproduce the above copyright 00029 * notice, this list of conditions and the following disclaimer in the 00030 * documentation and/or other materials provided with the distribution. 00031 * 3. All advertising materials mentioning features or use of this software 00032 * must display the following acknowledgement: 00033 * "This product includes cryptographic software written by 00034 * Eric Young ([email protected])" 00035 * The word 'cryptographic' can be left out if the rouines from the library 00036 * being used are not cryptographic related :-). 00037 * 4. If you include any Windows specific code (or a derivative thereof) from 00038 * the apps directory (application code) you must include an acknowledgement: 00039 * "This product includes software written by Tim Hudson ([email protected])" 00040 * 00041 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 00042 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00043 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00044 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 00045 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00046 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 00047 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00048 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00049 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 00050 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00051 * SUCH DAMAGE. 00052 * 00053 * The licence and distribution terms for any publically available version or 00054 * derivative of this code cannot be changed. i.e. this code cannot simply be 00055 * copied and put under another distribution licence 00056 * [including the GNU Public Licence.] 00057 */ 00058 /* 00059 © Portions copyright (c) 2006 Nokia Corporation. All rights reserved. 00060 */ 00061 00062 #ifndef HEADER_STACK_H 00063 #define HEADER_STACK_H 00064 00065 #if (defined(__SYMBIAN32__) && !defined(SYMBIAN)) 00066 #define SYMBIAN 00067 #endif 00068 00069 #ifdef SYMBIAN 00070 #include <e32def.h> 00071 #endif 00072 #ifdef __cplusplus 00073 extern "C" { 00074 #endif 00075 00076 typedef struct stack_st 00077 { 00078 int num; 00079 char **data; 00080 int sorted; 00081 00082 int num_alloc; 00083 int (*comp)(const char * const *, const char * const *); 00084 } STACK; 00085 00086 #define M_sk_num(sk) ((sk) ? (sk)->num:-1) 00087 #define M_sk_value(sk,n) ((sk) ? (sk)->data[n] : NULL) 00088 00089 IMPORT_C int sk_num(const STACK *); 00090 IMPORT_C char *sk_value(const STACK *, int); 00091 00092 IMPORT_C char *sk_set(STACK *, int, char *); 00093 00094 IMPORT_C STACK *sk_new(int (*cmp)(const char * const *, const char * const *)); 00095 IMPORT_C STACK *sk_new_null(void); 00096 IMPORT_C void sk_free(STACK *); 00097 IMPORT_C void sk_pop_free(STACK *st, void (*func)(void *)); 00098 IMPORT_C int sk_insert(STACK *sk,char *data,int where); 00099 IMPORT_C char *sk_delete(STACK *st,int loc); 00100 IMPORT_C char *sk_delete_ptr(STACK *st, char *p); 00101 IMPORT_C int sk_find(STACK *st,char *data); 00102 IMPORT_C int sk_find_ex(STACK *st,char *data); 00103 IMPORT_C int sk_push(STACK *st,char *data); 00104 IMPORT_C int sk_unshift(STACK *st,char *data); 00105 IMPORT_C char *sk_shift(STACK *st); 00106 IMPORT_C char *sk_pop(STACK *st); 00107 IMPORT_C void sk_zero(STACK *st); 00108 IMPORT_C int (*sk_set_cmp_func(STACK *sk, int (*c)(const char * const *, 00109 const char * const *))) 00110 (const char * const *, const char * const *); 00111 IMPORT_C STACK *sk_dup(STACK *st); 00112 IMPORT_C void sk_sort(STACK *st); 00113 IMPORT_C int sk_is_sorted(const STACK *st); 00114 #ifdef __cplusplus 00115 } 00116 #endif 00117 00118 #endif