DIRECTORY
Alloc: TYPE USING [FreeChunk, GetChunk, Handle, Notifier, Words],
Code: TYPE USING [
bodyFileIndex, codeptr, fileindex, xtracting, xtractsei, ZEROlexeme],
CodeDefs: TYPE USING [
Base, Byte, CCIndex, CCItem, CCNull, ChunkIndex, CodeCCIndex, CodeChunkType,
codeType, JumpCCIndex, JumpCCNull, JumpType, LabelCCIndex, LabelCCNull,
Lexeme, NULLfileindex, OpWordCount, RelFileIndex],
ComData: TYPE USING [typeSTRING],
DebuggerSwap: TYPE USING [CallDebugger],
FOpCodes: TYPE USING [qJ, qJREL, qLI],
LiteralOps: TYPE USING [Find, FindDescriptor, Value],
OpTableDefs: TYPE USING [InstLength],
P5: TYPE USING [NumberOfParams, P5Error, PushEffect],
P5U: TYPE USING [],
PackageSymbols: TYPE USING [ConstRecord, constType, WordIndex],
PrincOps: TYPE USING [FrameVec],
Stack: TYPE USING [Check],
SymbolOps: TYPE USING [
FirstCtxSe, NextSe, NormalType, RecordRoot, TypeRoot, UnderType, WordsForType],
Symbols: TYPE USING [
Base, BitAddress, CSEIndex, CTXIndex, ISEIndex, ISENull, RecordSEIndex, 
SEIndex, SENull, seType, typeANY, typeTYPE, WordLength],
Table: TYPE USING [Base, Limit],
Tree: TYPE USING [Base, Index, Link, Null, NullIndex, treeType],
TreeOps: TYPE USING [PopTree, PushNode, PushTree, ScanList, SetInfo];

CgenUtil: PROGRAM
IMPORTS Alloc, MPtr: ComData, CPtr: Code, DebuggerSwap, LiteralOps, OpTableDefs,
P5, Stack, SymbolOps, TreeOps 
EXPORTS P5U =
BEGIN
OPEN SymbolOps, CodeDefs;

BitAddress: TYPE = Symbols.BitAddress;
CSEIndex: TYPE = Symbols.CSEIndex;
ISEIndex: TYPE = Symbols.ISEIndex;
ISENull: ISEIndex = Symbols.ISENull;
RecordSEIndex: TYPE = Symbols.RecordSEIndex;
SEIndex: TYPE = Symbols.SEIndex;
SENull: SEIndex = Symbols.SENull;
WordLength: CARDINAL = Symbols.WordLength;

table: Alloc.Handle _ NIL;

tb: Tree.Base;		-- tree base (local copy)
seb: Symbols.Base;		-- semantic entry base (local copy)
cb: CodeDefs.Base;		-- code base (local copy)
cstb: Table.Base;		-- constant table base (local copy)

CgenUtilNotify: PUBLIC Alloc.Notifier =
BEGIN  -- called by allocator whenever table area is repacked
seb _ base[Symbols.seType];
tb _ base[Tree.treeType];
cb _ base[codeType];
cstb _ base[PackageSymbols.constType];
END;

AllocCodeCCItem: PUBLIC PROC [n: [0..3]] RETURNS [c: CodeCCIndex] =
BEGIN
c _ GetChunk[CCItem.code.SIZE + n];
cb[c] _ CCItem[free: FALSE, flink: CCNull, blink: CCNull, ccvalue:
code[inst: 0, realinst: FALSE, isize: 0, fill: 0, parameters: ]];
LinkCCItem[c];
RETURN
END;

BitsForOperand: PUBLIC PROC [t: Tree.Link] RETURNS [CARDINAL] =
BEGIN
RETURN [WITH t SELECT FROM
literal => WordLength,	-- not always TRUE, but good enough
ENDCASE => BitsForType[OperandType[t]]]
END;

BitsForType: PUBLIC PROC [sei: SEIndex] RETURNS [CARDINAL] =
BEGIN
csei: CSEIndex = UnderType[sei];
RETURN [WITH seb[csei] SELECT FROM
record => length,
ENDCASE => CARDINAL[WordsForType[csei]]*WordLength]
END;

