[thirdparty/openssl.git] / test / stack_test.c

/*
 * Copyright 2017 The OpenSSL Project Authors. All Rights Reserved.
 *
 * Licensed under the OpenSSL license (the "License").  You may not use
 * this file except in compliance with the License.  You can obtain a copy
 * in the file LICENSE in the source distribution or at
 * https://www.openssl.org/source/license.html
 */

/* ====================================================================
 * Copyright (c) 2017 Oracle and/or its affiliates.  All rights reserved.
 */

#include <stdio.h>
#include <string.h>

#include <openssl/opensslconf.h>
#include <openssl/safestack.h>
#include <openssl/err.h>
#include <openssl/crypto.h>

#include "e_os.h"
#include "testutil.h"

/* The macros below generate unused functions which error out one of the clang
 * builds.  We disable this check here.
 */
#ifdef __clang__
#pragma clang diagnostic ignored "-Wunused-function"
#endif

typedef struct {
    int n;
    char c;
} SS;

typedef union {
    int n;
    char c;
} SU;

DEFINE_SPECIAL_STACK_OF(sint, int)
DEFINE_SPECIAL_STACK_OF_CONST(uchar, unsigned char)
DEFINE_STACK_OF(SS)
DEFINE_STACK_OF_CONST(SU)

static int int_compare(const int *const *a, const int *const *b)
{
    if (**a < **b)
        return -1;
    if (**a > **b)
        return 1;
    return 0;
}

static int test_int_stack(void)
{
    static int v[] = { 1, 2, -4, 16, 999, 1, -173, 1, 9 };
    static int notpresent = -1;
    const int n = OSSL_NELEM(v);
    static struct {
        int value;
        int unsorted;
        int sorted;
        int ex;
    } finds[] = {
        { 2,    1,  5,  5   },
        { 9,    7,  6,  6   },
        { -173, 5,  0,  0   },
        { 999,  3,  8,  8   },
        { 0,   -1, -1,  1   }
    };
    const int n_finds = OSSL_NELEM(finds);
    static struct {
        int value;
        int ex;
    } exfinds[] = {
        { 3,    5   },
        { 1000, 8   },
        { 20,   8   },
        { -999, 0   },
        { -5,   0   },
        { 8,    5   }
    };
    const int n_exfinds = OSSL_NELEM(exfinds);
    STACK_OF(sint) *s = sk_sint_new_null();
    int i;
    int testresult = 0;

    /* Check push and num */
    for (i = 0; i < n; i++) {
        if (!TEST_int_eq(sk_sint_num(s), i)) {
            TEST_info("int stack size %d", i);
            goto end;
        }
        sk_sint_push(s, v + i);
    }
    if (!TEST_int_eq(sk_sint_num(s), n))
        goto end;

    /* check the values */
    for (i = 0; i < n; i++)
        if (!TEST_ptr_eq(sk_sint_value(s, i), v + i)) {
            TEST_info("int value %d", i);
            goto end;
        }

    /* find unsorted -- the pointers are compared */
    for (i = 0; i < n_finds; i++) {
        int *val = (finds[i].unsorted == -1) ? &notpresent
                                             : v + finds[i].unsorted;

        if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) {
            TEST_info("int unsorted find %d", i);
            goto end;
        }
    }

    /* find_ex unsorted */
    for (i = 0; i < n_finds; i++) {
        int *val = (finds[i].unsorted == -1) ? &notpresent
                                             : v + finds[i].unsorted;

        if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) {
            TEST_info("int unsorted find_ex %d", i);
            goto end;
        }
    }

    /* sorting */
    if (!TEST_false(sk_sint_is_sorted(s)))
        goto end;
    sk_sint_set_cmp_func(s, &int_compare);
    sk_sint_sort(s);
    if (!TEST_true(sk_sint_is_sorted(s)))
        goto end;

    /* find sorted -- the value is matched so we don't need to locate it */
    for (i = 0; i < n_finds; i++)
        if (!TEST_int_eq(sk_sint_find(s, &finds[i].value), finds[i].sorted)) {
            TEST_info("int sorted find %d", i);
            goto end;
        }

    /* find_ex sorted */
    for (i = 0; i < n_finds; i++)
        if (!TEST_int_eq(sk_sint_find_ex(s, &finds[i].value), finds[i].ex)) {
            TEST_info("int sorted find_ex present %d", i);
            goto end;
        }
    for (i = 0; i < n_exfinds; i++)
        if (!TEST_int_eq(sk_sint_find_ex(s, &exfinds[i].value), exfinds[i].ex)){
            TEST_info("int sorted find_ex absent %d", i);
            goto end;
        }

    /* shift */
    if (!TEST_ptr_eq(sk_sint_shift(s), v + 6))
        goto end;

    testresult = 1;
