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
|
// 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 <build/path>
#include <build/scope>
#include <build/target>
#include <build/prerequisite>
#include <build/rule>
#include <build/utility>
#include <build/diagnostics>
using namespace std;
namespace build
{
target&
search (prerequisite& p)
{
tracer trace ("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 ();
}
// Find or insert.
//
auto r (targets.insert (p.type, move (d), p.name, p.ext, trace));
level4 ([&]{trace << (r.second ? "new" : "existing") << " target "
<< r.first << " for prerequsite " << p;});
p.target = &r.first;
return r.first;
}
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
auto rs (hint.empty ()
? make_pair (rules.begin (), rules.end ())
: rules.find (hint));
for (auto i (rs.first); i != rs.second; ++i)
{
const string& n (i->first);
const rule& ru (i->second);
void* m;
{
auto g (
make_exception_guard (
[](target& t, const string& n)
{
info << "while matching rule " << n << " for target " << t;
},
t, n));
m = ru.match (t, hint);
}
if (m != nullptr)
{
// Do the ambiguity test.
//
bool ambig (false);
diag_record dr;
for (++i; i != rs.second; ++i)
{
const string& n1 (i->first);
const rule& ru1 (i->second);
void* m1;
{
auto g (
make_exception_guard (
[](target& t, const string& n1)
{
info << "while matching rule " << n1 << " for target "
<< t;
},
t, n1));
m1 = ru1.match (t, hint);
}
if (m1 != nullptr)
{
if (!ambig)
{
dr << fail << "multiple rules matching target " << t
<< info << "rule " << n << " matches";
ambig = true;
}
dr << info << "rule " << n1 << " also matches";
}
}
if (!ambig)
{
t.recipe (ru.select (t, m));
break;
}
else
dr << info << "use rule hint to disambiguate this match";
}
}
}
return bool (t.recipe ());
}
}
|
