1*6b3a42afSjmmv // Copyright 2011 Google Inc.
2*6b3a42afSjmmv // All rights reserved.
3*6b3a42afSjmmv //
4*6b3a42afSjmmv // Redistribution and use in source and binary forms, with or without
5*6b3a42afSjmmv // modification, are permitted provided that the following conditions are
6*6b3a42afSjmmv // met:
7*6b3a42afSjmmv //
8*6b3a42afSjmmv // * Redistributions of source code must retain the above copyright
9*6b3a42afSjmmv // notice, this list of conditions and the following disclaimer.
10*6b3a42afSjmmv // * Redistributions in binary form must reproduce the above copyright
11*6b3a42afSjmmv // notice, this list of conditions and the following disclaimer in the
12*6b3a42afSjmmv // documentation and/or other materials provided with the distribution.
13*6b3a42afSjmmv // * Neither the name of Google Inc. nor the names of its contributors
14*6b3a42afSjmmv // may be used to endorse or promote products derived from this software
15*6b3a42afSjmmv // without specific prior written permission.
16*6b3a42afSjmmv //
17*6b3a42afSjmmv // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18*6b3a42afSjmmv // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19*6b3a42afSjmmv // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20*6b3a42afSjmmv // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21*6b3a42afSjmmv // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22*6b3a42afSjmmv // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23*6b3a42afSjmmv // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24*6b3a42afSjmmv // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25*6b3a42afSjmmv // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26*6b3a42afSjmmv // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27*6b3a42afSjmmv // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28*6b3a42afSjmmv
29*6b3a42afSjmmv #include "engine/drivers/scan_action.hpp"
30*6b3a42afSjmmv
31*6b3a42afSjmmv #include "engine/action.hpp"
32*6b3a42afSjmmv #include "engine/exceptions.hpp"
33*6b3a42afSjmmv #include "engine/test_result.hpp"
34*6b3a42afSjmmv #include "store/backend.hpp"
35*6b3a42afSjmmv #include "store/exceptions.hpp"
36*6b3a42afSjmmv #include "store/transaction.hpp"
37*6b3a42afSjmmv #include "utils/optional.ipp"
38*6b3a42afSjmmv
39*6b3a42afSjmmv namespace fs = utils::fs;
40*6b3a42afSjmmv namespace scan_action = engine::drivers::scan_action;
41*6b3a42afSjmmv
42*6b3a42afSjmmv using utils::optional;
43*6b3a42afSjmmv
44*6b3a42afSjmmv
45*6b3a42afSjmmv namespace {
46*6b3a42afSjmmv
47*6b3a42afSjmmv
48*6b3a42afSjmmv /// Gets an action from the store.
49*6b3a42afSjmmv ///
50*6b3a42afSjmmv /// \param tx The open store transaction.
51*6b3a42afSjmmv /// \param [in,out] action_id The specific action to get, or none to fetch the
52*6b3a42afSjmmv /// latest available action. This is updated to contain the action id of
53*6b3a42afSjmmv /// the returned action.
54*6b3a42afSjmmv ///
55*6b3a42afSjmmv /// \return The fetched action.
56*6b3a42afSjmmv ///
57*6b3a42afSjmmv /// \throw error If there is any problem while loading the action.
58*6b3a42afSjmmv static engine::action
get_action(store::transaction & tx,optional<int64_t> & action_id)59*6b3a42afSjmmv get_action(store::transaction& tx, optional< int64_t >& action_id)
60*6b3a42afSjmmv {
61*6b3a42afSjmmv try {
62*6b3a42afSjmmv if (action_id)
63*6b3a42afSjmmv return tx.get_action(action_id.get());
64*6b3a42afSjmmv else {
65*6b3a42afSjmmv const std::pair< int64_t, engine::action > latest_action =
66*6b3a42afSjmmv tx.get_latest_action();
67*6b3a42afSjmmv action_id = latest_action.first;
68*6b3a42afSjmmv return latest_action.second;
69*6b3a42afSjmmv }
70*6b3a42afSjmmv } catch (const store::error& e) {
71*6b3a42afSjmmv throw engine::error(e.what());
72*6b3a42afSjmmv }
73*6b3a42afSjmmv }
74*6b3a42afSjmmv
75*6b3a42afSjmmv
76*6b3a42afSjmmv } // anonymous namespace
77*6b3a42afSjmmv
78*6b3a42afSjmmv
79*6b3a42afSjmmv /// Pure abstract destructor.
~base_hooks(void)80*6b3a42afSjmmv scan_action::base_hooks::~base_hooks(void)
81*6b3a42afSjmmv {
82*6b3a42afSjmmv }
83*6b3a42afSjmmv
84*6b3a42afSjmmv
85*6b3a42afSjmmv /// Executes the operation.
86*6b3a42afSjmmv ///
87*6b3a42afSjmmv /// \param store_path The path to the database store.
88*6b3a42afSjmmv /// \param action_id The identifier of the action to scan; if none, scans the
89*6b3a42afSjmmv /// latest action in the store.
90*6b3a42afSjmmv /// \param hooks The hooks for this execution.
91*6b3a42afSjmmv ///
92*6b3a42afSjmmv /// \returns A structure with all results computed by this driver.
93*6b3a42afSjmmv scan_action::result
drive(const fs::path & store_path,optional<int64_t> action_id,base_hooks & hooks)94*6b3a42afSjmmv scan_action::drive(const fs::path& store_path,
95*6b3a42afSjmmv optional< int64_t > action_id,
96*6b3a42afSjmmv base_hooks& hooks)
97*6b3a42afSjmmv {
98*6b3a42afSjmmv store::backend db = store::backend::open_ro(store_path);
99*6b3a42afSjmmv store::transaction tx = db.start();
100*6b3a42afSjmmv
101*6b3a42afSjmmv const engine::action action = get_action(tx, action_id);
102*6b3a42afSjmmv hooks.got_action(action_id.get(), action);
103*6b3a42afSjmmv
104*6b3a42afSjmmv store::results_iterator iter = tx.get_action_results(action_id.get());
105*6b3a42afSjmmv while (iter) {
106*6b3a42afSjmmv hooks.got_result(iter);
107*6b3a42afSjmmv ++iter;
108*6b3a42afSjmmv }
109*6b3a42afSjmmv
110*6b3a42afSjmmv return result();
111*6b3a42afSjmmv }
112