mirror of
https://gitlab.com/camelot/kickc.git
synced 2024-06-29 09:29:31 +00:00
370 lines
11 KiB
Plaintext
370 lines
11 KiB
Plaintext
Culled Empty Block (label) main::@2
|
|
|
|
CONTROL FLOW GRAPH SSA
|
|
@begin: scope:[] from
|
|
to:@1
|
|
|
|
(void()) main()
|
|
main: scope:[main] from @1
|
|
(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 )
|
|
(number~) main::$0 ← (number) $ff - (byte) main::i#2
|
|
*((const byte*) table + (number~) main::$0) ← (number) 0
|
|
(byte) main::i#1 ← (byte) main::i#2 + rangenext(0,$80)
|
|
(bool~) main::$1 ← (byte) main::i#1 != rangelast(0,$80)
|
|
if((bool~) main::$1) goto main::@1
|
|
to:main::@return
|
|
main::@return: scope:[main] from main::@1
|
|
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()
|
|
(number~) main::$0
|
|
(bool~) main::$1
|
|
(label) main::@1
|
|
(label) main::@return
|
|
(byte) main::i
|
|
(byte) main::i#0
|
|
(byte) main::i#1
|
|
(byte) main::i#2
|
|
(const byte*) table[(number) $100] = { fill( $100, 0) }
|
|
|
|
Adding number conversion cast (unumber) $ff in (number~) main::$0 ← (number) $ff - (byte) main::i#2
|
|
Adding number conversion cast (unumber) main::$0 in (number~) main::$0 ← (unumber)(number) $ff - (byte) main::i#2
|
|
Adding number conversion cast (unumber) 0 in *((const byte*) table + (unumber~) main::$0) ← (number) 0
|
|
Successful SSA optimization PassNAddNumberTypeConversions
|
|
Inlining cast *((const byte*) table + (unumber~) main::$0) ← (unumber)(number) 0
|
|
Successful SSA optimization Pass2InlineCast
|
|
Simplifying constant integer cast $ff
|
|
Simplifying constant integer cast 0
|
|
Successful SSA optimization PassNCastSimplification
|
|
Finalized unsigned number type (byte) $ff
|
|
Finalized unsigned number type (byte) 0
|
|
Successful SSA optimization PassNFinalizeNumberTypeConversions
|
|
Inferred type updated to byte in (unumber~) main::$0 ← (byte) $ff - (byte) main::i#2
|
|
Simple Condition (bool~) main::$1 [6] if((byte) main::i#1!=rangelast(0,$80)) goto main::@1
|
|
Successful SSA optimization Pass2ConditionalJumpSimplification
|
|
Constant (const byte) main::i#0 = 0
|
|
Successful SSA optimization Pass2ConstantIdentification
|
|
Resolved ranged next value [4] main::i#1 ← ++ main::i#2 to ++
|
|
Resolved ranged comparison value [6] if(main::i#1!=rangelast(0,$80)) goto main::@1 to (number) $81
|
|
Adding number conversion cast (unumber) $81 in if((byte) main::i#1!=(number) $81) goto main::@1
|
|
Successful SSA optimization PassNAddNumberTypeConversions
|
|
Simplifying constant integer cast $81
|
|
Successful SSA optimization PassNCastSimplification
|
|
Finalized unsigned number type (byte) $81
|
|
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 @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 1 initial phi equivalence classes
|
|
Coalesced [12] 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 @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()
|
|
|
|
(void()) main()
|
|
main: scope:[main] from @1
|
|
[4] phi()
|
|
to:main::@1
|
|
main::@1: scope:[main] from main main::@1
|
|
[5] (byte) main::i#2 ← phi( main/(byte) 0 main::@1/(byte) main::i#1 )
|
|
[6] (byte~) main::$0 ← (byte) $ff - (byte) main::i#2
|
|
[7] *((const byte*) table + (byte~) main::$0) ← (byte) 0
|
|
[8] (byte) main::i#1 ← ++ (byte) main::i#2
|
|
[9] if((byte) main::i#1!=(byte) $81) goto main::@1
|
|
to:main::@return
|
|
main::@return: scope:[main] from main::@1
|
|
[10] return
|
|
to:@return
|
|
|
|
|
|
VARIABLE REGISTER WEIGHTS
|
|
(void()) main()
|
|
(byte~) main::$0 202.0
|
|
(byte) main::i
|
|
(byte) main::i#1 151.5
|
|
(byte) main::i#2 101.0
|
|
|
|
Initial phi equivalence classes
|
|
[ main::i#2 main::i#1 ]
|
|
Added variable main::$0 to live range equivalence class [ main::$0 ]
|
|
Complete equivalence classes
|
|
[ main::i#2 main::i#1 ]
|
|
[ main::$0 ]
|
|
Allocated zp[1]:2 [ main::i#2 main::i#1 ]
|
|
Allocated zp[1]:3 [ main::$0 ]
|
|
|
|
INITIAL ASM
|
|
Target platform is c64basic / MOS6502X
|
|
// File Comments
|
|
// java.lang.NullPointerException during Pass2TypeInference.java
|
|
// 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
|
|
// Initialize the mulf_sqr multiplication tables with f(x)=int(x*x/2) and g(x) = f(1-x)
|
|
main: {
|
|
.label __0 = 3
|
|
.label i = 2
|
|
// [5] phi from main to main::@1 [phi:main->main::@1]
|
|
__b1_from_main:
|
|
// [5] phi (byte) main::i#2 = (byte) 0 [phi:main->main::@1#0] -- vbuz1=vbuc1
|
|
lda #0
|
|
sta.z i
|
|
jmp __b1
|
|
// [5] phi from main::@1 to main::@1 [phi:main::@1->main::@1]
|
|
__b1_from___b1:
|
|
// [5] phi (byte) main::i#2 = (byte) main::i#1 [phi:main::@1->main::@1#0] -- register_copy
|
|
jmp __b1
|
|
// main::@1
|
|
__b1:
|
|
// [6] (byte~) main::$0 ← (byte) $ff - (byte) main::i#2 -- vbuz1=vbuc1_minus_vbuz2
|
|
lda #$ff
|
|
sec
|
|
sbc.z i
|
|
sta.z __0
|
|
// [7] *((const byte*) table + (byte~) main::$0) ← (byte) 0 -- pbuc1_derefidx_vbuz1=vbuc2
|
|
lda #0
|
|
ldy.z __0
|
|
sta table,y
|
|
// [8] (byte) main::i#1 ← ++ (byte) main::i#2 -- vbuz1=_inc_vbuz1
|
|
inc.z i
|
|
// [9] if((byte) main::i#1!=(byte) $81) goto main::@1 -- vbuz1_neq_vbuc1_then_la1
|
|
lda #$81
|
|
cmp.z i
|
|
bne __b1_from___b1
|
|
jmp __breturn
|
|
// main::@return
|
|
__breturn:
|
|
// [10] return
|
|
rts
|
|
}
|
|
// File Data
|
|
table: .fill $100, 0
|
|
|
|
REGISTER UPLIFT POTENTIAL REGISTERS
|
|
Statement [6] (byte~) main::$0 ← (byte) $ff - (byte) main::i#2 [ main::i#2 main::$0 ] ( main:2 [ main::i#2 main::$0 ] { } ) always clobbers reg byte a
|
|
Removing always clobbered register reg byte a as potential for zp[1]:2 [ main::i#2 main::i#1 ]
|
|
Statement [7] *((const byte*) table + (byte~) main::$0) ← (byte) 0 [ main::i#2 ] ( main:2 [ main::i#2 ] { } ) always clobbers reg byte a
|
|
Statement [6] (byte~) main::$0 ← (byte) $ff - (byte) main::i#2 [ main::i#2 main::$0 ] ( main:2 [ main::i#2 main::$0 ] { } ) always clobbers reg byte a
|
|
Statement [7] *((const byte*) table + (byte~) main::$0) ← (byte) 0 [ main::i#2 ] ( main:2 [ main::i#2 ] { } ) always clobbers reg byte a
|
|
Potential registers zp[1]:2 [ main::i#2 main::i#1 ] : zp[1]:2 , reg byte x , reg byte y ,
|
|
Potential registers zp[1]:3 [ main::$0 ] : zp[1]:3 , reg byte a , reg byte x , reg byte y ,
|
|
|
|
REGISTER UPLIFT SCOPES
|
|
Uplift Scope [main] 252.5: zp[1]:2 [ main::i#2 main::i#1 ] 202: zp[1]:3 [ main::$0 ]
|
|
Uplift Scope []
|
|
|
|
Uplifting [main] best 343 combination reg byte y [ main::i#2 main::i#1 ] reg byte x [ main::$0 ]
|
|
Uplifting [] best 343 combination
|
|
|
|
ASSEMBLER BEFORE OPTIMIZATION
|
|
// File Comments
|
|
// java.lang.NullPointerException during Pass2TypeInference.java
|
|
// 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
|
|
// Initialize the mulf_sqr multiplication tables with f(x)=int(x*x/2) and g(x) = f(1-x)
|
|
main: {
|
|
// [5] phi from main to main::@1 [phi:main->main::@1]
|
|
__b1_from_main:
|
|
// [5] phi (byte) main::i#2 = (byte) 0 [phi:main->main::@1#0] -- vbuyy=vbuc1
|
|
ldy #0
|
|
jmp __b1
|
|
// [5] phi from main::@1 to main::@1 [phi:main::@1->main::@1]
|
|
__b1_from___b1:
|
|
// [5] phi (byte) main::i#2 = (byte) main::i#1 [phi:main::@1->main::@1#0] -- register_copy
|
|
jmp __b1
|
|
// main::@1
|
|
__b1:
|
|
// [6] (byte~) main::$0 ← (byte) $ff - (byte) main::i#2 -- vbuxx=vbuc1_minus_vbuyy
|
|
tya
|
|
eor #$ff
|
|
tax
|
|
axs #-$ff-1
|
|
// [7] *((const byte*) table + (byte~) main::$0) ← (byte) 0 -- pbuc1_derefidx_vbuxx=vbuc2
|
|
lda #0
|
|
sta table,x
|
|
// [8] (byte) main::i#1 ← ++ (byte) main::i#2 -- vbuyy=_inc_vbuyy
|
|
iny
|
|
// [9] if((byte) main::i#1!=(byte) $81) goto main::@1 -- vbuyy_neq_vbuc1_then_la1
|
|
cpy #$81
|
|
bne __b1_from___b1
|
|
jmp __breturn
|
|
// main::@return
|
|
__breturn:
|
|
// [10] return
|
|
rts
|
|
}
|
|
// File Data
|
|
table: .fill $100, 0
|
|
|
|
ASSEMBLER OPTIMIZATIONS
|
|
Removing instruction jmp __b1
|
|
Removing instruction jmp __bend
|
|
Removing instruction jmp __b1
|
|
Removing instruction jmp __breturn
|
|
Succesful ASM optimization Pass5NextJumpElimination
|
|
Replacing label __b1_from___b1 with __b1
|
|
Removing instruction __b1_from___bbegin:
|
|
Removing instruction __b1:
|
|
Removing instruction main_from___b1:
|
|
Removing instruction __bend_from___b1:
|
|
Removing instruction __b1_from___b1:
|
|
Succesful ASM optimization Pass5RedundantLabelElimination
|
|
Removing instruction __bend:
|
|
Removing instruction __b1_from_main:
|
|
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::$0 reg byte x 202.0
|
|
(label) main::@1
|
|
(label) main::@return
|
|
(byte) main::i
|
|
(byte) main::i#1 reg byte y 151.5
|
|
(byte) main::i#2 reg byte y 101.0
|
|
(const byte*) table[(number) $100] = { fill( $100, 0) }
|
|
|
|
reg byte y [ main::i#2 main::i#1 ]
|
|
reg byte x [ main::$0 ]
|
|
|
|
|
|
FINAL ASSEMBLER
|
|
Score: 241
|
|
|
|
// File Comments
|
|
// java.lang.NullPointerException during Pass2TypeInference.java
|
|
// 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
|
|
// Initialize the mulf_sqr multiplication tables with f(x)=int(x*x/2) and g(x) = f(1-x)
|
|
main: {
|
|
// [5] phi from main to main::@1 [phi:main->main::@1]
|
|
// [5] phi (byte) main::i#2 = (byte) 0 [phi:main->main::@1#0] -- vbuyy=vbuc1
|
|
ldy #0
|
|
// [5] phi from main::@1 to main::@1 [phi:main::@1->main::@1]
|
|
// [5] phi (byte) main::i#2 = (byte) main::i#1 [phi:main::@1->main::@1#0] -- register_copy
|
|
// main::@1
|
|
__b1:
|
|
// 255-i
|
|
// [6] (byte~) main::$0 ← (byte) $ff - (byte) main::i#2 -- vbuxx=vbuc1_minus_vbuyy
|
|
tya
|
|
eor #$ff
|
|
tax
|
|
axs #-$ff-1
|
|
// table[255-i] = 0
|
|
// [7] *((const byte*) table + (byte~) main::$0) ← (byte) 0 -- pbuc1_derefidx_vbuxx=vbuc2
|
|
lda #0
|
|
sta table,x
|
|
// for( byte i:0..128)
|
|
// [8] (byte) main::i#1 ← ++ (byte) main::i#2 -- vbuyy=_inc_vbuyy
|
|
iny
|
|
// [9] if((byte) main::i#1!=(byte) $81) goto main::@1 -- vbuyy_neq_vbuc1_then_la1
|
|
cpy #$81
|
|
bne __b1
|
|
// main::@return
|
|
// }
|
|
// [10] return
|
|
rts
|
|
}
|
|
// File Data
|
|
table: .fill $100, 0
|
|
|