end:
    sk_sint_free(s);
    return testresult;
}

static int uchar_compare(const unsigned char *const *a,
                         const unsigned char *const *b)
{
    return **a - (signed int)**b;
}

static int test_uchar_stack(void)
{
    static const unsigned char v[] = { 1, 3, 7, 5, 255, 0 };
    const int n = OSSL_NELEM(v);
    STACK_OF(uchar) *s = sk_uchar_new(&uchar_compare), *r = NULL;
    int i;
    int testresult = 0;

    /* unshift and num */
    for (i = 0; i < n; i++) {
        if (!TEST_int_eq(sk_uchar_num(s), i)) {
            TEST_info("uchar stack size %d", i);
            goto end;
        }
        sk_uchar_unshift(s, v + i);
    }
    if (!TEST_int_eq(sk_uchar_num(s), n))
        goto end;

    /* dup */
    r = sk_uchar_dup(s);
    if (!TEST_int_eq(sk_uchar_num(r), n))
        goto end;
    sk_uchar_sort(r);

    /* pop */
    for (i = 0; i < n; i++)
        if (!TEST_ptr_eq(sk_uchar_pop(s), v + i)) {
            TEST_info("uchar pop %d", i);
            goto end;
        }

    /* free -- we rely on the debug malloc to detect leakage here */
    sk_uchar_free(s);
    s = NULL;

    /* dup again */
    if (!TEST_int_eq(sk_uchar_num(r), n))
        goto end;

    /* zero */
    sk_uchar_zero(r);
    if (!TEST_int_eq(sk_uchar_num(r), 0))
        goto end;

    /* insert */
    sk_uchar_insert(r, v, 0);
    sk_uchar_insert(r, v + 2, -1);
    sk_uchar_insert(r, v + 1, 1);
    for (i = 0; i < 3; i++)
        if (!TEST_ptr_eq(sk_uchar_value(r, i), v + i)) {
            TEST_info("uchar insert %d", i);
            goto end;
        }

    /* delete */
    if (!TEST_ptr_null(sk_uchar_delete(r, 12)))
        goto end;
    if (!TEST_ptr_eq(sk_uchar_delete(r, 1), v + 1))
        goto end;

    /* set */
    sk_uchar_set(r, 1, v + 1);
    for (i = 0; i < 2; i++)
        if (!TEST_ptr_eq(sk_uchar_value(r, i), v + i)) {
            TEST_info("uchar set %d", i);
            goto end;
        }

    testresult = 1;
end:
    sk_uchar_free(r);
    sk_uchar_free(s);
    return testresult;
}

static SS *SS_copy(const SS *p)
{
    SS *q = OPENSSL_malloc(sizeof(*q));

    if (q != NULL)
        memcpy(q, p, sizeof(*q));
    return q;
}

static void SS_free(SS *p) {
    OPENSSL_free(p);
}

