25개 이상의 토픽을 선택하실 수 없습니다. Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

stack.h 18 KiB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351
  1. /* 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. #ifndef OPENSSL_HEADER_STACK_H
  57. #define OPENSSL_HEADER_STACK_H
  58. #include <openssl/base.h>
  59. #include <openssl/type_check.h>
  60. #if defined(__cplusplus)
  61. extern "C" {
  62. #endif
  63. /* A stack, in OpenSSL, is an array of pointers. They are the most commonly
  64. * used collection object.
  65. *
  66. * This file defines macros for type safe use of the stack functions. A stack
  67. * of a specific type of object has type |STACK_OF(type)|. This can be defined
  68. * (once) with |DEFINE_STACK_OF(type)| and declared where needed with
  69. * |DECLARE_STACK_OF(type)|. For example:
  70. *
  71. * typedef struct foo_st {
  72. * int bar;
  73. * } FOO;
  74. *
  75. * DEFINE_STACK_OF(FOO);
  76. *
  77. * Although note that the stack will contain /pointers/ to |FOO|.
  78. *
  79. * A macro will be defined for each of the sk_* functions below. For
  80. * STACK_OF(FOO), the macros would be sk_FOO_new, sk_FOO_pop etc. */
  81. /* stack_cmp_func is a comparison function that returns a value < 0, 0 or > 0
  82. * if |*a| is less than, equal to or greater than |*b|, respectively. Note the
  83. * extra indirection - the function is given a pointer to a pointer to the
  84. * element. This differs from the usual qsort/bsearch comparison function. */
  85. typedef int (*stack_cmp_func)(const void **a, const void **b);
  86. /* stack_st contains an array of pointers. It is not designed to be used
  87. * directly, rather the wrapper macros should be used. */
  88. typedef struct stack_st {
  89. /* num contains the number of valid pointers in |data|. */
  90. size_t num;
  91. void **data;
  92. /* sorted is non-zero if the values pointed to by |data| are in ascending
  93. * order, based on |comp|. */
  94. int sorted;
  95. /* num_alloc contains the number of pointers allocated in the buffer pointed
  96. * to by |data|, which may be larger than |num|. */
  97. size_t num_alloc;
  98. /* comp is an optional comparison function. */
  99. stack_cmp_func comp;
  100. } _STACK;
  101. #define STACK_OF(type) struct stack_st_##type
  102. #define DECLARE_STACK_OF(type) STACK_OF(type);
  103. /* These are the raw stack functions, you shouldn't be using them. Rather you
  104. * should be using the type stack macros implemented above. */
  105. /* sk_new creates a new, empty stack with the given comparison function, which
  106. * may be zero. It returns the new stack or NULL on allocation failure. */
  107. OPENSSL_EXPORT _STACK *sk_new(stack_cmp_func comp);
  108. /* sk_new_null creates a new, empty stack. It returns the new stack or NULL on
  109. * allocation failure. */
  110. OPENSSL_EXPORT _STACK *sk_new_null(void);
  111. /* sk_num returns the number of elements in |s|. */
  112. OPENSSL_EXPORT size_t sk_num(const _STACK *sk);
  113. /* sk_zero resets |sk| to the empty state but does nothing to free the
  114. * individual elements themselves. */
  115. OPENSSL_EXPORT void sk_zero(_STACK *sk);
  116. /* sk_value returns the |i|th pointer in |sk|, or NULL if |i| is out of
  117. * range. */
  118. OPENSSL_EXPORT void *sk_value(const _STACK *sk, size_t i);
  119. /* sk_set sets the |i|th pointer in |sk| to |p| and returns |p|. If |i| is out
  120. * of range, it returns NULL. */
  121. OPENSSL_EXPORT void *sk_set(_STACK *sk, size_t i, void *p);
  122. /* sk_free frees the given stack and array of pointers, but does nothing to
  123. * free the individual elements. Also see |sk_pop_free|. */
  124. OPENSSL_EXPORT void sk_free(_STACK *sk);
  125. /* sk_pop_free calls |free_func| on each element in the stack and then frees
  126. * the stack itself. */
  127. OPENSSL_EXPORT void sk_pop_free(_STACK *sk, void (*free_func)(void *));
  128. /* sk_insert inserts |p| into the stack at index |where|, moving existing
  129. * elements if needed. It returns the length of the new stack, or zero on
  130. * error. */
  131. OPENSSL_EXPORT size_t sk_insert(_STACK *sk, void *p, size_t where);
  132. /* sk_delete removes the pointer at index |where|, moving other elements down
  133. * if needed. It returns the removed pointer, or NULL if |where| is out of
  134. * range. */
  135. OPENSSL_EXPORT void *sk_delete(_STACK *sk, size_t where);
  136. /* sk_delete_ptr removes, at most, one instance of |p| from the stack based on
  137. * pointer equality. If an instance of |p| is found then |p| is returned,
  138. * otherwise it returns NULL. */
  139. OPENSSL_EXPORT void *sk_delete_ptr(_STACK *sk, void *p);
  140. /* sk_find returns the first value in the stack equal to |p|. If a comparison
  141. * function has been set on the stack, then equality is defined by it and the
  142. * stack will be sorted if need be so that a binary search can be used.
  143. * Otherwise pointer equality is used. If a matching element is found, its
  144. * index is written to |*out_index| (if |out_index| is not NULL) and one is
  145. * returned. Otherwise zero is returned. */
  146. OPENSSL_EXPORT int sk_find(_STACK *sk, size_t *out_index, void *p);
  147. /* sk_shift removes and returns the first element in the stack, or returns NULL
  148. * if the stack is empty. */
  149. OPENSSL_EXPORT void *sk_shift(_STACK *sk);
  150. /* sk_push appends |p| to the stack and returns the length of the new stack, or
  151. * 0 on allocation failure. */
  152. OPENSSL_EXPORT size_t sk_push(_STACK *sk, void *p);
  153. /* sk_pop returns and removes the last element on the stack, or NULL if the
  154. * stack is empty. */
  155. OPENSSL_EXPORT void *sk_pop(_STACK *sk);
  156. /* sk_dup performs a shallow copy of a stack and returns the new stack, or NULL
  157. * on error. */
  158. OPENSSL_EXPORT _STACK *sk_dup(const _STACK *sk);
  159. /* sk_sort sorts the elements of |sk| into ascending order based on the
  160. * comparison function. The stack maintains a |sorted| flag and sorting an
  161. * already sorted stack is a no-op. */
  162. OPENSSL_EXPORT void sk_sort(_STACK *sk);
  163. /* sk_is_sorted returns one if |sk| is known to be sorted and zero
  164. * otherwise. */
  165. OPENSSL_EXPORT int sk_is_sorted(const _STACK *sk);
  166. /* sk_set_cmp_func sets the comparison function to be used by |sk| and returns
  167. * the previous one. */
  168. OPENSSL_EXPORT stack_cmp_func sk_set_cmp_func(_STACK *sk, stack_cmp_func comp);
  169. /* sk_deep_copy performs a copy of |sk| and of each of the non-NULL elements in
  170. * |sk| by using |copy_func|. If an error occurs, |free_func| is used to free
  171. * any copies already made and NULL is returned. */
  172. OPENSSL_EXPORT _STACK *sk_deep_copy(const _STACK *sk,
  173. void *(*copy_func)(void *),
  174. void (*free_func)(void *));
  175. /* Defining stack types.
  176. *
  177. * This set of macros is used to emit the typed functions that act on a
  178. * |STACK_OF(T)|. */
  179. /* Stack functions must be tagged unused to support file-local stack types.
  180. * Clang's -Wunused-function only allows unused static inline functions if they
  181. * are defined in a header. */
  182. #define DEFINE_STACK_OF_IMPL(name, ptrtype, constptrtype) \
  183. DECLARE_STACK_OF(name); \
  184. \
  185. typedef int (*stack_##name##_cmp_func)(constptrtype *a, constptrtype *b); \
  186. \
  187. static inline OPENSSL_UNUSED STACK_OF(name) * \
  188. sk_##name##_new(stack_##name##_cmp_func comp) { \
  189. return (STACK_OF(name) *)sk_new((stack_cmp_func)comp); \
  190. } \
  191. \
  192. static inline OPENSSL_UNUSED STACK_OF(name) *sk_##name##_new_null(void) { \
  193. return (STACK_OF(name) *)sk_new_null(); \
  194. } \
  195. \
  196. static inline OPENSSL_UNUSED size_t sk_##name##_num( \
  197. const STACK_OF(name) *sk) { \
  198. return sk_num((const _STACK *)sk); \
  199. } \
  200. \
  201. static inline OPENSSL_UNUSED void sk_##name##_zero(STACK_OF(name) *sk) { \
  202. sk_zero((_STACK *)sk); \
  203. } \
  204. \
  205. static inline OPENSSL_UNUSED ptrtype sk_##name##_value( \
  206. const STACK_OF(name) *sk, size_t i) { \
  207. return (ptrtype)sk_value((const _STACK *)sk, i); \
  208. } \
  209. \
  210. static inline OPENSSL_UNUSED ptrtype sk_##name##_set(STACK_OF(name) *sk, \
  211. size_t i, ptrtype p) { \
  212. return (ptrtype)sk_set((_STACK *)sk, i, (void *)p); \
  213. } \
  214. \
  215. static inline OPENSSL_UNUSED void sk_##name##_free(STACK_OF(name) *sk) { \
  216. sk_free((_STACK *)sk); \
  217. } \
  218. \
  219. static inline OPENSSL_UNUSED void sk_##name##_pop_free( \
  220. STACK_OF(name) *sk, void (*free_func)(ptrtype p)) { \
  221. sk_pop_free((_STACK *)sk, (void (*)(void *))free_func); \
  222. } \
  223. \
  224. static inline OPENSSL_UNUSED size_t sk_##name##_insert( \
  225. STACK_OF(name) *sk, ptrtype p, size_t where) { \
  226. return sk_insert((_STACK *)sk, (void *)p, where); \
  227. } \
  228. \
  229. static inline OPENSSL_UNUSED ptrtype sk_##name##_delete(STACK_OF(name) *sk, \
  230. size_t where) { \
  231. return (ptrtype)sk_delete((_STACK *)sk, where); \
  232. } \
  233. \
  234. static inline OPENSSL_UNUSED ptrtype sk_##name##_delete_ptr( \
  235. STACK_OF(name) *sk, ptrtype p) { \
  236. return (ptrtype)sk_delete_ptr((_STACK *)sk, (void *)p); \
  237. } \
  238. \
  239. static inline OPENSSL_UNUSED int sk_##name##_find( \
  240. STACK_OF(name) *sk, size_t *out_index, ptrtype p) { \
  241. return sk_find((_STACK *)sk, out_index, (void *)p); \
  242. } \
  243. \
  244. static inline OPENSSL_UNUSED ptrtype sk_##name##_shift(STACK_OF(name) *sk) { \
  245. return (ptrtype)sk_shift((_STACK *)sk); \
  246. } \
  247. \
  248. static inline OPENSSL_UNUSED size_t sk_##name##_push(STACK_OF(name) *sk, \
  249. ptrtype p) { \
  250. return sk_push((_STACK *)sk, (void *)p); \
  251. } \
  252. \
  253. static inline OPENSSL_UNUSED ptrtype sk_##name##_pop(STACK_OF(name) *sk) { \
  254. return (ptrtype)sk_pop((_STACK *)sk); \
  255. } \
  256. \
  257. static inline OPENSSL_UNUSED STACK_OF(name) * \
  258. sk_##name##_dup(const STACK_OF(name) *sk) { \
  259. return (STACK_OF(name) *)sk_dup((const _STACK *)sk); \
  260. } \
  261. \
  262. static inline OPENSSL_UNUSED void sk_##name##_sort(STACK_OF(name) *sk) { \
  263. sk_sort((_STACK *)sk); \
  264. } \
  265. \
  266. static inline OPENSSL_UNUSED int sk_##name##_is_sorted( \
  267. const STACK_OF(name) *sk) { \
  268. return sk_is_sorted((const _STACK *)sk); \
  269. } \
  270. \
  271. static inline OPENSSL_UNUSED stack_##name##_cmp_func \
  272. sk_##name##_set_cmp_func(STACK_OF(name) *sk, \
  273. stack_##name##_cmp_func comp) { \
  274. return (stack_##name##_cmp_func)sk_set_cmp_func((_STACK *)sk, \
  275. (stack_cmp_func)comp); \
  276. } \
  277. \
  278. static inline OPENSSL_UNUSED STACK_OF(name) * \
  279. sk_##name##_deep_copy(const STACK_OF(name) *sk, \
  280. ptrtype(*copy_func)(ptrtype), \
  281. void (*free_func)(ptrtype)) { \
  282. return (STACK_OF(name) *)sk_deep_copy((_STACK *)sk, \
  283. (void *(*)(void *))copy_func, \
  284. (void (*)(void *))free_func); \
  285. }
  286. /* DEFINE_STACK_OF defines |STACK_OF(type)| to be a stack whose elements are
  287. * |type| *. */
  288. #define DEFINE_STACK_OF(type) DEFINE_STACK_OF_IMPL(type, type *, const type *)
  289. /* DEFINE_CONST_STACK_OF defines |STACK_OF(type)| to be a stack whose elements
  290. * are const |type| *. */
  291. #define DEFINE_CONST_STACK_OF(type) \
  292. DEFINE_STACK_OF_IMPL(type, const type *, const type *)
  293. /* DEFINE_SPECIAL_STACK_OF defines |STACK_OF(type)| to be a stack whose elements
  294. * are |type|, where |type| must be a typedef for a pointer. */
  295. #define DEFINE_SPECIAL_STACK_OF(type) \
  296. OPENSSL_COMPILE_ASSERT(sizeof(type) == sizeof(void *), \
  297. special_stack_of_non_pointer_##type); \
  298. DEFINE_STACK_OF_IMPL(type, type, const type)
  299. typedef char *OPENSSL_STRING;
  300. DEFINE_STACK_OF(void)
  301. DEFINE_SPECIAL_STACK_OF(OPENSSL_STRING)
  302. #if defined(__cplusplus)
  303. } /* extern C */
  304. #endif
  305. #endif /* OPENSSL_HEADER_STACK_H */