Identified constant variable (byte*) main::screen
Identified constant variable (byte*) main::NULL
Identified constant variable (byte*) main::rem
Culled Empty Block (label) main::@2
Culled Empty Block (label) main::@4

CONTROL FLOW GRAPH SSA
@begin: scope:[]  from
  to:@1
main: scope:[main]  from @1
  (byte*) main::screen#0 ← ((byte*)) (number) $400
  (byte*) main::NULL#0 ← ((byte*)) (number) 0
  (byte*) main::rem#0 ← ((byte*)) (number) $ff
  (bool~) main::$0 ← (byte*) main::rem#0 != (byte*) main::NULL#0
  if((bool~) main::$0) goto main::@1
  to:main::@3
main::@1: scope:[main]  from main
  *((byte*) main::screen#0 + (number) 0) ← (byte) '*'
  to:main::@return
main::@3: scope:[main]  from main
  *((byte*) main::screen#0 + (number) 0) ← (byte) '.'
  to:main::@return
main::@return: scope:[main]  from main::@1 main::@3
  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()
(bool~) main::$0
(label) main::@1
(label) main::@3
(label) main::@return
(byte*) main::NULL
(byte*) main::NULL#0
(byte*) main::rem
(byte*) main::rem#0
(byte*) main::screen
(byte*) main::screen#0

Adding number conversion cast (unumber) 0 in *((byte*) main::screen#0 + (number) 0) ← (byte) '*'
Adding number conversion cast (unumber) 0 in *((byte*) main::screen#0 + (number) 0) ← (byte) '.'
Successful SSA optimization PassNAddNumberTypeConversions
Inlining cast (byte*) main::screen#0 ← (byte*)(number) $400
Inlining cast (byte*) main::NULL#0 ← (byte*)(number) 0
Inlining cast (byte*) main::rem#0 ← (byte*)(number) $ff
Successful SSA optimization Pass2InlineCast
Simplifying constant pointer cast (byte*) 1024
Simplifying constant pointer cast (byte*) 0
Simplifying constant pointer cast (byte*) 255
Simplifying constant integer cast 0
Simplifying constant integer cast 0
Successful SSA optimization PassNCastSimplification
Finalized unsigned number type (byte) 0
Finalized unsigned number type (byte) 0
Successful SSA optimization PassNFinalizeNumberTypeConversions
Simple Condition (bool~) main::$0 [4] if((byte*) main::rem#0!=(byte*) main::NULL#0) goto main::@1
Successful SSA optimization Pass2ConditionalJumpSimplification
Constant (const byte*) main::screen#0 = (byte*) 1024
Constant (const byte*) main::NULL#0 = (byte*) 0
Constant (const byte*) main::rem#0 = (byte*) 255
Successful SSA optimization Pass2ConstantIdentification
if() condition always true - replacing block destination [4] if((const byte*) main::rem#0!=(const byte*) main::NULL#0) goto main::@1
Successful SSA optimization Pass2ConstantIfs
Simplifying expression containing zero main::screen#0 in [5] *((const byte*) main::screen#0 + (byte) 0) ← (byte) '*'
Simplifying expression containing zero main::screen#0 in [6] *((const byte*) main::screen#0 + (byte) 0) ← (byte) '.'
Successful SSA optimization PassNSimplifyExpressionWithZero
Eliminating unused constant (const byte*) main::NULL#0
Eliminating unused constant (const byte*) main::rem#0
Successful SSA optimization PassNEliminateUnusedVars
Removing unused block main::@3
Successful SSA optimization Pass2EliminateUnusedBlocks
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
CALL GRAPH
Calls in [] to main:2 

Created 0 initial phi equivalence classes
Coalesced down to 0 phi equivalence classes
Culled Empty Block (label) @2
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::@1
main::@1: scope:[main]  from main
  [5] *((const byte*) main::screen#0) ← (byte) '*'
  to:main::@return
main::@return: scope:[main]  from main::@1
  [6] return 
  to:@return


VARIABLE REGISTER WEIGHTS
(void()) main()
(byte*) main::NULL
(byte*) main::rem
(byte*) main::screen

Initial phi equivalence classes
Complete equivalence classes

INITIAL ASM
  // File Comments
//Test that constant pointers are detected correctly
  // Basic 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
    jmp b1
    // main::@1
  b1:
    // [5] *((const byte*) main::screen#0) ← (byte) '*' -- _deref_pbuc1=vbuc2 
    lda #'*'
    sta screen
    jmp breturn
    // main::@return
  breturn:
    // [6] return 
    rts
}
  // File Data

REGISTER UPLIFT POTENTIAL REGISTERS
Statement [5] *((const byte*) main::screen#0) ← (byte) '*' [ ] ( main:2 [ ] ) always clobbers reg byte a 

REGISTER UPLIFT SCOPES
Uplift Scope [main] 
Uplift Scope [] 

Uplifting [main] best 57 combination 
Uplifting [] best 57 combination 

ASSEMBLER BEFORE OPTIMIZATION
  // File Comments
//Test that constant pointers are detected correctly
  // Basic 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
    jmp b1
    // main::@1
  b1:
    // [5] *((const byte*) main::screen#0) ← (byte) '*' -- _deref_pbuc1=vbuc2 
    lda #'*'
    sta screen
    jmp breturn
    // main::@return
  breturn:
    // [6] return 
    rts
}
  // File Data

ASSEMBLER OPTIMIZATIONS
Removing instruction jmp b1
Removing instruction jmp bend
Removing instruction jmp b1
Removing instruction jmp breturn
Succesful ASM optimization Pass5NextJumpElimination
Removing instruction b1_from_bbegin:
Removing instruction b1:
Removing instruction main_from_b1:
Removing instruction bend_from_b1:
Succesful ASM optimization Pass5RedundantLabelElimination
Removing instruction bend:
Removing instruction b1:
Removing instruction breturn:
Succesful ASM optimization Pass5UnusedLabelElimination
Updating BasicUpstart to call main directly
Removing instruction jsr main
Succesful ASM optimization Pass5SkipBegin
Removing instruction bbegin:
Succesful ASM optimization Pass5UnusedLabelElimination

FINAL SYMBOL TABLE
(label) @1
(label) @begin
(label) @end
(void()) main()
(label) main::@1
(label) main::@return
(byte*) main::NULL
(byte*) main::rem
(byte*) main::screen
(const byte*) main::screen#0 screen = (byte*) 1024



FINAL ASSEMBLER
Score: 12

  // File Comments
//Test that constant pointers are detected correctly
  // Basic 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
    // main::@1
    // screen[0] = '*'
    // [5] *((const byte*) main::screen#0) ← (byte) '*' -- _deref_pbuc1=vbuc2 
    lda #'*'
    sta screen
    // main::@return
    // }
    // [6] return 
    rts
}
  // File Data