static int test_SS_stack(void)
{
    STACK_OF(SS) *s = sk_SS_new_null();
    STACK_OF(SS) *r = NULL;
    SS *v[10], *p;
    const int n = OSSL_NELEM(v);
    int i;
    int testresult = 0;

    /* allocate and push */
    for (i = 0; i < n; i++) {
        v[i] = OPENSSL_malloc(sizeof(*v[i]));

        if (!TEST_ptr(v[i]))
            goto end;
        v[i]->n = i;
        v[i]->c = 'A' + i;
        if (!TEST_int_eq(sk_SS_num(s), i)) {
            TEST_info("SS stack size %d", i);
            goto end;
        }
        sk_SS_push(s, v[i]);
    }
    if (!TEST_int_eq(sk_SS_num(s), n))
        goto end;

    /* deepcopy */
    r = sk_SS_deep_copy(s, &SS_copy, &SS_free);
    if (!TEST_ptr(r))
        goto end;
    for (i = 0; i < n; i++) {
        p = sk_SS_value(r, i);
        if (!TEST_ptr_ne(p, v[i])) {
            TEST_info("SS deepcopy non-copy %d", i);
            goto end;
        }
        if (!TEST_int_eq(p->n, v[i]->n)) {
            TEST_info("test SS deepcopy int %d", i);
            goto end;
        }
        if (!TEST_char_eq(p->c, v[i]->c)) {
            TEST_info("SS deepcopy char %d", i);
            goto end;
        }
    }

    /* pop_free - we rely on the malloc debug to catch the leak */
    sk_SS_pop_free(r, &SS_free);
    r = NULL;

    /* delete_ptr */
    p = sk_SS_delete_ptr(s, v[3]);
    if (!TEST_ptr(p))
        goto end;
    SS_free(p);
    if (!TEST_int_eq(sk_SS_num(s), n - 1))
        goto end;
    for (i = 0; i < n-1; i++)
        if (!TEST_ptr_eq(sk_SS_value(s, i), v[i<3 ? i : 1+i])) {
            TEST_info("SS delete ptr item %d", i);
            goto end;
        }

    testresult = 1;
end:
    sk_SS_pop_free(r, &SS_free);
    sk_SS_pop_free(s, &SS_free);
    return testresult;
}

static int test_SU_stack(void)
{
    STACK_OF(SU) *s = sk_SU_new_null();
    SU v[10];
    const int n = OSSL_NELEM(v);
    int i;
    int testresult = 0;

    /* allocate and push */
    for (i = 0; i < n; i++) {
        if ((i & 1) == 0)
            v[i].n = i;
        else
            v[i].c = 'A' + i;
        if (!TEST_int_eq(sk_SU_num(s), i)) {
            TEST_info("SU stack size %d", i);
            goto end;
        }
        sk_SU_push(s, v + i);
    }
    if (!TEST_int_eq(sk_SU_num(s), n))
        goto end;

    /* check the pointers are correct */
    for (i = 0; i < n; i++)
        if (!TEST_ptr_eq(sk_SU_value(s, i),  v + i)) {
            TEST_info("SU pointer check %d", i);
            goto end;
        }

    testresult = 1;
end:
    sk_SU_free(s);
    return testresult;
}

void register_tests(void)
{
    ADD_TEST(test_int_stack);
    ADD_TEST(test_uchar_stack);
    ADD_TEST(test_SS_stack);
    ADD_TEST(test_SU_stack);
}
Commit	Line	Data
98374961 P	1	/*
	2	* Copyright 2017 The OpenSSL Project Authors. All Rights Reserved.
	3	*
	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
	8	*/
	9
	10	/* ====================================================================
	11	* Copyright (c) 2017 Oracle and/or its affiliates. All rights reserved.
	12	*/
	13
	14	#include <stdio.h>
	15	#include <string.h>
	16
	17	#include <openssl/opensslconf.h>
	18	#include <openssl/safestack.h>
	19	#include <openssl/err.h>
	20	#include <openssl/crypto.h>
	21
	22	#include "e_os.h"
