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
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
|
#include <map>
#include <boost/shared_ptr.hpp>
#include <boost/enable_shared_from_this.hpp>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include "normalise.hh"
#include "references.hh"
#include "pathlocks.hh"
#include "globals.hh"
/* !!! TODO storeExprFromPath shouldn't be used here */
static string pathNullDevice = "/dev/null";
/* Forward definition. */
class Worker;
/* A pointer to a goal. */
class Goal;
typedef shared_ptr<Goal> GoalPtr;
/* A set of goals. */
typedef set<GoalPtr> Goals;
/* A map of paths to goals (and the other way around). */
typedef map<Path, GoalPtr> GoalMap;
typedef map<GoalPtr, Path> GoalMapRev;
class Goal : public enable_shared_from_this<Goal>
{
protected:
/* Backlink to the worker. */
Worker & worker;
/* Goals waiting for this one to finish. */
Goals waiters;
/* Number of goals we are waiting for. */
unsigned int nrWaitees;
Goal(Worker & _worker) : worker(_worker)
{
nrWaitees = 0;
}
virtual ~Goal()
{
printMsg(lvlVomit, "goal destroyed");
}
public:
virtual void work() = 0;
virtual string name()
{
return "(noname)";
}
void addWaiter(GoalPtr waiter);
void waiteeDone();
void amDone();
};
/* A mapping used to remember for each child process to what goal it
belongs, and a file descriptor for receiving log data. */
struct Child
{
GoalPtr goal;
int fdOutput;
bool inBuildSlot;
};
typedef map<pid_t, Child> Children;
/* The worker class. */
class Worker
{
private:
/* The goals of the worker. */
Goals goals;
/* Goals that are ready to do some work. */
Goals awake;
/* Goals waiting for a build slot. */
Goals wantingToBuild;
/* Child processes currently running. */
Children children;
/* Number of build slots occupied. Not all child processes
(namely build hooks) count as occupied build slots. */
unsigned int nrChildren;
/* Maps used to prevent multiple instantiation of a goal for the
same expression / path. */
GoalMap normalisationGoals;
GoalMapRev normalisationGoalsRev;
GoalMap realisationGoals;
GoalMapRev realisationGoalsRev;
GoalMap substitutionGoals;
GoalMapRev substitutionGoalsRev;
public:
Worker();
~Worker();
/* Add a goal. */
void addNormalisationGoal(const Path & nePath, GoalPtr waiter);
void addRealisationGoal(const Path & nePath, GoalPtr waiter);
void addSubstitutionGoal(const Path & storePath, GoalPtr waiter);
/* Remove a finished goal. */
void removeGoal(GoalPtr goal);
/* Wake up a goal (i.e., there is something for it to do). */
void wakeUp(GoalPtr goal);
/* Can we start another child process? */
bool canBuildMore();
/* Registers / unregisters a running child process. */
void childStarted(GoalPtr goal, pid_t pid, int fdOutput,
bool inBuildSlot);
void childTerminated(pid_t pid);
/* Add a goal to the set of goals waiting for a build slot. */
void waitForBuildSlot(GoalPtr goal);
/* Loop until all goals have been realised. */
void run();
/* Wait for input to become available. */
void waitForInput();
};
//////////////////////////////////////////////////////////////////////
void Goal::addWaiter(GoalPtr waiter)
{
waiters.insert(waiter);
}
void Goal::waiteeDone()
{
assert(nrWaitees > 0);
if (!--nrWaitees) worker.wakeUp(shared_from_this());
}
void Goal::amDone()
{
printMsg(lvlVomit, "done");
for (Goals::iterator i = waiters.begin(); i != waiters.end(); ++i)
(*i)->waiteeDone();
worker.removeGoal(shared_from_this());
}
//////////////////////////////////////////////////////////////////////
/* Common initialisation performed in child processes. */
void commonChildInit(Pipe & logPipe)
{
/* Put the child in a separate process group so that it doesn't
receive terminal signals. */
if (setpgid(0, 0) == -1)
throw SysError(format("setting process group"));
/* Dup the write side of the logger pipe into stderr. */
if (dup2(logPipe.writeSide, STDERR_FILENO) == -1)
throw SysError("cannot pipe standard error into log file");
logPipe.readSide.close();
/* Dup stderr to stdin. */
if (dup2(STDERR_FILENO, STDOUT_FILENO) == -1)
throw SysError("cannot dup stderr into stdout");
/* Reroute stdin to /dev/null. */
int fdDevNull = open(pathNullDevice.c_str(), O_RDWR);
if (fdDevNull == -1)
throw SysError(format("cannot open `%1%'") % pathNullDevice);
if (dup2(fdDevNull, STDIN_FILENO) == -1)
throw SysError("cannot dup null device into stdin");
}
const char * * strings2CharPtrs(const Strings & ss)
{
const char * * arr = new const char * [ss.size() + 1];
const char * * p = arr;
for (Strings::const_iterator i = ss.begin(); i != ss.end(); ++i)
*p++ = i->c_str();
*p = 0;
return arr;
}
//////////////////////////////////////////////////////////////////////
class NormalisationGoal : public Goal
{
private:
/* The path of the derivation store expression. */
Path nePath;
/* The store expression stored at nePath. */
StoreExpr expr;
/* The remainder is state held during the build. */
/* Locks on the output paths. */
PathLocks outputLocks;
/* Input paths, with their closure elements. */
ClosureElems inClosures;
/* Referenceable paths (i.e., input and output paths). */
PathSet allPaths;
/* The normal forms of the input store expressions. */
PathSet inputNFs;
/* The successor mappings for the input store expressions. */
map<Path, Path> inputSucs;
/* The process ID of the builder. */
Pid pid;
/* The temporary directory. */
Path tmpDir;
/* File descriptor for the log file. */
AutoCloseFD fdLogFile;
/* Pipe for the builder's standard output/error. */
Pipe logPipe;
/* Pipes for talking to the build hook (if any). */
Pipe toHook;
Pipe fromHook;
typedef void (NormalisationGoal::*GoalState)();
GoalState state;
public:
NormalisationGoal(const Path & _nePath, Worker & _worker);
~NormalisationGoal();
void work();
private:
/* The states. */
void init();
void haveStoreExpr();
void inputNormalised();
void inputRealised();
void tryToBuild();
void buildDone();
/* Is the build hook willing to perform the build? */
typedef enum {rpAccept, rpDecline, rpPostpone, rpDone} HookReply;
HookReply tryBuildHook();
/* Synchronously wait for a build hook to finish. */
void terminateBuildHook();
/* Acquires locks on the output paths and gathers information
about the build (e.g., the input closures). During this
process its possible that we find out that the build is
unnecessary, in which case we return false (this is not an
error condition!). */
bool prepareBuild();
/* Start building a derivation. */
void startBuilder();
/* Must be called after the output paths have become valid (either
due to a successful build or hook, or because they already
were). */
void createClosure();
/* Open a log file and a pipe to it. */
void openLogFile();
/* Common initialisation to be performed in child processes (i.e.,
both in builders and in build hooks. */
void initChild();
/* Delete the temporary directory, if we have one. */
void deleteTmpDir(bool force);
string name()
{
return nePath;
}
void trace(const format & f);
};
NormalisationGoal::NormalisationGoal(const Path & _nePath, Worker & _worker)
: Goal(_worker)
{
nePath = _nePath;
state = &NormalisationGoal::init;
}
NormalisationGoal::~NormalisationGoal()
{
/* Careful: we should never ever throw an exception from a
destructor. */
try {
deleteTmpDir(false);
} catch (Error & e) {
printMsg(lvlError, format("error (ignored): %1%") % e.msg());
}
}
void NormalisationGoal::work()
{
(this->*state)();
}
void NormalisationGoal::init()
{
trace("init");
/* If we already have a successor, then we are done already; don't
add the expression as a goal. */
Path nfPath;
if (querySuccessor(nePath, nfPath)) {
amDone();
return;
}
/* The first thing to do is to make sure that the store expression
exists. If it doesn't, it may be created through a
substitute. */
nrWaitees = 1;
worker.addSubstitutionGoal(nePath, shared_from_this());
state = &NormalisationGoal::haveStoreExpr;
}
void NormalisationGoal::haveStoreExpr()
{
trace("loading store expression");
assert(isValidPath(nePath));
/* Get the store expression. */
expr = storeExprFromPath(nePath);
/* If this is a normal form (i.e., a closure) we are also done. */
if (expr.type == StoreExpr::neClosure) {
amDone();
return;
}
assert(expr.type == StoreExpr::neDerivation);
/* Inputs must be normalised before we can build this goal. */
for (PathSet::iterator i = expr.derivation.inputs.begin();
i != expr.derivation.inputs.end(); ++i)
worker.addNormalisationGoal(*i, shared_from_this());
nrWaitees = expr.derivation.inputs.size();
state = &NormalisationGoal::inputNormalised;
}
void NormalisationGoal::inputNormalised()
{
trace("all inputs normalised");
/* Inputs must also be realised before we can build this goal. */
for (PathSet::iterator i = expr.derivation.inputs.begin();
i != expr.derivation.inputs.end(); ++i)
{
Path neInput = *i, nfInput;
if (querySuccessor(neInput, nfInput))
neInput = nfInput;
/* Otherwise the input must be a closure. */
worker.addRealisationGoal(neInput, shared_from_this());
}
nrWaitees = expr.derivation.inputs.size();
state = &NormalisationGoal::inputRealised;
}
void NormalisationGoal::inputRealised()
{
trace("all inputs realised");
/* Okay, try to build. Note that here we don't wait for a build
slot to become available, since we don't need one if there is a
build hook. */
state = &NormalisationGoal::tryToBuild;
worker.wakeUp(shared_from_this());
}
void NormalisationGoal::tryToBuild()
{
trace("trying to build");
/* Is the build hook willing to accept this job? */
switch (tryBuildHook()) {
case rpAccept:
/* Yes, it has started doing so. Wait until we get
EOF from the hook. */
state = &NormalisationGoal::buildDone;
return;
case rpPostpone:
/* Not now; wait until at least one child finishes. */
worker.waitForBuildSlot(shared_from_this());
return;
case rpDecline:
/* We should do it ourselves. */
break;
case rpDone:
/* Somebody else did it (there is a successor now). */
amDone();
return;
}
/* Make sure that we are allowed to start a build. */
if (!worker.canBuildMore()) {
worker.waitForBuildSlot(shared_from_this());
return;
}
/* Acquire locks and such. If we then see that there now is a
successor, we're done. */
if (!prepareBuild()) {
amDone();
return;
}
/* Okay, we have to build. */
startBuilder();
/* This state will be reached when we get EOF on the child's
log pipe. */
state = &NormalisationGoal::buildDone;
}
void NormalisationGoal::buildDone()
{
trace("build done");
/* Since we got an EOF on the logger pipe, the builder is presumed
to have terminated. In fact, the builder could also have
simply have closed its end of the pipe --- just don't do that
:-) */
/* !!! this could block! */
pid_t savedPid = pid;
int status = pid.wait(true);
/* So the child is gone now. */
worker.childTerminated(savedPid);
/* Close the read side of the logger pipe. */
logPipe.readSide.close();
/* Close the log file. */
fdLogFile.close();
debug(format("builder process for `%1%' finished") % nePath);
/* Check the exit status. */
if (!statusOk(status)) {
deleteTmpDir(false);
throw Error(format("builder for `%1%' %2%")
% nePath % statusToString(status));
}
deleteTmpDir(true);
/* Compute a closure store expression, and register it as our
successor. */
createClosure();
amDone();
}
static string readLine(int fd)
{
string s;
while (1) {
char ch;
ssize_t rd = read(fd, &ch, 1);
if (rd == -1) {
if (errno != EINTR)
throw SysError("reading a line");
} else if (rd == 0)
throw Error("unexpected EOF reading a line");
else {
if (ch == '\n') return s;
s += ch;
}
}
}
static void writeLine(int fd, string s)
{
s += '\n';
writeFull(fd, (const unsigned char *) s.c_str(), s.size());
}
/* !!! ugly hack */
static void drain(int fd)
{
unsigned char buffer[1024];
while (1) {
ssize_t rd = read(fd, buffer, sizeof buffer);
if (rd == -1) {
if (errno != EINTR)
throw SysError("draining");
} else if (rd == 0) break;
else writeFull(STDERR_FILENO, buffer, rd);
}
}
NormalisationGoal::HookReply NormalisationGoal::tryBuildHook()
{
Path buildHook = getEnv("NIX_BUILD_HOOK");
if (buildHook == "") return rpDecline;
buildHook = absPath(buildHook);
/* Create a directory where we will store files used for
communication between us and the build hook. */
tmpDir = createTempDir();
/* Create the log file and pipe. */
openLogFile();
/* Create the communication pipes. */
toHook.create();
fromHook.create();
/* Fork the hook. */
pid = fork();
switch (pid) {
case -1:
throw SysError("unable to fork");
case 0:
try { /* child */
initChild();
execl(buildHook.c_str(), buildHook.c_str(),
(worker.canBuildMore() ? (string) "1" : "0").c_str(),
thisSystem.c_str(),
expr.derivation.platform.c_str(),
nePath.c_str(), 0);
throw SysError(format("executing `%1%'") % buildHook);
} catch (exception & e) {
cerr << format("build error: %1%\n") % e.what();
}
_exit(1);
}
/* parent */
logPipe.writeSide.close();
worker.childStarted(shared_from_this(),
pid, logPipe.readSide, false);
fromHook.writeSide.close();
toHook.readSide.close();
/* Read the first line of input, which should be a word indicating
whether the hook wishes to perform the build. !!! potential
for deadlock here: we should also read from the child's logger
pipe. */
string reply;
try {
reply = readLine(fromHook.readSide);
} catch (Error & e) {
drain(logPipe.readSide);
throw;
}
debug(format("hook reply is `%1%'") % reply);
if (reply == "decline" || reply == "postpone") {
/* Clean up the child. !!! hacky / should verify */
drain(logPipe.readSide);
terminateBuildHook();
return reply == "decline" ? rpDecline : rpPostpone;
}
else if (reply == "accept") {
/* Acquire locks and such. If we then see that there now is a
successor, we're done. */
if (!prepareBuild()) {
/* Tell the hook to exit. */
writeLine(toHook.writeSide, "cancel");
terminateBuildHook();
return rpDone;
}
printMsg(lvlInfo, format("running hook to build path `%1%'")
% *expr.derivation.outputs.begin());
/* Write the information that the hook needs to perform the
build, i.e., the set of input paths (including closure
expressions), the set of output paths, and the successor
mappings for the input expressions. */
Path inputListFN = tmpDir + "/inputs";
Path outputListFN = tmpDir + "/outputs";
Path successorsListFN = tmpDir + "/successors";
string s;
for (ClosureElems::iterator i = inClosures.begin();
i != inClosures.end(); ++i)
s += i->first + "\n";
for (PathSet::iterator i = inputNFs.begin();
i != inputNFs.end(); ++i)
s += *i + "\n";
writeStringToFile(inputListFN, s);
s = "";
for (PathSet::iterator i = expr.derivation.outputs.begin();
i != expr.derivation.outputs.end(); ++i)
s += *i + "\n";
writeStringToFile(outputListFN, s);
s = "";
for (map<Path, Path>::iterator i = inputSucs.begin();
i != inputSucs.end(); ++i)
s += i->first + " " + i->second + "\n";
writeStringToFile(successorsListFN, s);
/* Tell the hook to proceed. */
writeLine(toHook.writeSide, "okay");
return rpAccept;
}
else throw Error(format("bad hook reply `%1%'") % reply);
}
void NormalisationGoal::terminateBuildHook()
{
/* !!! drain stdout of hook */
debug("terminating build hook");
pid_t savedPid = pid;
pid.wait(true);
worker.childTerminated(savedPid);
fromHook.readSide.close();
toHook.writeSide.close();
fdLogFile.close();
logPipe.readSide.close();
}
bool NormalisationGoal::prepareBuild()
{
/* Obtain locks on all output paths. The locks are automatically
released when we exit this function or Nix crashes. */
/* !!! BUG: this could block, which is not allowed. */
outputLocks.lockPaths(expr.derivation.outputs);
/* Now check again whether there is a successor. This is because
another process may have started building in parallel. After
it has finished and released the locks, we can (and should)
reuse its results. (Strictly speaking the first successor
check can be omitted, but that would be less efficient.) Note
that since we now hold the locks on the output paths, no other
process can build this expression, so no further checks are
necessary. */
Path nfPath;
if (querySuccessor(nePath, nfPath)) {
debug(format("skipping build of expression `%1%', someone beat us to it")
% nePath);
outputLocks.setDeletion(true);
return false;
}
/* Gather information necessary for computing the closure and/or
running the build hook. */
/* The outputs are referenceable paths. */
for (PathSet::iterator i = expr.derivation.outputs.begin();
i != expr.derivation.outputs.end(); ++i)
{
debug(format("building path `%1%'") % *i);
allPaths.insert(*i);
}
/* Get information about the inputs (these all exist now). */
for (PathSet::iterator i = expr.derivation.inputs.begin();
i != expr.derivation.inputs.end(); ++i)
{
checkInterrupt();
Path nePath = *i, nfPath;
if (!querySuccessor(nePath, nfPath)) nfPath = nePath;
inputNFs.insert(nfPath);
if (nfPath != nePath) inputSucs[nePath] = nfPath;
/* !!! nfPath should be a root of the garbage collector while
we are building */
StoreExpr ne = storeExprFromPath(nfPath);
if (ne.type != StoreExpr::neClosure) abort();
for (ClosureElems::iterator j = ne.closure.elems.begin();
j != ne.closure.elems.end(); ++j)
{
inClosures[j->first] = j->second;
allPaths.insert(j->first);
}
}
/* We can skip running the builder if all output paths are already
valid. */
bool fastBuild = true;
for (PathSet::iterator i = expr.derivation.outputs.begin();
i != expr.derivation.outputs.end(); ++i)
if (!isValidPath(*i)) {
fastBuild = false;
break;
}
if (fastBuild) {
printMsg(lvlChatty, format("skipping build; output paths already exist"));
createClosure();
return false;
}
return true;
}
void NormalisationGoal::startBuilder()
{
startNest(nest, lvlInfo,
format("building path `%1%'") % *expr.derivation.outputs.begin());
/* Right platform? */
if (expr.derivation.platform != thisSystem)
throw Error(format("a `%1%' is required, but I am a `%2%'")
% expr.derivation.platform % thisSystem);
/* If any of the outputs already exist but are not registered,
delete them. */
for (PathSet::iterator i = expr.derivation.outputs.begin();
i != expr.derivation.outputs.end(); ++i)
{
Path path = *i;
if (isValidPath(path))
throw Error(format("obstructed build: path `%1%' exists") % path);
if (pathExists(path)) {
debug(format("removing unregistered path `%1%'") % path);
deletePath(path);
}
}
/* Construct the environment passed to the builder. */
typedef map<string, string> Environment;
Environment env;
/* Most shells initialise PATH to some default (/bin:/usr/bin:...) when
PATH is not set. We don't want this, so we fill it in with some dummy
value. */
env["PATH"] = "/path-not-set";
/* Set HOME to a non-existing path to prevent certain programs from using
/etc/passwd (or NIS, or whatever) to locate the home directory (for
example, wget looks for ~/.wgetrc). I.e., these tools use /etc/passwd
if HOME is not set, but they will just assume that the settings file
they are looking for does not exist if HOME is set but points to some
non-existing path. */
env["HOME"] = "/homeless-shelter";
/* Tell the builder where the Nix store is. Usually they
shouldn't care, but this is useful for purity checking (e.g.,
the compiler or linker might only want to accept paths to files
in the store or in the build directory). */
env["NIX_STORE"] = nixStore;
/* Add all bindings specified in the derivation expression. */
for (StringPairs::iterator i = expr.derivation.env.begin();
i != expr.derivation.env.end(); ++i)
env[i->first] = i->second;
/* Create a temporary directory where the build will take
place. */
tmpDir = createTempDir();
/* For convenience, set an environment pointing to the top build
directory. */
env["NIX_BUILD_TOP"] = tmpDir;
/* Also set TMPDIR and variants to point to this directory. */
env["TMPDIR"] = env["TEMPDIR"] = env["TMP"] = env["TEMP"] = tmpDir;
/* Run the builder. */
printMsg(lvlChatty, format("executing builder `%1%'") %
expr.derivation.builder);
/* Create the log file and pipe. */
openLogFile();
/* Fork a child to build the package. Note that while we
currently use forks to run and wait for the children, it
shouldn't be hard to use threads for this on systems where
fork() is unavailable or inefficient. */
pid = fork();
switch (pid) {
case -1:
throw SysError("unable to fork");
case 0:
/* Warning: in the child we should absolutely not make any
Berkeley DB calls! */
try { /* child */
initChild();
/* Fill in the arguments. */
Strings args(expr.derivation.args);
args.push_front(baseNameOf(expr.derivation.builder));
const char * * argArr = strings2CharPtrs(args);
/* Fill in the environment. */
Strings envStrs;
for (Environment::const_iterator i = env.begin();
i != env.end(); ++i)
envStrs.push_back(i->first + "=" + i->second);
const char * * envArr = strings2CharPtrs(envStrs);
/* Execute the program. This should not return. */
execve(expr.derivation.builder.c_str(),
(char * *) argArr, (char * *) envArr);
throw SysError(format("executing `%1%'")
% expr.derivation.builder);
} catch (exception & e) {
cerr << format("build error: %1%\n") % e.what();
}
_exit(1);
}
/* parent */
pid.setSeparatePG(true);
logPipe.writeSide.close();
worker.childStarted(shared_from_this(),
pid, logPipe.readSide, true);
}
void NormalisationGoal::createClosure()
{
/* The resulting closure expression. */
StoreExpr nf;
nf.type = StoreExpr::neClosure;
startNest(nest, lvlTalkative,
format("computing closure for `%1%'") % nePath);
/* Check whether the output paths were created, and grep each
output path to determine what other paths it references. Also make all
output paths read-only. */
PathSet usedPaths;
for (PathSet::iterator i = expr.derivation.outputs.begin();
i != expr.derivation.outputs.end(); ++i)
{
Path path = *i;
if (!pathExists(path))
throw Error(format("output path `%1%' does not exist") % path);
nf.closure.roots.insert(path);
makePathReadOnly(path);
/* For this output path, find the references to other paths contained
in it. */
startNest(nest2, lvlChatty,
format("scanning for store references in `%1%'") % path);
Strings refPaths = filterReferences(path,
Strings(allPaths.begin(), allPaths.end()));
nest2.close();
/* Construct a closure element for this output path. */
ClosureElem elem;
/* For each path referenced by this output path, add its id to the
closure element and add the id to the `usedPaths' set (so that the
elements referenced by *its* closure are added below). */
for (Paths::iterator j = refPaths.begin();
j != refPaths.end(); ++j)
{
checkInterrupt();
Path path = *j;
elem.refs.insert(path);
if (inClosures.find(path) != inClosures.end())
usedPaths.insert(path);
else if (expr.derivation.outputs.find(path) ==
expr.derivation.outputs.end())
abort();
}
nf.closure.elems[path] = elem;
}
/* Close the closure. That is, for any referenced path, add the paths
referenced by it. */
PathSet donePaths;
while (!usedPaths.empty()) {
checkInterrupt();
PathSet::iterator i = usedPaths.begin();
Path path = *i;
usedPaths.erase(i);
if (donePaths.find(path) != donePaths.end()) continue;
donePaths.insert(path);
ClosureElems::iterator j = inClosures.find(path);
if (j == inClosures.end()) abort();
nf.closure.elems[path] = j->second;
for (PathSet::iterator k = j->second.refs.begin();
k != j->second.refs.end(); k++)
usedPaths.insert(*k);
}
/* For debugging, print out the referenced and unreferenced paths. */
for (ClosureElems::iterator i = inClosures.begin();
i != inClosures.end(); ++i)
{
PathSet::iterator j = donePaths.find(i->first);
if (j == donePaths.end())
debug(format("unreferenced input: `%1%'") % i->first);
else
debug(format("referenced input: `%1%'") % i->first);
}
/* Write the normal form. This does not have to occur in the
transaction below because writing terms is idem-potent. */
ATerm nfTerm = unparseStoreExpr(nf);
Path nfPath = writeTerm(nfTerm, "-s");
/* Register each output path, and register the normal form. This
is wrapped in one database transaction to ensure that if we
crash, either everything is registered or nothing is. This is
for recoverability: unregistered paths in the store can be
deleted arbitrarily, while registered paths can only be deleted
by running the garbage collector. */
Transaction txn;
createStoreTransaction(txn);
for (PathSet::iterator i = expr.derivation.outputs.begin();
i != expr.derivation.outputs.end(); ++i)
registerValidPath(txn, *i);
registerSuccessor(txn, nePath, nfPath);
txn.commit();
/* It is now safe to delete the lock files, since all future
lockers will see the successor; they will not create new lock
files with the same names as the old (unlinked) lock files. */
outputLocks.setDeletion(true);
}
void NormalisationGoal::openLogFile()
{
/* Create a log file. */
Path logFileName = nixLogDir + "/" + baseNameOf(nePath);
fdLogFile = open(logFileName.c_str(),
O_CREAT | O_WRONLY | O_TRUNC, 0666);
if (fdLogFile == -1)
throw SysError(format("creating log file `%1%'") % logFileName);
/* Create a pipe to get the output of the child. */
logPipe.create();
}
void NormalisationGoal::initChild()
{
commonChildInit(logPipe);
if (chdir(tmpDir.c_str()) == -1)
throw SysError(format("changing into to `%1%'") % tmpDir);
/* When running a hook, dup the communication pipes. */
bool inHook = fromHook.writeSide.isOpen();
if (inHook) {
fromHook.readSide.close();
if (dup2(fromHook.writeSide, 3) == -1)
throw SysError("dup1");
toHook.writeSide.close();
if (dup2(toHook.readSide, 4) == -1)
throw SysError("dup2");
}
/* Close all other file descriptors. */
int maxFD = 0;
maxFD = sysconf(_SC_OPEN_MAX);
for (int fd = 0; fd < maxFD; ++fd)
if (fd != STDIN_FILENO && fd != STDOUT_FILENO && fd != STDERR_FILENO
&& (!inHook || (fd != 3 && fd != 4)))
close(fd); /* ignore result */
}
void NormalisationGoal::deleteTmpDir(bool force)
{
if (tmpDir != "") {
if (keepFailed && !force)
printMsg(lvlError,
format("builder for `%1%' failed; keeping build directory `%2%'")
% nePath % tmpDir);
else
deletePath(tmpDir);
tmpDir = "";
}
}
void NormalisationGoal::trace(const format & f)
{
debug(format("normalisation of `%1%': %2%") % nePath % f);
}
//////////////////////////////////////////////////////////////////////
class RealisationGoal : public Goal
{
private:
/* The path of the closure store expression. */
Path nePath;
/* The store expression stored at nePath. */
StoreExpr expr;
typedef void (RealisationGoal::*GoalState)();
GoalState state;
public:
RealisationGoal(const Path & _nePath, Worker & _worker);
~RealisationGoal();
void work();
/* The states. */
void init();
void haveStoreExpr();
void elemFinished();
void trace(const format & f);
};
RealisationGoal::RealisationGoal(const Path & _nePath, Worker & _worker)
: Goal(_worker)
{
nePath = _nePath;
state = &RealisationGoal::init;
}
RealisationGoal::~RealisationGoal()
{
}
void RealisationGoal::work()
{
(this->*state)();
}
void RealisationGoal::init()
{
trace("init");
/* The first thing to do is to make sure that the store expression
exists. If it doesn't, it may be created through a
substitute. */
nrWaitees = 1;
worker.addSubstitutionGoal(nePath, shared_from_this());
state = &RealisationGoal::haveStoreExpr;
}
void RealisationGoal::haveStoreExpr()
{
trace("loading store expression");
assert(isValidPath(nePath));
/* Get the store expression. */
expr = storeExprFromPath(nePath);
/* If this is a normal form (i.e., a closure) we are also done. */
if (expr.type != StoreExpr::neClosure)
throw Error(format("expected closure in `%1%'") % nePath);
/* Each path in the closure should exist, or should be creatable
through a substitute. */
for (ClosureElems::const_iterator i = expr.closure.elems.begin();
i != expr.closure.elems.end(); ++i)
worker.addSubstitutionGoal(i->first, shared_from_this());
nrWaitees = expr.closure.elems.size();
state = &RealisationGoal::elemFinished;
}
void RealisationGoal::elemFinished()
{
trace("all closure elements present");
amDone();
}
void RealisationGoal::trace(const format & f)
{
debug(format("realisation of `%1%': %2%") % nePath % f);
}
//////////////////////////////////////////////////////////////////////
class SubstitutionGoal : public Goal
{
private:
/* The store path that should be realised through a substitute. */
Path storePath;
/* The remaining substitutes for this path. */
Substitutes subs;
/* The current substitute. */
Substitute sub;
/* The normal form of the substitute store expression. */
Path nfSub;
/* Pipe for the substitute's standard output/error. */
Pipe logPipe;
/* The process ID of the builder. */
Pid pid;
/* Lock on the store path. */
PathLocks outputLock;
typedef void (SubstitutionGoal::*GoalState)();
GoalState state;
public:
SubstitutionGoal(const Path & _nePath, Worker & _worker);
void work();
/* The states. */
void init();
void tryNext();
void exprNormalised();
void exprRealised();
void tryToRun();
void finished();
void trace(const format & f);
};
SubstitutionGoal::SubstitutionGoal(const Path & _storePath, Worker & _worker)
: Goal(_worker)
{
storePath = _storePath;
state = &SubstitutionGoal::init;
}
void SubstitutionGoal::work()
{
(this->*state)();
}
void SubstitutionGoal::init()
{
trace("init");
/* If the path already exists we're done. */
if (isValidPath(storePath)) {
amDone();
return;
}
/* Otherwise, get the substitutes. */
subs = querySubstitutes(storePath);
/* Try the first one. */
tryNext();
}
void SubstitutionGoal::tryNext()
{
trace("trying next substitute");
if (subs.size() == 0) throw Error(
format("path `%1%' is required, but it has no (remaining) substitutes")
% storePath);
sub = subs.front();
subs.pop_front();
/* Normalise the substitute store expression. */
worker.addNormalisationGoal(sub.storeExpr, shared_from_this());
nrWaitees = 1;
state = &SubstitutionGoal::exprNormalised;
}
void SubstitutionGoal::exprNormalised()
{
trace("substitute store expression normalised");
/* Realise the substitute store expression. */
if (!querySuccessor(sub.storeExpr, nfSub))
nfSub = sub.storeExpr;
worker.addRealisationGoal(nfSub, shared_from_this());
nrWaitees = 1;
state = &SubstitutionGoal::exprRealised;
}
void SubstitutionGoal::exprRealised()
{
trace("substitute store expression realised");
state = &SubstitutionGoal::tryToRun;
worker.waitForBuildSlot(shared_from_this());
}
void SubstitutionGoal::tryToRun()
{
trace("trying to run");
/* Make sure that we are allowed to start a build. */
if (!worker.canBuildMore()) {
worker.waitForBuildSlot(shared_from_this());
return;
}
/* Acquire a lock on the output path. */
PathSet lockPath;
lockPath.insert(storePath);
outputLock.lockPaths(lockPath);
/* Check again whether the path is invalid. */
if (isValidPath(storePath)) {
debug(format("store path `%1%' has become valid") % storePath);
outputLock.setDeletion(true);
amDone();
return;
}
startNest(nest, lvlInfo,
format("substituting path `%1%'") % storePath);
/* What's the substitute program? */
StoreExpr expr = storeExprFromPath(nfSub);
assert(expr.type == StoreExpr::neClosure);
assert(!expr.closure.roots.empty());
Path program =
canonPath(*expr.closure.roots.begin() + "/" + sub.program);
logPipe.create();
/* Remove the (stale) output path if it exists. */
if (pathExists(storePath))
deletePath(storePath);
/* Fork the substitute program. */
pid = fork();
switch (pid) {
case -1:
throw SysError("unable to fork");
case 0:
try { /* child */
logPipe.readSide.close();
/* !!! close other handles */
commonChildInit(logPipe);
/* Fill in the arguments. */
Strings args(sub.args);
args.push_front(storePath);
args.push_front(baseNameOf(program));
const char * * argArr = strings2CharPtrs(args);
execv(program.c_str(), (char * *) argArr);
throw SysError(format("executing `%1%'") % program);
} catch (exception & e) {
cerr << format("substitute error: %1%\n") % e.what();
}
_exit(1);
}
/* parent */
pid.setSeparatePG(true);
logPipe.writeSide.close();
worker.childStarted(shared_from_this(),
pid, logPipe.readSide, true);
state = &SubstitutionGoal::finished;
}
void SubstitutionGoal::finished()
{
trace("substitute finished");
/* Since we got an EOF on the logger pipe, the substitute is
presumed to have terminated. */
/* !!! this could block! */
pid_t savedPid = pid;
int status = pid.wait(true);
/* So the child is gone now. */
worker.childTerminated(savedPid);
/* Close the read side of the logger pipe. */
logPipe.readSide.close();
debug(format("substitute for `%1%' finished") % storePath);
/* Check the exit status. */
if (!statusOk(status))
throw Error(format("builder for `%1%' %2%")
% storePath % statusToString(status));
if (!pathExists(storePath))
throw Error(format("substitute did not produce path `%1%'") % storePath);
Transaction txn;
createStoreTransaction(txn);
registerValidPath(txn, storePath);
txn.commit();
outputLock.setDeletion(true);
amDone();
}
void SubstitutionGoal::trace(const format & f)
{
debug(format("substitution of `%1%': %2%") % storePath % f);
}
//////////////////////////////////////////////////////////////////////
static bool working = false;
Worker::Worker()
{
/* Debugging: prevent recursive workers. */
if (working) abort();
working = true;
nrChildren = 0;
}
Worker::~Worker()
{
working = false;
}
template<class T>
static void addGoal(const Path & path, GoalPtr waiter,
Worker & worker, Goals & goals,
GoalMap & goalMap, GoalMapRev & goalMapRev)
{
GoalPtr goal;
goal = goalMap[path];
if (!goal) {
goal = GoalPtr(new T(path, worker));
goals.insert(goal);
goalMap[path] = goal;
goalMapRev[goal] = path;
worker.wakeUp(goal);
}
if (waiter) goal->addWaiter(waiter);
}
void Worker::addNormalisationGoal(const Path & nePath, GoalPtr waiter)
{
addGoal<NormalisationGoal>(nePath, waiter, *this, goals,
normalisationGoals, normalisationGoalsRev);
}
void Worker::addRealisationGoal(const Path & nePath, GoalPtr waiter)
{
addGoal<RealisationGoal>(nePath, waiter, *this, goals,
realisationGoals, realisationGoalsRev);
}
void Worker::addSubstitutionGoal(const Path & storePath, GoalPtr waiter)
{
addGoal<SubstitutionGoal>(storePath, waiter, *this, goals,
substitutionGoals, substitutionGoalsRev);
}
static void removeGoal(GoalPtr goal,
GoalMap & goalMap, GoalMapRev & goalMapRev)
{
GoalMapRev::iterator i = goalMapRev.find(goal);
if (i != goalMapRev.end()) {
goalMapRev.erase(i);
goalMap.erase(i->second);
}
}
void Worker::removeGoal(GoalPtr goal)
{
goals.erase(goal);
::removeGoal(goal, normalisationGoals, normalisationGoalsRev);
::removeGoal(goal, realisationGoals, realisationGoalsRev);
::removeGoal(goal, substitutionGoals, substitutionGoalsRev);
}
void Worker::wakeUp(GoalPtr goal)
{
printMsg(lvlVomit, "wake up");
awake.insert(goal);
}
bool Worker::canBuildMore()
{
return nrChildren < maxBuildJobs;
}
void Worker::childStarted(GoalPtr goal,
pid_t pid, int fdOutput, bool inBuildSlot)
{
Child child;
child.goal = goal;
child.fdOutput = fdOutput;
child.inBuildSlot = inBuildSlot;
children[pid] = child;
if (inBuildSlot) nrChildren++;
}
void Worker::childTerminated(pid_t pid)
{
Children::iterator i = children.find(pid);
assert(i != children.end());
if (i->second.inBuildSlot) {
assert(nrChildren > 0);
nrChildren--;
}
children.erase(pid);
/* Wake up goals waiting for a build slot. */
for (Goals::iterator i = wantingToBuild.begin();
i != wantingToBuild.end(); ++i)
wakeUp(*i);
wantingToBuild.clear();
}
void Worker::waitForBuildSlot(GoalPtr goal)
{
debug("wait for build slot");
if (canBuildMore())
wakeUp(goal); /* we can do it right away */
else
wantingToBuild.insert(goal);
}
void Worker::run()
{
startNest(nest, lvlDebug, format("entered goal loop"));
while (1) {
checkInterrupt();
/* Call every wake goal. */
while (!awake.empty()) {
Goals awake2(awake); /* !!! why is this necessary? */
awake.clear();
for (Goals::iterator i = awake2.begin(); i != awake2.end(); ++i) {
printMsg(lvlVomit,
format("running goal (%1% left)") % goals.size());
checkInterrupt();
GoalPtr goal = *i;
goal->work();
}
}
if (goals.empty()) break;
/* !!! not when we're polling */
assert(!children.empty());
/* Wait for input. */
waitForInput();
}
assert(awake.empty());
assert(wantingToBuild.empty());
assert(children.empty());
}
void Worker::waitForInput()
{
printMsg(lvlVomit, "waiting for children");
/* Process log output from the children. We also use this to
detect child termination: if we get EOF on the logger pipe of a
build, we assume that the builder has terminated. */
/* Use select() to wait for the input side of any logger pipe to
become `available'. Note that `available' (i.e., non-blocking)
includes EOF. */
fd_set fds;
FD_ZERO(&fds);
int fdMax = 0;
for (Children::iterator i = children.begin();
i != children.end(); ++i)
{
int fd = i->second.fdOutput;
FD_SET(fd, &fds);
if (fd >= fdMax) fdMax = fd + 1;
}
if (select(fdMax, &fds, 0, 0, 0) == -1) {
if (errno == EINTR) return;
throw SysError("waiting for input");
}
/* Process all available file descriptors. */
for (Children::iterator i = children.begin();
i != children.end(); ++i)
{
checkInterrupt();
GoalPtr goal = i->second.goal;
int fd = i->second.fdOutput;
if (FD_ISSET(fd, &fds)) {
unsigned char buffer[4096];
ssize_t rd = read(fd, buffer, sizeof(buffer));
if (rd == -1) {
if (errno != EINTR)
throw SysError(format("reading from `%1%'")
% goal->name());
} else if (rd == 0) {
debug(format("EOF on `%1%'") % goal->name());
wakeUp(goal);
} else {
printMsg(lvlVomit, format("read %1% bytes from `%2%'")
% rd % goal->name());
// writeFull(goal.fdLogFile, buffer, rd);
if (verbosity >= buildVerbosity)
writeFull(STDERR_FILENO, buffer, rd);
}
}
}
}
//////////////////////////////////////////////////////////////////////
Path normaliseStoreExpr(const Path & nePath)
{
startNest(nest, lvlDebug, format("normalising `%1%'") % nePath);
Worker worker;
worker.addNormalisationGoal(nePath, GoalPtr());
worker.run();
Path nfPath;
if (!querySuccessor(nePath, nfPath))
throw Error("there should be a successor");
return nfPath;
}
void realiseClosure(const Path & nePath)
{
startNest(nest, lvlDebug, format("realising closure `%1%'") % nePath);
Worker worker;
worker.addRealisationGoal(nePath, GoalPtr());
worker.run();
}
void ensurePath(const Path & path)
{
/* If the path is already valid, we're done. */
if (isValidPath(path)) return;
Worker worker;
worker.addSubstitutionGoal(path, GoalPtr());
worker.run();
}
|