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
|
// file : build/algorithm.ixx -*- C++ -*-
// copyright : Copyright (c) 2014-2015 Code Synthesis Tools CC
// license : MIT; see accompanying LICENSE file
#include <build/prerequisite>
#include <build/context>
namespace build
{
inline target&
search (prerequisite& p)
{
if (p.target == nullptr)
p.target = &search (
prerequisite_key {&p.type, &p.dir, &p.name, &p.ext, &p.scope});
return *p.target;
}
void
match_impl (action, target&);
inline void
match (action a, target& t)
{
if (!t.recipe (a))
match_impl (a, t);
t.dependents++;
}
target_state
execute_impl (action, target&);
inline target_state
execute (action a, target& t)
{
t.dependents--;
switch (t.state)
{
case target_state::unchanged:
case target_state::changed: return t.state;
default:
{
// Handle the "last" execution mode.
//
if (current_mode == execution_mode::last && t.dependents != 0)
return (t.state = target_state::postponed);
return execute_impl (a, t);
}
}
}
template <typename T, executor_function* E>
T*
execute_find_prerequisites (action, target&, const timestamp&, bool&);
template <typename T, executor_function* E>
inline T*
execute_find_prerequisites (action a, target& t, const timestamp& mt)
{
bool e (mt == timestamp_nonexistent);
T* r (execute_find_prerequisites<T, E> (a, t, mt, e));
assert (r != nullptr);
return e ? r : nullptr;
}
}
|
