DIRECTORY
BasicTime USING [FromPupTime, nullGMT],
BcdDefs USING [Base, BcdBase, CTHandle, CTIndex, CTNull, FTHandle, FTIndex, FTNull, FTSelf, MTHandle, MTIndex, NameRecord, NameString, NullName, NullVersion, VersionID, VersionStamp],
BcdOps USING [ProcessConfigs, ProcessFiles, ProcessModules],
DFInternal USING [AbortDF, CheckAbort, Client, ClientDescriptor, DefaultInteractionProc, GetFileInfo, LocalFile, LocalFileInfo, RemoteFileInfo, ReportFSError, RetryFSOperation, SimpleInteraction],
DFOperations USING [AbortInteraction, DFInfoInteraction, InfoInteraction, InteractionProc],
DFUtilities USING [Date, DateToRope, DirectoryItem, FileItem, Filter, ImportsItem, IncludeItem, ParseFromStream, ProcessItemProc, RemoveVersionNumber, SyntaxError],
FS USING [Close, Error, GetInfo, Open, OpenFile, PagesForBytes, Read, StreamOpen],
List USING [CompareProc, UniqueSort],
IO USING [Close, GetIndex, PutFR, STREAM],
Rope USING [Compare, Concat, Equal, Fetch, Find, FromProc, Index, Length, ROPE, Substr],
RopeHash USING [FromRope],
VM USING [AddressForPageNumber, Allocate, Free, Interval, nullInterval, PageCount];

VerifyImpl: CEDAR PROGRAM
IMPORTS BasicTime, BcdOps, DFInternal, DFUtilities, FS, List, IO, Rope, RopeHash, VM
EXPORTS DFOperations = BEGIN

ROPE: TYPE = Rope.ROPE;
STREAM: TYPE = IO.STREAM;

FileDesc: TYPE = RECORD [
shortName: ROPE _ NIL,
path: ROPE _ NIL,
importedFrom: REF FileDesc _ NIL,
parent: ROPE _ NIL,
date: DFUtilities.Date _ [],
version: BcdDefs.VersionStamp _ BcdDefs.NullVersion,
bcd: BOOL _ FALSE,
needed: Needed _ $no
];

Needed: TYPE = {no, yes, wrongVersion};

htSize: NAT = 97;
HashIndex: TYPE = [0..htSize);
HashTable: TYPE = REF HashTableArray;
HashTableArray: TYPE = ARRAY HashIndex OF LIST OF REF FileDesc;

cacheSize: NAT = 64;

Omission: TYPE = RECORD [
missing: ROPE,
neededBy: ROPE
];

