DIRECTORY
Alloc: TYPE USING [Notifier],
ComData: TYPE USING [idCARDINAL, idINT, interface, typeINT, typeStringBody],
LiteralOps: TYPE USING [FindDescriptor],
Log: TYPE USING [Error, ErrorTree, WarningTree],
P4: TYPE USING [
Attr, BiasForType, BitsForType, both, CatchNest, CommonAttr, CommonProp, Exp,
FillMultiWord, ForceType, LiteralAttr, MakeArgRecord, MakeStructuredLiteral,
MakeTreeLiteral, maxRegs, none, OperandStruct, OperandType, other, Prop, RegCount,
RegsForType, RelTest, RepForType, Repr, Rhs, RValue, StructuredLiteral,
TreeLiteral, TreeLiteralValue, TypeExp, TypeForTree, unsigned, ValueDescriptor,
VAttr, voidAttr, VPop, VProp, VPush, VRegs, VRep, WordSeq, WordsForType],
Symbols: TYPE USING [
Base, BitAddress, BitCount, ByteLength, codeCHAR, codeINT, CSEIndex, ctxType,
ISEIndex, ISENull, lZ, seType, Type, WordLength],
SymbolOps: TYPE USING [
ArgRecord, BitsPerElement, Cardinality, CtxLevel, FirstCtxSe, NormalType, NextSe,
PackedSize, VariantField, UnderType],
SymLiteralOps: TYPE USING [TypeRef],
Tree: TYPE USING [Base, Index, Link, NodeName, Null, treeType],
TreeOps: TYPE USING [
FreeNode, FreeTree, GetNode, IdentityMap, MakeNode, OpName, PopTree,
PushLit, PushNode, PushSe, PushTree, SetAttr, SetInfo];

