/* Copyright Joyent, Inc. and other Node contributors. All rights reserved. * * 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: * * The above copyright notice and this permission notice 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. */ #include #include "runner.h" #include "task.h" char executable_path[PATHMAX] = { '\0' }; static void log_progress(int total, int passed, int failed, const char* name) { LOGF("[%% %3d|+ %3d|- %3d]: %s", (passed + failed) / total * 100, passed, failed, name); } int run_tests(int timeout, int benchmark_output) { int total, passed, failed; task_entry_t* task; /* Count the number of tests. */ total = 0; for (task = TASKS; task->main; task++) { if (!task->is_helper) { total++; } } /* Run all tests. */ passed = 0; failed = 0; for (task = TASKS; task->main; task++) { if (task->is_helper) { continue; } rewind_cursor(); if (!benchmark_output) { log_progress(total, passed, failed, task->task_name); } if (run_test(task->task_name, timeout, benchmark_output) == 0) { passed++; } else { failed++; } } rewind_cursor(); if (!benchmark_output) { log_progress(total, passed, failed, "Done.\n"); } return 0; } int run_test(const char* test, int timeout, int benchmark_output) { char errmsg[1024] = "no error"; process_info_t processes[1024]; process_info_t *main_proc; task_entry_t* task; int process_count; int result; int status; int i; status = 255; process_count = 0; /* If it's a helper the user asks for, start it directly. */ for (task = TASKS; task->main; task++) { if (task->is_helper && strcmp(test, task->process_name) == 0) { return task->main(); } } /* Start the helpers first. */ for (task = TASKS; task->main; task++) { if (strcmp(test, task->task_name) != 0) { continue; } /* Skip the test itself. */ if (!task->is_helper) { continue; } if (process_start(task->task_name, task->process_name, &processes[process_count]) == -1) { snprintf(errmsg, sizeof errmsg, "Process `%s` failed to start.", task->process_name); goto out; } process_count++; } /* Give the helpers time to settle. Race-y, fix this. */ uv_sleep(250); /* Now start the test itself. */ for (main_proc = NULL, task = TASKS; task->main; task++) { if (strcmp(test, task->task_name) != 0) { continue; } if (task->is_helper) { continue; } if (process_start(task->task_name, task->process_name, &processes[process_count]) == -1) { snprintf(errmsg, sizeof errmsg, "Process `%s` failed to start.", task->process_name); goto out; } main_proc = &processes[process_count]; process_count++; break; } if (main_proc == NULL) { snprintf(errmsg, sizeof errmsg, "No test with that name: %s", test); goto out; } result = process_wait(main_proc, 1, timeout); if (result == -1) { FATAL("process_wait failed"); } else if (result == -2) { /* Don't have to clean up the process, process_wait() has killed it. */ snprintf(errmsg, sizeof errmsg, "timeout"); goto out; } status = process_reap(main_proc); if (status != 0) { snprintf(errmsg, sizeof errmsg, "exit code %d", status); goto out; } if (benchmark_output) { /* Give the helpers time to clean up their act. */ uv_sleep(1000); } out: /* Reap running processes except the main process, it's already dead. */ for (i = 0; i < process_count - 1; i++) { process_terminate(&processes[i]); } if (process_wait(processes, process_count - 1, -1) < 0) { FATAL("process_wait failed"); } /* Show error and output from processes if the test failed. */ if (status != 0) { LOGF("\n`%s` failed: %s\n", test, errmsg); for (i = 0; i < process_count; i++) { switch (process_output_size(&processes[i])) { case -1: LOGF("Output from process `%s`: (unavailable)\n", process_get_name(&processes[i])); break; case 0: LOGF("Output from process `%s`: (no output)\n", process_get_name(&processes[i])); break; default: LOGF("Output from process `%s`:\n", process_get_name(&processes[i])); process_copy_output(&processes[i], fileno(stderr)); break; } } LOG("=============================================================\n"); /* In benchmark mode show concise output from the main process. */ } else if (benchmark_output) { switch (process_output_size(main_proc)) { case -1: LOGF("%s: (unavailabe)\n", test); break; case 0: LOGF("%s: (no output)\n", test); break; default: for (i = 0; i < process_count; i++) { process_copy_output(&processes[i], fileno(stderr)); } break; } } /* Clean up all process handles. */ for (i = 0; i < process_count; i++) { process_cleanup(&processes[i]); } return status; } /* Returns the status code of the task part * or 255 if no matching task was not found. */ int run_test_part(const char* test, const char* part) { task_entry_t* task; for (task = TASKS; task->main; task++) { if (strcmp(test, task->task_name) == 0 && strcmp(part, task->process_name) == 0) { return task->main(); } } LOGF("No test part with that name: %s:%s\n", test, part); return 255; } static int compare_task(const void* va, const void* vb) { const task_entry_t* a = va; const task_entry_t* b = vb; return strcmp(a->task_name, b->task_name); } static int find_helpers(const task_entry_t* task, const task_entry_t** helpers) { const task_entry_t* helper; int n_helpers; for (n_helpers = 0, helper = TASKS; helper->main; helper++) { if (helper->is_helper && strcmp(helper->task_name, task->task_name) == 0) { *helpers++ = helper; n_helpers++; } } return n_helpers; } void print_tests(FILE* stream) { const task_entry_t* helpers[1024]; const task_entry_t* task; int n_helpers; int n_tasks; int i; for (n_tasks = 0, task = TASKS; task->main; n_tasks++, task++); qsort(TASKS, n_tasks, sizeof(TASKS[0]), compare_task); for (task = TASKS; task->main; task++) { if (task->is_helper) { continue; } n_helpers = find_helpers(task, helpers); if (n_helpers) { printf("%-25s (helpers:", task->task_name); for (i = 0; i < n_helpers; i++) { printf(" %s", helpers[i]->process_name); } printf(")\n"); } else { printf("%s\n", task->task_name); } } }