6502/SixtyPical
1
0
Fork 0
mirror of https://github.com/catseye/SixtyPical.git synced 2024-09-29 08:57:04 +00:00
Code Issues Projects Releases Wiki Activity
497 Commits 1 Branch 23 Tags 1.3 MiB
72fed579d1
Commit Graph

497 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Chris Pressey
72fed579d1 Expand on the points in the TODOs. 2018-04-18 16:46:34 +01:00
Chris Pressey
bc91ef1602 Compile byte-table add, sub, cmp, and, or, xor, shl, shr, inc, dec. 2018-04-18 16:32:12 +01:00
Chris Pressey
5fcbfa1d21 Analyze reads and updates of tables. 2018-04-18 15:45:47 +01:00
Chris Pressey
0c22944afc Able to parse, but not yet able to analyze, other table accesses. 2018-04-18 14:21:03 +01:00
Chris Pressey
e565234d28 Support for shl foo and shr foo where foo is a byte storage. 2018-04-18 12:01:53 +01:00
Chris Pressey
b451176f37 (Not possible because there are not Indirect,Y modes for LDX, STX) 2018-04-18 11:27:23 +01:00
Chris Pressey
3c7d95a724 Support for copy [ptra]+y, [ptrb]+y to indirect LDA indirect STA 2018-04-18 10:57:57 +01:00
Chris Pressey
4f28f43bde The existing analysis is actually sufficient. Document why this is. 2018-04-18 10:25:23 +01:00
Chris Pressey
f9c3b56246 Work out routine-vector type compatibility, w/ one failing test. 2018-04-18 10:13:15 +01:00
Chris Pressey
70247e0e44 Generate zero-page code for and, or, and xor, when possible. 2018-04-17 17:58:26 +01:00
Chris Pressey
9b53ed03c8
Merge pull request #11 from catseye/develop-0.15 
Develop 0.15
 2018-04-10 10:27:49 +01:00
Chris Pressey
475584769d Add more test cases. 2018-04-06 14:08:09 +01:00
Chris Pressey
5f64113484 1-line bugfix. Now the optimizer does do the expected good job. 2018-04-06 13:27:40 +01:00
Chris Pressey
a5d946734a Add more tests. Apparently our algorithm does not do a good job. 2018-04-06 13:24:04 +01:00
Chris Pressey
350bab42d7 Rebuild Ribos 2. 2018-04-05 14:45:17 +01:00
Chris Pressey
cce278da28 Rebuild "The PETulant Cursor". 2018-04-05 14:36:38 +01:00
Chris Pressey
27df0d27db Optimize away RTS and JMP when possible. Fallthru stuff done. 2018-04-05 14:10:04 +01:00
Chris Pressey
2ca843ece7 Begin hooking the fallthru analysis up to the compilation phase. 2018-04-05 10:52:14 +01:00
Chris Pressey
ac24f98dd3 Vastly simplify the fallthru analysis algorithm. 2018-04-05 09:57:14 +01:00
Chris Pressey
7fa54f53cb Serialize main first. However, this could use a fresh approach. 2018-04-04 17:55:59 +01:00
Chris Pressey
9c68b6a7e0 Serialize routines with in() sets first, and in the right order. 2018-04-04 17:49:50 +01:00
Chris Pressey
cab84b8ebe Change the serialization format to be (hopefully) clearer. 2018-04-04 17:05:48 +01:00
Chris Pressey
efe8859209 Find the longest chain of routines in R and remove it. 2018-04-04 16:54:12 +01:00
Chris Pressey
b1bcc21ffc Go slightly further with the serialization. 2018-04-04 16:22:14 +01:00
Chris Pressey
30e839033c First cut at serialization of fallthru-optimized routines. 2018-04-04 15:09:48 +01:00
Chris Pressey
aecea9b6a3 Optomize dump() abstraction. (You muss optomize, always optomize.) 2018-04-04 14:20:56 +01:00
Chris Pressey
e39dbf68ed Call it fall_in_map. 2018-04-04 14:16:49 +01:00
Chris Pressey
9c196efe25 Abstraction for dumping JSON info. 2018-04-04 14:13:53 +01:00
Chris Pressey
448849ac4b Successfully break cycle. 2018-04-04 14:01:17 +01:00
Chris Pressey
50433ac860 Find cycles in fallthru map. Try to break them; not right, yet. 2018-04-04 13:37:32 +01:00
Chris Pressey
d883816298 --optimize-fallthru and --dump-fallthru-info options. 2018-04-04 11:54:50 +01:00
Chris Pressey
a0d3ea8167 Add a dedicated module for a dedicated FallthruAnalyzer. 2018-04-04 11:09:39 +01:00
Chris Pressey
2be4406964 Flesh out and describe the fallthru optimization algorithm. 2018-04-04 10:15:06 +01:00
Chris Pressey
237a8b5b39 Lessen dependence on the internals of ParsingContext. 2018-03-29 17:31:14 +01:00
Chris Pressey
b63b880b8c Update documentation. 2018-03-29 16:58:50 +01:00
Chris Pressey
a759f4414b Make tests pass again. 2018-03-29 16:50:07 +01:00
Chris Pressey
8f1e35fb39 Add some tests, some failing, for expected fallthru maps. 2018-03-29 16:44:06 +01:00
Chris Pressey
b33998cddc First cut at building fallthru map. Needs tests. 2018-03-29 15:07:44 +01:00
Chris Pressey
fa1b0cfae1 Support branching and looping on the n flag. 2018-03-29 14:45:28 +01:00
Chris Pressey
b9fb26320c Add some failing tests for looping on the n flag. 2018-03-29 13:33:06 +01:00
Chris Pressey
6e8dc97826 Fork the Atari 2600 Ophis example for easier comparing to 60p. 2018-03-29 12:11:38 +01:00
Chris Pressey
ebe53f540c Fix bug when zero page address was $00. 2018-03-29 11:46:56 +01:00
Chris Pressey
eadf1eb4ae A byte or word table can be initialized with a list of constants. 2018-03-29 11:09:02 +01:00
Chris Pressey
2f513f7291 Initial support for initializing byte tables with list of bytes. 2018-03-29 10:45:18 +01:00
Chris Pressey
9b912de17c Accessing zero-page with ld and st generates zero-page opcodes. 2018-03-29 10:31:42 +01:00
Chris Pressey
1f992f8dbd Support of NOP opcode. 2018-03-28 14:52:16 +01:00
Chris Pressey
0093c7b7d9 First cut at support for targetting the Atari 2600. 2018-03-28 14:20:53 +01:00
Chris Pressey
bb0e7aa992 Track the gotos that we have encountered in a routine. 2018-03-27 17:27:09 +01:00
Chris Pressey
f86041721d Try to spell out my idea for an algorithm for this. 2018-03-27 17:05:41 +01:00
Chris Pressey
c707105cd3 Describe the behaviour just implemented. 2018-03-27 16:49:20 +01:00