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
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
|
// file : libbuild2/utility.ixx -*- C++ -*-
// license : MIT; see accompanying LICENSE file
#include <cstring> // strlen() strchr()
namespace build2
{
inline bool
run_wait (const cstrings& args, process& pr, const location& loc)
{
return run_wait (args.data (), pr, loc);
}
// Note: currently this function is also used in run() implementations.
//
LIBBUILD2_SYMEXPORT bool
run_finish_impl (const char* const*,
process&,
bool fail,
const string&,
const location& = location ());
LIBBUILD2_SYMEXPORT bool
run_finish_impl (diag_buffer&,
const char* const*,
process&,
bool fail,
uint16_t,
const location&);
inline void
run_finish (const char* const* args,
process& pr,
const string& l,
const location& loc)
{
run_finish_impl (args, pr, true /* fail */, l, loc);
}
inline void
run_finish (const cstrings& args, process& pr, const location& loc)
{
run_finish (args.data (), pr, string (), loc);
}
inline bool
run_finish_code (const char* const* args,
process& pr,
const string& l,
const location& loc)
{
return run_finish_impl (args, pr, false /* fail */, l, loc);
}
inline bool
run_finish_code (const cstrings& args, process& pr, const location& loc)
{
return run_finish_code (args.data (), pr, string (), loc);
}
inline void
run_finish (diag_buffer& dbuf,
const char* const* args,
process& pr,
uint16_t v,
const location& loc)
{
run_finish_impl (dbuf, args, pr, true /* fail */, v, loc);
}
inline void
run_finish (diag_buffer& dbuf,
const cstrings& args,
process& pr,
uint16_t v,
const location& loc)
{
run_finish_impl (dbuf, args.data (), pr, true /* fail */, v, loc);
}
inline bool
run_finish_code (diag_buffer& dbuf,
const char* const* args,
process& pr,
uint16_t v,
const location& loc)
{
return run_finish_impl (dbuf, args, pr, false /* fail */, v, loc);
}
inline bool
run_finish_code (diag_buffer& dbuf,
const cstrings& args,
process& pr,
uint16_t v,
const location& loc)
{
return run_finish_impl (dbuf, args.data (), pr, false /* fail */, v, loc);
}
template <typename T, typename F>
inline T
run (context& ctx,
uint16_t verbosity,
const process_env& pe,
const char* args[],
F&& f,
bool err,
bool ignore_exit,
sha256* checksum)
{
T r;
if (!run (ctx,
verbosity,
pe, args,
[&r, &f] (string& l, bool last) // Small function optimmization.
{
r = f (l, last);
return r.empty ();
},
true /* trim */,
err,
ignore_exit,
checksum))
r = T ();
return r;
}
template <typename T, typename F>
inline T
run (diag_buffer& dbuf,
uint16_t verbosity,
const process_env& pe,
const char* args[],
F&& f,
bool ignore_exit,
sha256* checksum)
{
T r;
if (!run (dbuf,
verbosity,
pe, args,
[&r, &f] (string& l, bool last) // Small function optimmization.
{
r = f (l, last);
return r.empty ();
},
true /* trim */,
ignore_exit,
checksum))
r = T ();
return r;
}
inline void
hash_path (sha256& cs, const path& p, const dir_path& prefix)
{
// Note: for efficiency we don't use path::leaf() and "skip" the prefix
// without copying.
//
const char* s (p.string ().c_str ());
if (!prefix.empty () && p.sub (prefix))
{
s += prefix.size (); // Does not include trailing slash except for root.
if (path::traits_type::is_separator (*s))
++s;
}
cs.append (s);
}
template <typename T>
inline void
append_options (cstrings& args, T& s, const variable& var, const char* e)
{
append_options (args, s[var], e);
}
template <typename T>
inline void
append_options (strings& args, T& s, const variable& var, const char* e)
{
append_options (args, s[var], e);
}
template <typename T>
inline void
append_options (sha256& csum, T& s, const variable& var)
{
append_options (csum, s[var]);
}
template <typename T>
inline void
append_options (cstrings& args, T& s, const char* var, const char* e)
{
append_options (args, s[var], e);
}
template <typename T>
inline void
append_options (strings& args, T& s, const char* var, const char* e)
{
append_options (args, s[var], e);
}
template <typename T>
inline void
append_options (sha256& csum, T& s, const char* var)
{
append_options (csum, s[var]);
}
inline void
append_options (cstrings& args, const strings& sv, const char* e)
{
if (size_t n = sv.size ())
append_options (args, sv, n, e);
}
inline void
append_options (strings& args, const strings& sv, const char* e)
{
if (size_t n = sv.size ())
append_options (args, sv, n, e);
}
inline void
append_options (sha256& csum, const strings& sv)
{
if (size_t n = sv.size ())
append_options (csum, sv, n);
}
template <typename T>
inline bool
find_option (const char* o, T& s, const variable& var, bool ic)
{
return find_option (o, s[var], ic);
}
template <typename T>
inline bool
find_option (const char* o, T& s, const char* var, bool ic)
{
return find_option (o, s[var], ic);
}
inline bool
compare_option (const char* o, const char* s, bool ic)
{
return s != nullptr && (ic ? icasecmp (s, o) : strcmp (s, o)) == 0;
}
inline bool
compare_option (const char* o, const string& s, bool ic)
{
return ic ? icasecmp (s, o) == 0 : s == o;
}
template <typename I>
inline I
find_option (const char* o, I b, I e, bool ic)
{
for (; b != e; ++b)
if (compare_option (o, *b, ic))
return b;
return e;
}
template <typename T>
inline bool
find_options (const initializer_list<const char*>& os,
T& s,
const variable& var,
bool ic)
{
return find_options (os, s[var], ic);
}
template <typename T>
inline bool
find_options (const initializer_list<const char*>& os,
T& s,
const char* var,
bool ic)
{
return find_options (os, s[var], ic);
}
template <typename T>
inline const string*
find_option_prefix (const char* p, T& s, const variable& var, bool ic)
{
return find_option_prefix (p, s[var], ic);
}
template <typename T>
inline const string*
find_option_prefix (const char* p, T& s, const char* var, bool ic)
{
return find_option_prefix (p, s[var], ic);
}
inline bool
compare_option_prefix (const char* p, size_t n, const char* s, bool ic)
{
return s != nullptr && (ic ? icasecmp (s, p, n) : strncmp (s, p, n)) == 0;
}
inline bool
compare_option_prefix (const char* p, size_t n, const string& s, bool ic)
{
return (ic ? icasecmp (s, p, n) : s.compare (0, n, p)) == 0;
}
template <typename I>
inline I
find_option_prefix (const char* p, I b, I e, bool ic)
{
size_t n (strlen (p));
for (; b != e; ++b)
if (compare_option_prefix (p, n, *b, ic))
return b;
return e;
}
template <typename T>
inline const string*
find_option_prefixes (const initializer_list<const char*>& ps,
T& s,
const variable& var,
bool ic)
{
return find_option_prefixes (ps, s[var], ic);
}
template <typename T>
inline const string*
find_option_prefixes (const initializer_list<const char*>& ps,
T& s,
const char* var,
bool ic)
{
return find_option_prefixes (ps, s[var], ic);
}
// hash_environment()
//
inline void
hash_environment (sha256& cs, const char* n)
{
cs.append (n);
if (optional<string> v = getenv (n))
cs.append (*v);
}
inline void
hash_environment (sha256& cs, const string& n)
{
hash_environment (cs, n.c_str ());
}
inline void
hash_environment (sha256& cs, initializer_list<const char*> ns)
{
for (const char* n: ns)
hash_environment (cs, n);
}
inline string
hash_environment (initializer_list<const char*> ns)
{
sha256 cs;
hash_environment (cs, ns);
return cs.string ();
}
inline void
hash_environment (sha256& cs, const cstrings& ns)
{
for (const char* n: ns)
hash_environment (cs, n);
}
inline string
hash_environment (const cstrings& ns)
{
sha256 cs;
hash_environment (cs, ns);
return cs.string ();
}
inline void
hash_environment (sha256& cs, const strings& ns)
{
for (const string& n: ns)
hash_environment (cs, n);
}
inline string
hash_environment (const strings& ns)
{
sha256 cs;
hash_environment (cs, ns);
return cs.string ();
}
inline void
hash_environment (sha256& cs, const char* const* ns)
{
if (ns != nullptr)
{
for (; *ns != nullptr; ++ns)
hash_environment (cs, *ns);
}
}
inline string
hash_environment (const char* const* ns)
{
sha256 cs;
hash_environment (cs, ns);
return cs.string ();
}
// find_stem()
//
inline size_t
find_stem (const string& s, size_t s_p, size_t s_n,
const char* stem, const char* seps)
{
auto sep = [seps] (char c) -> bool
{
return strchr (seps, c) != nullptr;
};
size_t m (strlen (stem));
size_t p (s.find (stem, s_p, m));
return (p != string::npos &&
( p == s_p || sep (s[p - 1])) && // Separated beginning.
((p + m) == s_n || sep (s[p + m]))) // Separated end.
? p
: string::npos;
}
}
|