Pass4Xc: PROGRAM
IMPORTS Log, LiteralOps, P4, SymbolOps, SymLiteralOps, TreeOps, dataPtr: ComData
EXPORTS P4 = {
OPEN SymbolOps, TreeOps, P4;

Type: TYPE = Symbols.Type;
CSEIndex: TYPE = Symbols.CSEIndex;
WordLength: CARDINAL = Symbols.WordLength;

tb: Tree.Base;	-- tree base address (local copy)
seb: Symbols.Base;	-- se table base address (local copy)
ctxb: Symbols.Base;	-- context table base address (local copy)

ExpCNotify: PUBLIC Alloc.Notifier = {
tb _ base[Tree.treeType];
seb _ base[Symbols.seType];  ctxb _ base[Symbols.ctxType]};



NormalizeRange: PUBLIC PROC [t: Tree.Link] RETURNS [val: Tree.Link] = {
next: Tree.Link;
FOR val _ t, next DO
WITH val SELECT FROM
symbol => {
lBound: INTEGER = BiasForType[index];
THROUGH [1..2] DO
PushTree[MakeTreeLiteral[ABS[lBound]]];
IF lBound < 0 THEN PushNode[uminus, 1];
ENDLOOP;
PushTree[MakeTreeLiteral[Cardinality[index] - 1]];
PushNode[plus, 2];  SetInfo[dataPtr.idINT];
next _ MakeNode[intCC, 2]};
subtree => {
node: Tree.Index = index;
SELECT tb[node].name FROM
subrangeTC, cdot => {
next _ tb[node].son[2]; tb[node].son[2] _ Tree.Null; FreeNode[node]};
IN [intOO .. intCC] => EXIT;
ENDCASE => ERROR};
ENDCASE => ERROR;
ENDLOOP;
RETURN};

Interval: PUBLIC PROC [node: Tree.Index, bias: INTEGER, target: Repr]
  RETURNS [const: BOOL] = {
OPEN tb[node];
attr: Attr;
nRegs: RegCount;
son[1] _ RValue[son[1], bias, target];
attr _ VAttr[]; nRegs _ VRegs[];
son[2] _ RValue[son[2], bias, target];
nRegs _ MAX[VRegs[], nRegs];  attr _ CommonAttr[attr, VAttr[]];
VPop[];  VPop[];  VPush[bias, attr, nRegs];
const _ StructuredLiteral[son[1]] AND StructuredLiteral[son[2]] AND ~attr1;
RETURN};

EmptyInterval: PUBLIC SIGNAL = CODE;

ConstantInterval: PUBLIC PROC [node: Tree.Index] RETURNS [origin, range: INTEGER] = {
OPEN tb[node];
uBound: INTEGER;
rep: Repr _ VRep[];
empty: BOOL _ FALSE;
origin _ TreeLiteralValue[son[1]];  uBound _ TreeLiteralValue[son[2]];
SELECT name FROM
intOO, intOC => {
IF RelTest[son[1], son[2], relGE, rep] THEN empty _ TRUE;
origin _ origin + 1;
son[1] _ FreeTree[son[1]];
name _ IF name = intOO THEN intCO ELSE intCC;
son[1] _ MakeTreeLiteral[origin]};
ENDCASE;
SELECT name FROM
intCC => IF RelTest[son[1], son[2], relG, rep] THEN empty _ TRUE;
intCO => {
IF RelTest[son[1], son[2], relGE, rep] THEN empty _ TRUE;
uBound _ uBound - 1;
son[2] _ FreeTree[son[2]];
name _ intCC;  son[2] _ MakeTreeLiteral[uBound]};
ENDCASE => ERROR;
IF ~empty THEN range _ uBound - origin ELSE {SIGNAL EmptyInterval; range _ 0};
RETURN};





TypeOp: PUBLIC PROC [node: Tree.Index] RETURNS [val: Tree.Link] = {
SELECT tb[node].name FROM

size => val _ Size[node];
first, last => val _ EndPoint[node];
typecode => val _ TypeCode[node];
ENDCASE => {
Log.Error[unimplemented]; VPush[0, voidAttr, 0]; val _ [subtree[node]]};

RETURN};


Size: PROC [node: Tree.Index] RETURNS [val: Tree.Link] = {
type: CSEIndex;

ApplyLit: PROC [op: Tree.NodeName, val: WORD] = {
PushTree[MakeTreeLiteral[val]];  PushNode[op, 2];
SetInfo[dataPtr.idINT];  SetAttr[1, FALSE];  SetAttr[2, FALSE]};

IF OpName[tb[node].son[1]] = apply THEN {
subNode: Tree.Index = GetNode[tb[node].son[1]];
sei: Symbols.ISEIndex;
bitsPerItem: Symbols.BitCount;
TypeExp[tb[subNode].son[1]];  type _ UnderType[TypeForTree[tb[subNode].son[1]]];
SELECT TRUE FROM
(type = dataPtr.typeStringBody) => bitsPerItem _ Symbols.ByteLength;
((sei _ VariantField[type]) # Symbols.ISENull) => {
subType: CSEIndex = UnderType[seb[sei].idType];
bitsPerItem _ WITH t: seb[subType] SELECT FROM
sequence => BitsPerElement[t.componentType, t.packed],
ENDCASE => ERROR};
ENDCASE => ERROR;
PushTree[tb[subNode].son[2]];  tb[subNode].son[2] _ Tree.Null;
IF bitsPerItem < WordLength THEN {
itemsPerWord: CARDINAL = WordLength/CARDINAL[bitsPerItem];
ApplyLit[plus, itemsPerWord-1];  ApplyLit[div, itemsPerWord]}
ELSE ApplyLit[times, bitsPerItem/WordLength];
ApplyLit[plus, P4.WordsForType[type]];
IF tb[node].son[2] # Tree.Null THEN {
PushTree[tb[node].son[2]];  tb[node].son[2] _ Tree.Null;
PushNode[times, 2]; 
SetInfo[dataPtr.idINT];  SetAttr[1, FALSE];  SetAttr[2, FALSE]}}
ELSE {
TypeExp[tb[node].son[1]];  type _ UnderType[TypeForTree[tb[node].son[1]]];
IF tb[node].son[2] = Tree.Null THEN PushTree[MakeTreeLiteral[P4.WordsForType[type]]]
ELSE {
nBits: CARDINAL = P4.BitsForType[type];
PushTree[tb[node].son[2]];  tb[node].son[2] _ Tree.Null;
IF nBits <= Symbols.ByteLength THEN {
n: CARDINAL = WordLength/PackedSize[nBits];
ApplyLit[plus, n-1];  ApplyLit[div, n]}
ELSE  ApplyLit[times, P4.WordsForType[type]]}};
val _ Rhs[PopTree[], dataPtr.idCARDINAL];  FreeNode[node]};