CCellAlloc: PUBLIC PROC [t: CodeChunkType] =
BEGIN -- allocates a cell for other than code or label
c: CCIndex;
nwords: CARDINAL;
SELECT t FROM
code => P5.P5Error[262];
label => P5.P5Error[263];
jump => nwords _ CCItem.jump.SIZE;
other => nwords _ CCItem.other.SIZE;	-- NB: not relSource OR absSource
ENDCASE;
c _ GetChunk[nwords];
SELECT t FROM
jump => cb[c] _ CCItem[free: FALSE, flink: , blink: , ccvalue: jump[,,,,,,,]];
other => cb[c] _ CCItem[free: FALSE, flink: , blink: , ccvalue: other[obody: ]];
ENDCASE;
LinkCCItem[c];
END;

CgenUtilInit: PUBLIC PROC [ownTable: Alloc.Handle] =
BEGIN
table _ ownTable;
CPtr.ZEROlexeme _ Lexeme[literal[word[LiteralOps.Find[0].lti]]];
CPtr.fileindex _ 0;
END;

ComputeFrameSize: PUBLIC PROC [fs: CARDINAL] RETURNS [CARDINAL] =
BEGIN -- finds alloc-vector index for frame of size fs
OPEN PrincOps;
FOR fx: CARDINAL IN [0..FrameVec.LENGTH) DO
IF fs <= FrameVec[fx] THEN RETURN [fx] ENDLOOP;
ERROR
END;

CreateLabel: PUBLIC PROC RETURNS [c: LabelCCIndex] =
BEGIN -- allocates and inserts a label at codeptr
c _ LabelAlloc[];
InsertLabel[c];
END;

DeleteCell: PUBLIC PROC [c: CCIndex] =
BEGIN -- deletes cell from code stream
nwords: CARDINAL;
IF cb[c].blink # CCNull THEN cb[cb[c].blink].flink _ cb[c].flink;
IF cb[c].flink # CCNull THEN cb[cb[c].flink].blink _ cb[c].blink;
nwords _ WITH cc: cb[c] SELECT FROM
code => ParamCount[LOOPHOLE[c]] + CCItem.code.SIZE,
label => CCItem.label.SIZE,
jump => CCItem.jump.SIZE,
other => WITH cc SELECT FROM
absSource => CCItem.other.absSource.SIZE,
relSource => CCItem.other.relSource.SIZE,
ENDCASE => CCItem.other.SIZE,	-- NB: see CCellAllocate
ENDCASE => ERROR;
FreeChunk[c, nwords];
END;

EnumerateCaseArms: PUBLIC PROC [node: Tree.Index, action: PROC [t: Tree.Link]] =
BEGIN

ProcessItem: PROC [t: Tree.Link] =
BEGIN
inode: Tree.Index;
WITH t SELECT FROM
subtree => inode _ index;
ENDCASE;
SELECT tb[inode].name FROM
item, casetest => action[tb[inode].son[2]];
caseswitch => TreeOps.ScanList[tb[inode].son[3], ProcessItem];
ENDCASE;
END;

TreeOps.ScanList[tb[node].son[2], ProcessItem];
IF tb[node].son[3] # Tree.Null THEN action[tb[node].son[3]];
END;

FreeChunk: PUBLIC PROC [i: CodeDefs.ChunkIndex, size: CARDINAL] =
BEGIN
FOR p: LIST OF MonitorRecord _ monList, p.rest WHILE p # NIL DO
IF p.first.cell = i AND p.first.action = free THEN DebuggerSwap.CallDebugger["From FreeChunk"L];
ENDLOOP;
table.FreeChunk[LOOPHOLE[i], size, codeType];
END;

FullWordBits: PUBLIC PROC [bits: CARDINAL] RETURNS [CARDINAL] =
BEGIN
RETURN [((bits+WordLength-1)/WordLength) * WordLength]
END;

GetChunk: PUBLIC PROC [size: CARDINAL] RETURNS [c: CodeDefs.ChunkIndex] =
BEGIN
c _ LOOPHOLE[table.GetChunk[size, codeType]];
FOR p: LIST OF MonitorRecord _ monList, p.rest WHILE p # NIL DO
IF p.first.cell = c AND p.first.action = allocate THEN DebuggerSwap.CallDebugger["From GetChunk"L];
ENDLOOP;
RETURN [c]
END;

InsertLabel: PUBLIC PROC [c: LabelCCIndex] = LinkCCItem;