Verify: PUBLIC PROC [dfFile: ROPE, interact: DFOperations.InteractionProc _ NIL, clientData: REF ANY _ NIL, log: STREAM _ NIL] RETURNS [errors, warnings, filesActedUpon: INT _ 0] = {
client: DFInternal.Client = NEW[DFInternal.ClientDescriptor _ [
(interact _ IF interact = NIL THEN DFInternal.DefaultInteractionProc ELSE interact),
clientData,
log
]];
rootList: LIST OF REF FileDesc _ NIL;
hashTable: HashTable = NEW[HashTableArray _ ALL[NIL]];
bcdCache: BcdCache = CreateBcdCache[cacheSize];
omissions: LIST OF --REF Omission--REF ANY _ NIL;
Hash: PROC [name: ROPE] RETURNS [HashIndex] = {
RETURN[RopeHash.FromRope[rope: name, case: FALSE] MOD htSize];
};
EnterInHashTable: PROC [desc: REF FileDesc] RETURNS [BOOL _ TRUE] = {
hi: HashIndex = Hash[desc.shortName];
FOR l: LIST OF REF FileDesc _ hashTable[hi], l.rest UNTIL l = NIL DO
IF desc.shortName.Equal[l.first.shortName, FALSE] THEN {
IF desc.date ~= l.first.date THEN {
warnings _ warnings.SUCC;
DFInternal.SimpleInteraction[
client,
NEW[DFOperations.InfoInteraction _ [
class: $warning,
message: IO.PutFR["'%g' appears more than once (via '%g' and '%g').",
[rope[desc.shortName]],
[rope[
IF l.first.importedFrom = NIL THEN l.first.parent
ELSE FullName[l.first.importedFrom]
]],
[rope[
IF desc.importedFrom = NIL THEN desc.parent
ELSE FullName[desc.importedFrom]
]]
]
]]
];
};
RETURN[FALSE]
};
ENDLOOP;
hashTable[hi] _ CONS[desc, hashTable[hi]];
filesActedUpon _ filesActedUpon.SUCC;
};
LookupInHashTable: PROC [shortName: ROPE] RETURNS [desc: REF FileDesc _ NIL] = {
FOR l: LIST OF REF FileDesc _ hashTable[Hash[shortName]], l.rest UNTIL l = NIL DO
IF shortName.Equal[l.first.shortName, FALSE] THEN RETURN[l.first];
ENDLOOP;
};
EnumerateHashTable: PROC [proc: PROC [REF FileDesc]] = {
FOR hi: HashIndex IN HashIndex DO
FOR l: LIST OF REF FileDesc _ hashTable[hi], l.rest UNTIL l = NIL DO
proc[l.first];
ENDLOOP;
ENDLOOP;
};
WorthRemembering: PROC [desc: REF FileDesc] RETURNS [BOOL _ FALSE] = {
ext: ROPE = desc.shortName.Substr[start: desc.shortName.Index[s2: "."]];
exts: ARRAY [0..3) OF ROPE = [".bcd", ".mesa", ".config"];
FOR i: NAT IN [0..exts.LENGTH) DO
IF ext.Equal[exts[i], FALSE] THEN {desc.bcd _ i = 0; RETURN[TRUE]};
ENDLOOP;
};
Extant: PROC [desc: REF FileDesc] RETURNS [BOOL] = INLINE {
RETURN[desc.date.gmt ~= BasicTime.nullGMT]
};
importedFrom: REF FileDesc _ NIL;
VerifyInner: PROC [dfFile: ROPE, date: DFUtilities.Date, filter: DFUtilities.Filter] RETURNS [finished: BOOL _ FALSE] = {
directoryPath: ROPE _ NIL;
DoOneItem: DFUtilities.ProcessItemProc = {
DFInternal.CheckAbort[client];
WITH item SELECT FROM 
directory: REF DFUtilities.DirectoryItem =>
directoryPath _ directory.path1;
file: REF DFUtilities.FileItem => {
desc: REF FileDesc = NEW[FileDesc _ [
shortName: DFUtilities.RemoveVersionNumber[file.name],
path: directoryPath,
parent: dfFile,
importedFrom: importedFrom
]];
remoteInfo: REF DFInternal.RemoteFileInfo = NEW[DFInternal.RemoteFileInfo _ [
name: FullName[desc],
date: file.date
]];
DFInternal.GetFileInfo[info: remoteInfo, client: client, errorLevel: $warning
! FS.Error => CONTINUE
];
desc.date _ remoteInfo.date;
IF (filter.list ~= NIL OR WorthRemembering[desc]) AND EnterInHashTable[desc] AND
file.verifyRoot AND importedFrom = NIL THEN
rootList _ CONS[desc, rootList];
};
imports: REF DFUtilities.ImportsItem =>
IF imports.form ~= $list AND filter.list = NIL THEN {
warnings _ warnings.SUCC;
DFInternal.SimpleInteraction[
client,
NEW[DFOperations.InfoInteraction _ [
class: $warning,
message: IO.PutFR["'%g' appears in an Imports statement (in '%g') without a Using list; it will be ignored.",
[rope[imports.path1]],
[rope[dfFile]]
]
]]
];
}
ELSE {
outerMostImports: BOOL = (filter.list = NIL);
newFilter: DFUtilities.Filter = [
comments: filter.comments,  -- comments processing is unaffected by imports
filterA: filter.filterA,   -- source/derived distinction is unaffected by imports
filterB: IF imports.form = $exports THEN $public ELSE filter.filterB,
filterC: $all,  -- if the top level passes imports, they can come from anywhere
list: IF imports.form = $list THEN imports.list ELSE filter.list
];
IF outerMostImports THEN
importedFrom _ NEW[FileDesc _ [
path: imports.path1, -- hack: shortName is NIL, but only CheckIfNeeded cares.
date: imports.date,
parent: dfFile
]];
IF VerifyInner[imports.path1, imports.date, newFilter] AND outerMostImports
THEN {
FOR i: NAT IN [0..imports.list.nEntries) DO
desc: REF FileDesc = LookupInHashTable[imports.list.u[i].name];
SELECT TRUE FROM
desc = NIL => {
warnings _ warnings.SUCC;
DFInternal.SimpleInteraction[
client,
NEW[DFOperations.InfoInteraction _ [
class: $warning,
message: IO.PutFR[
"'%g' could not be found inside '%g' (or any nested DF file).",
[rope[imports.list.u[i].name]],
[rope[imports.path1]]
]
]]
];
};
imports.list.u[i].verifyRoot => rootList _ CONS[desc, rootList];
ENDCASE;
ENDLOOP;
importedFrom _ NIL;
};
};
include: REF DFUtilities.IncludeItem => [] _ VerifyInner[include.path1, include.date, filter];
ENDCASE;
};
dfInfo: REF DFInternal.RemoteFileInfo
= NEW[DFInternal.RemoteFileInfo _ [name: dfFile, date: date]];
dfStream: STREAM;
DFInternal.GetFileInfo[info: dfInfo, client: client
! FS.Error => {errors _ errors.SUCC; GO TO skip}];
dfStream _ FS.StreamOpen[fileName: dfInfo.name
! FS.Error => {
errors _ errors.SUCC; DFInternal.ReportFSError[error, dfInfo, client]; GO TO skip}
];
dfInfo.name _ DFUtilities.RemoveVersionNumber[dfInfo.name];
DFInternal.SimpleInteraction[
client,
NEW[DFOperations.DFInfoInteraction _ [action: $start, dfFile: dfInfo.name]]
];
DFUtilities.ParseFromStream[dfStream, DoOneItem, filter !
DFUtilities.SyntaxError -- [reason: ROPE]-- => {
errors _ errors.SUCC;
DFInternal.SimpleInteraction[
client,
NEW[DFOperations.InfoInteraction _ [
class: $error,
message: IO.PutFR[
"Syntax error in '%g'[%d]: %g\NProcessing of this DF file aborted.",
[rope[dfInfo.name]], [cardinal[dfStream.GetIndex[]]], [rope[reason]]
]
]]
];
CONTINUE
};
DFInternal.AbortDF => dfStream.Close[];
];
dfStream.Close[];
DFInternal.SimpleInteraction[
client,
NEW[DFOperations.DFInfoInteraction _ [action: $end, dfFile: dfInfo.name]]
];
RETURN[TRUE];
EXITS
skip => NULL;
};
VerifyDependencies: PROC = {
VerifyDependenciesInner: PROC [parent: REF FileDesc] = {
parentBcd: BcdDefs.BcdBase _ NIL;
parentFileTable: BcdDefs.Base;
parentSource: REF FileDesc _ NIL;
parentFileName: ROPE _ NIL;
RopeForNameRecord: PROC [bcd: BcdDefs.BcdBase, name: BcdDefs.NameRecord] RETURNS [r: ROPE] = TRUSTED {
ssb: BcdDefs.NameString = LOOPHOLE[bcd + bcd.ssOffset];
len: NAT;
i: INT _ name;
GetFromNameString: SAFE PROC RETURNS [char: CHAR] = TRUSTED {
char _ ssb.string[i]; i _ i + 1};
r _ Rope.FromProc[ssb.size[name], GetFromNameString];
len _ r.Length[];
IF len > 0 AND r.Fetch[len-1] = '. THEN r _ r.Substr[len: len-1];
};
CheckDependentFile: PROC [fth: BcdDefs.FTHandle, recur: BOOL _ TRUE] = TRUSTED {
file: ROPE _ RopeForNameRecord[parentBcd, fth.name];
child: REF FileDesc;
DFInternal.CheckAbort[client];
IF file.Find["."] < 0 THEN file _ file.Concat[".bcd"];
IF (child _ LookupInHashTable[file]) = NIL THEN
omissions _ CONS[
NEW[Omission _ [missing: file, neededBy: parentFileName]],
omissions]
ELSE IF Extant[child] THEN {
IF child.needed = $wrongVersion THEN RETURN;
IF child.version = BcdDefs.NullVersion THEN {
childBcd: BcdDefs.BcdBase;
childBcd _ GetBcd[bcdCache, child
! FS.Error =>
IF DFInternal.RetryFSOperation[error, client] THEN RETRY
ELSE {
errors _ errors.SUCC;
DFInternal.ReportFSError[
error,
NEW[DFInternal.RemoteFileInfo _ [name: parentFileName, date: parent.date]],
client
];
GO TO proceedWithoutBCD
}
];
IF childBcd.versionIdent = BcdDefs.VersionID THEN
child.version _ childBcd.version;
ReleaseBcd[bcdCache, childBcd];
};
SELECT child.needed FROM
$no => {
IF fth.version = child.version THEN {
child.needed _ $yes;
IF child.importedFrom ~= NIL AND child.importedFrom.needed = $no THEN
child.importedFrom.needed _ $yes;
IF recur THEN VerifyDependenciesInner[child];
RETURN
};
};
$yes => IF fth.version = child.version THEN RETURN;
ENDCASE;
child.needed _ $wrongVersion;
errors _ errors.SUCC;
DFInternal.SimpleInteraction[
client,
NEW[DFOperations.InfoInteraction _ [
class: $error,
message: IO.PutFR[
"'%g' {%g} depends on '%g'; '%g' {%g} is the wrong version.",
[rope[parentFileName]],
[rope[DFUtilities.DateToRope[parent.date]]],
[rope[file]],
[rope[FullName[child]]],
[rope[DFUtilities.DateToRope[child.date]]]
]
]]
];
EXITS
proceedWithoutBCD => NULL;
};
};
parentSourceName: BcdDefs.NameRecord _ BcdDefs.NullName;
parentSourceVersion: BcdDefs.VersionStamp;
IF ~parent.bcd OR parent.importedFrom ~= NIL THEN RETURN;
parentFileName _ FullName[parent];
parentBcd _ GetBcd[bcdCache, parent
! FS.Error =>
IF DFInternal.RetryFSOperation[error, client] THEN RETRY
ELSE {
errors _ errors.SUCC;
DFInternal.ReportFSError[
error,
NEW[DFInternal.RemoteFileInfo _ [name: parentFileName, date: parent.date]],
client
];
GO TO skipThisBCD
}
];
TRUSTED{
parentSourceName _ parentBcd.source;
parentSourceVersion _ parentBcd.sourceVersion;
parentFileTable _ LOOPHOLE[parentBcd + parentBcd.ftOffset];
};
IF parentSourceName = BcdDefs.NullName THEN {
warnings _ warnings.SUCC;
DFInternal.SimpleInteraction[
client,
NEW[DFOperations.InfoInteraction _ [
class: $warning,
message: IO.PutFR[
"'%g' {%g} does not specify a source file.",
[rope[parentFileName]],
[rope[DFUtilities.DateToRope[parent.date]]]
]
]]
];
}
ELSE {
sourceFileName: ROPE = RopeForNameRecord[parentBcd, parentSourceName];
IF (parentSource _ LookupInHashTable[sourceFileName]) = NIL THEN
omissions _ CONS[
NEW[Omission _ [
missing: sourceFileName,
neededBy: parentFileName
]],
omissions]
ELSE IF Extant[parentSource] AND parentSource.needed ~= $wrongVersion THEN {
sourceDate: DFUtilities.Date =
[$explicit, BasicTime.FromPupTime[LOOPHOLE[parentSourceVersion.time]]];
IF sourceDate = parentSource.date THEN parentSource.needed _ $yes
ELSE {
parentSource.needed _ $wrongVersion;
errors _ errors.SUCC;
DFInternal.SimpleInteraction[
client,
NEW[DFOperations.InfoInteraction _ [
class: $error,
message: IO.PutFR[
"'%g' {%g} expects source of {%g}, but DF file specifies '%g' {%g}.",
[rope[parentFileName]],
[rope[DFUtilities.DateToRope[parent.date]]],
[rope[DFUtilities.DateToRope[sourceDate]]],
[rope[FullName[parentSource]]],
[rope[DFUtilities.DateToRope[parentSource.date]]]
]
]]
];
};
};
};
TRUSTED {
IF parentBcd.nConfigs > 0 THEN {
remoteSubConfig: BOOL _ FALSE;
ctb: BcdDefs.Base = LOOPHOLE[parentBcd + parentBcd.ctOffset];
sgb: BcdDefs.Base = LOOPHOLE[parentBcd + parentBcd.sgOffset];
DoOneModule: PROC [mth: BcdDefs.MTHandle, mti: BcdDefs.MTIndex] RETURNS [BOOL _ FALSE] = TRUSTED {
cti: BcdDefs.CTIndex _ mth.config;
UNTIL cti = BcdDefs.CTNull DO
cth: BcdDefs.CTHandle = @ctb[cti];
IF cth.file ~= BcdDefs.FTSelf THEN {remoteSubConfig _ TRUE; RETURN};
cti _ cth.config;
ENDLOOP;
IF mth.file ~= BcdDefs.FTSelf AND mth.file ~= BcdDefs.FTNull THEN
CheckDependentFile[@parentFileTable[mth.file]];
};
DoOneConfig: PROC [cth: BcdDefs.CTHandle, cti: BcdDefs.CTIndex] RETURNS [BOOL _ FALSE] = TRUSTED {
IF cth.file ~= BcdDefs.FTSelf THEN {
outerCti: BcdDefs.CTIndex _ cth.config;
UNTIL outerCti = BcdDefs.CTNull DO
outerCth: BcdDefs.CTHandle = @ctb[outerCti];
IF outerCth.file ~= BcdDefs.FTSelf THEN RETURN;
outerCti _ outerCth.config;
ENDLOOP;
CheckDependentFile[@parentFileTable[cth.file]];
};
};
[] _ BcdOps.ProcessModules[parentBcd, DoOneModule];
IF remoteSubConfig THEN [] _ BcdOps.ProcessConfigs[parentBcd, DoOneConfig];
}
ELSE {
DoOneFile: PROC [fth: BcdDefs.FTHandle, fti: BcdDefs.FTIndex] RETURNS [BOOL _ FALSE] = TRUSTED {
CheckDependentFile[fth];
};
[] _ BcdOps.ProcessFiles[parentBcd, DoOneFile];
};
};
ReleaseBcd[bcdCache, parentBcd];
EXITS
skipThisBCD => NULL;
};
IF rootList = NIL THEN {
warnings _ warnings.SUCC;
DFInternal.SimpleInteraction[
client,
NEW[DFOperations.InfoInteraction _ [
class: $warning,
message: IO.PutFR["No files in '%g' are marked with '+'.", [rope[dfFile]]]
]]
];
}
ELSE
FOR l: LIST OF REF FileDesc _ rootList, l.rest UNTIL l = NIL DO
rootDesc: REF FileDesc = l.first;
IF rootDesc.needed = $no THEN {
rootDesc.needed _ $yes;
IF rootDesc.importedFrom ~= NIL AND rootDesc.importedFrom.needed = $no THEN
rootDesc.importedFrom.needed _ $yes;
IF Extant[rootDesc] THEN
VerifyDependenciesInner[rootDesc ! DFInternal.AbortDF => FlushBcdCache[bcdCache]];
};
ENDLOOP;
FlushBcdCache[bcdCache];
};
ReportOmissions: PROC = {
Compare: List.CompareProc = {
RETURN[Rope.Compare[
NARROW[ref1, REF Omission].missing,
NARROW[ref2, REF Omission].missing]
]
};
nFiles: NAT _ 0;
msg: ROPE _ "The following should appear in the DF input:\N";
IF omissions = NIL THEN RETURN;
FOR omissions _ List.UniqueSort[omissions, Compare], omissions.rest UNTIL omissions = NIL DO
omission: REF Omission = NARROW[omissions.first];
msg _ msg.Concat[
IO.PutFR["  '%g', needed by '%g'\N",
[rope[omission.missing]],
[rope[omission.neededBy]]
]
];
nFiles _ nFiles.SUCC;
ENDLOOP;
errors _ errors + nFiles;
DFInternal.SimpleInteraction[
client,
NEW[DFOperations.InfoInteraction _ [
class: $error,
message: msg
]]
];
};
CheckIfNeeded: PROC [desc: REF FileDesc] = {
IF desc.needed ~= $no OR ~WorthRemembering[desc] THEN RETURN;
IF desc.importedFrom ~= NIL THEN
IF desc.importedFrom.needed = $no THEN
(desc _ desc.importedFrom).needed _ $yes
ELSE RETURN;
warnings _ warnings.SUCC;
DFInternal.SimpleInteraction[
client,
NEW[DFOperations.InfoInteraction _ [
class: $warning,
message: IO.PutFR[
"'%g' (%g) is superfluous.",
[rope[IF desc.shortName = NIL THEN desc.path ELSE desc.shortName]],
[rope[
IF desc.importedFrom = NIL THEN IO.PutFR["in '%g'", [rope[desc.parent]]]
ELSE IO.PutFR["via '%g'", [rope[FullName[desc.importedFrom]]]]
]]
]
]]
];
};
{
ENABLE 
{
ABORTED => {
DFInternal.SimpleInteraction[client, NEW[DFOperations.AbortInteraction _ [TRUE]]];
};
DFInternal.AbortDF => {
errors _ errors.SUCC;
DFInternal.SimpleInteraction[client, NEW[DFOperations.DFInfoInteraction _ [action: $abort, dfFile: dfFile]]];
CONTINUE
};
};
IF DFInternal.LocalFile[dfFile] THEN {
dfInfo: REF DFInternal.LocalFileInfo = NEW[DFInternal.LocalFileInfo _ [name: dfFile]];
DFInternal.GetFileInfo[info: dfInfo, client: client, errorLevel: $abort];
IF (dfFile _ dfInfo.attachedTo) = NIL THEN {
errors _ errors.SUCC;
DFInternal.SimpleInteraction[
client,
NEW[DFOperations.InfoInteraction _ [
class: $abort,
message: IO.PutFR[
"'%g' isn't a remote file and therefore can't be verified.",
[rope[dfInfo.name]]
]
]]
];
RETURN
};
};
IF VerifyInner[dfFile, [format: $explicit], []] THEN {
VerifyDependencies[];
ReportOmissions[];
EnumerateHashTable[CheckIfNeeded];
};
};
};


