
DIRECTORY
BasicTime USING [GMT, nullGMT],
Commander USING [Handle],
IO USING [STREAM],
List USING [AList],
RefTab USING [Ref],
Rope USING [ROPE];

MakeDo: CEDAR DEFINITIONS =

BEGIN

ROPE: TYPE = Rope.ROPE;
RopeList: TYPE = LIST OF ROPE;
RefTable: TYPE = RefTab.Ref;
PropList: TYPE = List.AList;
Time: TYPE = BasicTime.GMT;
notExistTime: Time = BasicTime.nullGMT;
unknownTime: Time = LOOPHOLE[FIRST[LONG CARDINAL]];
NodeList: TYPE = LIST OF Node;
Node: TYPE = REF NodeRep; NodeRep: TYPE;
ActionList: TYPE = LIST OF Action;
Action: TYPE = REF ActionRep; ActionRep: TYPE;

Warning: SIGNAL [message: ROPE];

IsNode: PROC [REF ANY] RETURNS [BOOL];
NarrowToNode: PROC [REF ANY] RETURNS [Node];
IsAction: PROC [REF ANY] RETURNS [BOOL];
NarrowToAction: PROC [REF ANY] RETURNS [Action];

existsFSWatch: READONLY BOOL;
Ensure: PROC [goals: RefTable, modifiabilitySpec: ModifiabilitySpec, supportFiles: RefTable, PerMissedSupportFile: PROC [Node], parent: Commander.Handle] RETURNS [okGoalCount, nonOKGoalCount, nSteps: NAT, failedSteps: ActionList, nonOKGoalList: NodeList];

ModifiabilitySpec: TYPE = RefTable;

Modifiability: TYPE = {yes, guess, no, uninitialized};

Explain: PROC [ch: Commander.Handle, nodes: RefTable];

GetActions: PROC [goals: RefTable, modifiabilitySpec: ModifiabilitySpec, report: ReportSpec, neededLeaves, optionalLeaves, determiningLeaves, brokenGoals: RefTable м NIL] RETURNS [actions: ActionList];

ReportSpec: TYPE = {none, toBeDone, all};
DestructivelyReverseActionList: PROC [ActionList] RETURNS [ActionList];

Verify: PROC [pkgList: LIST OF ROPE];

SuspectNodeChange: PROC [n: Node];
SuspectNodesChange: PROC [RefTable];
UncurrentNode: PROC [n: Node];
UncurrentNodes: PROC [RefTable];
UncurrentProducer: PROC [n: Node];
UncurrentProducers: PROC [RefTable];
ForAll: PROC [suspectChange, uncurrent: BOOL];
DestroyGraph: PROC;
RetryToProduce: PROC [Node];

MakeRefTable: PROC RETURNS [table: RefTable];
AddToRefTable: PROC [ra: REF ANY, t: RefTable];
EnsureRefInTable: PROC [ra: REF ANY, t: RefTable];
DeleteFromRefTable: PROC [ra: REF ANY, t: RefTable] RETURNS [found: BOOL];
RefInTable: PROC [ra: REF ANY, t: RefTable] RETURNS [BOOL];
ScanRefTable: PROC [table: RefTable, EachNode: PROC [REF ANY] RETURNS [stop: BOOL м FALSE]];
EnumerateNodes: PROC[table: RefTable, EachNode: PROC [Node]];


AnalyzeDFFile: PROC [dfName: ROPE, goals, supportFiles: RefTable, modifiable: ModifiabilitySpec, doToVerifyGoals, doToOtherOwns, doToImports: DoToFile];
DoToFile: TYPE = {ignore, makeGoal, makeModifiable, makeSupport};

FindNode: PROC [someName: ROPE, class: NodeClass] RETURNS [node: Node];

