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/scan_results.hpp"
30*b0d29bc4SBrooks Davis
31*b0d29bc4SBrooks Davis #include "engine/filters.hpp"
32*b0d29bc4SBrooks Davis #include "model/context.hpp"
33*b0d29bc4SBrooks Davis #include "model/test_case.hpp"
34*b0d29bc4SBrooks Davis #include "model/test_program.hpp"
35*b0d29bc4SBrooks Davis #include "store/read_backend.hpp"
36*b0d29bc4SBrooks Davis #include "store/read_transaction.hpp"
37*b0d29bc4SBrooks Davis #include "utils/defs.hpp"
38*b0d29bc4SBrooks Davis
39*b0d29bc4SBrooks Davis namespace fs = utils::fs;
40*b0d29bc4SBrooks Davis
41*b0d29bc4SBrooks Davis
42*b0d29bc4SBrooks Davis /// Pure abstract destructor.
~base_hooks(void)43*b0d29bc4SBrooks Davis drivers::scan_results::base_hooks::~base_hooks(void)
44*b0d29bc4SBrooks Davis {
45*b0d29bc4SBrooks Davis }
46*b0d29bc4SBrooks Davis
47*b0d29bc4SBrooks Davis
48*b0d29bc4SBrooks Davis /// Callback executed before any operation is performed.
49*b0d29bc4SBrooks Davis void
begin(void)50*b0d29bc4SBrooks Davis drivers::scan_results::base_hooks::begin(void)
51*b0d29bc4SBrooks Davis {
52*b0d29bc4SBrooks Davis }
53*b0d29bc4SBrooks Davis
54*b0d29bc4SBrooks Davis
55*b0d29bc4SBrooks Davis /// Callback executed after all operations are performed.
56*b0d29bc4SBrooks Davis void
end(const result &)57*b0d29bc4SBrooks Davis drivers::scan_results::base_hooks::end(const result& /* r */)
58*b0d29bc4SBrooks Davis {
59*b0d29bc4SBrooks Davis }
60*b0d29bc4SBrooks Davis
61*b0d29bc4SBrooks Davis
62*b0d29bc4SBrooks Davis /// Executes the operation.
63*b0d29bc4SBrooks Davis ///
64*b0d29bc4SBrooks Davis /// \param store_path The path to the database store.
65*b0d29bc4SBrooks Davis /// \param raw_filters The test case filters as provided by the user.
66*b0d29bc4SBrooks Davis /// \param hooks The hooks for this execution.
67*b0d29bc4SBrooks Davis ///
68*b0d29bc4SBrooks Davis /// \returns A structure with all results computed by this driver.
69*b0d29bc4SBrooks Davis drivers::scan_results::result
drive(const fs::path & store_path,const std::set<engine::test_filter> & raw_filters,base_hooks & hooks)70*b0d29bc4SBrooks Davis drivers::scan_results::drive(const fs::path& store_path,
71*b0d29bc4SBrooks Davis const std::set< engine::test_filter >& raw_filters,
72*b0d29bc4SBrooks Davis base_hooks& hooks)
73*b0d29bc4SBrooks Davis {
74*b0d29bc4SBrooks Davis engine::filters_state filters(raw_filters);
75*b0d29bc4SBrooks Davis
76*b0d29bc4SBrooks Davis store::read_backend db = store::read_backend::open_ro(store_path);
77*b0d29bc4SBrooks Davis store::read_transaction tx = db.start_read();
78*b0d29bc4SBrooks Davis
79*b0d29bc4SBrooks Davis hooks.begin();
80*b0d29bc4SBrooks Davis
81*b0d29bc4SBrooks Davis const model::context context = tx.get_context();
82*b0d29bc4SBrooks Davis hooks.got_context(context);
83*b0d29bc4SBrooks Davis
84*b0d29bc4SBrooks Davis store::results_iterator iter = tx.get_results();
85*b0d29bc4SBrooks Davis while (iter) {
86*b0d29bc4SBrooks Davis // TODO(jmmv): We should be filtering at the test case level for
87*b0d29bc4SBrooks Davis // efficiency, but that means we would need to execute more than one
88*b0d29bc4SBrooks Davis // query on the database and our current interfaces don't support that.
89*b0d29bc4SBrooks Davis //
90*b0d29bc4SBrooks Davis // Reuse engine::filters_state for the time being because it is simpler
91*b0d29bc4SBrooks Davis // and we get tracking of unmatched filters "for free".
92*b0d29bc4SBrooks Davis const model::test_program_ptr test_program = iter.test_program();
93*b0d29bc4SBrooks Davis if (filters.match_test_program(test_program->relative_path())) {
94*b0d29bc4SBrooks Davis const model::test_case& test_case = test_program->find(
95*b0d29bc4SBrooks Davis iter.test_case_name());
96*b0d29bc4SBrooks Davis if (filters.match_test_case(test_program->relative_path(),
97*b0d29bc4SBrooks Davis test_case.name())) {
98*b0d29bc4SBrooks Davis hooks.got_result(iter);
99*b0d29bc4SBrooks Davis }
100*b0d29bc4SBrooks Davis }
101*b0d29bc4SBrooks Davis ++iter;
102*b0d29bc4SBrooks Davis }
103*b0d29bc4SBrooks Davis
104*b0d29bc4SBrooks Davis result r(filters.unused());
105*b0d29bc4SBrooks Davis hooks.end(r);
106*b0d29bc4SBrooks Davis return r;
107*b0d29bc4SBrooks Davis }
108