84     int i;  in test_int_stack()  local
92     for (i = 0; i < n; i++) {  in test_int_stack()
93         if (!TEST_int_eq(sk_sint_num(s), i)) {  in test_int_stack()
94             TEST_info("int stack size %d", i);  in test_int_stack()
97         sk_sint_push(s, v + i);  in test_int_stack()
103     for (i = 0; i < n; i++)  in test_int_stack()
104         if (!TEST_ptr_eq(sk_sint_value(s, i), v + i)) {  in test_int_stack()
105             TEST_info("int value %d", i);  in test_int_stack()
110     for (i = 0; i < n_finds; i++) {  in test_int_stack()
111         int *val = (finds[i].unsorted == -1) ? &notpresent  in test_int_stack()
112                                              : v + finds[i].unsorted;  in test_int_stack()
114         if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) {  in test_int_stack()
115             TEST_info("int unsorted find %d", i);  in test_int_stack()
121     for (i = 0; i < n_finds; i++) {  in test_int_stack()
122         int *val = (finds[i].unsorted == -1) ? &notpresent  in test_int_stack()
123                                              : v + finds[i].unsorted;  in test_int_stack()
125         if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) {  in test_int_stack()
126             TEST_info("int unsorted find_ex %d", i);  in test_int_stack()
140     for (i = 0; i < n_finds; i++)  in test_int_stack()
141         if (!TEST_int_eq(sk_sint_find(s, &finds[i].value), finds[i].sorted)) {  in test_int_stack()
142             TEST_info("int sorted find %d", i);  in test_int_stack()
147     for (i = 0; i < n_finds; i++)  in test_int_stack()
148         if (!TEST_int_eq(sk_sint_find_ex(s, &finds[i].value), finds[i].ex)) {  in test_int_stack()
149             TEST_info("int sorted find_ex present %d", i);  in test_int_stack()
152     for (i = 0; i < n_exfinds; i++)  in test_int_stack()
153         if (!TEST_int_eq(sk_sint_find_ex(s, &exfinds[i].value), exfinds[i].ex)){  in test_int_stack()
154             TEST_info("int sorted find_ex absent %d", i);  in test_int_stack()
179     int i;  in test_uchar_stack()  local
187     for (i = 0; i < n; i++) {  in test_uchar_stack()
188         if (!TEST_int_eq(sk_uchar_num(s), i)) {  in test_uchar_stack()
189             TEST_info("uchar stack size %d", i);  in test_uchar_stack()
192         sk_uchar_unshift(s, v + i);  in test_uchar_stack()
208     for (i = 0; i < n; i++)  in test_uchar_stack()
209         if (!TEST_ptr_eq(sk_uchar_pop(s), v + i)) {  in test_uchar_stack()
210             TEST_info("uchar pop %d", i);  in test_uchar_stack()
231     for (i = 0; i < 3; i++)  in test_uchar_stack()
232         if (!TEST_ptr_eq(sk_uchar_value(r, i), v + i)) {  in test_uchar_stack()
233             TEST_info("uchar insert %d", i);  in test_uchar_stack()
245     for (i = 0; i < 2; i++)  in test_uchar_stack()
246         if (!TEST_ptr_eq(sk_uchar_value(r, i), v + i)) {  in test_uchar_stack()
247             TEST_info("uchar set %d", i);  in test_uchar_stack()
277     int i;  in test_SS_stack()  local
281     for (i = 0; i < n; i++) {  in test_SS_stack()
282         v[i] = OPENSSL_malloc(sizeof(*v[i]));  in test_SS_stack()
284         if (!TEST_ptr(v[i]))  in test_SS_stack()
286         v[i]->n = i;  in test_SS_stack()
287         v[i]->c = 'A' + i;  in test_SS_stack()
288         if (!TEST_int_eq(sk_SS_num(s), i)) {  in test_SS_stack()
289             TEST_info("SS stack size %d", i);  in test_SS_stack()
292         sk_SS_push(s, v[i]);  in test_SS_stack()
305     for (i = 0; i < n; i++) {  in test_SS_stack()
306         p = sk_SS_value(r, i);  in test_SS_stack()
307         if (!TEST_ptr_ne(p, v[i])) {  in test_SS_stack()
308             TEST_info("SS deepcopy non-copy %d", i);  in test_SS_stack()
311         if (!TEST_int_eq(p->n, v[i]->n)) {  in test_SS_stack()
312             TEST_info("test SS deepcopy int %d", i);  in test_SS_stack()
315         if (!TEST_char_eq(p->c, v[i]->c)) {  in test_SS_stack()
316             TEST_info("SS deepcopy char %d", i);  in test_SS_stack()
332     for (i = 0; i < n-1; i++)  in test_SS_stack()
333         if (!TEST_ptr_eq(sk_SS_value(s, i), v[i<3 ? i : 1+i])) {  in test_SS_stack()
334             TEST_info("SS delete ptr item %d", i);  in test_SS_stack()
350     int i;  in test_SU_stack()  local
354     for (i = 0; i < n; i++) {  in test_SU_stack()
355         if ((i & 1) == 0)  in test_SU_stack()
356             v[i].n = i;  in test_SU_stack()
358             v[i].c = 'A' + i;  in test_SU_stack()
359         if (!TEST_int_eq(sk_SU_num(s), i)) {  in test_SU_stack()
360             TEST_info("SU stack size %d", i);  in test_SU_stack()
363         sk_SU_push(s, v + i);  in test_SU_stack()
369     for (i = 0; i < n; i++)  in test_SU_stack()
370         if (!TEST_ptr_eq(sk_SU_value(s, i),  v + i)) {  in test_SU_stack()
371             TEST_info("SU pointer check %d", i);  in test_SU_stack()