kickc/src/test/ref/declared-memory-var-1.log

Setting inferred volatile on symbol affected by address-of (byte*~) $0 ← & (byte) idx
Culled Empty Block (label) main::@2
Adding memory variable constant pointer (const byte*) idx_ptr
Updating memory variable reference *((const byte*) idx_ptr)
Updating memory variable reference *((const byte*) idx_ptr)

CONTROL FLOW GRAPH SSA
@begin: scope:[]  from
  *((const byte*) idx_ptr) ← (byte) 0
  (byte*~) $0 ← & *((const byte*) idx_ptr)
  (byte*) idx_p#0 ← (byte*~) $0
  (byte*) SCREEN ← ((byte*)) (number) $400
  to:@1

(void()) main()
main: scope:[main]  from @1
  (byte*) idx_p#2 ← phi( @1/(byte*) idx_p#3 )
  (byte) main::i#0 ← (byte) 0
  to:main::@1
main::@1: scope:[main]  from main main::@1
  (byte) main::i#2 ← phi( main/(byte) main::i#0 main::@1/(byte) main::i#1 )
  (byte*) idx_p#1 ← phi( main/(byte*) idx_p#2 main::@1/(byte*) idx_p#1 )
  *((byte*) SCREEN + (byte) main::i#2) ← *((byte*) idx_p#1)
  *((byte*) idx_p#1) ← *((byte*) idx_p#1) + (byte) main::i#2
  (byte) main::i#1 ← (byte) main::i#2 + rangenext(0,5)
  (bool~) main::$0 ← (byte) main::i#1 != rangelast(0,5)
  if((bool~) main::$0) goto main::@1
  to:main::@return
main::@return: scope:[main]  from main::@1
  return 
  to:@return
@1: scope:[]  from @begin
  (byte*) idx_p#3 ← phi( @begin/(byte*) idx_p#0 )
  call main 
  to:@2
@2: scope:[]  from @1
  to:@end
@end: scope:[]  from @2

SYMBOL TABLE SSA
(byte*~) $0
(label) @1
(label) @2
(label) @begin
(label) @end
(byte*) SCREEN
(byte) idx memory
(byte*) idx_p
(byte*) idx_p#0
(byte*) idx_p#1
(byte*) idx_p#2
(byte*) idx_p#3
(const byte*) idx_ptr = &(byte) idx
(void()) main()
(bool~) main::$0
(label) main::@1
(label) main::@return
(byte) main::i
(byte) main::i#0
(byte) main::i#1
(byte) main::i#2

Inlining cast (byte*) SCREEN ← (byte*)(number) $400
Successful SSA optimization Pass2InlineCast
Simplifying constant pointer cast (byte*) 1024
Successful SSA optimization PassNCastSimplification
Alias (byte*) idx_p#0 = (byte*~) $0 (byte*) idx_p#3 
Successful SSA optimization Pass2AliasElimination
Identical Phi Values (byte*) idx_p#2 (byte*) idx_p#0
Identical Phi Values (byte*) idx_p#1 (byte*) idx_p#2
Successful SSA optimization Pass2IdenticalPhiElimination
Simple Condition (bool~) main::$0 [11] if((byte) main::i#1!=rangelast(0,5)) goto main::@1
Successful SSA optimization Pass2ConditionalJumpSimplification
Constant (const byte*) SCREEN = (byte*) 1024
Constant (const byte) main::i#0 = 0
Successful SSA optimization Pass2ConstantIdentification
Resolved ranged next value [9] main::i#1 ← ++ main::i#2 to ++
Resolved ranged comparison value [11] if(main::i#1!=rangelast(0,5)) goto main::@1 to (number) 6
Adding number conversion cast (unumber) 6 in if((byte) main::i#1!=(number) 6) goto main::@1
Successful SSA optimization PassNAddNumberTypeConversions
Simplifying constant integer cast 6
Successful SSA optimization PassNCastSimplification
Finalized unsigned number type (byte) 6
Successful SSA optimization PassNFinalizeNumberTypeConversions
Inlining constant with var siblings (const byte) main::i#0
Constant inlined main::i#0 = (byte) 0
Successful SSA optimization Pass2ConstantInlining
Added new block during phi lifting main::@3(between main::@1 and main::@1)
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
CALL GRAPH
Calls in [] to main:3 

Created 1 initial phi equivalence classes
Coalesced [13] main::i#3 ← main::i#1
Coalesced down to 1 phi equivalence classes
Culled Empty Block (label) @2
Culled Empty Block (label) main::@3
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] *((const byte*) idx_ptr) ← (byte) 0
  [1] (byte*) idx_p#0 ← & *((const byte*) idx_ptr)
  to:@1
@1: scope:[]  from @begin
  [2] phi()
  [3] call main 
  to:@end
@end: scope:[]  from @1
  [4] phi()

(void()) main()
main: scope:[main]  from @1
  [5] phi()
  to:main::@1
main::@1: scope:[main]  from main main::@1
  [6] (byte) main::i#2 ← phi( main/(byte) 0 main::@1/(byte) main::i#1 )
  [7] *((const byte*) SCREEN + (byte) main::i#2) ← *((byte*) idx_p#0)
  [8] *((byte*) idx_p#0) ← *((byte*) idx_p#0) + (byte) main::i#2
  [9] (byte) main::i#1 ← ++ (byte) main::i#2
  [10] if((byte) main::i#1!=(byte) 6) goto main::@1
  to:main::@return
main::@return: scope:[main]  from main::@1
  [11] return 
  to:@return


VARIABLE REGISTER WEIGHTS
(byte) idx memory
(byte*) idx_p
(byte*) idx_p#0 4.375
(void()) main()
(byte) main::i
(byte) main::i#1 16.5
(byte) main::i#2 14.666666666666666

Initial phi equivalence classes
[ main::i#2 main::i#1 ]
Added variable idx_p#0 to zero page equivalence class [ idx_p#0 ]
Complete equivalence classes
[ main::i#2 main::i#1 ]
[ idx_p#0 ]
Allocated zp ZP_BYTE:2 [ main::i#2 main::i#1 ]
Allocated zp ZP_WORD:3 [ idx_p#0 ]

INITIAL ASM
Target platform is c64basic / MOS6502X
  // File Comments
// Test declaring a variable as "memory", meaning it will be stored in memory and accessed through an implicit pointer (using load/store)
// Test a pointer to a memory variable
  // Upstart
.pc = $801 "Basic"
:BasicUpstart(__bbegin)
.pc = $80d "Program"
  // Global Constants & labels
  .label idx_ptr = idx
  .label SCREEN = $400
  .label idx_p = 3
  // @begin
__bbegin:
  // [0] *((const byte*) idx_ptr) ← (byte) 0 -- _deref_pbuc1=vbuc2 
  lda #0
  sta idx_ptr
  // [1] (byte*) idx_p#0 ← & *((const byte*) idx_ptr) -- pbuz1=_addr__deref_pbuc1 
  lda #<idx_ptr
  sta.z idx_p
  lda #>idx_ptr
  sta.z idx_p+1
  // [2] phi from @begin to @1 [phi:@begin->@1]
__b1_from___bbegin:
  jmp __b1
  // @1
__b1:
  // [3] call main 
  // [5] phi from @1 to main [phi:@1->main]
main_from___b1:
  jsr main
  // [4] phi from @1 to @end [phi:@1->@end]
__bend_from___b1:
  jmp __bend
  // @end
__bend:
  // main
main: {
    .label i = 2
    // [6] phi from main to main::@1 [phi:main->main::@1]
  __b1_from_main:
    // [6] phi (byte) main::i#2 = (byte) 0 [phi:main->main::@1#0] -- vbuz1=vbuc1 
    lda #0
    sta.z i
    jmp __b1
    // [6] phi from main::@1 to main::@1 [phi:main::@1->main::@1]
  __b1_from___b1:
    // [6] phi (byte) main::i#2 = (byte) main::i#1 [phi:main::@1->main::@1#0] -- register_copy 
    jmp __b1
    // main::@1
  __b1:
    // [7] *((const byte*) SCREEN + (byte) main::i#2) ← *((byte*) idx_p#0) -- pbuc1_derefidx_vbuz1=_deref_pbuz2 
    ldx.z i
    ldy #0
    lda (idx_p),y
    sta SCREEN,x
    // [8] *((byte*) idx_p#0) ← *((byte*) idx_p#0) + (byte) main::i#2 -- _deref_pbuz1=_deref_pbuz1_plus_vbuz2 
    lda.z i
    clc
    ldy #0
    adc (idx_p),y
    ldy #0
    sta (idx_p),y
    // [9] (byte) main::i#1 ← ++ (byte) main::i#2 -- vbuz1=_inc_vbuz1 
    inc.z i
    // [10] if((byte) main::i#1!=(byte) 6) goto main::@1 -- vbuz1_neq_vbuc1_then_la1 
    lda #6
    cmp.z i
    bne __b1_from___b1
    jmp __breturn
    // main::@return
  __breturn:
    // [11] return 
    rts
}
  // File Data
  idx: .byte 0

REGISTER UPLIFT POTENTIAL REGISTERS
Statement [0] *((const byte*) idx_ptr) ← (byte) 0 [ ] (  [ ] ) always clobbers reg byte a 
Statement [1] (byte*) idx_p#0 ← & *((const byte*) idx_ptr) [ idx_p#0 ] (  [ idx_p#0 ] ) always clobbers reg byte a 
Statement [7] *((const byte*) SCREEN + (byte) main::i#2) ← *((byte*) idx_p#0) [ idx_p#0 main::i#2 ] ( main:3 [ idx_p#0 main::i#2 ] ) always clobbers reg byte a reg byte y 
Removing always clobbered register reg byte a as potential for zp ZP_BYTE:2 [ main::i#2 main::i#1 ]
Removing always clobbered register reg byte y as potential for zp ZP_BYTE:2 [ main::i#2 main::i#1 ]
Statement [8] *((byte*) idx_p#0) ← *((byte*) idx_p#0) + (byte) main::i#2 [ idx_p#0 main::i#2 ] ( main:3 [ idx_p#0 main::i#2 ] ) always clobbers reg byte a reg byte y 
Statement [0] *((const byte*) idx_ptr) ← (byte) 0 [ ] (  [ ] ) always clobbers reg byte a 
Statement [1] (byte*) idx_p#0 ← & *((const byte*) idx_ptr) [ idx_p#0 ] (  [ idx_p#0 ] ) always clobbers reg byte a 
Statement [7] *((const byte*) SCREEN + (byte) main::i#2) ← *((byte*) idx_p#0) [ idx_p#0 main::i#2 ] ( main:3 [ idx_p#0 main::i#2 ] ) always clobbers reg byte a reg byte y 
Statement [8] *((byte*) idx_p#0) ← *((byte*) idx_p#0) + (byte) main::i#2 [ idx_p#0 main::i#2 ] ( main:3 [ idx_p#0 main::i#2 ] ) always clobbers reg byte a reg byte y 
Potential registers zp ZP_BYTE:2 [ main::i#2 main::i#1 ] : zp ZP_BYTE:2 , reg byte x , 
Potential registers zp ZP_WORD:3 [ idx_p#0 ] : zp ZP_WORD:3 , 

REGISTER UPLIFT SCOPES
Uplift Scope [main] 31.17: zp ZP_BYTE:2 [ main::i#2 main::i#1 ] 
Uplift Scope [] 4.38: zp ZP_WORD:3 [ idx_p#0 ] 

Uplifting [main] best 529 combination reg byte x [ main::i#2 main::i#1 ] 
Uplifting [] best 529 combination zp ZP_WORD:3 [ idx_p#0 ] 
Allocated (was zp ZP_WORD:3) zp ZP_WORD:2 [ idx_p#0 ]

ASSEMBLER BEFORE OPTIMIZATION
  // File Comments
// Test declaring a variable as "memory", meaning it will be stored in memory and accessed through an implicit pointer (using load/store)
// Test a pointer to a memory variable
  // Upstart
.pc = $801 "Basic"
:BasicUpstart(__bbegin)
.pc = $80d "Program"
  // Global Constants & labels
  .label idx_ptr = idx
  .label SCREEN = $400
  .label idx_p = 2
  // @begin
__bbegin:
  // [0] *((const byte*) idx_ptr) ← (byte) 0 -- _deref_pbuc1=vbuc2 
  lda #0
  sta idx_ptr
  // [1] (byte*) idx_p#0 ← & *((const byte*) idx_ptr) -- pbuz1=_addr__deref_pbuc1 
  lda #<idx_ptr
  sta.z idx_p
  lda #>idx_ptr
  sta.z idx_p+1
  // [2] phi from @begin to @1 [phi:@begin->@1]
__b1_from___bbegin:
  jmp __b1
  // @1
__b1:
  // [3] call main 
  // [5] phi from @1 to main [phi:@1->main]
main_from___b1:
  jsr main
  // [4] phi from @1 to @end [phi:@1->@end]
__bend_from___b1:
  jmp __bend
  // @end
__bend:
  // main
main: {
    // [6] phi from main to main::@1 [phi:main->main::@1]
  __b1_from_main:
    // [6] phi (byte) main::i#2 = (byte) 0 [phi:main->main::@1#0] -- vbuxx=vbuc1 
    ldx #0
    jmp __b1
    // [6] phi from main::@1 to main::@1 [phi:main::@1->main::@1]
  __b1_from___b1:
    // [6] phi (byte) main::i#2 = (byte) main::i#1 [phi:main::@1->main::@1#0] -- register_copy 
    jmp __b1
    // main::@1
  __b1:
    // [7] *((const byte*) SCREEN + (byte) main::i#2) ← *((byte*) idx_p#0) -- pbuc1_derefidx_vbuxx=_deref_pbuz1 
    ldy #0
    lda (idx_p),y
    sta SCREEN,x
    // [8] *((byte*) idx_p#0) ← *((byte*) idx_p#0) + (byte) main::i#2 -- _deref_pbuz1=_deref_pbuz1_plus_vbuxx 
    txa
    clc
    ldy #0
    adc (idx_p),y
    ldy #0
    sta (idx_p),y
    // [9] (byte) main::i#1 ← ++ (byte) main::i#2 -- vbuxx=_inc_vbuxx 
    inx
    // [10] if((byte) main::i#1!=(byte) 6) goto main::@1 -- vbuxx_neq_vbuc1_then_la1 
    cpx #6
    bne __b1_from___b1
    jmp __breturn
    // main::@return
  __breturn:
    // [11] return 
    rts
}
  // File Data
  idx: .byte 0

ASSEMBLER OPTIMIZATIONS
Removing instruction jmp __b1
Removing instruction jmp __bend
Removing instruction jmp __b1
Removing instruction jmp __breturn
Succesful ASM optimization Pass5NextJumpElimination
Removing instruction ldy #0
Removing instruction ldy #0
Succesful ASM optimization Pass5UnnecesaryLoadElimination
Replacing label __b1_from___b1 with __b1
Removing instruction __b1_from___bbegin:
Removing instruction main_from___b1:
Removing instruction __bend_from___b1:
Removing instruction __b1_from___b1:
Succesful ASM optimization Pass5RedundantLabelElimination
Removing instruction __b1:
Removing instruction __bend:
Removing instruction __b1_from_main:
Removing instruction __breturn:
Succesful ASM optimization Pass5UnusedLabelElimination
Adding RTS to root block 
Succesful ASM optimization Pass5AddMainRts
Removing instruction jmp __b1
Succesful ASM optimization Pass5NextJumpElimination

FINAL SYMBOL TABLE
(label) @1
(label) @begin
(label) @end
(const byte*) SCREEN SCREEN = (byte*) 1024
(byte) idx memory
(byte*) idx_p
(byte*) idx_p#0 idx_p zp ZP_WORD:2 4.375
(const byte*) idx_ptr idx_ptr = &(byte) idx
(void()) main()
(label) main::@1
(label) main::@return
(byte) main::i
(byte) main::i#1 reg byte x 16.5
(byte) main::i#2 reg byte x 14.666666666666666

reg byte x [ main::i#2 main::i#1 ]
zp ZP_WORD:2 [ idx_p#0 ]


FINAL ASSEMBLER
Score: 399

  // File Comments
// Test declaring a variable as "memory", meaning it will be stored in memory and accessed through an implicit pointer (using load/store)
// Test a pointer to a memory variable
  // Upstart
.pc = $801 "Basic"
:BasicUpstart(__bbegin)
.pc = $80d "Program"
  // Global Constants & labels
  .label idx_ptr = idx
  .label SCREEN = $400
  .label idx_p = 2
  // @begin
__bbegin:
  // idx
  // [0] *((const byte*) idx_ptr) ← (byte) 0 -- _deref_pbuc1=vbuc2 
  lda #0
  sta idx_ptr
  // idx_p = &idx
  // [1] (byte*) idx_p#0 ← & *((const byte*) idx_ptr) -- pbuz1=_addr__deref_pbuc1 
  lda #<idx_ptr
  sta.z idx_p
  lda #>idx_ptr
  sta.z idx_p+1
  // [2] phi from @begin to @1 [phi:@begin->@1]
  // @1
  // [3] call main 
  // [5] phi from @1 to main [phi:@1->main]
  jsr main
  rts
  // [4] phi from @1 to @end [phi:@1->@end]
  // @end
  // main
main: {
    // [6] phi from main to main::@1 [phi:main->main::@1]
    // [6] phi (byte) main::i#2 = (byte) 0 [phi:main->main::@1#0] -- vbuxx=vbuc1 
    ldx #0
    // [6] phi from main::@1 to main::@1 [phi:main::@1->main::@1]
    // [6] phi (byte) main::i#2 = (byte) main::i#1 [phi:main::@1->main::@1#0] -- register_copy 
    // main::@1
  __b1:
    // SCREEN[i] = *idx_p
    // [7] *((const byte*) SCREEN + (byte) main::i#2) ← *((byte*) idx_p#0) -- pbuc1_derefidx_vbuxx=_deref_pbuz1 
    ldy #0
    lda (idx_p),y
    sta SCREEN,x
    // *idx_p +=i
    // [8] *((byte*) idx_p#0) ← *((byte*) idx_p#0) + (byte) main::i#2 -- _deref_pbuz1=_deref_pbuz1_plus_vbuxx 
    txa
    clc
    adc (idx_p),y
    sta (idx_p),y
    // for( char i: 0..5 )
    // [9] (byte) main::i#1 ← ++ (byte) main::i#2 -- vbuxx=_inc_vbuxx 
    inx
    // [10] if((byte) main::i#1!=(byte) 6) goto main::@1 -- vbuxx_neq_vbuc1_then_la1 
    cpx #6
    bne __b1
    // main::@return
    // }
    // [11] return 
    rts
}
  // File Data
  idx: .byte 0