LookupNodeClass: PROC [className: ROPE] RETURNS [class: NodeClass];
ForkParms: TYPE ~ REF ForkParmsRep; ForkParmsRep: TYPE;
ForkParmsFromStream: PROC [in: IO.STREAM] RETURNS [ForkParms];
GetForkParms: PROC RETURNS [ForkParms];
SetForkParms: PROC [ForkParms];
ForkParmsFromProfile: PROC RETURNS [ForkParms];
AddFinder: PROC [finder: Finder, end: End];
End: TYPE = {front, back};

Finder: TYPE = RECORD [name: ROPE, finderProc: FinderProc, finderData: REF ANY м NIL];

FinderProc: TYPE = PROC [resultName: ROPE, finderData: REF ANY] RETURNS [found: BOOLEAN, sought: Node, makes, cmdFrom: NodeList, from: From, cmd: ROPE, class: ActionClass, foundData: REF ANY];

From: TYPE = RECORD [mustHave, optional: NodeList];

ActionClass: TYPE = REF ActionClassRep;
ActionClassRep: TYPE = RECORD [
CheckConsistency: ConsistencyChecker,
Rederive: RederiveProc,
EnumHiddenDeps: HiddenDependencyEnumerator м NIL,
ClearCaches: ClearCachesProc м NIL,
classData: REF ANY м NIL];

ConsistencyChecker: TYPE = PROC [a: Action, result: Node] RETURNS [consistent: BOOL, reason: ROPE];

RederiveProc: TYPE = PROC [a: Action] RETURNS [from: From, cmd: ROPE];

HiddenDependencyEnumerator: TYPE ~ PROC [a: Action, Consume: PROC [Node]];

ClearCachesProc: TYPE ~ PROC [ac: ActionClass];

GetNode: PROC [someName: ROPE, class: NodeClass, mayAdd: BOOL м TRUE] RETURNS [node: Node];

NodeClass: TYPE = REF NodeClassRep;
NodeClassRep: TYPE;

IsNodeClass: PROC [REF ANY] RETURNS [BOOL];
NarrowToNodeClass: PROC [REF ANY] RETURNS [NodeClass];

DeclareNodeClass:
PROC [
name: ROPE,
CanonizeName: PROC [ROPE] RETURNS [ROPE],
GetInfo: GetInfoProc
]
RETURNS [nodeClass: NodeClass];

GetInfoProc: TYPE = PROC [n: Node] RETURNS [created: Time, length: INT];
fileClass: NodeClass;

PublicPartsOfNode: PROC [n: Node] RETURNS [name: ROPE, class: NodeClass];
PublicPartsOfNodeClass: PROC [nc: NodeClass] RETURNS [name: ROPE, CanonizeName: PROC [ROPE] RETURNS [ROPE], GetInfo: GetInfoProc];
DescribeNode: PROC [n: Node] RETURNS [ROPE];
GetProp: PROC [n: Node, prop: REF ANY] RETURNS [val: REF ANY];
SetProp: PROC [n: Node, prop, val: REF ANY];
GetProducer: PROC [n: Node] RETURNS [producer: Action];
InnerGetInfo: GetInfoProc;
InnerGetCreated: PROC [n: Node] RETURNS [t: Time];
InnerExists: PROC [n: Node, zeroLenExists: BOOL _ TRUE] RETURNS [exists: BOOL];

PublicPartsOfAction: PROC [a: Action] RETURNS [cmd: ROPE, foundData: REF ANY, class: ActionClass];
InnerEnumerateSources: PROC [a: Action, which: ActionDep, to: PROC [n: Node, which: ActionDep, optional: BOOL]];

ActionDep: TYPE = {cmd, data};

FmtTime: PROC [Time] RETURNS [ROPE];

GetCreated: PROC [n: Node] RETURNS [t: Time];
GetInfo: GetInfoProc;
Exists: PROC [n: Node, zeroLenExists: BOOL _ TRUE] RETURNS [exists: BOOL];
EnumerateConsumers: PROC [n: Node, which: ActionDep, to: PROC [Action, ActionDep]];
EnumerateResults: PROC [a: Action, to: PROC [Node]];
EnumerateSources: PROC [a: Action, which: ActionDep, to: PROC [n: Node, which: ActionDep, optional: BOOL]];

