
DIRECTORY
Alloc USING [Notifier],
ConstArith USING [Const],
Literals USING [LitDescriptor],
MobDefs USING [Link, ModuleIndex],
OSMiscOps USING [WordAnd],
Symbols,
Tree USING [Index, Link, Map, NodeName, Scan];

MimP4: DEFINITIONS
IMPORTS OSMiscOps = {
OPEN Symbols;

mark: BOOL = FALSE;

ownGfi: MobDefs.ModuleIndex = 1;

Bias: TYPE = ConstArith.Const;


Repr: TYPE = MACHINE DEPENDENT {
none (0), signed (1), unsigned (2), either (3), real (4), addr (8), other (16), all (31)
};

CommonRep: PROC [r1: Repr, r2: Repr] RETURNS [Repr] = INLINE {
RETURN [LOOPHOLE [OSMiscOps.WordAnd[LOOPHOLE[r1, WORD], LOOPHOLE[r2, WORD]]]];
};


Prop: TYPE = MACHINE DEPENDENT RECORD [
noAssign: BOOL,
noXfer: BOOL,
noSelect: BOOL,
noFreeVar: BOOL,
immutable: BOOL];

fullProp: Prop = [
noAssign: TRUE, noXfer: TRUE, noSelect: TRUE, noFreeVar: TRUE, immutable: TRUE];
emptyProp: Prop = [
noAssign: FALSE, noXfer: FALSE, noSelect: FALSE, noFreeVar: FALSE, immutable: FALSE];
voidProp: Prop = fullProp;

CommonProp: PROC [p1: Prop, p2: Prop] RETURNS [Prop] = INLINE {
RETURN [LOOPHOLE [OSMiscOps.WordAnd[LOOPHOLE[p1, WORD], LOOPHOLE[p2, WORD]]]];
};


Attr: TYPE = PACKED RECORD [prop: Prop, rep: Repr];

voidAttr: Attr = [prop: voidProp, rep: none];

CommonAttr: PROC [a1: Attr, a2: Attr] RETURNS [Attr] = INLINE {
RETURN [LOOPHOLE [OSMiscOps.WordAnd[LOOPHOLE[a1, WORD], LOOPHOLE[a2, WORD]]]];
};


LayoutNotify, StmtNotify: Alloc.Notifier;
OpsNotify, ExpANotify, ExpBNotify, ExpCNotify: Alloc.Notifier;


tTRUE: READONLY Tree.Link;
tFALSE: READONLY Tree.Link;


returnRecord: RecordSEIndex;
resumeRecord: RecordSEIndex;

implicit: ImplicitRecord;
ImplicitRecord: TYPE = RECORD [
bias: Bias,	-- assumed bias of empty
lb: Bias,	-- assumed lb of empty (if meaningful)
ub: Bias,	-- assumed ub of empty (if meaningful)
type: Type,	-- assumed type of empty
attr: Attr,	-- assumed attributes of empty
sef: BOOL	-- assumed sense of SideEffectFree for empty
];
nullBias: READONLY Bias;	-- constant bias of zero

lockNode: Tree.Index;
resident: BOOL;


AssignImports: Tree.Scan;
InitMob: PROC [Tree.Link];
FinishMob: Tree.Scan;
MakeEPLink: PROC [ep: CARDINAL, gfi: MobDefs.ModuleIndex] RETURNS [MobDefs.Link];
MatchMob: PROC RETURNS [BOOL];
ProcessSymLiterals: PROC;


BiasForType: PROC [Type] RETURNS [Bias];
CanonicalType: PROC [Type] RETURNS [Type];
ClearType: PROC [Type] RETURNS [CSEIndex];
ComparableType: PROC [Type] RETURNS [BOOL];
DeclItem: Tree.Scan;
DeclUpdate: Tree.Map;
DefaultBasicOps: PROC [Type, BitCount] RETURNS [BOOL];
MaxCardinality: PROC [Type, BOOL, CARD] RETURNS [CARD];
RepForType: PROC [Type] RETURNS [Repr];
TypeExp: PROC [typeExp: Tree.Link, body: BOOL м FALSE, avoidId: BOOL м FALSE];
TypeForTree: PROC [Tree.Link] RETURNS [Type];
VarInit: SIGNAL RETURNS [BOOL];


AssignEntries: PROC [BTIndex];
AUsForType: PROC [Type] RETURNS [CARD];
BitsForType: PROC [Type] RETURNS [BitCount];
CheckBlock: PROC [BTIndex];
CheckFields: PROC [RecordSEIndex, BitCount];
LayoutArgs: PROC [RecordSEIndex, BitCount, BOOL] RETURNS [BitCount];
LayoutBlock: PROC [BTIndex, BitCount] RETURNS [BitCount];
LayoutFields: PROC [RecordSEIndex, BitCount];
LayoutGlobals: PROC [bti: CBTIndex] RETURNS [BitCount];
LayoutInterface: PROC [bti: CBTIndex] RETURNS [nEntries: CARDINAL];
LayoutLocals: PROC [CBTIndex] RETURNS [BitCount];
MarkArgs: PROC [Type];
WordsForType: PROC [Type] RETURNS [CARD];


currentLevel: VAR ContextLevel;
checked: VAR BOOL;

BindCase: PROC
[Tree.Index, Tree.NodeName, PROC [Tree.Link, Bias] RETURNS [Tree.Link]]
RETURNS [Tree.Link];
BindType: PROC [Tree.Index, Tree.Map] RETURNS [Tree.Link];
Body: PROC [CBTIndex];
CaseDriver: PROC [Tree.Index, Tree.Map, Bias] RETURNS [Tree.Link];
CatchNest: PROC [Tree.Link];
KillTree: PROC [t: Tree.Link] RETURNS [Tree.Link];
MarkString: PROC [local: BOOLмTRUE];
Subst: PROC [Tree.Index] RETURNS [Tree.Link];


RelOp: TYPE = Tree.NodeName [relE .. relLE];

BoolTest: PROC [Tree.Link] RETURNS [BOOL];
FoldExpr: PROC [Tree.Index, Repr] RETURNS [Tree.Link];
LiteralRep: PROC [Tree.Link, Repr] RETURNS [Repr];
LongToShort: PROC [Tree.Index, Repr] RETURNS [Tree.Link];
MakeTreeLiteralCard: PROC [CARD] RETURNS [Tree.Link];
MakeTreeLiteralInt: PROC [INT] RETURNS [Tree.Link];
RelTest: PROC [l,r: Tree.Link, op: RelOp, rep: Repr] RETURNS [BOOL];
ShortToLong: PROC [Tree.Index, Repr] RETURNS [Tree.Link];
StructuredLiteral: PROC [Tree.Link] RETURNS [BOOL];
TreeLiteral: PROC [t: Tree.Link, allowLong: BOOL м FALSE] RETURNS [BOOL];
TreeLiteralConst: PROC [Tree.Link] RETURNS [ConstArith.Const];
TreeLiteralDesc: PROC [Tree.Link] RETURNS [Literals.LitDescriptor];
TreeLiteralCard: PROC [Tree.Link] RETURNS [CARD];
TreeLiteralInt: PROC [Tree.Link] RETURNS [INT];
ZeroP: PROC [Tree.Link] RETURNS [BOOL];


ConsState: TYPE = {init, first, rest};
Covering: TYPE = {none, partial, full};

All: PROC [node: Tree.Index, cs: ConsStateм$init] RETURNS [Tree.Link];
Assignment: PROC [Tree.Index] RETURNS [Tree.Link];
Bounds: PROC [Type, Repr] RETURNS [lb, ub: ConstArith.Const];
Call: PROC [Tree.Index] RETURNS [Tree.Link];
CheckRange: PROC [Tree.Link, CARD, Type] RETURNS [Tree.Link];
Construct: PROC [node: Tree.Index, cs: ConsStateм$init] RETURNS [Tree.Link];
Cover: PROC [lType: Type, lRep: Repr, rType: Type, rRep: Repr] RETURNS [Covering];
Dollar: PROC [Tree.Index] RETURNS [Tree.Link];
Dot: PROC [Tree.Index, Repr] RETURNS [Tree.Link];
Extract: PROC [Tree.Index] RETURNS [Tree.Link];
Index: PROC [Tree.Index] RETURNS [Tree.Link];
ListCons: PUBLIC PROC [Tree.Index] RETURNS [Tree.Link];
MakeArgRecord: PROC [RecordSEIndex, Tree.Link] RETURNS [Tree.Link];
Narrow: PROC [Tree.Index] RETURNS [Tree.Link];
New: PROC [Tree.Index] RETURNS [Tree.Link];
OperandStruct: PROC [t: Tree.Link, clear: BOOL] RETURNS [CSEIndex];
PadRecord: PROC [t: Tree.Link, lType: Type] RETURNS [Tree.Link];
RewriteAssign: PROC [Tree.Index, Type] RETURNS [Tree.Link];
Reloc: PROC [Tree.Index] RETURNS [Tree.Link];
Rhs: PROC [exp: Tree.Link, lhsType: Type, cs: ConsStateм$init, voidOK: BOOLмFALSE]
RETURNS [Tree.Link];
RowConstruct: PROC [node: Tree.Index, cs: ConsStateм$init] RETURNS [Tree.Link];
SeqIndex: PROC [Tree.Index] RETURNS [Tree.Link];
SetSubInfo: PROC [t: Tree.Link, type: Type];
SetType: PROC [Type];
Substx: PROC [Tree.Index] RETURNS [Tree.Link];
UnbiasedOffset: PROC [type: Type] RETURNS [INT];
Union: PROC [node: Tree.Index, cs: ConsStateм$init] RETURNS [Tree.Link];


ExpInit: PROC;
ExpReset: PROC;

AdjustBias: PROC [t: Tree.Link, rep: Repr, bias: Bias, negateBias: BOOL] RETURNS [Tree.Link];
BoolValue: PROC [t: Tree.Link] RETURNS [Tree.Link];
CheckSign: PROC [Tree.Link, Type] RETURNS [Tree.Link];
ConstMax: PROC [c1, c2: ConstArith.Const] RETURNS [ConstArith.Const];
ConstMin: PROC [c1, c2: ConstArith.Const] RETURNS [ConstArith.Const];
Exp: PROC [Tree.Link, Repr] RETURNS [Tree.Link];
ExpArith: PROC
[exp: Tree.Link, target: Repr, removeBias: BOOL м FALSE] RETURNS [Tree.Link];
ForceType: PROC [Tree.Link, Type] RETURNS [Tree.Link];
LiteralAttr: PROC [Repr] RETURNS [Attr];
MakeStructuredCard: PROC [val: CARD, type: Type] RETURNS [Tree.Link];
MakeStructuredInt: PROC [val: INT, type: Type] RETURNS [Tree.Link];
NeutralExp: Tree.Map;
OperandType: PROC [Tree.Link] RETURNS [Type];
RValue: PROC [exp: Tree.Link, bias: Bias, target: Repr] RETURNS [Tree.Link];
SideEffectFree: PROC [t: Tree.Link] RETURNS [BOOL];
TreeBounds: PROC [t: Tree.Link, rep: Repr] RETURNS [lb, ub: ConstArith.Const];
VAttr: PROC RETURNS [Attr];
VBias: PROC RETURNS [Bias];
VPop: PROC;
VProp: PROC RETURNS [Prop];
VPush: PROC [bias: Bias, attr: Attr];
VRep: PROC RETURNS [Repr];
VSetTop: PROC [bias: Bias, attr: Attr, nPops: NAT];


AddrOp: PROC [Tree.Index] RETURNS [Tree.Link];
ConstantInterval: PROC [Tree.Link] RETURNS [origin, range: Bias];
Interval: PROC [Tree.Link, Bias, Repr] RETURNS [const: BOOL];
IsSize: PROC [Tree.Link] RETURNS [BOOL];
Nil: PROC [Tree.Index] RETURNS [Tree.Link];
NormalizeRange: PROC [Tree.Link] RETURNS [Tree.Link];
MiscXfer: PROC [Tree.Index] RETURNS [Tree.Link];
TypeOp: PROC [Tree.Index] RETURNS [Tree.Link];

EmptyInterval: SIGNAL;

}.

  $  
