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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
|
// file : mod/target-build-config.cxx -*- C++ -*-
// license : MIT; see accompanying LICENSE file
#include <mod/build-target-config.hxx>
#include <libbutl/utility.hxx> // alpha(), etc.
#include <libbutl/path-pattern.hxx>
namespace brep
{
using namespace std;
using namespace butl;
using namespace bpkg;
// The default underlying class set expressions (see below).
//
static const build_class_expr default_ucs_expr (
{"default"}, '+', "Default.");
static const build_class_expr all_ucs_expr (
{"all"}, '+', "All.");
bool
exclude (const build_class_exprs& exprs,
const build_constraints& constrs,
const build_target_config& tc,
const map<string, string>& class_inheritance_map,
string* reason,
bool default_all_ucs)
{
// Save the first sentence of the reason, lower-case the first letter if
// the beginning looks like a word (all subsequent characters until a
// whitespace are lower-case letters).
//
auto sanitize = [] (const string& reason)
{
string r (reason.substr (0, reason.find ('.')));
char c (r[0]); // Can be '\0'.
if (alpha (c) && c == ucase (c))
{
bool word (true);
for (size_t i (1);
i != r.size () && (c = r[i]) != ' ' && c != '\t' && c != '\n';
++i)
{
// Is not a word if contains a non-letter or an upper-case letter.
//
if (!alpha (c) || c == ucase (c))
{
word = false;
break;
}
}
if (word)
r[0] = lcase (r[0]);
}
return r;
};
// First, match the configuration against the package underlying build
// class set and expressions.
//
bool m (false);
// Match the configuration against an expression, updating the match
// result.
//
// We will use a comment of the first encountered excluding expression
// (changing the result from true to false) or non-including one (leaving
// the false result) as an exclusion reason.
//
auto match = [&tc, &m, reason, &sanitize, &class_inheritance_map]
(const build_class_expr& e)
{
bool pm (m);
e.match (tc.classes, class_inheritance_map, m);
if (reason != nullptr)
{
// Reset the reason which, if saved, makes no sense anymore.
//
if (m)
{
reason->clear ();
}
else if (reason->empty () &&
//
// Exclusion.
//
(pm ||
//
// Non-inclusion. Make sure that the build class expression
// is empty or starts with an addition (+...).
//
e.expr.empty () ||
e.expr.front ().operation == '+'))
{
*reason = sanitize (e.comment);
}
}
};
// Determine the underlying class set. Note that in the future we can
// potentially extend the underlying set with special classes.
//
const build_class_expr* ucs (
!exprs.empty () && !exprs.front ().underlying_classes.empty ()
? &exprs.front ()
: nullptr);
// Note that the combined package build configuration class expression can
// be represented as the underlying class set used as a starting set for
// the original expressions and a restricting set, simultaneously. For
// example, for the expression:
//
// default legacy : -msvc
//
// the resulting expression will be:
//
// +( +default +legacy ) -msvc &( +default +legacy )
//
// Let's, however, optimize it a bit based on the following facts:
//
// - If the underlying class set expression (+default +legacy in the above
// example) evaluates to false, then the resulting expression also
// evaluates to false due to the trailing '&' operation. Thus, we don't
// need to evaluate further if that's the case.
//
// - On the other hand, if the underlying class set expression evaluates
// to true, then we don't need to apply the trailing '&' operation as it
// cannot affect the result.
//
const build_class_expr& ucs_expr (
ucs != nullptr ? build_class_expr (ucs->underlying_classes,
'+',
ucs->comment) :
default_all_ucs ? all_ucs_expr :
default_ucs_expr);
match (ucs_expr);
if (m)
{
for (const build_class_expr& e: exprs)
match (e);
}
// Exclude the configuration if it doesn't match the compound expression.
//
if (!m)
return true;
// Now check if the configuration is excluded/included via the patterns.
//
// To implement matching of absent name components with wildcard-only
// pattern components we are going to convert names to paths (see
// dash_components_to_path() for details).
//
// And if any of the build-{include,exclude} values (which is legal) or
// the build configuration name/target (illegal) are invalid paths, then
// we assume no match.
//
if (!constrs.empty ())
try
{
path cn (dash_components_to_path (tc.name));
path tg (dash_components_to_path (tc.target.string ()));
for (const build_constraint& c: constrs)
{
if (path_match (cn,
dash_components_to_path (c.config),
dir_path () /* start */,
path_match_flags::match_absent) &&
(!c.target ||
path_match (tg,
dash_components_to_path (*c.target),
dir_path () /* start */,
path_match_flags::match_absent)))
{
if (!c.exclusion)
return false;
if (reason != nullptr)
*reason = sanitize (c.comment);
return true;
}
}
}
catch (const invalid_path&) {}
return false;
}
path
dash_components_to_path (const string& pattern)
{
string r;
size_t nstar (0);
for (const path_pattern_term& pt: path_pattern_iterator (pattern))
{
switch (pt.type)
{
case path_pattern_term_type::star:
{
// Replace ** with */**/* and skip all the remaining stars that may
// follow in this sequence.
//
if (nstar == 0)
r += "*";
else if (nstar == 1)
r += "/**/*"; // The first star is already copied.
break;
}
case path_pattern_term_type::literal:
{
// Replace '-' with '/' and fall through otherwise.
//
if (get_literal (pt) == '-')
{
r += '/';
break;
}
}
// Fall through.
default:
{
r.append (pt.begin, pt.end); // Copy the pattern term as is.
}
}
nstar = pt.star () ? nstar + 1 : 0;
}
// Append the trailing slash to match the resulting paths as directories.
// This is required for the trailing /* we could append to match absent
// directory path components (see path_match_flags::match_absent for
// details).
//
// Note that valid dash components may not contain a trailing dash.
// Anyway, any extra trailing slashes will be ignored by the path
// constructor.
//
r += '/';
return path (move (r));
}
}
|