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
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
|
// file : libbuild2/utility.cxx -*- C++ -*-
// copyright : Copyright (c) 2014-2019 Code Synthesis Ltd
// license : MIT; see accompanying LICENSE file
#include <libbuild2/utility.hxx>
#include <time.h> // tzset() (POSIX), _tzset() (Windows)
#include <cstring> // strlen(), str[n]cmp()
#include <iostream> // cerr
#include <libbuild2/target.hxx>
#include <libbuild2/context.hxx>
#include <libbuild2/variable.hxx>
#include <libbuild2/diagnostics.hxx>
using namespace std;
using namespace butl;
//
// <libbuild2/types.hxx>
//
namespace build2
{
static const char* const run_phase_[] = {"load", "match", "execute"};
ostream&
operator<< (ostream& os, run_phase p)
{
return os << run_phase_[static_cast<uint8_t> (p)];
}
}
namespace std
{
ostream&
operator<< (ostream& os, const ::butl::path& p)
{
using namespace build2;
return os << (stream_verb (os).path < 1
? diag_relative (p)
: p.representation ());
}
ostream&
operator<< (ostream& os, const ::butl::process_path& p)
{
using namespace build2;
if (p.empty ())
os << "<empty>";
else
{
// @@ Is there a reason not to print as a relative path as it is done
// for path (see above)?
//
os << p.recall_string ();
if (!p.effect.empty ())
os << '@' << p.effect.string (); // Suppress relative().
}
return os;
}
}
namespace build2
{
//
// <libbuild2/utility.hxx>
//
void (*terminate) (bool);
process_path argv0;
const standard_version build_version (LIBBUILD2_VERSION_STR);
const string build_version_interface (
build_version.pre_release ()
? build_version.string_project_id ()
: (to_string (build_version.major ()) + '.' +
to_string (build_version.minor ())));
bool build_installed;
optional<bool> mtime_check_option;
optional<path> config_sub;
optional<path> config_guess;
void
check_build_version (const standard_version_constraint& c, const location& l)
{
if (!c.satisfies (build_version))
fail (l) << "incompatible build2 version" <<
info << "running " << build_version.string () <<
info << "required " << c.string ();
}
dir_path work;
dir_path home;
const dir_path* relative_base = &work;
path
relative (const path_target& t)
{
const path& p (t.path ());
assert (!p.empty ());
return relative (p);
}
string
diag_relative (const path& p, bool cur)
{
if (p.string () == "-")
return "<stdin>";
const path& b (*relative_base);
if (p.absolute ())
{
if (p == b)
return cur ? "." + p.separator_string () : string ();
#ifndef _WIN32
if (!home.empty ())
{
if (p == home)
return "~" + p.separator_string ();
}
#endif
path rb (relative (p));
#ifndef _WIN32
if (!home.empty ())
{
if (rb.relative ())
{
// See if the original path with the ~/ shortcut is better that the
// relative to base.
//
if (p.sub (home))
{
path rh (p.leaf (home));
if (rb.size () > rh.size () + 2) // 2 for '~/'
return "~/" + move (rh).representation ();
}
}
else if (rb.sub (home))
return "~/" + rb.leaf (home).representation ();
}
#endif
return move (rb).representation ();
}
return p.representation ();
}
process_path
run_search (const char*& args0, bool path_only, const location& l)
try
{
return process::path_search (args0, dir_path () /* fallback */, path_only);
}
catch (const process_error& e)
{
fail (l) << "unable to execute " << args0 << ": " << e << endf;
}
process_path
run_search (const path& f,
bool init,
const dir_path& fallback,
bool path_only,
const location& l)
try
{
return process::path_search (f, init, fallback, path_only);
}
catch (const process_error& e)
{
fail (l) << "unable to execute " << f << ": " << e << endf;
}
process_path
try_run_search (const path& f,
bool init,
const dir_path& fallback,
bool path_only)
{
return process::try_path_search (f, init, fallback, path_only);
}
process
run_start (uint16_t verbosity,
const process_env& pe,
const char* args[],
int in,
int out,
bool err,
const dir_path& cwd,
const location& l)
try
{
assert (args[0] == pe.path->recall_string ());
if (verb >= verbosity)
print_process (args, 0);
return process (
*pe.path,
args,
in,
out,
(err ? 2 : 1),
(!cwd.empty ()
? cwd.string ().c_str ()
: pe.cwd != nullptr ? pe.cwd->string ().c_str () : nullptr),
pe.vars);
}
catch (const process_error& e)
{
if (e.child)
{
// Note: run_finish() expects this exact message.
//
cerr << "unable to execute " << args[0] << ": " << e << endl;
// In a multi-threaded program that fork()'ed but did not exec(), it is
// unwise to try to do any kind of cleanup (like unwinding the stack and
// running destructors).
//
exit (1);
}
else
fail (l) << "unable to execute " << args[0] << ": " << e << endf;
}
bool
run_finish (const char* args[],
process& pr,
bool err,
const string& l,
const location& loc)
try
{
tracer trace ("run_finish");
if (pr.wait ())
return true;
const process_exit& e (*pr.exit);
if (!e.normal ())
fail (loc) << "process " << args[0] << " " << e;
// Normall but non-zero exit status.
//
if (err)
{
// While we assuming diagnostics has already been issued (to STDERR), if
// that's not the case, it's a real pain to debug. So trace it.
//
l4 ([&]{trace << "process " << args[0] << " " << e;});
throw failed ();
}
// Even if the user asked to suppress diagnostiscs, one error that we
// want to let through is the inability to execute the program itself.
// We cannot reserve a special exit status to signal this so we will
// just have to compare the output. This particular situation will
// result in a single error line printed by run_start() above.
//
if (l.compare (0, 18, "unable to execute ") == 0)
fail (loc) << l;
return false;
}
catch (const process_error& e)
{
fail (loc) << "unable to execute " << args[0] << ": " << e << endf;
}
const string empty_string;
const path empty_path;
const dir_path empty_dir_path;
const project_name empty_project_name;
const optional<string> nullopt_string;
const optional<path> nullopt_path;
const optional<dir_path> nullopt_dir_path;
const optional<project_name> nullopt_project_name;
void
append_options (cstrings& args, const lookup& l, const char* e)
{
if (l)
append_options (args, cast<strings> (l), e);
}
void
append_options (strings& args, const lookup& l, const char* e)
{
if (l)
append_options (args, cast<strings> (l), e);
}
void
hash_options (sha256& csum, const lookup& l)
{
if (l)
hash_options (csum, cast<strings> (l));
}
void
append_options (cstrings& args, const strings& sv, size_t n, const char* e)
{
if (n != 0)
{
args.reserve (args.size () + n);
for (size_t i (0); i != n; ++i)
{
if (e == nullptr || e != sv[i])
args.push_back (sv[i].c_str ());
}
}
}
void
append_options (strings& args, const strings& sv, size_t n, const char* e)
{
if (n != 0)
{
args.reserve (args.size () + n);
for (size_t i (0); i != n; ++i)
{
if (e == nullptr || e != sv[i])
args.push_back (sv[i]);
}
}
}
void
hash_options (sha256& csum, const strings& sv, size_t n)
{
for (size_t i (0); i != n; ++i)
csum.append (sv[i]);
}
bool
find_option (const char* o, const lookup& l, bool ic)
{
return l && find_option (o, cast<strings> (l), ic);
}
bool
find_option (const char* o, const strings& strs, bool ic)
{
for (const string& s: strs)
if (ic ? casecmp (s, o) == 0 : s == o)
return true;
return false;
}
bool
find_option (const char* o, const cstrings& cstrs, bool ic)
{
for (const char* s: cstrs)
if (s != nullptr && (ic ? casecmp (s, o) : strcmp (s, o)) == 0)
return true;
return false;
}
bool
find_options (initializer_list<const char*> os, const lookup& l, bool ic)
{
return l && find_options (os, cast<strings> (l), ic);
}
bool
find_options (initializer_list<const char*> os, const strings& strs, bool ic)
{
for (const string& s: strs)
for (const char* o: os)
if (ic ? casecmp (s, o) == 0 : s == o)
return true;
return false;
}
bool
find_options (initializer_list<const char*> os,
const cstrings& cstrs,
bool ic)
{
for (const char* s: cstrs)
if (s != nullptr)
for (const char* o: os)
if ((ic ? casecmp (s, o) : strcmp (s, o)) == 0)
return true;
return false;
}
const string*
find_option_prefix (const char* p, const lookup& l, bool ic)
{
return l ? find_option_prefix (p, cast<strings> (l), ic) : nullptr;
}
const string*
find_option_prefix (const char* p, const strings& strs, bool ic)
{
size_t n (strlen (p));
for (const string& s: reverse_iterate (strs))
if ((ic ? casecmp (s, p, n) : s.compare (0, n, p)) == 0)
return &s;
return nullptr;
}
const char*
find_option_prefix (const char* p, const cstrings& cstrs, bool ic)
{
size_t n (strlen (p));
for (const char* s: reverse_iterate (cstrs))
if (s != nullptr && (ic ? casecmp (s, p, n) : strncmp (s, p, n)) == 0)
return s;
return nullptr;
}
const string*
find_option_prefixes (initializer_list<const char*> ps,
const lookup& l,
bool ic)
{
return l ? find_option_prefixes (ps, cast<strings> (l), ic) : nullptr;
}
const string*
find_option_prefixes (initializer_list<const char*> ps,
const strings& strs,
bool ic)
{
for (const string& s: reverse_iterate (strs))
for (const char* p: ps)
if ((ic
? casecmp (s, p, strlen (p))
: s.compare (0, strlen (p), p)) == 0)
return &s;
return nullptr;
}
const char*
find_option_prefixes (initializer_list<const char*> ps,
const cstrings& cstrs,
bool ic)
{
for (const char* s: reverse_iterate (cstrs))
if (s != nullptr)
for (const char* p: ps)
if ((ic
? casecmp (s, p, strlen (p))
: strncmp (s, p, strlen (p))) == 0)
return s;
return nullptr;
}
string
apply_pattern (const char* s, const string* p)
{
if (p == nullptr || p->empty ())
return s;
size_t i (p->find ('*'));
assert (i != string::npos);
string r (*p, 0, i++);
r.append (s);
r.append (*p, i, p->size () - i);
return r;
}
void
init (void (*t) (bool),
const char* a0,
optional<bool> mc,
optional<path> cs,
optional<path> cg)
{
terminate = t;
argv0 = process::path_search (a0, true);
mtime_check_option = mc;
config_sub = move (cs);
config_guess = move (cg);
// Figure out work and home directories.
//
try
{
work = dir_path::current_directory ();
}
catch (const system_error& e)
{
fail << "invalid current working directory: " << e;
}
try
{
home = dir_path::home_directory ();
}
catch (const system_error& e)
{
fail << "unable to obtain home directory: " << e;
}
}
}
|