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
|
// Copyright 2015 Google Inc. All rights reserved
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// +build ignore
#include "rule.h"
#include "log.h"
#include "parser.h"
#include "stringprintf.h"
#include "strutil.h"
#include "value.h"
namespace {
// Strip leading sequences of './' from file names, so that ./file
// and file are considered to be the same file.
// From http://www.gnu.org/software/make/manual/make.html#Features
StringPiece TrimLeadingCurdir(StringPiece s) {
if (s.substr(0, 2) != "./")
return s;
return s.substr(2);
}
static void ParseInputs(Rule* r, StringPiece s) {
bool is_order_only = false;
for (StringPiece input : WordScanner(s)) {
if (input == "|") {
is_order_only = true;
continue;
}
input = Intern(TrimLeadingCurdir(input));
if (is_order_only) {
r->order_only_inputs.push_back(input);
} else {
r->inputs.push_back(input);
}
}
}
bool IsPatternRule(StringPiece s) {
return s.find('%') != string::npos;
}
} // namespace
Rule::Rule()
: is_double_colon(false),
is_suffix_rule(false),
cmd_lineno(0) {
}
void ParseRule(Loc& loc, StringPiece line, char term,
Rule** out_rule, RuleVarAssignment* rule_var) {
size_t index = line.find(':');
if (index == string::npos) {
ERROR("%s:%d: *** missing separator.", LOCF(loc));
}
StringPiece first = line.substr(0, index);
vector<StringPiece> outputs;
for (StringPiece tok : WordScanner(first)) {
outputs.push_back(Intern(TrimLeadingCurdir(tok)));
}
CHECK(!outputs.empty());
const bool is_first_pattern = IsPatternRule(outputs[0]);
if (is_first_pattern) {
if (outputs.size() > 1) {
// TODO: Multiple output patterns are not supported yet.
ERROR("%s:%d: *** mixed implicit and normal rules: deprecated syntax",
LOCF(loc));
}
}
bool is_double_colon = false;
index++;
if (line.get(index) == ':') {
is_double_colon = true;
index++;
}
StringPiece rest = line.substr(index);
size_t term_index = rest.find_first_of("=;");
if ((term_index != string::npos && rest[term_index] == '=') ||
(term_index == string::npos && term == '=')) {
if (term_index == string::npos)
term_index = rest.size();
rule_var->outputs.swap(outputs);
ParseAssignStatement(rest, term_index,
&rule_var->lhs, &rule_var->rhs, &rule_var->op);
*out_rule = NULL;
return;
}
Rule* rule = new Rule();
*out_rule = rule;
rule->loc = loc;
rule->is_double_colon = is_double_colon;
if (is_first_pattern) {
rule->output_patterns.swap(outputs);
} else {
rule->outputs.swap(outputs);
}
if (term_index != string::npos && term != ';') {
CHECK(rest[term_index] == ';');
// TODO: Maybe better to avoid Intern here?
rule->cmds.push_back(
NewLiteral(Intern(TrimLeftSpace(rest.substr(term_index + 1)))));
rest = rest.substr(0, term_index);
}
index = rest.find(':');
if (index == string::npos) {
ParseInputs(rule, rest);
return;
}
if (is_first_pattern) {
ERROR("%s:%d: *** mixed implicit and normal rules: deprecated syntax",
LOCF(loc));
}
StringPiece second = rest.substr(0, index);
StringPiece third = rest.substr(index+1);
for (StringPiece tok : WordScanner(second)) {
rule->output_patterns.push_back(tok);
}
if (rule->output_patterns.empty()) {
ERROR("%s:%d: *** missing target pattern.", LOCF(loc));
}
if (rule->output_patterns.size() > 1) {
ERROR("%s:%d: *** multiple target patterns.", LOCF(loc));
}
if (!IsPatternRule(rule->output_patterns[0])) {
ERROR("%s:%d: *** target pattern contains no '%%'.", LOCF(loc));
}
ParseInputs(rule, third);
}
string Rule::DebugString() const {
vector<string> v;
v.push_back(StringPrintf("outputs=[%s]", JoinStrings(outputs, ",").c_str()));
v.push_back(StringPrintf("inputs=[%s]", JoinStrings(inputs, ",").c_str()));
if (!order_only_inputs.empty()) {
v.push_back(StringPrintf("order_only_inputs=[%s]",
JoinStrings(order_only_inputs, ",").c_str()));
}
if (is_double_colon)
v.push_back("is_double_colon");
if (is_suffix_rule)
v.push_back("is_suffix_rule");
if (!cmds.empty()) {
v.push_back(StringPrintf("cmds=[%s]", JoinValues(cmds, ",").c_str()));
}
return JoinStrings(v, " ");
}
|
