You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

491 regels
22 KiB

  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, equality is defined by it, otherwise
  142. // pointer equality is used. If the stack is sorted, then a binary search is
  143. // used, otherwise a linear search is performed. If a matching element is found,
  144. // its index is written to
  145. // |*out_index| (if |out_index| is not NULL) and one is returned. Otherwise zero
  146. // is returned.
  147. //
  148. // Note this differs from OpenSSL. The type signature is slightly different, and
  149. // OpenSSL's sk_find will implicitly sort |sk| if it has a comparison function
  150. // defined.
  151. OPENSSL_EXPORT int sk_find(const _STACK *sk, size_t *out_index, void *p);
  152. // sk_shift removes and returns the first element in the stack, or returns NULL
  153. // if the stack is empty.
  154. OPENSSL_EXPORT void *sk_shift(_STACK *sk);
  155. // sk_push appends |p| to the stack and returns the length of the new stack, or
  156. // 0 on allocation failure.
  157. OPENSSL_EXPORT size_t sk_push(_STACK *sk, void *p);
  158. // sk_pop returns and removes the last element on the stack, or NULL if the
  159. // stack is empty.
  160. OPENSSL_EXPORT void *sk_pop(_STACK *sk);
  161. // sk_dup performs a shallow copy of a stack and returns the new stack, or NULL
  162. // on error.
  163. OPENSSL_EXPORT _STACK *sk_dup(const _STACK *sk);
  164. // sk_sort sorts the elements of |sk| into ascending order based on the
  165. // comparison function. The stack maintains a |sorted| flag and sorting an
  166. // already sorted stack is a no-op.
  167. OPENSSL_EXPORT void sk_sort(_STACK *sk);
  168. // sk_is_sorted returns one if |sk| is known to be sorted and zero
  169. // otherwise.
  170. OPENSSL_EXPORT int sk_is_sorted(const _STACK *sk);
  171. // sk_set_cmp_func sets the comparison function to be used by |sk| and returns
  172. // the previous one.
  173. OPENSSL_EXPORT stack_cmp_func sk_set_cmp_func(_STACK *sk, stack_cmp_func comp);
  174. // sk_deep_copy performs a copy of |sk| and of each of the non-NULL elements in
  175. // |sk| by using |copy_func|. If an error occurs, |free_func| is used to free
  176. // any copies already made and NULL is returned.
  177. OPENSSL_EXPORT _STACK *sk_deep_copy(const _STACK *sk,
  178. void *(*copy_func)(void *),
  179. void (*free_func)(void *));
  180. // Defining stack types.
  181. //
  182. // This set of macros is used to emit the typed functions that act on a
  183. // |STACK_OF(T)|.
  184. #if !defined(BORINGSSL_NO_CXX)
  185. extern "C++" {
  186. namespace bssl {
  187. namespace internal {
  188. template <typename T>
  189. struct StackTraits {};
  190. }
  191. }
  192. }
  193. #define BORINGSSL_DEFINE_STACK_TRAITS(name, type, is_const) \
  194. extern "C++" { \
  195. namespace bssl { \
  196. namespace internal { \
  197. template <> \
  198. struct StackTraits<STACK_OF(name)> { \
  199. static constexpr bool kIsStack = true; \
  200. using Type = type; \
  201. static constexpr bool kIsConst = is_const; \
  202. }; \
  203. } \
  204. } \
  205. }
  206. #else
  207. #define BORINGSSL_DEFINE_STACK_TRAITS(name, type, is_const)
  208. #endif
  209. // Stack functions must be tagged unused to support file-local stack types.
  210. // Clang's -Wunused-function only allows unused static inline functions if they
  211. // are defined in a header.
  212. #define BORINGSSL_DEFINE_STACK_OF_IMPL(name, ptrtype, constptrtype) \
  213. DECLARE_STACK_OF(name) \
  214. \
  215. typedef int (*stack_##name##_cmp_func)(constptrtype *a, constptrtype *b); \
  216. \
  217. static inline OPENSSL_UNUSED STACK_OF(name) * \
  218. sk_##name##_new(stack_##name##_cmp_func comp) { \
  219. return (STACK_OF(name) *)sk_new((stack_cmp_func)comp); \
  220. } \
  221. \
  222. static inline OPENSSL_UNUSED STACK_OF(name) *sk_##name##_new_null(void) { \
  223. return (STACK_OF(name) *)sk_new_null(); \
  224. } \
  225. \
  226. static inline OPENSSL_UNUSED size_t sk_##name##_num( \
  227. const STACK_OF(name) *sk) { \
  228. return sk_num((const _STACK *)sk); \
  229. } \
  230. \
  231. static inline OPENSSL_UNUSED void sk_##name##_zero(STACK_OF(name) *sk) { \
  232. sk_zero((_STACK *)sk); \
  233. } \
  234. \
  235. static inline OPENSSL_UNUSED ptrtype sk_##name##_value( \
  236. const STACK_OF(name) *sk, size_t i) { \
  237. return (ptrtype)sk_value((const _STACK *)sk, i); \
  238. } \
  239. \
  240. static inline OPENSSL_UNUSED ptrtype sk_##name##_set(STACK_OF(name) *sk, \
  241. size_t i, ptrtype p) { \
  242. return (ptrtype)sk_set((_STACK *)sk, i, (void *)p); \
  243. } \
  244. \
  245. static inline OPENSSL_UNUSED void sk_##name##_free(STACK_OF(name) *sk) { \
  246. sk_free((_STACK *)sk); \
  247. } \
  248. \
  249. static inline OPENSSL_UNUSED void sk_##name##_pop_free( \
  250. STACK_OF(name) *sk, void (*free_func)(ptrtype p)) { \
  251. sk_pop_free((_STACK *)sk, (void (*)(void *))free_func); \
  252. } \
  253. \
  254. static inline OPENSSL_UNUSED size_t sk_##name##_insert( \
  255. STACK_OF(name) *sk, ptrtype p, size_t where) { \
  256. return sk_insert((_STACK *)sk, (void *)p, where); \
  257. } \
  258. \
  259. static inline OPENSSL_UNUSED ptrtype sk_##name##_delete(STACK_OF(name) *sk, \
  260. size_t where) { \
  261. return (ptrtype)sk_delete((_STACK *)sk, where); \
  262. } \
  263. \
  264. static inline OPENSSL_UNUSED ptrtype sk_##name##_delete_ptr( \
  265. STACK_OF(name) *sk, ptrtype p) { \
  266. return (ptrtype)sk_delete_ptr((_STACK *)sk, (void *)p); \
  267. } \
  268. \
  269. static inline OPENSSL_UNUSED int sk_##name##_find( \
  270. const STACK_OF(name) *sk, size_t *out_index, ptrtype p) { \
  271. return sk_find((const _STACK *)sk, out_index, (void *)p); \
  272. } \
  273. \
  274. static inline OPENSSL_UNUSED ptrtype sk_##name##_shift(STACK_OF(name) *sk) { \
  275. return (ptrtype)sk_shift((_STACK *)sk); \
  276. } \
  277. \
  278. static inline OPENSSL_UNUSED size_t sk_##name##_push(STACK_OF(name) *sk, \
  279. ptrtype p) { \
  280. return sk_push((_STACK *)sk, (void *)p); \
  281. } \
  282. \
  283. static inline OPENSSL_UNUSED ptrtype sk_##name##_pop(STACK_OF(name) *sk) { \
  284. return (ptrtype)sk_pop((_STACK *)sk); \
  285. } \
  286. \
  287. static inline OPENSSL_UNUSED STACK_OF(name) * \
  288. sk_##name##_dup(const STACK_OF(name) *sk) { \
  289. return (STACK_OF(name) *)sk_dup((const _STACK *)sk); \
  290. } \
  291. \
  292. static inline OPENSSL_UNUSED void sk_##name##_sort(STACK_OF(name) *sk) { \
  293. sk_sort((_STACK *)sk); \
  294. } \
  295. \
  296. static inline OPENSSL_UNUSED int sk_##name##_is_sorted( \
  297. const STACK_OF(name) *sk) { \
  298. return sk_is_sorted((const _STACK *)sk); \
  299. } \
  300. \
  301. static inline OPENSSL_UNUSED stack_##name##_cmp_func \
  302. sk_##name##_set_cmp_func(STACK_OF(name) *sk, \
  303. stack_##name##_cmp_func comp) { \
  304. return (stack_##name##_cmp_func)sk_set_cmp_func((_STACK *)sk, \
  305. (stack_cmp_func)comp); \
  306. } \
  307. \
  308. static inline OPENSSL_UNUSED STACK_OF(name) * \
  309. sk_##name##_deep_copy(const STACK_OF(name) *sk, \
  310. ptrtype(*copy_func)(ptrtype), \
  311. void (*free_func)(ptrtype)) { \
  312. return (STACK_OF(name) *)sk_deep_copy((const _STACK *)sk, \
  313. (void *(*)(void *))copy_func, \
  314. (void (*)(void *))free_func); \
  315. }
  316. // DEFINE_STACK_OF defines |STACK_OF(type)| to be a stack whose elements are
  317. // |type| *.
  318. #define DEFINE_STACK_OF(type) \
  319. BORINGSSL_DEFINE_STACK_OF_IMPL(type, type *, const type *) \
  320. BORINGSSL_DEFINE_STACK_TRAITS(type, type, false)
  321. // DEFINE_CONST_STACK_OF defines |STACK_OF(type)| to be a stack whose elements
  322. // are const |type| *.
  323. #define DEFINE_CONST_STACK_OF(type) \
  324. BORINGSSL_DEFINE_STACK_OF_IMPL(type, const type *, const type *) \
  325. BORINGSSL_DEFINE_STACK_TRAITS(type, const type, true)
  326. // DEFINE_SPECIAL_STACK_OF defines |STACK_OF(type)| to be a stack whose elements
  327. // are |type|, where |type| must be a typedef for a pointer.
  328. #define DEFINE_SPECIAL_STACK_OF(type) \
  329. OPENSSL_COMPILE_ASSERT(sizeof(type) == sizeof(void *), \
  330. special_stack_of_non_pointer_##type); \
  331. BORINGSSL_DEFINE_STACK_OF_IMPL(type, type, const type)
  332. typedef char *OPENSSL_STRING;
  333. DEFINE_STACK_OF(void)
  334. DEFINE_SPECIAL_STACK_OF(OPENSSL_STRING)
  335. #if defined(__cplusplus)
  336. } // extern C
  337. #endif
  338. #if !defined(BORINGSSL_NO_CXX)
  339. extern "C++" {
  340. #include <type_traits>
  341. namespace bssl {
  342. namespace internal {
  343. // Stacks defined with |DEFINE_CONST_STACK_OF| are freed with |sk_free|.
  344. template <typename Stack>
  345. struct DeleterImpl<
  346. Stack, typename std::enable_if<StackTraits<Stack>::kIsConst>::type> {
  347. static void Free(Stack *sk) { sk_free(reinterpret_cast<_STACK *>(sk)); }
  348. };
  349. // Stacks defined with |DEFINE_STACK_OF| are freed with |sk_pop_free| and the
  350. // corresponding type's deleter.
  351. template <typename Stack>
  352. struct DeleterImpl<
  353. Stack, typename std::enable_if<!StackTraits<Stack>::kIsConst>::type> {
  354. static void Free(Stack *sk) {
  355. sk_pop_free(
  356. reinterpret_cast<_STACK *>(sk),
  357. reinterpret_cast<void (*)(void *)>(
  358. DeleterImpl<typename StackTraits<Stack>::Type>::Free));
  359. }
  360. };
  361. template <typename Stack>
  362. class StackIteratorImpl {
  363. public:
  364. using Type = typename StackTraits<Stack>::Type;
  365. // Iterators must be default-constructable.
  366. StackIteratorImpl() : sk_(nullptr), idx_(0) {}
  367. StackIteratorImpl(const Stack *sk, size_t idx) : sk_(sk), idx_(idx) {}
  368. bool operator==(StackIteratorImpl other) const {
  369. return sk_ == other.sk_ && idx_ == other.idx_;
  370. }
  371. bool operator!=(StackIteratorImpl other) const {
  372. return !(*this == other);
  373. }
  374. Type *operator*() const {
  375. return reinterpret_cast<Type *>(
  376. sk_value(reinterpret_cast<const _STACK *>(sk_), idx_));
  377. }
  378. StackIteratorImpl &operator++(/* prefix */) {
  379. idx_++;
  380. return *this;
  381. }
  382. StackIteratorImpl operator++(int /* postfix */) {
  383. StackIteratorImpl copy(*this);
  384. ++(*this);
  385. return copy;
  386. }
  387. private:
  388. const Stack *sk_;
  389. size_t idx_;
  390. };
  391. template <typename Stack>
  392. using StackIterator = typename std::enable_if<StackTraits<Stack>::kIsStack,
  393. StackIteratorImpl<Stack>>::type;
  394. } // namespace internal
  395. // PushToStack pushes |elem| to |sk|. It returns true on success and false on
  396. // allocation failure.
  397. template <typename Stack>
  398. static inline
  399. typename std::enable_if<!internal::StackTraits<Stack>::kIsConst, bool>::type
  400. PushToStack(Stack *sk,
  401. UniquePtr<typename internal::StackTraits<Stack>::Type> elem) {
  402. if (!sk_push(reinterpret_cast<_STACK *>(sk), elem.get())) {
  403. return false;
  404. }
  405. // sk_push takes ownership on success.
  406. elem.release();
  407. return true;
  408. }
  409. } // namespace bssl
  410. // Define begin() and end() for stack types so C++ range for loops work.
  411. template <typename Stack>
  412. static inline bssl::internal::StackIterator<Stack> begin(const Stack *sk) {
  413. return bssl::internal::StackIterator<Stack>(sk, 0);
  414. }
  415. template <typename Stack>
  416. static inline bssl::internal::StackIterator<Stack> end(const Stack *sk) {
  417. return bssl::internal::StackIterator<Stack>(
  418. sk, sk_num(reinterpret_cast<const _STACK *>(sk)));
  419. }
  420. } // extern C++
  421. #endif
  422. #endif // OPENSSL_HEADER_STACK_H