1 /* ====================================================================
2 * Copyright (c) 1999 The OpenSSL Project. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
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
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/)"
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.
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.
30 * 6. Redistributions of any form whatsoever must retain the following
32 * "This product includes software developed by the OpenSSL Project
33 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
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 * ====================================================================
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).
55 #ifndef HEADER_SAFESTACK_H
56 #define HEADER_SAFESTACK_H
58 #include <openssl/stack.h>
60 #define STACK_OF(type) struct stack_st_##type
61 #define PREDECLARE_STACK_OF(type) STACK_OF(type);
63 #define DECLARE_STACK_OF(type) \
68 STACK_OF(type) *sk_##type##_new(int (*cmp)(type **,type **)); \
69 STACK_OF(type) *sk_##type##_new_null(void); \
70 void sk_##type##_free(STACK_OF(type) *sk); \
71 int sk_##type##_num(const STACK_OF(type) *sk); \
72 type *sk_##type##_value(const STACK_OF(type) *sk,int n); \
73 type *sk_##type##_set(STACK_OF(type) *sk,int n,type *v); \
74 void sk_##type##_zero(STACK_OF(type) *sk); \
75 int sk_##type##_push(STACK_OF(type) *sk,type *v); \
76 int sk_##type##_unshift(STACK_OF(type) *sk,type *v); \
77 int sk_##type##_find(STACK_OF(type) *sk,type *v); \
78 type *sk_##type##_delete(STACK_OF(type) *sk,int n); \
79 void sk_##type##_delete_ptr(STACK_OF(type) *sk,type *v); \
80 int sk_##type##_insert(STACK_OF(type) *sk,type *v,int n); \
81 int (*sk_##type##_set_cmp_func(STACK_OF(type) *sk, \
82 int (*cmp)(type **,type **)))(type **,type **); \
83 STACK_OF(type) *sk_##type##_dup(STACK_OF(type) *sk); \
84 void sk_##type##_pop_free(STACK_OF(type) *sk,void (*func)(type *)); \
85 type *sk_##type##_shift(STACK_OF(type) *sk); \
86 type *sk_##type##_pop(STACK_OF(type) *sk); \
87 void sk_##type##_sort(STACK_OF(type) *sk);
89 #define IMPLEMENT_STACK_OF(type) \
90 STACK_OF(type) *sk_##type##_new(int (*cmp)(type **,type **)) \
91 { return (STACK_OF(type) *)sk_new((int (*)())cmp); } \
92 STACK_OF(type) *sk_##type##_new_null() \
93 { return (STACK_OF(type) *)sk_new_null(); } \
94 void sk_##type##_free(STACK_OF(type) *sk) \
95 { sk_free((STACK *)sk); } \
96 int sk_##type##_num(const STACK_OF(type) *sk) \
97 { return M_sk_num((const STACK *)sk); } \
98 type *sk_##type##_value(const STACK_OF(type) *sk,int n) \
99 { return (type *)sk_value((STACK *)sk,n); } \
100 type *sk_##type##_set(STACK_OF(type) *sk,int n,type *v) \
101 { return (type *)(sk_set((STACK *)sk,n,(char *)v)); } \
102 void sk_##type##_zero(STACK_OF(type) *sk) \
103 { sk_zero((STACK *)sk); } \
104 int sk_##type##_push(STACK_OF(type) *sk,type *v) \
105 { return sk_push((STACK *)sk,(char *)v); } \
106 int sk_##type##_unshift(STACK_OF(type) *sk,type *v) \
107 { return sk_unshift((STACK *)sk,(char *)v); } \
108 int sk_##type##_find(STACK_OF(type) *sk,type *v) \
109 { return sk_find((STACK *)sk,(char *)v); } \
110 type *sk_##type##_delete(STACK_OF(type) *sk,int n) \
111 { return (type *)sk_delete((STACK *)sk,n); } \
112 void sk_##type##_delete_ptr(STACK_OF(type) *sk,type *v) \
113 { sk_delete_ptr((STACK *)sk,(char *)v); } \
114 int sk_##type##_insert(STACK_OF(type) *sk,type *v,int n) \
115 { return sk_insert((STACK *)sk,(char *)v,n); } \
116 int (*sk_##type##_set_cmp_func(STACK_OF(type) *sk, \
117 int (*cmp)(type **,type **)))(type **,type **) \
118 { return (int (*)(type **,type **))sk_set_cmp_func((STACK *)sk,(int(*)(const void *, const void *))cmp); } \
119 STACK_OF(type) *sk_##type##_dup(STACK_OF(type) *sk) \
120 { return (STACK_OF(type) *)sk_dup((STACK *)sk); } \
121 void sk_##type##_pop_free(STACK_OF(type) *sk,void (*func)(type *)) \
122 { sk_pop_free((STACK *)sk,(void (*)(void *))func); } \
123 type *sk_##type##_shift(STACK_OF(type) *sk) \
124 { return (type *)sk_shift((STACK *)sk); } \
125 type *sk_##type##_pop(STACK_OF(type) *sk) \
126 { return (type *)sk_pop((STACK *)sk); } \
127 void sk_##type##_sort(STACK_OF(type) *sk) \
128 { sk_sort((STACK *)sk); }
130 #endif /* ndef HEADER_SAFESTACK_H */