MimP4.mesa
Copyright ╙ 1985, 1986, 1987, 1988, 1989, 1991 by Xerox Corporation.  All rights reserved.
Satterthwaite, June 19, 1986 9:31:18 am PDT
Russ Atkinson (RRA) October 11, 1989 6:43:38 pm PDT
JKF August 15, 1988 2:40:09 pm PDT
representations (interim)
properties (synthesized)
attributes
notifiers
variables exported by Pass4B
intermediate result bookkeeping
procs exported by Pass4B
exported by Pass4D
exported by Pass4L
Performs Pass4 processing on a transfer type
exported by Pass4S
kills off the given true, returning Tree.Null;
will disable any procedure declarations found within the tree as well
exported by Pass4Ops
exported by Pass4Xa
exported by Pass4Xb
Returns a conservative estimate as to whether or not the tree will evaluate without side effects (memory changes, signals, and the like).
the same as {THROUGH [0..nPops) VPop[]; ENDLOOP; VPush[bias, attr]}
exported by Pass4Xc
Indicates whether the expression denotes addressing units.  Quite conservative.  Must be invoked prior to Pass4 Exp processing (or the constants go away).
 Э╩U  ХNewlineDelimiter
Ц(cedarcode) styleЩ headЪЬ
Щ
IcodeЪЬ
╧eЬOЩZLЪ╧y(╨kyЩ+LЪЬ╧kЬ!Щ3LЩ"ЧШ Ъа	Ш	LЪЬаЬШLЪЬаЬ	ШLЪЬ	аЬШLЪЬаЬШ"LЪЬ
аЬШLЪЬШLЪЬаЬ$Ш.LШ ЧЧЪ╧nЬаШLЪаЬШLЪаЬ	ШLШ LЪЬаЬаЬШLШ LШ LШ LЪЬаЬШLШ ЧLЪЬЩШ ЪЬаЬаЬа	ЬШ LШXLЪЬШLШ ЧЪб	ЬаЬаЬ
аЬШ>LЪаЬаЬаЬаЬаЬаЬШNLЪЬШЧLШ ЧLЪЬЩШ ЪЬаЬаЬШ'LЪЬ
аЬШLЪЬаЬШLЪЬ
аЬШLЪЬаЬШLЪЬаЬШLШ ЧШLЪЬ
аЬ
аЬаЬаЬаЬШPЧШLЪЬ
аЬ
аЬаЬаЬаЬШUЧLШLШ Ъб
ЬаЬаЬ
аЬШ?LЪаЬаЬаЬаЬаЬаЬШNLЪЬШЧLШ ЧLЪЬ
Щ
Ш LЪЬаЬаЬаЬШ3LШ LШ-LШ Ъб
ЬаЬаЬ
аЬШ?LЪаЬаЬаЬаЬаЬаЬШNLЪЬШЧLШ ЧLЪЬ	Щ	Ш LЪЬ)Ш)LЪЬ>Ш>LШ ЧЪЬЩLШ LЪЬаЬШLЪЬаЬШLШ LЪЬЩLШ LЪЬШLЪЬШLШ LШЪЬаЬаЬШLЪЬ╧cШ$LЪЬ
в&Ш0LЪЬ
в&Ш0LЪЬвШ$LЪЬвШ*LЪЬаЬв,Ш6LШЧLЪЬ
аЬвШ1LШ LЪЬШLЪЬ
аЬШLШ ЧЪЬЩLШ LЪбЬШLЪбЬаЬШLЪб	ЬШLЪб
ЬаЬаЬаЬШQLЪбЬаЬаЬаЬШLЪбЬаЬШLШ ЧLЪЬЩШ LЪбЬаЬаЬШ(LЪбЬаЬаЬШ*LЪб	ЬаЬаЬШ*LЪбЬаЬаЬаЬШ+LЪбЬШLЪб
ЬШLЪбЬаЬаЬаЬШ6LЪбЬаЬаЬаЬаЬаЬШ7LЪб
ЬаЬаЬШ'LЪбЬаЬаЬаЬаЬаЬШNLЪбЬаЬаЬШ-LЪбЬаЬаЬаЬШLШ ЧLЪЬЩШ LЪбЬаЬШLЪб
ЬаЬаЬаЬШ'LЪбЬаЬаЬШ,LЪб
ЬаЬШLЪбЬаЬШ,LЪб
ЬаЬаЬаЬШDLЪбЬаЬаЬШ9LЪбЬаЬШ-LЪбЬаЬаЬШ7LЪбЬаЬаЬаЬШCLЪбЬаЬаЬШ1ЪбЬаЬШLЩ,ЧLЪбЬаЬаЬаЬШ)LШ ЧLЪЬЩШ LЪЬаЬШLЪЬ	аЬаЬШLШ LЪ
бЬаЬаЬаЬаЬШkLЪбЬаЬаЬШ:LЪбЬаЬШLЪб
ЬаЬаЬШBLЪб	ЬаЬШЪбЬаЬаЬШ2LЪЬtЩtЧLЪб
ЬаЬ	а	ЬШ$LЪбЬаЬаЬШ-LШ ЧLЪЬЩШ LЪЬаЬ!Ш,LШ LЪбЬаЬаЬаЬШ*LЪбЬаЬаЬШ6LЪб
ЬаЬаЬШ2LЪбЬаЬаЬШ9LЪбЬаЬаЬаЬШ5LЪбЬаЬаЬаЬШ3LЪбЬаЬ(аЬаЬШDLЪбЬаЬаЬШ9LЪбЬаЬаЬаЬШ3LЪбЬаЬаЬаЬаЬаЬШILЪбЬаЬаЬШ>LЪбЬаЬаЬШCLЪбЬаЬаЬаЬШ1LЪбЬаЬаЬаЬШ/LЪбЬаЬаЬаЬШ'LШ ЧLЪЬЩШ LЪЬаЬШ&LЪЬ
аЬШ'LШ LЪбЬаЬ)аЬШFLЪб
ЬаЬаЬШ2LЪбЬаЬаЬШ=LЪбЬаЬаЬШ,LЪб
ЬаЬаЬаЬШ=LЪб	ЬаЬ)аЬШLLЪбЬаЬ4аЬШRLЪбЬаЬаЬШ.LЪбЬаЬаЬШ1LЪбЬаЬаЬШ/LЪбЬаЬаЬШ-LЪбЬаЬаЬаЬШ7LЪбЬаЬаЬШCLЪбЬаЬаЬШ.LЪбЬаЬаЬШ+LЪбЬаЬаЬаЬШCLЪб	ЬаЬаЬШ@LЪбЬаЬаЬШ;LЪбЬаЬаЬШ-LЪбЬаЬ>а
ЬаЬШgLЪбЬаЬ)аЬШOLЪбЬаЬаЬШ0LЪб
ЬаЬШ,LЪбЬаЬШLЪбЬаЬаЬШ.LЪбЬаЬаЬаЬШ0LЪбЬаЬ)аЬШHLШ ЧLЪЬЩШ LЪбЬаЬШLЪбЬаЬШLШ LЪб
ЬаЬ3аЬаЬШ]LЪб	ЬаЬаЬШ3LЪб	ЬаЬаЬШ6LЪбЬаЬаЬШELЪбЬаЬаЬШELЪбЬаЬаЬШ0LЪ
бЬаЬ+аЬаЬаЬШ\LЪб	ЬаЬаЬШ6LЪбЬаЬаЬШ(LЪбЬаЬаЬаЬШELЪбЬаЬаЬаЬШCLЪб
ЬШLЪбЬаЬаЬШ-LЪбЬаЬ,аЬШLЪбЬаЬаЬаЬШ3LЩЙЧLЪб
ЬаЬаЬШNLЪбЬаЬаЬШLЪбЬаЬаЬШLЪбЬаЬШLЪбЬаЬаЬШLЪбЬаЬШ%LЪбЬаЬаЬШЪбЬаЬ!аЬШ3LЪЬаЬаЬЩCЧLШ ЧLЪЬЩШ LЪбЬаЬаЬШ.LЪбЬаЬаЬШALЪбЬаЬаЬ	аЬШ=ЪбЬаЬаЬаЬШ(LЩЪЧLЪбЬаЬаЬШ+LЪбЬаЬаЬШ5LЪбЬаЬаЬШ0LЪбЬаЬаЬШ.LШ ЪбЬаЬШLШ ЧШLШ ЧЧЧ ЕЧ    t  /э  