aboutsummaryrefslogtreecommitdiffstats
path: root/test/twbctf.c
blob: 3b3ae4b0ec50ef632e65bcf2cbceb4431ae4d8ac (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/*******************************************************************\
 * A small, C test framework                                         *
 * Copyright (C) 2013-2014, Sam Stuewe                               *
 *                                                                   *
 * This program is free software; you can redistribute it and/or     *
 * modify it under the terms of the GNU General Public License       *
 * as published by the Free Software Foundation; either version 2    *
 * of the License, or (at your option) any later version.            *
 *                                                                   *
 * This program is distributed in the hope that it will be useful,   *
 * but WITHOUT ANY WARRANTY; without even the implied warranty of    *
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the      *
 * GNU General Public License for more details.                      *
 *                                                                   *
 * You should have received a copy of the GNU General Public License *
 * along with this program; if not, write to the Free Software       *
 * Foundation, Inc., 51 Franklin Street, Fifth Floor,                *
 * Boston, MA  02110-1301, USA.                                      *
\*********************************************************************/

// Libraries //
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>

#include "twbctf.h"
#include "test.c"

// Forward Declarations //
#define TEST_COUNT ((sizeof test_list)/(sizeof (struct test)))

uint8_t
longest_desc(const struct test *list) {
	uint8_t longest = 0;
	for (size_t i = 0; i < TEST_COUNT; i++) {
		uint8_t len = (uint8_t)strlen(list[i].desc);
		if (longest < len) {
			longest = len;
		}
	}
	return longest;
}

// Run Suite //
signed
main(signed argc, char * argv []) {

	uint8_t print_width = longest_desc(test_list);

	const size_t tc = TEST_COUNT;
	bool results [tc];
	bool shortened = (argc > 1 && *(short * )argv[1] == 0x732d);
	for ( size_t i = 0; i < tc; i ++ ) {
		if ( shortened ) {
			results[i] = test_list[i].func();
			//printf(results[i] ? "\x1b[32m." : "\x1b[31mF");
			putchar(results[i] ? '.' : '!');
		} else {
			printf("Testing %-*s\t\t[ PEND ]\r", print_width, test_list[i].desc);
			char * r = test_list[i].func() ? "\x1b[32mPASS" : "\x1b[31mFAIL";
			printf("Testing %-*s\t\t[ %s \x1b[0m]\n", print_width, test_list[i].desc, r);
		}
	} if ( shortened ) {
		printf("\x1b[0m\n\nFailed Tests:\n");
		for ( size_t i = 0; i < tc; i ++ ) {
			!results[i] ? printf(" %s\n", test_list[i].desc) : printf("");
		}
	} return 0;
}