LabelAlloc: PUBLIC PROC RETURNS [c: LabelCCIndex] =
BEGIN -- gets a chunk for a label but does not insert it in stream
c _ GetChunk[CCItem.label.SIZE];
cb[c] _ CCItem[free: FALSE, flink: , blink: , ccvalue:
label[labelseen: FALSE, labelinfo: generating[filltoword: , jumplist: JumpCCNull]]];
RETURN
END;

LinkCCItem: PROC[c: CCIndex] =
BEGIN -- inserts a CCItem in list @ codeptr
IF CPtr.codeptr # CCNull THEN
BEGIN
cb[c].flink _ cb[CPtr.codeptr].flink;
IF cb[CPtr.codeptr].flink # CCNull THEN cb[cb[CPtr.codeptr].flink].blink _ c;
cb[CPtr.codeptr].flink _ c;
END
ELSE cb[c].flink _ CCNull;
cb[c].blink _ CPtr.codeptr;
CPtr.codeptr _ c;
END;

LongTreeAddress: PUBLIC PROC [t: Tree.Link] RETURNS [long: BOOL _ FALSE] =
BEGIN
node: Tree.Index;
WITH t SELECT FROM
subtree =>
BEGIN  node _ index;
IF node # Tree.NullIndex THEN
SELECT tb[node].name FROM
loophole, cast, openx, pad, chop =>
long _ LongTreeAddress[tb[node].son[1]];
dot, uparrow, dindex, seqindex, dollar, index, new, reloc =>
long _ tb[node].attr2;
assignx => WITH tb[node].son[2] SELECT FROM
subtree => IF tb[index].name = mwconst THEN 
long _ LongTreeAddress[tb[node].son[1]]
ELSE long _ LongTreeAddress[tb[node].son[2]];
ENDCASE => long _ LongTreeAddress[tb[node].son[2]];
ifx => long _ LongTreeAddress[tb[node].son[2]] OR
LongTreeAddress[tb[node].son[3]];
casex =>
BEGIN
LongArm: PROC [t: Tree.Link] = {long _ long OR LongTreeAddress[t]};
EnumerateCaseArms[node, LongArm];
END;
ENDCASE => NULL;
END;
ENDCASE => NULL;
RETURN
END;

MakeLongTreeLiteral: PUBLIC PROC [d: DESCRIPTOR FOR ARRAY OF WORD, type: CSEIndex]
RETURNS [Tree.Link] =
BEGIN
TreeOps.PushTree[[literal[LiteralOps.FindDescriptor[d]]]];
TreeOps.PushNode[mwconst, 1];  TreeOps.SetInfo[type];
RETURN [TreeOps.PopTree[]]
END;

MakeTreeLiteral: PUBLIC PROC [val: WORD] RETURNS [Tree.Link] =
BEGIN
RETURN [[literal[LiteralOps.Find[val]]]]
END;

MarkedType: PUBLIC PROC [type: SEIndex] RETURNS [CSEIndex] =
BEGIN
subType: CSEIndex = NormalType[UnderType[type]];
RETURN [WITH t: seb[subType] SELECT FROM
ref => UnderType[TypeRoot[t.refType]],
transfer => subType,
ENDCASE => Symbols.typeANY]
END;

MonitorAction: TYPE = {allocate, free};
MonitorRecord: TYPE = RECORD [cell: CCIndex, action: MonitorAction];
monList: LIST OF MonitorRecord _ NIL;

Monitor: PROC [cell: CCIndex, action: MonitorAction] =
BEGIN
monList _ CONS[[cell, action], monList];
END;

