
DIRECTORY
Alloc USING [Handle],
ConstArith USING [Const],
IntCodeDefs USING [ArithClass, ArithSelector, CaseList, CedarSelector, Comparator, Count, Label, Location, LogicalId, MesaSelector, Node, NodeList, nullVariableId, Var, VarList],
MimCode USING [BitAddress, BitCount, CodeList, VLoc],
RCMap USING [Base, Index],
Symbols USING [Alignment, CSEIndex, CTXIndex, ISEIndex, RecordSEIndex, Type, typeANY],
Target: TYPE MachineParms USING [bitsPerWord],
Tree USING [Index, Link];

MimP5U: CEDAR DEFINITIONS = {
OPEN IntCodeDefs, MimCode, Symbols, Target;
RecOrFnProc: TYPE = UNSAFE PROC
[ise: ISEIndex] RETURNS [offset: MimCode.BitAddress, size: INT];
RecField: RecOrFnProc;
FnField: RecOrFnProc;
Address: PROC [node: Node] RETURNS [Node];
AddrExtend: PROC [n: Node, to: BitCount м bitsPerWord] RETURNS [Node];
AdjustLoc: UNSAFE PROC [vl: VLoc, rSei: RecordSEIndex, fSei: ISEIndex, tBits: BitCount]
RETURNS [VLoc];
AlignmentFromTree: UNSAFE PROC [t: Tree.Link, needsDeref: BOOL м FALSE]
RETURNS [Symbols.Alignment];
AlignmentFromType: UNSAFE PROC [type: Type, needsDeref: BOOL м FALSE]
RETURNS [Symbols.Alignment];
AllocLabel: PROC [id: LogicalId м LAST[LogicalId]] RETURNS [Label];
AppendNodeList: PROC [cl: CodeList, nodes: NodeList];
ApplyOp: PROC [oper: Node, args: NodeList, bits: Count м 0] RETURNS [Node];
ArithClassForTree: UNSAFE PROC [node: Tree.Index] RETURNS [ac: ArithClass];
ArithClassForType: UNSAFE PROC [type: Type] RETURNS [ac: ArithClass];
ArithOp: PROC [op: ArithSelector, ac: ArithClass] RETURNS [Node];
ArithOpForTree: UNSAFE PROC [node: Tree.Index, op: ArithSelector] RETURNS [Node];
Assign: PROC [lhs: Var, rhs: Node] RETURNS [Node];
AssignRC: UNSAFE PROC
[lhs: Var, rhs: Node, type: Type, init: BOOL м FALSE] RETURNS [Node];
BinaryArithOp: PROC [op: ArithSelector, ac: ArithClass, n1, n2: Node] RETURNS [Node];
BitsForOperand: UNSAFE PROC [t: Tree.Link] RETURNS [INT];
BitsForType: UNSAFE PROC [sei: Type] RETURNS [INT];
BoolTest: PROC [exp: Node] RETURNS [BoolTestValue];
BoolTestValue: TYPE = {true, false, unknown};
BoundsCheck: PROC [exp, bound: Node] RETURNS [Node];
CedarOpNode: PROC [op: CedarSelector, info: INT м 0] RETURNS [Node];
CgenUtilInit: UNSAFE PROC [ownTable: Alloc.Handle];
CJump: PROC [cl: CodeList, test: Comparator, op1, op2: Node, ac: ArithClass, target: Label, backwards: BOOL м FALSE];
CompareOp: PROC [sense: Comparator, ac: ArithClass] RETURNS [Node];
ConvertOpNode: PROC [from, to: ArithClass] RETURNS [Node];
CreateTemp: UNSAFE PROC [bits: BitCount, type: Type м typeANY]
RETURNS [var: Var, sei: ISEIndex];
Declare: PROC [cl: CodeList, var: Var, init: Node м NIL];
Deref: PROC [n: Node, bits: Count, align: Symbols.Alignment] RETURNS [Var];
EqualTest: PROC [n1: Node, n2: Node, negate: BOOL м FALSE] RETURNS [Node];
Extend: UNSAFE PROC [n: Node, bits: BitCount, type: Type] RETURNS [Node];
ExtractList: PROC [cl: CodeList] RETURNS [NodeList];
ForceBool: PROC [n: Node, negate: BOOL м FALSE] RETURNS [Node];
FormalVar: PROC [bits: BitCount] RETURNS [Var];
FullWordBits: PROC [bits: BitCount] RETURNS [BitCount];
GetRCMapBase: UNSAFE PROC RETURNS [RCMap.Base];
InsertLabel: PROC [cl: CodeList, lbl: Label];
IsZero: PROC [n: Node] RETURNS [BOOL];
Jump: PROC [cl: CodeList, target: Label, backwards: BOOL м FALSE];
LabelAddress: PROC [label: Label, direct: BOOL м FALSE] RETURNS [Node];
MakeArgList2: PROC [first: Node, second: Node] RETURNS [NodeList];
MakeArgList: PROC [first: Node, last: NodeList м NIL] RETURNS [NodeList];
MakeBlock: PROC [cl: CodeList, bits: BitCount м 0] RETURNS [Node];
MakeCaseList: PROC [tests: NodeList, body: Node, rest: CaseList м NIL] RETURNS [CaseList];
MakeComposite: PROC [parts: NodeList, bits: BitCount м 0] RETURNS [Var];
MakeConstCard: PROC [card: CARD, bits: BitCount м bitsPerWord] RETURNS [Node];
MakeConstInt: PROC [int: INT, bits: BitCount м bitsPerWord] RETURNS [Node];
MakeDummy: PROC [bits: BitCount м bitsPerWord] RETURNS [Node];
MakeGoTo: PROC [label: Label, backwards: BOOL м FALSE] RETURNS [Node];
MakeNodeList2: PROC [first, second: Node] RETURNS [NodeList];
MakeNodeList: PROC [first: Node, last: NodeList м NIL] RETURNS [NodeList];
MakeReturn: PROC [rets: NodeList] RETURNS [Node];
MakeTemp: UNSAFE PROC [cl: CodeList, bits: BitCount, init: Node м NIL, type: Type м typeANY] RETURNS [var: Var, sei: ISEIndex];
MakeVar: PROC [bits: Count, id: LogicalId м nullVariableId, loc: Location] RETURNS [Var];
MakeVarList: PROC [first: Var, last: VarList м NIL] RETURNS [VarList];
MaybeBlock: PROC [cl: CodeList, l: Node] RETURNS [Node];
MesaOpNode: PROC [op: MesaSelector, info: INT м 0, bits: INT м 0] RETURNS [Node];
MoreCode: PROC [cl: CodeList, n: Node];
NewCodeList: PROC RETURNS [CodeList];
NextVar: UNSAFE PROC [sei: ISEIndex] RETURNS [ISEIndex];
NilConst: UNSAFE PROC [type: CSEIndex] RETURNS [Node];
NodeAnd: PROC [n1, n2: Node] RETURNS [Node];
NodeForType: UNSAFE PROC [type: Type] RETURNS [Node];
NodeIf: PROC [test, then, else: Node] RETURNS [Node];
NodeOr: PROC [n1, n2: Node] RETURNS [Node];
OperandType: UNSAFE PROC [t: Tree.Link] RETURNS [sei: CSEIndex];
PadArgList: PROC [args: NodeList] RETURNS [NodeList];
ProcessSafens: UNSAFE PROC
[cl: CodeList, t: Tree.Link, ignore: BOOL м FALSE] RETURNS [Tree.Link];
RCMapForType: UNSAFE PROC [type: Symbols.Type] RETURNS [RCMap.Index];
RealExtend: PROC [n: Node, to: BitCount м bitsPerWord] RETURNS [Node];
ReferentType: UNSAFE PROC [type: Type] RETURNS [Type];
SignExtend: PROC [n: Node, to: BitCount м bitsPerWord] RETURNS [Node];
Simplify: PROC [cl: CodeList, node: Node] RETURNS [Node];
TakeField: PROC [n: Node, start: INT, bits: INT] RETURNS [Node];
TakeFieldVar: PROC [n: Node, start: INT, bits: INT] RETURNS [Var];
TreeLiteralValue: UNSAFE PROC [t: Tree.Link] RETURNS [ConstArith.Const];
TypeForTree: UNSAFE PROC [t: Tree.Link] RETURNS [Type];
VariantTag: UNSAFE PROC [type: Type, ctx: CTXIndex] RETURNS [CARD];
WordsForBits: PROC [b: INT] RETURNS [INT];
WordsForOperand: UNSAFE PROC [t: Tree.Link] RETURNS [INT];
WordsForSei: UNSAFE PROC [sei: Type] RETURNS [INT];
ZeroExtend: PROC [n: Node, to: BitCount м bitsPerWord, forceLeft: BOOL м FALSE]
RETURNS [cvt: Node];
}.

  ф  
