

DIRECTORY
Basics USING [Comparison],
BasicTime USING [GMT, Now],
Commander USING [CommandProc, Handle, Register],
CommanderOps USING [Failed, NextArgument],
DFUtilities USING [IncludeItem, ParseFromStream, ProcessItemProc],
IO,
PFS,
PFSNames,
Process USING [CheckForAbort],
RedBlackTree USING [Compare, Create, EachNode, EnumerateIncreasing, GetKey, Insert, Lookup, Table],
Rope;

CompareDFwithDirImpl: CEDAR MONITOR
IMPORTS BasicTime, Commander, CommanderOps, DFUtilities, IO, PFS, PFSNames, Process, RedBlackTree, Rope

= BEGIN
ROPE: TYPE = Rope.ROPE;
STREAM: TYPE = IO.STREAM;
PATH: TYPE = PFS.PATH;

FileEntry: TYPE = REF FileEntryRep;
FileEntryRep: TYPE = RECORD [
srcName: ROPE,
status: FileEntryStatus
];
FileEntryStatus: TYPE = {dfOnly, dirOnly, both};
fileCount: ARRAY FileEntryStatus OF CARD м ALL[0];
Switches: TYPE = PACKED ARRAY CHAR['a..'z] OF BOOL;
bangH: ROPE ~ "!H";
startBangHPath: PATH ~ PFS.PathFromRope["*!H"];
DoIt: PROC[dfNameRope: ROPE, dir: ROPE, switches: Switches, out: STREAM] = {
EachEntry: RedBlackTree.EachNode = {
WITH data SELECT FROM
entry: FileEntry => {
IF entry.status # both THEN {
SELECT entry.status FROM
dfOnly => {
out.PutF1["~~dfOnly: %g\n", [rope[entry.srcName]] ];
dfOnlyCount м dfOnlyCount + 1;
};
dirOnly => {
out.PutF1["  **serverOnly: %g; ", [rope[entry.srcName]] ];
IF prev # NIL THEN out.PutF1["after %g\n", [rope[prev]] ]
ELSE out.PutRope["at beginning\n"];
dirOnlyCount м dirOnlyCount + 1;
};
ENDCASE;
};
fileCount[entry.status] м fileCount[entry.status].SUCC;
prev м entry.srcName;
Process.CheckForAbort[];
RETURN;
};
ENDCASE => ERROR;
};

VisitEntry: PROC [name: PATH] = {
new: FileEntry м NIL;
ropeName: ROPE м PFSNames.ShortNameRope[name];
Process.CheckForAbort[];
WITH RedBlackTree.Lookup[table, ropeName] SELECT FROM
entry: FileEntry => RETURN;
ENDCASE;

WITH RedBlackTree.Lookup[table, ropeName] SELECT FROM
entry: FileEntry => RETURN;
ENDCASE;
new м NEW[FileEntryRep м [
srcName: ropeName,
status: dfOnly]];
RedBlackTree.Insert[table, new, ropeName];
};

