1
0
mirror of https://gitlab.com/camelot/kickc.git synced 2024-07-03 20:29:34 +00:00

Added two tests for statement sequence locality.

This commit is contained in:
jespergravgaard 2019-06-03 22:26:21 +02:00
parent 9ad3879e52
commit d52fbcb6b6
11 changed files with 1198 additions and 0 deletions

View File

@ -36,6 +36,16 @@ public class TestPrograms {
}
@Test
public void testSequenceLocality1() throws IOException, URISyntaxException {
compileAndCompare("sequence-locality-1");
}
@Test
public void testSequenceLocality0() throws IOException, URISyntaxException {
compileAndCompare("sequence-locality-0");
}
@Test
public void testConditionInteger4() throws IOException, URISyntaxException {
compileAndCompare("condition-integer-4");

View File

@ -0,0 +1,17 @@
// Tests statement sequence locality of if(cond) { stmt1; } else { stmt2; }
void main() {
const byte* screen = 0x0400;
byte idx = 0;
for(byte i: 0..10) {
if(i>5) {
screen[idx++] = i;
} else {
screen[idx++] = i-5;
}
}
}

View File

@ -0,0 +1,17 @@
// Tests statement sequence locality of if(cond) { stmt1; } else { stmt2; }
void main() {
const byte* screen = 0x0400;
byte idx = 0;
for(byte i: 0..10) {
byte j=i;
if(i>5) {
j += i;
}
screen[idx++] = j;
}
}

View File

@ -0,0 +1,27 @@
// Tests statement sequence locality of if(cond) { stmt1; } else { stmt2; }
.pc = $801 "Basic"
:BasicUpstart(main)
.pc = $80d "Program"
main: {
.label screen = $400
ldy #0
ldx #0
b1:
cpx #5+1
bcs b2
txa
sec
sbc #5
sta screen,y
iny
b3:
inx
cpx #$b
bne b1
rts
b2:
txa
sta screen,y
iny
jmp b3
}

View File

@ -0,0 +1,34 @@
@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 main::@3
[5] (byte) main::idx#3 ← phi( main/(byte) 0 main::@3/(byte) main::idx#6 )
[5] (byte) main::i#2 ← phi( main/(byte) 0 main::@3/(byte) main::i#1 )
[6] if((byte) main::i#2>=(byte) 5+(byte) 1) goto main::@2
to:main::@4
main::@4: scope:[main] from main::@1
[7] (byte~) main::$1 ← (byte) main::i#2 - (byte) 5
[8] *((const byte*) main::screen#0 + (byte) main::idx#3) ← (byte~) main::$1
[9] (byte) main::idx#2 ← ++ (byte) main::idx#3
to:main::@3
main::@3: scope:[main] from main::@2 main::@4
[10] (byte) main::idx#6 ← phi( main::@2/(byte) main::idx#1 main::@4/(byte) main::idx#2 )
[11] (byte) main::i#1 ← ++ (byte) main::i#2
[12] if((byte) main::i#1!=(byte) $b) goto main::@1
to:main::@return
main::@return: scope:[main] from main::@3
[13] return
to:@return
main::@2: scope:[main] from main::@1
[14] *((const byte*) main::screen#0 + (byte) main::idx#3) ← (byte) main::i#2
[15] (byte) main::idx#1 ← ++ (byte) main::idx#3
to:main::@3

View File

@ -0,0 +1,521 @@
Adding pointer type conversion cast (byte*) main::screen in (byte*) main::screen ← (number) $400
Culled Empty Block (label) main::@5
Culled Empty Block (label) main::@6
CONTROL FLOW GRAPH SSA
@begin: scope:[] from
to:@1
main: scope:[main] from @1
(byte*) main::screen#0 ← ((byte*)) (number) $400
(byte) main::idx#0 ← (number) 0
(byte) main::i#0 ← (byte) 0
to:main::@1
main::@1: scope:[main] from main main::@3
(byte) main::idx#5 ← phi( main/(byte) main::idx#0 main::@3/(byte) main::idx#6 )
(byte) main::i#2 ← phi( main/(byte) main::i#0 main::@3/(byte) main::i#1 )
(bool~) main::$0 ← (byte) main::i#2 > (number) 5
if((bool~) main::$0) goto main::@2
to:main::@4
main::@2: scope:[main] from main::@1
(byte) main::idx#3 ← phi( main::@1/(byte) main::idx#5 )
(byte) main::i#3 ← phi( main::@1/(byte) main::i#2 )
*((byte*) main::screen#0 + (byte) main::idx#3) ← (byte) main::i#3
(byte) main::idx#1 ← ++ (byte) main::idx#3
to:main::@3
main::@4: scope:[main] from main::@1
(byte) main::idx#4 ← phi( main::@1/(byte) main::idx#5 )
(byte) main::i#4 ← phi( main::@1/(byte) main::i#2 )
(number~) main::$1 ← (byte) main::i#4 - (number) 5
*((byte*) main::screen#0 + (byte) main::idx#4) ← (number~) main::$1
(byte) main::idx#2 ← ++ (byte) main::idx#4
to:main::@3
main::@3: scope:[main] from main::@2 main::@4
(byte) main::idx#6 ← phi( main::@2/(byte) main::idx#1 main::@4/(byte) main::idx#2 )
(byte) main::i#5 ← phi( main::@2/(byte) main::i#3 main::@4/(byte) main::i#4 )
(byte) main::i#1 ← (byte) main::i#5 + rangenext(0,$a)
(bool~) main::$2 ← (byte) main::i#1 != rangelast(0,$a)
if((bool~) main::$2) goto main::@1
to:main::@return
main::@return: scope:[main] from 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
(number~) main::$1
(bool~) main::$2
(label) main::@1
(label) main::@2
(label) main::@3
(label) main::@4
(label) main::@return
(byte) main::i
(byte) main::i#0
(byte) main::i#1
(byte) main::i#2
(byte) main::i#3
(byte) main::i#4
(byte) main::i#5
(byte) main::idx
(byte) main::idx#0
(byte) main::idx#1
(byte) main::idx#2
(byte) main::idx#3
(byte) main::idx#4
(byte) main::idx#5
(byte) main::idx#6
(byte*) main::screen
(byte*) main::screen#0
Adding number conversion cast (unumber) 0 in (byte) main::idx#0 ← (number) 0
Adding number conversion cast (unumber) 5 in (bool~) main::$0 ← (byte) main::i#2 > (number) 5
Adding number conversion cast (unumber) 5 in (number~) main::$1 ← (byte) main::i#4 - (number) 5
Adding number conversion cast (unumber) main::$1 in (number~) main::$1 ← (byte) main::i#4 - (unumber)(number) 5
Successful SSA optimization PassNAddNumberTypeConversions
Inlining cast (byte*) main::screen#0 ← (byte*)(number) $400
Inlining cast (byte) main::idx#0 ← (unumber)(number) 0
Successful SSA optimization Pass2InlineCast
Simplifying constant pointer cast (byte*) 1024
Simplifying constant integer cast 0
Simplifying constant integer cast 5
Simplifying constant integer cast 5
Successful SSA optimization PassNCastSimplification
Finalized unsigned number type (byte) 0
Finalized unsigned number type (byte) 5
Finalized unsigned number type (byte) 5
Successful SSA optimization PassNFinalizeNumberTypeConversions
Inferred type updated to byte in (unumber~) main::$1 ← (byte) main::i#4 - (byte) 5
Alias (byte) main::i#2 = (byte) main::i#3 (byte) main::i#4
Alias (byte) main::idx#3 = (byte) main::idx#5 (byte) main::idx#4
Successful SSA optimization Pass2AliasElimination
Alias (byte) main::i#2 = (byte) main::i#5
Successful SSA optimization Pass2AliasElimination
Simple Condition (bool~) main::$0 [5] if((byte) main::i#2>(byte) 5) goto main::@2
Simple Condition (bool~) main::$2 [16] if((byte) main::i#1!=rangelast(0,$a)) goto main::@1
Successful SSA optimization Pass2ConditionalJumpSimplification
Constant (const byte*) main::screen#0 = (byte*) 1024
Constant (const byte) main::idx#0 = 0
Constant (const byte) main::i#0 = 0
Successful SSA optimization Pass2ConstantIdentification
Resolved ranged next value [14] main::i#1 ← ++ main::i#2 to ++
Resolved ranged comparison value [16] if(main::i#1!=rangelast(0,$a)) goto main::@1 to (number) $b
Rewriting conditional comparison [5] if((byte) main::i#2>(byte) 5) goto main::@2
Adding number conversion cast (unumber) 5+1 in if((byte) main::i#2>=(byte) 5+(number) 1) goto main::@2
Adding number conversion cast (unumber) 1 in if((byte) main::i#2>=(unumber)(byte) 5+(number) 1) goto main::@2
Adding number conversion cast (unumber) $b in if((byte) main::i#1!=(number) $b) goto main::@1
Successful SSA optimization PassNAddNumberTypeConversions
Simplifying constant integer cast (byte) 5+(unumber)(number) 1
Simplifying constant integer cast 1
Simplifying constant integer cast $b
Successful SSA optimization PassNCastSimplification
Finalized unsigned number type (byte) 1
Finalized unsigned number type (byte) $b
Successful SSA optimization PassNFinalizeNumberTypeConversions
Inlining constant with var siblings (const byte) main::idx#0
Inlining constant with var siblings (const byte) main::i#0
Constant inlined main::i#0 = (byte) 0
Constant inlined main::idx#0 = (byte) 0
Successful SSA optimization Pass2ConstantInlining
Added new block during phi lifting main::@7(between main::@3 and main::@1)
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 3 initial phi equivalence classes
Coalesced [11] main::idx#9 ← main::idx#2
Coalesced [16] main::i#6 ← main::i#1
Coalesced [17] main::idx#7 ← main::idx#6
Coalesced [20] main::idx#8 ← main::idx#1
Coalesced down to 2 phi equivalence classes
Culled Empty Block (label) @2
Culled Empty Block (label) main::@7
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 main::@3
[5] (byte) main::idx#3 ← phi( main/(byte) 0 main::@3/(byte) main::idx#6 )
[5] (byte) main::i#2 ← phi( main/(byte) 0 main::@3/(byte) main::i#1 )
[6] if((byte) main::i#2>=(byte) 5+(byte) 1) goto main::@2
to:main::@4
main::@4: scope:[main] from main::@1
[7] (byte~) main::$1 ← (byte) main::i#2 - (byte) 5
[8] *((const byte*) main::screen#0 + (byte) main::idx#3) ← (byte~) main::$1
[9] (byte) main::idx#2 ← ++ (byte) main::idx#3
to:main::@3
main::@3: scope:[main] from main::@2 main::@4
[10] (byte) main::idx#6 ← phi( main::@2/(byte) main::idx#1 main::@4/(byte) main::idx#2 )
[11] (byte) main::i#1 ← ++ (byte) main::i#2
[12] if((byte) main::i#1!=(byte) $b) goto main::@1
to:main::@return
main::@return: scope:[main] from main::@3
[13] return
to:@return
main::@2: scope:[main] from main::@1
[14] *((const byte*) main::screen#0 + (byte) main::idx#3) ← (byte) main::i#2
[15] (byte) main::idx#1 ← ++ (byte) main::idx#3
to:main::@3
VARIABLE REGISTER WEIGHTS
(void()) main()
(byte~) main::$1 22.0
(byte) main::i
(byte) main::i#1 16.5
(byte) main::i#2 6.875
(byte) main::idx
(byte) main::idx#1 22.0
(byte) main::idx#2 22.0
(byte) main::idx#3 11.0
(byte) main::idx#6 11.0
(byte*) main::screen
Initial phi equivalence classes
[ main::i#2 main::i#1 ]
[ main::idx#3 main::idx#6 main::idx#1 main::idx#2 ]
Added variable main::$1 to zero page equivalence class [ main::$1 ]
Complete equivalence classes
[ main::i#2 main::i#1 ]
[ main::idx#3 main::idx#6 main::idx#1 main::idx#2 ]
[ main::$1 ]
Allocated zp ZP_BYTE:2 [ main::i#2 main::i#1 ]
Allocated zp ZP_BYTE:3 [ main::idx#3 main::idx#6 main::idx#1 main::idx#2 ]
Allocated zp ZP_BYTE:4 [ main::$1 ]
INITIAL ASM
//SEG0 File Comments
// Tests statement sequence locality of if(cond) { stmt1; } else { stmt2; }
//SEG1 Basic Upstart
.pc = $801 "Basic"
:BasicUpstart(bbegin)
.pc = $80d "Program"
//SEG2 Global Constants & labels
//SEG3 @begin
bbegin:
//SEG4 [1] phi from @begin to @1 [phi:@begin->@1]
b1_from_bbegin:
jmp b1
//SEG5 @1
b1:
//SEG6 [2] call main
//SEG7 [4] phi from @1 to main [phi:@1->main]
main_from_b1:
jsr main
//SEG8 [3] phi from @1 to @end [phi:@1->@end]
bend_from_b1:
jmp bend
//SEG9 @end
bend:
//SEG10 main
main: {
.label screen = $400
.label _1 = 4
.label idx = 3
.label i = 2
//SEG11 [5] phi from main to main::@1 [phi:main->main::@1]
b1_from_main:
//SEG12 [5] phi (byte) main::idx#3 = (byte) 0 [phi:main->main::@1#0] -- vbuz1=vbuc1
lda #0
sta idx
//SEG13 [5] phi (byte) main::i#2 = (byte) 0 [phi:main->main::@1#1] -- vbuz1=vbuc1
lda #0
sta i
jmp b1
//SEG14 [5] phi from main::@3 to main::@1 [phi:main::@3->main::@1]
b1_from_b3:
//SEG15 [5] phi (byte) main::idx#3 = (byte) main::idx#6 [phi:main::@3->main::@1#0] -- register_copy
//SEG16 [5] phi (byte) main::i#2 = (byte) main::i#1 [phi:main::@3->main::@1#1] -- register_copy
jmp b1
//SEG17 main::@1
b1:
//SEG18 [6] if((byte) main::i#2>=(byte) 5+(byte) 1) goto main::@2 -- vbuz1_ge_vbuc1_then_la1
lda i
cmp #5+1
bcs b2
jmp b4
//SEG19 main::@4
b4:
//SEG20 [7] (byte~) main::$1 ← (byte) main::i#2 - (byte) 5 -- vbuz1=vbuz2_minus_vbuc1
lax i
axs #5
stx _1
//SEG21 [8] *((const byte*) main::screen#0 + (byte) main::idx#3) ← (byte~) main::$1 -- pbuc1_derefidx_vbuz1=vbuz2
lda _1
ldy idx
sta screen,y
//SEG22 [9] (byte) main::idx#2 ← ++ (byte) main::idx#3 -- vbuz1=_inc_vbuz1
inc idx
//SEG23 [10] phi from main::@2 main::@4 to main::@3 [phi:main::@2/main::@4->main::@3]
b3_from_b2:
b3_from_b4:
//SEG24 [10] phi (byte) main::idx#6 = (byte) main::idx#1 [phi:main::@2/main::@4->main::@3#0] -- register_copy
jmp b3
//SEG25 main::@3
b3:
//SEG26 [11] (byte) main::i#1 ← ++ (byte) main::i#2 -- vbuz1=_inc_vbuz1
inc i
//SEG27 [12] if((byte) main::i#1!=(byte) $b) goto main::@1 -- vbuz1_neq_vbuc1_then_la1
lda #$b
cmp i
bne b1_from_b3
jmp breturn
//SEG28 main::@return
breturn:
//SEG29 [13] return
rts
//SEG30 main::@2
b2:
//SEG31 [14] *((const byte*) main::screen#0 + (byte) main::idx#3) ← (byte) main::i#2 -- pbuc1_derefidx_vbuz1=vbuz2
lda i
ldy idx
sta screen,y
//SEG32 [15] (byte) main::idx#1 ← ++ (byte) main::idx#3 -- vbuz1=_inc_vbuz1
inc idx
jmp b3_from_b2
}
REGISTER UPLIFT POTENTIAL REGISTERS
Potential registers zp ZP_BYTE:2 [ main::i#2 main::i#1 ] : zp ZP_BYTE:2 , reg byte a , reg byte x , reg byte y ,
Potential registers zp ZP_BYTE:3 [ main::idx#3 main::idx#6 main::idx#1 main::idx#2 ] : zp ZP_BYTE:3 , reg byte a , reg byte x , reg byte y ,
Potential registers zp ZP_BYTE:4 [ main::$1 ] : zp ZP_BYTE:4 , reg byte a , reg byte x , reg byte y ,
REGISTER UPLIFT SCOPES
Uplift Scope [main] 66: zp ZP_BYTE:3 [ main::idx#3 main::idx#6 main::idx#1 main::idx#2 ] 23.38: zp ZP_BYTE:2 [ main::i#2 main::i#1 ] 22: zp ZP_BYTE:4 [ main::$1 ]
Uplift Scope []
Uplifting [main] best 568 combination reg byte y [ main::idx#3 main::idx#6 main::idx#1 main::idx#2 ] reg byte x [ main::i#2 main::i#1 ] reg byte a [ main::$1 ]
Uplifting [] best 568 combination
ASSEMBLER BEFORE OPTIMIZATION
//SEG0 File Comments
// Tests statement sequence locality of if(cond) { stmt1; } else { stmt2; }
//SEG1 Basic Upstart
.pc = $801 "Basic"
:BasicUpstart(bbegin)
.pc = $80d "Program"
//SEG2 Global Constants & labels
//SEG3 @begin
bbegin:
//SEG4 [1] phi from @begin to @1 [phi:@begin->@1]
b1_from_bbegin:
jmp b1
//SEG5 @1
b1:
//SEG6 [2] call main
//SEG7 [4] phi from @1 to main [phi:@1->main]
main_from_b1:
jsr main
//SEG8 [3] phi from @1 to @end [phi:@1->@end]
bend_from_b1:
jmp bend
//SEG9 @end
bend:
//SEG10 main
main: {
.label screen = $400
//SEG11 [5] phi from main to main::@1 [phi:main->main::@1]
b1_from_main:
//SEG12 [5] phi (byte) main::idx#3 = (byte) 0 [phi:main->main::@1#0] -- vbuyy=vbuc1
ldy #0
//SEG13 [5] phi (byte) main::i#2 = (byte) 0 [phi:main->main::@1#1] -- vbuxx=vbuc1
ldx #0
jmp b1
//SEG14 [5] phi from main::@3 to main::@1 [phi:main::@3->main::@1]
b1_from_b3:
//SEG15 [5] phi (byte) main::idx#3 = (byte) main::idx#6 [phi:main::@3->main::@1#0] -- register_copy
//SEG16 [5] phi (byte) main::i#2 = (byte) main::i#1 [phi:main::@3->main::@1#1] -- register_copy
jmp b1
//SEG17 main::@1
b1:
//SEG18 [6] if((byte) main::i#2>=(byte) 5+(byte) 1) goto main::@2 -- vbuxx_ge_vbuc1_then_la1
cpx #5+1
bcs b2
jmp b4
//SEG19 main::@4
b4:
//SEG20 [7] (byte~) main::$1 ← (byte) main::i#2 - (byte) 5 -- vbuaa=vbuxx_minus_vbuc1
txa
sec
sbc #5
//SEG21 [8] *((const byte*) main::screen#0 + (byte) main::idx#3) ← (byte~) main::$1 -- pbuc1_derefidx_vbuyy=vbuaa
sta screen,y
//SEG22 [9] (byte) main::idx#2 ← ++ (byte) main::idx#3 -- vbuyy=_inc_vbuyy
iny
//SEG23 [10] phi from main::@2 main::@4 to main::@3 [phi:main::@2/main::@4->main::@3]
b3_from_b2:
b3_from_b4:
//SEG24 [10] phi (byte) main::idx#6 = (byte) main::idx#1 [phi:main::@2/main::@4->main::@3#0] -- register_copy
jmp b3
//SEG25 main::@3
b3:
//SEG26 [11] (byte) main::i#1 ← ++ (byte) main::i#2 -- vbuxx=_inc_vbuxx
inx
//SEG27 [12] if((byte) main::i#1!=(byte) $b) goto main::@1 -- vbuxx_neq_vbuc1_then_la1
cpx #$b
bne b1_from_b3
jmp breturn
//SEG28 main::@return
breturn:
//SEG29 [13] return
rts
//SEG30 main::@2
b2:
//SEG31 [14] *((const byte*) main::screen#0 + (byte) main::idx#3) ← (byte) main::i#2 -- pbuc1_derefidx_vbuyy=vbuxx
txa
sta screen,y
//SEG32 [15] (byte) main::idx#1 ← ++ (byte) main::idx#3 -- vbuyy=_inc_vbuyy
iny
jmp b3_from_b2
}
ASSEMBLER OPTIMIZATIONS
Removing instruction jmp b1
Removing instruction jmp bend
Removing instruction jmp b1
Removing instruction jmp b4
Removing instruction jmp b3
Removing instruction jmp breturn
Succesful ASM optimization Pass5NextJumpElimination
Replacing label b1_from_b3 with b1
Replacing label b3_from_b2 with b3
Removing instruction b1_from_bbegin:
Removing instruction b1:
Removing instruction main_from_b1:
Removing instruction bend_from_b1:
Removing instruction b1_from_b3:
Removing instruction b3_from_b2:
Removing instruction b3_from_b4:
Succesful ASM optimization Pass5RedundantLabelElimination
Removing instruction bend:
Removing instruction b1_from_main:
Removing instruction b4:
Removing instruction breturn:
Succesful ASM optimization Pass5UnusedLabelElimination
Updating BasicUpstart to call main directly
Removing instruction jsr main
Succesful ASM optimization Pass5SkipBegin
Removing instruction jmp b1
Succesful ASM optimization Pass5NextJumpElimination
Removing instruction bbegin:
Succesful ASM optimization Pass5UnusedLabelElimination
FINAL SYMBOL TABLE
(label) @1
(label) @begin
(label) @end
(void()) main()
(byte~) main::$1 reg byte a 22.0
(label) main::@1
(label) main::@2
(label) main::@3
(label) main::@4
(label) main::@return
(byte) main::i
(byte) main::i#1 reg byte x 16.5
(byte) main::i#2 reg byte x 6.875
(byte) main::idx
(byte) main::idx#1 reg byte y 22.0
(byte) main::idx#2 reg byte y 22.0
(byte) main::idx#3 reg byte y 11.0
(byte) main::idx#6 reg byte y 11.0
(byte*) main::screen
(const byte*) main::screen#0 screen = (byte*) 1024
reg byte x [ main::i#2 main::i#1 ]
reg byte y [ main::idx#3 main::idx#6 main::idx#1 main::idx#2 ]
reg byte a [ main::$1 ]
FINAL ASSEMBLER
Score: 406
//SEG0 File Comments
// Tests statement sequence locality of if(cond) { stmt1; } else { stmt2; }
//SEG1 Basic Upstart
.pc = $801 "Basic"
:BasicUpstart(main)
.pc = $80d "Program"
//SEG2 Global Constants & labels
//SEG3 @begin
//SEG4 [1] phi from @begin to @1 [phi:@begin->@1]
//SEG5 @1
//SEG6 [2] call main
//SEG7 [4] phi from @1 to main [phi:@1->main]
//SEG8 [3] phi from @1 to @end [phi:@1->@end]
//SEG9 @end
//SEG10 main
main: {
.label screen = $400
//SEG11 [5] phi from main to main::@1 [phi:main->main::@1]
//SEG12 [5] phi (byte) main::idx#3 = (byte) 0 [phi:main->main::@1#0] -- vbuyy=vbuc1
ldy #0
//SEG13 [5] phi (byte) main::i#2 = (byte) 0 [phi:main->main::@1#1] -- vbuxx=vbuc1
ldx #0
//SEG14 [5] phi from main::@3 to main::@1 [phi:main::@3->main::@1]
//SEG15 [5] phi (byte) main::idx#3 = (byte) main::idx#6 [phi:main::@3->main::@1#0] -- register_copy
//SEG16 [5] phi (byte) main::i#2 = (byte) main::i#1 [phi:main::@3->main::@1#1] -- register_copy
//SEG17 main::@1
b1:
//SEG18 [6] if((byte) main::i#2>=(byte) 5+(byte) 1) goto main::@2 -- vbuxx_ge_vbuc1_then_la1
cpx #5+1
bcs b2
//SEG19 main::@4
//SEG20 [7] (byte~) main::$1 ← (byte) main::i#2 - (byte) 5 -- vbuaa=vbuxx_minus_vbuc1
txa
sec
sbc #5
//SEG21 [8] *((const byte*) main::screen#0 + (byte) main::idx#3) ← (byte~) main::$1 -- pbuc1_derefidx_vbuyy=vbuaa
sta screen,y
//SEG22 [9] (byte) main::idx#2 ← ++ (byte) main::idx#3 -- vbuyy=_inc_vbuyy
iny
//SEG23 [10] phi from main::@2 main::@4 to main::@3 [phi:main::@2/main::@4->main::@3]
//SEG24 [10] phi (byte) main::idx#6 = (byte) main::idx#1 [phi:main::@2/main::@4->main::@3#0] -- register_copy
//SEG25 main::@3
b3:
//SEG26 [11] (byte) main::i#1 ← ++ (byte) main::i#2 -- vbuxx=_inc_vbuxx
inx
//SEG27 [12] if((byte) main::i#1!=(byte) $b) goto main::@1 -- vbuxx_neq_vbuc1_then_la1
cpx #$b
bne b1
//SEG28 main::@return
//SEG29 [13] return
rts
//SEG30 main::@2
b2:
//SEG31 [14] *((const byte*) main::screen#0 + (byte) main::idx#3) ← (byte) main::i#2 -- pbuc1_derefidx_vbuyy=vbuxx
txa
sta screen,y
//SEG32 [15] (byte) main::idx#1 ← ++ (byte) main::idx#3 -- vbuyy=_inc_vbuyy
iny
jmp b3
}

View File

@ -0,0 +1 @@
program

View File

@ -0,0 +1,24 @@
// Tests statement sequence locality of if(cond) { stmt1; } else { stmt2; }
.pc = $801 "Basic"
:BasicUpstart(main)
.pc = $80d "Program"
main: {
.label screen = $400
ldx #0
ldy #0
b1:
cpy #5+1
bcc b4
tya
asl
b2:
sta screen,x
inx
iny
cpy #$b
bne b1
rts
b4:
tya
jmp b2
}

View File

@ -0,0 +1,33 @@
@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 main::@2
[5] (byte) main::idx#2 ← phi( main/(byte) 0 main::@2/(byte) main::idx#1 )
[5] (byte) main::i#3 ← phi( main/(byte) 0 main::@2/(byte) main::i#1 )
[6] if((byte) main::i#3<(byte) 5+(byte) 1) goto main::@4
to:main::@3
main::@3: scope:[main] from main::@1
[7] (byte) main::j#1 ← (byte) main::i#3 + (byte) main::i#3
to:main::@2
main::@2: scope:[main] from main::@3 main::@4
[8] (byte) main::j#2 ← phi( main::@4/(byte~) main::j#4 main::@3/(byte) main::j#1 )
[9] *((const byte*) main::screen#0 + (byte) main::idx#2) ← (byte) main::j#2
[10] (byte) main::idx#1 ← ++ (byte) main::idx#2
[11] (byte) main::i#1 ← ++ (byte) main::i#3
[12] if((byte) main::i#1!=(byte) $b) goto main::@1
to:main::@return
main::@return: scope:[main] from main::@2
[13] return
to:@return
main::@4: scope:[main] from main::@1
[14] (byte~) main::j#4 ← (byte) main::i#3
to:main::@2

View File

@ -0,0 +1,513 @@
Adding pointer type conversion cast (byte*) main::screen in (byte*) main::screen ← (number) $400
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::idx#0 ← (number) 0
(byte) main::i#0 ← (byte) 0
to:main::@1
main::@1: scope:[main] from main main::@2
(byte) main::idx#3 ← phi( main/(byte) main::idx#0 main::@2/(byte) main::idx#1 )
(byte) main::i#2 ← phi( main/(byte) main::i#0 main::@2/(byte) main::i#1 )
(byte) main::j#0 ← (byte) main::i#2
(bool~) main::$0 ← (byte) main::i#2 > (number) 5
(bool~) main::$1 ← ! (bool~) main::$0
if((bool~) main::$1) goto main::@2
to:main::@3
main::@2: scope:[main] from main::@1 main::@3
(byte) main::i#3 ← phi( main::@1/(byte) main::i#2 main::@3/(byte) main::i#4 )
(byte) main::idx#2 ← phi( main::@1/(byte) main::idx#3 main::@3/(byte) main::idx#4 )
(byte) main::j#2 ← phi( main::@1/(byte) main::j#0 main::@3/(byte) main::j#1 )
*((byte*) main::screen#0 + (byte) main::idx#2) ← (byte) main::j#2
(byte) main::idx#1 ← ++ (byte) main::idx#2
(byte) main::i#1 ← (byte) main::i#3 + rangenext(0,$a)
(bool~) main::$2 ← (byte) main::i#1 != rangelast(0,$a)
if((bool~) main::$2) goto main::@1
to:main::@return
main::@3: scope:[main] from main::@1
(byte) main::idx#4 ← phi( main::@1/(byte) main::idx#3 )
(byte) main::i#4 ← phi( main::@1/(byte) main::i#2 )
(byte) main::j#3 ← phi( main::@1/(byte) main::j#0 )
(byte) main::j#1 ← (byte) main::j#3 + (byte) main::i#4
to:main::@2
main::@return: scope:[main] from main::@2
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
(bool~) main::$1
(bool~) main::$2
(label) main::@1
(label) main::@2
(label) main::@3
(label) main::@return
(byte) main::i
(byte) main::i#0
(byte) main::i#1
(byte) main::i#2
(byte) main::i#3
(byte) main::i#4
(byte) main::idx
(byte) main::idx#0
(byte) main::idx#1
(byte) main::idx#2
(byte) main::idx#3
(byte) main::idx#4
(byte) main::j
(byte) main::j#0
(byte) main::j#1
(byte) main::j#2
(byte) main::j#3
(byte*) main::screen
(byte*) main::screen#0
Adding number conversion cast (unumber) 0 in (byte) main::idx#0 ← (number) 0
Adding number conversion cast (unumber) 5 in (bool~) main::$0 ← (byte) main::i#2 > (number) 5
Successful SSA optimization PassNAddNumberTypeConversions
Inlining cast (byte*) main::screen#0 ← (byte*)(number) $400
Inlining cast (byte) main::idx#0 ← (unumber)(number) 0
Successful SSA optimization Pass2InlineCast
Simplifying constant pointer cast (byte*) 1024
Simplifying constant integer cast 0
Simplifying constant integer cast 5
Successful SSA optimization PassNCastSimplification
Finalized unsigned number type (byte) 0
Finalized unsigned number type (byte) 5
Successful SSA optimization PassNFinalizeNumberTypeConversions
Inversing boolean not [6] (bool~) main::$1 ← (byte) main::i#2 <= (byte) 5 from [5] (bool~) main::$0 ← (byte) main::i#2 > (byte) 5
Successful SSA optimization Pass2UnaryNotSimplification
Alias (byte) main::j#0 = (byte) main::i#2 (byte) main::j#3 (byte) main::i#4
Alias (byte) main::idx#3 = (byte) main::idx#4
Successful SSA optimization Pass2AliasElimination
Alias (byte) main::idx#2 = (byte) main::idx#3
Alias (byte) main::i#3 = (byte) main::j#0
Successful SSA optimization Pass2AliasElimination
Simple Condition (bool~) main::$1 [7] if((byte) main::i#3<=(byte) 5) goto main::@2
Simple Condition (bool~) main::$2 [13] if((byte) main::i#1!=rangelast(0,$a)) goto main::@1
Successful SSA optimization Pass2ConditionalJumpSimplification
Constant (const byte*) main::screen#0 = (byte*) 1024
Constant (const byte) main::idx#0 = 0
Constant (const byte) main::i#0 = 0
Successful SSA optimization Pass2ConstantIdentification
Resolved ranged next value [11] main::i#1 ← ++ main::i#3 to ++
Resolved ranged comparison value [13] if(main::i#1!=rangelast(0,$a)) goto main::@1 to (number) $b
Rewriting conditional comparison [7] if((byte) main::i#3<=(byte) 5) goto main::@2
Adding number conversion cast (unumber) 5+1 in if((byte) main::i#3<(byte) 5+(number) 1) goto main::@2
Adding number conversion cast (unumber) 1 in if((byte) main::i#3<(unumber)(byte) 5+(number) 1) goto main::@2
Adding number conversion cast (unumber) $b in if((byte) main::i#1!=(number) $b) goto main::@1
Successful SSA optimization PassNAddNumberTypeConversions
Simplifying constant integer cast (byte) 5+(unumber)(number) 1
Simplifying constant integer cast 1
Simplifying constant integer cast $b
Successful SSA optimization PassNCastSimplification
Finalized unsigned number type (byte) 1
Finalized unsigned number type (byte) $b
Successful SSA optimization PassNFinalizeNumberTypeConversions
Inlining constant with var siblings (const byte) main::idx#0
Inlining constant with var siblings (const byte) main::i#0
Constant inlined main::i#0 = (byte) 0
Constant inlined main::idx#0 = (byte) 0
Successful SSA optimization Pass2ConstantInlining
Added new block during phi lifting main::@5(between main::@2 and main::@1)
Added new block during phi lifting main::@6(between main::@1 and main::@2)
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 3 initial phi equivalence classes
Coalesced [9] main::j#5 ← main::j#1
Coalesced [16] main::i#5 ← main::i#1
Coalesced [17] main::idx#5 ← main::idx#1
Not coalescing [18] main::j#4 ← main::i#3
Coalesced down to 3 phi equivalence classes
Culled Empty Block (label) @2
Culled Empty Block (label) main::@5
Renumbering block main::@6 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::@1
main::@1: scope:[main] from main main::@2
[5] (byte) main::idx#2 ← phi( main/(byte) 0 main::@2/(byte) main::idx#1 )
[5] (byte) main::i#3 ← phi( main/(byte) 0 main::@2/(byte) main::i#1 )
[6] if((byte) main::i#3<(byte) 5+(byte) 1) goto main::@4
to:main::@3
main::@3: scope:[main] from main::@1
[7] (byte) main::j#1 ← (byte) main::i#3 + (byte) main::i#3
to:main::@2
main::@2: scope:[main] from main::@3 main::@4
[8] (byte) main::j#2 ← phi( main::@4/(byte~) main::j#4 main::@3/(byte) main::j#1 )
[9] *((const byte*) main::screen#0 + (byte) main::idx#2) ← (byte) main::j#2
[10] (byte) main::idx#1 ← ++ (byte) main::idx#2
[11] (byte) main::i#1 ← ++ (byte) main::i#3
[12] if((byte) main::i#1!=(byte) $b) goto main::@1
to:main::@return
main::@return: scope:[main] from main::@2
[13] return
to:@return
main::@4: scope:[main] from main::@1
[14] (byte~) main::j#4 ← (byte) main::i#3
to:main::@2
VARIABLE REGISTER WEIGHTS
(void()) main()
(byte) main::i
(byte) main::i#1 16.5
(byte) main::i#3 9.428571428571429
(byte) main::idx
(byte) main::idx#1 7.333333333333333
(byte) main::idx#2 5.5
(byte) main::j
(byte) main::j#1 22.0
(byte) main::j#2 33.0
(byte~) main::j#4 22.0
(byte*) main::screen
Initial phi equivalence classes
[ main::i#3 main::i#1 ]
[ main::idx#2 main::idx#1 ]
[ main::j#2 main::j#4 main::j#1 ]
Complete equivalence classes
[ main::i#3 main::i#1 ]
[ main::idx#2 main::idx#1 ]
[ main::j#2 main::j#4 main::j#1 ]
Allocated zp ZP_BYTE:2 [ main::i#3 main::i#1 ]
Allocated zp ZP_BYTE:3 [ main::idx#2 main::idx#1 ]
Allocated zp ZP_BYTE:4 [ main::j#2 main::j#4 main::j#1 ]
INITIAL ASM
//SEG0 File Comments
// Tests statement sequence locality of if(cond) { stmt1; } else { stmt2; }
//SEG1 Basic Upstart
.pc = $801 "Basic"
:BasicUpstart(bbegin)
.pc = $80d "Program"
//SEG2 Global Constants & labels
//SEG3 @begin
bbegin:
//SEG4 [1] phi from @begin to @1 [phi:@begin->@1]
b1_from_bbegin:
jmp b1
//SEG5 @1
b1:
//SEG6 [2] call main
//SEG7 [4] phi from @1 to main [phi:@1->main]
main_from_b1:
jsr main
//SEG8 [3] phi from @1 to @end [phi:@1->@end]
bend_from_b1:
jmp bend
//SEG9 @end
bend:
//SEG10 main
main: {
.label screen = $400
.label idx = 3
.label i = 2
.label j = 4
//SEG11 [5] phi from main to main::@1 [phi:main->main::@1]
b1_from_main:
//SEG12 [5] phi (byte) main::idx#2 = (byte) 0 [phi:main->main::@1#0] -- vbuz1=vbuc1
lda #0
sta idx
//SEG13 [5] phi (byte) main::i#3 = (byte) 0 [phi:main->main::@1#1] -- vbuz1=vbuc1
lda #0
sta i
jmp b1
//SEG14 [5] phi from main::@2 to main::@1 [phi:main::@2->main::@1]
b1_from_b2:
//SEG15 [5] phi (byte) main::idx#2 = (byte) main::idx#1 [phi:main::@2->main::@1#0] -- register_copy
//SEG16 [5] phi (byte) main::i#3 = (byte) main::i#1 [phi:main::@2->main::@1#1] -- register_copy
jmp b1
//SEG17 main::@1
b1:
//SEG18 [6] if((byte) main::i#3<(byte) 5+(byte) 1) goto main::@4 -- vbuz1_lt_vbuc1_then_la1
lda i
cmp #5+1
bcc b4
jmp b3
//SEG19 main::@3
b3:
//SEG20 [7] (byte) main::j#1 ← (byte) main::i#3 + (byte) main::i#3 -- vbuz1=vbuz2_plus_vbuz2
lda i
asl
sta j
//SEG21 [8] phi from main::@3 main::@4 to main::@2 [phi:main::@3/main::@4->main::@2]
b2_from_b3:
b2_from_b4:
//SEG22 [8] phi (byte) main::j#2 = (byte) main::j#1 [phi:main::@3/main::@4->main::@2#0] -- register_copy
jmp b2
//SEG23 main::@2
b2:
//SEG24 [9] *((const byte*) main::screen#0 + (byte) main::idx#2) ← (byte) main::j#2 -- pbuc1_derefidx_vbuz1=vbuz2
lda j
ldy idx
sta screen,y
//SEG25 [10] (byte) main::idx#1 ← ++ (byte) main::idx#2 -- vbuz1=_inc_vbuz1
inc idx
//SEG26 [11] (byte) main::i#1 ← ++ (byte) main::i#3 -- vbuz1=_inc_vbuz1
inc i
//SEG27 [12] if((byte) main::i#1!=(byte) $b) goto main::@1 -- vbuz1_neq_vbuc1_then_la1
lda #$b
cmp i
bne b1_from_b2
jmp breturn
//SEG28 main::@return
breturn:
//SEG29 [13] return
rts
//SEG30 main::@4
b4:
//SEG31 [14] (byte~) main::j#4 ← (byte) main::i#3 -- vbuz1=vbuz2
lda i
sta j
jmp b2_from_b4
}
REGISTER UPLIFT POTENTIAL REGISTERS
Statement [7] (byte) main::j#1 ← (byte) main::i#3 + (byte) main::i#3 [ main::i#3 main::idx#2 main::j#1 ] ( main:2 [ main::i#3 main::idx#2 main::j#1 ] ) always clobbers reg byte a
Removing always clobbered register reg byte a as potential for zp ZP_BYTE:2 [ main::i#3 main::i#1 ]
Removing always clobbered register reg byte a as potential for zp ZP_BYTE:3 [ main::idx#2 main::idx#1 ]
Statement [7] (byte) main::j#1 ← (byte) main::i#3 + (byte) main::i#3 [ main::i#3 main::idx#2 main::j#1 ] ( main:2 [ main::i#3 main::idx#2 main::j#1 ] ) always clobbers reg byte a
Potential registers zp ZP_BYTE:2 [ main::i#3 main::i#1 ] : zp ZP_BYTE:2 , reg byte x , reg byte y ,
Potential registers zp ZP_BYTE:3 [ main::idx#2 main::idx#1 ] : zp ZP_BYTE:3 , reg byte x , reg byte y ,
Potential registers zp ZP_BYTE:4 [ main::j#2 main::j#4 main::j#1 ] : zp ZP_BYTE:4 , reg byte a , reg byte x , reg byte y ,
REGISTER UPLIFT SCOPES
Uplift Scope [main] 77: zp ZP_BYTE:4 [ main::j#2 main::j#4 main::j#1 ] 25.93: zp ZP_BYTE:2 [ main::i#3 main::i#1 ] 12.83: zp ZP_BYTE:3 [ main::idx#2 main::idx#1 ]
Uplift Scope []
Uplifting [main] best 478 combination reg byte a [ main::j#2 main::j#4 main::j#1 ] reg byte y [ main::i#3 main::i#1 ] reg byte x [ main::idx#2 main::idx#1 ]
Uplifting [] best 478 combination
ASSEMBLER BEFORE OPTIMIZATION
//SEG0 File Comments
// Tests statement sequence locality of if(cond) { stmt1; } else { stmt2; }
//SEG1 Basic Upstart
.pc = $801 "Basic"
:BasicUpstart(bbegin)
.pc = $80d "Program"
//SEG2 Global Constants & labels
//SEG3 @begin
bbegin:
//SEG4 [1] phi from @begin to @1 [phi:@begin->@1]
b1_from_bbegin:
jmp b1
//SEG5 @1
b1:
//SEG6 [2] call main
//SEG7 [4] phi from @1 to main [phi:@1->main]
main_from_b1:
jsr main
//SEG8 [3] phi from @1 to @end [phi:@1->@end]
bend_from_b1:
jmp bend
//SEG9 @end
bend:
//SEG10 main
main: {
.label screen = $400
//SEG11 [5] phi from main to main::@1 [phi:main->main::@1]
b1_from_main:
//SEG12 [5] phi (byte) main::idx#2 = (byte) 0 [phi:main->main::@1#0] -- vbuxx=vbuc1
ldx #0
//SEG13 [5] phi (byte) main::i#3 = (byte) 0 [phi:main->main::@1#1] -- vbuyy=vbuc1
ldy #0
jmp b1
//SEG14 [5] phi from main::@2 to main::@1 [phi:main::@2->main::@1]
b1_from_b2:
//SEG15 [5] phi (byte) main::idx#2 = (byte) main::idx#1 [phi:main::@2->main::@1#0] -- register_copy
//SEG16 [5] phi (byte) main::i#3 = (byte) main::i#1 [phi:main::@2->main::@1#1] -- register_copy
jmp b1
//SEG17 main::@1
b1:
//SEG18 [6] if((byte) main::i#3<(byte) 5+(byte) 1) goto main::@4 -- vbuyy_lt_vbuc1_then_la1
cpy #5+1
bcc b4
jmp b3
//SEG19 main::@3
b3:
//SEG20 [7] (byte) main::j#1 ← (byte) main::i#3 + (byte) main::i#3 -- vbuaa=vbuyy_plus_vbuyy
tya
asl
//SEG21 [8] phi from main::@3 main::@4 to main::@2 [phi:main::@3/main::@4->main::@2]
b2_from_b3:
b2_from_b4:
//SEG22 [8] phi (byte) main::j#2 = (byte) main::j#1 [phi:main::@3/main::@4->main::@2#0] -- register_copy
jmp b2
//SEG23 main::@2
b2:
//SEG24 [9] *((const byte*) main::screen#0 + (byte) main::idx#2) ← (byte) main::j#2 -- pbuc1_derefidx_vbuxx=vbuaa
sta screen,x
//SEG25 [10] (byte) main::idx#1 ← ++ (byte) main::idx#2 -- vbuxx=_inc_vbuxx
inx
//SEG26 [11] (byte) main::i#1 ← ++ (byte) main::i#3 -- vbuyy=_inc_vbuyy
iny
//SEG27 [12] if((byte) main::i#1!=(byte) $b) goto main::@1 -- vbuyy_neq_vbuc1_then_la1
cpy #$b
bne b1_from_b2
jmp breturn
//SEG28 main::@return
breturn:
//SEG29 [13] return
rts
//SEG30 main::@4
b4:
//SEG31 [14] (byte~) main::j#4 ← (byte) main::i#3 -- vbuaa=vbuyy
tya
jmp b2_from_b4
}
ASSEMBLER OPTIMIZATIONS
Removing instruction jmp b1
Removing instruction jmp bend
Removing instruction jmp b1
Removing instruction jmp b3
Removing instruction jmp b2
Removing instruction jmp breturn
Succesful ASM optimization Pass5NextJumpElimination
Replacing label b1_from_b2 with b1
Replacing label b2_from_b4 with b2
Removing instruction b1_from_bbegin:
Removing instruction b1:
Removing instruction main_from_b1:
Removing instruction bend_from_b1:
Removing instruction b1_from_b2:
Removing instruction b2_from_b3:
Removing instruction b2_from_b4:
Succesful ASM optimization Pass5RedundantLabelElimination
Removing instruction bend:
Removing instruction b1_from_main:
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 b1
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::i
(byte) main::i#1 reg byte y 16.5
(byte) main::i#3 reg byte y 9.428571428571429
(byte) main::idx
(byte) main::idx#1 reg byte x 7.333333333333333
(byte) main::idx#2 reg byte x 5.5
(byte) main::j
(byte) main::j#1 reg byte a 22.0
(byte) main::j#2 reg byte a 33.0
(byte~) main::j#4 reg byte a 22.0
(byte*) main::screen
(const byte*) main::screen#0 screen = (byte*) 1024
reg byte y [ main::i#3 main::i#1 ]
reg byte x [ main::idx#2 main::idx#1 ]
reg byte a [ main::j#2 main::j#4 main::j#1 ]
FINAL ASSEMBLER
Score: 316
//SEG0 File Comments
// Tests statement sequence locality of if(cond) { stmt1; } else { stmt2; }
//SEG1 Basic Upstart
.pc = $801 "Basic"
:BasicUpstart(main)
.pc = $80d "Program"
//SEG2 Global Constants & labels
//SEG3 @begin
//SEG4 [1] phi from @begin to @1 [phi:@begin->@1]
//SEG5 @1
//SEG6 [2] call main
//SEG7 [4] phi from @1 to main [phi:@1->main]
//SEG8 [3] phi from @1 to @end [phi:@1->@end]
//SEG9 @end
//SEG10 main
main: {
.label screen = $400
//SEG11 [5] phi from main to main::@1 [phi:main->main::@1]
//SEG12 [5] phi (byte) main::idx#2 = (byte) 0 [phi:main->main::@1#0] -- vbuxx=vbuc1
ldx #0
//SEG13 [5] phi (byte) main::i#3 = (byte) 0 [phi:main->main::@1#1] -- vbuyy=vbuc1
ldy #0
//SEG14 [5] phi from main::@2 to main::@1 [phi:main::@2->main::@1]
//SEG15 [5] phi (byte) main::idx#2 = (byte) main::idx#1 [phi:main::@2->main::@1#0] -- register_copy
//SEG16 [5] phi (byte) main::i#3 = (byte) main::i#1 [phi:main::@2->main::@1#1] -- register_copy
//SEG17 main::@1
b1:
//SEG18 [6] if((byte) main::i#3<(byte) 5+(byte) 1) goto main::@4 -- vbuyy_lt_vbuc1_then_la1
cpy #5+1
bcc b4
//SEG19 main::@3
//SEG20 [7] (byte) main::j#1 ← (byte) main::i#3 + (byte) main::i#3 -- vbuaa=vbuyy_plus_vbuyy
tya
asl
//SEG21 [8] phi from main::@3 main::@4 to main::@2 [phi:main::@3/main::@4->main::@2]
//SEG22 [8] phi (byte) main::j#2 = (byte) main::j#1 [phi:main::@3/main::@4->main::@2#0] -- register_copy
//SEG23 main::@2
b2:
//SEG24 [9] *((const byte*) main::screen#0 + (byte) main::idx#2) ← (byte) main::j#2 -- pbuc1_derefidx_vbuxx=vbuaa
sta screen,x
//SEG25 [10] (byte) main::idx#1 ← ++ (byte) main::idx#2 -- vbuxx=_inc_vbuxx
inx
//SEG26 [11] (byte) main::i#1 ← ++ (byte) main::i#3 -- vbuyy=_inc_vbuyy
iny
//SEG27 [12] if((byte) main::i#1!=(byte) $b) goto main::@1 -- vbuyy_neq_vbuc1_then_la1
cpy #$b
bne b1
//SEG28 main::@return
//SEG29 [13] return
rts
//SEG30 main::@4
b4:
//SEG31 [14] (byte~) main::j#4 ← (byte) main::i#3 -- vbuaa=vbuyy
tya
jmp b2
}

View File

@ -0,0 +1 @@
program