MimP5U.mesa
Copyright ╙ 1985, 1986, 1987, 1988, 1989, 1991 by Xerox Corporation.  All rights reserved.
Sweet, May 31, 1986 9:57:19 pm PDT
Satterthwaite, November 14, 1985 11:43:28 am PST
Russ Atkinson (RRA) December 3, 1989 11:42:07 am PST
Temp replacement for SymbolOps.RecField & SymbolOps.FnField
Normal operations
Forces the given node to be a clean boolean test, with optional negation.
NIL is ignored as an input, though.
Returns the base needed to interpret RC maps
If bits = 0 then the bits are calculated from the parts
Returns the RC map index for the given type
Returns a simple node (side-effect free) for the original node.  Any temps needed are declared in the given code list.
= NARROW[TakeField[n, start, bits]]
Computes the # of words for the symbol given by sei.
Extends the value described by n to be at least to bits long.  No zeros are added if n.bits >= to.  Zeros are added to the left if forceLeft or to < bitsPerWord.  Otherwise, zero bits are added on the right.
Э╩└  ХNewlineDelimiter
Ц(cedarcode) styleЩ headЪЬЩIcodeЪЬ
╧eЬOЩZLЪ╧y"Щ"LЪЮ0Щ0LЩ4ЧШ Ъ╧k	Ш	LЪЬЯЬ
ШLЪЬЯЬ	ШLЪЬЯЬбШ▓LЪЬЯЬ(Ш5LЪЬЯЬШLЪЬЯЬIШVLЪЬЯЬЯЬШ.LЪЬЯЬШЧЧLШ Ъ╧nЬЯЬШLЪЯЬ'Ш+ЧЪЬ;Щ;LЪ	ЬЯЬЯЬЯЬ$ЯЬШ`LЪаЬШLЪаЬШЧЪЬЩLЪаЬЯЬЯЬШ*LЪа
ЬЯЬ'ЯЬШFLЪа	ЬЯЬЯЬBЯЬШgLЪаЬЯЬЯЬЯЬЯЬЯЬШdLЪ
аЬЯЬЯЬЯЬЯЬШbLЪа
ЬЯЬЯЬЯЬ	ШCLЪаЬЯЬ!Ш5LЪаЬЯЬ/ЯЬШKLЪаЬЯЬЯЬШKLЪаЬЯЬЯЬШELЪаЬЯЬ%ЯЬШALЪаЬЯЬ'ЯЬШQLЪаЬЯЬЯЬШ2LЪаЬЯЬЯЬ)ЯЬЯЬЯЬШ[LЪаЬЯЬ3ЯЬШULЪаЬЯЬЯЬЯЬШ9LЪаЬЯЬЯЬЯЬШ3ЪаЬЯЬЯЬШ3LЪЬЯЬШ-ЧLЪаЬЯЬЯЬШ4LЪаЬЯЬЯЬЯЬШDLЪаЬЯЬШ3LЪаЬЯЬ\ЯЬЯЬШuLЪа	ЬЯЬ%ЯЬШCLЪаЬЯЬЯЬШ:LЪа
ЬЯЬ(ЯЬШaLЪаЬЯЬ'ЯЬШ9LЪаЬЯЬ2ЯЬШKLЪ
а	ЬЯЬЯЬЯЬЯЬШJLЪаЬЯЬЯЬ'ЯЬШILЪаЬЯЬЯЬШ4Ъ
а	ЬЯЬЯЬЯЬЯЬШ?LЩILЩ#ЧLЪа	ЬЯЬЯЬШ/LЪаЬЯЬЯЬШ7ЪаЬЯЬЯЬШ/LЪЬ,Щ,ЧLЪаЬЯЬШ-LЪаЬЯЬЯЬЯЬШ&LЪаЬЯЬ*ЯЬЯЬШBLЪ
аЬЯЬЯЬЯЬЯЬШGLЪаЬЯЬЯЬШBLЪаЬЯЬ ЯЬЯЬШILЪа	ЬЯЬ$ЯЬШBLЪаЬЯЬ0ЯЬЯЬШZЪаЬЯЬ'ЯЬШHLЩ7ЧLЪаЬЯЬЯЬ ЯЬШNLЪаЬЯЬЯЬ ЯЬШKLЪа	ЬЯЬ ЯЬШ>LЪ
аЬЯЬЯЬЯЬЯЬШFLЪаЬЯЬЯЬШ=LЪаЬЯЬ ЯЬЯЬШJLЪа
ЬЯЬЯЬШ1LЪ
аЬЯЬЯЬ-ЯЬЯЬШLЪаЬЯЬ>ЯЬШYLЪаЬЯЬЯЬЯЬШFLЪа
ЬЯЬЯЬШ8LЪ
а
ЬЯЬЯЬЯЬЯЬШQLЪаЬЯЬШ'LЪаЬЯЬЯЬШ%LЪаЬЯЬЯЬЯЬШ8LЪаЬЯЬЯЬЯЬШ6LЪаЬЯЬЯЬШ,LЪаЬЯЬЯЬШ5LЪаЬЯЬЯЬШ5LЪаЬЯЬЯЬШ+LЪаЬЯЬЯЬШ@LЪа
ЬЯЬЯЬШ5LЪ
аЬЯЬ&ЯЬЯЬЯЬШbЪаЬЯЬЯЬЯЬШELЪЬ+Щ+ЧLЪа
ЬЯЬ'ЯЬШFLЪаЬЯЬЯЬЯЬШ6LЪа
ЬЯЬ'ЯЬШFЪаЬЯЬЯЬШ9LЩvЧLЪ
а	ЬЯЬЯЬЯЬЯЬШ@Ъ
аЬЯЬЯЬЯЬЯЬШBLЪЬЯЬЩ#ЧLЪаЬЯЬЯЬЯЬШHLЪаЬЯЬЯЬЯЬШ7LЪ
а
ЬЯЬЯЬЯЬЯЬШCLЪ
аЬЯЬЯЬЯЬЯЬШ*LЪ
аЬЯЬЯЬЯЬЯЬШ:Ъ
аЬЯЬЯЬЯЬЯЬШ3LЪЬ0╧zЬЩ4ЧЪ
а
ЬЯЬ2ЯЬЯЬЯЬШdLЪЬбЬбЬ#бЬбЬ"б	ЬбЬ=Щ╧ЧЧШLШ ЧЧ ЕЧ    Є  #Ц  