EndPoint: PROC [node: Tree.Index] RETURNS [val: Tree.Link] = {
OPEN tb[node];
type, next: CSEIndex;
first: BOOL = (name=first);
MaxInteger: WORD = INTEGER.LAST;
MaxWord: WORD = CARDINAL.LAST;
v: WORD;
vv: ARRAY [0..2) OF WORD;
TypeExp[son[1]];
FOR type _ UnderType[TypeForTree[son[1]]], next DO
WITH seb[type] SELECT FROM
basic => {
v _ SELECT code FROM
Symbols.codeINT => IF first THEN MaxInteger+1 ELSE MaxInteger,
Symbols.codeCHAR => IF first THEN 0 ELSE CARDINAL[Cardinality[type]-1],
ENDCASE => IF first THEN 0 ELSE MaxWord;
GO TO short};
enumerated => {
v _ IF first THEN 0 ELSE CARDINAL[Cardinality[type]-1]; GO TO short};
relative => next _ UnderType[offsetType];
subrange => {v _ IF first THEN origin ELSE origin+range; GO TO short};
long => {
vv _ IF UnderType[rangeType] = dataPtr.typeINT
THEN IF first THEN [0, MaxInteger+1] ELSE [MaxWord, MaxInteger]
ELSE IF first THEN [0, 0] ELSE [MaxWord, MaxWord];
GO TO long};
ENDCASE => ERROR;
REPEAT
short => val _ MakeTreeLiteral[v];
long => {
PushLit[LiteralOps.FindDescriptor[DESCRIPTOR[vv]]];
PushNode[mwconst, 1];  SetInfo[type];  val _ PopTree[]};
ENDLOOP;
FreeNode[node];
VPush[0, LiteralAttr[RepForType[type]], RegsForType[type]]; RETURN};

TypeCode: PROC [node: Tree.Index] RETURNS [val: Tree.Link] = {
TypeExp[tb[node].son[1]];
IF dataPtr.interface THEN val _ [subtree[index: node]]
ELSE {
val _ SymLiteralOps.TypeRef[TypeForTree[tb[node].son[1]], FALSE];
FreeNode[node]};
VPush[0, LiteralAttr[both], 1];  RETURN};



MiscXfer: PUBLIC PROC [node: Tree.Index] RETURNS [Tree.Link] = {
attr: Attr;
SELECT tb[node].name FROM

create => {
tb[node].son[1] _ RValue[tb[node].son[1], 0, none];
attr _ [prop: VProp[], rep: unsigned];  VPop[]};

fork => {
OPEN tb[node];
type: CSEIndex;
son[1] _ Exp[son[1], none];
attr.prop _ VProp[]; VPop[];  type _ OperandStruct[son[1]];
WITH t: seb[type] SELECT FROM
transfer => {
son[2] _ MakeArgRecord[ArgRecord[t.typeIn], son[2]];
attr.prop _ CommonProp[attr.prop, VProp[]]; attr.rep _ other;  VPop[]};
ENDCASE => ERROR};

ENDCASE => {Log.Error[unimplemented]; attr _ voidAttr};

attr.prop.noXfer _ attr.prop.noFreeVar _ FALSE;  VPush[0, attr, maxRegs];
IF tb[node].nSons > 2 THEN CatchNest[tb[node].son[3]];
RETURN[[subtree[index: node]]]};



Nil: PUBLIC PROC [node: Tree.Index] RETURNS [Tree.Link] = {
type: Type = tb[node].info;
n: CARDINAL;
words: ValueDescriptor;
IF tb[node].son[1] # Tree.Null THEN TypeExp[tb[node].son[1]];
n _ P4.WordsForType[type];
words _ NEW[WordSeq[n]];
FOR i: CARDINAL IN [0..n) DO words[i] _ 0 ENDLOOP;
PushLit[LiteralOps.FindDescriptor[DESCRIPTOR[@words[0], n]]];
IF n > 1 THEN {PushNode[mwconst, 1]; SetInfo[type]};
FreeNode[node];  words _ NIL;
VPush[BiasForType[type], LiteralAttr[RepForType[type]], RegsForType[type]];
RETURN[ForceType[PopTree[], type]]};



