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
|
// file : build/rule.cxx -*- C++ -*-
// copyright : Copyright (c) 2014-2015 Code Synthesis Tools CC
// license : MIT; see accompanying LICENSE file
#include <build/rule>
#include <utility> // move()
#include <system_error>
#include <build/algorithm>
#include <build/diagnostics>
#include <build/timestamp>
#include <build/mkdir>
using namespace std;
namespace build
{
operation_rule_map rules;
const target_rule_map* current_rules;
// path_rule
//
void* path_rule::
match (action a, target& t, const string&) const
{
// @@ TODO:
//
// - need to try all the target-type-specific extensions, just
// like search_existing_file().
//
path_target& pt (dynamic_cast<path_target&> (t));
if (pt.path ().empty ())
{
path p (t.dir / path (pt.name));
// @@ TMP: target name as an extension.
//
const string& e (pt.ext != nullptr ? *pt.ext : pt.type ().name);
if (!e.empty ())
{
p += '.';
p += e;
}
// While strictly speaking we shouldn't do this in match(),
// no other rule should ever be ambiguous with this fallback
// one.
//
pt.path (move (p));
}
return pt.mtime () != timestamp_nonexistent ? &t : nullptr;
}
recipe path_rule::
apply (action a, target& t, void*) const
{
// Search and match all the prerequisites.
//
search_and_match (a, t);
return &update;
}
target_state path_rule::
update (action a, target& t)
{
// Make sure the target is not older than any of its prerequisites.
//
timestamp mt (dynamic_cast<path_target&> (t).mtime ());
for (const prerequisite& p: t.prerequisites)
{
target& pt (*p.target);
target_state ts (update (a, pt));
// If this is an mtime-based target, then compare timestamps.
//
if (auto mpt = dynamic_cast<const mtime_target*> (&pt))
{
timestamp mp (mpt->mtime ());
if (mt < mp)
fail << "no recipe to update target " << t <<
info << "prerequisite " << pt << " is ahead of " << t
<< " by " << (mp - mt);
}
else
{
// Otherwise we assume the prerequisite is newer if it was changed.
//
if (ts == target_state::changed)
fail << "no recipe to update target " << t <<
info << "prerequisite " << pt << " is ahead of " << t
<< " because it was updated";
}
}
return target_state::unchanged;
}
// dir_rule
//
void* dir_rule::
match (action a, target& t, const string&) const
{
return &t;
}
recipe dir_rule::
apply (action a, target& t, void*) const
{
search_and_match (a, t);
return &update;
}
target_state dir_rule::
update (action a, target& t)
{
// Return changed if any of our prerequsites were updated and
// unchanged otherwise.
//
return execute_prerequisites (a, t);
}
// fsdir_rule
//
void* fsdir_rule::
match (action a, target& t, const string&) const
{
return &t;
}
recipe fsdir_rule::
apply (action a, target& t, void*) const
{
// Let's not allow any prerequisites for this target since it
// doesn't make much sense. The sole purpose of this target type
// is to create a directory.
//
if (!t.prerequisites.empty ())
fail << "no prerequisites allowed for target " << t;
return &update;
}
target_state fsdir_rule::
update (action a, target& t)
{
path d (t.dir / path (t.name));
// Add the extension back if it was specified.
//
if (t.ext != nullptr)
{
d += '.';
d += *t.ext;
}
if (path_mtime (d) != timestamp_nonexistent)
return target_state::unchanged;
if (verb >= 1)
text << "mkdir " << d.string ();
else
text << "mkdir " << t; //@@ Probably only show if [show]?
try
{
mkdir (d);
}
catch (const system_error& e)
{
fail << "unable to create directory " << d.string () << ": "
<< e.what ();
}
return target_state::changed;
}
}
|