BcdCache: TYPE = REF BcdCacheObject;
BcdCacheObject: TYPE = RECORD [
locked: CachedBcdList _ NIL,  -- linear list
available: CachedBcdList _ NIL,  -- circularly chained
size: NAT _ 0,
replacementSize: NAT
];

CachedBcdList: TYPE = LIST OF CachedBcd;
CachedBcd: TYPE = REF CachedBcdEntry;
CachedBcdEntry: TYPE = RECORD [
buffer: VM.Interval _ VM.nullInterval,
desc: REF FileDesc _ NIL
];

initialVM: VM.PageCount = 10;


CreateBcdCache: PROC [replacementSize: NAT] RETURNS [bcdCache: BcdCache] = {
RETURN[NEW[BcdCacheObject _ [replacementSize: replacementSize]]]
};

GetBcd: PROC [bcdCache: BcdCache, desc: REF FileDesc] RETURNS [bcd: BcdDefs.BcdBase _ NIL] = {
prev: CachedBcdList _ bcdCache.available;
new: CachedBcd _ NIL;
list: CachedBcdList _ NIL;
NewEntry: PROC RETURNS [CachedBcdList] = {
bcdCache.size _ bcdCache.size.SUCC;
RETURN[CONS[NEW[CachedBcdEntry _ []], NIL]]
};
SELECT TRUE FROM
prev = NIL =>
list _ NewEntry[];
prev = prev.rest => {
list _ bcdCache.available;
bcdCache.available _ NIL;
IF list.first.desc ~= desc THEN list.first.desc _ NIL;
};
ENDCASE => {
list _ prev.rest;
DO
IF list.first.desc = desc THEN GO TO dequeue;  -- 'list.first' is a cache hit
prev _ list;
IF (list _ list.rest) = bcdCache.available.rest THEN {
IF bcdCache.size < bcdCache.replacementSize THEN {list _ NewEntry[]; EXIT}
ELSE {list.first.desc _ NIL; GO TO dequeue};
};
REPEAT
dequeue => {
prev.rest _ list.rest;
IF bcdCache.available = list THEN bcdCache.available _ list.rest;
};
ENDLOOP;
};
list.rest _ bcdCache.locked;
bcdCache.locked _ list;
IF (new _ list.first).desc = NIL
THEN {
ENABLE UNWIND => {
bcdCache.locked _ bcdCache.locked.rest;
bcdCache.size _ bcdCache.size.PRED;
};
name: ROPE = FullName[desc];
file: FS.OpenFile;
nPages: INT;
file _ FS.Open[name: name, wantedCreatedTime: desc.date.gmt];
IF new.buffer.count = 0 THEN new.buffer _ VM.Allocate[initialVM];
nPages _ MIN[FS.PagesForBytes[FS.GetInfo[file].bytes], new.buffer.count];
TRUSTED {
lp: LONG POINTER _ VM.AddressForPageNumber[new.buffer.page];
bcd _ LOOPHOLE[lp];
FS.Read[file: file, from: 0, nPages: nPages, to: lp];
IF bcd.nPages > nPages THEN {
nPages _ bcd.nPages;
VM.Free[new.buffer];
new.buffer _ VM.Allocate[nPages];
lp _ VM.AddressForPageNumber[new.buffer.page];
bcd _ LOOPHOLE[lp];
FS.Read[file: file, from: 0, nPages: nPages, to: lp];
};
};
FS.Close[file];
new.desc _ desc;
}
ELSE TRUSTED {bcd _ LOOPHOLE[VM.AddressForPageNumber[new.buffer.page]]};
};