98374961 P	23	#include "testutil.h"
	24
	25	/* The macros below generate unused functions which error out one of the clang
	26	* builds. We disable this check here.
	27	*/
	28	#ifdef __clang__
	29	#pragma clang diagnostic ignored "-Wunused-function"
	30	#endif
	31
	32	typedef struct {
	33	int n;
	34	char c;
	35	} SS;
	36
	37	typedef union {
	38	int n;
	39	char c;
	40	} SU;
	41
	42	DEFINE_SPECIAL_STACK_OF(sint, int)
	43	DEFINE_SPECIAL_STACK_OF_CONST(uchar, unsigned char)
	44	DEFINE_STACK_OF(SS)
	45	DEFINE_STACK_OF_CONST(SU)
	46
	47	static int int_compare(const int const a, const int const b)
	48	{
	49	if (a < b)
	50	return -1;
	51	if (a > b)
	52	return 1;
	53	return 0;
	54	}
	55
	56	static int test_int_stack(void)
	57	{
	58	static int v[] = { 1, 2, -4, 16, 999, 1, -173, 1, 9 };
3fb2c3e4	59	static int notpresent = -1;
98374961 P	60	const int n = OSSL_NELEM(v);
	61	static struct {
	62	int value;
	63	int unsorted;
	64	int sorted;
	65	int ex;
	66	} finds[] = {
	67	{ 2, 1, 5, 5 },
	68	{ 9, 7, 6, 6 },
	69	{ -173, 5, 0, 0 },
	70	{ 999, 3, 8, 8 },
	71	{ 0, -1, -1, 1 }
	72	};
	73	const int n_finds = OSSL_NELEM(finds);
	74	static struct {
	75	int value;
	76	int ex;
	77	} exfinds[] = {
	78	{ 3, 5 },
	79	{ 1000, 8 },
	80	{ 20, 8 },
	81	{ -999, 0 },
	82	{ -5, 0 },
	83	{ 8, 5 }
	84	};
	85	const int n_exfinds = OSSL_NELEM(exfinds);
	86	STACK_OF(sint) *s = sk_sint_new_null();
	87	int i;
	88	int testresult = 0;
	89
	90	/* Check push and num */
	91	for (i = 0; i < n; i++) {
2fae041d P	92	if (!TEST_int_eq(sk_sint_num(s), i)) {
2fae041d P	93	TEST_info("int stack size %d", i);
98374961 P	94	goto end;
	95	}
	96	sk_sint_push(s, v + i);
	97	}
2fae041d	98	if (!TEST_int_eq(sk_sint_num(s), n))
98374961	99	goto end;
98374961 P	100
	101	/* check the values */
	102	for (i = 0; i < n; i++)
2fae041d P	103	if (!TEST_ptr_eq(sk_sint_value(s, i), v + i)) {
2fae041d P	104	TEST_info("int value %d", i);
98374961 P	105	goto end;
	106	}
	107
	108	/* find unsorted -- the pointers are compared */
3fb2c3e4 MC	109	for (i = 0; i < n_finds; i++) {
	110	int *val = (finds[i].unsorted == -1) ? &notpresent
	111	: v + finds[i].unsorted;
	112
2fae041d P	113	if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) {
2fae041d P	114	TEST_info("int unsorted find %d", i);
98374961 P	115	goto end;
98374961 P	116	}
3fb2c3e4	117	}
98374961 P	118
98374961 P	119	/* find_ex unsorted */
3fb2c3e4 MC	120	for (i = 0; i < n_finds; i++) {
	121	int *val = (finds[i].unsorted == -1) ? &notpresent
	122	: v + finds[i].unsorted;
	123
2fae041d P	124	if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) {
2fae041d P	125	TEST_info("int unsorted find_ex %d", i);
98374961 P	126	goto end;
98374961 P	127	}
3fb2c3e4	128	}
98374961 P	129
98374961 P	130	/* sorting */
2fae041d	131	if (!TEST_false(sk_sint_is_sorted(s)))
98374961	132	goto end;
98374961 P	133	sk_sint_set_cmp_func(s, &int_compare);
98374961 P	134	sk_sint_sort(s);
2fae041d	135	if (!TEST_true(sk_sint_is_sorted(s)))
98374961	136	goto end;
98374961 P	137
	138	/* find sorted -- the value is matched so we don't need to locate it */
	139	for (i = 0; i < n_finds; i++)
2fae041d P	140	if (!TEST_int_eq(sk_sint_find(s, &finds[i].value), finds[i].sorted)) {
2fae041d P	141	TEST_info("int sorted find %d", i);
98374961 P	142	goto end;
	143	}
	144
	145	/* find_ex sorted */
	146	for (i = 0; i < n_finds; i++)
2fae041d P	147	if (!TEST_int_eq(sk_sint_find_ex(s, &finds[i].value), finds[i].ex)) {
2fae041d P	148	TEST_info("int sorted find_ex present %d", i);
98374961 P	149	goto end;
	150	}
	151	for (i = 0; i < n_exfinds; i++)
2fae041d P	152	if (!TEST_int_eq(sk_sint_find_ex(s, &exfinds[i].value), exfinds[i].ex)){
2fae041d P	153	TEST_info("int sorted find_ex absent %d", i);
98374961 P	154	goto end;
	155	}
	156
	157	/* shift */
