1*b0d29bc4SBrooks Davis // Copyright 2011 The Kyua Authors.
2*b0d29bc4SBrooks Davis // All rights reserved.
3*b0d29bc4SBrooks Davis //
4*b0d29bc4SBrooks Davis // Redistribution and use in source and binary forms, with or without
5*b0d29bc4SBrooks Davis // modification, are permitted provided that the following conditions are
6*b0d29bc4SBrooks Davis // met:
7*b0d29bc4SBrooks Davis //
8*b0d29bc4SBrooks Davis // * Redistributions of source code must retain the above copyright
9*b0d29bc4SBrooks Davis // notice, this list of conditions and the following disclaimer.
10*b0d29bc4SBrooks Davis // * Redistributions in binary form must reproduce the above copyright
11*b0d29bc4SBrooks Davis // notice, this list of conditions and the following disclaimer in the
12*b0d29bc4SBrooks Davis // documentation and/or other materials provided with the distribution.
13*b0d29bc4SBrooks Davis // * Neither the name of Google Inc. nor the names of its contributors
14*b0d29bc4SBrooks Davis // may be used to endorse or promote products derived from this software
15*b0d29bc4SBrooks Davis // without specific prior written permission.
16*b0d29bc4SBrooks Davis //
17*b0d29bc4SBrooks Davis // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18*b0d29bc4SBrooks Davis // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19*b0d29bc4SBrooks Davis // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20*b0d29bc4SBrooks Davis // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21*b0d29bc4SBrooks Davis // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22*b0d29bc4SBrooks Davis // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23*b0d29bc4SBrooks Davis // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24*b0d29bc4SBrooks Davis // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25*b0d29bc4SBrooks Davis // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26*b0d29bc4SBrooks Davis // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27*b0d29bc4SBrooks Davis // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28*b0d29bc4SBrooks Davis
29*b0d29bc4SBrooks Davis #include "drivers/debug_test.hpp"
30*b0d29bc4SBrooks Davis
31*b0d29bc4SBrooks Davis #include <stdexcept>
32*b0d29bc4SBrooks Davis #include <utility>
33*b0d29bc4SBrooks Davis
34*b0d29bc4SBrooks Davis #include "engine/filters.hpp"
35*b0d29bc4SBrooks Davis #include "engine/kyuafile.hpp"
36*b0d29bc4SBrooks Davis #include "engine/scanner.hpp"
37*b0d29bc4SBrooks Davis #include "engine/scheduler.hpp"
38*b0d29bc4SBrooks Davis #include "model/test_case.hpp"
39*b0d29bc4SBrooks Davis #include "model/test_program.hpp"
40*b0d29bc4SBrooks Davis #include "model/test_result.hpp"
41*b0d29bc4SBrooks Davis #include "utils/defs.hpp"
42*b0d29bc4SBrooks Davis #include "utils/format/macros.hpp"
43*b0d29bc4SBrooks Davis #include "utils/fs/auto_cleaners.hpp"
44*b0d29bc4SBrooks Davis #include "utils/optional.ipp"
45*b0d29bc4SBrooks Davis
46*b0d29bc4SBrooks Davis namespace config = utils::config;
47*b0d29bc4SBrooks Davis namespace fs = utils::fs;
48*b0d29bc4SBrooks Davis namespace scheduler = engine::scheduler;
49*b0d29bc4SBrooks Davis
50*b0d29bc4SBrooks Davis using utils::optional;
51*b0d29bc4SBrooks Davis
52*b0d29bc4SBrooks Davis
53*b0d29bc4SBrooks Davis /// Executes the operation.
54*b0d29bc4SBrooks Davis ///
55*b0d29bc4SBrooks Davis /// \param kyuafile_path The path to the Kyuafile to be loaded.
56*b0d29bc4SBrooks Davis /// \param build_root If not none, path to the built test programs.
57*b0d29bc4SBrooks Davis /// \param filter The test case filter to locate the test to debug.
58*b0d29bc4SBrooks Davis /// \param user_config The end-user configuration properties.
59*b0d29bc4SBrooks Davis /// \param stdout_path The name of the file into which to store the test case
60*b0d29bc4SBrooks Davis /// stdout.
61*b0d29bc4SBrooks Davis /// \param stderr_path The name of the file into which to store the test case
62*b0d29bc4SBrooks Davis /// stderr.
63*b0d29bc4SBrooks Davis ///
64*b0d29bc4SBrooks Davis /// \returns A structure with all results computed by this driver.
65*b0d29bc4SBrooks Davis drivers::debug_test::result
drive(const fs::path & kyuafile_path,const optional<fs::path> build_root,const engine::test_filter & filter,const config::tree & user_config,const fs::path & stdout_path,const fs::path & stderr_path)66*b0d29bc4SBrooks Davis drivers::debug_test::drive(const fs::path& kyuafile_path,
67*b0d29bc4SBrooks Davis const optional< fs::path > build_root,
68*b0d29bc4SBrooks Davis const engine::test_filter& filter,
69*b0d29bc4SBrooks Davis const config::tree& user_config,
70*b0d29bc4SBrooks Davis const fs::path& stdout_path,
71*b0d29bc4SBrooks Davis const fs::path& stderr_path)
72*b0d29bc4SBrooks Davis {
73*b0d29bc4SBrooks Davis scheduler::scheduler_handle handle = scheduler::setup();
74*b0d29bc4SBrooks Davis
75*b0d29bc4SBrooks Davis const engine::kyuafile kyuafile = engine::kyuafile::load(
76*b0d29bc4SBrooks Davis kyuafile_path, build_root, user_config, handle);
77*b0d29bc4SBrooks Davis std::set< engine::test_filter > filters;
78*b0d29bc4SBrooks Davis filters.insert(filter);
79*b0d29bc4SBrooks Davis
80*b0d29bc4SBrooks Davis engine::scanner scanner(kyuafile.test_programs(), filters);
81*b0d29bc4SBrooks Davis optional< engine::scan_result > match;
82*b0d29bc4SBrooks Davis while (!match && !scanner.done()) {
83*b0d29bc4SBrooks Davis match = scanner.yield();
84*b0d29bc4SBrooks Davis }
85*b0d29bc4SBrooks Davis if (!match) {
86*b0d29bc4SBrooks Davis throw std::runtime_error(F("Unknown test case '%s'") % filter.str());
87*b0d29bc4SBrooks Davis } else if (!scanner.done()) {
88*b0d29bc4SBrooks Davis throw std::runtime_error(F("The filter '%s' matches more than one test "
89*b0d29bc4SBrooks Davis "case") % filter.str());
90*b0d29bc4SBrooks Davis }
91*b0d29bc4SBrooks Davis INV(match && scanner.done());
92*b0d29bc4SBrooks Davis const model::test_program_ptr test_program = match.get().first;
93*b0d29bc4SBrooks Davis const std::string& test_case_name = match.get().second;
94*b0d29bc4SBrooks Davis
95*b0d29bc4SBrooks Davis scheduler::result_handle_ptr result_handle = handle.debug_test(
96*b0d29bc4SBrooks Davis test_program, test_case_name, user_config,
97*b0d29bc4SBrooks Davis stdout_path, stderr_path);
98*b0d29bc4SBrooks Davis const scheduler::test_result_handle* test_result_handle =
99*b0d29bc4SBrooks Davis dynamic_cast< const scheduler::test_result_handle* >(
100*b0d29bc4SBrooks Davis result_handle.get());
101*b0d29bc4SBrooks Davis const model::test_result test_result = test_result_handle->test_result();
102*b0d29bc4SBrooks Davis result_handle->cleanup();
103*b0d29bc4SBrooks Davis
104*b0d29bc4SBrooks Davis handle.check_interrupt();
105*b0d29bc4SBrooks Davis handle.cleanup();
106*b0d29bc4SBrooks Davis
107*b0d29bc4SBrooks Davis return result(engine::test_filter(
108*b0d29bc4SBrooks Davis test_program->relative_path(), test_case_name), test_result);
109*b0d29bc4SBrooks Davis }
110