blob: 9c420d186c9bd12e58dd252aa8495741fa2c2b10 [file] [log] [blame]
Laurence Lundbladef156fb82018-10-01 09:47:03 -07001
2/*==============================================================================
3 run_tests.c -- test aggregator and results reporting
4
Laurence Lundbladed92a6162018-11-01 11:38:35 +07005 Copyright (c) 2018, Laurence Lundblade.
6 All rights reserved.
Laurence Lundbladef156fb82018-10-01 09:47:03 -07007
Laurence Lundblade0dbc9172018-11-01 14:17:21 +07008Redistribution and use in source and binary forms, with or without
9modification, are permitted provided that the following conditions are
10met:
11 * Redistributions of source code must retain the above copyright
12 notice, this list of conditions and the following disclaimer.
13 * Redistributions in binary form must reproduce the above
14 copyright notice, this list of conditions and the following
15 disclaimer in the documentation and/or other materials provided
16 with the distribution.
17 * The name "Laurence Lundblade" may not be used to
18 endorse or promote products derived from this software without
19 specific prior written permission.
Laurence Lundbladef156fb82018-10-01 09:47:03 -070020
Laurence Lundblade0dbc9172018-11-01 14:17:21 +070021THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED
22WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
23MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT
24ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
25BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
26CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
27SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
28BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
29WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
30OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
31IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ==============================================================================*/
Laurence Lundbladef156fb82018-10-01 09:47:03 -070032// Created by Laurence Lundblade on 9/30/18.
33
34
35#include "run_tests.h"
36#include "UsefulBuf.h"
37#include <stdbool.h>
38
Laurence Lundblade2d85ce42018-10-12 14:12:47 +080039#include "float_tests.h"
Laurence Lundblade9e3651c2018-10-10 11:49:55 +080040#include "qcbor_decode_tests.h"
Laurence Lundbladedc6e28e2018-10-11 19:19:27 +053041#include "qcbor_encode_tests.h"
42#include "UsefulBuf_Tests.h"
Laurence Lundblade471a3fd2018-10-18 21:27:45 +053043#include "qcbor_decode_malloc_tests.h"
Laurence Lundbladef156fb82018-10-01 09:47:03 -070044
45// Used to test the test runner
46int fail_test()
47{
48 return -44;
49}
50
51
52/*
53 Convert a number up to 999999999 to a string. This is so sprintf doesn't
54 have to be linked in so as to minimized dependencies even in test code.
55
56 This function does pointer math. TODO: test this.
57 */
58const char *NumToString(int32_t nNum, UsefulBuf StringMem)
59{
Laurence Lundblade570fab52018-10-13 18:28:27 +080060 const int32_t nMax = 1000000000;
Laurence Lundbladef156fb82018-10-01 09:47:03 -070061
62 UsefulOutBuf OutBuf;
63 UsefulOutBuf_Init(&OutBuf, StringMem);
64
65 if(nNum < 0) {
66 UsefulOutBuf_AppendByte(&OutBuf, '-');
67 nNum = -nNum;
68 }
Laurence Lundblade570fab52018-10-13 18:28:27 +080069 if(nNum > nMax-1) {
Laurence Lundbladef156fb82018-10-01 09:47:03 -070070 return "XXX";
71 }
72
73 bool bDidSomeOutput = false;
Laurence Lundblade570fab52018-10-13 18:28:27 +080074 for(int n = nMax; n > 0; n/=10) {
Laurence Lundbladef156fb82018-10-01 09:47:03 -070075 int x = nNum/n;
76 if(x || bDidSomeOutput){
77 bDidSomeOutput = true;
78 UsefulOutBuf_AppendByte(&OutBuf, '0' + x);
79 nNum -= x * n;
80 }
81 }
82 if(!bDidSomeOutput){
83 UsefulOutBuf_AppendByte(&OutBuf, '0');
84 }
85 UsefulOutBuf_AppendByte(&OutBuf, '\0');
86
87 return UsefulOutBuf_GetError(&OutBuf) ? "" : StringMem.ptr;
88}
89
90
91
92typedef int (test_fun_t)(void);
Laurence Lundbladedc6e28e2018-10-11 19:19:27 +053093typedef const char * (test_fun2_t)(void);
94
Laurence Lundbladef156fb82018-10-01 09:47:03 -070095
96#define TEST_ENTRY(test_name) {#test_name, test_name}
97typedef struct {
98 const char *szTestName;
99 test_fun_t *test_fun;
100} test_entry;
101
Laurence Lundbladedc6e28e2018-10-11 19:19:27 +0530102typedef struct {
103 const char *szTestName;
104 test_fun2_t *test_fun;
105} test_entry2;
106
107test_entry2 s_tests2[] = {
Laurence Lundblade7566b9f2018-10-12 09:13:32 +0800108 TEST_ENTRY(UBUTest_CopyUtil),
109 TEST_ENTRY(UOBTest_NonAdversarial),
Laurence Lundbladedc6e28e2018-10-11 19:19:27 +0530110 TEST_ENTRY(TestBasicSanity),
Laurence Lundblade7566b9f2018-10-12 09:13:32 +0800111 TEST_ENTRY(UOBTest_BoundaryConditionsTest),
Laurence Lundbladedc6e28e2018-10-11 19:19:27 +0530112 TEST_ENTRY(UBMacroConversionsTest),
113 TEST_ENTRY(UBUtilTests),
Laurence Lundblade7566b9f2018-10-12 09:13:32 +0800114 TEST_ENTRY(UIBTest_IntegerFormat)
Laurence Lundbladedc6e28e2018-10-11 19:19:27 +0530115};
116
117
Laurence Lundbladef156fb82018-10-01 09:47:03 -0700118test_entry s_tests[] = {
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530119 TEST_ENTRY(MallocAllStringsTest),
Laurence Lundbladea44d5062018-10-17 18:45:12 +0530120 TEST_ENTRY(AllocAllStringsTest),
121 TEST_ENTRY(IndefiniteLengthNestTest),
122 TEST_ENTRY(NestedMapTestIndefLen),
123 TEST_ENTRY(ParseSimpleTest),
Laurence Lundblade0fb6c6d2018-10-12 22:02:05 +0800124 TEST_ENTRY(EncodeRawTest),
Laurence Lundblade2d85ce42018-10-12 14:12:47 +0800125 TEST_ENTRY(FloatValuesTest1),
Laurence Lundbladedc6e28e2018-10-11 19:19:27 +0530126 TEST_ENTRY(RTICResultsTest),
127 TEST_ENTRY(MapEncodeTest),
128 TEST_ENTRY(ArrayNestingTest1),
129 TEST_ENTRY(ArrayNestingTest2),
130 TEST_ENTRY(ArrayNestingTest3),
131 TEST_ENTRY(EncodeDateTest),
132 TEST_ENTRY(SimpleValuesTest1),
133 TEST_ENTRY(IntegerValuesTest1),
134 TEST_ENTRY(AllAddMethodsTest),
Laurence Lundblade9e3651c2018-10-10 11:49:55 +0800135 TEST_ENTRY(ParseTooDeepArrayTest),
136 TEST_ENTRY(ComprehensiveInputTest),
137 TEST_ENTRY(ParseMapTest),
Laurence Lundbladea44d5062018-10-17 18:45:12 +0530138 TEST_ENTRY(IndefiniteLengthArrayMapTest),
Laurence Lundblade369b90a2018-10-22 02:04:37 +0530139 TEST_ENTRY(BasicEncodeTest),
Laurence Lundblade9e3651c2018-10-10 11:49:55 +0800140 TEST_ENTRY(NestedMapTest),
141 TEST_ENTRY(BignumParseTest),
142 TEST_ENTRY(OptTagParseTest),
143 TEST_ENTRY(DateParseTest),
Laurence Lundblade9e3651c2018-10-10 11:49:55 +0800144 TEST_ENTRY(ShortBufferParseTest2),
145 TEST_ENTRY(ShortBufferParseTest),
146 TEST_ENTRY(ParseDeepArrayTest),
147 TEST_ENTRY(SimpleArrayTest),
148 TEST_ENTRY(IntegerValuesParseTest),
Laurence Lundbladea44d5062018-10-17 18:45:12 +0530149 TEST_ENTRY(MemPoolTest),
150 TEST_ENTRY(IndefiniteLengthStringTest),
Laurence Lundbladebb474be2018-10-22 11:53:21 +0530151 TEST_ENTRY(HalfPrecisionEncodeBasicTests),
152 TEST_ENTRY(HalfPrecisionDecodeBasicTests),
153 TEST_ENTRY(HalfPrecisionTransitiveTest),
154 TEST_ENTRY(DoubleAsSmallestTest),
155 TEST_ENTRY(HalfPrecisionAgainstRFCCodeTest),
Laurence Lundblade369b90a2018-10-22 02:04:37 +0530156 TEST_ENTRY(BstrWrapTest),
157 TEST_ENTRY(BstrWrapErrorTest),
158 TEST_ENTRY(BstrWrapNestTest),
159 TEST_ENTRY(CoseSign1TBSTest),
Laurence Lundbladef156fb82018-10-01 09:47:03 -0700160 //TEST_ENTRY(fail_test),
161};
162
163
164int run_tests(outputstring output, void *poutCtx, int *pNumTestsRun)
165{
166 int nTestsFailed = 0;
167 int nTestsRun = 0;
Laurence Lundblade4fe9f312018-10-22 10:22:39 +0530168 UsefulBuf_MAKE_STACK_UB(StringStorage, 5);
Laurence Lundbladedc6e28e2018-10-11 19:19:27 +0530169
170 test_entry2 *t2;
171 const test_entry2 *s_tests2_end = s_tests2 + sizeof(s_tests2)/sizeof(test_entry2);
172
173 for(t2 = s_tests2; t2 < s_tests2_end; t2++) {
174 const char * x = (t2->test_fun)();
175 nTestsRun++;
176 if(output) {
177 (*output)(t2->szTestName, poutCtx);
178 }
179
180 if(x) {
181 if(output) {
182 (*output)(" FAILED (returned ", poutCtx);
183 (*output)(x, poutCtx);
184 (*output)(")\n", poutCtx);
185 }
186 nTestsFailed++;
187 } else {
188 if(output) {
189 (*output)( " PASSED\n", poutCtx);
190 }
191 }
192 }
193
Laurence Lundbladef156fb82018-10-01 09:47:03 -0700194
195 test_entry *t;
196 const test_entry *s_tests_end = s_tests + sizeof(s_tests)/sizeof(test_entry);
197
198 for(t = s_tests; t < s_tests_end; t++) {
199 int x = (t->test_fun)();
200 nTestsRun++;
201 if(output) {
202 (*output)(t->szTestName, poutCtx);
203 }
204
205 if(x) {
206 if(output) {
207 (*output)(" FAILED (returned ", poutCtx);
208 (*output)(NumToString(x, StringStorage), poutCtx);
209 (*output)(")\n", poutCtx);
210 }
211 nTestsFailed++;
212 } else {
213 if(output) {
214 (*output)( " PASSED\n", poutCtx);
215 }
216 }
217 }
218
219 if(pNumTestsRun) {
220 *pNumTestsRun = nTestsRun;
221 }
222
223 if(output) {
224 (*output)( "SUMMARY: ", poutCtx);
225 (*output)( NumToString(nTestsRun, StringStorage), poutCtx);
226 (*output)( " tests run; ", poutCtx);
227 (*output)( NumToString(nTestsFailed, StringStorage), poutCtx);
228 (*output)( " tests failed\n", poutCtx);
229 }
230
231 return nTestsFailed;
232}