6502/kickc
1
0
Fork 0
mirror of https://gitlab.com/camelot/kickc.git synced 2024-09-09 08:54:40 +00:00
Code Issues Projects Releases Wiki Activity
239cfdb48e
kickc/src/test/ref/stack-relative-addressing.log

361 lines
8.0 KiB
Plaintext
Raw Blame History

CONTROL FLOW GRAPH SSA
@begin: scope:[] from
to:@1
(void()) main()
main: scope:[main] from @1
asm { lda#'1' pha lda#'2' pha lda#'3' pha }
call peek_stack
to:main::@1
main::@1: scope:[main] from main
asm { pla pla pla }
to:main::@return
main::@return: scope:[main] from main::@1
return
to:@return
(void()) peek_stack()
peek_stack: scope:[peek_stack] from main
asm { tsx ldaSTACK,x staSCREEN ldaSTACK+1,x staSCREEN+1 ldaSTACK+2,x staSCREEN+2 }
to:peek_stack::@return
peek_stack::@return: scope:[peek_stack] from peek_stack
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
(const nomodify byte*) SCREEN = (byte*)(number) $400
(const nomodify byte*) STACK = (byte*)(number) $103
(void()) main()
(label) main::@1
(label) main::@return
(void()) peek_stack()
(label) peek_stack::@return
Simplifying constant pointer cast (byte*) 259
Simplifying constant pointer cast (byte*) 1024
Successful SSA optimization PassNCastSimplification
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
CALL GRAPH
Calls in [] to main:2
Calls in [main] to peek_stack:6
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
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
asm { lda#'1' pha lda#'2' pha lda#'3' pha }
[5] call peek_stack
to:main::@1
main::@1: scope:[main] from main
asm { pla pla pla }
to:main::@return
main::@return: scope:[main] from main::@1
[7] return
to:@return
(void()) peek_stack()
peek_stack: scope:[peek_stack] from main
asm { tsx ldaSTACK,x staSCREEN ldaSTACK+1,x staSCREEN+1 ldaSTACK+2,x staSCREEN+2 }
to:peek_stack::@return
peek_stack::@return: scope:[peek_stack] from peek_stack
[9] return
to:@return
VARIABLE REGISTER WEIGHTS
(void()) main()
(void()) peek_stack()
Initial phi equivalence classes
Complete equivalence classes
INITIAL ASM
Target platform is c64basic / MOS6502X
// File Comments
// Test stack-relative addressing (for passing parameters through the stack)
// Upstart
.pc = $801 "Basic"
:BasicUpstart(main)
.pc = $80d "Program"
// Global Constants & labels
/** The hardware stack. The offset 3 is to skip the return address and the fact that the pointer is to the next free position. */
.label STACK = $103
/** The screen. */
.label SCREEN = $400
// @begin
__bbegin:
// [1] phi from @begin to @1 [phi:@begin->@1]
__b1_from___bbegin:
jmp __b1
// @1
__b1:
// [2] call main
jsr main
// [3] phi from @1 to @end [phi:@1->@end]
__bend_from___b1:
jmp __bend
// @end
__bend:
// main
main: {
// asm { lda#'1' pha lda#'2' pha lda#'3' pha }
// Push a few values to the stack
lda #'1'
pha
lda #'2'
pha
lda #'3'
pha
// [5] call peek_stack
// Then call a function
jsr peek_stack
jmp __b1
// main::@1
__b1:
// asm { pla pla pla }
// Clean up the stack
pla
pla
pla
jmp __breturn
// main::@return
__breturn:
// [7] return
rts
}
// peek_stack
// Peek values from the stack using stack-relative addressing
peek_stack: {
// asm { tsx ldaSTACK,x staSCREEN ldaSTACK+1,x staSCREEN+1 ldaSTACK+2,x staSCREEN+2 }
tsx
lda STACK,x
sta SCREEN
lda STACK+1,x
sta SCREEN+1
lda STACK+2,x
sta SCREEN+2
jmp __breturn
// peek_stack::@return
__breturn:
// [9] return
rts
}
// File Data
REGISTER UPLIFT POTENTIAL REGISTERS
Statement asm { lda#'1' pha lda#'2' pha lda#'3' pha } always clobbers reg byte a
Statement asm { pla pla pla } always clobbers reg byte a
Statement asm { tsx ldaSTACK,x staSCREEN ldaSTACK+1,x staSCREEN+1 ldaSTACK+2,x staSCREEN+2 } always clobbers reg byte a reg byte x
REGISTER UPLIFT SCOPES
Uplift Scope [main]
Uplift Scope [peek_stack]
Uplift Scope []
Uplifting [main] best 93 combination
Uplifting [peek_stack] best 93 combination
Uplifting [] best 93 combination
ASSEMBLER BEFORE OPTIMIZATION
// File Comments
// Test stack-relative addressing (for passing parameters through the stack)
// Upstart
.pc = $801 "Basic"
:BasicUpstart(main)
.pc = $80d "Program"
// Global Constants & labels
/** The hardware stack. The offset 3 is to skip the return address and the fact that the pointer is to the next free position. */
.label STACK = $103
/** The screen. */
.label SCREEN = $400
// @begin
__bbegin:
// [1] phi from @begin to @1 [phi:@begin->@1]
__b1_from___bbegin:
jmp __b1
// @1
__b1:
// [2] call main
jsr main
// [3] phi from @1 to @end [phi:@1->@end]
__bend_from___b1:
jmp __bend
// @end
__bend:
// main
main: {
// asm { lda#'1' pha lda#'2' pha lda#'3' pha }
// Push a few values to the stack
lda #'1'
pha
lda #'2'
pha
lda #'3'
pha
// [5] call peek_stack
// Then call a function
jsr peek_stack
jmp __b1
// main::@1
__b1:
// asm { pla pla pla }
// Clean up the stack
pla
pla
pla
jmp __breturn
// main::@return
__breturn:
// [7] return
rts
}
// peek_stack
// Peek values from the stack using stack-relative addressing
peek_stack: {
// asm { tsx ldaSTACK,x staSCREEN ldaSTACK+1,x staSCREEN+1 ldaSTACK+2,x staSCREEN+2 }
tsx
lda STACK,x
sta SCREEN
lda STACK+1,x
sta SCREEN+1
lda STACK+2,x
sta SCREEN+2
jmp __breturn
// peek_stack::@return
__breturn:
// [9] return
rts
}
// File Data
ASSEMBLER OPTIMIZATIONS
Removing instruction jmp __b1
Removing instruction jmp __bend
Removing instruction jmp __b1
Removing instruction jmp __breturn
Removing instruction jmp __breturn
Succesful ASM optimization Pass5NextJumpElimination
Removing instruction __b1_from___bbegin:
Removing instruction __b1:
Removing instruction __bend_from___b1:
Succesful ASM optimization Pass5RedundantLabelElimination
Removing instruction __bbegin:
Removing instruction __bend:
Removing instruction __b1:
Removing instruction __breturn:
Removing instruction __breturn:
Succesful ASM optimization Pass5UnusedLabelElimination
Removing instruction jsr main
Succesful ASM optimization Pass5SkipBegin
FINAL SYMBOL TABLE
(label) @1
(label) @begin
(label) @end
(const nomodify byte*) SCREEN = (byte*) 1024
(const nomodify byte*) STACK = (byte*) 259
(void()) main()
(label) main::@1
(label) main::@return
(void()) peek_stack()
(label) peek_stack::@return
FINAL ASSEMBLER
Score: 72
// File Comments
// Test stack-relative addressing (for passing parameters through the stack)
// Upstart
.pc = $801 "Basic"
:BasicUpstart(main)
.pc = $80d "Program"
// Global Constants & labels
/** The hardware stack. The offset 3 is to skip the return address and the fact that the pointer is to the next free position. */
.label STACK = $103
/** The screen. */
.label SCREEN = $400
// @begin
// [1] phi from @begin to @1 [phi:@begin->@1]
// @1
// [2] call main
// [3] phi from @1 to @end [phi:@1->@end]
// @end
// main
main: {
// asm
// asm { lda#'1' pha lda#'2' pha lda#'3' pha }
// Push a few values to the stack
lda #'1'
pha
lda #'2'
pha
lda #'3'
pha
// peek_stack()
// [5] call peek_stack
// Then call a function
jsr peek_stack
// main::@1
// asm
// asm { pla pla pla }
// Clean up the stack
pla
pla
pla
// main::@return
// }
// [7] return
rts
}
// peek_stack
// Peek values from the stack using stack-relative addressing
peek_stack: {
// asm
// asm { tsx ldaSTACK,x staSCREEN ldaSTACK+1,x staSCREEN+1 ldaSTACK+2,x staSCREEN+2 }
tsx
lda STACK,x
sta SCREEN
lda STACK+1,x
sta SCREEN+1
lda STACK+2,x
sta SCREEN+2
// peek_stack::@return
// }
// [9] return
rts
}
// File Data
Reference in New Issue View Git Blame Copy Permalink