AddrOp: PUBLIC PROC [node: Tree.Index] RETURNS [val: Tree.Link] = {
attr: Attr;
nRegs: RegCount;
SELECT tb[node].name FROM

addr => val _ Addr[node];

base => {
tb[node].son[1] _ Exp[tb[node].son[1], none];
nRegs _ VRegs[]; attr _ [prop: VProp[], rep: unsigned];  VPop[];
VPush[0, attr, nRegs];  val _ [subtree[index: node]]};

length => {
type: CSEIndex;
tb[node].son[1] _ Exp[tb[node].son[1], none];
type _ OperandStruct[tb[node].son[1]];
WITH seb[type] SELECT FROM
array => {
val _ MakeTreeLiteral[Cardinality[indexType]];
FreeNode[node];  attr _ LiteralAttr[both];  nRegs _ 1};
ENDCASE => {
val _ [subtree[index: node]]; attr _ [prop: VProp[], rep: both]; nRegs _ VRegs[]};
VPop[];  VPush[0, attr, nRegs]};

arraydesc =>
val _ IF OpName[tb[node].son[1]] # list THEN Desc[node] ELSE DescList[node];

ENDCASE => {
Log.Error[unimplemented]; VPush[0, voidAttr, 0]; val _ [subtree[node]]};

RETURN};


