Inlined call call __init

CONTROL FLOW GRAPH SSA

void main()
main: scope:[main]  from __start::@1
  idx#20 = phi( __start::@1/idx#19 )
  main::i#0 = 2
  to:main::@1
main::@1: scope:[main]  from main main::@2
  idx#17 = phi( main/idx#20, main::@2/idx#0 )
  main::i#2 = phi( main/main::i#0, main::@2/main::i#1 )
  main::$2 = 0 != main::i#2
  if(main::$2) goto main::@2
  to:main::@3
main::@2: scope:[main]  from main::@1
  idx#9 = phi( main::@1/idx#17 )
  main::i#3 = phi( main::@1/main::i#2 )
  SCREEN[idx#9] = main::i#3
  idx#0 = ++ idx#9
  main::i#1 = -- main::i#3
  to:main::@1
main::@3: scope:[main]  from main::@1
  idx#10 = phi( main::@1/idx#17 )
  SCREEN[idx#10] = ' '
  idx#1 = ++ idx#10
  main::j#0 = 3
  to:main::@4
main::@4: scope:[main]  from main::@3 main::@5
  idx#18 = phi( main::@3/idx#1, main::@5/idx#2 )
  main::j#2 = phi( main::@3/main::j#0, main::@5/main::j#3 )
  main::$0 = main::j#2
  main::j#1 = -- main::j#2
  main::$3 = 0 != main::$0
  if(main::$3) goto main::@5
  to:main::@6
main::@5: scope:[main]  from main::@4
  idx#11 = phi( main::@4/idx#18 )
  main::j#3 = phi( main::@4/main::j#1 )
  SCREEN[idx#11] = main::j#3
  idx#2 = ++ idx#11
  to:main::@4
main::@6: scope:[main]  from main::@4
  idx#12 = phi( main::@4/idx#18 )
  SCREEN[idx#12] = ' '
  idx#3 = ++ idx#12
  main::k#0 = 2
  to:main::@7
main::@7: scope:[main]  from main::@6 main::@7
  idx#13 = phi( main::@6/idx#3, main::@7/idx#4 )
  main::k#2 = phi( main::@6/main::k#0, main::@7/main::k#1 )
  SCREEN[idx#13] = main::k#2
  idx#4 = ++ idx#13
  main::$1 = main::k#2
  main::k#1 = -- main::k#2
  main::$4 = 0 != main::$1
  if(main::$4) goto main::@7
  to:main::@return
main::@return: scope:[main]  from main::@7
  idx#14 = phi( main::@7/idx#4 )
  idx#5 = idx#14
  return 
  to:@return

void __start()
__start: scope:[__start]  from
  to:__start::__init1
__start::__init1: scope:[__start]  from __start
  idx#6 = 0
  to:__start::@1
__start::@1: scope:[__start]  from __start::__init1
  idx#19 = phi( __start::__init1/idx#6 )
  call main
  to:__start::@2
__start::@2: scope:[__start]  from __start::@1
  idx#15 = phi( __start::@1/idx#5 )
  idx#7 = idx#15
  to:__start::@return
__start::@return: scope:[__start]  from __start::@2
  idx#16 = phi( __start::@2/idx#7 )
  idx#8 = idx#16
  return 
  to:@return

SYMBOL TABLE SSA
__constant char * const SCREEN = (char *)$400
void __start()
char idx
char idx#0
char idx#1
char idx#10
char idx#11
char idx#12
char idx#13
char idx#14
char idx#15
char idx#16
char idx#17
char idx#18
char idx#19
char idx#2
char idx#20
char idx#3
char idx#4
char idx#5
char idx#6
char idx#7
char idx#8
char idx#9
void main()
char main::$0
char main::$1
bool main::$2
bool main::$3
bool main::$4
char main::i
char main::i#0
char main::i#1
char main::i#2
char main::i#3
char main::j
char main::j#0
char main::j#1
char main::j#2
char main::j#3
char main::k
char main::k#0
char main::k#1
char main::k#2

Adding number conversion cast (unumber) 0 in main::$2 = 0 != main::i#2
Adding number conversion cast (unumber) 0 in main::$3 = 0 != main::$0
Adding number conversion cast (unumber) 0 in main::$4 = 0 != main::$1
Successful SSA optimization PassNAddNumberTypeConversions
Simplifying constant pointer cast (char *) 1024
Simplifying constant integer cast 0
Simplifying constant integer cast 0
Simplifying constant integer cast 0
Successful SSA optimization PassNCastSimplification
Finalized unsigned number type (char) 0
Finalized unsigned number type (char) 0
Finalized unsigned number type (char) 0
Successful SSA optimization PassNFinalizeNumberTypeConversions
Alias main::i#2 = main::i#3 
Alias idx#10 = idx#9 idx#17 
Alias main::j#2 = main::$0 
Alias main::j#1 = main::j#3 
Alias idx#11 = idx#18 idx#12 
Alias main::k#2 = main::$1 
Alias idx#14 = idx#4 idx#5 
Alias idx#19 = idx#6 
Alias idx#15 = idx#7 idx#16 idx#8 
Successful SSA optimization Pass2AliasElimination
Identical Phi Values idx#20 idx#19
Identical Phi Values idx#15 idx#14
Successful SSA optimization Pass2IdenticalPhiElimination
Simple Condition main::$2 [4] if(0!=main::i#2) goto main::@2
Simple Condition main::$3 [14] if(0!=main::j#2) goto main::@5
Simple Condition main::$4 [25] if(0!=main::k#2) goto main::@7
Successful SSA optimization Pass2ConditionalJumpSimplification
Constant main::i#0 = 2
Constant main::j#0 = 3
Constant main::k#0 = 2
Constant idx#19 = 0
Successful SSA optimization Pass2ConstantIdentification
Removing unused procedure __start
Removing unused procedure block __start
Removing unused procedure block __start::__init1
Removing unused procedure block __start::@1
Removing unused procedure block __start::@2
Removing unused procedure block __start::@return
Successful SSA optimization PassNEliminateEmptyStart
Inlining constant with var siblings main::i#0
Inlining constant with var siblings main::j#0
Inlining constant with var siblings main::k#0
Inlining constant with var siblings idx#19
Constant inlined main::i#0 = 2
Constant inlined main::k#0 = 2
Constant inlined main::j#0 = 3
Constant inlined idx#19 = 0
Successful SSA optimization Pass2ConstantInlining
Added new block during phi lifting main::@8(between main::@7 and main::@7)
Adding NOP phi() at start of main
CALL GRAPH

Created 6 initial phi equivalence classes
Coalesced [5] idx#22 = idx#1
Coalesced [11] idx#24 = idx#3
Not coalescing [18] main::k#3 = main::k#1
Coalesced [19] idx#25 = idx#14
Not coalescing [22] main::j#4 = main::j#1
Coalesced [23] idx#23 = idx#2
Coalesced [27] main::i#4 = main::i#1
Coalesced [28] idx#21 = idx#0
Coalesced down to 8 phi equivalence classes
Adding NOP phi() at start of main

FINAL CONTROL FLOW GRAPH

void main()
main: scope:[main]  from
  [0] phi()
  to:main::@1
main::@1: scope:[main]  from main main::@2
  [1] idx#10 = phi( main/0, main::@2/idx#0 )
  [1] main::i#2 = phi( main/2, main::@2/main::i#1 )
  [2] if(0!=main::i#2) goto main::@2
  to:main::@3
main::@3: scope:[main]  from main::@1
  [3] SCREEN[idx#10] = ' '
  [4] idx#1 = ++ idx#10
  to:main::@4
main::@4: scope:[main]  from main::@3 main::@5
  [5] idx#11 = phi( main::@3/idx#1, main::@5/idx#2 )
  [5] main::j#2 = phi( main::@3/3, main::@5/main::j#4 )
  [6] main::j#1 = -- main::j#2
  [7] if(0!=main::j#2) goto main::@5
  to:main::@6
main::@6: scope:[main]  from main::@4
  [8] SCREEN[idx#11] = ' '
  [9] idx#3 = ++ idx#11
  to:main::@7
main::@7: scope:[main]  from main::@6 main::@8
  [10] idx#13 = phi( main::@6/idx#3, main::@8/idx#14 )
  [10] main::k#2 = phi( main::@6/2, main::@8/main::k#3 )
  [11] SCREEN[idx#13] = main::k#2
  [12] idx#14 = ++ idx#13
  [13] main::k#1 = -- main::k#2
  [14] if(0!=main::k#2) goto main::@8
  to:main::@return
main::@return: scope:[main]  from main::@7
  [15] return 
  to:@return
main::@8: scope:[main]  from main::@7
  [16] main::k#3 = main::k#1
  to:main::@7
main::@5: scope:[main]  from main::@4
  [17] SCREEN[idx#11] = main::j#1
  [18] idx#2 = ++ idx#11
  [19] main::j#4 = main::j#1
  to:main::@4
main::@2: scope:[main]  from main::@1
  [20] SCREEN[idx#10] = main::i#2
  [21] idx#0 = ++ idx#10
  [22] main::i#1 = -- main::i#2
  to:main::@1


VARIABLE REGISTER WEIGHTS
char idx
char idx#0 // 11.0
char idx#1 // 4.0
char idx#10 // 9.25
char idx#11 // 7.8
char idx#13 // 17.5
char idx#14 // 5.5
char idx#2 // 11.0
char idx#3 // 4.0
void main()
char main::i
char main::i#1 // 22.0
char main::i#2 // 11.0
char main::j
char main::j#1 // 8.25
char main::j#2 // 16.5
char main::j#4 // 22.0
char main::k
char main::k#1 // 11.0
char main::k#2 // 11.0
char main::k#3 // 22.0

Initial phi equivalence classes
[ main::i#2 main::i#1 ]
[ idx#10 idx#0 ]
[ main::j#2 main::j#4 ]
[ idx#11 idx#1 idx#2 ]
[ main::k#2 main::k#3 ]
[ idx#13 idx#3 idx#14 ]
Added variable main::j#1 to live range equivalence class [ main::j#1 ]
Added variable main::k#1 to live range equivalence class [ main::k#1 ]
Complete equivalence classes
[ main::i#2 main::i#1 ]
[ idx#10 idx#0 ]
[ main::j#2 main::j#4 ]
[ idx#11 idx#1 idx#2 ]
[ main::k#2 main::k#3 ]
[ idx#13 idx#3 idx#14 ]
[ main::j#1 ]
[ main::k#1 ]
Allocated zp[1]:2 [ main::j#2 main::j#4 ]
Allocated zp[1]:3 [ main::i#2 main::i#1 ]
Allocated zp[1]:4 [ main::k#2 main::k#3 ]
Allocated zp[1]:5 [ idx#13 idx#3 idx#14 ]
Allocated zp[1]:6 [ idx#11 idx#1 idx#2 ]
Allocated zp[1]:7 [ idx#10 idx#0 ]
Allocated zp[1]:8 [ main::k#1 ]
Allocated zp[1]:9 [ main::j#1 ]
REGISTER UPLIFT POTENTIAL REGISTERS
Statement [3] SCREEN[idx#10] = ' ' [ idx#10 ] (  [ idx#10 ] { }  ) always clobbers reg byte a 
Removing always clobbered register reg byte a as potential for zp[1]:7 [ idx#10 idx#0 ]
Statement [8] SCREEN[idx#11] = ' ' [ idx#11 ] (  [ idx#11 ] { }  ) always clobbers reg byte a 
Removing always clobbered register reg byte a as potential for zp[1]:6 [ idx#11 idx#1 idx#2 ]
Statement [3] SCREEN[idx#10] = ' ' [ idx#10 ] (  [ idx#10 ] { }  ) always clobbers reg byte a 
Statement [8] SCREEN[idx#11] = ' ' [ idx#11 ] (  [ idx#11 ] { }  ) always clobbers reg byte a 
Potential registers zp[1]:3 [ main::i#2 main::i#1 ] : zp[1]:3 , reg byte a , reg byte x , reg byte y , 
Potential registers zp[1]:7 [ idx#10 idx#0 ] : zp[1]:7 , reg byte x , reg byte y , 
Potential registers zp[1]:2 [ main::j#2 main::j#4 ] : zp[1]:2 , reg byte a , reg byte x , reg byte y , 
Potential registers zp[1]:6 [ idx#11 idx#1 idx#2 ] : zp[1]:6 , reg byte x , reg byte y , 
Potential registers zp[1]:4 [ main::k#2 main::k#3 ] : zp[1]:4 , reg byte a , reg byte x , reg byte y , 
Potential registers zp[1]:5 [ idx#13 idx#3 idx#14 ] : zp[1]:5 , reg byte a , reg byte x , reg byte y , 
Potential registers zp[1]:9 [ main::j#1 ] : zp[1]:9 , reg byte a , reg byte x , reg byte y , 
Potential registers zp[1]:8 [ main::k#1 ] : zp[1]:8 , reg byte a , reg byte x , reg byte y , 

REGISTER UPLIFT SCOPES
Uplift Scope [main] 38.5: zp[1]:2 [ main::j#2 main::j#4 ] 33: zp[1]:3 [ main::i#2 main::i#1 ] 33: zp[1]:4 [ main::k#2 main::k#3 ] 11: zp[1]:8 [ main::k#1 ] 8.25: zp[1]:9 [ main::j#1 ] 
Uplift Scope [] 27: zp[1]:5 [ idx#13 idx#3 idx#14 ] 22.8: zp[1]:6 [ idx#11 idx#1 idx#2 ] 20.25: zp[1]:7 [ idx#10 idx#0 ] 

Uplifting [main] best 1377 combination zp[1]:2 [ main::j#2 main::j#4 ] zp[1]:3 [ main::i#2 main::i#1 ] reg byte x [ main::k#2 main::k#3 ] reg byte a [ main::k#1 ] zp[1]:9 [ main::j#1 ] 
Limited combination testing to 100 combinations of 1024 possible.
Uplifting [] best 1153 combination reg byte y [ idx#13 idx#3 idx#14 ] reg byte x [ idx#11 idx#1 idx#2 ] reg byte x [ idx#10 idx#0 ] 
Attempting to uplift remaining variables inzp[1]:2 [ main::j#2 main::j#4 ]
Uplifting [main] best 1153 combination zp[1]:2 [ main::j#2 main::j#4 ] 
Attempting to uplift remaining variables inzp[1]:3 [ main::i#2 main::i#1 ]
Uplifting [main] best 1073 combination reg byte a [ main::i#2 main::i#1 ] 
Attempting to uplift remaining variables inzp[1]:9 [ main::j#1 ]
Uplifting [main] best 1003 combination reg byte y [ main::j#1 ] 

ASSEMBLER BEFORE OPTIMIZATION
  // File Comments
// Tests using integer conditions in while() / for() / do..while
// This should produce 'ba ba@ ba@' at the top of the screen
  // Upstart
  // Commodore 64 PRG executable file
.file [name="condition-integer-2.prg", type="prg", segments="Program"]
.segmentdef Program [segments="Basic, Code, Data"]
.segmentdef Basic [start=$0801]
.segmentdef Code [start=$80d]
.segmentdef Data [startAfter="Code"]
.segment Basic
:BasicUpstart(main)
  // Global Constants & labels
  .label SCREEN = $400
.segment Code
  // main
main: {
    // while()
    .label j = 2
    // [1] phi from main to main::@1 [phi:main->main::@1]
  __b1_from_main:
    // [1] phi idx#10 = 0 [phi:main->main::@1#0] -- vbuxx=vbuc1 
    ldx #0
    // [1] phi main::i#2 = 2 [phi:main->main::@1#1] -- vbuaa=vbuc1 
    lda #2
    jmp __b1
  // for()
    // main::@1
  __b1:
    // [2] if(0!=main::i#2) goto main::@2 -- 0_neq_vbuaa_then_la1 
    cmp #0
    bne __b2
    jmp __b3
    // main::@3
  __b3:
    // [3] SCREEN[idx#10] = ' ' -- pbuc1_derefidx_vbuxx=vbuc2 
    lda #' '
    sta SCREEN,x
    // [4] idx#1 = ++ idx#10 -- vbuxx=_inc_vbuxx 
    inx
    // [5] phi from main::@3 to main::@4 [phi:main::@3->main::@4]
  __b4_from___b3:
    // [5] phi idx#11 = idx#1 [phi:main::@3->main::@4#0] -- register_copy 
    // [5] phi main::j#2 = 3 [phi:main::@3->main::@4#1] -- vbuz1=vbuc1 
    lda #3
    sta.z j
    jmp __b4
    // main::@4
  __b4:
    // [6] main::j#1 = -- main::j#2 -- vbuyy=_dec_vbuz1 
    ldy.z j
    dey
    // [7] if(0!=main::j#2) goto main::@5 -- 0_neq_vbuz1_then_la1 
    lda.z j
    bne __b5
    jmp __b6
    // main::@6
  __b6:
    // [8] SCREEN[idx#11] = ' ' -- pbuc1_derefidx_vbuxx=vbuc2 
    lda #' '
    sta SCREEN,x
    // [9] idx#3 = ++ idx#11 -- vbuyy=_inc_vbuxx 
    txa
    tay
    iny
    // [10] phi from main::@6 to main::@7 [phi:main::@6->main::@7]
  __b7_from___b6:
    // [10] phi idx#13 = idx#3 [phi:main::@6->main::@7#0] -- register_copy 
    // [10] phi main::k#2 = 2 [phi:main::@6->main::@7#1] -- vbuxx=vbuc1 
    ldx #2
    jmp __b7
    // main::@7
  __b7:
    // [11] SCREEN[idx#13] = main::k#2 -- pbuc1_derefidx_vbuyy=vbuxx 
    txa
    sta SCREEN,y
    // [12] idx#14 = ++ idx#13 -- vbuyy=_inc_vbuyy 
    iny
    // [13] main::k#1 = -- main::k#2 -- vbuaa=_dec_vbuxx 
    txa
    sec
    sbc #1
    // [14] if(0!=main::k#2) goto main::@8 -- 0_neq_vbuxx_then_la1 
    cpx #0
    bne __b8
    jmp __breturn
    // main::@return
  __breturn:
    // [15] return 
    rts
    // main::@8
  __b8:
    // [16] main::k#3 = main::k#1 -- vbuxx=vbuaa 
    tax
    // [10] phi from main::@8 to main::@7 [phi:main::@8->main::@7]
  __b7_from___b8:
    // [10] phi idx#13 = idx#14 [phi:main::@8->main::@7#0] -- register_copy 
    // [10] phi main::k#2 = main::k#3 [phi:main::@8->main::@7#1] -- register_copy 
    jmp __b7
    // main::@5
  __b5:
    // [17] SCREEN[idx#11] = main::j#1 -- pbuc1_derefidx_vbuxx=vbuyy 
    tya
    sta SCREEN,x
    // [18] idx#2 = ++ idx#11 -- vbuxx=_inc_vbuxx 
    inx
    // [19] main::j#4 = main::j#1 -- vbuz1=vbuyy 
    sty.z j
    // [5] phi from main::@5 to main::@4 [phi:main::@5->main::@4]
  __b4_from___b5:
    // [5] phi idx#11 = idx#2 [phi:main::@5->main::@4#0] -- register_copy 
    // [5] phi main::j#2 = main::j#4 [phi:main::@5->main::@4#1] -- register_copy 
    jmp __b4
    // main::@2
  __b2:
    // [20] SCREEN[idx#10] = main::i#2 -- pbuc1_derefidx_vbuxx=vbuaa 
    sta SCREEN,x
    // [21] idx#0 = ++ idx#10 -- vbuxx=_inc_vbuxx 
    inx
    // [22] main::i#1 = -- main::i#2 -- vbuaa=_dec_vbuaa 
    sec
    sbc #1
    // [1] phi from main::@2 to main::@1 [phi:main::@2->main::@1]
  __b1_from___b2:
    // [1] phi idx#10 = idx#0 [phi:main::@2->main::@1#0] -- register_copy 
    // [1] phi main::i#2 = main::i#1 [phi:main::@2->main::@1#1] -- register_copy 
    jmp __b1
}
  // File Data

ASSEMBLER OPTIMIZATIONS
Removing instruction jmp __b1
Removing instruction jmp __b3
Removing instruction jmp __b4
Removing instruction jmp __b6
Removing instruction jmp __b7
Removing instruction jmp __breturn
Succesful ASM optimization Pass5NextJumpElimination
Removing instruction __b1_from_main:
Removing instruction __b3:
Removing instruction __b4_from___b3:
Removing instruction __b6:
Removing instruction __b7_from___b6:
Removing instruction __breturn:
Removing instruction __b7_from___b8:
Removing instruction __b4_from___b5:
Removing instruction __b1_from___b2:
Succesful ASM optimization Pass5UnusedLabelElimination

FINAL SYMBOL TABLE
__constant char * const SCREEN = (char *) 1024
char idx
char idx#0 // reg byte x 11.0
char idx#1 // reg byte x 4.0
char idx#10 // reg byte x 9.25
char idx#11 // reg byte x 7.8
char idx#13 // reg byte y 17.5
char idx#14 // reg byte y 5.5
char idx#2 // reg byte x 11.0
char idx#3 // reg byte y 4.0
void main()
char main::i
char main::i#1 // reg byte a 22.0
char main::i#2 // reg byte a 11.0
char main::j
char main::j#1 // reg byte y 8.25
char main::j#2 // j zp[1]:2 16.5
char main::j#4 // j zp[1]:2 22.0
char main::k
char main::k#1 // reg byte a 11.0
char main::k#2 // reg byte x 11.0
char main::k#3 // reg byte x 22.0

reg byte a [ main::i#2 main::i#1 ]
reg byte x [ idx#10 idx#0 ]
zp[1]:2 [ main::j#2 main::j#4 ]
reg byte x [ idx#11 idx#1 idx#2 ]
reg byte x [ main::k#2 main::k#3 ]
reg byte y [ idx#13 idx#3 idx#14 ]
reg byte y [ main::j#1 ]
reg byte a [ main::k#1 ]


FINAL ASSEMBLER
Score: 823

  // File Comments
// Tests using integer conditions in while() / for() / do..while
// This should produce 'ba ba@ ba@' at the top of the screen
  // Upstart
  // Commodore 64 PRG executable file
.file [name="condition-integer-2.prg", type="prg", segments="Program"]
.segmentdef Program [segments="Basic, Code, Data"]
.segmentdef Basic [start=$0801]
.segmentdef Code [start=$80d]
.segmentdef Data [startAfter="Code"]
.segment Basic
:BasicUpstart(main)
  // Global Constants & labels
  .label SCREEN = $400
.segment Code
  // main
main: {
    // while()
    .label j = 2
    // [1] phi from main to main::@1 [phi:main->main::@1]
    // [1] phi idx#10 = 0 [phi:main->main::@1#0] -- vbuxx=vbuc1 
    ldx #0
    // [1] phi main::i#2 = 2 [phi:main->main::@1#1] -- vbuaa=vbuc1 
    lda #2
  // for()
    // main::@1
  __b1:
    // for( byte i=2;i;i--)
    // [2] if(0!=main::i#2) goto main::@2 -- 0_neq_vbuaa_then_la1 
    cmp #0
    bne __b2
    // main::@3
    // SCREEN[idx++] = ' '
    // [3] SCREEN[idx#10] = ' ' -- pbuc1_derefidx_vbuxx=vbuc2 
    lda #' '
    sta SCREEN,x
    // SCREEN[idx++] = ' ';
    // [4] idx#1 = ++ idx#10 -- vbuxx=_inc_vbuxx 
    inx
    // [5] phi from main::@3 to main::@4 [phi:main::@3->main::@4]
    // [5] phi idx#11 = idx#1 [phi:main::@3->main::@4#0] -- register_copy 
    // [5] phi main::j#2 = 3 [phi:main::@3->main::@4#1] -- vbuz1=vbuc1 
    lda #3
    sta.z j
    // main::@4
  __b4:
    // while( j-- )
    // [6] main::j#1 = -- main::j#2 -- vbuyy=_dec_vbuz1 
    ldy.z j
    dey
    // [7] if(0!=main::j#2) goto main::@5 -- 0_neq_vbuz1_then_la1 
    lda.z j
    bne __b5
    // main::@6
    // SCREEN[idx++] = ' '
    // [8] SCREEN[idx#11] = ' ' -- pbuc1_derefidx_vbuxx=vbuc2 
    lda #' '
    sta SCREEN,x
    // SCREEN[idx++] = ' ';
    // [9] idx#3 = ++ idx#11 -- vbuyy=_inc_vbuxx 
    txa
    tay
    iny
    // [10] phi from main::@6 to main::@7 [phi:main::@6->main::@7]
    // [10] phi idx#13 = idx#3 [phi:main::@6->main::@7#0] -- register_copy 
    // [10] phi main::k#2 = 2 [phi:main::@6->main::@7#1] -- vbuxx=vbuc1 
    ldx #2
    // main::@7
  __b7:
    // SCREEN[idx++] = k
    // [11] SCREEN[idx#13] = main::k#2 -- pbuc1_derefidx_vbuyy=vbuxx 
    txa
    sta SCREEN,y
    // SCREEN[idx++] = k;
    // [12] idx#14 = ++ idx#13 -- vbuyy=_inc_vbuyy 
    iny
    // while(k--)
    // [13] main::k#1 = -- main::k#2 -- vbuaa=_dec_vbuxx 
    txa
    sec
    sbc #1
    // [14] if(0!=main::k#2) goto main::@8 -- 0_neq_vbuxx_then_la1 
    cpx #0
    bne __b8
    // main::@return
    // }
    // [15] return 
    rts
    // main::@8
  __b8:
    // [16] main::k#3 = main::k#1 -- vbuxx=vbuaa 
    tax
    // [10] phi from main::@8 to main::@7 [phi:main::@8->main::@7]
    // [10] phi idx#13 = idx#14 [phi:main::@8->main::@7#0] -- register_copy 
    // [10] phi main::k#2 = main::k#3 [phi:main::@8->main::@7#1] -- register_copy 
    jmp __b7
    // main::@5
  __b5:
    // SCREEN[idx++] = j
    // [17] SCREEN[idx#11] = main::j#1 -- pbuc1_derefidx_vbuxx=vbuyy 
    tya
    sta SCREEN,x
    // SCREEN[idx++] = j;
    // [18] idx#2 = ++ idx#11 -- vbuxx=_inc_vbuxx 
    inx
    // [19] main::j#4 = main::j#1 -- vbuz1=vbuyy 
    sty.z j
    // [5] phi from main::@5 to main::@4 [phi:main::@5->main::@4]
    // [5] phi idx#11 = idx#2 [phi:main::@5->main::@4#0] -- register_copy 
    // [5] phi main::j#2 = main::j#4 [phi:main::@5->main::@4#1] -- register_copy 
    jmp __b4
    // main::@2
  __b2:
    // SCREEN[idx++] = i
    // [20] SCREEN[idx#10] = main::i#2 -- pbuc1_derefidx_vbuxx=vbuaa 
    sta SCREEN,x
    // SCREEN[idx++] = i;
    // [21] idx#0 = ++ idx#10 -- vbuxx=_inc_vbuxx 
    inx
    // for( byte i=2;i;i--)
    // [22] main::i#1 = -- main::i#2 -- vbuaa=_dec_vbuaa 
    sec
    sbc #1
    // [1] phi from main::@2 to main::@1 [phi:main::@2->main::@1]
    // [1] phi idx#10 = idx#0 [phi:main::@2->main::@1#0] -- register_copy 
    // [1] phi main::i#2 = main::i#1 [phi:main::@2->main::@1#1] -- register_copy 
    jmp __b1
}
  // File Data

