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
|
// file : build/algorithm.cxx -*- C++ -*-
// copyright : Copyright (c) 2014-2015 Code Synthesis Tools CC
// license : MIT; see accompanying LICENSE file
#include <build/algorithm>
#include <memory> // unique_ptr
#include <utility> // move
#include <cassert>
#include <iostream>
#include <build/path>
#include <build/scope>
#include <build/target>
#include <build/prerequisite>
#include <build/rule>
#include <build/diagnostics>
using namespace std;
namespace build
{
target*
search (prerequisite& p)
{
tracer tr ("search");
assert (p.target == nullptr);
//@@ TODO for now we just default to the directory scope.
//
path d;
if (p.directory.absolute ())
d = p.directory; // Already normalized.
else
{
d = p.scope.path () / p.directory;
d.normalize ();
}
//@@ TODO: would be nice to first check if this target is
// already in the set before allocating a new instance.
// Find or insert.
//
auto r (
targets.emplace (
unique_ptr<target> (p.type.factory (move (d), p.name, p.ext))));
target& t (**r.first);
trace (4, [&]{
tr << (r.second ? "new" : "existing") << " target " << t
<< " for prerequsite " << p;});
// Update extension if the existing target has it unspecified.
//
if (t.ext != p.ext)
{
trace (4, [&]{
tracer::record r (tr);
r << "assuming target " << t << " is the same as the one with ";
if (p.ext == nullptr)
r << "unspecified extension";
else if (p.ext->empty ())
r << "no extension";
else
r << "extension " << *p.ext;
});
if (p.ext != nullptr)
t.ext = p.ext;
}
return (p.target = &t);
}
bool
match (target& t)
{
assert (!t.recipe ());
for (auto tt (&t.type ());
tt != nullptr && !t.recipe ();
tt = tt->base)
{
auto i (rules.find (tt->id));
if (i == rules.end ()) // No rules registered for this target type.
continue;
const auto& rules (i->second); // Name map.
string hint; // @@ TODO
bool single;
auto rs (hint.empty ()
? make_pair (rules.begin (), rules.end ())
: rules.find (hint));
for (auto i (rs.first); i != rs.second;)
{
const string& n (i->first);
const rule& ru (i->second);
if (i++ == rs.first)
single = (i == rs.second);
recipe re;
string h (hint);
{
auto g (
make_exception_guard (
[] (target& t, const string& n)
{
cerr << "info: while matching rule " << n
<< " for target " << t << endl;
},
t, n));
// If the rule matches, then it updates the hint with the one we
// need to use when checking for ambiguity.
//
re = ru.match (t, single, h);
}
if (re)
{
t.recipe (re);
// If the returned hint is more "general" than what we had,
// then narrow it back down.
//
if (h < hint)
h = hint;
// Do the ambiguity test unless it is an unambiguous match (the
// hint is the rule's full name).
//
if (h == n)
break;
auto rs1 (h == hint
? make_pair (i, rs.second) // Continue iterating.
: rules.find (h));
bool ambig (false);
// See if any other rules match.
//
for (auto i (rs1.first); i != rs1.second; ++i)
{
const string& n1 (i->first);
const rule& ru1 (i->second);
string h1 (h);
{
auto g (
make_exception_guard (
[] (target& t, const string& n1)
{
cerr << "info: while matching rule " << n1
<< " for target " << t << endl;
},
t, n1));
re = ru1.match (t, false, h1);
}
if (re)
{
// A subsequent rule cannot return a more specific hint.
// Remember, the hint returning mechanism is here to
// indicate that only a class of rules that perform a
// similar rule chaining transformation may apply (e.g.,
// cxx.gnu and cxx.clang).
//
assert (h1 <= h);
if (!ambig)
{
cerr << "error: multiple rules matching target " << t << endl;
cerr << "info: rule " << n << " matches" << endl;
ambig = true;
}
cerr << "info: rule " << n1 << " also matches" << endl;
}
}
if (ambig)
{
cerr << "info: use rule hint to disambiguate this match" << endl;
throw error ();
}
break;
}
}
}
return bool (t.recipe ());
}
}
|