NextVar: PUBLIC PROC [sei: ISEIndex] RETURNS [ISEIndex] =
BEGIN -- starting at sei returns first variable on ctx-list
RETURN [SELECT TRUE FROM
(sei = ISENull) => ISENull,
(seb[sei].idType # Symbols.typeTYPE) => sei,
ENDCASE => NextVar[NextSe[sei]]]
END;

OperandType: PUBLIC PROC [t: Tree.Link] RETURNS [sei: CSEIndex] =
BEGIN -- compute type of tree
RETURN [WITH e:t SELECT FROM
symbol => UnderType[seb[e.index].idType],
literal => IF e.index.litTag = string THEN MPtr.typeSTRING ELSE ERROR,
subtree =>
IF e = Tree.Null THEN
IF CPtr.xtracting THEN UnderType[seb[CPtr.xtractsei].idType] ELSE ERROR
ELSE tb[e.index].info,
ENDCASE => ERROR]
END;

Out0: PUBLIC PROC [i: Byte] =
BEGIN -- outputs an parameter-less instruction
c: CodeCCIndex;
pushEffect: CARDINAL = P5.PushEffect[i];
Stack.Check[i];
IF P5.NumberOfParams[i] # 0 THEN P5.P5Error[257];
c _ AllocCodeCCItem[0];
cb[c].inst _ i;
END;

Out1: PUBLIC PROC [i: Byte, p1: WORD] =
BEGIN -- outputs an one-parameter instruction
c: CodeCCIndex;
pushEffect: CARDINAL = P5.PushEffect[i];
Stack.Check[i];
IF P5.NumberOfParams[i] # 1 THEN P5.P5Error[258];
c _ AllocCodeCCItem[1];
cb[c].inst _ i;
cb[c].parameters[1] _ p1;
END;

Out2: PUBLIC PROC [i: Byte, p1, p2: WORD] =
BEGIN -- outputs an two-parameter instruction
c: CodeCCIndex;
pushEffect: CARDINAL = P5.PushEffect[i];
Stack.Check[i];
IF P5.NumberOfParams[i] # 2 THEN P5.P5Error[259];
c _ AllocCodeCCItem[2];
cb[c].inst _ i;
cb[c].parameters[1] _ p1;
cb[c].parameters[2] _ p2;
END;

Out3: PUBLIC PROC [i: Byte, p1, p2, p3: WORD] =
BEGIN -- outputs an three-parameter instruction
c: CodeCCIndex;
pushEffect: CARDINAL = P5.PushEffect[i];
Stack.Check[i];
IF P5.NumberOfParams[i] # 3 THEN P5.P5Error[260];
c _ AllocCodeCCItem[3];
cb[c].inst _ i;
cb[c].parameters[1] _ p1;
cb[c].parameters[2] _ p2;
cb[c].parameters[3] _ p3;
END;

OutJump: PUBLIC PROC [jt: JumpType, l: LabelCCIndex] =
BEGIN -- outputs a jump-type code ceel into the code stream
Stack.Check[SELECT jt FROM
Jump, JumpA, JumpC, JumpCA, JumpRet => FOpCodes.qJ,
ENDCASE => FOpCodes.qJREL];
CCellAlloc[jump];
WITH cb[CPtr.codeptr] SELECT FROM
jump =>
BEGIN
fixedup _ FALSE;
completed _ FALSE;
jtype _ jt;
destlabel _ l;
IF l # LabelCCNull THEN
BEGIN
thread _ cb[l].jumplist;
cb[l].jumplist _ LOOPHOLE[CPtr.codeptr, JumpCCIndex];
END
ELSE thread _ JumpCCNull;
END;
ENDCASE
END;

OutSource: PUBLIC PROC [index: CARDINAL] =
BEGIN
c: CCIndex;
relIndex: CARDINAL;
IF index # NULLfileindex AND index >= CPtr.bodyFileIndex
AND (relIndex _ index-CPtr.bodyFileIndex) IN RelFileIndex THEN
BEGIN
c _ GetChunk[CCItem.other.relSource.SIZE];
cb[c] _ [free: FALSE, flink: , blink: ,
ccvalue: other[relSource[relIndex: relIndex]]];
END
ELSE
BEGIN
c _ GetChunk[CCItem.other.absSource.SIZE];
cb[c] _ [free: FALSE, flink: , blink: ,
ccvalue: other[absSource[index: index]]];
END;
LinkCCItem[c];
END;

ParamCount: PUBLIC PROC [c: CodeCCIndex] RETURNS [CARDINAL] =
BEGIN
RETURN [SELECT TRUE FROM
(cb[c].isize # 0) => cb[c].isize-1, 
cb[c].realinst => OpTableDefs.InstLength[cb[c].inst]-1,
ENDCASE => P5.NumberOfParams[cb[c].inst]]
END;

PrevVar: PUBLIC PROC [ssei, sei : ISEIndex] RETURNS [ISEIndex] =
BEGIN -- returns vars in reverse order as those returned by  NextVar
psei: ISEIndex _ NextVar[ssei];
rsei: ISEIndex;
IF psei = sei THEN RETURN [psei];
UNTIL psei = sei DO rsei _ psei; psei _ NextVar[NextSe[psei]] ENDLOOP;
RETURN [rsei];
END;

PushLitVal: PUBLIC PROC [v: UNSPECIFIED] =
BEGIN -- forces a constant onto the stack
Out1[FOpCodes.qLI, v];
END;


RecordConstant: PUBLIC PROC [offset: PackageSymbols.WordIndex, length: CARDINAL] =
BEGIN OPEN PackageSymbols;
csti: Table.Base RELATIVE POINTER [0..Table.Limit) TO ConstRecord = 
table.Words[constType, ConstRecord.SIZE];
cstb[csti] _ [offset: offset, length: length];
END;


ReferentType: PUBLIC PROC [type: SEIndex] RETURNS [SEIndex] =
BEGIN
subType: CSEIndex = NormalType[UnderType[type]];
RETURN [WITH t: seb[subType] SELECT FROM
ref => t.refType,
ENDCASE => Symbols.typeANY]
END;


TreeLiteral: PUBLIC PROC [t: Tree.Link] RETURNS [BOOL] =
BEGIN
RETURN [WITH t SELECT FROM
literal => index.litTag = word,
subtree =>
SELECT tb[index].name FROM
cast => TreeLiteral[tb[index].son[1]],
mwconst => TRUE,
ENDCASE => FALSE,
ENDCASE => FALSE]
END;

TreeLiteralValue: PUBLIC PROC [t: Tree.Link] RETURNS [WORD] =
BEGIN
RETURN [WITH e:t SELECT FROM
literal =>
WITH e.index SELECT FROM
word => LiteralOps.Value[lti],
ENDCASE => ERROR,
subtree =>
SELECT tb[e.index].name FROM
cast, mwconst =>  TreeLiteralValue[tb[e.index].son[1]],
ENDCASE => ERROR,
ENDCASE => ERROR]
END;

TypeForTree: PUBLIC PROC [t: Tree.Link] RETURNS [SEIndex] =
BEGIN
RETURN [WITH t SELECT FROM
subtree => tb[index].info,
symbol => index,
ENDCASE => ERROR]
END;

UnMonitor: PROC [cell: CCIndex, action: MonitorAction] =
BEGIN
IF monList = NIL THEN RETURN;
IF monList.first.cell = cell AND monList.first.action = action 
THEN {monList _ monList.rest; RETURN};
FOR p: LIST OF MonitorRecord _ monList, p.rest UNTIL p.rest = NIL DO
IF p.rest.first.cell = cell AND p.rest.first.action = action 
THEN {p.rest _ p.rest.rest; RETURN};
ENDLOOP;
END;

VariantTag: PUBLIC PROC [type: SEIndex, ctx: Symbols.CTXIndex] RETURNS [WORD] =
BEGIN
next: SEIndex;
FOR sei: SEIndex _ type, next UNTIL sei = SENull DO
WITH se: seb[sei] SELECT FROM
id =>
BEGIN
IF se.idCtx = ctx THEN RETURN [se.idValue];
next _ se.idInfo;
END;
ENDCASE => EXIT;
ENDLOOP;
ERROR
END;

WordAligned: PUBLIC PROC [tsei: RecordSEIndex] RETURNS [BOOL] =
BEGIN -- sees if a word-aligned record (never TRUE for a variant record)
sei: ISEIndex;
wa: INTEGER _ 0;
a: BitAddress;
tsei _ RecordRoot[tsei];
IF seb[tsei].hints.variant THEN RETURN [FALSE];
IF seb[tsei].argument THEN RETURN [TRUE];
sei _ NextVar[FirstCtxSe[seb[tsei].fieldCtx]];
UNTIL sei = ISENull DO
a _ seb[sei].idValue;
IF a.bd # 0 THEN RETURN [FALSE];
IF a.wd < wa THEN RETURN [FALSE];
wa _ a.wd;
sei _ NextVar[NextSe[sei]];
ENDLOOP;
RETURN [TRUE]
END;

WordsForOperand: PUBLIC PROC [t: Tree.Link] RETURNS [OpWordCount] =
BEGIN -- compute number of words for storing value of tree
RETURN [WITH t SELECT FROM
literal => 1, -- multiwords will be subtrees
symbol => WordsForSei[seb[index].idType],
ENDCASE => OpWordCount[WordsForType[OperandType[t]]]]
END;

WordsForSei: PUBLIC PROC [sei: SEIndex] RETURNS [OpWordCount] =
BEGIN
RETURN [IF sei # SENull THEN OpWordCount[WordsForType[UnderType[sei]]] ELSE 0]
END;

WordsForString: PUBLIC PROC [nChars: CARDINAL] RETURNS [CARDINAL] =
BEGIN  -- computed for the object machine
RETURN [(nChars+1)/2 + 2]
END;

END.

èCgenUtil.mesa, 
last modified by Sweet, May 24, 1980  11:35 AM
last modified by Satterthwaite, January 10, 1983 10:10 am
Last Edited by: Maxwell, August 2, 1983 3:15 pm
imported definitions
always true for an argument record
�ÊŸ˜Jš
œ™Jš
œ.™.Jš
œ9™9J™/J˜š
Ïk	˜	Jšœ�œ
�œ0˜Ašœ�œ
�œ˜J˜E—šœ
�œ
�œ˜J˜LJ˜GJ˜2—Jšœ	�œ
�œ˜!Jšœ�œ
�œ˜(Jšœ
�œ
�œ˜&Jšœ�œ
�œ˜5Jšœ
�œ
�œ˜%Jšœ�œ
�œ'˜5Jšœ�œ
�œ˜Jšœ�œ
�œ%˜?Jšœ
�œ
�œ˜ Jšœ�œ
�œ	˜šœ�œ
�œ˜J˜O—šœ	�œ
�œ˜J˜HJ˜8—Jšœ�œ
�œ˜ Jšœ�œ
�œ0˜@Jšœ	�œ
�œ2˜EJ˜—šœ
�˜š�œI˜PJ˜—Jš�œ˜
Jš
�˜Jš�œ˜Jš
œ™J˜Jšœ�œ˜&Jšœ
�œ˜"Jšœ
�œ˜"J˜$Jšœ�œ˜,Jšœ	�œ˜ J˜!Jšœ�œ˜*J˜Jšœ�œ
˜J˜JšœÏc˜)Jšœž#˜7Jšœž˜-Jšœž#˜6J˜šœ�œ˜'Jš�œž6˜=J˜J˜J˜J˜&Jš�œ
˜J˜—šÏnœ�œ
�œ
�œ˜CJš
�˜Jšœ�œ˜#šœ�œ(˜BJšœ�œ$˜A—J˜Jš
�˜Jš�œ
˜J˜—š
Ÿœ�œ
�œ�œ�œ˜?Jš
�˜š�œ�œ�œ
�˜Jšœž#˜:Jš�œ ˜'—Jš�œ
˜J˜—š
Ÿœ�œ
�œ�œ�œ˜<Jš
�˜J˜ š�œ�œ�œ
�˜"J˜Jš�œ�œ ˜3—Jš�œ
˜J˜—šŸ
œ�œ
�œ˜,Jš�œ
ž0˜6J˜Jšœ�œ
˜š�œ�˜
J˜J˜Jšœ�œ
˜"Jšœ�œž!˜FJš�œ
˜—J˜š�œ�˜
Jšœ�œ,˜NJšœ�œ-˜PJš�œ
˜—J˜Jš�œ
˜J˜—šŸœ�œ
�œ˜4Jš
�˜J˜J˜@J˜Jš�œ
˜J˜—šŸœ�œ
�œ�œ�œ�œ˜AJš�œ
ž0˜6Jš�œ
˜š	�œ�œ
�œ�œ�˜+Jš�œ�œ
�œ�œ
˜/—Jš
�˜Jš�œ
˜J˜—šŸœ�œ
�œ
�œ˜4Jš�œ
ž+˜1J˜J˜Jš�œ
˜J˜—šŸ
œ�œ
�œ˜&Jš�œ
ž ˜&Jšœ�œ
˜Jš�œ�œ%˜AJš�œ�œ%˜Ašœ	�œ�œ
�˜#Jšœ�œ�œ
˜3Jšœ�œ
˜Jšœ�œ
˜šœ	�œ�œ
�˜Jšœ$�œ
˜)Jšœ$�œ
˜)Jš�œ�œž˜6—Jš�œ�œ
˜—J˜Jš�œ
˜J˜—šŸœ�œ
�œ�œ˜PJš
�˜J˜šŸœ�œ˜"Jš
�˜J˜š�œ�œ
�˜J˜Jš�œ
˜—š�œ�˜J˜+J˜>Jš�œ
˜—Jš�œ
˜J˜—J˜/Jš�œ�œ˜<Jš�œ
˜J˜—šŸ	œ�œ
�œ �œ˜AJš
�˜š�œ�œ
�œ!�œ�œ
�˜?Jš�œ�œ�œ.˜`Jš�œ
˜—Jšœ�œ˜-Jš�œ
˜J˜—šŸœ�œ
�œ�œ�œ�œ˜?Jš
�˜Jš�œ0˜6Jš�œ
˜J˜—š
Ÿœ�œ
�œ�œ�œ˜IJš
�˜Jšœ�œ!˜-š�œ�œ
�œ!�œ�œ
�˜?Jš�œ�œ�œ-˜cJš�œ
˜—Jš�œ˜
Jš�œ
˜J˜—JšŸœ�œ
�œ ˜8J˜šŸ
œ�œ
�œ
�œ˜3Jš�œ
ž<˜BJšœ�œ˜ šœ�œ˜6Jšœ�œ>˜T—Jš
�˜Jš�œ
˜J˜—šŸ
œ�œ˜Jš�œ
ž%˜+š�œ�˜Jš
�˜J˜%Jš�œ!�œ&˜MJ˜Jš
�˜—Jš�œ˜J˜J˜Jš�œ
˜J˜—šŸœ�œ
�œ�œ�œ�œ˜JJš
�˜J˜š�œ�œ
�˜˜
Jš�œ˜š�œ�˜š�œ�˜˜#J˜(—˜<J˜—šœ�œ�œ
�˜+šœ�œ�œ
˜,J˜'Jš�œ)˜-—Jš�œ,˜3—šœ/�˜1J˜!—˜Jš
�˜JšŸœ�œ�œ˜CJ˜!Jš�œ
˜—Jš�œ�œ
˜——Jš�œ
˜—Jš�œ�œ
˜—Jš
�˜Jš�œ
˜J˜—šŸœ�œ
�œ�
œ
�œ
�œ
�œ
�œ˜RJš�œ˜Jš
�˜J˜:J˜5Jš�œ˜Jš�œ
˜J˜—š
Ÿœ�œ
�œ�œ�œ˜>Jš
�˜Jš�œ"˜(Jš�œ
˜J˜—šŸ
œ�œ
�œ�œ
˜<Jš
�˜J˜0š�œ�œ�œ
�˜(J˜&J˜Jš�œ˜—Jš�œ
˜J˜—Jšœ�œ˜'Jšœ�œ�œ(˜DJšœ	�œ
�œ�œ
˜%J˜šŸœ�œ)˜6Jš
�˜Jšœ
�œ˜(Jš�œ
˜J˜—šŸœ�œ
�œ�œ
˜9Jš�œ
ž5˜;š�œ�œ
�œ
�˜J˜J˜,Jš�œ˜ —Jš�œ
˜J˜—šŸœ�œ
�œ�œ˜AJš�œ
ž˜š�œ�œ�œ
�˜J˜)Jš	œ�œ�œ�œ
�œ
˜F˜
š�œ�˜Jš�œ�œ'�œ
�˜G—Jš�œ˜—Jš�œ�œ
˜—Jš�œ
˜J˜—šŸœ�œ
�œ˜Jš�œ
ž(˜.J˜Jšœ�œ˜(J˜Jš�œ�œ˜1J˜J˜Jš�œ
˜J˜—šŸœ�œ
�œ�œ˜'Jš�œ
ž'˜-J˜Jšœ�œ˜(J˜Jš�œ�œ˜1J˜J˜J˜Jš�œ
˜J˜—šŸœ�œ
�œ�œ˜+Jš�œ
ž'˜-J˜Jšœ�œ˜(J˜Jš�œ�œ˜1J˜J˜J˜J˜Jš�œ
˜J˜—šŸœ�œ
�œ�œ˜/Jš�œ
ž)˜/J˜Jšœ�œ˜(J˜Jš�œ�œ˜1J˜J˜J˜J˜J˜Jš�œ
˜J˜—šŸœ�œ
�œ"˜6Jš�œ
ž5˜;šœ�œ�˜J˜3Jš�œ˜—J˜š�œ�œ
�˜!˜Jš
�˜Jšœ
�œ
˜Jšœ�œ
˜J˜J˜š�œ�˜Jš
�˜J˜Jšœ�œ˜5Jš
�˜—Jš�œ˜Jš�œ
˜—Jš
�˜—Jš�œ
˜J˜—šŸ	œ�œ
�œ	�œ˜*Jš
�˜J˜Jšœ
�œ
˜š�œ�œ˜8š�œ'�œ�˜>Jš
�˜Jšœ$�œ˜*šœ�œ˜'J˜/—Jš
�˜——š
�˜Jš
�˜Jšœ$�œ˜*šœ�œ˜'J˜)—Jš�œ
˜—J˜Jš�œ
˜J˜—š
Ÿ
œ�œ
�œ�œ�œ˜=Jš
�˜š�œ�œ
�œ
�˜J˜$J˜7Jš�œ"˜)—Jš�œ
˜J˜—šŸœ�œ
�œ�œ
˜@Jš�œ
ž>˜DJ˜J˜Jš�œ�œ
�œ˜!Jš�œ�œ+�œ
˜FJš�œ˜Jš�œ
˜J˜—šŸ
œ�œ
�œ�œ˜*Jš�œ
ž#˜)J˜Jš�œ
˜J˜J˜—šŸœ�œ
�œ,�œ˜RJš�œ
�œ˜šœ�œ
�œ�œ˜DJšœ#�œ˜)—J˜.Jš�œ
˜J˜J˜—šŸœ�œ
�œ�œ˜=Jš
�˜J˜0š�œ�œ�œ
�˜(J˜Jš�œ˜—Jš�œ
˜J˜J˜—š
Ÿœ�œ
�œ�œ�œ˜8Jš
�˜š�œ�œ�œ
�˜J˜˜
š�œ�˜J˜&Jšœ�œ
˜Jš�œ�œ
˜——Jš�œ�œ
˜—Jš�œ
˜J˜—š
Ÿœ�œ
�œ�œ�œ˜=Jš
�˜š�œ�œ�œ
�˜˜
š�œ	�œ
�˜J˜Jš�œ�œ
˜——˜
š�œ�˜J˜7Jš�œ�œ
˜——Jš�œ�œ
˜—Jš�œ
˜J˜—šŸœ�œ
�œ�œ˜;Jš
�˜š�œ�œ�œ
�˜J˜J˜Jš�œ�œ
˜—Jš�œ
˜J˜—šŸ	œ�œ)˜8Jš
�˜Jš�œ�œ
�œ
�œ
˜š�œ�œ˜?Jš�œ�œ˜&—š�œ�œ
�œ!�œ
�œ
�˜Dš�œ�œ˜=Jš�œ�œ˜$—Jš�œ
˜—Jš�œ
˜J˜—š
Ÿ
œ�œ
�œ(�œ�œ˜OJš
�˜J˜š�œ�œ�˜3š�œ�œ
�˜˜Jš
�˜Jš�œ�œ
�œ˜+J˜Jš�œ
˜—Jš�œ�œ
˜—Jš�œ
˜—Jš
�˜Jš�œ
˜J˜—š
Ÿœ�œ
�œ�œ�œ˜?š�œ
žB˜HJš
œ"™"—J˜Jšœ�œ˜J˜J˜Jš�œ�œ
�œ�œ˜/Jš�œ�œ
�œ�œ˜)J˜.š�œ�˜J˜Jš�œ
�œ
�œ�œ˜ Jš�œ�œ
�œ�œ˜!J˜
J˜Jš�œ
˜—Jš�œ�œ
˜
Jš�œ
˜J˜—šŸœ�œ
�œ�œ˜CJš�œ
ž4˜:š�œ�œ�œ
�˜Jšœž˜,J˜)Jš�œ.˜5—Jš�œ
˜J˜—šŸœ�œ
�œ�œ˜?Jš
�˜Jš�œ�œ�œ+�œ˜NJš�œ
˜J˜—šŸœ�œ
�œ
�œ�œ�œ˜CJš�œž"˜)Jš�œ˜Jš�œ
˜J˜—Jš�œ
˜J˜——…—9RMÙ