VisitClosure: PROC [dfName: PATH, visitor: PROC [name: PATH]] = {
ENABLE PFS.Error => IF ( error.code = $unknownServer ) OR
( error.code = $unknownFile ) THEN {
out.PutF["\n-- ****PFS.Error[%g], in dfFile: %g\n", [rope[error.explanation]], [rope[PFS.RopeFromPath[dfName]]] ];
};

EachItem: DFUtilities.ProcessItemProc = {
WITH item SELECT FROM
incl: REF DFUtilities.IncludeItem => {
path1: PATH м PFS.PathFromRope[incl.path1];
CheckCount[];
visitor[path1];
};
ENDCASE => { i: INT м 0; }; -- handy for setting breakpoints - (bj)
};

prefix: PATH м NIL;
in: STREAM;
in м PFS.StreamOpen[
fileName: dfName
! PFS.Error => IF error.code = $unknownFile THEN {
out.PutF["-- PFS.Error[%g] - from dfFile %g\n", [rope[error.explanation]],
[rope[PFS.RopeFromPath[dfName]]] ];
in м NIL;
inFileNotFound м TRUE;
CONTINUE;
}
ELSE REJECT
];
IF in#NIL THEN {
out.PutF["\n***** Building table from %g at %g\n", [rope[dfNameRope]], [time[BasicTime.Now[]]] ];
DFUtilities.ParseFromStream[in, EachItem -- global variable, hack for now! - (bj)
! UNWIND => in.Close[]];
in.Close[]
};
};
CheckCount: PROC ~ {
IF (count м count + 1) MOD 10 # 0 THEN RETURN;
IF count MOD 100 = 0 THEN {
out.PutF1["(%g) ", [integer[count]] ];
}
ELSE out.PutChar['.]
};


count: INT м 0;
dfOnlyCount, dirOnlyCount: INT м 0;
table: RedBlackTree.Table м RedBlackTree.Create[getKey: GetKey, compare: Compare];
inFileNotFound: BOOL м FALSE;
prev: ROPE м NIL;

VisitClosure[PFS.PathFromRope[dfNameRope.Concat[bangH]], VisitEntry];
IF inFileNotFound THEN RETURN;

ExamineDirectory[dir, table, out, switches];
out.PutF1["\n***** Examining tree at %g\n", [time[BasicTime.Now[]]] ];
RedBlackTree.EnumerateIncreasing[table, EachEntry];
IF dfOnlyCount # 0 THEN
out.PutF["\t==> %g files only in %g\n", [integer[dfOnlyCount]], [rope[dfNameRope]] ];
IF dirOnlyCount # 0 THEN
out.PutF["\t==> %g files only in %g\n", [integer[dirOnlyCount]], [rope[dir]] ];
out.PutF1["\n{Done at %g}\n", [time[BasicTime.Now[]]] ];
};