ReleaseBcd: PROC [bcdCache: BcdCache, bcd: BcdDefs.BcdBase] = {
list: CachedBcdList _ bcdCache.locked;
prev: CachedBcdList _ NIL; 
UNTIL list = NIL DO
TRUSTED {IF VM.AddressForPageNumber[list.first.buffer.page] = bcd THEN EXIT};
prev _ list;
list _ list.rest;
REPEAT
FINISHED => ERROR;
ENDLOOP;
IF prev = NIL THEN bcdCache.locked _ list.rest ELSE prev.rest _ list.rest;
IF bcdCache.available = NIL THEN list.rest _ list
ELSE {list.rest _ bcdCache.available.rest; bcdCache.available.rest _ list};
bcdCache.available _ list;
};

FlushBcdCache: PROC [bcdCache: BcdCache] = {
list: CachedBcdList;
FOR list _ bcdCache.locked, list.rest UNTIL list = NIL DO
TRUSTED {VM.Free[list.first.buffer]};
ENDLOOP;
bcdCache.locked _ NIL;
IF bcdCache.available = NIL THEN RETURN;
list _ bcdCache.available.rest;  -- head of 'available' list
bcdCache.available.rest _ NIL;  -- break circular chain
bcdCache.available _ NIL;
UNTIL list = NIL DO
TRUSTED {VM.Free[list.first.buffer]};
list _ list.rest;
ENDLOOP;
};

