DIRECTORYAllocator USING [FNHeaderP, NHeaderP, RefCount, maxSmallBlockSize, BlockSizeIndex, bsiEscape, NormalHeader],AllocatorOps USING [NHPToREF, REFToNHP],Basics USING [BITAND, BITOR, BITSHIFT, BITXOR, HighHalf, LowHalf],Collector USING [Disposition],PrincOpsUtils USING [LongZero],RCMicrocodeOps USING [],RCMicrocodeStats USING [Stats, StatsPtr],SafeStorage USING [Type, nullType],UnsafeStorage USING [GetSystemUZone],ZCT USING [FOSTableIndex, FOSTableLength, FOSTableResidue, zctBlockWords, ZeroCountTable, zct, ZCTObject, FOSTableObject];RCMicrocodeImpl: PROGRAMIMPORTS AllocatorOps, Basics, PrincOpsUtils, UnsafeStorage, ZCT--zct--EXPORTS RCMicrocodeOps= BEGIN OPEN Allocator, Collector, RCMicrocodeStats, ZCT;checking: BOOL = FALSE;keepingStats: BOOL _ TRUE;stats: PUBLIC StatsPtr _ UnsafeStorage.GetSystemUZone[].NEW[Stats _ []];oldStats: StatsPtr _ UnsafeStorage.GetSystemUZone[].NEW[Stats _ stats^];elems: NAT = SIZE[Stats]/SIZE[INT];SampleStats: PUBLIC PROC RETURNS [delta: Stats] = {new: LONG POINTER TO ARRAY [0..elems) OF INT _ LOOPHOLE[LONG[@delta]];old: LONG POINTER TO ARRAY [0..elems) OF INT _ LOOPHOLE[oldStats];delta _ stats^;FOR i: [0..elems) IN [0..elems) DOnew[i] _ new[i] - old[i];ENDLOOP;oldStats^ _ stats^;};RCOverflowOccurred: PUBLIC ERROR = CODE;RCUnderflowOccurred: PUBLIC ERROR = CODE;LookFurtherAtReclaimedRef: PUBLIC ERROR = CODE;ZCTFull: PUBLIC ERROR = CODE;NormalFreeListEmpty: PUBLIC ERROR = CODE;ALLOCATE: PUBLIC PROC [size: CARDINAL, type: SafeStorage.Type] RETURNS[r: REF _ NIL] = {IF size <= maxSmallBlockSize THEN {bsi: BlockSizeIndex = zct.sizeToBSI[size];fnhp: FNHeaderP _ zct.bsiToFreeList[bsi];nhp: NHeaderP;IF fnhp = NIL THEN ERROR NormalFreeListEmpty;nhp _ @fnhp.fnh;r _ AllocatorOps.NHPToREF[nhp];OnZ[nhp];  -- may pageFault or raise ZCTFull; ifso, no changes have been madezct.bsiToFreeList[bsi] _ fnhp.nextFree;fnhp.nextFree _ NIL;  -- CLEAR THE NEW OBJECTnhp.type _ type;nhp.maybeOnStack _ zct.markingDecrements;IF keepingStats THEN stats.createRef _ stats.createRef + 1;};};FREEPLEASE: PUBLIC PROC [nhp: NHeaderP] RETURNS[success: BOOL _ FALSE] = {bsi: BlockSizeIndex = nhp.blockSizeIndex;IF (success _ bsi # bsiEscape) THEN {fnhp: FNHeaderP = LOOPHOLE[nhp, FNHeaderP];PrincOpsUtils.LongZero[nhp + SIZE[NormalHeader], zct.bsiToSize[bsi] - SIZE[NormalHeader]];fnhp.fnh.type _ SafeStorage.nullType;  -- mark the object as freefnhp.nextFree _ zct.bsiToFreeList[bsi];zct.bsiToFreeList[bsi] _ fnhp;};};ASSIGNREF: PUBLIC PROC [rhs: REF, lhs: LONG POINTER TO REF] = {lhsRef: REF _ lhs^;SELECT TRUE FROMrhs = lhsRef => {IF keepingStats THENIF rhs = NILTHEN stats.assignRefNil _ stats.assignRefNil + 1ELSE stats.assignRefEq _ stats.assignRefEq + 1;};rhs = NIL => {marking: BOOL = zct.markingDecrements;lnhp: NHeaderP = AllocatorOps.REFToNHP[lhsRef];lrc: RefCount _ lnhp.refCount;SELECT lrc FROM0 => IF lnhp.rcOverflowedTHEN ERROR RCUnderflowOccurredELSE ERROR;1 => {IF marking OR NOT lnhp.rcOverflowed THEN OnZ[lnhp];};ENDCASE => IF marking THEN OnZ[lnhp];IF keepingStats THEN {stats.assignRefLeft _ stats.assignRefLeft + 1;IF NOT lnhp.rcOverflowed THEN SELECT lrc FROM1 => stats.downToZero _ stats.downToZero + 1;2 => stats.downToOne _ stats.downToOne + 1;ENDCASE;};lnhp.maybeOnStack _ marking;lnhp.refCount _ lrc - 1;lhs^ _ rhs;  -- NOT counted};lhsRef = NIL => {rnhp: NHeaderP _ AllocatorOps.REFToNHP[rhs];  -- subtract 2rrc: RefCount _ rnhp.refCount;IF rrc = LAST[RefCount] THEN ERROR RCOverflowOccurred;IF keepingStats THEN {stats.assignRefRight _ stats.assignRefRight + 1;IF NOT rnhp.rcOverflowed THEN SELECT rrc FROM0 => stats.upToOne _ stats.upToOne + 1;1 => stats.upToTwo _ stats.upToTwo + 1;ENDCASE;};rnhp.refCount _ rrc + 1;rnhp.maybeOnStack _ FALSE;lhs^ _ rhs;  -- NOT counted};ENDCASE => {marking: BOOL = zct.markingDecrements;lnhp: NHeaderP = AllocatorOps.REFToNHP[lhsRef];lrc: RefCount _ lnhp.refCount;rnhp: NHeaderP _ AllocatorOps.REFToNHP[rhs];rrc: RefCount _ rnhp.refCount;IF rrc = LAST[RefCount] THEN ERROR RCOverflowOccurred;SELECT lrc FROM0 => IF lnhp.rcOverflowedTHEN ERROR RCUnderflowOccurredELSE ERROR;1 => {IF marking OR NOT lnhp.rcOverflowed THEN OnZ[lnhp];};ENDCASE => IF marking THEN OnZ[lnhp];IF keepingStats THEN {stats.assignRefBoth _ stats.assignRefBoth + 1;IF NOT rnhp.rcOverflowed THEN SELECT rrc FROM0 => stats.upToOne _ stats.upToOne + 1;1 => stats.upToTwo _ stats.upToTwo + 1;ENDCASE;IF NOT lnhp.rcOverflowed THEN SELECT lrc FROM1 => stats.downToZero _ stats.downToZero + 1;2 => stats.downToOne _ stats.downToOne + 1;ENDCASE;};lnhp.maybeOnStack _ marking;lnhp.refCount _ lrc - 1; rnhp.refCount _ rrc + 1;rnhp.maybeOnStack _ FALSE;lhs^ _ rhs;  -- NOT counted};IF keepingStats THEN stats.assignRef _ stats.assignRef + 1;};OnZ: PUBLIC PROC [nhp: NHeaderP] = {IF NOT nhp.inZCT THEN {wp: LONG POINTER TO NHeaderP _ zct.wp;wp^ _ nhp;IF Basics.BITAND[Basics.LowHalf[LOOPHOLE[wp, LONG CARDINAL]], zctBlockWords - 1]= zctBlockWords - 2*SIZE[LONG POINTER]THEN {wp _ LOOPHOLE[(wp+SIZE[LONG POINTER])^, LONG POINTER TO NHeaderP];IF wp = NILTHEN ERROR ZCTFull -- i.e. XXX TRAP with trapParam = 4ELSE zct.wp _ wp;}ELSE zct.wp _ wp + SIZE[LONG POINTER];  -- will NOT pageFaultIF keepingStats THEN stats.onZCT _ stats.onZCT + 1;nhp.inZCT _ TRUE;  -- will NOT pagefault (in microcode)};};CREATEREF: PUBLIC PROC [nhp: NHeaderP] = {IF checking AND (nhp.refCount # 0 OR nhp.rcOverflowed) THEN ERROR;OnZ[nhp];  -- may pageFault or raise ZCTFull; ifso, no changes have been madenhp.maybeOnStack _ zct.markingDecrements;IF keepingStats THEN stats.createRef _ stats.createRef + 1;};RECLAIMABLEREF: PUBLIC PROC [nhp: NHeaderP] RETURNS[Disposition] = {RETURN[MCRECLAIMABLEREF[nhp, FALSE]];};MCRECLAIMABLEREF: PROC [nhp: NHeaderP, decrPending: BOOL] RETURNS[d: Disposition _ continue] = {rc: RefCount _ nhp.refCount;IF decrPending THEN rc _ rc - 1;  -- won't underflowIF rc # 0 OR nhp.inZCT OR nhp.rcOverflowed THEN RETURN;  -- leave it aloneIF nhp.maybeOnStack OR FoundInFHSnapshot[nhp]THEN OnZ[nhp]  -- put it back; this may pageFault or raise ZCTFullELSE d _ (IF nhp.f THEN finalizeIt ELSE reclaimIt);};FoundInFHSnapshot: PROC [nhp: NHeaderP] RETURNS[found: BOOL _ FALSE] = {index: FOSTableIndex;residue, entry: FOSTableResidue;fosTable: LONG POINTER TO FOSTableObject = LOOPHOLE[zct+SIZE[ZCTObject]];[index, residue] _ FOSTableHash[nhp];entry _ fosTable[index];RETURN[residue = Basics.BITAND[residue,entry]];};FOSTableHash: PUBLIC PROC [nhp: NHeaderP--maybe bogus--] RETURNS[x: FOSTableIndex, r: FOSTableResidue] = {OPEN Basics;lc: LONG CARDINAL = LOOPHOLE[nhp, LONG CARDINAL];u: FOSTableResidue;r _ BITOR[BITSHIFT[HighHalf[lc], 3], BITSHIFT[LowHalf[lc], -13]];u _ BITAND[r, zct.residueMask];x _ BITAND[BITXOR[BITSHIFT[LowHalf[lc], -1], u], FOSTableLength-1];};RECLAIMEDREF: PUBLIC PROC [ref: REF] RETURNS [ans: REF ANY _ NIL] = {nhp: NHeaderP = AllocatorOps.REFToNHP[ref];CheckForRCUnderflow[nhp]; -- might raise RCUnderflowOccurredSELECT MCRECLAIMABLEREF[nhp, TRUE] FROMcontinue => NULL;reclaimIt => ans _ ref;finalizeIt => ERROR LookFurtherAtReclaimedRef;ENDCASE => ERROR;IF keepingStats THEN {stats.reclaimedRef _ stats.reclaimedRef + 1;SELECT nhp.refCount FROM1 => stats.downToZero _ stats.downToZero + 1;2 => stats.downToOne _ stats.downToOne + 1;ENDCASE;};nhp.refCount _ nhp.refCount - 1;};CheckForRCUnderflow: PROC [nhp: NHeaderP] = {rc: RefCount _ nhp.refCount;IF checking AND rc = 0 AND NOT nhp.rcOverflowed THEN ERROR;IF rc = 0  --was RCMicrocodeOps.rcBottom-- AND nhp.rcOverflowedTHEN ERROR RCUnderflowOccurred; -- no changes have been made};DISABLEMICROCODE: PUBLIC PROC [z: ZeroCountTable] = {NULL;  -- the real uc: ucDisabled _ TRUE};ENABLEMICROCODE: PUBLIC PROC [z: ZeroCountTable] RETURNS [ucVersion: NAT] = {RETURN[0];  -- the real uc: ucDisabled _ FALSE};END.  ~  RCMicrocodeImpl.mesaCopyright c 1984, 1985, 1986 by Xerox Corporation.  All rights reserved.Software Implementation of the Cedar reference-counting microcodeInitially: Paul Rovner, January 13, 1984 4:34 pmBob Hagmann, May 10, 1984 4:26:55 pm PDTRuss Atkinson (RRA) April 9, 1986 5:03:07 pm PSTall but FOSTableHash are really INTERNAL procs of the ZCTImpl monitorFLAGSucDisabled: BOOL;   private flag kept in ucode registersStatsERRORSPROCEDURESSoftware implementation of the Allocate MISCzct must also include: sizeToBSI, bsiToFreeList, bsiToSizeReturns NIL IF size> Allocator.maxSmallBlockSizemay pageFault or raise ZCTFull or NormalFreeListEmpty; ifso, no changes have been madeIF ucDisabled THEN Allocate MISC TRAP with trapParam = 2Allocate MISC TRAP with trapParam = 6XXX touch nhp.type, .maybeOnStack, zct.markingDecrements, fnhp.nextFree COMMITTED if hereSoftware implementation of the Free MISCReturns FASE IF bsi = bsiEscapemay pageFault; ifso, no changes have been madeIF ucDisabled THEN Allocate MISC TRAP with trapParam = 2Software implementation of the AssignRef and AssignRefNew opCodesThis might pageFault or raise ZCTFull, RCOverflowOccurred or RCUnderflowOccurredIf this guy pageFaults or raises a signal no changes have been madeIF ucDisabled THEN opCode TRAP with trapParam = 2lhs _ AddAlphaByte[lhs, XXX];note: lhsRef # NILCheck for underflow and for reaching 0.TRAP with trapParam = 3TRAP with trapParam = 5might raise ZCTFullCOMMITTED NOW to finish this callThis is a simple case, and should happen for all first assignments to fields.TRAP with trapParam = 1COMMITTED NOW to finish this callAssert: lhsRef # NIL AND rhs # NIL AND rhs # lhsRefTRAP with trapParam = 1Check for underflow and for reaching 0.TRAP with trapParam = 3TRAP with trapParam = 5might raise ZCTFullCOMMITTED NOW to finish this callSoftware implementation of the OnZ microcode subroutineThis can pageFault or raise ZCTFull.  If so, no changes have been made.This is the only proc thatexplicitly raises ZCTFullchanges zct.wpsets nhp.inZCT _ TRUEbeware: might pageFaultwp will not point to the link wordwp^ may be left with garbage if ZCTFull is raised wp points to the cell before the link to the next zctBlocknow COMMITTED to finish this callSoftware implementation of the CreateRef MISCIF ucDisabled THEN CreateRef MISC TRAP with trapParam = 2Software implementation of the ReclaimableRef MISCThis may pageFault or raise ZCTFull; ifso, no changes have been madeIF ucDisabled THEN ReclaimableRef MISC TRAP with trapParam = 2Software implementation of the MCRECLAIMABLEREF microcode subroutineThis is called from RECLAIMEDREF and from RECLAIMABLEREFThis may pageFault or raise ZCTFull; ifso, no changes have been madeSoftware implementation of the FoundInFHSnapshot microcode subroutineThis is called only from MCRECLAIMABLEREFSoftware implementation of the FOSTableHash microcode subroutiner is all but the least significant 13 bitsThe hash function works as follows:  assume the address of the REF is addr, and mask is the residue mask stored in the ZCT.  The residue is addr[7..18].  The hash bucket is the low 12 bits of "(residue and mask) XOR addr[19..30]".This works for addresses up to 25 bits in length, and can be easily extended if this is a constraint.  Bit 31 is always zero (REFs are always even word alligned).  The residue, mask, and the hash bucket uniquely defines the original address (since you know residue, you know addr[7..18]; now compute "(residue and mask) xor hash bucket" to get bits 19-30).  Since we never use a page of VM in the first 64 pages of memory for collectable storage, the residue is never zero.  The purpose of the residueMask is to change the set of REFs that collide from hash to hash.  residueMask is changed at the start of an incremental collection.  Note that if the mask was xor'ed in instead of being and'ed, then the location of the collisions, but not the REFs that colliside, would change from hash to hash.Software implementation of the ReclaimedRef MISCThis might pageFault or raise ZCTFull, RCUnderflowOccurred or LookFurtherAtReclaimedRefThis is the only proc that raises LookFurtherAtReclaimedRef explicitlyIf this proc pageFaults or raises a signal then no changes have been made.IF ucDisabled THEN ReclaimedRef MISC TRAP with trapParam = 2ReclaimedRef MISC TRAP, trapParam = 6Software implementation of the CheckForRCUnderflow microcode subroutineThis is called only from ASSIGNREF and from RECLAIMEDREFi.e. XXX TRAP with trapParam = 5i.e. XXX TRAP with trapParam = 3 Software implementation of the DisableMicrocode MISC.In addition to "disabling" rc microcode, this guy should cause the store of ucode registers back into memory (zct^).cause rc operations to trap (except EnableMicrocode)Software implementation of the EnableMicrocode MISCIn addition to "enabling" rc microcode, this guy should load ucode registers from memory (zct^).Э╩л  Ш codeЪЬЩKЪЬ
╧mЬ=ЩHKЪЬAЩAKЪЬ0Щ0KЪЬ(Щ(KЩ0KШ Ъ╧k	Ш	KЪЬ
ЮЬ]ШlKЪЬЮЬШ(KЪЬЮЬЮЬЮЬЮЬЮЬШBKЪЬ
ЮЬШKЪЬЮЬШKЪЬЮЬШKЪЬЮЬШ)KЪЬЮЬШ#KЪЬЮЬШ%KЪЮЬЮЬqШzЧЧheadЪЬЮШKЪЬEЩEKЪЮЬ$ЮЬЮ╧cШFKЪЮЬШKЪ	ЬЮЬЮЬЮЬЮЬШ9ЧKЩ ЪЬЩKЪЬ
ЮЬЮЬШKЪЬ8Щ8KЩ ЧЩKЪЬЮЬЮЬШKЪЬЮЬ+ЮЬШHKЪЬ4ЮЬШHKЪ	ЬЮЬЮЬЮЬЮЬШ#Ъ╧nЬЮЬЮЬЮЬШ3KЪЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬ
ШFKЪЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬШBKЪЬШЪЮЬЮЬЮШ"KЪЬШKЪЮЬШЧKЪЬШKШЧKШ ЧЪЬЩKЪЬЮЬЮЬШ(KЪЬЮЬЮЬШ)KЪЬЮЬЮЬШ/KЪЬ	ЮЬЮЬШKЪЬЮЬЮЬШ)ЧKЩ ЪЬ
Щ
KШ Ъ╨bkЬЮЬЮЬЮЬЮЬЮЬЮЬШXЪЬ,Щ,KЪЬ:Щ:KЪЬ0Щ0KЪЯ"ЬЯ!ЩVЧKЪЬ8Щ8ЪЮЬЮЬШ#KЪЬ*Ш*KЪЬ)Ш)KЪЬШЪЮЬЮЬЮЬЮЬШ-KЪЬ%Щ%ЧKЪЬШKЪЬШKЩ KЪЬHЩHKЪЬЯBШMKЩ KЪЬЩKЪЬ'Ш'KЪЬЮЬЯШ-KЪЬШKЪЬ)Ш)KЪЮЬЮЬ'Ш;KШЧKЪЬШKШ ЧЪб
ЬЮЬЮЬЮЬ
ЮЬЮЬШJЪЬ(Щ(KЪЬЩKЪЯ.Щ.ЧKЪЬ8Щ8KЪЬ)Ш)ЪЮЬЮЬШ%KЪЬЮЬШ+KЪЬЮЬ%ЮЬШZKЪЬ'ЯШAKЪЬ'Ш'KЪЬШKШЧKЪЬШKШ ЧЪб	ЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬШ?ЪЬAЩAKЪЬPЩPKЩCЧKЪЬ1Щ1KЪЬЩKЪЬЮЬШЪЮЬЮЬЮШЪЬШЪЮЬЮШЪЮЬЮШKЪЮЬ,Ш0KЪЮЬ+Ш/ЧЧKШЧЪЬЮЬШKЪЬЩKЪЬ	ЮЬШ&KЪЬ/Ш/KЪЬШKШ KЪЬ'Щ'ЪЮЬЮШЪЬЮЬШЪЮЬЮЬШKЪЬЩЧЪЮЬЮЬШKЪЬЩЧЧЪЬШKЪЬЩKЪЮЬ	ЮЬЮЬЮЬШ3KШЧKЪЮЬЮЬ	ЮЬШ%ЧKШ ЪЮЬЮЬШKЪЬ.Ш.Ъ	ЮЬЮЬЮЬЮЬЮШ-KЪЬ-Ш-KЪЬ+Ш+KЪЮЬШЧKШЧKЪЬ!Щ!KЪЬШKЪЬШKЪЬЯШKШЧЪЬ	ЮЬШKЩMKЪЬ.ЯШ;KЪЬШЪЮЬЮЬЮЬЮЬШ6KЪЬЩЧKШ ЪЮЬЮЬШKЪЬ0Ш0Ъ	ЮЬЮЬЮЬЮЬЮШ-KЪЬ'Ш'KЪЬ'Ш'KЪЮЬШЧKШЧKЪЬ!Щ!KЪЬШKЪЬЮЬШKЪЬЯШKШЧЪЮЬШKЪ	ЬЮЬЮЬЮЬЮЬЩ3KЪЬ	ЮЬШ&KЪЬ/Ш/KЪЬШKЪЬ,Ш,KЪЬШЪЮЬЮЬЮЬЮЬШ6KЪЬЩЧKШ KЪЬ'Щ'ЪЮЬЮШЪЬЮЬШЪЮЬЮЬШKЪЬЩЧЪЮЬЮЬШKЪЬЩЧЧЪЬШKЪЬЩKЪЮЬ	ЮЬЮЬЮЬШ3KШЧKЪЮЬЮЬ	ЮЬШ%ЧKШ KЪЬ!Щ!ЪЮЬЮЬШKЪЬ.Ш.Ъ	ЮЬЮЬЮЬЮЬЮШ-KЪЬ'Ш'KЪЬ'Ш'KЪЮЬШЧЪ	ЮЬЮЬЮЬЮЬЮШ-KЪЬ-Ш-KЪЬ+Ш+KЪЮЬШЧKШЧKЪЬШKЪЬШKЪЬШKЪЬЮЬШKЪЬЯШKШЧЧKЪЮЬЮЬ'Ш;KЪЬШЧKЩ ЪаЬЮЬЮЬШ$ЪЬ7Щ7KЪЬGЩGЪЬЩKЪЬЩKЪЬЩKЪЬЮЩЧЧЪЮЬЮЬЮЬШKЪЬЮЬЮЬЮЬШ&ЪЬ
Ш
KЪЬЩKЪЬ"Щ"KЪЬ2Щ2ЧЪ
ЮЬЮЬЮЬЮЬЮЬШPKЪЬЮЬЮЬЮЬШ&ЪЮЬШKЪЬ:Щ:KЪЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬШBЪЮЬЮШKЪЮЬЮЬ	Я#Ш6ЪЮЬШKЪЬ!Щ!ЧЧKШЧKЪ	ЮЬЮЬЮЬЮЬЯШ=ЧKЪЮЬЮЬШ3KЪЬЮЬЯ$Ш7KШЧKЪЬШKЩ ЧЪб	ЬЮЬЮЬШ*KЪЬ-Щ-KЪЬ9Щ9KЪ
ЮЬ
ЮЬЮЬЮЬЮЬШBKЪЬЯBШMKЪЬ)Ш)KЪЮЬЮЬ'Ш;KЪЬШЧKШ ЪбЬЮЬЮЬЮЬШDЪЬ2Щ2KЪЬЯЬ!ЩDЧKЪЬ>Щ>KЪЮЬЮЬЮЬШ%KЪЬШKЩ ЧЪбЬЮЬЮЬЮЬШ`ЪЬDЩDKЪЬ8Щ8KЪЬЯЬ!ЩDЧKЪЬШKЪЮЬЮЬЯШ4KЪЮЬЮЬЮЬЮЬЮЬЯШJЪЮЬЮЬШ-KЪЮЬЯ3ШBKЪЮЬЮЬЮЬЮЬШ3ЧKЪЬШKЩ Ъ
аЬЮЬЮЬЮЬЮЬШHЪЬEЩEKЪЬ)Щ)ЧKЪЬШKЪЬ Ш KЪЬ
ЮЬЮЬЮЬЮЬЮЬШIKЪЬ%Ш%KЪЬШKЪЮЬ╨ksЬШ/KЪЬШЧKШ Ъ
аЬЮЬЮЬЯЬЮЬ*ШjKЪЬ@Щ@KЪЮЬШKЪЬЮЬЮЬЮЬЮЬЮЬШ1KЪЬШЪЬЮЬЮЬЮЬШAKЪЬ*Щ*ЧKЪЬЮЬШЪЬЮЬЮЬЮЬ)ШCKЪЬ╘╧sЬЩцKЪЬ~гЬЬЩЭЧKЪЬШЧKЩ ЧЪбЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬШEЪЬ0Щ0KЪЬWЩWKЪЬFЩFKЪЬJЩJЧKЪЬ+Ш+KЪЬ<Щ<KЪЬЯ"Ш<ЪЮЬЮЬЮЬЮШ'KЪЬЮЬШKЪЬШЪЬЮЬШ.KЪЬ%Щ%ЧKЪЮЬЮЬШЧЪЮЬЮШKЪЬ,Ш,ЪЮЬЮШKЪЬ-Ш-KЪЬ+Ш+KЪЮЬШЧKШЧKЪЬ Ш KЪЬШKЩ ЧЪаЬЮЬШ-ЪЬGЩGKЪЬ8Щ8ЧKЪЬШЪЮЬ
ЮЬЮЬЮЬЮЬЮЬШ;KЪЬ Щ ЧЪЮЬ	ЯЬЮЬШ?KЪЮЬЮЬЯШ<KЪЬ!Щ!ЧKШKШ ЧЪб╧bЬЮЬЮЬШ5ЪЬ5Щ5KЪЬtЩtЧKЪЬ4Щ4KЪЮЬЯ!Ш(KЪЬШKЩ ЧЪ
бЬЮЬЮЬЮЬЮЬШMЪЬ3Щ3KЪЬ`Щ`ЧKЪЮЬЯ"Ш.KЪЬШЧKШ ЧKШ KЪЮЬШKШ Ч ЕЧ    $  @M  