Addr: PROC [node: Tree.Index] RETURNS [val: Tree.Link] = {
OPEN tb[node];
v: Tree.Link;
subNode: Tree.Index;
type, next: CSEIndex;
prop: Prop;
nRegs: RegCount;
son[1] _ Exp[son[1], none];
nRegs _ MAX[VRegs[], RegsForType[info]];
prop _ VProp[];  prop.noFreeVar _ FALSE;
FOR t: Tree.Link _ son[1], v DO
WITH t SELECT FROM
symbol => {
sei: Symbols.ISEIndex = index;
IF seb[sei].constant THEN GO TO fail;
IF CtxLevel[seb[sei].idCtx] = Symbols.lZ AND
(LOOPHOLE[seb[sei].idValue, Symbols.BitAddress].bd # 0 OR
LOOPHOLE[seb[sei].idInfo, CARDINAL] MOD WordLength # 0) THEN GO TO fail;
GO TO pass};
subtree => {
subNode _ index;
SELECT tb[subNode].name FROM
dot, dollar =>  v _ tb[subNode].son[2];
index, dindex, seqindex =>
FOR  type _ NormalType[OperandType[tb[subNode].son[1]]], next DO
WITH t: seb[type] SELECT FROM
array => IF t.packed THEN GO TO fail ELSE GO TO pass;
sequence => IF t.packed THEN GO TO fail ELSE GO TO pass;
arraydesc => next _ UnderType[t.describedType];
ENDCASE => ERROR;
ENDLOOP;
apply => GO TO fail;
uparrow, reloc => GO TO pass;
cast, chop => v _ tb[subNode].son[1];
base, length => GO TO pass;
ENDCASE => ERROR};
ENDCASE => ERROR;
REPEAT
pass => NULL;
fail => Log.ErrorTree[nonAddressable, son[1]]; 
ENDLOOP;
val _ [subtree[index: node]];
IF OpName[son[1]] = dot THEN {
subNode _ GetNode[son[1]];
IF TreeLiteral[tb[subNode].son[1]] THEN {
val _ MakeStructuredLiteral[
TreeLiteralValue[tb[subNode].son[1]] + LOOPHOLE[
seb[NARROW[tb[subNode].son[2], Tree.Link.symbol].index].idValue,
Symbols.BitAddress].wd,
info];
FreeNode[node]}};
VPop[];
VPush[0, [prop: prop, rep: unsigned], nRegs];  RETURN};


Desc: PROC [node: Tree.Index] RETURNS [Tree.Link] = {
subNode: Tree.Index = GetNode[tb[node].son[1]];
long: BOOL = tb[subNode].attr2;
prop: Prop;
nRegs: RegCount;
subType: CSEIndex;
tb[subNode].son[1] _ Exp[tb[subNode].son[1], none];
nRegs _ VRegs[];  prop _ VProp[];  VPop[];
subType _ OperandStruct[tb[subNode].son[1]];
WITH t: seb[subType] SELECT FROM
array => {
n: CARDINAL = Cardinality[t.indexType];
IF n = 0 THEN Log.WarningTree[emptyArray, tb[subNode].son[1]];
IF t.packed AND (BitsForType[subType] MOD WordLength # 0) THEN
Log.ErrorTree[nonAddressable, tb[subNode].son[1]];
PushTree[[subtree[subNode]]];  PushTree[MakeTreeLiteral[n]]};
sequence => {
copy: Tree.Link = IdentityMap[tb[subNode].son[1]];
cNode: Tree.Index = NARROW[copy, Tree.Link.subtree].index;
PushTree[tb[subNode].son[1]];  PushTree[MakeTreeLiteral[0]];
PushNode[seqindex, 2];  SetInfo[t.componentType];
SetAttr[2, long];  SetAttr[3, FALSE];
tb[subNode].son[1] _ PopTree[];  PushTree[[subtree[subNode]]];
tb[cNode].son[2] _ FreeTree[tb[cNode].son[2]];
tb[cNode].son[2] _ [symbol[index: t.tagSei]];
tb[cNode].info _ dataPtr.idCARDINAL;
PushTree[copy]};
record => {  -- StringBody only (compatibility glitch)
copy: Tree.Link = IdentityMap[tb[subNode].son[1]];
sei: Symbols.ISEIndex = NextSe[NextSe[FirstCtxSe[t.fieldCtx]]];
PushTree[tb[subNode].son[1]];  PushSe[sei];  PushNode[dollar, 2];
SetInfo[seb[sei].idType];  SetAttr[2, long];
tb[subNode].son[1] _ PopTree[];  PushTree[[subtree[subNode]]];
PushTree[copy];  PushSe[NextSe[FirstCtxSe[t.fieldCtx]]];  PushNode[dollar, 2];
SetInfo[dataPtr.idCARDINAL]; SetAttr[2, long]};
ENDCASE => {
PushTree[[subtree[subNode]]];  PushTree[Tree.Null]};
PushTree[Tree.Null];  PushNode[list, 3];  tb[node].son[1] _ PopTree[];
VPush[0, [prop: prop, rep: other], MAX[RegsForType[tb[node].info], nRegs]];
RETURN[[subtree[index: node]]]};

DescList: PROC [node: Tree.Index] RETURNS [val: Tree.Link] = {
subNode: Tree.Index = GetNode[tb[node].son[1]];
type: Type = tb[node].info;
subType: CSEIndex;
prop: Prop;
nRegs: RegCount;
tb[subNode].son[1] _ RValue[tb[subNode].son[1], 0, unsigned];
nRegs _ VRegs[];  prop _ VProp[];  subType _ OperandStruct[tb[subNode].son[1]];
WITH seb[subType] SELECT FROM
ref =>
IF BitsForType[refType] MOD WordLength # 0 THEN
Log.ErrorTree[nonAddressable, tb[subNode].son[1]];
ENDCASE;
tb[subNode].son[2] _ RValue[tb[subNode].son[2], 0, none];
nRegs _ MAX[VRegs[], nRegs];  prop _ CommonProp[VProp[], prop];
IF tb[subNode].son[3] # Tree.Null THEN TypeExp[tb[subNode].son[3]];
VPop[]; VPop[];
IF StructuredLiteral[tb[subNode].son[1]] AND TreeLiteral[tb[subNode].son[2]] THEN {
n: CARDINAL = WordsForType[type];
words: ValueDescriptor _ NEW[WordSeq[n]];
FillMultiWord[words, 0, tb[subNode].son[1]];
words[n-1] _ TreeLiteralValue[tb[subNode].son[2]];
PushLit[LiteralOps.FindDescriptor[DESCRIPTOR[@words[0], n]]];
PushNode[mwconst, 1];  SetInfo[type];
words _ NIL;
val _ PopTree[];  FreeNode[node]}
ELSE val _ [subtree[index: node]];
VPush[0, [prop: prop, rep: other], MAX[RegsForType[type], nRegs]];  RETURN};

}.


žPass4Xc.mesa
Copyright c 1985 by Xerox Corporation.  All rights reserved.
Satterthwaite, April 11, 1986 10:25:01 am PST
Maxwell, July 28, 1983 12:34 pm
Paul Rovner, September 8, 1983 1:49 pm
Russ Atkinson (RRA) March 6, 1985 11:00:23 pm PST
called by allocator whenever table area is repacked
interval utilities
type utilities (move?)
operators on types
misc transfer operators
NIL
misc addressing operators
Κ
Κ˜
codeš
œ™Kšœ
Οm
œ1™<Kš
œ-™-Kš
œ™Kš
œ&™&K™1—K˜š
Οk	˜	Kšœžœ
žœ˜Kšœ	žœ
žœ9˜LKšœžœ
žœ˜(Kšœžœ
žœ!˜0šœžœ
žœ˜Kš
œM˜MKš
œL˜LKš
œR˜RKš
œG˜GKš
œO˜OKš
œI˜I—šœ	žœ
žœ˜Kš
œM˜MKš
œ1˜1—šœžœ
žœ˜Kš
œQ˜QKš
œ%˜%—Kšœžœ
žœ˜$Kšœžœ
žœ/˜?šœ	žœ
žœ˜Kš
œD˜DKš
œ7˜7K˜——šœ	ž˜KšžœI˜PKšžœ˜Kšžœ˜K˜Kšœžœ˜Kšœ
žœ˜"Kšœžœ˜*K˜KšœΟc!˜0KšœŸ%˜8KšœŸ*˜>K˜šœžœ˜%Kš
œ3™3K˜K˜;K˜K˜—Kš
œ™˜šΟnœžœ
žœžœ˜GK˜šžœž˜šžœžœ
ž˜˜Kšœžœ˜%šžœž˜Kšœžœ˜'Kšžœžœ˜'Kšžœ
˜—K˜2K˜+K˜—˜K˜šžœž˜˜K˜E—Kšžœžœ
˜Kšžœžœ˜——Kšžœžœ
˜—Kšžœ
˜—Kšžœ˜K˜—š œžœ
žœžœ˜EKšž	œ	žœ˜Kšžœ
˜K˜K˜K˜&K˜ K˜&Kšœžœ4˜?K˜+Kšœ"žœžœ˜KKšžœ˜K˜—Kšœžœ
žœžœ
˜$K˜š
 œžœ
žœžœžœ˜UKšžœ
˜Kšœžœ
˜K˜Kšœžœžœ
˜K˜Fšžœž˜˜Kšžœ%žœ	žœ
˜9K˜K˜Kšœžœžœžœ˜-K˜"—Kšžœ
˜—šžœž˜Kšœ	žœ$žœ	žœ
˜A˜
Kšžœ%žœ	žœ
˜9K˜K˜K˜1—Kšžœžœ
˜—Kšžœžœžœžœ˜NKšžœ˜K˜K˜——Kš
œ™K˜K˜Kš
œ™˜š œžœ
žœžœ˜CKšžœž˜˜K˜K˜$K˜!šžœ˜K˜HK˜——Kšžœ˜K˜K˜—š œžœžœ˜:K˜K˜š œžœžœ˜1K˜1Kšœ$žœžœ˜@K˜—šžœ!žœ˜)K˜/K˜K˜K˜Pšžœ
žœ
ž˜K˜D˜3K˜/šœžœžœ
ž˜.K˜6Kšžœžœ˜——Kšžœžœ
˜—K˜>šžœžœ˜"Kšœžœžœ˜:K˜=—Kšžœ)˜-K˜&šžœžœ˜%K˜8K˜Kšœ$žœžœ˜@——šžœ˜K˜JKšžœžœ1˜Tšžœ˜Kšœžœ˜'K˜8šžœžœ˜%Kšœžœ ˜+K˜'—Kšžœ+˜/——K˜;K˜—š œžœžœ˜>Kšžœ
˜K˜Kšœžœ˜Kšœžœžœ
žœ
˜ Kšœ	žœžœ
žœ
˜Kšœžœ
˜Kšœžœžœ
žœ
˜K˜šžœ-ž˜2šžœžœ
ž˜˜
šœžœž˜Kšœžœžœžœ˜>Kš	œžœžœžœ
žœ˜GKšžœžœžœžœ	˜(—Kšžœ
žœ˜
—˜Kš
œžœžœžœ
žœžœ
žœ˜E—K˜)Kšœžœžœžœžœ
žœ˜F˜	šœžœ'˜.Kšžœ
žœžœžœ˜?Kšžœ
žœžœžœ˜2—Kšžœ
žœ˜—Kšžœžœ
˜—š
ž˜K˜"˜	Kšœ"ž
œ˜3K˜8——Kšžœ
˜—K˜Kšœ<žœ˜DK˜—š œžœžœ˜>K˜šžœžœ˜6šžœ˜Kšœ:žœ˜AK˜——Kšœ!žœ˜)K˜K˜——Kš
œ™˜š œžœ
žœžœ˜@K˜Kšžœž˜˜˜K˜3K˜0K˜—˜	Kšžœ
˜K˜K˜K˜;šžœžœ
ž˜˜
K˜4K˜G—Kšžœžœ˜K˜——Kšžœ0˜7K˜—Kšœ)žœ˜IKšžœžœ˜6Kšžœ˜ K˜K˜——Kš
œ™˜š œžœ
žœžœ˜;K˜Kšœžœ
˜K˜Kšžœžœ˜=K˜Kšœžœ
˜Kš
žœžœ
žœžœžœ
˜2Kšœ"ž
œ˜=Kšžœžœ'˜4Kšœžœ
˜K˜KKšžœ˜$K˜K˜——Kš
œ™˜š œžœ
žœžœ˜CK˜K˜Kšžœž˜˜K˜K˜˜	K˜-K˜@K˜6K˜—˜K˜K˜-K˜&šžœžœ
ž˜˜
K˜.K˜7—šžœ˜K˜R——K˜ K˜—˜Kšœžœ žœžœ˜LK˜—šžœ˜K˜HK˜——Kšžœ˜K˜K˜—š œžœžœ˜:Kšžœ
˜K˜
K˜K˜K˜K˜K˜Kšœžœ˜(Kšœ"žœ
˜(šžœž˜šžœžœ
ž˜˜K˜Kšžœžœ
žœ
žœ˜%šžœ'ž˜,šœ
žœ.ž˜9Kšžœžœžœžœ
žœ
žœ˜H——Kšžœ
žœ˜—˜K˜šžœž˜K˜'˜šžœ;ž˜@šžœžœ
ž˜Kšœ	žœ
žœ
žœ
žœžœ
žœ
žœ˜5Kšœžœ
žœ
žœ
žœžœ
žœ
žœ˜8K˜/Kšžœžœ
˜—Kšžœ
˜——Kšœ	žœ
žœ˜Kšœžœ
žœ˜K˜%Kšœžœ
žœ˜Kšžœžœ˜——Kšžœžœ
˜—š
ž˜Kšœžœ
˜
K˜/—Kšžœ
˜—K˜šžœžœ˜K˜šžœ!žœ˜)˜šœ'žœ
˜0Kšœžœ6˜@K˜—K˜—K˜——K˜Kšœ/žœ˜7K˜K˜—š œžœžœ˜5K˜/Kšœžœ˜K˜K˜K˜K˜3K˜*K˜,šžœžœ
ž˜ ˜
Kšœžœ˜'Kšžœžœ1˜>šžœ
žœžœž˜>K˜2—K˜=—˜
K˜2Kšœžœ ˜:K˜<K˜1Kšœžœ˜%K˜>K˜.K˜-K˜$K˜—šœ
Ÿ)˜6K˜2K˜?K˜AK˜,K˜>K˜NK˜/—šžœ˜K˜4——K˜FKšœ#žœ%˜KKšžœ˜ K˜—š œžœžœ˜>K˜/K˜K˜K˜K˜K˜=K˜Ošžœžœ
ž˜˜šžœžœž˜/K˜2——Kšžœ
˜—K˜9Kšœžœ4˜?Kšžœ žœ˜CK˜šžœ'žœ!žœ˜SKšœžœ˜!Kšœžœ
˜)K˜,K˜2Kšœ"ž
œ˜=K˜%Kšœžœ
˜K˜!—Kšžœ˜"Kšœ#žœžœ˜LK˜—K˜K˜———…—7TFΌ