aboutsummaryrefslogtreecommitdiff
path: root/build/operation.cxx
blob: 6b3b08df6116d401898da641008bd80b52b05979 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
// file      : build/operation.cxx -*- C++ -*-
// copyright : Copyright (c) 2014-2015 Code Synthesis Ltd
// license   : MIT; see accompanying LICENSE file

#include <build/operation>

#include <ostream>
#include <cassert>
#include <functional> // reference_wrapper

#include <butl/utility> // reverse_iterate

#include <build/scope>
#include <build/target>
#include <build/file>
#include <build/algorithm>
#include <build/diagnostics>
#include <build/dump>

using namespace std;
using namespace butl;

namespace build
{
  // action
  //
  ostream&
  operator<< (ostream& os, action a)
  {
    uint16_t
      m (a.meta_operation ()),
      i (a.operation ()),
      o (a.outer_operation ());

    os << '(' << m << ',';

    if (o != 0)
      os << o << '(';

    os << i;

    if (o != 0)
      os << ')';

    os << ')';

    return os;
  }

  // perform
  //
  void
  load (const path& bf,
        scope& root,
        const dir_path& out_base,
        const dir_path& src_base,
        const location&)
  {
    // Load project's root[-pre].build.
    //
    load_root_pre (root);

    // Create the base scope. Note that its existence doesn't
    // mean it was already processed as a base scope; it can
    // be the same as root.
    //
    scope& base (scopes[out_base]);

    base.assign ("out_base") = out_base;
    auto v (base.assign ("src_base") = src_base);
    base.src_path_ = &v.as<const dir_path&> ();

    // Load the buildfile unless it has already been loaded.
    //
    source_once (bf, root, base, root);
  }

  void
  search (scope&,
          const target_key& tk,
          const location& l,
          action_targets& ts)
  {
    tracer trace ("search");

    auto i (targets.find (tk, trace));
    if (i == targets.end ())
      fail (l) << "unknown target " << tk;

    ts.push_back (i->get ());
  }

  void
  match (action a, action_targets& ts)
  {
    tracer trace ("match");

    if (verb >= 5)
      dump (a);

    for (void* vt: ts)
    {
      target& t (*static_cast<target*> (vt));
      level4 ([&]{trace << "matching " << t;});
      match (a, t);
    }

    if (verb >= 5)
      dump (a);
  }

  void
  execute (action a, const action_targets& ts)
  {
    tracer trace ("execute");

    // Build collecting postponed targets (to be re-examined later).
    //
    vector<reference_wrapper<target>> psp;

    // Execute targets in reverse if the execution mode is 'last'.
    //
    auto body (
      [a, &psp, &trace] (void* v)
      {
        target& t (*static_cast<target*> (v));

        level4 ([&]{trace << diag_doing (a, t);});

        switch (execute (a, t))
        {
        case target_state::postponed:
          {
            info << diag_doing (a, t) << " is postponed";
            psp.push_back (t);
            break;
          }
        case target_state::unchanged:
          {
            info << diag_already_done (a, t);
            break;
          }
        case target_state::changed:
          break;
        case target_state::failed:
          //@@ This could probably happen in a parallel build.
        default:
          assert (false);
        }
      });

    if (current_mode == execution_mode::first)
      for (void* v: ts) body (v);
    else
      for (void* v: reverse_iterate (ts)) body (v);

    // Re-examine postponed targets. Note that we will do it in the
    // order added, so no need to check the execution mode.
    //
    for (target& t: psp)
    {
      if (t.state () == target_state::postponed)
        execute_direct (a, t); // Try again, now ignoring the execution mode.

      switch (t.state ())
      {
      case target_state::postponed:
        {
          info << "unable to " << diag_do (a, t) << " at this time";
          break;
        }
      case target_state::unchanged:
        {
          info << diag_already_done (a, t);
          break;
        }
      case target_state::unknown: // Assume something was done to it.
      case target_state::changed:
        break;
      case target_state::failed:
        //@@ This could probably happen in a parallel build.
      default:
        assert (false);
      }
    }
  }

  meta_operation_info perform {
    "perform",
    "",
    "",
    "",
    nullptr, // meta-operation pre
    nullptr, // operation pre
    &load,
    &search,
    &match,
    &execute,
    nullptr, // operation post
    nullptr  // meta-operation post
  };

  // operations
  //
  operation_info default_ {
    "<default>",
    "",
    "",
    "",
    execution_mode::first,
    nullptr,
    nullptr
  };

  operation_info update {
    "update",
    "update",
    "updating",
    "up to date",
    execution_mode::first,
    nullptr,
    nullptr
  };

  operation_info clean {
    "clean",
    "clean",
    "cleaning",
    "clean",
    execution_mode::last,
    nullptr,
    nullptr
  };
}