ExamineDirectory: PROC[dir: ROPE, table: RedBlackTree.Table, out: STREAM, switches: Switches] = {
CheckCount: PROC ~ {
IF (count м count + 1) MOD 10 # 0 THEN RETURN;
IF count MOD 100 = 0 THEN {
out.PutF1["(%g) ", [integer[count]] ];
}
ELSE out.PutChar['.]
};
NameInfoProc: PFS.InfoProc = {
new: FileEntry;
ropeName: ROPE;
IF fileType = PFS.tDirectory THEN RETURN;
ropeName м PFSNames.ShortNameRope[fullFName];
CheckCount[];
IF switches['p] THEN {		-- pcedar style df's
hasDash: BOOL м ( Rope.Find[ropeName, "-"] # -1 );
IF hasDash AND NOT Rope.Match["*-Suite.df", ropeName, FALSE] THEN RETURN;
};
WITH RedBlackTree.Lookup[table, ropeName] SELECT FROM
entry: FileEntry => {
entry.status м both;
RETURN;
};
ENDCASE;
new м NEW[FileEntryRep м [
srcName: ropeName,
status: dirOnly]];
RedBlackTree.Insert[table, new, ropeName];
};
count: INT м 0;
pos: INT ~ Rope.Find[dir, "*"];
out.PutF["\n\n***** Enumerating directory %g at %g\n", [rope[dir]], [time[BasicTime.Now[]]] ];
IF pos > 0 THEN
PFS.EnumerateForInfo[PFS.PathFromRope[Rope.Concat[dir, bangH]], NameInfoProc]
ELSE 
PFS.EnumerateForInfo[PFSNames.Cat[PFS.PathFromRope[dir], startBangHPath], NameInfoProc];
};

ShowTable: PROC [out: STREAM, table: RedBlackTree.Table] = {
EachEntry: RedBlackTree.EachNode = {
WITH data SELECT FROM
entry: FileEntry => ShowEntry[out, entry];
ENDCASE => ERROR;
};
RedBlackTree.EnumerateIncreasing[table, EachEntry];
};

ShowEntry: PROC [out: STREAM, entry: FileEntry] = {
IO.PutF1[out, "[name: %g, state: ", [rope[entry.srcName]] ];
SELECT entry.status FROM
dfOnly => out.PutRope["dfOnly]\n"];
dirOnly => out.PutRope["dirOnly]\n"];
both => out.PutRope["both]\n"];
ENDCASE;
};

GetKey: RedBlackTree.GetKey = {
RETURN [data];
};

Compare: RedBlackTree.Compare = {
key: ROPE м NIL;
WITH k SELECT FROM
ent: FileEntry => key м ent.srcName;
rope: ROPE => key м rope;
ENDCASE => ERROR;
WITH data SELECT FROM
ent: FileEntry => RETURN [Rope.Compare[key, ent.srcName, FALSE]];
ENDCASE;
ERROR;
};

CompareDFwithDir: Commander.CommandProc ~ {
ProcessSwitches: PROC [arg: ROPE] ~ {
sense: BOOL м TRUE;
FOR index: INT IN [0..Rope.Length[arg]) DO
char: CHAR м Rope.Fetch[arg, index];
SELECT char FROM
'- => LOOP;
'~ => {sense м NOT sense; LOOP};
IN ['a..'z] => switches[char] м sense;
IN ['A..'Z] => switches[char + ('a-'A)] м sense;
ENDCASE;
sense м TRUE;
ENDLOOP;
};
out: STREAM м cmd.out;
dfName: ROPE;
dirName: ROPE;
switches: Switches м ALL[FALSE];

DO
arg: ROPE м CommanderOps.NextArgument[cmd ! CommanderOps.Failed => { msg м errorMsg; GO TO failed } ];
ch: CHAR;
Process.CheckForAbort[];
IF arg = NIL THEN EXIT;
ch м Rope.Fetch[arg, 0];
SELECT TRUE FROM
( ch = '- ) AND ( arg.Length[] = 2 ) => ProcessSwitches[arg];	-- switch
( ch = '{ ) => LOOP;	-- ignore
( ch = '} ) => LOOP;	-- ignore
( ch = '$ ) => LOOP;	-- ignore
ENDCASE => IF dfName = NIL THEN dfName м arg ELSE dirName м arg;
ENDLOOP;

IF dfName = NIL THEN dfName м "Cedar.df";
IF dirName = NIL THEN dirName м "/Cedar/Top/";
DoIt[dfName, dirName, switches, out
! PFS.Error => {
out.PutF["-- PFS.Error[%g] - quitting.\n\t\t(at %g)\n\n", [rope[error.explanation]], [time[BasicTime.Now[]]] ];
CONTINUE;
};
];
EXITS
failed => {result м $Failure};
};


docRope: ROPE ~ "CompareDFwithDir {dfName {-p} <default Cedar.df> dirName <default /Cedar/Top/>}";
Commander.Register[ key: "CompareDFwithDir", proc: CompareDFwithDir, doc: docRope];


END.
 
    CompareDFwithDirImpl.mesa
Copyright ╙ 1991, 1992, 1993 by Xerox Corporation.  All rights reserved.
Willie-s, March 1, 1993 2:39 pm PST
Types
short name only
indicates the status of the file
Option variables
Command Procedures
[data: RedBlackTree.UserData] RETURNS [stop: BOOL _ FALSE]
called for each item in the table to do the comparing. 
explain the status of the file
The mainline of DoIt
Phase1, build up data base.
Phase2, scan directory.

Phase3, dump differences.

[data: RedBlackTree.UserData] RETURNS [stop: BOOL _ FALSE]
[data: RedBlackTree.UserData] RETURNS [RedBlackTree.Key]
[k: RedBlackTree.Key, data: RedBlackTree.UserData] RETURNS [Basics.Comparison]
When parsing the command line, be prepared for failure.  The error is reported to the user
Initialization
Э╩  Ц(cedarcode) styleХNewlineDelimiter
Ш codeЪЬЩKЪЬ
╧eЬ=ЩHKЩ#KШ ЧЪ╧k	Ш	KЪЬЮЬШKЪЬ
ЮЬЮЬШKЪЬ
ЮЬ!Ш0KЪЬЮЬШ*KЪЬЮЬ1ШBKЪЮЬШKЪЮЬШKЪЬ	Ш	KЪЬЮЬШKЪЬЮЬQШcKЪЬШЧKШ Ъ╧nЬЮЬЮШ#KЪЮЬ2ЮЬЮЬ'ШgKШ KЪЬЮШЧheadЩKЪЮЬЮЬЮЬШKЪЮЬЮЬЮЬЮЬШKЪЮЬЮЬЮЬЮЬШKШ KЪЬЮЬЮЬШ#ЪЬЮЬЮЬШЪЬ	ЮЬШKЪЬЩЧЪЬШKЩ ЧKШЧKЪЬЮЬШ0KЪ	ЬЮЬЮЬЮЬЮЬШ2KЪЬ
ЮЬЮЬЮЬЮЬ	ЮЬЮЬШ3ЧЪЬЩKЪЬЮЬШKЪЬЮЬЮЬШ/ЧЩЪ
ЯЬЮЬЮЬЮЬЮЬШLХStartOfExpansion> -- [data: RedBlackTree.UserData] RETURNS [stop: BOOL _ FALSE]Ъ╧b	ЬШ$KЪ╨ck:Щ:KЩ7ЪЮЬЮЬЮШШЪЮЬЮЬШKЩЪЮЬЮШШKШ4KШKШЧШKШ:KЪЮЬЮЬЮЬ'ЮЬШ]KШ KШЧKЪЮЬШЧKШЧKЪЬ2ЮЬШ7KШKЪЬШKЪЮЬШKШЧKЪЮЬЮЬШЧKШKШ ЧЪЯ
ЬЮЬЮЬШ!KЪЬЮЬШKЪЬ
ЮЬ Ш.KЪЬШЪЮЬ&ЮЬЮШ5KЪЬЮЬШKЪЮЬШЧKШ ЪЮЬ&ЮЬЮШ5KЪЬЮЬШKЪЮЬШЧЪЬЮЬШKЪЬШKЪЬШЧKЪЬ*Ш*KШKШ ЧЪ
ЯЬЮЬ
ЮЬЮЬЮЬШAЪ
ЮЬЮЬ
ЮЬ!ЮЬЮЬШ^KЪЬUЮЬШrKШЧKШ Ъ╨bnЬ!Ш)ЪЮЬЮЬЮШЪЬЮЬШ&KЪЬЮЬЮЬШ+KШKЪЬШKШЧKЪЮЬ	ЮЬ	╧c'ШCЧKШKШ KЪЬЮЬЮЬШKЪЬЮЬШЪЬЮЬШЪЬШЪЬЮЬ
ЮЬЮЬШ2KЪЬQЮЬШnKЪЬЮЬШ	KЪЬЮЬШKЪЮЬШ	KШЧЧKЪЮЬЮШKШЧЪЮЬЮЬЮЬШKЪЬaШaЪЬ)г(ШQKЪЬЮЬШЧKЪЬ
Ш
KЪЬШЧKШЧЪЯ
ЬЮЬШKЪЮЬЮЬЮЬЮЬШ.ЪЮЬЮЬ	ЮЬШKШ&KШKЪЮЬШЧKШKШ ЧЧKЩKШ KЪЬЮЬШKЪЬЮЬШ#KЦ@[getKey: RedBlackTree.GetKey, compare: RedBlackTree.Compare]ШRKЪЬЮЬЮЬШKЪЬЮЬЮЬШKШ KЪЬЩKЪЬЮЬ5ШEKЪЮЬЮЬЮЬШKШ KЪЬЩKШ,KЩ KЪЬЩKШFKЪЬ3Ш3KЩ ЪЮЬЮШKШUЧЪЮЬЮШKШOЧKШ8KШKШ ЧЪЯЬЮЬЮЬ"ЮЬШaЪЯ
ЬЮЬШKЪЮЬЮЬЮЬЮЬШ.ЪЮЬЮЬ	ЮЬШKШ&KШKЪЮЬШЧKШЧЪЯЬЮЬШKЪЬШKЪЬ
ЮЬШKЪЮЬЮЬЮЬЮЬШ)KЪЬ-Ш-KШЪЮЬЮЬгШ,KЪЬ	ЮЬ%Ш2KЪЮЬ	ЮЬЮЬ$ЮЬЮЬЮЬШIKШЧЪЮЬ&ЮЬЮШ5ЪЬШKЪЬШKЪЮЬШKЪЬШЧKЪЮЬШЧЪЬЮЬШKЪЬШKЪЬШЧKЪЬ*Ш*KШЧKЪЬЮЬШKЪЬЮЬШKШ^ЪЮЬ	ЮШKЪЮЬЮЬ5ШMЪЮЬШKЪЮЬЮЬ3ШXЧЧKШKШ ЧЪЯ	ЬЮЬЮЬ Ш<Ц> -- [data: RedBlackTree.UserData] RETURNS [stop: BOOL _ FALSE]ЪЬ$Ш$KЪб:Щ:ЪЮЬЮЬЮШKЪЬ*Ш*KЪЮЬЮЬШЧKШЧKЪЬ3Ш3KШKШ ЧЪЯ	ЬЮЬЮЬШ3KЪЮЬ:Ш<ЪЮЬЮШKЪЬ#Ш#KЪЬ%Ш%KЪЬШKЪЮЬШЧKШKШ ЧЦ< -- [data: RedBlackTree.UserData] RETURNS [RedBlackTree.Key]ЪЯЬШKЪб8Щ8KЪЮЬШKШKШ ЧЦR -- [k: RedBlackTree.Key, data: RedBlackTree.UserData] RETURNS [Basics.Comparison]ЪЯЬШ!KЪбNЩNKЪЬЮЬЮЬШЪЮЬЮЬЮШKЪЬ$Ш$KЪЬЮЬШKЪЮЬЮЬШЧЪЮЬЮЬЮШKЪЬЮЬ!ЮЬШAKЪЮЬШЧKЪЮЬШKШKШ ЧЪЯЬШ+ЪЯЬЮЬЮЬШ%KЪЬЮЬЮЬШЪЮЬЮЬЮЬЮШ*KЪЬЮЬШ$ЪЮЬЮШKЪЬЮЬШKЪЬЮЬЮЬШ KЪЮЬ$Ш&KЪЮЬ.Ш0KЪЮЬШЧKЪЬЮЬШKЪЮЬШЧKШЧKЪЬЮЬШKЪЬЮЬШKЪЬ	ЮЬШЪЬЮЬЮЬШ KШ ЧЪЮШЪЬЮЬLЮЬЮЬШfKЪЬZЩZЧKЪЬЮЬШ	KШKЪЮЬЮЬЮЬЮЬШKШЪЮЬЮЬЮШKЪЬЮЬ/г	ШGKЪЬЮЬг	ШKЪЬЮЬг	ШKЪЬЮЬг	ШKЪ
ЮЬЮЬ
ЮЬЮЬЮЬШ@KЪЮЬШKШ ЧЧKЪЮЬ
ЮЬЮЬШ)KЪЮЬЮЬЮЬШ.Ш#ЪЬЮЬШKЪЬoШoKЪЮЬШ	KШЧKЪЬШЧЪЮШKШЧKШKШ ЧЧЦx[key: ROPE, proc: Commander.CommandProc, doc: ROPE _ NIL, clientData: REF ANY _ NIL, interpreted: BOOL _ TRUE]ЩKШ KЪЬ	ЮЬUШbЪЬSШSKШ ЧЧKШ KЪЮЬШKЪгШЧ ЕЧ    ▓  ,=  