weston-test-runner.c 5.26 KB
Newer Older
1 2 3
/*
 * Copyright © 2012 Intel Corporation
 *
4 5 6 7 8 9 10
 * Permission is hereby granted, free of charge, to any person obtaining
 * a copy of this software and associated documentation files (the
 * "Software"), to deal in the Software without restriction, including
 * without limitation the rights to use, copy, modify, merge, publish,
 * distribute, sublicense, and/or sell copies of the Software, and to
 * permit persons to whom the Software is furnished to do so, subject to
 * the following conditions:
11
 *
12 13 14 15 16 17 18 19 20 21 22 23
 * The above copyright notice and this permission notice (including the
 * next paragraph) shall be included in all copies or substantial
 * portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT.  IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
24 25
 */

26
#include "config.h"
27

28 29 30 31 32 33 34
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
#include <sys/wait.h>
#include <string.h>
#include <assert.h>
#include <errno.h>
35
#include <signal.h>
36

37 38
#include "weston-test-runner.h"

39 40
#define SKIP 77

41 42
char __attribute__((weak)) *server_parameters="";

43 44
extern const struct weston_test __start_test_section, __stop_test_section;

45 46 47 48 49 50 51 52
static const char *test_name_;

const char *
get_test_name(void)
{
	return test_name_;
}

53 54 55 56 57 58 59 60 61 62 63 64 65
static const struct weston_test *
find_test(const char *name)
{
	const struct weston_test *t;

	for (t = &__start_test_section; t < &__stop_test_section; t++)
		if (strcmp(t->name, name) == 0)
			return t;

	return NULL;
}

static void
66
run_test(const struct weston_test *t, void *data, int iteration)
67
{
68 69 70 71 72 73 74 75 76
	char str[512];

	if (data) {
		snprintf(str, sizeof(str), "%s[%d]", t->name, iteration);
		test_name_ = str;
	} else {
		test_name_ = t->name;
	}

77
	t->run(data);
78 79 80
	exit(EXIT_SUCCESS);
}

81 82 83 84 85 86 87 88 89 90
static void
list_tests(void)
{
	const struct weston_test *t;

	fprintf(stderr, "Available test names:\n");
	for (t = &__start_test_section; t < &__stop_test_section; t++)
		fprintf(stderr, "	%s\n", t->name);
}

91
/* iteration is valid only if test_data is not NULL */
92 93 94 95
static int
exec_and_report_test(const struct weston_test *t, void *test_data, int iteration)
{
	int success = 0;
96
	int skip = 0;
97 98 99 100 101 102 103
	int hardfail = 0;
	siginfo_t info;

	pid_t pid = fork();
	assert(pid >= 0);

	if (pid == 0)
104
		run_test(t, test_data, iteration); /* never returns */
105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120

	if (waitid(P_ALL, 0, &info, WEXITED)) {
		fprintf(stderr, "waitid failed: %m\n");
		abort();
	}

	if (test_data)
		fprintf(stderr, "test \"%s/%i\":\t", t->name, iteration);
	else
		fprintf(stderr, "test \"%s\":\t", t->name);

	switch (info.si_code) {
	case CLD_EXITED:
		fprintf(stderr, "exit status %d", info.si_status);
		if (info.si_status == EXIT_SUCCESS)
			success = 1;
121 122
		else if (info.si_status == SKIP)
			skip = 1;
123 124 125 126 127 128 129 130 131 132 133 134 135 136 137
		break;
	case CLD_KILLED:
	case CLD_DUMPED:
		fprintf(stderr, "signal %d", info.si_status);
		if (info.si_status != SIGABRT)
			hardfail = 1;
		break;
	}

	if (t->must_fail)
		success = !success;

	if (success && !hardfail) {
		fprintf(stderr, ", pass.\n");
		return 1;
138 139 140 141
	} else if (skip) {
		fprintf(stderr, ", skip.\n");
		return SKIP;
	} else {
142 143 144 145 146
		fprintf(stderr, ", fail.\n");
		return 0;
	}
}

147 148 149 150
/* Returns number of tests and number of pass / fail in param args.
 * Even non-iterated tests go through here, they simply have n_elements = 1 and
 * table_data = NULL.
 */
151
static int
152
iterate_test(const struct weston_test *t, int *passed, int *skipped)
153
{
154
	int ret, i;
155 156 157
	void *current_test_data = (void *) t->table_data;
	for (i = 0; i < t->n_elements; ++i, current_test_data += t->element_size)
	{
158 159 160 161
		ret = exec_and_report_test(t, current_test_data, i);
		if (ret == SKIP)
			++(*skipped);
		else if (ret)
162 163 164 165 166 167
			++(*passed);
	}

	return t->n_elements;
}

168 169 170
int main(int argc, char *argv[])
{
	const struct weston_test *t;
171 172
	int total = 0;
	int pass = 0;
173
	int skip = 0;
174 175

	if (argc == 2) {
176 177 178 179 180 181 182 183
		const char *testname = argv[1];
		if (strcmp(testname, "--help") == 0 ||
		    strcmp(testname, "-h") == 0) {
			fprintf(stderr, "Usage: %s [test-name]\n", program_invocation_short_name);
			list_tests();
			exit(EXIT_SUCCESS);
		}

184 185 186 187 188 189
		if (strcmp(testname, "--params") == 0 ||
		    strcmp(testname, "-p") == 0) {
			printf("%s", server_parameters);
			exit(EXIT_SUCCESS);
		}

190 191 192
		t = find_test(argv[1]);
		if (t == NULL) {
			fprintf(stderr, "unknown test: \"%s\"\n", argv[1]);
193
			list_tests();
194 195 196
			exit(EXIT_FAILURE);
		}

197 198
		int number_passed_in_test = 0, number_skipped_in_test = 0;
		total += iterate_test(t, &number_passed_in_test, &number_skipped_in_test);
199
		pass += number_passed_in_test;
200
		skip += number_skipped_in_test;
201 202
	} else {
		for (t = &__start_test_section; t < &__stop_test_section; t++) {
203 204
			int number_passed_in_test = 0, number_skipped_in_test = 0;
			total += iterate_test(t, &number_passed_in_test, &number_skipped_in_test);
205
			pass += number_passed_in_test;
206
			skip += number_skipped_in_test;
207 208 209
		}
	}

210 211 212 213 214 215 216
	fprintf(stderr, "%d tests, %d pass, %d skip, %d fail\n",
		total, pass, skip, total - pass - skip);

	if (skip == total)
		return SKIP;
	else if (pass + skip == total)
		return EXIT_SUCCESS;
217

218
	return EXIT_FAILURE;
219
}