DIRECTORY Basics, CedarProcess, FSBackdoor, IO, MakeDo, MakeDoPrivate, Process, RedBlackTree, Rope; MakeDoUpNodes: CEDAR MONITOR LOCKS n.up USING n: Node IMPORTS CedarProcess, FSBackdoor, IO, MakeDo, MakeDoPrivate, RedBlackTree EXPORTS MakeDo, MakeDoPrivate = BEGIN OPEN MakeDo, MakeDoPrivate; NodeRep: PUBLIC TYPE = MakeDoPrivate.NodeRep; CommandRep: PUBLIC TYPE = MakeDoPrivate.CommandRep; GetCreated: PUBLIC ENTRY PROC [n: Node] RETURNS [t: Time] = { ENABLE UNWIND => {}; t _ InnerGetCreated[n]; }; InnerGetCreated: INTERNAL PROC [n: Node] RETURNS [t: Time] = { IF NOT n.timeValid THEN { IF n.forceNotExist THEN ERROR; n.created _ n.class.GetTime[n]; n.timeValid _ TRUE; IF debugging THEN { IF n.created # notExistTime THEN Log[0, "Created[%g]=%g", IO.rope[n.name], IO.time[n.created]] ELSE Log[0, "Created[%g]=never", IO.rope[n.name]]; }; }; t _ n.created; }; SuspectNodeChange: PUBLIC PROC [n: Node, stack: Table] = {ReallySuspectNodeChange[n, leaveNotExist, stack]}; ReallySuspectNodeChange: PUBLIC PROC [n: Node, op: NTOp, stack: Table] = { InnerReset: INTERNAL PROC [n: Node] = { ENABLE UNWIND => {}; SELECT op FROM unforceNotExist => n.forceNotExist _ n.timeValid _ FALSE; forceNotExist => { n.timeValid _ n.forceNotExist _ TRUE; n.created _ notExistTime; IF debugging THEN Log[0, "Created[%g] forced never", IO.rope[n.name]]; }; leaveNotExist => IF NOT n.forceNotExist THEN n.timeValid _ FALSE ELSE IF NOT n.timeValid THEN ERROR; ENDCASE => ERROR; }; Inner: ENTRY PROC [n: Node] = { ENABLE UNWIND => {}; For: INTERNAL PROC [which: CmdDep] = { created: Time _ InnerGetCreated[n]; FOR e: Edge _ n.to[which].first, e.nNext WHILE e # NIL DO IF e.n # n THEN ERROR; IF created # e.traverseCreated THEN { CmdMayNeedRemaking[e.c, which, stack]; }; ENDLOOP; which _ which; }; InnerReset[n]; For[cmd]; For[data]; }; IF debugging THEN Log[0, "%g may have changed", IO.rope[n.name]]; IF stack.Lookup[n] # NIL THEN RETURN; stack.Insert[n, n]; Inner[n !UNWIND => [] _ stack.Delete[n]]; [] _ stack.Delete[n]; }; NodeMayNeedRemaking: PUBLIC PROC [n: Node, stack: Table] = { Inner: ENTRY PROC [n: Node] = { ENABLE UNWIND => {}; For: INTERNAL PROC [which: CmdDep] = { which _ which; FOR e: Edge _ n.to[which].first, e.nNext WHILE e # NIL DO IF e.n # n THEN ERROR; CmdMayNeedRemaking[e.c, which, stack]; ENDLOOP; which _ which; }; IF n.suspect THEN RETURN; n.suspect _ TRUE; IF debugging THEN Log[0, "%g may need remaking", IO.rope[n.name]]; For[cmd]; For[data]; }; IF stack.Lookup[n] # NIL THEN RETURN; stack.Insert[n, n]; Inner[n !UNWIND => [] _ stack.Delete[n]]; [] _ stack.Delete[n]; }; EnumerateConsumers: PUBLIC ENTRY PROC [n: Node, which: CmdDep, to: PROC [Command, CmdDep]] = { x: BOOL _ FALSE; x _ x; FOR e: Edge _ n.to[which].first, e.nNext WHILE e # NIL DO to[e.c, which]; ENDLOOP; x _ x; }; EnumerateConsumerEdges: PUBLIC ENTRY PROC [n: Node, which: CmdDep, to: PROC [Edge, CmdDep]] = { x: BOOL _ FALSE; x _ x; FOR e: Edge _ n.to[which].first, e.nNext WHILE e # NIL DO to[e, which]; ENDLOOP; x _ x; }; UnlinkToFrom: PUBLIC PROC [e: Edge--on n.to=c.from--, which: CmdDep] = { Inner: ENTRY PROC [n: Node] = { ENABLE UNWIND => ERROR; IF e.n # n THEN ERROR; IF e.nNext # NIL THEN e.nNext.nPrev _ e.nPrev ELSE SELECT which FROM cmd => n.to[cmd].last _ e.nPrev; data => n.to[data].last _ e.nPrev; ENDCASE => ERROR; IF e.nPrev # NIL THEN e.nPrev.nNext _ e.nNext ELSE SELECT which FROM cmd => n.to[cmd].first _ e.nNext; data => n.to[data].first _ e.nNext; ENDCASE => ERROR; e.nNext _ e.nPrev _ NIL; }; Inner[e.n]; }; ShouldRemakeNode: PUBLIC ENTRY PROC [n: Node, callerPromisesToDoIt: BOOL] RETURNS [suspect: BOOL] = { ENABLE UNWIND => {}; IF (suspect _ n.suspect) AND callerPromisesToDoIt THEN n.suspect _ FALSE; }; fsWatchEnabled: BOOL _ TRUE; WatchFS: PROC [REF ANY] RETURNS [REF ANY _ NIL] = { ce: REF READONLY FSBackdoor.CreateEvent _ NIL; stack: Table _ NewRefTable[]; WHILE fsWatchEnabled DO ce _ FSBackdoor.NextCreateEvent[ce]; {ENABLE ABORTED => CONTINUE; n: Node _ GetNode[ce.fName, fileClass, FALSE]; IF n # NIL THEN { IF stack.Size[] # 0 THEN { out: IO.STREAM = GetCommanderHandle[].out; out.PutRope["Filesystem watcher recovering.\n"]; stack.DestroyTable[]; }; SuspectNodeChange[n, stack]; }; }; ENDLOOP; ce _ ce; }; watcher: CedarProcess.Process; Start: PROC = { watcher _ CedarProcess.Fork[action: WatchFS, options: [inheritProperties: TRUE]]; }; Start[]; END. گMakeDoUpNodes.Mesa Last Edited by: Spreitzer, September 3, 1985 2:52:58 pm PDT INVARIANT Data described in MakeDoPrivate are consistent. ‌تم– "cedar" styleکcode™J™;—KکKڑدk œ#‌œ5کcKکڑذbx œ‌œ‌کKڑ‌œ‌œکKڑ‌œ‌œ%کIKڑ‌œکKڑœک™ Jڑœ/™/——KکKڑ‌œ‌œک!KکKڑœ ‌œ‌œک-Kڑœ‌œ‌œک3Kکڑ دn œ‌œ‌œ‌œ‌œک=Kڑ‌œ‌œکKڑœکKڑœک—Kکڑںœ‌œ‌œ‌œک>ڑ‌œ‌œ ‌œکKڑ‌œ‌œ‌œکKکKڑœ‌œکڑ‌œ‌œکڑ‌œکKڑ‌œ‌œ‌œکBKڑ‌œ‌œک2—Kک—Kڑœک—KڑœکKک—Kکڑںœ‌œ‌œک8Kڑœ3ک3—Kکڑںœ‌œ‌œ&کJڑں œ‌œ‌œک'Kڑ‌œ‌œکڑ‌œ‌کKڑœ3‌œک9ڑœکKڑœ ‌œک%KڑœکKڑ‌œ‌œ$‌œکFKڑœک—ڑœ‌œ‌œک'Kڑ‌œ‌کKڑ ‌œ‌œ‌œ ‌œ‌œک#—Kڑ‌œ‌œک—Kک—ڑںœ‌œ‌œکKڑ‌œ‌œکڑںœ‌œ‌œک&Kک#ڑ‌œ&‌œ‌œ‌ک9Kڑ‌œ ‌œ‌œکڑ‌œ‌œک%Kڑœ&ک&Kک—Kڑ‌œک—KڑœکKک—KکKک Kک Kک—Kڑ‌œ‌œ‌œکAKڑ‌œ‌œ‌œ‌œک%KکKڑœ ‌œک)KکKک—Kکڑںœ‌œ‌œک<ڑںœ‌œ‌œکKڑ‌œ‌œکڑںœ‌œ‌œک&Kڑœکڑ‌œ&‌œ‌œ‌ک9Kڑ‌œ ‌œ‌œکKک&Kڑ‌œک—KڑœکKک—Jڑ‌œ‌œ‌œکJڑœ‌œکKڑ‌œ‌œ ‌œکBJک Jک Kک—Kڑ‌œ‌œ‌œ‌œک%KکKڑœ ‌œک)KکKک—Kکڑ ںœ‌œ‌œ‌œ‌œک^Kڑœ‌œ‌œکKڑœکڑ‌œ&‌œ‌œ‌ک9KکKڑ‌œک—KڑœکKک—Kکڑ ںœ‌œ‌œ‌œ‌œک_Kڑœ‌œ‌œکKڑœکڑ‌œ&‌œ‌œ‌ک9Kک Kڑ‌œک—KڑœکKک—Kکڑںœ‌œ‌œ دcœکHڑںœ‌œ‌œکKڑ‌œ‌œ‌œکKڑ‌œ ‌œ‌œکKڑ‌œ‌œ‌œ‌œ‌œ‌œE‌œ‌œکڑKڑ‌œ‌œ‌œ‌œ‌œ‌œG‌œ‌œکœKڑœ‌œکKک—KکKک—Kکڑںœ‌œ‌œ‌œ!‌œ‌œ‌œکeKڑ‌œ‌œکKڑ‌œ‌œ‌œ ‌œکIKک—KکKڑœ‌œ‌œکKکڑںœ‌œ‌œ‌œ‌œ‌œ‌œ‌œک3Kڑœ‌œ‌œ‌œک.Kڑœکڑ‌œ‌کKک$Kڑœ‌œ‌œ‌œکKڑœ'‌œک.ڑ‌œ‌œ‌œکڑ‌œ‌œکKڑœ‌œ‌œک*Kک0KکKک—KڑœکKڑœک—KکKڑ‌œک—KکKک—KکKڑœکKکڑںœ‌œکKڑœJ‌œکQKک—KکKکKکKڑ‌œک—…—(›