Culled Empty Block (label) main::@4
Culled Empty Block (label) main::@5
Culled Empty Block (label) main::@6
Culled Empty Block (label) main::@10
Culled Empty Block (label) main::@9
Culled Empty Block (label) main::@11
Culled Empty Block (label) main::@12

CONTROL FLOW GRAPH SSA
@begin: scope:[]  from
  to:@1
main: scope:[main]  from @1
  (byte*) main::screen#0 ← ((byte*)) (number) $400
  (byte*) main::sc#0 ← (byte*) main::screen#0
  to:main::@1
main::@1: scope:[main]  from main main::@2
  (byte*) main::sc#2 ← phi( main/(byte*) main::sc#0 main::@2/(byte*) main::sc#1 )
  (byte*~) main::$0 ← (byte*) main::screen#0 + (number) $3e7
  (bool~) main::$1 ← (byte*) main::sc#2 <= (byte*~) main::$0
  if((bool~) main::$1) goto main::@2
  to:main::@3
main::@2: scope:[main]  from main::@1
  (byte*) main::sc#3 ← phi( main::@1/(byte*) main::sc#2 )
  *((byte*) main::sc#3) ← (byte) 'a'
  (byte*) main::sc#1 ← ++ (byte*) main::sc#3
  to:main::@1
main::@3: scope:[main]  from main::@1
  (byte*) main::cols#0 ← ((byte*)) (number) $d800
  (byte*~) main::$2 ← (byte*) main::cols#0 + (number) $3e7
  (byte*) main::cc#0 ← (byte*~) main::$2
  to:main::@7
main::@7: scope:[main]  from main::@3 main::@8
  (byte*) main::cc#2 ← phi( main::@3/(byte*) main::cc#0 main::@8/(byte*) main::cc#1 )
  (byte*~) main::$3 ← (byte*) main::cols#0 - (number) 1
  (bool~) main::$4 ← (byte*) main::cc#2 > (byte*~) main::$3
  if((bool~) main::$4) goto main::@8
  to:main::@return
main::@8: scope:[main]  from main::@7
  (byte*) main::cc#3 ← phi( main::@7/(byte*) main::cc#2 )
  *((byte*) main::cc#3) ← (number) 2
  (byte*) main::cc#1 ← -- (byte*) main::cc#3
  to:main::@7
main::@return: scope:[main]  from main::@7
  return 
  to:@return
@1: scope:[]  from @begin
  call main 
  to:@2
@2: scope:[]  from @1
  to:@end
@end: scope:[]  from @2

SYMBOL TABLE SSA
(label) @1
(label) @2
(label) @begin
(label) @end
(void()) main()
(byte*~) main::$0
(bool~) main::$1
(byte*~) main::$2
(byte*~) main::$3
(bool~) main::$4
(label) main::@1
(label) main::@2
(label) main::@3
(label) main::@7
(label) main::@8
(label) main::@return
(byte*) main::cc
(byte*) main::cc#0
(byte*) main::cc#1
(byte*) main::cc#2
(byte*) main::cc#3
(byte*) main::cols
(byte*) main::cols#0
(byte*) main::sc
(byte*) main::sc#0
(byte*) main::sc#1
(byte*) main::sc#2
(byte*) main::sc#3
(byte*) main::screen
(byte*) main::screen#0

Adding number conversion cast (unumber) $3e7 in (byte*~) main::$0 ← (byte*) main::screen#0 + (number) $3e7
Adding number conversion cast (unumber) $3e7 in (byte*~) main::$2 ← (byte*) main::cols#0 + (number) $3e7
Adding number conversion cast (unumber) 1 in (byte*~) main::$3 ← (byte*) main::cols#0 - (number) 1
Adding number conversion cast (unumber) 2 in *((byte*) main::cc#3) ← (number) 2
Successful SSA optimization PassNAddNumberTypeConversions
Inlining cast (byte*) main::screen#0 ← (byte*)(number) $400
Inlining cast (byte*) main::cols#0 ← (byte*)(number) $d800
Inlining cast *((byte*) main::cc#3) ← (unumber)(number) 2
Successful SSA optimization Pass2InlineCast
Simplifying constant pointer cast (byte*) 1024
Simplifying constant integer cast $3e7
Simplifying constant pointer cast (byte*) 55296
Simplifying constant integer cast $3e7
Simplifying constant integer cast 1
Simplifying constant integer cast 2
Successful SSA optimization PassNCastSimplification
Finalized unsigned number type (word) $3e7
Finalized unsigned number type (word) $3e7
Finalized unsigned number type (byte) 1
Finalized unsigned number type (byte) 2
Successful SSA optimization PassNFinalizeNumberTypeConversions
Alias (byte*) main::screen#0 = (byte*) main::sc#0 
Alias (byte*) main::sc#2 = (byte*) main::sc#3 
Alias (byte*) main::cc#0 = (byte*~) main::$2 
Alias (byte*) main::cc#2 = (byte*) main::cc#3 
Successful SSA optimization Pass2AliasElimination
Simple Condition (bool~) main::$1 [5] if((byte*) main::sc#2<=(byte*~) main::$0) goto main::@2
Simple Condition (bool~) main::$4 [15] if((byte*) main::cc#2>(byte*~) main::$3) goto main::@8
Successful SSA optimization Pass2ConditionalJumpSimplification
Constant (const byte*) main::screen#0 = (byte*) 1024
Constant (const byte*) main::cols#0 = (byte*) 55296
Successful SSA optimization Pass2ConstantIdentification
Constant right-side identified [1] (byte*~) main::$0 ← (const byte*) main::screen#0 + (word) $3e7
Constant right-side identified [5] (byte*) main::cc#0 ← (const byte*) main::cols#0 + (word) $3e7
Constant right-side identified [7] (byte*~) main::$3 ← (const byte*) main::cols#0 - (byte) 1
Successful SSA optimization Pass2ConstantRValueConsolidation
Constant (const byte*) main::$0 = main::screen#0+$3e7
Constant (const byte*) main::cc#0 = main::cols#0+$3e7
Constant (const byte*) main::$3 = main::cols#0-1
Successful SSA optimization Pass2ConstantIdentification
Successful SSA optimization Pass2LoopHeadConstantIdentification
Successful SSA optimization Pass2LoopHeadConstantIdentification
Alias (byte*) main::sc#1 = (byte*) main::sc#2 
Alias (byte*) main::cc#1 = (byte*) main::cc#2 
Successful SSA optimization Pass2AliasElimination
Identical Phi Values (byte*) main::sc#5 (const byte*) main::screen#0
Identical Phi Values (byte*) main::cc#5 (const byte*) main::cc#0
Successful SSA optimization Pass2IdenticalPhiElimination
if() condition always true - replacing block destination [15] if((const byte*) main::screen#0<=(const byte*) main::$0) goto main::@2
if() condition always true - replacing block destination [17] if((const byte*) main::cc#0>(const byte*) main::$3) goto main::@8
Successful SSA optimization Pass2ConstantIfs
Inlining constant with var siblings (const byte*) main::cc#0
Constant inlined main::$3 = (const byte*) main::cols#0-(byte) 1
Constant inlined main::cc#0 = (const byte*) main::cols#0+(word) $3e7
Constant inlined main::$0 = (const byte*) main::screen#0+(word) $3e7
Successful SSA optimization Pass2ConstantInlining
Added new block during phi lifting main::@13(between main::@1 and main::@2)
Added new block during phi lifting main::@14(between main::@7 and main::@8)
Adding NOP phi() at start of @begin
Adding NOP phi() at start of @1
Adding NOP phi() at start of @2
Adding NOP phi() at start of @end
Adding NOP phi() at start of main
Adding NOP phi() at start of main::@1_1
Adding NOP phi() at start of main::@3
Adding NOP phi() at start of main::@7_1
CALL GRAPH
Calls in [] to main:2 

Created 2 initial phi equivalence classes
Coalesced [18] main::cc#6 ← main::cc#1
Coalesced [19] main::sc#6 ← main::sc#1
Coalesced down to 2 phi equivalence classes
Culled Empty Block (label) @2
Culled Empty Block (label) main::@1_1
Culled Empty Block (label) main::@3
Culled Empty Block (label) main::@7_1
Culled Empty Block (label) main::@14
Culled Empty Block (label) main::@13
Renumbering block main::@7 to main::@3
Renumbering block main::@8 to main::@4
Adding NOP phi() at start of @begin
Adding NOP phi() at start of @1
Adding NOP phi() at start of @end
Adding NOP phi() at start of main

FINAL CONTROL FLOW GRAPH
@begin: scope:[]  from
  [0] phi()
  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] phi()
  to:main::@2
main::@2: scope:[main]  from main main::@1
  [5] (byte*) main::sc#4 ← phi( main::@1/(byte*) main::sc#1 main/(const byte*) main::screen#0 )
  [6] *((byte*) main::sc#4) ← (byte) 'a'
  [7] (byte*) main::sc#1 ← ++ (byte*) main::sc#4
  to:main::@1
main::@1: scope:[main]  from main::@2
  [8] if((byte*) main::sc#1<=(const byte*) main::screen#0+(word) $3e7) goto main::@2
  to:main::@4
main::@4: scope:[main]  from main::@1 main::@3
  [9] (byte*) main::cc#4 ← phi( main::@3/(byte*) main::cc#1 main::@1/(const byte*) main::cols#0+(word) $3e7 )
  [10] *((byte*) main::cc#4) ← (byte) 2
  [11] (byte*) main::cc#1 ← -- (byte*) main::cc#4
  to:main::@3
main::@3: scope:[main]  from main::@4
  [12] if((byte*) main::cc#1>(const byte*) main::cols#0-(byte) 1) goto main::@4
  to:main::@return
main::@return: scope:[main]  from main::@3
  [13] return 
  to:@return


VARIABLE REGISTER WEIGHTS
(void()) main()
(byte*) main::cc
(byte*) main::cc#1 16.5
(byte*) main::cc#4 16.5
(byte*) main::cols
(byte*) main::sc
(byte*) main::sc#1 16.5
(byte*) main::sc#4 16.5
(byte*) main::screen

Initial phi equivalence classes
[ main::sc#4 main::sc#1 ]
[ main::cc#4 main::cc#1 ]
Complete equivalence classes
[ main::sc#4 main::sc#1 ]
[ main::cc#4 main::cc#1 ]
Allocated zp ZP_WORD:2 [ main::sc#4 main::sc#1 ]
Allocated zp ZP_WORD:4 [ main::cc#4 main::cc#1 ]

INITIAL ASM
Target platform is c64basic
  // File Comments
// Test rewriting of constant comparisons for pointers
  // Upstart
.pc = $801 "Basic"
:BasicUpstart(bbegin)
.pc = $80d "Program"
  // Global Constants & labels
  // @begin
bbegin:
  // [1] phi from @begin to @1 [phi:@begin->@1]
b1_from_bbegin:
  jmp b1
  // @1
b1:
  // [2] call main 
  // [4] phi from @1 to main [phi:@1->main]
main_from_b1:
  jsr main
  // [3] phi from @1 to @end [phi:@1->@end]
bend_from_b1:
  jmp bend
  // @end
bend:
  // main
main: {
    .label screen = $400
    .label cols = $d800
    .label sc = 2
    .label cc = 4
    // [5] phi from main to main::@2 [phi:main->main::@2]
  b2_from_main:
    // [5] phi (byte*) main::sc#4 = (const byte*) main::screen#0 [phi:main->main::@2#0] -- pbuz1=pbuc1 
    lda #<screen
    sta.z sc
    lda #>screen
    sta.z sc+1
    jmp b2
    // [5] phi from main::@1 to main::@2 [phi:main::@1->main::@2]
  b2_from_b1:
    // [5] phi (byte*) main::sc#4 = (byte*) main::sc#1 [phi:main::@1->main::@2#0] -- register_copy 
    jmp b2
    // main::@2
  b2:
    // [6] *((byte*) main::sc#4) ← (byte) 'a' -- _deref_pbuz1=vbuc1 
    lda #'a'
    ldy #0
    sta (sc),y
    // [7] (byte*) main::sc#1 ← ++ (byte*) main::sc#4 -- pbuz1=_inc_pbuz1 
    inc.z sc
    bne !+
    inc.z sc+1
  !:
    jmp b1
    // main::@1
  b1:
    // [8] if((byte*) main::sc#1<=(const byte*) main::screen#0+(word) $3e7) goto main::@2 -- pbuz1_le_pbuc1_then_la1 
    lda.z sc+1
    cmp #>screen+$3e7
    bne !+
    lda.z sc
    cmp #<screen+$3e7
  !:
    bcc b2_from_b1
    beq b2_from_b1
    // [9] phi from main::@1 to main::@4 [phi:main::@1->main::@4]
  b4_from_b1:
    // [9] phi (byte*) main::cc#4 = (const byte*) main::cols#0+(word) $3e7 [phi:main::@1->main::@4#0] -- pbuz1=pbuc1 
    lda #<cols+$3e7
    sta.z cc
    lda #>cols+$3e7
    sta.z cc+1
    jmp b4
    // [9] phi from main::@3 to main::@4 [phi:main::@3->main::@4]
  b4_from_b3:
    // [9] phi (byte*) main::cc#4 = (byte*) main::cc#1 [phi:main::@3->main::@4#0] -- register_copy 
    jmp b4
    // main::@4
  b4:
    // [10] *((byte*) main::cc#4) ← (byte) 2 -- _deref_pbuz1=vbuc1 
    lda #2
    ldy #0
    sta (cc),y
    // [11] (byte*) main::cc#1 ← -- (byte*) main::cc#4 -- pbuz1=_dec_pbuz1 
    lda.z cc
    bne !+
    dec.z cc+1
  !:
    dec.z cc
    jmp b3
    // main::@3
  b3:
    // [12] if((byte*) main::cc#1>(const byte*) main::cols#0-(byte) 1) goto main::@4 -- pbuz1_gt_pbuc1_then_la1 
    lda #>cols-1
    cmp.z cc+1
    bcc b4_from_b3
    bne !+
    lda #<cols-1
    cmp.z cc
    bcc b4_from_b3
  !:
    jmp breturn
    // main::@return
  breturn:
    // [13] return 
    rts
}
  // File Data

REGISTER UPLIFT POTENTIAL REGISTERS
Statement [6] *((byte*) main::sc#4) ← (byte) 'a' [ main::sc#4 ] ( main:2 [ main::sc#4 ] ) always clobbers reg byte a reg byte y 
Statement [8] if((byte*) main::sc#1<=(const byte*) main::screen#0+(word) $3e7) goto main::@2 [ main::sc#1 ] ( main:2 [ main::sc#1 ] ) always clobbers reg byte a 
Statement [10] *((byte*) main::cc#4) ← (byte) 2 [ main::cc#4 ] ( main:2 [ main::cc#4 ] ) always clobbers reg byte a reg byte y 
Statement [11] (byte*) main::cc#1 ← -- (byte*) main::cc#4 [ main::cc#1 ] ( main:2 [ main::cc#1 ] ) always clobbers reg byte a 
Statement [12] if((byte*) main::cc#1>(const byte*) main::cols#0-(byte) 1) goto main::@4 [ main::cc#1 ] ( main:2 [ main::cc#1 ] ) always clobbers reg byte a 
Potential registers zp ZP_WORD:2 [ main::sc#4 main::sc#1 ] : zp ZP_WORD:2 , 
Potential registers zp ZP_WORD:4 [ main::cc#4 main::cc#1 ] : zp ZP_WORD:4 , 

REGISTER UPLIFT SCOPES
Uplift Scope [main] 33: zp ZP_WORD:2 [ main::sc#4 main::sc#1 ] 33: zp ZP_WORD:4 [ main::cc#4 main::cc#1 ] 
Uplift Scope [] 

Uplifting [main] best 1258 combination zp ZP_WORD:2 [ main::sc#4 main::sc#1 ] zp ZP_WORD:4 [ main::cc#4 main::cc#1 ] 
Uplifting [] best 1258 combination 

ASSEMBLER BEFORE OPTIMIZATION
  // File Comments
// Test rewriting of constant comparisons for pointers
  // Upstart
.pc = $801 "Basic"
:BasicUpstart(bbegin)
.pc = $80d "Program"
  // Global Constants & labels
  // @begin
bbegin:
  // [1] phi from @begin to @1 [phi:@begin->@1]
b1_from_bbegin:
  jmp b1
  // @1
b1:
  // [2] call main 
  // [4] phi from @1 to main [phi:@1->main]
main_from_b1:
  jsr main
  // [3] phi from @1 to @end [phi:@1->@end]
bend_from_b1:
  jmp bend
  // @end
bend:
  // main
main: {
    .label screen = $400
    .label cols = $d800
    .label sc = 2
    .label cc = 4
    // [5] phi from main to main::@2 [phi:main->main::@2]
  b2_from_main:
    // [5] phi (byte*) main::sc#4 = (const byte*) main::screen#0 [phi:main->main::@2#0] -- pbuz1=pbuc1 
    lda #<screen
    sta.z sc
    lda #>screen
    sta.z sc+1
    jmp b2
    // [5] phi from main::@1 to main::@2 [phi:main::@1->main::@2]
  b2_from_b1:
    // [5] phi (byte*) main::sc#4 = (byte*) main::sc#1 [phi:main::@1->main::@2#0] -- register_copy 
    jmp b2
    // main::@2
  b2:
    // [6] *((byte*) main::sc#4) ← (byte) 'a' -- _deref_pbuz1=vbuc1 
    lda #'a'
    ldy #0
    sta (sc),y
    // [7] (byte*) main::sc#1 ← ++ (byte*) main::sc#4 -- pbuz1=_inc_pbuz1 
    inc.z sc
    bne !+
    inc.z sc+1
  !:
    jmp b1
    // main::@1
  b1:
    // [8] if((byte*) main::sc#1<=(const byte*) main::screen#0+(word) $3e7) goto main::@2 -- pbuz1_le_pbuc1_then_la1 
    lda.z sc+1
    cmp #>screen+$3e7
    bne !+
    lda.z sc
    cmp #<screen+$3e7
  !:
    bcc b2_from_b1
    beq b2_from_b1
    // [9] phi from main::@1 to main::@4 [phi:main::@1->main::@4]
  b4_from_b1:
    // [9] phi (byte*) main::cc#4 = (const byte*) main::cols#0+(word) $3e7 [phi:main::@1->main::@4#0] -- pbuz1=pbuc1 
    lda #<cols+$3e7
    sta.z cc
    lda #>cols+$3e7
    sta.z cc+1
    jmp b4
    // [9] phi from main::@3 to main::@4 [phi:main::@3->main::@4]
  b4_from_b3:
    // [9] phi (byte*) main::cc#4 = (byte*) main::cc#1 [phi:main::@3->main::@4#0] -- register_copy 
    jmp b4
    // main::@4
  b4:
    // [10] *((byte*) main::cc#4) ← (byte) 2 -- _deref_pbuz1=vbuc1 
    lda #2
    ldy #0
    sta (cc),y
    // [11] (byte*) main::cc#1 ← -- (byte*) main::cc#4 -- pbuz1=_dec_pbuz1 
    lda.z cc
    bne !+
    dec.z cc+1
  !:
    dec.z cc
    jmp b3
    // main::@3
  b3:
    // [12] if((byte*) main::cc#1>(const byte*) main::cols#0-(byte) 1) goto main::@4 -- pbuz1_gt_pbuc1_then_la1 
    lda #>cols-1
    cmp.z cc+1
    bcc b4_from_b3
    bne !+
    lda #<cols-1
    cmp.z cc
    bcc b4_from_b3
  !:
    jmp breturn
    // main::@return
  breturn:
    // [13] return 
    rts
}
  // File Data

ASSEMBLER OPTIMIZATIONS
Removing instruction jmp b1
Removing instruction jmp bend
Removing instruction jmp b2
Removing instruction jmp b1
Removing instruction jmp b4
Removing instruction jmp b3
Removing instruction jmp breturn
Succesful ASM optimization Pass5NextJumpElimination
Replacing label b2_from_b1 with b2
Replacing label b2_from_b1 with b2
Replacing label b4_from_b3 with b4
Replacing label b4_from_b3 with b4
Removing instruction b1_from_bbegin:
Removing instruction b1:
Removing instruction main_from_b1:
Removing instruction bend_from_b1:
Removing instruction b2_from_b1:
Removing instruction b4_from_b3:
Succesful ASM optimization Pass5RedundantLabelElimination
Removing instruction bend:
Removing instruction b2_from_main:
Removing instruction b1:
Removing instruction b4_from_b1:
Removing instruction b3:
Removing instruction breturn:
Succesful ASM optimization Pass5UnusedLabelElimination
Updating BasicUpstart to call main directly
Removing instruction jsr main
Succesful ASM optimization Pass5SkipBegin
Removing instruction jmp b2
Removing instruction jmp b4
Succesful ASM optimization Pass5NextJumpElimination
Removing instruction bbegin:
Succesful ASM optimization Pass5UnusedLabelElimination

FINAL SYMBOL TABLE
(label) @1
(label) @begin
(label) @end
(void()) main()
(label) main::@1
(label) main::@2
(label) main::@3
(label) main::@4
(label) main::@return
(byte*) main::cc
(byte*) main::cc#1 cc zp ZP_WORD:4 16.5
(byte*) main::cc#4 cc zp ZP_WORD:4 16.5
(byte*) main::cols
(const byte*) main::cols#0 cols = (byte*) 55296
(byte*) main::sc
(byte*) main::sc#1 sc zp ZP_WORD:2 16.5
(byte*) main::sc#4 sc zp ZP_WORD:2 16.5
(byte*) main::screen
(const byte*) main::screen#0 screen = (byte*) 1024

zp ZP_WORD:2 [ main::sc#4 main::sc#1 ]
zp ZP_WORD:4 [ main::cc#4 main::cc#1 ]


FINAL ASSEMBLER
Score: 1036

  // File Comments
// Test rewriting of constant comparisons for pointers
  // Upstart
.pc = $801 "Basic"
:BasicUpstart(main)
.pc = $80d "Program"
  // Global Constants & labels
  // @begin
  // [1] phi from @begin to @1 [phi:@begin->@1]
  // @1
  // [2] call main 
  // [4] phi from @1 to main [phi:@1->main]
  // [3] phi from @1 to @end [phi:@1->@end]
  // @end
  // main
main: {
    .label screen = $400
    .label cols = $d800
    .label sc = 2
    .label cc = 4
    // [5] phi from main to main::@2 [phi:main->main::@2]
    // [5] phi (byte*) main::sc#4 = (const byte*) main::screen#0 [phi:main->main::@2#0] -- pbuz1=pbuc1 
    lda #<screen
    sta.z sc
    lda #>screen
    sta.z sc+1
    // [5] phi from main::@1 to main::@2 [phi:main::@1->main::@2]
    // [5] phi (byte*) main::sc#4 = (byte*) main::sc#1 [phi:main::@1->main::@2#0] -- register_copy 
    // main::@2
  b2:
    // *sc='a'
    // [6] *((byte*) main::sc#4) ← (byte) 'a' -- _deref_pbuz1=vbuc1 
    lda #'a'
    ldy #0
    sta (sc),y
    // for(byte* sc =screen;sc<=screen+999;sc++)
    // [7] (byte*) main::sc#1 ← ++ (byte*) main::sc#4 -- pbuz1=_inc_pbuz1 
    inc.z sc
    bne !+
    inc.z sc+1
  !:
    // main::@1
    // [8] if((byte*) main::sc#1<=(const byte*) main::screen#0+(word) $3e7) goto main::@2 -- pbuz1_le_pbuc1_then_la1 
    lda.z sc+1
    cmp #>screen+$3e7
    bne !+
    lda.z sc
    cmp #<screen+$3e7
  !:
    bcc b2
    beq b2
    // [9] phi from main::@1 to main::@4 [phi:main::@1->main::@4]
    // [9] phi (byte*) main::cc#4 = (const byte*) main::cols#0+(word) $3e7 [phi:main::@1->main::@4#0] -- pbuz1=pbuc1 
    lda #<cols+$3e7
    sta.z cc
    lda #>cols+$3e7
    sta.z cc+1
    // [9] phi from main::@3 to main::@4 [phi:main::@3->main::@4]
    // [9] phi (byte*) main::cc#4 = (byte*) main::cc#1 [phi:main::@3->main::@4#0] -- register_copy 
    // main::@4
  b4:
    // *cc=2
    // [10] *((byte*) main::cc#4) ← (byte) 2 -- _deref_pbuz1=vbuc1 
    lda #2
    ldy #0
    sta (cc),y
    // for(byte* cc =cols+999;cc>cols-1;cc--)
    // [11] (byte*) main::cc#1 ← -- (byte*) main::cc#4 -- pbuz1=_dec_pbuz1 
    lda.z cc
    bne !+
    dec.z cc+1
  !:
    dec.z cc
    // main::@3
    // [12] if((byte*) main::cc#1>(const byte*) main::cols#0-(byte) 1) goto main::@4 -- pbuz1_gt_pbuc1_then_la1 
    lda #>cols-1
    cmp.z cc+1
    bcc b4
    bne !+
    lda #<cols-1
    cmp.z cc
    bcc b4
  !:
    // main::@return
    // }
    // [13] return 
    rts
}
  // File Data

