2 * Copyright 2017 The OpenSSL Project Authors. All Rights Reserved.
4 * Licensed under the OpenSSL license (the "License"). You may not use
5 * this file except in compliance with the License. You can obtain a copy
6 * in the file LICENSE in the source distribution or at
7 * https://www.openssl.org/source/license.html
10 /* ====================================================================
11 * Copyright (c) 2017 Oracle and/or its affiliates. All rights reserved.
17 #include <openssl/opensslconf.h>
18 #include <openssl/safestack.h>
19 #include <openssl/err.h>
20 #include <openssl/crypto.h>
23 #include "test_main.h"
26 /* The macros below generate unused functions which error out one of the clang
27 * builds. We disable this check here.
30 #pragma clang diagnostic ignored "-Wunused-function"
43 DEFINE_SPECIAL_STACK_OF(sint, int)
44 DEFINE_SPECIAL_STACK_OF_CONST(uchar, unsigned char)
46 DEFINE_STACK_OF_CONST(SU)
48 static int int_compare(const int *const *a, const int *const *b)
57 static int test_int_stack(void)
59 static int v[] = { 1, 2, -4, 16, 999, 1, -173, 1, 9 };
60 static int notpresent = -1;
61 const int n = OSSL_NELEM(v);
74 const int n_finds = OSSL_NELEM(finds);
86 const int n_exfinds = OSSL_NELEM(exfinds);
87 STACK_OF(sint) *s = sk_sint_new_null();
91 /* Check push and num */
92 for (i = 0; i < n; i++) {
93 if (!TEST_int_eq(sk_sint_num(s), i)) {
94 TEST_info("int stack size %d", i);
97 sk_sint_push(s, v + i);
99 if (!TEST_int_eq(sk_sint_num(s), n))
102 /* check the values */
103 for (i = 0; i < n; i++)
104 if (!TEST_ptr_eq(sk_sint_value(s, i), v + i)) {
105 TEST_info("int value %d", i);
109 /* find unsorted -- the pointers are compared */
110 for (i = 0; i < n_finds; i++) {
111 int *val = (finds[i].unsorted == -1) ? ¬present
112 : v + finds[i].unsorted;
114 if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) {
115 TEST_info("int unsorted find %d", i);
120 /* find_ex unsorted */
121 for (i = 0; i < n_finds; i++) {
122 int *val = (finds[i].unsorted == -1) ? ¬present
123 : v + finds[i].unsorted;
125 if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) {
126 TEST_info("int unsorted find_ex %d", i);
132 if (!TEST_false(sk_sint_is_sorted(s)))
134 sk_sint_set_cmp_func(s, &int_compare);
136 if (!TEST_true(sk_sint_is_sorted(s)))
139 /* find sorted -- the value is matched so we don't need to locate it */
140 for (i = 0; i < n_finds; i++)
141 if (!TEST_int_eq(sk_sint_find(s, &finds[i].value), finds[i].sorted)) {
142 TEST_info("int sorted find %d", i);
147 for (i = 0; i < n_finds; i++)
148 if (!TEST_int_eq(sk_sint_find_ex(s, &finds[i].value), finds[i].ex)) {
149 TEST_info("int sorted find_ex present %d", i);
152 for (i = 0; i < n_exfinds; i++)
153 if (!TEST_int_eq(sk_sint_find_ex(s, &exfinds[i].value), exfinds[i].ex)){
154 TEST_info("int sorted find_ex absent %d", i);
159 if (!TEST_ptr_eq(sk_sint_shift(s), v + 6))
168 static int uchar_compare(const unsigned char *const *a,
169 const unsigned char *const *b)
171 return **a - (signed int)**b;
174 static int test_uchar_stack(void)
176 static const unsigned char v[] = { 1, 3, 7, 5, 255, 0 };
177 const int n = OSSL_NELEM(v);
178 STACK_OF(uchar) *s = sk_uchar_new(&uchar_compare), *r = NULL;
182 /* unshift and num */
183 for (i = 0; i < n; i++) {
184 if (!TEST_int_eq(sk_uchar_num(s), i)) {
185 TEST_info("uchar stack size %d", i);
188 sk_uchar_unshift(s, v + i);
190 if (!TEST_int_eq(sk_uchar_num(s), n))
195 if (!TEST_int_eq(sk_uchar_num(r), n))
200 for (i = 0; i < n; i++)
201 if (!TEST_ptr_eq(sk_uchar_pop(s), v + i)) {
202 TEST_info("uchar pop %d", i);
206 /* free -- we rely on the debug malloc to detect leakage here */
211 if (!TEST_int_eq(sk_uchar_num(r), n))
216 if (!TEST_int_eq(sk_uchar_num(r), 0))
220 sk_uchar_insert(r, v, 0);
221 sk_uchar_insert(r, v + 2, -1);
222 sk_uchar_insert(r, v + 1, 1);
223 for (i = 0; i < 3; i++)
224 if (!TEST_ptr_eq(sk_uchar_value(r, i), v + i)) {
225 TEST_info("uchar insert %d", i);
230 if (!TEST_ptr_null(sk_uchar_delete(r, 12)))
232 if (!TEST_ptr_eq(sk_uchar_delete(r, 1), v + 1))
236 sk_uchar_set(r, 1, v + 1);
237 for (i = 0; i < 2; i++)
238 if (!TEST_ptr_eq(sk_uchar_value(r, i), v + i)) {
239 TEST_info("uchar set %d", i);
250 static SS *SS_copy(const SS *p)
252 SS *q = OPENSSL_malloc(sizeof(*q));
255 memcpy(q, p, sizeof(*q));
259 static void SS_free(SS *p) {
263 static int test_SS_stack(void)
265 STACK_OF(SS) *s = sk_SS_new_null();
266 STACK_OF(SS) *r = NULL;
268 const int n = OSSL_NELEM(v);
272 /* allocate and push */
273 for (i = 0; i < n; i++) {
274 v[i] = OPENSSL_malloc(sizeof(*v[i]));
280 if (!TEST_int_eq(sk_SS_num(s), i)) {
281 TEST_info("SS stack size %d", i);
286 if (!TEST_int_eq(sk_SS_num(s), n))
290 r = sk_SS_deep_copy(s, &SS_copy, &SS_free);
293 for (i = 0; i < n; i++) {
294 p = sk_SS_value(r, i);
295 if (!TEST_ptr_ne(p, v[i])) {
296 TEST_info("SS deepcopy non-copy %d", i);
299 if (!TEST_int_eq(p->n, v[i]->n)) {
300 TEST_info("test SS deepcopy int %d", i);
303 if (!TEST_char_eq(p->c, v[i]->c)) {
304 TEST_info("SS deepcopy char %d", i);
309 /* pop_free - we rely on the malloc debug to catch the leak */
310 sk_SS_pop_free(r, &SS_free);
314 p = sk_SS_delete_ptr(s, v[3]);
318 if (!TEST_int_eq(sk_SS_num(s), n - 1))
320 for (i = 0; i < n-1; i++)
321 if (!TEST_ptr_eq(sk_SS_value(s, i), v[i<3 ? i : 1+i])) {
322 TEST_info("SS delete ptr item %d", i);
328 sk_SS_pop_free(r, &SS_free);
329 sk_SS_pop_free(s, &SS_free);
333 static int test_SU_stack(void)
335 STACK_OF(SU) *s = sk_SU_new_null();
337 const int n = OSSL_NELEM(v);
341 /* allocate and push */
342 for (i = 0; i < n; i++) {
347 if (!TEST_int_eq(sk_SU_num(s), i)) {
348 TEST_info("SU stack size %d", i);
351 sk_SU_push(s, v + i);
353 if (!TEST_int_eq(sk_SU_num(s), n))
356 /* check the pointers are correct */
357 for (i = 0; i < n; i++)
358 if (!TEST_ptr_eq(sk_SU_value(s, i), v + i)) {
359 TEST_info("SU pointer check %d", i);
369 void register_tests(void)
371 ADD_TEST(test_int_stack);
372 ADD_TEST(test_uchar_stack);
373 ADD_TEST(test_SS_stack);
374 ADD_TEST(test_SU_stack);