blob: 8f15ea2b114de61474060a3249ca7684ee21e470 [file] [log] [blame]
Adam Langley95c29f32014-06-20 12:00:00 -07001/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
2 * All rights reserved.
3 *
4 * This package is an SSL implementation written
5 * by Eric Young (eay@cryptsoft.com).
6 * The implementation was written so as to conform with Netscapes SSL.
7 *
8 * This library is free for commercial and non-commercial use as long as
9 * the following conditions are aheared to. The following conditions
10 * apply to all code found in this distribution, be it the RC4, RSA,
11 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
12 * included with this distribution is covered by the same copyright terms
13 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
14 *
15 * Copyright remains Eric Young's, and as such any Copyright notices in
16 * the code are not to be removed.
17 * If this package is used in a product, Eric Young should be given attribution
18 * as the author of the parts of the library used.
19 * This can be in the form of a textual message at program startup or
20 * in documentation (online or textual) provided with the package.
21 *
22 * Redistribution and use in source and binary forms, with or without
23 * modification, are permitted provided that the following conditions
24 * are met:
25 * 1. Redistributions of source code must retain the copyright
26 * notice, this list of conditions and the following disclaimer.
27 * 2. Redistributions in binary form must reproduce the above copyright
28 * notice, this list of conditions and the following disclaimer in the
29 * documentation and/or other materials provided with the distribution.
30 * 3. All advertising materials mentioning features or use of this software
31 * must display the following acknowledgement:
32 * "This product includes cryptographic software written by
33 * Eric Young (eay@cryptsoft.com)"
34 * The word 'cryptographic' can be left out if the rouines from the library
35 * being used are not cryptographic related :-).
36 * 4. If you include any Windows specific code (or a derivative thereof) from
37 * the apps directory (application code) you must include an acknowledgement:
38 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
39 *
40 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
43 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
50 * SUCH DAMAGE.
51 *
52 * The licence and distribution terms for any publically available version or
53 * derivative of this code cannot be changed. i.e. this code cannot simply be
54 * copied and put under another distribution licence
55 * [including the GNU Public Licence.] */
56
57#ifndef OPENSSL_HEADER_STACK_H
58#define OPENSSL_HEADER_STACK_H
59
60#include <openssl/base.h>
61
62#include <openssl/type_check.h>
63
64#if defined(__cplusplus)
65extern "C" {
66#endif
67
68
69/* A stack, in OpenSSL, is an array of pointers. They are the most commonly
70 * used collection object.
71 *
72 * This file defines macros for type safe use of the stack functions. A stack
73 * of a specific type of object has type |STACK_OF(type)|. This can be defined
74 * (once) with |DEFINE_STACK_OF(type)| and declared where needed with
75 * |DECLARE_STACK_OF(type)|. For example:
76 *
David Benjamin01f8a8c2017-04-15 18:12:55 -040077 * typedef struct foo_st {
Adam Langley95c29f32014-06-20 12:00:00 -070078 * int bar;
David Benjamin01f8a8c2017-04-15 18:12:55 -040079 * } FOO;
Adam Langley95c29f32014-06-20 12:00:00 -070080 *
David Benjamin01f8a8c2017-04-15 18:12:55 -040081 * DEFINE_STACK_OF(FOO);
Adam Langley95c29f32014-06-20 12:00:00 -070082 *
David Benjamin01f8a8c2017-04-15 18:12:55 -040083 * Although note that the stack will contain /pointers/ to |FOO|.
Adam Langley95c29f32014-06-20 12:00:00 -070084 *
85 * A macro will be defined for each of the sk_* functions below. For
David Benjamin01f8a8c2017-04-15 18:12:55 -040086 * STACK_OF(FOO), the macros would be sk_FOO_new, sk_FOO_pop etc. */
Adam Langley95c29f32014-06-20 12:00:00 -070087
88
Adam Langley0ed0cf62015-01-06 10:49:48 -080089/* stack_cmp_func is a comparison function that returns a value < 0, 0 or > 0
Adam Langley95c29f32014-06-20 12:00:00 -070090 * if |*a| is less than, equal to or greater than |*b|, respectively. Note the
91 * extra indirection - the function is given a pointer to a pointer to the
Adam Langley0ed0cf62015-01-06 10:49:48 -080092 * element. This differs from the usual qsort/bsearch comparison function. */
Adam Langley95c29f32014-06-20 12:00:00 -070093typedef int (*stack_cmp_func)(const void **a, const void **b);
94
95/* stack_st contains an array of pointers. It is not designed to be used
96 * directly, rather the wrapper macros should be used. */
97typedef struct stack_st {
98 /* num contains the number of valid pointers in |data|. */
99 size_t num;
100 void **data;
101 /* sorted is non-zero if the values pointed to by |data| are in ascending
102 * order, based on |comp|. */
David Benjamin22edd872016-08-04 21:38:40 +0000103 int sorted;
Adam Langley95c29f32014-06-20 12:00:00 -0700104 /* num_alloc contains the number of pointers allocated in the buffer pointed
105 * to by |data|, which may be larger than |num|. */
106 size_t num_alloc;
Adam Langley0ed0cf62015-01-06 10:49:48 -0800107 /* comp is an optional comparison function. */
Adam Langley95c29f32014-06-20 12:00:00 -0700108 stack_cmp_func comp;
109} _STACK;
110
111
112#define STACK_OF(type) struct stack_st_##type
113
Adam Langley95c29f32014-06-20 12:00:00 -0700114#define DECLARE_STACK_OF(type) STACK_OF(type);
115
Adam Langley95c29f32014-06-20 12:00:00 -0700116/* These are the raw stack functions, you shouldn't be using them. Rather you
117 * should be using the type stack macros implemented above. */
118
Adam Langley0ed0cf62015-01-06 10:49:48 -0800119/* sk_new creates a new, empty stack with the given comparison function, which
Adam Langley95c29f32014-06-20 12:00:00 -0700120 * may be zero. It returns the new stack or NULL on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700121OPENSSL_EXPORT _STACK *sk_new(stack_cmp_func comp);
Adam Langley95c29f32014-06-20 12:00:00 -0700122
123/* sk_new_null creates a new, empty stack. It returns the new stack or NULL on
124 * allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700125OPENSSL_EXPORT _STACK *sk_new_null(void);
Adam Langley95c29f32014-06-20 12:00:00 -0700126
127/* sk_num returns the number of elements in |s|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700128OPENSSL_EXPORT size_t sk_num(const _STACK *sk);
Adam Langley95c29f32014-06-20 12:00:00 -0700129
130/* sk_zero resets |sk| to the empty state but does nothing to free the
131 * individual elements themselves. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700132OPENSSL_EXPORT void sk_zero(_STACK *sk);
Adam Langley95c29f32014-06-20 12:00:00 -0700133
134/* sk_value returns the |i|th pointer in |sk|, or NULL if |i| is out of
135 * range. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700136OPENSSL_EXPORT void *sk_value(const _STACK *sk, size_t i);
Adam Langley95c29f32014-06-20 12:00:00 -0700137
138/* sk_set sets the |i|th pointer in |sk| to |p| and returns |p|. If |i| is out
139 * of range, it returns NULL. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700140OPENSSL_EXPORT void *sk_set(_STACK *sk, size_t i, void *p);
Adam Langley95c29f32014-06-20 12:00:00 -0700141
142/* sk_free frees the given stack and array of pointers, but does nothing to
143 * free the individual elements. Also see |sk_pop_free|. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700144OPENSSL_EXPORT void sk_free(_STACK *sk);
Adam Langley95c29f32014-06-20 12:00:00 -0700145
146/* sk_pop_free calls |free_func| on each element in the stack and then frees
147 * the stack itself. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700148OPENSSL_EXPORT void sk_pop_free(_STACK *sk, void (*free_func)(void *));
Adam Langley95c29f32014-06-20 12:00:00 -0700149
150/* sk_insert inserts |p| into the stack at index |where|, moving existing
151 * elements if needed. It returns the length of the new stack, or zero on
152 * error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700153OPENSSL_EXPORT size_t sk_insert(_STACK *sk, void *p, size_t where);
Adam Langley95c29f32014-06-20 12:00:00 -0700154
155/* sk_delete removes the pointer at index |where|, moving other elements down
156 * if needed. It returns the removed pointer, or NULL if |where| is out of
157 * range. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700158OPENSSL_EXPORT void *sk_delete(_STACK *sk, size_t where);
Adam Langley95c29f32014-06-20 12:00:00 -0700159
160/* sk_delete_ptr removes, at most, one instance of |p| from the stack based on
161 * pointer equality. If an instance of |p| is found then |p| is returned,
162 * otherwise it returns NULL. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700163OPENSSL_EXPORT void *sk_delete_ptr(_STACK *sk, void *p);
Adam Langley95c29f32014-06-20 12:00:00 -0700164
Adam Langley0ed0cf62015-01-06 10:49:48 -0800165/* sk_find returns the first value in the stack equal to |p|. If a comparison
Adam Langley95c29f32014-06-20 12:00:00 -0700166 * function has been set on the stack, then equality is defined by it and the
167 * stack will be sorted if need be so that a binary search can be used.
168 * Otherwise pointer equality is used. If a matching element is found, its
169 * index is written to |*out_index| (if |out_index| is not NULL) and one is
170 * returned. Otherwise zero is returned. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700171OPENSSL_EXPORT int sk_find(_STACK *sk, size_t *out_index, void *p);
Adam Langley95c29f32014-06-20 12:00:00 -0700172
173/* sk_shift removes and returns the first element in the stack, or returns NULL
174 * if the stack is empty. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700175OPENSSL_EXPORT void *sk_shift(_STACK *sk);
Adam Langley95c29f32014-06-20 12:00:00 -0700176
177/* sk_push appends |p| to the stack and returns the length of the new stack, or
178 * 0 on allocation failure. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700179OPENSSL_EXPORT size_t sk_push(_STACK *sk, void *p);
Adam Langley95c29f32014-06-20 12:00:00 -0700180
181/* sk_pop returns and removes the last element on the stack, or NULL if the
182 * stack is empty. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700183OPENSSL_EXPORT void *sk_pop(_STACK *sk);
Adam Langley95c29f32014-06-20 12:00:00 -0700184
185/* sk_dup performs a shallow copy of a stack and returns the new stack, or NULL
186 * on error. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700187OPENSSL_EXPORT _STACK *sk_dup(const _STACK *sk);
Adam Langley95c29f32014-06-20 12:00:00 -0700188
189/* sk_sort sorts the elements of |sk| into ascending order based on the
190 * comparison function. The stack maintains a |sorted| flag and sorting an
191 * already sorted stack is a no-op. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700192OPENSSL_EXPORT void sk_sort(_STACK *sk);
Adam Langley95c29f32014-06-20 12:00:00 -0700193
194/* sk_is_sorted returns one if |sk| is known to be sorted and zero
195 * otherwise. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700196OPENSSL_EXPORT int sk_is_sorted(const _STACK *sk);
Adam Langley95c29f32014-06-20 12:00:00 -0700197
198/* sk_set_cmp_func sets the comparison function to be used by |sk| and returns
199 * the previous one. */
Adam Langleyeb7d2ed2014-07-30 16:02:14 -0700200OPENSSL_EXPORT stack_cmp_func sk_set_cmp_func(_STACK *sk, stack_cmp_func comp);
Adam Langley95c29f32014-06-20 12:00:00 -0700201
Adam Langleya1048a72015-02-11 14:27:21 -0800202/* sk_deep_copy performs a copy of |sk| and of each of the non-NULL elements in
203 * |sk| by using |copy_func|. If an error occurs, |free_func| is used to free
204 * any copies already made and NULL is returned. */
205OPENSSL_EXPORT _STACK *sk_deep_copy(const _STACK *sk,
206 void *(*copy_func)(void *),
207 void (*free_func)(void *));
208
Adam Langley95c29f32014-06-20 12:00:00 -0700209
David Benjamin01f8a8c2017-04-15 18:12:55 -0400210/* Defining stack types.
211 *
212 * This set of macros is used to emit the typed functions that act on a
213 * |STACK_OF(T)|. */
214
David Benjamin01219532017-07-25 22:33:06 -0400215#if !defined(BORINGSSL_NO_CXX)
216extern "C++" {
217namespace bssl {
218namespace internal {
219template <typename T>
220struct StackTraits {};
221}
222}
223}
224
225#define BORINGSSL_DEFINE_STACK_TRAITS(name, is_const) \
226 extern "C++" { \
227 namespace bssl { \
228 namespace internal { \
229 template <> \
230 struct StackTraits<STACK_OF(name)> { \
231 using Type = name; \
232 static constexpr bool kIsConst = is_const; \
233 }; \
234 } \
235 } \
236 }
237
238#else
239#define BORINGSSL_DEFINE_STACK_TRAITS(name, is_const)
240#endif
241
David Benjamin01f8a8c2017-04-15 18:12:55 -0400242/* Stack functions must be tagged unused to support file-local stack types.
243 * Clang's -Wunused-function only allows unused static inline functions if they
244 * are defined in a header. */
245
David Benjamin01219532017-07-25 22:33:06 -0400246#define BORINGSSL_DEFINE_STACK_OF_IMPL(name, ptrtype, constptrtype) \
David Benjamin01f8a8c2017-04-15 18:12:55 -0400247 DECLARE_STACK_OF(name); \
248 \
249 typedef int (*stack_##name##_cmp_func)(constptrtype *a, constptrtype *b); \
250 \
251 static inline OPENSSL_UNUSED STACK_OF(name) * \
252 sk_##name##_new(stack_##name##_cmp_func comp) { \
253 return (STACK_OF(name) *)sk_new((stack_cmp_func)comp); \
254 } \
255 \
256 static inline OPENSSL_UNUSED STACK_OF(name) *sk_##name##_new_null(void) { \
257 return (STACK_OF(name) *)sk_new_null(); \
258 } \
259 \
260 static inline OPENSSL_UNUSED size_t sk_##name##_num( \
261 const STACK_OF(name) *sk) { \
262 return sk_num((const _STACK *)sk); \
263 } \
264 \
265 static inline OPENSSL_UNUSED void sk_##name##_zero(STACK_OF(name) *sk) { \
266 sk_zero((_STACK *)sk); \
267 } \
268 \
269 static inline OPENSSL_UNUSED ptrtype sk_##name##_value( \
270 const STACK_OF(name) *sk, size_t i) { \
271 return (ptrtype)sk_value((const _STACK *)sk, i); \
272 } \
273 \
274 static inline OPENSSL_UNUSED ptrtype sk_##name##_set(STACK_OF(name) *sk, \
275 size_t i, ptrtype p) { \
276 return (ptrtype)sk_set((_STACK *)sk, i, (void *)p); \
277 } \
278 \
279 static inline OPENSSL_UNUSED void sk_##name##_free(STACK_OF(name) *sk) { \
280 sk_free((_STACK *)sk); \
281 } \
282 \
283 static inline OPENSSL_UNUSED void sk_##name##_pop_free( \
284 STACK_OF(name) *sk, void (*free_func)(ptrtype p)) { \
285 sk_pop_free((_STACK *)sk, (void (*)(void *))free_func); \
286 } \
287 \
288 static inline OPENSSL_UNUSED size_t sk_##name##_insert( \
289 STACK_OF(name) *sk, ptrtype p, size_t where) { \
290 return sk_insert((_STACK *)sk, (void *)p, where); \
291 } \
292 \
293 static inline OPENSSL_UNUSED ptrtype sk_##name##_delete(STACK_OF(name) *sk, \
294 size_t where) { \
295 return (ptrtype)sk_delete((_STACK *)sk, where); \
296 } \
297 \
298 static inline OPENSSL_UNUSED ptrtype sk_##name##_delete_ptr( \
299 STACK_OF(name) *sk, ptrtype p) { \
300 return (ptrtype)sk_delete_ptr((_STACK *)sk, (void *)p); \
301 } \
302 \
303 static inline OPENSSL_UNUSED int sk_##name##_find( \
304 STACK_OF(name) *sk, size_t *out_index, ptrtype p) { \
305 return sk_find((_STACK *)sk, out_index, (void *)p); \
306 } \
307 \
308 static inline OPENSSL_UNUSED ptrtype sk_##name##_shift(STACK_OF(name) *sk) { \
309 return (ptrtype)sk_shift((_STACK *)sk); \
310 } \
311 \
312 static inline OPENSSL_UNUSED size_t sk_##name##_push(STACK_OF(name) *sk, \
313 ptrtype p) { \
314 return sk_push((_STACK *)sk, (void *)p); \
315 } \
316 \
317 static inline OPENSSL_UNUSED ptrtype sk_##name##_pop(STACK_OF(name) *sk) { \
318 return (ptrtype)sk_pop((_STACK *)sk); \
319 } \
320 \
321 static inline OPENSSL_UNUSED STACK_OF(name) * \
322 sk_##name##_dup(const STACK_OF(name) *sk) { \
323 return (STACK_OF(name) *)sk_dup((const _STACK *)sk); \
324 } \
325 \
326 static inline OPENSSL_UNUSED void sk_##name##_sort(STACK_OF(name) *sk) { \
327 sk_sort((_STACK *)sk); \
328 } \
329 \
330 static inline OPENSSL_UNUSED int sk_##name##_is_sorted( \
331 const STACK_OF(name) *sk) { \
332 return sk_is_sorted((const _STACK *)sk); \
333 } \
334 \
335 static inline OPENSSL_UNUSED stack_##name##_cmp_func \
336 sk_##name##_set_cmp_func(STACK_OF(name) *sk, \
337 stack_##name##_cmp_func comp) { \
338 return (stack_##name##_cmp_func)sk_set_cmp_func((_STACK *)sk, \
339 (stack_cmp_func)comp); \
340 } \
341 \
342 static inline OPENSSL_UNUSED STACK_OF(name) * \
343 sk_##name##_deep_copy(const STACK_OF(name) *sk, \
344 ptrtype(*copy_func)(ptrtype), \
345 void (*free_func)(ptrtype)) { \
346 return (STACK_OF(name) *)sk_deep_copy((_STACK *)sk, \
347 (void *(*)(void *))copy_func, \
348 (void (*)(void *))free_func); \
349 }
350
351/* DEFINE_STACK_OF defines |STACK_OF(type)| to be a stack whose elements are
352 * |type| *. */
David Benjamin01219532017-07-25 22:33:06 -0400353#define DEFINE_STACK_OF(type) \
354 BORINGSSL_DEFINE_STACK_OF_IMPL(type, type *, const type *) \
355 BORINGSSL_DEFINE_STACK_TRAITS(type, false)
David Benjamin01f8a8c2017-04-15 18:12:55 -0400356
357/* DEFINE_CONST_STACK_OF defines |STACK_OF(type)| to be a stack whose elements
358 * are const |type| *. */
359#define DEFINE_CONST_STACK_OF(type) \
David Benjamin01219532017-07-25 22:33:06 -0400360 BORINGSSL_DEFINE_STACK_OF_IMPL(type, const type *, const type *) \
361 BORINGSSL_DEFINE_STACK_TRAITS(type, true)
David Benjamin01f8a8c2017-04-15 18:12:55 -0400362
363/* DEFINE_SPECIAL_STACK_OF defines |STACK_OF(type)| to be a stack whose elements
364 * are |type|, where |type| must be a typedef for a pointer. */
365#define DEFINE_SPECIAL_STACK_OF(type) \
366 OPENSSL_COMPILE_ASSERT(sizeof(type) == sizeof(void *), \
367 special_stack_of_non_pointer_##type); \
David Benjamin01219532017-07-25 22:33:06 -0400368 BORINGSSL_DEFINE_STACK_OF_IMPL(type, type, const type)
David Benjamin01f8a8c2017-04-15 18:12:55 -0400369
370
371typedef char *OPENSSL_STRING;
372
373DEFINE_STACK_OF(void)
374DEFINE_SPECIAL_STACK_OF(OPENSSL_STRING)
375
376
Adam Langley95c29f32014-06-20 12:00:00 -0700377#if defined(__cplusplus)
378} /* extern C */
Adam Langley95c29f32014-06-20 12:00:00 -0700379#endif
380
David Benjamin01219532017-07-25 22:33:06 -0400381#if !defined(BORINGSSL_NO_CXX)
382extern "C++" {
383
384#include <type_traits>
385
386namespace bssl {
387
388namespace internal {
389
390// Stacks defined with |DEFINE_CONST_STACK_OF| are freed with |sk_free|.
391template <typename Stack>
392struct DeleterImpl<
393 Stack, typename std::enable_if<StackTraits<Stack>::kIsConst>::type> {
394 static void Free(Stack *sk) { sk_free(reinterpret_cast<_STACK *>(sk)); }
395};
396
397// Stacks defined with |DEFINE_STACK_OF| are freed with |sk_pop_free| and the
398// corresponding type's deleter.
399template <typename Stack>
400struct DeleterImpl<
401 Stack, typename std::enable_if<!StackTraits<Stack>::kIsConst>::type> {
402 static void Free(Stack *sk) {
403 sk_pop_free(
404 reinterpret_cast<_STACK *>(sk),
405 reinterpret_cast<void (*)(void *)>(
406 DeleterImpl<typename StackTraits<Stack>::Type>::Free));
407 }
408};
409
410} // namespace internal
411
412} // namespace bssl
413
414} // extern C++
415#endif
416
Adam Langley95c29f32014-06-20 12:00:00 -0700417#endif /* OPENSSL_HEADER_STACK_H */