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
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
|
// file : build/parser.cxx -*- C++ -*-
// copyright : Copyright (c) 2014-2015 Code Synthesis Tools CC
// license : MIT; see accompanying LICENSE file
#include <build/parser>
#include <cctype> // is{alpha alnum}()
#include <memory> // unique_ptr
#include <fstream>
#include <utility> // move()
#include <iterator> // make_move_iterator()
#include <iostream>
#include <build/token>
#include <build/lexer>
#include <build/scope>
#include <build/target>
#include <build/prerequisite>
#include <build/variable>
#include <build/module>
#include <build/diagnostics>
#include <build/context>
using namespace std;
namespace build
{
// Output the token type and value in a format suitable for diagnostics.
//
ostream&
operator<< (ostream&, const token&);
static location
get_location (const token&, const void*);
typedef token_type type;
void parser::
parse_buildfile (istream& is, const path& p, scope& root, scope& base)
{
string rw (diag_relative_work (p));
path_ = &rw;
lexer l (is, rw);
lexer_ = &l;
scope_ = &base;
root_ = &root;
default_target_ = nullptr;
out_root_ = &root["out_root"].as<const path&> ();
// During bootstrap we may not know src_root yet.
//
{
auto v (root["src_root"]);
src_root_ = v ? &v.as<const path&> () : nullptr;
}
token t (type::eos, false, 0, 0);
type tt;
next (t, tt);
clause (t, tt);
if (tt != type::eos)
fail (t) << "unexpected " << t;
process_default_target (t);
}
void parser::
clause (token& t, token_type& tt)
{
tracer trace ("parser::clause", &path_);
while (tt != type::eos)
{
// We always start with one or more names.
//
if (tt != type::name &&
tt != type::lcbrace && // Untyped name group: '{foo ...'
tt != type::dollar && // Variable expansion: '$foo ...'
tt != type::colon) // Empty name: ': ...'
break; // Something else. Let our caller handle that.
// See if this is one of the keywords.
//
if (tt == type::name)
{
const string& n (t.name ());
if (n == "print")
{
// @@ Is this the only place where it is valid? Probably also
// in var namespace.
//
next (t, tt);
print (t, tt);
continue;
}
else if (n == "source")
{
next (t, tt);
source (t, tt);
continue;
}
else if (n == "include")
{
next (t, tt);
include (t, tt);
continue;
}
else if (n == "using")
{
next (t, tt);
using_ (t, tt);
continue;
}
}
// ': foo' is equvalent to '{}: foo' and to 'dir{}: foo'.
//
location nloc (get_location (t, &path_));
names_type ns (tt != type::colon
? names (t, tt)
: names_type ({name ("dir", path (), string ())}));
if (tt == type::colon)
{
// While '{}:' means empty name, '{$x}:' where x is empty list
// means empty list.
//
if (ns.empty ())
fail (t) << "target expected before :";
next (t, tt);
if (tt == type::newline)
{
// See if this is a directory/target scope.
//
if (peek () == type::lcbrace)
{
next (t, tt);
// Should be on its own line.
//
if (next (t, tt) != type::newline)
fail (t) << "expected newline after {";
// See if this is a directory or target scope. Different
// things can appear inside depending on which one it is.
//
bool dir (false);
for (const auto& n: ns)
{
// A name represents directory as an empty value.
//
if (n.type.empty () && n.value.empty ())
{
if (ns.size () != 1)
{
// @@ TODO: point to name.
//
fail (t) << "multiple names in directory scope";
}
dir = true;
}
}
next (t, tt);
if (dir)
{
scope& prev (*scope_);
path p (move (ns[0].dir)); // Steal.
if (p.relative ())
p = prev.path () / p;
p.normalize ();
scope_ = &scopes[p];
// A directory scope can contain anything that a top level can.
//
clause (t, tt);
scope_ = &prev;
}
else
{
// @@ TODO: target scope.
}
if (tt != type::rcbrace)
fail (t) << "expected } instead of " << t;
// Should be on its own line.
//
if (next (t, tt) == type::newline)
next (t, tt);
else if (tt != type::eos)
fail (t) << "expected newline after }";
continue;
}
// If this is not a scope, then it is a target without any
// prerequisites.
//
}
// Dependency declaration.
//
if (tt == type::name ||
tt == type::lcbrace ||
tt == type::dollar ||
tt == type::newline ||
tt == type::eos)
{
location ploc (get_location (t, &path_));
names_type pns (tt != type::newline && tt != type::eos
? names (t, tt)
: names_type ());
// Prepare the prerequisite list.
//
target::prerequisites_type ps;
ps.reserve (pns.size ());
for (auto& pn: pns)
{
const string* e;
const target_type* ti (target_types.find (pn, e));
if (ti == nullptr)
fail (ploc) << "unknown target type " << pn.type;
pn.dir.normalize ();
// Find or insert.
//
prerequisite& p (
scope_->prerequisites.insert (
*ti, move (pn.dir), move (pn.value), e, *scope_, trace).first);
ps.push_back (p);
}
for (auto& tn: ns)
{
const string* e;
const target_type* ti (target_types.find (tn, e));
if (ti == nullptr)
fail (nloc) << "unknown target type " << tn.type;
path& d (tn.dir);
if (d.empty ())
d = scope_->path (); // Already normalized.
else
{
if (d.relative ())
d = scope_->path () / d;
d.normalize ();
}
// Find or insert.
//
target& t (
targets.insert (
*ti, move (tn.dir), move (tn.value), e, trace).first);
//@@ OPT: move if last/single target (common cases).
//
t.prerequisites.insert (t.prerequisites.end (),
ps.begin (),
ps.end ());
if (default_target_ == nullptr)
default_target_ = &t;
}
if (tt == type::newline)
next (t, tt);
else if (tt != type::eos)
fail (t) << "expected newline instead of " << t;
continue;
}
if (tt == type::eos)
continue;
fail (t) << "expected newline instead of " << t;
}
// Variable assignment.
//
if (tt == type::equal || tt == type::plus_equal)
{
bool assign (tt == type::equal);
// LHS should be a single, simple name.
//
if (ns.size () != 1 || !ns[0].type.empty () || !ns[0].dir.empty ())
fail (t) << "variable name expected before " << t;
next (t, tt);
names_type vns (tt != type::newline && tt != type::eos
? names (t, tt)
: names_type ());
// Enter the variable.
//
string name;
if (ns[0].value.front () == '.') // Fully qualified name.
name.assign (ns[0].value, 1, string::npos);
else
//@@ TODO: append namespace if any.
name = move (ns[0].value);
const variable& var (variable_pool.find (move (name)));
if (assign)
{
value_ptr& val (scope_->variables[var]);
if (val == nullptr) // Initialization.
{
val.reset (new list_value (*scope_, move (vns)));
}
else // Assignment.
{
//@@ TODO: assuming it is a list.
//
dynamic_cast<list_value&> (*val).data = move (vns);
}
}
else
{
if (auto val = (*scope_)[var])
{
//@@ TODO: assuming it is a list.
//
list_value* lv (&val.as<list_value&> ());
if (&lv->scope != scope_) // Append to value from parent scope?
{
list_value_ptr nval (new list_value (*scope_, lv->data));
lv = nval.get (); // Append to.
scope_->variables.emplace (var, move (nval));
}
lv->data.insert (lv->data.end (),
make_move_iterator (vns.begin ()),
make_move_iterator (vns.end ()));
}
else // Initialization.
{
list_value_ptr nval (new list_value (*scope_, move (vns)));
scope_->variables.emplace (var, move (nval));
}
}
if (tt == type::newline)
next (t, tt);
else if (tt != type::eos)
fail (t) << "expected newline instead of " << t;
continue;
}
fail (t) << "unexpected " << t;
}
}
void parser::
source (token& t, token_type& tt)
{
tracer trace ("parser::source", &path_);
// The rest should be a list of buildfiles. Parse them as names
// to get variable expansion and directory prefixes.
//
location l (get_location (t, &path_));
names_type ns (tt != type::newline && tt != type::eos
? names (t, tt)
: names_type ());
for (name& n: ns)
{
// Construct the buildfile path.
//
path p (move (n.dir));
p /= path (move (n.value));
// If the path is relative then use the src directory corresponding
// to the current directory scope.
//
if (src_root_ != nullptr && p.relative ())
p = src_out (scope_->path (), *out_root_, *src_root_) / p;
p.normalize ();
// See if there is a trigger for this path.
//
{
auto i (root_->triggers.find (p));
if (i != root_->triggers.end () && !i->second (*root_, p))
{
level4 ([&]{trace (l) << "trigger instructed to skip " << p;});
continue;
}
}
ifstream ifs (p.string ());
if (!ifs.is_open ())
fail (l) << "unable to open " << p;
ifs.exceptions (ifstream::failbit | ifstream::badbit);
level4 ([&]{trace (t) << "entering " << p;});
string rw (diag_relative_work (p));
const string* op (path_);
path_ = &rw;
lexer l (ifs, rw);
lexer* ol (lexer_);
lexer_ = &l;
token t (type::eos, false, 0, 0);
type tt;
next (t, tt);
clause (t, tt);
if (tt != type::eos)
fail (t) << "unexpected " << t;
level4 ([&]{trace (t) << "leaving " << p;});
lexer_ = ol;
path_ = op;
// If src_root is unknown (happens during bootstrap), reload it
// in case the just sourced buildfile set it. This way, once it
// is set, all the parser mechanism that were disabled (like
// relative file source'ing) will start working. Note that they
// will still be disabled inside the file that set src_root. For
// this to work we would need to keep a reference to the value
// stored in the variable plus the update would need to update
// the value in place (see value_proxy).
//
if (src_root_ == nullptr)
{
auto v ((*root_)["src_root"]);
src_root_ = v ? &v.as<const path&> () : nullptr;
}
}
if (tt == type::newline)
next (t, tt);
else if (tt != type::eos)
fail (t) << "expected newline instead of " << t;
}
void parser::
include (token& t, token_type& tt)
{
tracer trace ("parser::include", &path_);
if (src_root_ == nullptr)
fail (t) << "inclusion during bootstrap";
// The rest should be a list of buildfiles. Parse them as names
// to get variable expansion and directory prefixes.
//
location l (get_location (t, &path_));
names_type ns (tt != type::newline && tt != type::eos
? names (t, tt)
: names_type ());
for (name& n: ns)
{
// Construct the buildfile path. If it is a directory, then append
// 'buildfile'.
//
path p (move (n.dir));
if (n.value.empty ())
p /= path ("buildfile");
else
{
bool d (path::traits::is_separator (n.value.back ())
|| n.type == "dir");
p /= path (move (n.value));
if (d)
p /= path ("buildfile");
}
bool in_out (false);
if (p.absolute ())
{
p.normalize ();
// Make sure the path is in this project. Include is only meant
// to be used for intra-project inclusion.
//
if (!p.sub (*src_root_) && !(in_out = p.sub (*out_root_)))
fail (l) << "out of project include " << p;
}
else
{
// Use the src directory corresponding to the current directory scope.
//
p = src_out (scope_->path (), *out_root_, *src_root_) / p;
p.normalize ();
}
if (!root_->buildfiles.insert (p).second)
{
level4 ([&]{trace (l) << "skipping already included " << p;});
continue;
}
// Determine new bases.
//
path out_base;
path src_base;
if (in_out)
{
out_base = p.directory ();
src_base = src_out (out_base, *out_root_, *src_root_);
}
else
{
src_base = p.directory ();
out_base = out_src (src_base, *out_root_, *src_root_);
}
ifstream ifs (p.string ());
if (!ifs.is_open ())
fail (l) << "unable to open " << p;
ifs.exceptions (ifstream::failbit | ifstream::badbit);
level4 ([&]{trace (t) << "entering " << p;});
string rw (diag_relative_work (p));
const string* op (path_);
path_ = &rw;
lexer l (ifs, rw);
lexer* ol (lexer_);
lexer_ = &l;
scope* os (scope_);
scope_ = &scopes[out_base];
scope_->variables["out_base"] = move (out_base);
auto v (scope_->variables["src_base"] = move (src_base));
scope_->src_path_ = &v.as<const path&> ();
target* odt (default_target_);
default_target_ = nullptr;
token t (type::eos, false, 0, 0);
type tt;
next (t, tt);
clause (t, tt);
if (tt != type::eos)
fail (t) << "unexpected " << t;
process_default_target (t);
level4 ([&]{trace (t) << "leaving " << p;});
default_target_ = odt;
scope_ = os;
lexer_ = ol;
path_ = op;
}
if (tt == type::newline)
next (t, tt);
else if (tt != type::eos)
fail (t) << "expected newline instead of " << t;
}
void parser::
using_ (token& t, token_type& tt)
{
tracer trace ("parser::using", &path_);
// The rest should be a list of module names. Parse them as names
// to get variable expansion, etc.
//
location l (get_location (t, &path_));
names_type ns (tt != type::newline && tt != type::eos
? names (t, tt)
: names_type ());
for (name& n: ns)
{
// For now it should be a simple name.
//
if (!n.type.empty () || !n.dir.empty ())
fail (l) << "module name expected instead of " << n;
const string& name (n.value);
auto i (modules.find (name));
if (i == modules.end ())
fail (l) << "unknown module " << name;
i->second (*root_, *scope_, l);
}
if (tt == type::newline)
next (t, tt);
else if (tt != type::eos)
fail (t) << "expected newline instead of " << t;
}
void parser::
print (token& t, token_type& tt)
{
for (; tt != type::newline && tt != type::eos; next (t, tt))
cout << t;
cout << endl;
if (tt != type::eos)
next (t, tt); // Swallow newline.
}
void parser::
names (token& t,
type& tt,
names_type& ns,
size_t pair,
const path* dp,
const string* tp)
{
// If pair is not 0, then it is an index + 1 of the first half of
// the pair for which we are parsing the second halves, e.g.,
// a={b c d{e f} {}}.
//
// Buffer that is used to collect the complete name in case of an
// unseparated variable expansion, e.g., 'foo$bar$(baz)fox'. The
// idea is to concatenate all the individual parts in this buffer
// and then re-inject it into the loop as a single token.
//
string concat;
// Number of names in the last group. This is used to detect when
// we need to add an empty first pair element (e.g., {=y}) or when
// we have a for now unsupported multi-name LHS (e.g., {x y}=z).
//
size_t count (0);
for (bool first (true);; first = false)
{
// If the accumulating buffer is not empty, then we have two options:
// continue accumulating or inject. We inject if the next token is
// not a name or var expansion or if it is separated.
//
if (!concat.empty () &&
((tt != type::name && tt != type::dollar) || peeked ().separated ()))
{
tt = type::name;
t = token (move (concat), true, t.line (), t.column ());
concat.clear ();
}
else if (!first)
next (t, tt);
// Name.
//
if (tt == type::name)
{
string name (t.name ()); //@@ move?
tt = peek ();
// Should we accumulate? If the buffer is not empty, then
// we continue accumulating (the case where we are separated
// should have been handled by the injection code above). If
// the next token is a var expansion and it is not separated,
// then we need to start accumulating.
//
if (!concat.empty () || // Continue.
(tt == type::dollar && !peeked ().separated ())) // Start.
{
concat += name;
continue;
}
string::size_type p (name.rfind ('/'));
string::size_type n (name.size () - 1);
// See if this is a type name, directory prefix, or both. That is,
// it is followed by '{'.
//
if (tt == type::lcbrace)
{
next (t, tt);
if (p != n && tp != nullptr)
fail (t) << "nested type name " << name;
path d1;
const path* dp1 (dp);
string t1;
const string* tp1 (tp);
if (p == string::npos) // type
tp1 = &name;
else if (p == n) // directory
{
if (dp == nullptr)
d1 = path (name);
else
d1 = *dp / path (name);
dp1 = &d1;
}
else // both
{
t1.assign (name, p + 1, n - p);
if (dp == nullptr)
d1 = path (name, 0, p + 1);
else
d1 = *dp / path (name, 0, p + 1);
dp1 = &d1;
tp1 = &t1;
}
next (t, tt);
count = ns.size ();
names (t, tt,
ns,
(pair != 0
? pair
: (ns.empty () || !ns.back ().pair ? 0 : ns.size ())),
dp1, tp1);
count = ns.size () - count;
if (tt != type::rcbrace)
fail (t) << "expected } instead of " << t;
tt = peek ();
continue;
}
// If we are a second half of a pair, add another first half
// unless this is the first instance.
//
if (pair != 0 && pair != ns.size ())
ns.push_back (ns[pair - 1]);
// If it ends with a directory separator, then it is a directory.
// Note that at this stage we don't treat '.' and '..' as special
// (unless they are specified with a directory separator) because
// then we would have ended up treating '.: ...' as a directory
// scope. Instead, this is handled higher up the processing chain,
// in target_types::find().
//
// @@ TODO: and not quoted
//
if (p == n)
{
// On Win32 translate the root path to the special empty path.
// Search for root_scope for details.
//
#ifdef _WIN32
path dir (name != "/" ? path (name) : path ());
#else
path dir (name);
#endif
if (dp != nullptr)
dir = *dp / dir;
ns.emplace_back ((tp != nullptr ? *tp : string ()),
move (dir),
string ());
}
else
ns.emplace_back ((tp != nullptr ? *tp : string ()),
(dp != nullptr ? *dp : path ()),
move (name));
count = 1;
continue;
}
// Variable expansion.
//
if (tt == type::dollar)
{
next (t, tt);
bool paren (tt == type::lparen);
if (paren)
next (t, tt);
if (tt != type::name)
fail (t) << "variable name expected instead of " << t;
string n;
if (t.name ().front () == '.') // Fully qualified name.
n.assign (t.name (), 1, string::npos);
else
//@@ TODO: append namespace if any.
n = t.name ();
const variable& var (variable_pool.find (move (n)));
auto val ((*scope_)[var]);
// Undefined namespaces variables are not allowed.
//
if (!val && var.name.find ('.') != string::npos)
fail (t) << "undefined namespace variable " << var.name;
if (paren)
{
next (t, tt);
if (tt != type::rparen)
fail (t) << "expected ) instead of " << t;
}
tt = peek ();
if (!val)
continue;
//@@ TODO: assuming it is a list.
//
const list_value& lv (val.as<list_value&> ());
if (lv.data.empty ())
continue;
// Should we accumulate? If the buffer is not empty, then
// we continue accumulating (the case where we are separated
// should have been handled by the injection code above). If
// the next token is a name or var expansion and it is not
// separated, then we need to start accumulating.
//
if (!concat.empty () || // Continue.
((tt == type::name || tt == type::dollar) // Start.
&& !peeked ().separated ()))
{
// This should be a simple value or a simple directory. The
// token still points to the name (or closing paren).
//
if (lv.data.size () > 1)
fail (t) << "concatenating expansion of " << var.name
<< " contains multiple values";
const name& n (lv.data[0]);
if (!n.type.empty ())
fail (t) << "concatenating expansion of " << var.name
<< " contains type";
if (!n.dir.empty ())
{
if (!n.value.empty ())
fail (t) << "concatenating expansion of " << var.name
<< " contains directory";
concat += n.dir.string ();
}
else
concat += n.value;
}
else
{
// Copy the names from the variable into the resulting name list
// while doing sensible things with the types and directories.
//
for (const name& n: lv.data)
{
const path* dp1 (dp);
const string* tp1 (tp);
path d1;
if (!n.dir.empty ())
{
if (dp != nullptr)
{
if (n.dir.absolute ())
fail (t) << "nested absolute directory " << n.dir.string ()
<< " in variable expansion";
d1 = *dp / n.dir;
dp1 = &d1;
}
else
dp1 = &n.dir;
}
if (!n.type.empty ())
{
if (tp == nullptr)
tp1 = &n.type;
else
fail (t) << "nested type name " << n.type << " in variable "
<< "expansion";
}
// If we are a second half of a pair.
//
if (pair != 0)
{
// Check that there are no nested pairs.
//
if (n.pair)
fail (t) << "nested pair in variable expansion";
// And add another first half unless this is the first instance.
//
if (pair != ns.size ())
ns.push_back (ns[pair - 1]);
}
ns.emplace_back ((tp1 != nullptr ? *tp1 : string ()),
(dp1 != nullptr ? *dp1 : path ()),
n.value);
}
count = lv.data.size ();
}
continue;
}
// Untyped name group without a directory prefix, e.g., '{foo bar}'.
//
if (tt == type::lcbrace)
{
next (t, tt);
count = ns.size ();
names (t, tt,
ns,
(pair != 0
? pair
: (ns.empty () || !ns.back ().pair ? 0 : ns.size ())),
dp, tp);
count = ns.size () - count;
if (tt != type::rcbrace)
fail (t) << "expected } instead of " << t;
tt = peek ();
continue;
}
// A pair separator (only in the pair mode).
//
if (tt == type::equal && lexer_->mode () == lexer_mode::pairs)
{
if (pair != 0)
fail (t) << "nested pair on the right hand side of a pair";
if (count > 1)
fail (t) << "multiple names on the left hand side of a pair";
if (count == 0)
{
// Empty LHS, (e.g., {=y}), create an empty name.
//
ns.emplace_back ((tp != nullptr ? *tp : string ()),
(dp != nullptr ? *dp : path ()),
"");
count = 1;
}
ns.back ().pair = true;
tt = peek ();
continue;
}
if (!first)
break;
// Our caller expected this to be a name.
//
if (tt == type::rcbrace) // Empty name, e.g., dir{}.
{
// If we are a second half of a pair, add another first half
// unless this is the first instance.
//
if (pair != 0 && pair != ns.size ())
ns.push_back (ns[pair - 1]);
ns.emplace_back ((tp != nullptr ? *tp : string ()),
(dp != nullptr ? *dp : path ()),
"");
break;
}
else
fail (t) << "expected name instead of " << t;
}
// Handle the empty RHS in a pair, (e.g., {y=}).
//
if (!ns.empty () && ns.back ().pair)
{
ns.emplace_back ((tp != nullptr ? *tp : string ()),
(dp != nullptr ? *dp : path ()),
"");
}
}
// Buildspec parsing.
//
buildspec parser::
parse_buildspec (istream& is, const std::string& name)
{
path_ = &name;
lexer l (is, name);
lexer_ = &l;
scope_ = root_ = root_scope;
// Turn on pairs recognition (e.g., src_root/=out_root/exe{foo bar}).
//
lexer_->mode (lexer_mode::pairs);
token t (type::eos, false, 0, 0);
type tt;
next (t, tt);
return buildspec_clause (t, tt, type::eos);
}
static bool
opname (const name& n)
{
// First it has to be a non-empty simple name.
//
if (n.pair || !n.type.empty () || !n.dir.empty () || n.value.empty ())
return false;
// C identifier.
//
for (size_t i (0); i != n.value.size (); ++i)
{
char c (n.value[i]);
if (c != '_' && !(i != 0 ? isalnum (c) : isalpha (c)))
return false;
}
return true;
}
buildspec parser::
buildspec_clause (token& t, token_type& tt, token_type tt_end)
{
buildspec bs;
while (tt != tt_end)
{
// We always start with one or more names.
//
if (tt != type::name &&
tt != type::lcbrace && // Untyped name group: '{foo ...'
tt != type::dollar && // Variable expansion: '$foo ...'
tt != type::equal) // Empty pair LHS: '=foo ...'
fail (t) << "operation or target expected instead of " << t;
location l (get_location (t, &path_)); // Start of names.
// This call will produce zero or more names and should stop
// at either tt_end or '('.
//
names_type ns (names (t, tt));
size_t targets (ns.size ());
if (tt == type::lparen)
{
if (targets == 0 || !opname (ns.back ()))
fail (t) << "operation name expected before (";
targets--; // Last one is an operation name.
}
// Group all the targets into a single operation. In other
// words, 'foo bar' is equivalent to 'build(foo bar)'.
//
if (targets != 0)
{
if (bs.empty () || !bs.back ().name.empty ())
bs.push_back (metaopspec ()); // Empty (default) meta operation.
metaopspec& ms (bs.back ());
for (auto i (ns.begin ()), e (i + targets); i != e; ++i)
{
if (opname (*i))
ms.push_back (opspec (move (i->value)));
else
{
// Do we have the src_base?
//
path src_base;
if (i->pair)
{
if (!i->type.empty ())
fail (l) << "expected target src_base instead of " << *i;
src_base = move (i->dir);
if (!i->value.empty ())
src_base /= path (move (i->value));
++i;
assert (i != e);
}
if (ms.empty () || !ms.back ().name.empty ())
ms.push_back (opspec ()); // Empty (default) operation.
opspec& os (ms.back ());
os.emplace_back (move (src_base), move (*i));
}
}
}
// Handle the operation.
//
if (tt == type::lparen)
{
// Inside '(' and ')' we have another buildspec.
//
next (t, tt);
location l (get_location (t, &path_)); // Start of nested names.
buildspec nbs (buildspec_clause (t, tt, type::rparen));
// Merge the nested buildspec into ours. But first determine
// if we are an operation or meta-operation and do some sanity
// checks.
//
bool meta (false);
for (const metaopspec& nms: nbs)
{
if (!nms.name.empty ())
fail (l) << "nested meta-operation " << nms.name;
if (!meta)
{
for (const opspec& nos: nms)
{
if (!nos.name.empty ())
{
meta = true;
break;
}
}
}
}
// No nested meta-operations means we should have a single
// metaopspec object with empty meta-operation name.
//
assert (nbs.size () == 1);
metaopspec& nmo (nbs.back ());
if (meta)
{
nmo.name = move (ns.back ().value);
bs.push_back (move (nmo));
}
else
{
// Since we are not a meta-operation, the nested buildspec
// should be just a bunch of targets.
//
assert (nmo.size () == 1);
opspec& nos (nmo.back ());
if (bs.empty () || !bs.back ().name.empty ())
bs.push_back (metaopspec ()); // Empty (default) meta operation.
nos.name = move (ns.back ().value);
bs.back ().push_back (move (nos));
}
next (t, tt); // Done with ')'.
}
}
return bs;
}
void parser::
process_default_target (token& t)
{
tracer trace ("parser::process_default_target", &path_);
// The logic is as follows: if we have an explicit current directory
// target, then that's the default target. Otherwise, we take the
// first target and use it as a prerequisite to create an implicit
// current directory target, effectively making it the default
// target via an alias. If there are no targets in this buildfile,
// then we don't do anything.
//
if (default_target_ == nullptr || // No targets in this buildfile.
targets.find (dir::static_type, // Explicit current dir target.
scope_->path (),
"",
nullptr,
trace) != targets.end ())
return;
target& dt (*default_target_);
level4 ([&]{trace (t) << "creating current directory alias for " << dt;});
target& ct (
targets.insert (
dir::static_type, scope_->path (), "", nullptr, trace).first);
prerequisite& p (
scope_->prerequisites.insert (
dt.type (),
dt.dir,
dt.name,
dt.ext,
*scope_, // Doesn't matter which scope since dir is absolute.
trace).first);
p.target = &dt;
ct.prerequisites.push_back (p);
}
token_type parser::
next (token& t, token_type& tt)
{
if (!peeked_)
t = lexer_->next ();
else
{
t = move (peek_);
peeked_ = false;
}
tt = t.type ();
return tt;
}
token_type parser::
peek ()
{
if (!peeked_)
{
peek_ = lexer_->next ();
peeked_ = true;
}
return peek_.type ();
}
static location
get_location (const token& t, const void* data)
{
assert (data != nullptr);
const string& p (**static_cast<const string* const*> (data));
return location (p.c_str (), t.line (), t.column ());
}
// Output the token type and value in a format suitable for diagnostics.
//
ostream&
operator<< (ostream& os, const token& t)
{
switch (t.type ())
{
case token_type::eos: os << "<end-of-file>"; break;
case token_type::newline: os << "<newline>"; break;
case token_type::colon: os << ":"; break;
case token_type::lcbrace: os << "{"; break;
case token_type::rcbrace: os << "}"; break;
case token_type::equal: os << "="; break;
case token_type::plus_equal: os << "+="; break;
case token_type::dollar: os << "$"; break;
case token_type::lparen: os << "("; break;
case token_type::rparen: os << ")"; break;
case token_type::name: os << t.name (); break;
}
return os;
}
}
|