END.
  ░  
MakeDo.Mesa
Copyright ╙ 1991 by Xerox Corporation.  All rights reserved.
Last Edited by: Spreitzer, May 9, 1986 8:37:53 pm PDT
Eduardo Pelegri-Llopart November 18, 1988 8:49:52 am PST
Last tweaked by Mike Spreitzer on October 6, 1992 11:03 am PDT
Carl Hauser, April 11, 1985 3:34:27 pm PST
New Types & Stuff:
For deriving dependecies and ensuring consistency:
Ensure that given goal nodes are current.
If supportFiles is non-nil, every leaf file node that the goals recursively depend on and that wasn't already in supportFiles is added and passed to PerMissedSupportFile (if given).
NIL means guess, #NIL means modifiable iff in Table.
List edges of the nodes, and give status of their producers.
Recursively explores graph to leaves.
Returns some actions, according to report.
The order of those actions is: actions to do later appear earlier.
It is recommended that you not try to interrupt the following:
If it has no producer (other than leaf), try (again) to get one.
class may not be NIL.
For controlling concurrency:
ForkParms is dependent on the target system
For Stating dependency rules:
Missing inputs necessitate any result being consistent; but then, this won't be called if there are missing inputs.
Called when one of the action's determiners changes.
When destroying the entire dependency graph, this PROC is also called to clear any caches the ActionClass may be keeping.
class may not be NIL.
name will first be canonized.
= {exists _ (created # notExistTime) AND (zeroLenExists OR length#0)}
Should only be used from inside ActionClass procs only when called from MakeDo impl.
For Extracting the Dependency Graph:
= {exists _ (created # notExistTime) AND (zeroLenExists OR length#0)}
 Э╩	  ХNewlineDelimiter
Ц(cedarcode) styleЩ codeЩKЪЬ
╧eЬ1Щ<JЩ5KЩ8KЩ>KЩ*ЧKШ Ъ╧k	Ш	KЪЬ
ЮЬЮЬШKЪЬ
ЮЬ
ШKЪЮЬЮЬЮЬШKЪЬЮЬ	ШKЪЬЮЬШKЪЬЮЬЮЬШЧKШ KЪ╨bxЬЮЬЮЬШKШ KЪЮШKШ KЪЮЬЮЬЮЬШKЪ	Ь
ЮЬЮЬЮЬЮЬШKЪЬ
ЮЬШKЪЬ
ЮЬШKЪЬЮЬЮЬШKШ'KЪ	ЬЮЬЮЬЮЬЮЬШ3headЩKЪЬ
ЮЬЮЬЮЬШKЪЬЮЬЮЬЮЬШ(KЪЬЮЬЮЬЮЬШ"KЪЬЮЬЮЬЮЬШ.KШ KЪ╨blЬЮЬЮЬШ KШ KЪ╧nЬЮЬЮЬЮЬЮЬЮЬШ&KЪ
бЬЮЬЮЬЮЬЮЬШ,KЪбЬЮЬЮЬЮЬЮЬЮЬШ(KЪ
бЬЮЬЮЬЮЬЮЬ
Ш0KШ KЪЬЮЬЮЬШЧЩ2ЪбЬЮЬQбЬЮЬ#ЮЬ'ЮЬ4Ш KЪЬ)Щ)KЪЬЭЬbЭЬ8Щ╡ЧKШ ЪЬЮЬШ#KЩ4ЧKШ KЪЬЮЬ#Ш6KШ ЪбЬЮЬ)Ш6KЩ<ЧKШ Ъб
ЬЮЬЦЮЬЮЬШ╔KЩ%KЪЬ#ЭЬЩ*KЩBKШ KЪЬЮЬШ)KЪбЬЮЬЮЬШGЧKШ KЪ
бЬЮЬЮЬЮЬЮЬШ%KШ KЩ>KЪбЬЮЬШ"KЪбЬЮЬШ$KЪбЬЮЬШKЪбЬЮЬШ KЪбЬЮЬШ"KЪбЬЮЬШ$KЪбЬЮЬЮЬШ.KЪбЬЮЬШЪбЬЮЬШKЩ@ЧKШ KЪбЬЮЬЮЬШ-KЪбЬЮЬЮЬЮЬШ/KЪбЬЮЬЮЬЮЬШ2KЪбЬЮЬЮЬЮЬЮЬ	ЮЬШJKЪб
ЬЮЬЮЬЮЬЮЬЮЬШ;KЪбЬЮЬбЬЮЬЮЬЮЬЮЬЮЬЮЬШ\KЪбЬЮЬбЬЮЬ	Ш=KШ KШ ЪбЬЮЬ
ЮЬwШШKЪЬ
ЮЬ3ШAЧKШ ЪбЬЮЬЮЬЮЬШGKЩЧKШ KЪбЬЮЬЮЬЮЬШCЧЩKЪЬЮЬЮЬЮЬШ7KЪ
бЬЮЬЮЬЮЬЮЬШ>KЪбЬЮЬЮЬШ'KЪбЬЮЬШЪбЮЬЮЬШ/KЩ+ЧЧЩKЪб	ЬЮЬШ+KЪЬЮЬШKШ KЪЬЮЬЮЬЮЬ&ЮЬЮЬЮЬШVKШ KЪб
ЬЮЬЮЬЮЬЮЬЮЬЮЬ	ЮЬ;ЮЬ!ЮЬЮЬШ└KШ KЪЬЮЬЮЬ Ш3KШ KЪЬЮЬЮЬШ'ЪЬЮЬЮЬШKЪбЬШ%KЪбЬШKЪбЬЮЬШ1KЪбЬЮЬШ#KЪЬЮЬЮЬЮЬШЧKШ ЪЬЮЬЮЬЮЬЮЬ
ЮЬШcKЩsЧKШ Ъ	ЬЮЬЮЬЮЬЮЬШFKЩ4ЧKШ KЪ	ЬЮЬЮЬбЬЮЬ	ШJKШ ЪЬЮЬЮЬШ/KЪЬyЩyKШ ЧЪбЬЮЬЮЬЮЬЮЬЮЬШ[KЩKЩЧKШ KЪЬЮЬЮЬШ#KЪЬЮЬШKШ KЪбЬЮЬЮЬЮЬЮЬЮЬШ+KЪ
бЬЮЬЮЬЮЬЮЬШ6KШ ЪбЬШЪЮЬШKЪЬЮЬШKЪ
бЬЮЬЮЬЮЬЮЬШ)KЪбЬШKЪЬШЧKЪЮЬШЧKШ KЪ
бЬЮЬЮЬЮЬЮЬШHKШKШ KЪбЬЮЬЮЬЮЬШIKЪбЬЮЬЮЬЮЬбЬЮЬЮЬЮЬЮЬбЬШВKЪбЬЮЬЮЬЮЬШ,KЪбЬЮЬЮЬЮЬЮЬЮЬЮЬШ>KЪбЬЮЬЮЬЮЬШ,KЪбЬЮЬЮЬШ7KЪбЬШKЪбЬЮЬЮЬШ2ЪбЬЮЬЮЬЮЬЮЬ
ЮЬШOKЪЬEЩEЧKШ KЪбЬЮЬЮЬЮЬЮЬЮЬШbЪбЬЮЬ#ЮЬ'ЮЬШpKЪЬTЩTЧKШ KЪЬЮЬШKШ KЪбЬЮЬЮЬЮЬШ$ЧKШ Щ$KЪб
ЬЮЬЮЬШ-KЪбЬШЪбЬЮЬЮЬЮЬЮЬ
ЮЬШJKЪЬEЩEЧKЪбЬЮЬ!ЮЬШSKЪбЬЮЬЮЬ	Ш4KЪбЬЮЬ#ЮЬ'ЮЬШkЧKШ KЪЮЬШЧ ЕЧ    р  %г  