FullName: PROC [desc: REF FileDesc] RETURNS [ROPE] = INLINE {
RETURN[desc.path.Concat[desc.shortName]]
};

END.
ώVerifyImpl.mesa
Copyright c 1984, 1985 by Xerox Corporation.  All rights reserved.
Levin on December 19, 1983 4:20 pm
Russ Atkinson on February 13, 1985 12:04:20 pm PST
highest level Imports with Using containing 'shortName'
DF file containing defining occurrence of 'shortName'
duplicate short file name with different file creation dates
This procedure checks for consistency and completeness of the DF input with respect to the file identified by its parameter.  There are essentially two cases.
(1)  If the parameter file is not a BCD or if it is a BCD that was imported, the file is a leaf of the dependency tree.  It sufficies, therefore, to check that the file exists, which was already done in the course of building the hash table.  Therefore, VerifyDependenciesInner does nothing for non-BCDs.
(2)  If the parameter is a BCD, the file table is enumerated and, for each file, the DF input is checked to see that (a) there exists a file with the same short name, (b) that the file is extant, and (c) that the BCD version stamp matches the stamp in the file table entry.  If (a) fails, a necessary file has been omitted from the input and its (short) name is placed on a list for future printing.  If (b) fails, the file appeared in the DF input but doesn't exist on the server.  This error was reported during hash table construction, so no further action is required here.  If (c) fails, the file specified in the DF input exists, but is the wrong version.  An error is reported (unless it was already reported.)  After the file table enumeration is complete, the source file for 'parent' is checked to be sure it exists.
This module belongs the configuration directly defined by parentBcd's source. 
This config is a remote one.  If all of its enclosing configs are local, we treat it as a dependency.
The entire imports item is superfluous.  We print the warning here, then flag the 'importedFrom' descriptor as 'needed' to prevent repeated messages, either for the imports item or anything in its Using list.
We would like to RESUME at this point, but until ABORTED is redeclared as a SIGNAL, it won't work.
The peculiar date specification has the effect of treating a version number on 'dfFile' as truth.  See comment in DFInternal.GetFileInfo.
The hash table has now been constructed.  Process the roots list.
Report any omitted names.
All inconsistencies have been reported.  Pick up extra entries and report them.
Internal procedures
A bcd cache is managed as two singly-linked lists of cache entries.  The 'available' list consists of cached bcd's that are eligible for replacement.  The 'locked' list consists of cached bcd's that are actually being touched; they cannot be replaced until they are moved to the 'available' list.  The maximum size of the two lists is (almost) bounded by a creation-time parameter; however, if the 'available' list is empty when a new entry is needed, the entry will be created regardless of the size bound.
Cache replacement occurs in the 'available' list in LRU order.  New cache entries appear at the tail of the list; victims are taken from the head.  BcdCache.available points at the logical tail of the list, that is, the MRU entry, and BcdCache.list.rest points at the logical head, the LRU entry.
'available' list is empty.  Create a new cache entry regardless of present cache size.
'available' list has precisely one entry, which may or may not be the file of interest.
'available' list has at least two entries.
assert: list = prev.rest
cache miss.
'list' is a single element list (although list.rest may be garbage) containing the CachedBcd to be (re)used.  We link it on the 'locked' list.
We now have a cache entry, which either is empty or has the desired file.
buffer too small; grow it.
dequeue from 'locked' list.
enqueue on 'available' list.
flush 'locked' list.
ΚΓ˜
codeš
œ™Kšœ
Οm
œ7™BKš
œ"™"Kš
œ2™2—K˜š
Οk	˜	Kšœ
žœ˜'Kšœžœͺ
˜·
Kšœžœ0˜<Kšœžœ΄
˜Δ
Kšœ
žœI˜[Kšœžœ“
˜€
Kšžœ
žœJ˜RKšœžœ˜%Kšžœ
žœžœ˜*Kšœžœ@žœ
˜XKšœ	žœ˜Kšžœ
žœK˜S—K˜šœžœ
ž˜Kšžœ-žœžœž˜TKšžœž˜—˜Kšžœžœžœ
˜Kšžœžœžœ
žœ
˜—˜šœ
žœžœ˜Kšœžœžœ
˜Kšœžœžœ
˜šœžœžœ
˜!Kš
œ7™7—šœžœžœ
˜Kš
œ5™5—Kš
œ˜K˜4Kšœžœžœ
˜K˜K˜—K˜Kšœžœ˜'K˜Kšœžœ˜Kšœžœ˜Kšœžœžœ˜%Kš
œžœžœžœ
žœ
žœ
žœ
˜?K˜Kšœžœ˜K˜šœ
žœžœ˜Kšœ	žœ
˜Kšœ
ž˜K˜——K˜šΟnœžœ
žœ
žœ+žœžœ
žœžœžœžœ
žœ$žœ	˜Ά
šœžœ ˜?Kš	œžœžœ
žœ#žœ˜TKš
œ˜Kš
œ˜Kš
œ˜—Kš	œ
žœ
žœ
žœžœ
˜%Kšœžœžœ
žœ˜6K˜/Kšœžœ
žœ
Οcžœ
žœžœ
˜1šŸœžœžœžœ˜/Kšžœ%žœžœ	˜>K˜—šŸœžœžœ
žœžœžœ˜EK˜%š
žœžœ
žœ
žœ"žœžœ
ž˜Dšžœ)žœžœ˜8šžœžœ˜#K™<Kšœžœ
˜š
œ˜Kš
œ˜šžœ!˜$K˜šœ	žœ:˜EKš
œ˜š
œ˜Kšžœžœ
žœ˜1Kšžœ˜#Kš
œ˜—š
œ˜Kšžœžœ
žœ˜+Kšžœ˜ Kš
œ˜—K˜
—K˜—K˜—K˜—Kšžœ
žœ
˜
K˜—Kšžœ
˜—Kšœžœ˜*Kšœ žœ
˜%K˜—šŸœžœ
žœžœžœžœ˜Pš
žœžœ
žœ
žœ/žœžœ
ž˜QKšžœ$žœžœ
žœ
˜BKšžœ
˜—K˜—šŸœžœžœžœ˜8šžœžœž˜!š
žœžœ
žœ
žœ"žœžœ
ž˜DKš
œ˜Kšžœ
˜—Kšžœ
˜—K˜—šŸœžœžœžœžœžœ˜FKšœžœ?˜HKšœžœžœ
žœ ˜:š	žœžœ
žœ
žœž˜!Kš
žœžœžœžœ
žœ˜CKšžœ
˜—K˜—šŸœžœžœžœžœžœ˜;Kšžœ$˜*K˜—Kšœžœžœ
˜!šŸœžœ
žœ5žœžœžœ˜yKšœžœžœ
˜š
œ*˜*Kš
œ˜šžœžœ
žœ
˜šœžœ˜+Kš
œ ˜ —šœžœ˜#šœžœžœ
˜%Kš
œ6˜6Kš
œ˜Kš
œ˜Kš
œ˜K˜—šœžœžœ˜MKš
œ˜K˜K˜—š
œM˜MKšœžœ
ž˜Kš
œ˜—K˜š	žœžœ
žœžœž˜PKšœžœžœ
ž˜+Kšœžœ˜ —K˜—šœ	žœ˜'šžœžœžœ
žœ˜5Kšœžœ
˜š
œ˜Kš
œ˜šžœ!˜$K˜šœ	žœb˜mKš
œ˜Kš
œ˜K˜
—K˜—K˜—K˜
—šžœ˜Kšœžœžœ˜-š
œ!˜!Kšœ /˜KKšœ 6˜QKšœ	žœžœ	žœ˜EKšœ ?˜OKšœžœžœžœ˜@K˜—šžœž˜šœžœ
˜Kšœ 8˜MKš
œ˜Kš
œ˜Kš
œ˜——šžœ4žœ˜Kšžœ˜šžœžœ
žœž˜+Kšœžœ6˜?šžœ
žœ
ž˜šœžœ˜Kšœžœ
˜š
œ˜Kš
œ˜šžœ!˜$K˜šœ	žœ˜Kš
œ?˜?Kš
œ˜Kš
œ˜K˜
—K˜—K˜—K˜—Kšœ+žœ˜@Kšžœ
˜—Kšžœ
˜—Kšœžœ
˜K˜——K˜——Kšœ	žœR˜^Kšžœ
˜—K˜—šœžœ˜%Kšœžœ9˜>—Kšœ
žœ
˜š
œ3˜3Kš	œžœžœžœ
žœ˜2—šœžœ!˜.šœžœ˜Kšœžœ3žœ
žœ˜R—K˜—Kš
œ;˜;š
œ˜Kš
œ˜KšžœH˜KKš
œ˜—š
œ9˜9šœ œ˜0Kšœžœ
˜š
œ˜Kš
œ˜šžœ!˜$K˜šœ	žœ˜Kš
œD˜DKš
œD˜DK˜
—K˜—Kš
œ˜—Kš
ž˜K˜—Kš
œ'˜'Kš
œ˜—K˜š
œ˜Kš
œ˜KšžœF˜IKš
œ˜—Kšžœ
žœ˜
š
ž˜Kšœžœ
˜
—K˜—šŸœžœ˜šŸœžœ
žœ˜8š
œž
™ž
Kšœ$žœžœχ
™°Kšœžœ7žœ~žœΰ
žœ±
žœΝ
™Ί—Kšœžœ
˜!K˜Kšœžœžœ
˜!Kšœžœžœ
˜š
Ÿœžœ1žœžœžœ˜fKšœžœ˜7Kšœžœ
˜	Kšœžœ˜šŸœžœ
žœ
žœžœžœ˜=K˜!—Kš
œ5˜5K˜Kšžœ	žœžœ˜AK˜—š
Ÿœžœ žœžœžœ˜PKšœžœ*˜4Kšœžœ
˜Kš
œ˜Kšžœžœ˜6šžœ%žœ
ž˜/šœžœ
˜Kšžœ7˜:Kš
œ
˜
——šžœ
žœžœ˜Kšžœžœ
žœ
˜,šžœ%žœ˜-Kš
œ˜š
œ!˜!šœžœ	˜
Kšžœ,žœ
ž˜8šžœ˜Kšœžœ
˜š
œ˜K˜KšžœH˜KK˜K˜—Kšžœ
žœ˜K˜
——Kš
œ˜—šžœ+ž˜1Kš
œ!˜!—Kš
œ˜K˜—šžœž˜˜šžœžœ˜%K˜šžœžœ
žœ!ž˜EK˜!—Kšžœžœ ˜-Kš
ž˜K˜—K˜—Kšœžœžœ
žœ
˜3Kšžœ
˜—K˜Kšœžœ
˜š
œ˜Kš
œ˜šžœ!˜$K˜šœ	žœ˜Kš
œ=˜=Kš
œ˜Kš
œ,˜,Kš
œ
˜
Kš
œ˜Kš
œ*˜*Kš
œ
˜
—K˜—Kš
œ˜—š
ž˜Kšœžœ
˜—K˜—K˜—K˜8K˜*Kš
žœ
žœžœ
žœ
žœ
˜9Kš
œ"˜"š
œ#˜#šœžœ	˜
Kšžœ,žœ
ž˜8šžœ˜Kšœžœ
˜š
œ˜K˜KšžœH˜KK˜K˜—Kšžœ
žœ˜K˜
——Kš
œ˜—šžœ
˜Kš
œ$˜$Kš
œ.˜.Kšœžœ!˜;Kš
œ˜—šžœ%žœ˜-Kšœžœ
˜š
œ˜Kš
œ˜šžœ!˜$K˜šœ	žœ˜Kš
œ,˜,Kš
œ˜Kš
œ+˜+Kš
œ
˜
—K˜—Kš
œ˜—K˜
—šžœ˜Kšœžœ2˜Fšžœ6žœ
ž˜@šœžœ
˜šžœ
˜Kš
œ˜Kš
œ˜Kš
œ˜—Kš
œ
˜
——šžœ
žœžœ&žœ˜Lš
œ˜Kšœ"žœ˜G—Kšžœ žœ˜Ašžœ˜Kš
œ$˜$Kšœžœ
˜š
œ˜Kš
œ˜šžœ!˜$K˜šœ	žœ˜Kš
œE˜EKš
œ˜Kš
œ,˜,Kš
œ+˜+Kš
œ˜Kš
œ1˜1Kš
œ
˜
—K˜—Kš
œ˜—K˜—K˜—K˜—šžœ˜	šžœžœ˜ Kšœžœžœ
˜Kšœžœ!˜=Kšœžœ!˜=šŸœžœ.žœžœžœžœ˜bK˜"šžœž˜K˜"Kšžœžœžœžœ˜DKš
œ˜Kšžœ
˜—Kš
œN™Nšžœžœž˜AKš
œ/˜/—K˜—šŸœžœ.žœžœžœžœ˜bšžœžœ˜$Kš
œe™eKš
œ'˜'šžœž˜"Kš
œ,˜,Kšžœ!žœ
žœ
˜/Kš
œ˜Kšžœ
˜—K˜/K˜—K˜—K˜3Kšžœžœ4˜KK˜
—šžœ˜šŸ	œžœ.žœžœžœžœ˜`K˜K˜—Kš
œ/˜/K˜—Kš
œ˜—Kš
œ ˜ š
ž˜Kšœžœ
˜—K˜—šžœžœ
žœ˜Kšœžœ
˜š
œ˜Kš
œ˜šžœ!˜$K˜Kšœ	žœ?˜JK˜—Kš
œ˜—K˜
—š
ž˜š
žœžœ
žœ
žœžœžœ
ž˜?Kšœ
žœ˜!šžœžœ˜Kš
œ˜šžœžœ
žœ$ž˜KKš
œ$˜$—šžœž˜Kš
œR˜R—K˜—Kšžœ
˜——Kš
œ˜K˜—šŸœžœ˜š
œ˜šžœ˜Kšžœžœ˜#Kšžœžœ˜#Kš
œ
˜
—K˜—Kšœžœ˜Kšœžœ4˜=Kšžœ
žœ
žœ
žœ
˜šžœAžœ
žœ
ž˜\Kšœ
žœžœ˜1š
œ˜šžœ"˜$Kš
œ˜Kš
œ˜Kš
œ
˜
—Kš
œ˜—Kšœžœ
˜Kšžœ
˜—Kš
œ˜š
œ˜Kš
œ˜šžœ!˜$K˜Kš
œ˜K˜—Kš
œ˜—K˜—šŸ
œžœžœ˜,Kšžœžœžœ
žœ
˜=šžœžœ
ž˜ šžœ ž˜&Kš
œΠ
™Π
Kš
œ(˜(—Kšžœ
žœ
˜—Kšœžœ
˜š
œ˜Kš
œ˜šžœ!˜$K˜šœ	žœ˜Kš
œ˜Kš	œžœžœ
žœžœ˜Cš
œ˜Kšžœžœ
žœ
žœ&˜HKšžœ
žœ7˜>K˜—K˜
—K˜—Kš
œ˜—K˜—š
œ
˜
šžœ
˜Kš
œ
˜
šžœ˜Kšœ%žœ"žœ˜RKšœžœžœžœ™bKš
œ˜—š
œ˜Kšœžœ
˜Kšœ%žœE˜mKš
ž˜Kš
œ˜—Kš
œ˜—šžœžœ˜&Kšœžœžœ,˜VKš
œI˜Išžœ žœ
žœ˜,Kšœžœ
˜š
œ˜Kš
œ˜šžœ!˜$K˜šœ	žœ˜Kš
œ<˜<Kš
œ˜Kš
œ
˜
—K˜—Kš
œ˜—Kš
ž˜K˜—K˜—Kš
œ‰
™‰
šžœ.žœ˜6Kš
œA™AKš
œ˜Kš
œ™K˜Kš
œO™OK˜"K˜—Kš
œ˜—K˜—K˜K™K˜Kšœ
žœžœ˜$šœžœžœ˜Kšœžœ ˜,Kšœžœ ˜6Kšœžœ˜Kšœž˜K˜—K˜Kšœžœžœ
žœ˜(Kšœžœžœ˜%šœžœžœ˜Kšœžœžœ˜&Kšœžœž˜K˜—K˜Kšœžœ˜K˜Kšž
œϊ™ϋKšœ4žœ₯
žœ?žœ™¨K˜šŸœžœžœžœ˜LKšžœ
žœ6˜@K˜—K˜š
Ÿœžœžœ
žœžœ˜^Kš
œ)˜)Kšœžœ
˜Kšœžœ
˜šŸœžœ
žœ˜*Kšœžœ
˜#Kšžœ
žœ
žœžœ˜+K˜—šžœ
žœ
ž˜šœžœ˜
Kš
œV™VKš
œ˜—š
œ˜K™WKš
œ˜Kšœžœ
˜Kšžœžœžœ
˜6K˜—šžœ˜Kš
œ*™*Kš
œ˜š
ž˜Kš
œ™Kš	žœžœ
žœ
žœ ˜MK˜šžœ.žœ˜6Kš
œ™Kšžœ*žœžœ
˜JKšžœžœžœ
žœ
˜,K˜—š
ž˜˜Kš
œ˜Kšžœžœ ˜AK˜——Kšžœ
˜—K˜——Kš
œŽ
™Ž
K˜K˜Kš
œI™Išžœž˜ šžœ˜šžœ
žœ˜K˜'Kšœžœ
˜#K˜—Kšœžœ˜Kšœžœ
˜Kšœžœ
˜Kšœžœ4˜=Kšžœžœžœ˜AKšœ	žœ
žœžœ)˜Išžœ˜	Kšœžœ
žœžœ'˜<Kšœžœ˜Kšžœ3˜5šžœžœ˜Kš
œ™Kš
œ˜Kšžœ˜Kšœ
žœ˜!Kšœžœ'˜.Kšœžœ˜Kšžœ3˜5K˜—K˜—Kšžœ
˜K˜K˜
—Kšžœ
žœžœ
žœ)˜H—K˜—K˜šŸ
œžœ/˜?Kš
œ&˜&Kšœžœ˜šžœžœ
ž˜Kš
žœžœ
žœ4žœ
žœ˜MK˜Kš
œ˜š
ž˜Kšžœžœ
˜—Kšžœ
˜—Kš
œ™Kšžœžœ
žœžœ˜JKš
œ™Kšžœžœ
žœ˜1KšžœG˜KK˜K˜—K˜šŸ
œžœ˜,Kš
œ˜Kš
œ™šžœ#žœžœ
ž˜9Kšžœžœ˜%Kšžœ
˜—Kšœžœ
˜Kšžœžœ
žœ
žœ
˜(Kšœ! ˜<Kšœžœ ˜7Kšœžœ
˜šžœžœ
ž˜Kšžœžœ˜%Kš
œ˜Kšžœ
˜—K˜—K˜šŸœžœžœžœžœžœ˜=Kšžœ"˜(K˜—K˜Kšžœ
˜—…—Mάw