litest-runner.c 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137
  1. /*
  2. * Copyright © 2024 Red Hat, Inc.
  3. *
  4. * Permission is hereby granted, free of charge, to any person obtaining a
  5. * copy of this software and associated documentation files (the "Software"),
  6. * to deal in the Software without restriction, including without limitation
  7. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  8. * and/or sell copies of the Software, and to permit persons to whom the
  9. * Software is furnished to do so, subject to the following conditions:
  10. *
  11. * The above copyright notice and this permission notice (including the next
  12. * paragraph) shall be included in all copies or substantial portions of the
  13. * Software.
  14. *
  15. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  18. * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  19. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  20. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
  21. * DEALINGS IN THE SOFTWARE.
  22. */
  23. #include "config.h"
  24. #include <errno.h>
  25. #include <inttypes.h>
  26. #include <sys/epoll.h>
  27. #include <sys/sysinfo.h>
  28. #include <sys/timerfd.h>
  29. #include <sys/wait.h>
  30. #ifdef HAVE_PIDFD_OPEN
  31. #include <sys/syscall.h>
  32. #endif
  33. #include <fcntl.h>
  34. #include <setjmp.h>
  35. #include <signal.h>
  36. #include <stdlib.h>
  37. #include <valgrind/valgrind.h>
  38. #include "util-files.h"
  39. #include "util-list.h"
  40. #include "util-multivalue.h"
  41. #include "util-stringbuf.h"
  42. #include "litest-runner.h"
  43. static bool use_jmpbuf; /* only used for max_forks = 0 */
  44. static jmp_buf jmpbuf;
  45. /* musl doesn't have this one but it's not that important */
  46. #ifndef HAVE_SIGABBREV_NP
  47. #define sigabbrev_np(...) "???"
  48. #endif
  49. static struct litest_runner *global_runner = NULL;
  50. enum litest_runner_logfds {
  51. FD_STDOUT,
  52. FD_STDERR,
  53. FD_LOG,
  54. FD_VALGRIND,
  55. _FD_LAST,
  56. };
  57. struct litest_runner_test {
  58. struct litest_runner_test_description desc;
  59. struct list node;
  60. enum litest_runner_result result;
  61. int sig_or_errno;
  62. struct stringbuf logs[_FD_LAST];
  63. pid_t pid; /* the test's PID, if any */
  64. int read_fds[_FD_LAST]; /* logging fds while the test is running */
  65. int epollfd;
  66. int pidfd;
  67. int timerfd;
  68. struct {
  69. usec_t start_usec;
  70. usec_t end_usec;
  71. } times;
  72. };
  73. struct litest_runner {
  74. size_t max_forks;
  75. unsigned int timeout;
  76. bool verbose;
  77. bool use_colors;
  78. bool exit_on_fail;
  79. FILE *fp;
  80. int terminating;
  81. struct list tests; /* struct litest_runner_test */
  82. struct list tests_running; /* struct litest_runner_test */
  83. struct list tests_complete; /* struct litest_runner_test */
  84. struct {
  85. time_t start;
  86. time_t end;
  87. usec_t start_usec;
  88. } times;
  89. struct {
  90. litest_runner_global_setup_func_t setup;
  91. litest_runner_global_teardown_func_t teardown;
  92. void *userdata;
  93. } global;
  94. };
  95. /**
  96. * A global variable that the tests can use
  97. * to write log data to. Defaults to stdout
  98. * but if used by the tests it shows up as separate
  99. * from stdout in the logs.
  100. */
  101. int testlog_fd = STDOUT_FILENO;
  102. static void
  103. close_pipes(int fds[_FD_LAST])
  104. {
  105. for (int i = 0; i < _FD_LAST; i++) {
  106. if (fds[i] != -1)
  107. fsync(fds[i]);
  108. xclose(&fds[i]);
  109. }
  110. }
  111. static int
  112. init_pipes(int read_fds[_FD_LAST], int write_fds[_FD_LAST])
  113. {
  114. int r;
  115. int i;
  116. int pipe_max_size = 4194304;
  117. for (i = 0; i < _FD_LAST; i++) {
  118. read_fds[i] = -1;
  119. write_fds[i] = -1;
  120. }
  121. #ifdef __linux__
  122. {
  123. FILE *f;
  124. f = fopen("/proc/sys/fs/pipe-max-size", "re");
  125. if (f) {
  126. if (fscanf(f, "%d", &r) == 1)
  127. pipe_max_size = min(r, pipe_max_size);
  128. fclose(f);
  129. }
  130. }
  131. #endif
  132. for (i = 0; i < _FD_LAST; i++) {
  133. int pipe[2];
  134. r = pipe2(pipe, O_CLOEXEC | O_NONBLOCK);
  135. if (r < 0)
  136. goto error;
  137. read_fds[i] = pipe[0];
  138. write_fds[i] = pipe[1];
  139. #ifdef __linux__
  140. /* Max pipe buffers, to avoid scrambling if reading lags.
  141. * Can't use blocking write fds, since reading too slow
  142. * then affects execution.
  143. */
  144. fcntl(write_fds[i], F_SETPIPE_SZ, pipe_max_size);
  145. #endif
  146. }
  147. return 0;
  148. error:
  149. r = -errno;
  150. close_pipes(read_fds);
  151. close_pipes(write_fds);
  152. return r;
  153. }
  154. static const char *
  155. litest_runner_result_as_str(enum litest_runner_result result)
  156. {
  157. switch (result) {
  158. CASE_RETURN_STRING(LITEST_PASS);
  159. CASE_RETURN_STRING(LITEST_NOT_APPLICABLE);
  160. CASE_RETURN_STRING(LITEST_FAIL);
  161. CASE_RETURN_STRING(LITEST_SYSTEM_ERROR);
  162. CASE_RETURN_STRING(LITEST_TIMEOUT);
  163. CASE_RETURN_STRING(LITEST_SKIP);
  164. }
  165. litest_abort_msg("Unknown result %d", result);
  166. return NULL;
  167. }
  168. static void
  169. litest_runner_test_close(struct litest_runner_test *t)
  170. {
  171. for (size_t i = 0; i < ARRAY_LENGTH(t->read_fds); i++) {
  172. xclose(&t->read_fds[i]);
  173. }
  174. xclose(&t->epollfd);
  175. xclose(&t->pidfd);
  176. xclose(&t->timerfd);
  177. }
  178. static void
  179. litest_runner_test_destroy(struct litest_runner_test *t)
  180. {
  181. list_remove(&t->node);
  182. close_pipes(t->read_fds);
  183. if (t->pid != 0) {
  184. kill(t->pid, SIGTERM);
  185. t->pid = 0;
  186. }
  187. litest_runner_test_close(t);
  188. for (int i = 0; i < _FD_LAST; i++) {
  189. stringbuf_reset(&t->logs[i]);
  190. }
  191. free(t);
  192. }
  193. static void
  194. litest_runner_detach_tests(struct litest_runner *runner)
  195. {
  196. struct litest_runner_test *t;
  197. list_for_each_safe(t, &runner->tests, node) {
  198. t->pid = 0;
  199. }
  200. list_for_each_safe(t, &runner->tests_complete, node) {
  201. t->pid = 0;
  202. }
  203. list_for_each_safe(t, &runner->tests_running, node) {
  204. t->pid = 0;
  205. }
  206. }
  207. void
  208. litest_runner_destroy(struct litest_runner *runner)
  209. {
  210. struct litest_runner_test *t;
  211. list_for_each_safe(t, &runner->tests, node) {
  212. litest_runner_test_destroy(t);
  213. }
  214. list_for_each_safe(t, &runner->tests_complete, node) {
  215. litest_runner_test_destroy(t);
  216. }
  217. list_for_each_safe(t, &runner->tests_running, node) {
  218. litest_runner_test_destroy(t);
  219. }
  220. free(runner);
  221. }
  222. static enum litest_runner_result
  223. litest_runner_test_run(const struct litest_runner_test_description *desc)
  224. {
  225. const struct litest_runner_test_env env = {
  226. .rangeval = desc->rangeval,
  227. .params = desc->params,
  228. };
  229. if (desc->setup)
  230. desc->setup(desc);
  231. enum litest_runner_result result = desc->func(&env);
  232. if (desc->teardown)
  233. desc->teardown(desc);
  234. return result;
  235. }
  236. static void
  237. sighandler_forked_child(int signal)
  238. {
  239. struct sigaction act;
  240. sigemptyset(&act.sa_mask);
  241. act.sa_flags = 0;
  242. act.sa_handler = SIG_DFL;
  243. sigaction(signal, &act, NULL);
  244. /* abort() was probably called by litest_assert... which inserts
  245. * the backtrace anyway - we only need to backtrace the other signals
  246. */
  247. if (signal != SIGABRT)
  248. litest_backtrace(NULL);
  249. raise(signal);
  250. }
  251. static int
  252. litest_runner_fork_test(struct litest_runner *runner, struct litest_runner_test *t)
  253. {
  254. pid_t pid;
  255. struct sigaction act;
  256. int write_fds[_FD_LAST];
  257. int r;
  258. r = init_pipes(t->read_fds, write_fds);
  259. if (r < 0) {
  260. return -1;
  261. }
  262. pid = fork();
  263. if (pid < 0) {
  264. int r = -errno;
  265. close_pipes(t->read_fds);
  266. close_pipes(write_fds);
  267. return r;
  268. }
  269. if (pid > 0) { /* parent */
  270. close_pipes(write_fds);
  271. t->pid = pid;
  272. return pid;
  273. }
  274. /* child */
  275. close_pipes(t->read_fds);
  276. /* Catch any crashers so we can insert a backtrace */
  277. sigemptyset(&act.sa_mask);
  278. act.sa_flags = 0;
  279. act.sa_handler = sighandler_forked_child;
  280. sigaction(SIGSEGV, &act, NULL);
  281. sigaction(SIGBUS, &act, NULL);
  282. sigaction(SIGSEGV, &act, NULL);
  283. sigaction(SIGABRT, &act, NULL);
  284. /* SIGALARM is used for our timeout */
  285. sigaction(SIGALRM, &act, NULL);
  286. r = dup2(write_fds[FD_STDERR], STDERR_FILENO);
  287. litest_assert_errno_success(r);
  288. setlinebuf(stderr);
  289. r = dup2(write_fds[FD_STDOUT], STDOUT_FILENO);
  290. litest_assert_errno_success(r);
  291. setlinebuf(stdout);
  292. /* For convenience in the tests, let this be a global variable. */
  293. testlog_fd = write_fds[FD_LOG];
  294. /* We're forked so we have a full copy of everything - but all we want
  295. * to do is avoid valgrind complaining about memleaks in the child
  296. * process. So let's cleanup everything, copy the one thing we
  297. * care about and proceed to the exit */
  298. struct litest_runner_test_description desc = t->desc;
  299. litest_runner_detach_tests(runner);
  300. litest_runner_destroy(runner);
  301. /* Now run the actual test */
  302. enum litest_runner_result result = litest_runner_test_run(&desc);
  303. close_pipes(write_fds);
  304. exit(result);
  305. }
  306. static char *
  307. valgrind_logfile(pid_t pid)
  308. {
  309. const char *prefix = getenv("LITEST_VALGRIND_LOGDIR");
  310. if (!prefix)
  311. prefix = ".";
  312. char *filename = strdup_printf("%s/valgrind.%d.log", prefix, pid);
  313. litest_assert_ptr_notnull(filename);
  314. return filename;
  315. }
  316. static void
  317. collect_file(const char *filename, struct stringbuf *b)
  318. {
  319. int fd = open(filename, O_RDONLY);
  320. if (fd == -1) {
  321. _autofree_ char *msg =
  322. strdup_printf("Failed to find '%s': %m", filename);
  323. stringbuf_append_string(b, msg);
  324. } else {
  325. stringbuf_append_from_fd(b, fd, 0);
  326. close(fd);
  327. }
  328. }
  329. static bool
  330. litest_runner_test_collect_child(struct litest_runner_test *t)
  331. {
  332. int r;
  333. int status;
  334. r = waitpid(t->pid, &status, WNOHANG);
  335. if (r <= 0)
  336. return false;
  337. if (WIFEXITED(status)) {
  338. t->result = WEXITSTATUS(status);
  339. if (RUNNING_ON_VALGRIND && t->result == 3) {
  340. char msg[64];
  341. snprintf(msg,
  342. sizeof(msg),
  343. "valgrind exited with an error code, see logs\n");
  344. stringbuf_append_string(&t->logs[FD_LOG], msg);
  345. t->result = LITEST_SYSTEM_ERROR;
  346. }
  347. switch (t->result) {
  348. case LITEST_PASS:
  349. case LITEST_SKIP:
  350. case LITEST_NOT_APPLICABLE:
  351. case LITEST_FAIL:
  352. case LITEST_TIMEOUT:
  353. case LITEST_SYSTEM_ERROR:
  354. break;
  355. #pragma GCC diagnostic push
  356. #pragma GCC diagnostic ignored "-Wswitch"
  357. case 0:
  358. /* if a test execve's itself allow for the normal
  359. * exit codes to map to the results */
  360. t->result = LITEST_PASS;
  361. break;
  362. #pragma GCC diagnostic pop
  363. default: {
  364. char msg[64];
  365. snprintf(msg,
  366. sizeof(msg),
  367. "Invalid test exit status %d",
  368. t->result);
  369. stringbuf_append_string(&t->logs[FD_LOG], msg);
  370. t->result = LITEST_FAIL;
  371. break;
  372. }
  373. }
  374. } else {
  375. if (WIFSIGNALED(status)) {
  376. t->sig_or_errno = WTERMSIG(status);
  377. t->result = (t->sig_or_errno == t->desc.args.signal)
  378. ? LITEST_PASS
  379. : LITEST_FAIL;
  380. } else {
  381. t->result = LITEST_FAIL;
  382. }
  383. }
  384. usec_t now = usec_from_uint64_t(0);
  385. now_in_us(&now);
  386. t->times.end_usec = now;
  387. if (RUNNING_ON_VALGRIND) {
  388. _autofree_ char *filename = valgrind_logfile(t->pid);
  389. collect_file(filename, &t->logs[FD_VALGRIND]);
  390. }
  391. t->pid = 0;
  392. return true;
  393. }
  394. static int
  395. litest_runner_test_setup_monitoring(struct litest_runner *runner,
  396. struct litest_runner_test *t)
  397. {
  398. int pidfd = -1, timerfd = -1, epollfd = -1;
  399. struct epoll_event ev[10];
  400. size_t nevents = 0;
  401. int r = 0;
  402. #ifdef HAVE_PIDFD_OPEN
  403. pidfd = syscall(SYS_pidfd_open, t->pid, 0);
  404. #else
  405. errno = ENOSYS;
  406. #endif
  407. /* If we don't have pidfd, we use a timerfd to ping us every 200ms */
  408. if (pidfd < 0 && errno == ENOSYS) {
  409. pidfd = timerfd_create(CLOCK_MONOTONIC, TFD_NONBLOCK);
  410. if (pidfd == -1) {
  411. r = -errno;
  412. goto error;
  413. }
  414. r = timerfd_settime(pidfd,
  415. 0,
  416. &((struct itimerspec){
  417. .it_interval.tv_nsec = 200 * 1000 * 1000,
  418. .it_value.tv_nsec = 200 * 1000 * 1000,
  419. }),
  420. NULL);
  421. if (r < 0) {
  422. r = -errno;
  423. goto error;
  424. }
  425. }
  426. /* Each test has an epollfd with:
  427. * - a timerfd so we can kill() it if it hangs
  428. * - a pidfd so we get notified when the test exits
  429. * - a pipe for stdout and a pipe for stderr
  430. * - a pipe for logging (the various pwtest functions)
  431. * - a pipe for the daemon's stdout
  432. */
  433. timerfd = timerfd_create(CLOCK_MONOTONIC, TFD_NONBLOCK);
  434. if (timerfd < 0) {
  435. r = -errno;
  436. goto error;
  437. }
  438. timerfd_settime(timerfd,
  439. 0,
  440. &((struct itimerspec){ .it_value.tv_sec = runner->timeout }),
  441. NULL);
  442. epollfd = epoll_create(1);
  443. if (epollfd < 0)
  444. goto error;
  445. ev[nevents++] = (struct epoll_event){ .events = EPOLLIN, .data.fd = pidfd };
  446. ev[nevents++] = (struct epoll_event){ .events = EPOLLIN,
  447. .data.fd = t->read_fds[FD_STDOUT] };
  448. ev[nevents++] = (struct epoll_event){ .events = EPOLLIN,
  449. .data.fd = t->read_fds[FD_STDERR] };
  450. ev[nevents++] = (struct epoll_event){ .events = EPOLLIN,
  451. .data.fd = t->read_fds[FD_LOG] };
  452. ev[nevents++] = (struct epoll_event){ .events = EPOLLIN, .data.fd = timerfd };
  453. for (size_t i = 0; i < nevents; i++) {
  454. r = epoll_ctl(epollfd, EPOLL_CTL_ADD, ev[i].data.fd, &ev[i]);
  455. if (r < 0) {
  456. r = -errno;
  457. goto error;
  458. }
  459. }
  460. t->epollfd = epollfd;
  461. t->pidfd = pidfd;
  462. t->timerfd = timerfd;
  463. r = 0;
  464. error:
  465. if (r) {
  466. xclose(&pidfd);
  467. xclose(&timerfd);
  468. xclose(&epollfd);
  469. }
  470. return -r;
  471. }
  472. static int
  473. litest_runner_test_check_status(struct litest_runner_test *t)
  474. {
  475. struct epoll_event e;
  476. if (t->pid == 0) /* nofork case */
  477. return 0;
  478. while (true) {
  479. /* FIXME: this is a busy wait ... */
  480. int r = epoll_wait(t->epollfd, &e, 1, 50);
  481. if (r == 0)
  482. return -EAGAIN;
  483. if (r == -1) {
  484. goto error;
  485. }
  486. if (e.data.fd == t->pidfd) {
  487. uint64_t buf;
  488. int ignore = read(t->pidfd,
  489. &buf,
  490. sizeof(buf)); /* for timerfd fallback */
  491. (void)ignore;
  492. if (litest_runner_test_collect_child(t)) {
  493. break;
  494. }
  495. } else if (e.data.fd == t->timerfd) {
  496. /* SIGALARM so we get the backtrace */
  497. kill(t->pid, SIGALRM);
  498. t->result = LITEST_TIMEOUT;
  499. waitpid(t->pid, NULL, 0);
  500. t->pid = 0;
  501. break;
  502. } else {
  503. for (int i = 0; i < _FD_LAST; i++) {
  504. if (e.data.fd == t->read_fds[i]) {
  505. stringbuf_append_from_fd(&t->logs[i],
  506. e.data.fd,
  507. 1024);
  508. }
  509. }
  510. }
  511. };
  512. errno = 0;
  513. error:
  514. return -errno;
  515. }
  516. static void
  517. litest_runner_test_update_errno(struct litest_runner_test *t, int error)
  518. {
  519. if (error)
  520. t->sig_or_errno = -error;
  521. if (error == SIGTERM) {
  522. char msg[64];
  523. snprintf(msg, sizeof(msg), "litest: tests terminated by signal\n");
  524. stringbuf_append_string(&t->logs[FD_LOG], msg);
  525. t->result = LITEST_SYSTEM_ERROR;
  526. }
  527. for (size_t i = 0; i < ARRAY_LENGTH(t->read_fds); i++) {
  528. stringbuf_append_from_fd(&t->logs[i], t->read_fds[i], 1024);
  529. }
  530. }
  531. __attribute__((noreturn)) void
  532. litest_runner_abort(void)
  533. {
  534. if (use_jmpbuf) {
  535. longjmp(jmpbuf, SIGABRT);
  536. } else {
  537. abort();
  538. }
  539. }
  540. static int
  541. litest_runner_run_test(struct litest_runner *runner, struct litest_runner_test *t)
  542. {
  543. int r;
  544. t->result = LITEST_SYSTEM_ERROR;
  545. usec_t now = usec_from_uint64_t(0);
  546. now_in_us(&now);
  547. t->times.start_usec = now;
  548. if (runner->max_forks == 0) {
  549. if (use_jmpbuf && setjmp(jmpbuf) == 0) {
  550. t->result = litest_runner_test_run(&t->desc);
  551. } else {
  552. t->result = LITEST_FAIL;
  553. }
  554. r = 0; /* -Wclobbered */
  555. } else {
  556. r = litest_runner_fork_test(runner, t);
  557. if (r >= 0)
  558. r = litest_runner_test_setup_monitoring(runner, t);
  559. litest_runner_test_update_errno(t, -r);
  560. }
  561. if (r >= 0) {
  562. list_remove(&t->node);
  563. list_append(&runner->tests_running, &t->node);
  564. }
  565. return r;
  566. }
  567. static void
  568. print_lines(FILE *fp, const char *log, const char *prefix)
  569. {
  570. size_t nlines = 0;
  571. _autostrvfree_ char **lines = strv_from_string(log, "\n", &nlines);
  572. for (size_t i = 0; i < nlines; i++) {
  573. fprintf(fp, "%s%s\n", prefix, lines[i]);
  574. }
  575. }
  576. void
  577. _litest_test_param_fetch(const struct litest_test_parameters *params, ...)
  578. {
  579. struct litest_test_param *p;
  580. const char *name;
  581. va_list args;
  582. va_start(args, params);
  583. while ((name = va_arg(args, const char *))) {
  584. bool found = false;
  585. char type = (char)va_arg(args, int);
  586. void **ptr = va_arg(args, void *);
  587. list_for_each(p, &params->test_params, link) {
  588. if (streq(p->name, name)) {
  589. if (tolower(p->value.type) != tolower(type))
  590. litest_abort_msg(
  591. "Paramter type mismatch: parameter '%s' is of type %c",
  592. p->name,
  593. p->value.type);
  594. found = true;
  595. multivalue_extract(&p->value, ptr);
  596. break;
  597. }
  598. }
  599. if (!found)
  600. litest_abort_msg("Unknown test parameter name '%s'", name);
  601. }
  602. va_end(args);
  603. }
  604. struct litest_test_parameters *
  605. litest_test_parameters_new(void)
  606. {
  607. struct litest_test_parameters *params = zalloc(sizeof *params);
  608. params->refcnt = 1;
  609. list_init(&params->test_params);
  610. return params;
  611. }
  612. struct litest_test_parameters *
  613. litest_test_parameters_unref(struct litest_test_parameters *params)
  614. {
  615. if (params) {
  616. assert(params->refcnt > 0);
  617. if (--params->refcnt == 0) {
  618. struct litest_test_param *p;
  619. list_for_each_safe(p, &params->test_params, link) {
  620. free(p);
  621. }
  622. free(params);
  623. }
  624. }
  625. return NULL;
  626. }
  627. static void
  628. litest_runner_log_test_result(struct litest_runner *runner,
  629. struct litest_runner_test *t)
  630. {
  631. const char *color = NULL;
  632. const char *status = NULL;
  633. litest_assert_int_ge(t->result, (enum litest_runner_result)LITEST_PASS);
  634. litest_assert_int_le(t->result, (enum litest_runner_result)LITEST_SYSTEM_ERROR);
  635. switch (t->result) {
  636. case LITEST_PASS:
  637. color = ANSI_BOLD_GREEN;
  638. break;
  639. case LITEST_FAIL:
  640. color = ANSI_BOLD_RED;
  641. break;
  642. case LITEST_SKIP:
  643. color = ANSI_BOLD_YELLOW;
  644. break;
  645. case LITEST_NOT_APPLICABLE:
  646. color = ANSI_BLUE;
  647. break;
  648. case LITEST_TIMEOUT:
  649. color = ANSI_BOLD_CYAN;
  650. break;
  651. case LITEST_SYSTEM_ERROR:
  652. color = ANSI_BOLD_MAGENTA;
  653. break;
  654. }
  655. fprintf(runner->fp, " - name: \"%s\"\n", t->desc.name);
  656. int min = t->desc.args.range.lower, max = t->desc.args.range.upper;
  657. if (range_is_valid(&t->desc.args.range))
  658. fprintf(runner->fp,
  659. " rangeval: %d # %d..%d\n",
  660. t->desc.rangeval,
  661. min,
  662. max);
  663. if (t->desc.params) {
  664. fprintf(runner->fp, " params:\n");
  665. struct litest_test_param *p;
  666. list_for_each(p, &t->desc.params->test_params, link) {
  667. _autofree_ char *val = multivalue_as_str(&p->value);
  668. fprintf(runner->fp, " %s: %s\n", p->name, val);
  669. }
  670. }
  671. usec_t delta = usec_delta(t->times.end_usec, t->times.start_usec);
  672. usec_t total_delta = usec_delta(t->times.end_usec, runner->times.start_usec);
  673. fprintf(runner->fp,
  674. " duration: %d # (ms), total test run time: %02" PRIu32
  675. ":%02" PRIu32 "\n",
  676. usec_to_millis(delta),
  677. usec_to_minutes(total_delta),
  678. usec_to_seconds(total_delta) % 60);
  679. status = litest_runner_result_as_str(t->result);
  680. fprintf(runner->fp,
  681. " status: %s%s%s\n",
  682. runner->use_colors ? color : "",
  683. &status[7], /* skip LITEST_ prefix */
  684. runner->use_colors ? ANSI_NORMAL : "");
  685. switch (t->result) {
  686. case LITEST_PASS:
  687. case LITEST_SKIP:
  688. case LITEST_NOT_APPLICABLE:
  689. if (!runner->verbose)
  690. return;
  691. break;
  692. default:
  693. break;
  694. }
  695. if (t->sig_or_errno > 0)
  696. fprintf(runner->fp,
  697. " signal: %d # SIG%s \n",
  698. t->sig_or_errno,
  699. sigabbrev_np(t->sig_or_errno));
  700. else if (t->sig_or_errno < 0)
  701. fprintf(runner->fp,
  702. " errno: %d # %s\n",
  703. -t->sig_or_errno,
  704. strerror(-t->sig_or_errno));
  705. if (!stringbuf_is_empty(&t->logs[FD_LOG])) {
  706. fprintf(runner->fp, " log: |\n");
  707. print_lines(runner->fp, t->logs[FD_LOG].data, " ");
  708. }
  709. if (!stringbuf_is_empty(&t->logs[FD_STDOUT])) {
  710. fprintf(runner->fp, " stdout: |\n");
  711. print_lines(runner->fp, t->logs[FD_STDOUT].data, " ");
  712. }
  713. if (!stringbuf_is_empty(&t->logs[FD_STDERR])) {
  714. fprintf(runner->fp, " stderr: |\n");
  715. print_lines(runner->fp, t->logs[FD_STDERR].data, " ");
  716. }
  717. if (!stringbuf_is_empty(&t->logs[FD_VALGRIND])) {
  718. fprintf(runner->fp, " valgrind: |\n");
  719. print_lines(runner->fp, t->logs[FD_VALGRIND].data, " ");
  720. }
  721. }
  722. struct litest_runner *
  723. litest_runner_new(void)
  724. {
  725. struct litest_runner *runner = zalloc(sizeof *runner);
  726. list_init(&runner->tests);
  727. list_init(&runner->tests_complete);
  728. list_init(&runner->tests_running);
  729. runner->timeout = LITEST_RUNNER_DEFAULT_TIMEOUT;
  730. runner->max_forks = get_nprocs() * 2;
  731. runner->fp = stderr;
  732. return runner;
  733. }
  734. void
  735. litest_runner_set_timeout(struct litest_runner *runner, unsigned int timeout)
  736. {
  737. runner->timeout = timeout;
  738. }
  739. void
  740. litest_runner_set_output_file(struct litest_runner *runner, FILE *fp)
  741. {
  742. setlinebuf(fp);
  743. runner->fp = fp;
  744. }
  745. void
  746. litest_runner_set_num_parallel(struct litest_runner *runner, size_t num_jobs)
  747. {
  748. runner->max_forks = num_jobs;
  749. }
  750. void
  751. litest_runner_set_verbose(struct litest_runner *runner, bool verbose)
  752. {
  753. runner->verbose = verbose;
  754. }
  755. void
  756. litest_runner_set_use_colors(struct litest_runner *runner, bool use_colors)
  757. {
  758. runner->use_colors = use_colors;
  759. }
  760. void
  761. litest_runner_set_exit_on_fail(struct litest_runner *runner, bool do_exit)
  762. {
  763. runner->exit_on_fail = do_exit;
  764. }
  765. void
  766. litest_runner_set_setup_funcs(struct litest_runner *runner,
  767. litest_runner_global_setup_func_t setup,
  768. litest_runner_global_teardown_func_t teardown,
  769. void *userdata)
  770. {
  771. runner->global.setup = setup;
  772. runner->global.teardown = teardown;
  773. runner->global.userdata = userdata;
  774. }
  775. void
  776. litest_runner_add_test(struct litest_runner *runner,
  777. const struct litest_runner_test_description *desc)
  778. {
  779. struct litest_runner_test *t = zalloc(sizeof(*t));
  780. t->desc = *desc;
  781. t->epollfd = -1;
  782. t->pidfd = -1;
  783. t->timerfd = -1;
  784. for (int i = 0; i < _FD_LAST; i++) {
  785. stringbuf_init(&t->logs[i]);
  786. }
  787. for (size_t i = 0; i < ARRAY_LENGTH(t->read_fds); i++) {
  788. t->read_fds[i] = -1;
  789. }
  790. list_append(&runner->tests, &t->node);
  791. }
  792. static int
  793. litest_runner_check_finished_tests(struct litest_runner *runner)
  794. {
  795. struct litest_runner_test *running;
  796. size_t count = 0;
  797. list_for_each_safe(running, &runner->tests_running, node) {
  798. int r = litest_runner_test_check_status(running);
  799. if (r == -EAGAIN)
  800. continue;
  801. usec_t now = usec_from_uint64_t(0);
  802. now_in_us(&now);
  803. running->times.end_usec = now;
  804. if (r < 0)
  805. litest_runner_test_update_errno(running, -r);
  806. litest_runner_log_test_result(runner, running);
  807. litest_runner_test_close(running);
  808. list_remove(&running->node);
  809. list_append(&runner->tests_complete, &running->node);
  810. count++;
  811. }
  812. return count;
  813. }
  814. static void
  815. runner_sighandler(int sig)
  816. {
  817. struct litest_runner_test *t;
  818. struct litest_runner *runner = global_runner;
  819. list_for_each(t, &runner->tests_running, node) {
  820. if (t->pid != 0) {
  821. kill(t->pid, SIGTERM);
  822. t->pid = 0;
  823. }
  824. }
  825. global_runner->terminating = true;
  826. }
  827. static inline void
  828. setup_sighandler(int sig)
  829. {
  830. struct sigaction act, oact;
  831. int rc;
  832. sigemptyset(&act.sa_mask);
  833. sigaddset(&act.sa_mask, sig);
  834. act.sa_flags = 0;
  835. act.sa_handler = runner_sighandler;
  836. rc = sigaction(sig, &act, &oact);
  837. litest_assert_int_ne(rc, -1);
  838. }
  839. enum litest_runner_result
  840. litest_runner_run_tests(struct litest_runner *runner)
  841. {
  842. struct litest_runner_test *t;
  843. size_t available_jobs = max(runner->max_forks, 1);
  844. char timestamp[64];
  845. struct tm *ltime;
  846. global_runner = runner; /* sigh, need this for signal handling */
  847. if (runner->global.setup)
  848. runner->global.setup(runner->global.userdata);
  849. use_jmpbuf = runner->max_forks == 0;
  850. setup_sighandler(SIGINT);
  851. usec_t now = usec_from_uint64_t(0);
  852. now_in_us(&now);
  853. runner->times.start_usec = now;
  854. runner->times.start = time(NULL);
  855. ltime = localtime(&runner->times.start);
  856. strftime(timestamp, sizeof(timestamp), "%FT%H:%M", ltime);
  857. fprintf(runner->fp,
  858. "start: %lld # \"%s\"\n",
  859. (long long)runner->times.start,
  860. timestamp);
  861. fprintf(runner->fp, "jobs: %zd\n", runner->max_forks);
  862. fprintf(runner->fp, "tests:\n");
  863. list_for_each_safe(t, &runner->tests, node) {
  864. int r = litest_runner_run_test(runner, t);
  865. if (r >= 0) {
  866. available_jobs--;
  867. }
  868. /* Wait for something to become available */
  869. while (available_jobs == 0 && !runner->terminating) {
  870. int complete = litest_runner_check_finished_tests(runner);
  871. available_jobs += complete;
  872. }
  873. if (runner->terminating) {
  874. break;
  875. }
  876. if (runner->exit_on_fail) {
  877. bool do_exit = false;
  878. struct litest_runner_test *complete;
  879. list_for_each(complete, &runner->tests_complete, node) {
  880. switch (complete->result) {
  881. case LITEST_FAIL:
  882. case LITEST_SYSTEM_ERROR:
  883. case LITEST_TIMEOUT:
  884. do_exit = true;
  885. break;
  886. default:
  887. break;
  888. }
  889. if (do_exit)
  890. break;
  891. }
  892. if (do_exit)
  893. break;
  894. }
  895. }
  896. while (!runner->terminating && !list_empty(&runner->tests_running)) {
  897. litest_runner_check_finished_tests(runner);
  898. }
  899. if (runner->global.teardown)
  900. runner->global.teardown(runner->global.userdata);
  901. size_t npass = 0, nfail = 0, nskip = 0, nna = 0;
  902. size_t ncomplete = 0;
  903. list_for_each(t, &runner->tests_complete, node) {
  904. ncomplete++;
  905. switch (t->result) {
  906. case LITEST_PASS:
  907. npass++;
  908. break;
  909. case LITEST_NOT_APPLICABLE:
  910. nna++;
  911. break;
  912. case LITEST_FAIL:
  913. case LITEST_SYSTEM_ERROR:
  914. case LITEST_TIMEOUT:
  915. nfail++;
  916. break;
  917. case LITEST_SKIP:
  918. nskip++;
  919. break;
  920. }
  921. }
  922. runner->times.end = time(NULL);
  923. ltime = localtime(&runner->times.end);
  924. strftime(timestamp, sizeof(timestamp), "%FT%H:%M", ltime);
  925. fprintf(runner->fp,
  926. "end: %lld # \"%s\"\n",
  927. (long long)runner->times.end,
  928. timestamp);
  929. fprintf(runner->fp,
  930. "duration: %lld # (s) %02lld:%02lld\n",
  931. (long long)(runner->times.end - runner->times.start),
  932. (long long)((runner->times.end - runner->times.start) / 60),
  933. (long long)((runner->times.end - runner->times.start) % 60));
  934. fprintf(runner->fp, "summary:\n");
  935. fprintf(runner->fp, " completed: %zd\n", ncomplete);
  936. fprintf(runner->fp, " pass: %zd\n", npass);
  937. fprintf(runner->fp, " na: %zd\n", nna);
  938. fprintf(runner->fp, " fail: %zd\n", nfail);
  939. fprintf(runner->fp, " skip: %zd\n", nskip);
  940. if (nfail > 0) {
  941. fprintf(runner->fp, " failed:\n");
  942. list_for_each(t, &runner->tests_complete, node) {
  943. switch (t->result) {
  944. case LITEST_FAIL:
  945. case LITEST_SYSTEM_ERROR:
  946. case LITEST_TIMEOUT:
  947. litest_runner_log_test_result(runner, t);
  948. break;
  949. default:
  950. break;
  951. }
  952. }
  953. }
  954. if (RUNNING_ON_VALGRIND) {
  955. _autofree_ char *filename = valgrind_logfile(getpid());
  956. _destroy_(stringbuf) *b = stringbuf_new();
  957. collect_file(filename, b);
  958. fprintf(runner->fp, "valgrind:\n");
  959. print_lines(runner->fp, b->data, " ");
  960. fprintf(runner->fp,
  961. "# Valgrind log is incomplete, see %s for full log\n",
  962. filename);
  963. }
  964. enum litest_runner_result result = LITEST_PASS;
  965. /* Didn't finish */
  966. if (!list_empty(&runner->tests) || !list_empty(&runner->tests_running)) {
  967. result = LITEST_SYSTEM_ERROR;
  968. } else {
  969. list_for_each(t, &runner->tests_complete, node) {
  970. switch (t->result) {
  971. case LITEST_PASS:
  972. case LITEST_SKIP:
  973. case LITEST_NOT_APPLICABLE:
  974. break;
  975. default:
  976. result = LITEST_FAIL;
  977. break;
  978. }
  979. }
  980. }
  981. /* Status is always prefixed with LITEST_ */
  982. fprintf(runner->fp, " status: %s\n", &litest_runner_result_as_str(result)[7]);
  983. return result;
  984. }