2fae041d	158	if (!TEST_ptr_eq(sk_sint_shift(s), v + 6))
98374961	159	goto end;
98374961 P	160
	161	testresult = 1;
	162	end:
	163	sk_sint_free(s);
	164	return testresult;
	165	}
	166
	167	static int uchar_compare(const unsigned char const a,
	168	const unsigned char const b)
	169	{
	170	return a - (signed int)b;
	171	}
	172
	173	static int test_uchar_stack(void)
	174	{
	175	static const unsigned char v[] = { 1, 3, 7, 5, 255, 0 };
	176	const int n = OSSL_NELEM(v);
	177	STACK_OF(uchar) s = sk_uchar_new(&uchar_compare), r = NULL;
	178	int i;
	179	int testresult = 0;
	180
	181	/* unshift and num */
	182	for (i = 0; i < n; i++) {
2fae041d P	183	if (!TEST_int_eq(sk_uchar_num(s), i)) {
2fae041d P	184	TEST_info("uchar stack size %d", i);
98374961 P	185	goto end;
	186	}
	187	sk_uchar_unshift(s, v + i);
	188	}
2fae041d	189	if (!TEST_int_eq(sk_uchar_num(s), n))
98374961	190	goto end;
98374961 P	191
	192	/* dup */
	193	r = sk_uchar_dup(s);
2fae041d	194	if (!TEST_int_eq(sk_uchar_num(r), n))
98374961	195	goto end;
98374961 P	196	sk_uchar_sort(r);
	197
	198	/* pop */
bd91e3c8	199	for (i = 0; i < n; i++)
2fae041d P	200	if (!TEST_ptr_eq(sk_uchar_pop(s), v + i)) {
2fae041d P	201	TEST_info("uchar pop %d", i);
98374961 P	202	goto end;
	203	}
	204
	205	/* free -- we rely on the debug malloc to detect leakage here */
	206	sk_uchar_free(s);
	207	s = NULL;
	208
	209	/* dup again */
2fae041d	210	if (!TEST_int_eq(sk_uchar_num(r), n))
98374961	211	goto end;
98374961 P	212
	213	/* zero */
	214	sk_uchar_zero(r);
2fae041d	215	if (!TEST_int_eq(sk_uchar_num(r), 0))
98374961	216	goto end;
98374961 P	217
	218	/* insert */
	219	sk_uchar_insert(r, v, 0);
	220	sk_uchar_insert(r, v + 2, -1);
	221	sk_uchar_insert(r, v + 1, 1);
	222	for (i = 0; i < 3; i++)
2fae041d P	223	if (!TEST_ptr_eq(sk_uchar_value(r, i), v + i)) {
2fae041d P	224	TEST_info("uchar insert %d", i);
98374961 P	225	goto end;
	226	}
	227
	228	/* delete */
2fae041d	229	if (!TEST_ptr_null(sk_uchar_delete(r, 12)))
98374961	230	goto end;
2fae041d	231	if (!TEST_ptr_eq(sk_uchar_delete(r, 1), v + 1))
98374961	232	goto end;
98374961 P	233
	234	/* set */
	235	sk_uchar_set(r, 1, v + 1);
	236	for (i = 0; i < 2; i++)
2fae041d P	237	if (!TEST_ptr_eq(sk_uchar_value(r, i), v + i)) {
2fae041d P	238	TEST_info("uchar set %d", i);
98374961 P	239	goto end;
	240	}
	241
	242	testresult = 1;
	243	end:
	244	sk_uchar_free(r);
	245	sk_uchar_free(s);
	246	return testresult;
	247	}
	248
	249	static SS SS_copy(const SS p)
	250	{
	251	SS q = OPENSSL_malloc(sizeof(q));
	252
	253	if (q != NULL)
	254	memcpy(q, p, sizeof(*q));
	255	return q;
	256	}
	257
	258	static void SS_free(SS *p) {
	259	OPENSSL_free(p);
	260	}
	261
	262	static int test_SS_stack(void)
	263	{
	264	STACK_OF(SS) *s = sk_SS_new_null();
	265	STACK_OF(SS) *r = NULL;
	266	SS v[10], p;
	267	const int n = OSSL_NELEM(v);
	268	int i;
	269	int testresult = 0;
	270
	271	/* allocate and push */
	272	for (i = 0; i < n; i++) {
	273	v[i] = OPENSSL_malloc(sizeof(*v[i]));
	274
2fae041d	275	if (!TEST_ptr(v[i]))
98374961	276	goto end;
98374961 P	277	v[i]->n = i;
98374961 P	278	v[i]->c = 'A' + i;
2fae041d P	279	if (!TEST_int_eq(sk_SS_num(s), i)) {
2fae041d P	280	TEST_info("SS stack size %d", i);
98374961 P	281	goto end;
	282	}
	283	sk_SS_push(s, v[i]);
	284	}
2fae041d	285	if (!TEST_int_eq(sk_SS_num(s), n))
98374961	286	goto end;
98374961 P	287
	288	/* deepcopy */
	289	r = sk_SS_deep_copy(s, &SS_copy, &SS_free);
2fae041d	290	if (!TEST_ptr(r))
98374961	291	goto end;
98374961 P	292	for (i = 0; i < n; i++) {
98374961 P	293	p = sk_SS_value(r, i);
2fae041d P	294	if (!TEST_ptr_ne(p, v[i])) {
2fae041d P	295	TEST_info("SS deepcopy non-copy %d", i);
98374961 P	296	goto end;
98374961 P	297	}
2fae041d P	298	if (!TEST_int_eq(p->n, v[i]->n)) {
	299	TEST_info("test SS deepcopy int %d", i);
	300	goto end;
	301	}
	302	if (!TEST_char_eq(p->c, v[i]->c)) {
	303	TEST_info("SS deepcopy char %d", i);
98374961 P	304	goto end;
	305	}
	306	}
	307
	308	/* pop_free - we rely on the malloc debug to catch the leak */
	309	sk_SS_pop_free(r, &SS_free);
	310	r = NULL;
	311
	312	/* delete_ptr */
2fae041d P	313	p = sk_SS_delete_ptr(s, v[3]);
2fae041d P	314	if (!TEST_ptr(p))
98374961	315	goto end;
98374961	316	SS_free(p);
2fae041d	317	if (!TEST_int_eq(sk_SS_num(s), n - 1))
98374961	318	goto end;
98374961	319	for (i = 0; i < n-1; i++)
2fae041d P	320	if (!TEST_ptr_eq(sk_SS_value(s, i), v[i<3 ? i : 1+i])) {
2fae041d P	321	TEST_info("SS delete ptr item %d", i);
98374961 P	322	goto end;
	323	}
	324
	325	testresult = 1;
	326	end:
	327	sk_SS_pop_free(r, &SS_free);
	328	sk_SS_pop_free(s, &SS_free);
	329	return testresult;
	330	}
	331
	332	static int test_SU_stack(void)
	333	{
	334	STACK_OF(SU) *s = sk_SU_new_null();
	335	SU v[10];
	336	const int n = OSSL_NELEM(v);
	337	int i;
	338	int testresult = 0;
	339
	340	/* allocate and push */
	341	for (i = 0; i < n; i++) {
	342	if ((i & 1) == 0)
	343	v[i].n = i;
	344	else
	345	v[i].c = 'A' + i;
2fae041d P	346	if (!TEST_int_eq(sk_SU_num(s), i)) {
2fae041d P	347	TEST_info("SU stack size %d", i);
98374961 P	348	goto end;
	349	}
	350	sk_SU_push(s, v + i);
	351	}
2fae041d	352	if (!TEST_int_eq(sk_SU_num(s), n))
98374961	353	goto end;
98374961 P	354
	355	/* check the pointers are correct */
	356	for (i = 0; i < n; i++)
2fae041d P	357	if (!TEST_ptr_eq(sk_SU_value(s, i), v + i)) {
2fae041d P	358	TEST_info("SU pointer check %d", i);
98374961 P	359	goto end;
	360	}
	361
	362	testresult = 1;
	363	end:
	364	sk_SU_free(s);
	365	return testresult;
	366	}
	367
	368	void register_tests(void)
	369	{
	370	ADD_TEST(test_int_stack);
	371	ADD_TEST(test_uchar_stack);
	372	ADD_TEST(test_SS_stack);
	373	ADD_TEST(test_SU_stack);
	374	}