6502/kickc
1
0
Fork 0
mirror of https://gitlab.com/camelot/kickc.git synced 2024-10-21 17:24:39 +00:00
Code Issues Projects Releases Wiki Activity
036724c92d
kickc/src/test/ref/flipper-rex2.sym

80 lines
2.4 KiB
Plaintext
Raw Normal View History

Implemented block label renumbering ensuring generated ASM labels are slightly more sensible to the reader.
2019-03-31 15:10:41 +00:00
(label) @1
Improved ASM readability
2017-08-12 16:30:21 +00:00
(label) @begin
(label) @end
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
(byte*) RASTER
Improved number formatting of inegers in log/messages.
2019-03-08 05:54:45 +00:00
(const byte*) RASTER#0 RASTER = ((byte*))(word/dword/signed dword) $d012
Added array zero initializer and ASM .fill for arrays declared with a size but without initializer.
2017-12-27 22:53:51 +00:00
(byte*) SCREEN
Improved number formatting of inegers in log/messages.
2019-03-08 05:54:45 +00:00
(const byte*) SCREEN#0 SCREEN = ((byte*))(word/signed word/dword/signed dword) $400
(byte[$10*$10]) buffer1
(const byte[$10*$10]) buffer1#0 buffer1 = { fill( $10*$10, 0) }
(byte[$10*$10]) buffer2
(const byte[$10*$10]) buffer2#0 buffer2 = { fill( $10*$10, 0) }
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
(void()) flip()
(label) flip::@1
(label) flip::@2
(label) flip::@3
Implemented block label renumbering ensuring generated ASM labels are slightly more sensible to the reader.
2019-03-31 15:10:41 +00:00
(label) flip::@4
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
(label) flip::@return
(byte) flip::c
Fixed register coalesce issues (Double.MIN_VALUE is unexpectedly positive).
2018-02-13 03:23:44 +00:00
(byte) flip::c#1 c zp ZP_BYTE:5 1501.5
(byte) flip::c#2 c zp ZP_BYTE:5 500.5
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
(byte) flip::dstIdx
Assignments are now expressions. For-loops can now contain assignments in the increment part. LValue handling reimplemented (lvalue no longer exist in parser - only expression). RValues now also contains pointer derefs. Complex array expressions (SCREEN+$100)[i] now possible as LValues. ASM fragment generation improved to handle new more complex LValues & RValues. Closes #5. Closes #43
2017-12-26 16:24:30 +00:00
(byte) flip::dstIdx#1 reg byte x 701.0
(byte) flip::dstIdx#2 reg byte x 67.33333333333333
(byte) flip::dstIdx#3 reg byte x 1034.6666666666667
(byte) flip::dstIdx#5 reg byte x 202.0
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
(byte) flip::i
Implemented register uplift combination search. This yields near optimal register allocation - but at a calculation cost at O(4^N) where N is the number of live range equivalence classes in a scope.
2017-08-01 22:57:29 +00:00
(byte) flip::i#1 reg byte x 151.5
Assignments are now expressions. For-loops can now contain assignments in the increment part. LValue handling reimplemented (lvalue no longer exist in parser - only expression). RValues now also contains pointer derefs. Complex array expressions (SCREEN+$100)[i] now possible as LValues. ASM fragment generation improved to handle new more complex LValues & RValues. Closes #5. Closes #43
2017-12-26 16:24:30 +00:00
(byte) flip::i#2 reg byte x 202.0
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
(byte) flip::r
Fixed register coalesce issues (Double.MIN_VALUE is unexpectedly positive).
2018-02-13 03:23:44 +00:00
(byte) flip::r#1 r zp ZP_BYTE:4 151.5
(byte) flip::r#4 r zp ZP_BYTE:4 25.25
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
(byte) flip::srcIdx
Assignments are now expressions. For-loops can now contain assignments in the increment part. LValue handling reimplemented (lvalue no longer exist in parser - only expression). RValues now also contains pointer derefs. Complex array expressions (SCREEN+$100)[i] now possible as LValues. ASM fragment generation improved to handle new more complex LValues & RValues. Closes #5. Closes #43
2017-12-26 16:24:30 +00:00
(byte) flip::srcIdx#1 reg byte y 300.42857142857144
(byte) flip::srcIdx#2 reg byte y 1552.0
(byte) flip::srcIdx#3 reg byte y 202.0
Added main method to flipper. Fixed a few bugs in compiler.
2017-07-16 09:09:32 +00:00
(void()) main()
Implemented block label renumbering ensuring generated ASM labels are slightly more sensible to the reader.
2019-03-31 15:10:41 +00:00
(label) main::@1
(label) main::@2
Added main method to flipper. Fixed a few bugs in compiler.
2017-07-16 09:09:32 +00:00
(label) main::@3
Implemented block label renumbering ensuring generated ASM labels are slightly more sensible to the reader.
2019-03-31 15:10:41 +00:00
(label) main::@4
Implemented local scopes for blocks - enabling reuse of variable names (for instance in for loops). Closes #64
2019-03-29 23:15:53 +00:00
(label) main::@5
Added main method to flipper. Fixed a few bugs in compiler.
2017-07-16 09:09:32 +00:00
(byte) main::c
Implemented register uplift combination search. This yields near optimal register allocation - but at a calculation cost at O(4^N) where N is the number of live range equivalence classes in a scope.
2017-08-01 22:57:29 +00:00
(byte) main::c#1 reg byte x 151.5
Implemented more proper pointer handling by wrapping any unary *'s into PointerDerefs.
2017-11-12 23:47:05 +00:00
(byte) main::c#4 reg byte x 67.33333333333333
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
(void()) plot()
(label) plot::@1
(label) plot::@2
Better label naming when creating intermediate labels
2017-07-21 09:32:41 +00:00
(label) plot::@3
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
(label) plot::@return
(byte) plot::i
Implemented register uplift combination search. This yields near optimal register allocation - but at a calculation cost at O(4^N) where N is the number of live range equivalence classes in a scope.
2017-08-01 22:57:29 +00:00
(byte) plot::i#1 reg byte x 350.5
Assignments are now expressions. For-loops can now contain assignments in the increment part. LValue handling reimplemented (lvalue no longer exist in parser - only expression). RValues now also contains pointer derefs. Complex array expressions (SCREEN+$100)[i] now possible as LValues. ASM fragment generation improved to handle new more complex LValues & RValues. Closes #5. Closes #43
2017-12-26 16:24:30 +00:00
(byte) plot::i#2 reg byte x 1552.0
Implemented register uplift combination search. This yields near optimal register allocation - but at a calculation cost at O(4^N) where N is the number of live range equivalence classes in a scope.
2017-08-01 22:57:29 +00:00
(byte) plot::i#3 reg byte x 202.0
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
(byte*) plot::line
Last of fragment renaming completed (zpptrby1/zpptrsby1 => pbuz1/pbsz1)
2017-12-12 23:29:47 +00:00
(byte*) plot::line#1 line zp ZP_WORD:2 67.33333333333333
Assignments are now expressions. For-loops can now contain assignments in the increment part. LValue handling reimplemented (lvalue no longer exist in parser - only expression). RValues now also contains pointer derefs. Complex array expressions (SCREEN+$100)[i] now possible as LValues. ASM fragment generation improved to handle new more complex LValues & RValues. Closes #5. Closes #43
2017-12-26 16:24:30 +00:00
(byte*) plot::line#4 line zp ZP_WORD:2 200.50000000000003
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
(byte) plot::x
Implemented register uplift combination search. This yields near optimal register allocation - but at a calculation cost at O(4^N) where N is the number of live range equivalence classes in a scope.
2017-08-01 22:57:29 +00:00
(byte) plot::x#1 reg byte y 1501.5
Assignments are now expressions. For-loops can now contain assignments in the increment part. LValue handling reimplemented (lvalue no longer exist in parser - only expression). RValues now also contains pointer derefs. Complex array expressions (SCREEN+$100)[i] now possible as LValues. ASM fragment generation improved to handle new more complex LValues & RValues. Closes #5. Closes #43
2017-12-26 16:24:30 +00:00
(byte) plot::x#2 reg byte y 1001.0
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
(byte) plot::y
Improved ZP register ASM naming further. (issue with allocation not choosing optimal registers in some cases - a few tests left failing)
2017-08-21 06:27:34 +00:00
(byte) plot::y#1 y zp ZP_BYTE:4 151.5
Assignments are now expressions. For-loops can now contain assignments in the increment part. LValue handling reimplemented (lvalue no longer exist in parser - only expression). RValues now also contains pointer derefs. Complex array expressions (SCREEN+$100)[i] now possible as LValues. ASM fragment generation improved to handle new more complex LValues & RValues. Closes #5. Closes #43
2017-12-26 16:24:30 +00:00
(byte) plot::y#4 y zp ZP_BYTE:4 28.857142857142858
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
(void()) prepare()
(label) prepare::@1
(label) prepare::@return
(byte) prepare::i
Implemented register uplift combination search. This yields near optimal register allocation - but at a calculation cost at O(4^N) where N is the number of live range equivalence classes in a scope.
2017-08-01 22:57:29 +00:00
(byte) prepare::i#1 reg byte x 16.5
(byte) prepare::i#2 reg byte x 22.0
Implemented test comparing reference output to actual compilation output
2017-07-15 20:00:02 +00:00
Fixed constant propagation problem: (const-identification.kc) Constants are not identified correctly. Some times constant pointers are treated as variables Eg. byte* SCREEN = $0400 is adressed through zero-page even though it can be adressed directly.
2017-11-03 06:58:02 +00:00
reg byte x [ main::c#4 main::c#1 ]
Last of fragment renaming completed (zpptrby1/zpptrsby1 => pbuz1/pbsz1)
2017-12-12 23:29:47 +00:00
zp ZP_WORD:2 [ plot::line#4 plot::line#1 ]
Fixed register coalesce issues (Double.MIN_VALUE is unexpectedly positive).
2018-02-13 03:23:44 +00:00
zp ZP_BYTE:4 [ plot::y#4 plot::y#1 flip::r#4 flip::r#1 ]
Implemented register uplift combination search. This yields near optimal register allocation - but at a calculation cost at O(4^N) where N is the number of live range equivalence classes in a scope.
2017-08-01 22:57:29 +00:00
reg byte x [ plot::i#2 plot::i#3 plot::i#1 ]
reg byte y [ plot::x#2 plot::x#1 ]
Assignments are now expressions. For-loops can now contain assignments in the increment part. LValue handling reimplemented (lvalue no longer exist in parser - only expression). RValues now also contains pointer derefs. Complex array expressions (SCREEN+$100)[i] now possible as LValues. ASM fragment generation improved to handle new more complex LValues & RValues. Closes #5. Closes #43
2017-12-26 16:24:30 +00:00
reg byte y [ flip::srcIdx#2 flip::srcIdx#3 flip::srcIdx#1 ]
reg byte x [ flip::dstIdx#3 flip::dstIdx#5 flip::dstIdx#2 flip::dstIdx#1 ]
Fixed register coalesce issues (Double.MIN_VALUE is unexpectedly positive).
2018-02-13 03:23:44 +00:00
zp ZP_BYTE:5 [ flip::c#2 flip::c#1 ]
Implemented register uplift combination search. This yields near optimal register allocation - but at a calculation cost at O(4^N) where N is the number of live range equivalence classes in a scope.
2017-08-01 22:57:29 +00:00
reg byte x [ flip::i#2 flip::i#1 ]
reg byte x [ prepare::i#2 prepare::i#1 ]
Reference in New Issue Copy Permalink