diff options
Diffstat (limited to 'src/lib/libcrypto/stack/safestack.h')
-rw-r--r-- | src/lib/libcrypto/stack/safestack.h | 129 |
1 files changed, 129 insertions, 0 deletions
diff --git a/src/lib/libcrypto/stack/safestack.h b/src/lib/libcrypto/stack/safestack.h new file mode 100644 index 0000000000..38934981e3 --- /dev/null +++ b/src/lib/libcrypto/stack/safestack.h | |||
@@ -0,0 +1,129 @@ | |||
1 | /* ==================================================================== | ||
2 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
3 | * | ||
4 | * Redistribution and use in source and binary forms, with or without | ||
5 | * modification, are permitted provided that the following conditions | ||
6 | * are met: | ||
7 | * | ||
8 | * 1. Redistributions of source code must retain the above copyright | ||
9 | * notice, this list of conditions and the following disclaimer. | ||
10 | * | ||
11 | * 2. Redistributions in binary form must reproduce the above copyright | ||
12 | * notice, this list of conditions and the following disclaimer in | ||
13 | * the documentation and/or other materials provided with the | ||
14 | * distribution. | ||
15 | * | ||
16 | * 3. All advertising materials mentioning features or use of this | ||
17 | * software must display the following acknowledgment: | ||
18 | * "This product includes software developed by the OpenSSL Project | ||
19 | * for use in the OpenSSL Toolkit. (http://www.openssl.org/)" | ||
20 | * | ||
21 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
22 | * endorse or promote products derived from this software without | ||
23 | * prior written permission. For written permission, please contact | ||
24 | * openssl-core@openssl.org. | ||
25 | * | ||
26 | * 5. Products derived from this software may not be called "OpenSSL" | ||
27 | * nor may "OpenSSL" appear in their names without prior written | ||
28 | * permission of the OpenSSL Project. | ||
29 | * | ||
30 | * 6. Redistributions of any form whatsoever must retain the following | ||
31 | * acknowledgment: | ||
32 | * "This product includes software developed by the OpenSSL Project | ||
33 | * for use in the OpenSSL Toolkit (http://www.openssl.org/)" | ||
34 | * | ||
35 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
36 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
37 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
38 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
39 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
40 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
41 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
42 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
43 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
44 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
45 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
46 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
47 | * ==================================================================== | ||
48 | * | ||
49 | * This product includes cryptographic software written by Eric Young | ||
50 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
51 | * Hudson (tjh@cryptsoft.com). | ||
52 | * | ||
53 | */ | ||
54 | |||
55 | #ifndef HEADER_SAFESTACK_H | ||
56 | #define HEADER_SAFESTACK_H | ||
57 | |||
58 | #include <openssl/stack.h> | ||
59 | |||
60 | #define STACK_OF(type) STACK_##type | ||
61 | |||
62 | #define DECLARE_STACK_OF(type) \ | ||
63 | typedef struct stack_st_##type \ | ||
64 | { \ | ||
65 | STACK stack; \ | ||
66 | } STACK_OF(type); \ | ||
67 | STACK_OF(type) *sk_##type##_new(int (*cmp)(type **,type **)); \ | ||
68 | STACK_OF(type) *sk_##type##_new_null(void); \ | ||
69 | void sk_##type##_free(STACK_OF(type) *sk); \ | ||
70 | int sk_##type##_num(const STACK_OF(type) *sk); \ | ||
71 | type *sk_##type##_value(const STACK_OF(type) *sk,int n); \ | ||
72 | type *sk_##type##_set(STACK_OF(type) *sk,int n,type *v); \ | ||
73 | void sk_##type##_zero(STACK_OF(type) *sk); \ | ||
74 | int sk_##type##_push(STACK_OF(type) *sk,type *v); \ | ||
75 | int sk_##type##_unshift(STACK_OF(type) *sk,type *v); \ | ||
76 | int sk_##type##_find(STACK_OF(type) *sk,type *v); \ | ||
77 | type *sk_##type##_delete(STACK_OF(type) *sk,int n); \ | ||
78 | void sk_##type##_delete_ptr(STACK_OF(type) *sk,type *v); \ | ||
79 | int sk_##type##_insert(STACK_OF(type) *sk,type *v,int n); \ | ||
80 | int (*sk_##type##_set_cmp_func(STACK_OF(type) *sk, \ | ||
81 | int (*cmp)(type **,type **)))(type **,type **); \ | ||
82 | STACK_OF(type) *sk_##type##_dup(STACK_OF(type) *sk); \ | ||
83 | void sk_##type##_pop_free(STACK_OF(type) *sk,void (*func)(type *)); \ | ||
84 | type *sk_##type##_shift(STACK_OF(type) *sk); \ | ||
85 | type *sk_##type##_pop(STACK_OF(type) *sk); \ | ||
86 | void sk_##type##_sort(STACK_OF(type) *sk); | ||
87 | |||
88 | #define IMPLEMENT_STACK_OF(type) \ | ||
89 | STACK_OF(type) *sk_##type##_new(int (*cmp)(type **,type **)) \ | ||
90 | { return (STACK_OF(type) *)sk_new(cmp); } \ | ||
91 | STACK_OF(type) *sk_##type##_new_null() \ | ||
92 | { return (STACK_OF(type) *)sk_new_null(); } \ | ||
93 | void sk_##type##_free(STACK_OF(type) *sk) \ | ||
94 | { sk_free((STACK *)sk); } \ | ||
95 | int sk_##type##_num(const STACK_OF(type) *sk) \ | ||
96 | { return M_sk_num((const STACK *)sk); } \ | ||
97 | type *sk_##type##_value(const STACK_OF(type) *sk,int n) \ | ||
98 | { return (type *)sk_value((STACK *)sk,n); } \ | ||
99 | type *sk_##type##_set(STACK_OF(type) *sk,int n,type *v) \ | ||
100 | { return (type *)(sk_set((STACK *)sk,n,(char *)v)); } \ | ||
101 | void sk_##type##_zero(STACK_OF(type) *sk) \ | ||
102 | { sk_zero((STACK *)sk); } \ | ||
103 | int sk_##type##_push(STACK_OF(type) *sk,type *v) \ | ||
104 | { return sk_push((STACK *)sk,(char *)v); } \ | ||
105 | int sk_##type##_unshift(STACK_OF(type) *sk,type *v) \ | ||
106 | { return sk_unshift((STACK *)sk,(char *)v); } \ | ||
107 | int sk_##type##_find(STACK_OF(type) *sk,type *v) \ | ||
108 | { return sk_find((STACK *)sk,(char *)v); } \ | ||
109 | type *sk_##type##_delete(STACK_OF(type) *sk,int n) \ | ||
110 | { return (type *)sk_delete((STACK *)sk,n); } \ | ||
111 | void sk_##type##_delete_ptr(STACK_OF(type) *sk,type *v) \ | ||
112 | { sk_delete_ptr((STACK *)sk,(char *)v); } \ | ||
113 | int sk_##type##_insert(STACK_OF(type) *sk,type *v,int n) \ | ||
114 | { return sk_insert((STACK *)sk,(char *)v,n); } \ | ||
115 | int (*sk_##type##_set_cmp_func(STACK_OF(type) *sk, \ | ||
116 | int (*cmp)(type **,type **)))(type **,type **) \ | ||
117 | { return (int (*)(type **,type **))sk_set_cmp_func((STACK *)sk,cmp); } \ | ||
118 | STACK_OF(type) *sk_##type##_dup(STACK_OF(type) *sk) \ | ||
119 | { return (STACK_OF(type) *)sk_dup((STACK *)sk); } \ | ||
120 | void sk_##type##_pop_free(STACK_OF(type) *sk,void (*func)(type *)) \ | ||
121 | { sk_pop_free((STACK *)sk,func); } \ | ||
122 | type *sk_##type##_shift(STACK_OF(type) *sk) \ | ||
123 | { return (type *)sk_shift((STACK *)sk); } \ | ||
124 | type *sk_##type##_pop(STACK_OF(type) *sk) \ | ||
125 | { return (type *)sk_pop((STACK *)sk); } \ | ||
126 | void sk_##type##_sort(STACK_OF(type) *sk) \ | ||
127 | { sk_sort((STACK *)sk); } | ||
128 | |||
129 | #endif /* ndef HEADER_SAFESTACK_H */ | ||