Resolved forward reference irq to interrupt(KERNEL_MIN)(void()) irq()
Culled Empty Block (label) main::@5
Culled Empty Block (label) main::@3
Culled Empty Block (label) main::@6
Culled Empty Block (label) main::@4
Culled Empty Block (label) main::@8
Culled Empty Block (label) @1
Culled Empty Block (label) irq::@2
Culled Empty Block (label) irq::@4

CONTROL FLOW GRAPH SSA
@begin: scope:[]  from
  (void()**) KERNEL_IRQ#0 ← ((void()**)) (number) $314
  (byte*) BGCOL#0 ← ((byte*)) (number) $d020
  (byte) col#0 ← (number) 0
  to:@2
main: scope:[main]  from @2
  (byte) col#16 ← phi( @2/(byte) col#15 )
  (void()*~) main::$0 ← & interrupt(KERNEL_MIN)(void()) irq()
  *((void()**) KERNEL_IRQ#0) ← (void()*~) main::$0
  to:main::@1
main::@1: scope:[main]  from main main::@2 main::@7
  (byte) col#14 ← phi( main/(byte) col#16 main::@2/(byte) col#7 main::@7/(byte) col#1 )
  if(true) goto main::@2
  to:main::@return
main::@2: scope:[main]  from main::@1
  (byte) col#7 ← phi( main::@1/(byte) col#14 )
  (bool~) main::$1 ← (byte) col#7 > (number) $a
  (bool~) main::$2 ← ! (bool~) main::$1
  if((bool~) main::$2) goto main::@1
  to:main::@7
main::@7: scope:[main]  from main::@2
  (byte) col#1 ← (number) 0
  to:main::@1
main::@return: scope:[main]  from main::@1
  (byte) col#8 ← phi( main::@1/(byte) col#14 )
  (byte) col#2 ← (byte) col#8
  return 
  to:@return
irq: scope:[irq]  from
  (byte) col#9 ← phi( @2/(byte) col#15 )
  asm { lda$dc0d  }
  *((byte*) BGCOL#0) ← (byte) col#9
  (bool~) irq::$0 ← (byte) col#9 != (number) 0
  if((bool~) irq::$0) goto irq::@1
  to:irq::@3
irq::@1: scope:[irq]  from irq
  (byte) col#10 ← phi( irq/(byte) col#9 )
  (byte) col#3 ← ++ (byte) col#10
  to:irq::@return
irq::@3: scope:[irq]  from irq
  (byte) col#11 ← phi( irq/(byte) col#9 )
  (byte) col#4 ← (byte) col#11 + (number) 2
  to:irq::@return
irq::@return: scope:[irq]  from irq::@1 irq::@3
  (byte) col#12 ← phi( irq::@1/(byte) col#3 irq::@3/(byte) col#4 )
  (byte) col#5 ← (byte) col#12
  return 
  to:@return
@2: scope:[]  from @begin
  (byte) col#15 ← phi( @begin/(byte) col#0 )
  call main 
  to:@3
@3: scope:[]  from @2
  (byte) col#13 ← phi( @2/(byte) col#2 )
  (byte) col#6 ← (byte) col#13
  to:@end
@end: scope:[]  from @3

SYMBOL TABLE SSA
(label) @2
(label) @3
(label) @begin
(label) @end
(byte*) BGCOL
(byte*) BGCOL#0
(void()**) KERNEL_IRQ
(void()**) KERNEL_IRQ#0
(byte) col
(byte) col#0
(byte) col#1
(byte) col#10
(byte) col#11
(byte) col#12
(byte) col#13
(byte) col#14
(byte) col#15
(byte) col#16
(byte) col#2
(byte) col#3
(byte) col#4
(byte) col#5
(byte) col#6
(byte) col#7
(byte) col#8
(byte) col#9
interrupt(KERNEL_MIN)(void()) irq()
(bool~) irq::$0
(label) irq::@1
(label) irq::@3
(label) irq::@return
(void()) main()
(void()*~) main::$0
(bool~) main::$1
(bool~) main::$2
(label) main::@1
(label) main::@2
(label) main::@7
(label) main::@return

Adding number conversion cast (unumber) 0 in (byte) col#0 ← (number) 0
Adding number conversion cast (unumber) $a in (bool~) main::$1 ← (byte) col#7 > (number) $a
Adding number conversion cast (unumber) 0 in (byte) col#1 ← (number) 0
Adding number conversion cast (unumber) 0 in (bool~) irq::$0 ← (byte) col#9 != (number) 0
Adding number conversion cast (unumber) 2 in (byte) col#4 ← (byte) col#11 + (number) 2
Successful SSA optimization PassNAddNumberTypeConversions
Inlining cast (void()**) KERNEL_IRQ#0 ← (void()**)(number) $314
Inlining cast (byte*) BGCOL#0 ← (byte*)(number) $d020
Inlining cast (byte) col#0 ← (unumber)(number) 0
Inlining cast (byte) col#1 ← (unumber)(number) 0
Successful SSA optimization Pass2InlineCast
Simplifying constant pointer cast (void()**) 788
Simplifying constant pointer cast (byte*) 53280
Simplifying constant integer cast 0
Simplifying constant integer cast $a
Simplifying constant integer cast 0
Simplifying constant integer cast 0
Simplifying constant integer cast 2
Successful SSA optimization PassNCastSimplification
Finalized unsigned number type (byte) 0
Finalized unsigned number type (byte) $a
Finalized unsigned number type (byte) 0
Finalized unsigned number type (byte) 0
Finalized unsigned number type (byte) 2
Successful SSA optimization PassNFinalizeNumberTypeConversions
Inversing boolean not [10] (bool~) main::$2 ← (byte) col#7 <= (byte) $a from [9] (bool~) main::$1 ← (byte) col#7 > (byte) $a
Successful SSA optimization Pass2UnaryNotSimplification
Alias (byte) col#14 = (byte) col#7 (byte) col#8 (byte) col#2 
Alias (byte) col#10 = (byte) col#9 (byte) col#11 
Alias (byte) col#12 = (byte) col#5 
Alias (byte) col#0 = (byte) col#15 
Alias (byte) col#13 = (byte) col#6 
Successful SSA optimization Pass2AliasElimination
Identical Phi Values (byte) col#16 (byte) col#0
Identical Phi Values (byte) col#10 (byte) col#0
Identical Phi Values (byte) col#13 (byte) col#14
Successful SSA optimization Pass2IdenticalPhiElimination
Simple Condition (bool~) main::$2 [11] if((byte) col#14<=(byte) $a) goto main::@1
Simple Condition (bool~) irq::$0 [20] if((byte) col#0!=(byte) 0) goto irq::@1
Successful SSA optimization Pass2ConditionalJumpSimplification
Constant right-side identified [4] (void()*~) main::$0 ← & interrupt(KERNEL_MIN)(void()) irq()
Successful SSA optimization Pass2ConstantRValueConsolidation
Constant (const void()**) KERNEL_IRQ#0 = (void()**) 788
Constant (const byte*) BGCOL#0 = (byte*) 53280
Constant (const void()*) main::$0 = &irq
Successful SSA optimization Pass2ConstantIdentification
if() condition always true - replacing block destination [7] if(true) goto main::@2
Successful SSA optimization Pass2ConstantIfs
Rewriting conditional comparison [11] if((byte) col#14<=(byte) $a) goto main::@1
Removing unused block main::@return
Successful SSA optimization Pass2EliminateUnusedBlocks
Adding number conversion cast (unumber) $a+1 in if((byte) col#14<(byte) $a+(number) 1) goto main::@1
Adding number conversion cast (unumber) 1 in if((byte) col#14<(unumber)(byte) $a+(number) 1) goto main::@1
Successful SSA optimization PassNAddNumberTypeConversions
Simplifying constant integer cast (byte) $a+(unumber)(number) 1
Simplifying constant integer cast 1
Successful SSA optimization PassNCastSimplification
Finalized unsigned number type (byte) 1
Successful SSA optimization PassNFinalizeNumberTypeConversions
Constant inlined main::$0 = &interrupt(KERNEL_MIN)(void()) irq()
Successful SSA optimization Pass2ConstantInlining
Added new block during phi lifting main::@9(between main::@2 and main::@1)
Adding NOP phi() at start of @2
Adding NOP phi() at start of @3
Adding NOP phi() at start of @end
CALL GRAPH
Calls in [] to main:2 

Created 2 initial phi equivalence classes
Coalesced [6] col#17 ← col#0
Coalesced [10] col#19 ← col#1
Coalesced (already) [11] col#18 ← col#14
Coalesced [16] col#21 ← col#4
Coalesced [20] col#20 ← col#3
Coalesced down to 2 phi equivalence classes
Culled Empty Block (label) @3
Culled Empty Block (label) main::@9
Renumbering block @2 to @1
Renumbering block main::@7 to main::@3
Renumbering block irq::@3 to irq::@2
Adding NOP phi() at start of @1
Adding NOP phi() at start of @end

FINAL CONTROL FLOW GRAPH
@begin: scope:[]  from
  [0] (byte) col#0 ← (byte) 0
  to:@1
@1: scope:[]  from @begin
  [1] phi()
  [2] call main 
  to:@end
@end: scope:[]  from @1
  [3] phi()
main: scope:[main]  from @1
  [4] *((const void()**) KERNEL_IRQ#0) ← &interrupt(KERNEL_MIN)(void()) irq()
  to:main::@1
main::@1: scope:[main]  from main main::@2 main::@3
  [5] (byte) col#14 ← phi( main/(byte) col#0 main::@2/(byte) col#14 main::@3/(byte) col#1 )
  to:main::@2
main::@2: scope:[main]  from main::@1
  [6] if((byte) col#14<(byte) $a+(byte) 1) goto main::@1
  to:main::@3
main::@3: scope:[main]  from main::@2
  [7] (byte) col#1 ← (byte) 0
  to:main::@1
irq: scope:[irq]  from
  asm { lda$dc0d  }
  [9] *((const byte*) BGCOL#0) ← (byte) col#0
  [10] if((byte) col#0!=(byte) 0) goto irq::@1
  to:irq::@2
irq::@2: scope:[irq]  from irq
  [11] (byte) col#4 ← (byte) col#0 + (byte) 2
  to:irq::@return
irq::@return: scope:[irq]  from irq::@1 irq::@2
  [12] (byte) col#12 ← phi( irq::@1/(byte) col#3 irq::@2/(byte) col#4 )
  [13] return 
  to:@return
irq::@1: scope:[irq]  from irq
  [14] (byte) col#3 ← ++ (byte) col#0
  to:irq::@return


VARIABLE REGISTER WEIGHTS
(byte*) BGCOL
(void()**) KERNEL_IRQ
(byte) col
(byte) col#0 1.9999999999999998
(byte) col#1 22.0
(byte) col#12 40.0
(byte) col#14 158.0
(byte) col#3 4.0
(byte) col#4 4.0
interrupt(KERNEL_MIN)(void()) irq()
(void()) main()

Initial phi equivalence classes
[ col#14 col#0 col#1 ]
[ col#12 col#3 col#4 ]
Coalescing volatile variable equivalence classes [ col#14 col#0 col#1 ] and [ col#12 col#3 col#4 ]
Complete equivalence classes
[ col#14 col#0 col#1 col#12 col#3 col#4 ]
Allocated zp ZP_BYTE:2 [ col#14 col#0 col#1 col#12 col#3 col#4 ]

INITIAL ASM
Target platform is c64basic
  // File Comments
// Tests that volatile variables can be both read & written inside & outside interrupts
// Currently fails because the modification is optimized away
  // Upstart
.pc = $801 "Basic"
:BasicUpstart(bbegin)
.pc = $80d "Program"
  // Global Constants & labels
  .label KERNEL_IRQ = $314
  .label BGCOL = $d020
  .label col = 2
  // @begin
bbegin:
  // [0] (byte) col#0 ← (byte) 0 -- vbuz1=vbuc1 
  lda #0
  sta.z col
  // [1] phi from @begin to @1 [phi:@begin->@1]
b1_from_bbegin:
  jmp b1
  // @1
b1:
  // [2] call main 
  jsr main
  // [3] phi from @1 to @end [phi:@1->@end]
bend_from_b1:
  jmp bend
  // @end
bend:
  // main
main: {
    // [4] *((const void()**) KERNEL_IRQ#0) ← &interrupt(KERNEL_MIN)(void()) irq() -- _deref_pptc1=pprc2 
    lda #<irq
    sta KERNEL_IRQ
    lda #>irq
    sta KERNEL_IRQ+1
    // [5] phi from main main::@2 main::@3 to main::@1 [phi:main/main::@2/main::@3->main::@1]
  b1_from_main:
  b1_from_b2:
  b1_from_b3:
    // [5] phi (byte) col#14 = (byte) col#0 [phi:main/main::@2/main::@3->main::@1#0] -- register_copy 
    jmp b1
    // main::@1
  b1:
    jmp b2
    // main::@2
  b2:
    // [6] if((byte) col#14<(byte) $a+(byte) 1) goto main::@1 -- vbuz1_lt_vbuc1_then_la1 
    lda.z col
    cmp #$a+1
    bcc b1_from_b2
    jmp b3
    // main::@3
  b3:
    // [7] (byte) col#1 ← (byte) 0 -- vbuz1=vbuc1 
    lda #0
    sta.z col
    jmp b1_from_b3
}
  // irq
irq: {
    // entry interrupt(KERNEL_MIN)
    // asm { lda$dc0d  }
    lda $dc0d
    // [9] *((const byte*) BGCOL#0) ← (byte) col#0 -- _deref_pbuc1=vbuz1 
    lda.z col
    sta BGCOL
    // [10] if((byte) col#0!=(byte) 0) goto irq::@1 -- vbuz1_neq_0_then_la1 
    lda.z col
    cmp #0
    bne b1
    jmp b2
    // irq::@2
  b2:
    // [11] (byte) col#4 ← (byte) col#0 + (byte) 2 -- vbuz1=vbuz1_plus_2 
    lda.z col
    clc
    adc #2
    sta.z col
    // [12] phi from irq::@1 irq::@2 to irq::@return [phi:irq::@1/irq::@2->irq::@return]
  breturn_from_b1:
  breturn_from_b2:
    // [12] phi (byte) col#12 = (byte) col#3 [phi:irq::@1/irq::@2->irq::@return#0] -- register_copy 
    jmp breturn
    // irq::@return
  breturn:
    // [13] return  - exit interrupt(KERNEL_MIN)
    jmp $ea81
    // irq::@1
  b1:
    // [14] (byte) col#3 ← ++ (byte) col#0 -- vbuz1=_inc_vbuz1 
    inc.z col
    jmp breturn_from_b1
}
  // File Data

REGISTER UPLIFT POTENTIAL REGISTERS
Statement [0] (byte) col#0 ← (byte) 0 [ col#0 ] (  [ col#0 ] ) always clobbers reg byte a 
Statement [4] *((const void()**) KERNEL_IRQ#0) ← &interrupt(KERNEL_MIN)(void()) irq() [ col#0 ] ( main:2 [ col#0 ] ) always clobbers reg byte a 
Statement [6] if((byte) col#14<(byte) $a+(byte) 1) goto main::@1 [ col#14 ] ( main:2 [ col#14 ] ) always clobbers reg byte a 
Statement [7] (byte) col#1 ← (byte) 0 [ col#1 ] ( main:2 [ col#1 ] ) always clobbers reg byte a 
Statement asm { lda$dc0d  } always clobbers reg byte a 
Statement [9] *((const byte*) BGCOL#0) ← (byte) col#0 [ col#0 ] (  [ col#0 ] ) always clobbers reg byte a 
Statement [10] if((byte) col#0!=(byte) 0) goto irq::@1 [ col#0 ] (  [ col#0 ] ) always clobbers reg byte a 
Statement [11] (byte) col#4 ← (byte) col#0 + (byte) 2 [ col#4 ] (  [ col#4 ] ) always clobbers reg byte a 
Potential registers zp ZP_BYTE:2 [ col#14 col#0 col#1 col#12 col#3 col#4 ] : zp ZP_BYTE:2 , 

REGISTER UPLIFT SCOPES
Uplift Scope [] 230: zp ZP_BYTE:2 [ col#14 col#0 col#1 col#12 col#3 col#4 ] 
Uplift Scope [main] 
Uplift Scope [irq] 

Uplifting [] best 1534 combination zp ZP_BYTE:2 [ col#14 col#0 col#1 col#12 col#3 col#4 ] 
Uplifting [main] best 1534 combination 
Uplifting [irq] best 1534 combination 
Attempting to uplift remaining variables inzp ZP_BYTE:2 [ col#14 col#0 col#1 col#12 col#3 col#4 ]
Uplifting [] best 1534 combination zp ZP_BYTE:2 [ col#14 col#0 col#1 col#12 col#3 col#4 ] 

ASSEMBLER BEFORE OPTIMIZATION
  // File Comments
// Tests that volatile variables can be both read & written inside & outside interrupts
// Currently fails because the modification is optimized away
  // Upstart
.pc = $801 "Basic"
:BasicUpstart(bbegin)
.pc = $80d "Program"
  // Global Constants & labels
  .label KERNEL_IRQ = $314
  .label BGCOL = $d020
  .label col = 2
  // @begin
bbegin:
  // [0] (byte) col#0 ← (byte) 0 -- vbuz1=vbuc1 
  lda #0
  sta.z col
  // [1] phi from @begin to @1 [phi:@begin->@1]
b1_from_bbegin:
  jmp b1
  // @1
b1:
  // [2] call main 
  jsr main
  // [3] phi from @1 to @end [phi:@1->@end]
bend_from_b1:
  jmp bend
  // @end
bend:
  // main
main: {
    // [4] *((const void()**) KERNEL_IRQ#0) ← &interrupt(KERNEL_MIN)(void()) irq() -- _deref_pptc1=pprc2 
    lda #<irq
    sta KERNEL_IRQ
    lda #>irq
    sta KERNEL_IRQ+1
    // [5] phi from main main::@2 main::@3 to main::@1 [phi:main/main::@2/main::@3->main::@1]
  b1_from_main:
  b1_from_b2:
  b1_from_b3:
    // [5] phi (byte) col#14 = (byte) col#0 [phi:main/main::@2/main::@3->main::@1#0] -- register_copy 
    jmp b1
    // main::@1
  b1:
    jmp b2
    // main::@2
  b2:
    // [6] if((byte) col#14<(byte) $a+(byte) 1) goto main::@1 -- vbuz1_lt_vbuc1_then_la1 
    lda.z col
    cmp #$a+1
    bcc b1_from_b2
    jmp b3
    // main::@3
  b3:
    // [7] (byte) col#1 ← (byte) 0 -- vbuz1=vbuc1 
    lda #0
    sta.z col
    jmp b1_from_b3
}
  // irq
irq: {
    // entry interrupt(KERNEL_MIN)
    // asm { lda$dc0d  }
    lda $dc0d
    // [9] *((const byte*) BGCOL#0) ← (byte) col#0 -- _deref_pbuc1=vbuz1 
    lda.z col
    sta BGCOL
    // [10] if((byte) col#0!=(byte) 0) goto irq::@1 -- vbuz1_neq_0_then_la1 
    lda.z col
    cmp #0
    bne b1
    jmp b2
    // irq::@2
  b2:
    // [11] (byte) col#4 ← (byte) col#0 + (byte) 2 -- vbuz1=vbuz1_plus_2 
    lda.z col
    clc
    adc #2
    sta.z col
    // [12] phi from irq::@1 irq::@2 to irq::@return [phi:irq::@1/irq::@2->irq::@return]
  breturn_from_b1:
  breturn_from_b2:
    // [12] phi (byte) col#12 = (byte) col#3 [phi:irq::@1/irq::@2->irq::@return#0] -- register_copy 
    jmp breturn
    // irq::@return
  breturn:
    // [13] return  - exit interrupt(KERNEL_MIN)
    jmp $ea81
    // irq::@1
  b1:
    // [14] (byte) col#3 ← ++ (byte) col#0 -- vbuz1=_inc_vbuz1 
    inc.z col
    jmp breturn_from_b1
}
  // File Data

ASSEMBLER OPTIMIZATIONS
Removing instruction jmp b1
Removing instruction jmp bend
Removing instruction jmp b1
Removing instruction jmp b2
Removing instruction jmp b3
Removing instruction jmp b2
Removing instruction jmp breturn
Succesful ASM optimization Pass5NextJumpElimination
Replacing label b1_from_b2 with b2
Replacing label b1_from_b3 with b2
Replacing label breturn_from_b1 with breturn
Removing instruction b1_from_bbegin:
Removing instruction bend_from_b1:
Removing instruction b1_from_main:
Removing instruction b1_from_b2:
Removing instruction b1_from_b3:
Removing instruction b1:
Removing instruction breturn_from_b1:
Removing instruction breturn_from_b2:
Succesful ASM optimization Pass5RedundantLabelElimination
Removing instruction b1:
Removing instruction bend:
Removing instruction b3:
Removing instruction b2:
Succesful ASM optimization Pass5UnusedLabelElimination
Skipping double jump to $ea81 in jmp breturn
Succesful ASM optimization Pass5DoubleJumpElimination
Adding RTS to root block 
Succesful ASM optimization Pass5AddMainRts
Removing instruction lda.z col
Succesful ASM optimization Pass5UnnecesaryLoadElimination
Removing instruction breturn:
Succesful ASM optimization Pass5UnusedLabelElimination

FINAL SYMBOL TABLE
(label) @1
(label) @begin
(label) @end
(byte*) BGCOL
(const byte*) BGCOL#0 BGCOL = (byte*) 53280
(void()**) KERNEL_IRQ
(const void()**) KERNEL_IRQ#0 KERNEL_IRQ = (void()**) 788
(byte) col
(byte) col#0 col zp ZP_BYTE:2 1.9999999999999998
(byte) col#1 col zp ZP_BYTE:2 22.0
(byte) col#12 col zp ZP_BYTE:2 40.0
(byte) col#14 col zp ZP_BYTE:2 158.0
(byte) col#3 col zp ZP_BYTE:2 4.0
(byte) col#4 col zp ZP_BYTE:2 4.0
interrupt(KERNEL_MIN)(void()) irq()
(label) irq::@1
(label) irq::@2
(label) irq::@return
(void()) main()
(label) main::@1
(label) main::@2
(label) main::@3

zp ZP_BYTE:2 [ col#14 col#0 col#1 col#12 col#3 col#4 ]


FINAL ASSEMBLER
Score: 895

  // File Comments
// Tests that volatile variables can be both read & written inside & outside interrupts
// Currently fails because the modification is optimized away
  // Upstart
.pc = $801 "Basic"
:BasicUpstart(bbegin)
.pc = $80d "Program"
  // Global Constants & labels
  .label KERNEL_IRQ = $314
  .label BGCOL = $d020
  .label col = 2
  // @begin
bbegin:
  // col = 0
  // [0] (byte) col#0 ← (byte) 0 -- vbuz1=vbuc1 
  lda #0
  sta.z col
  // [1] phi from @begin to @1 [phi:@begin->@1]
  // @1
  // [2] call main 
  jsr main
  rts
  // [3] phi from @1 to @end [phi:@1->@end]
  // @end
  // main
main: {
    // *KERNEL_IRQ = &irq
    // [4] *((const void()**) KERNEL_IRQ#0) ← &interrupt(KERNEL_MIN)(void()) irq() -- _deref_pptc1=pprc2 
    lda #<irq
    sta KERNEL_IRQ
    lda #>irq
    sta KERNEL_IRQ+1
    // [5] phi from main main::@2 main::@3 to main::@1 [phi:main/main::@2/main::@3->main::@1]
    // [5] phi (byte) col#14 = (byte) col#0 [phi:main/main::@2/main::@3->main::@1#0] -- register_copy 
    // main::@1
    // main::@2
  b2:
    // if(col>10)
    // [6] if((byte) col#14<(byte) $a+(byte) 1) goto main::@1 -- vbuz1_lt_vbuc1_then_la1 
    lda.z col
    cmp #$a+1
    bcc b2
    // main::@3
    // col = 0
    // [7] (byte) col#1 ← (byte) 0 -- vbuz1=vbuc1 
    lda #0
    sta.z col
    jmp b2
}
  // irq
irq: {
    // entry interrupt(KERNEL_MIN)
    // asm
    // asm { lda$dc0d  }
    lda $dc0d
    // *BGCOL = col
    // [9] *((const byte*) BGCOL#0) ← (byte) col#0 -- _deref_pbuc1=vbuz1 
    lda.z col
    sta BGCOL
    // if(col!=0)
    // [10] if((byte) col#0!=(byte) 0) goto irq::@1 -- vbuz1_neq_0_then_la1 
    lda.z col
    cmp #0
    bne b1
    // irq::@2
    // col += 2
    // [11] (byte) col#4 ← (byte) col#0 + (byte) 2 -- vbuz1=vbuz1_plus_2 
    clc
    adc #2
    sta.z col
    // [12] phi from irq::@1 irq::@2 to irq::@return [phi:irq::@1/irq::@2->irq::@return]
    // [12] phi (byte) col#12 = (byte) col#3 [phi:irq::@1/irq::@2->irq::@return#0] -- register_copy 
    // irq::@return
    // }
    // [13] return  - exit interrupt(KERNEL_MIN)
    jmp $ea81
    // irq::@1
  b1:
    // col++;
    // [14] (byte) col#3 ← ++ (byte) col#0 -- vbuz1=_inc_vbuz1 
    inc.z col
    jmp $ea81
}
  // File Data

