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