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
|
475584769d
|
Add more test cases.
|
2018-04-06 14:08:09 +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
|
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
|
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
|
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
|
2be4406964
|
Flesh out and describe the fallthru optimization algorithm.
|
2018-04-04 10:15:06 +01:00 |
|
Chris Pressey
|
8f1e35fb39
|
Add some tests, some failing, for expected fallthru maps.
|
2018-03-29 16:44:06 +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
|
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
|
3f0e36a67c
|
Add symbolic constants.
|
2018-03-27 12:36:33 +01:00 |
|
Chris Pressey
|
b91c3ed2f1
|
Add three more tests. Ensure they pass.
|
2018-03-26 17:40:43 +01:00 |
|
Chris Pressey
|
ceaae962d5
|
Make tests pass. Add two more tests towards completeness of spec.
|
2018-03-26 12:48:57 +01:00 |
|
Chris Pressey
|
d88757c32b
|
Rudimentarily document for; add failing test cases for it.
|
2018-03-23 17:13:46 +00:00 |
|
Chris Pressey
|
adb53f7a04
|
Almost compile for loops correctly.
|
2018-03-14 15:33:11 +00:00 |
|
Chris Pressey
|
b79059faa4
|
Two seperate words looks better.
|
2018-03-14 09:51:24 +00:00 |
|
Chris Pressey
|
b073fe54a0
|
Tests for the downto variant too.
|
2018-03-13 17:49:48 +00:00 |
|
Chris Pressey
|
7a3b52dc1e
|
More correct determination of tail position for purposes of goto.
|
2018-03-13 17:00:49 +00:00 |
|
Chris Pressey
|
5f62de11c2
|
Add failing test for multiple gotos that are all in tail position.
|
2018-03-13 13:33:30 +00:00 |
|
Chris Pressey
|
f73a2313bd
|
Add some failing tests for analyzing "for".
|
2018-03-08 17:17:49 +00:00 |
|
Chris Pressey
|
d815e05e0c
|
Syntax for "open-faced for loop".
|
2018-03-08 16:54:12 +00:00 |
|
Chris Pressey
|
72efecbb1a
|
Support different preludes for different archs (c64 and vic20 now.)
|
2018-03-06 17:00:39 +00:00 |
|
Chris Pressey
|
bda0202dee
|
Confirm that AND clips the range and INC/DEC invalidate it.
|
2018-03-06 15:42:12 +00:00 |
|
Chris Pressey
|
1eaec602e3
|
The exception object now contains an AST node, renders name.
|
2018-03-06 14:39:47 +00:00 |
|
Chris Pressey
|
e44c802314
|
Syntax errors have line numbers in them now.
|
2018-03-06 12:23:57 +00:00 |
|
Chris Pressey
|
d24e9fa2e1
|
I can no longer see a reason to require that it is a power of two.
|
2018-03-05 10:38:20 +00:00 |
|
Chris Pressey
|
15fa4889e7
|
Add some more tests (failing currently).
|
2018-02-16 12:28:11 +00:00 |
|
Chris Pressey
|
0687da80d5
|
Some headway on context.assert_in_range().
|
2018-02-14 15:54:57 +00:00 |
|
Chris Pressey
|
93e2dada16
|
Check for table size (in parser, thus tests are for syntax.)
|
2018-02-14 13:53:22 +00:00 |
|
Chris Pressey
|
aa5b06980c
|
Add some initial failing tests.
|
2018-02-14 13:41:48 +00:00 |
|
Chris Pressey
|
f6fa1ec7d2
|
Remove need for forward keyword in forward reference in copy.
|
2018-02-12 15:59:20 +00:00 |
|
Chris Pressey
|
08ec0e46a3
|
Remove the need for parens in vector (routine ...) table type.
|
2018-02-12 14:53:49 +00:00 |
|
Chris Pressey
|
7a024f3062
|
Compile static storage location access.
|
2018-02-09 16:13:09 +00:00 |
|
Chris Pressey
|
71cded0297
|
Move compiler towards being able to compile access to statics.
|
2018-02-09 14:13:39 +00:00 |
|
Chris Pressey
|
55331e9c54
|
Statics are always writeable. Statics are always meaningful.
|
2018-02-09 13:35:59 +00:00 |
|
Chris Pressey
|
b829836cdc
|
Ability to parse static definitions and look them up.
|
2018-02-09 12:33:45 +00:00 |
|
Chris Pressey
|
ca1c877a60
|
Support indirect refs in st, e.g. st a, [ptr] + y.
|
2018-02-09 11:23:18 +00:00 |
|
Chris Pressey
|
b20b664748
|
Implement the "union rule for trashes" when analyzing if blocks.
|
2018-02-08 14:04:51 +00:00 |
|
Chris Pressey
|
3f1f3bf16e
|
Set a location as touched when trashed with a trash instruction.
|
2018-02-08 13:43:06 +00:00 |
|
Chris Pressey
|
f4befb45d3
|
Add more tests, which show inconsistent treatment of trashes.
|
2018-02-08 13:34:03 +00:00 |
|
Chris Pressey
|
cde2824c44
|
Articulate the "union rule" for trashes in if, add failing tests.
|
2018-02-08 12:46:28 +00:00 |
|
Chris Pressey
|
f92e1f15bf
|
Tired: copy [ptr]+y, a. Wired: ld a, [ptr]+y.
|
2018-02-08 11:58:24 +00:00 |
|
Chris Pressey
|
34daad0e56
|
Make ld parse to a IndexedRef or IndirectRef (latter still todo.)
|
2018-02-08 11:04:11 +00:00 |
|
Chris Pressey
|
7c8f113c07
|
Properly store address (not contents) of routine into vector table.
|
2018-02-07 13:56:17 +00:00 |
|
Chris Pressey
|
6c1c1cb153
|
Include final RTS when emitting trampolines for indirect calls.
|
2018-02-07 11:11:14 +00:00 |
|
Chris Pressey
|
b4f5d60ad3
|
I think it should actually look like this!
|
2018-02-06 17:00:04 +00:00 |
|
Chris Pressey
|
ed1ed3eb5d
|
Always analyze before compiling.
|
2018-02-06 16:14:44 +00:00 |
|
Chris Pressey
|
9778e083c1
|
Move test, add test, add assertion.
|
2018-02-06 11:52:50 +00:00 |
|
Chris Pressey
|
70ecd52e8a
|
Retain some syntax compatibility: make table a postfix operator.
|
2018-02-06 11:34:21 +00:00 |
|
Chris Pressey
|
612ae588f7
|
Add some tests, fix some bugs, show that one bug remains.
|
2018-02-06 10:05:56 +00:00 |
|
Chris Pressey
|
74f8675761
|
Start of typedef support.
|
2018-02-05 18:12:48 +00:00 |
|
Chris Pressey
|
0be721667a
|
Kind-of not-pretty syntax refactor to support adding typedefs.
|
2018-02-05 17:01:25 +00:00 |
|
Chris Pressey
|
15072eff52
|
The evaluator doesn't add much and keeps falling behind; remove it.
|
2018-02-05 13:17:23 +00:00 |
|
Chris Pressey
|
20c824743e
|
Fix table access bug where index wasn't required to be initialized.
|
2018-02-05 12:35:19 +00:00 |
|
Chris Pressey
|
7dfd2cfe0c
|
Allow copying a routine directly into a vector table.
|
2018-02-05 12:04:28 +00:00 |
|
Chris Pressey
|
bbd3a84c00
|
Retain silly 'name inside the type' syntax (a la C) for now.
|
2018-02-05 11:18:35 +00:00 |
|
Chris Pressey
|
a082aee001
|
NOt 100% sure it's correct, but it seems close.
|
2018-02-02 17:56:50 +00:00 |
|
Chris Pressey
|
0fff8e4f0a
|
Begin to implement vector tables, stuck at a type equality problem.
|
2018-02-02 17:45:07 +00:00 |
|
Chris Pressey
|
eb1974eb8a
|
Vector tables can be parsed.
|
2018-02-02 17:18:25 +00:00 |
|
Chris Pressey
|
b29716fccf
|
Constraints for vector come immediately after the type expression.
|
2018-02-02 17:16:31 +00:00 |
|
Chris Pressey
|
548905dce4
|
Initialized byte tables need not have all 256 bytes initialized.
|
2018-02-02 16:31:23 +00:00 |
|
Chris Pressey
|
f9dc730f88
|
copy []+y, a to indirectly read byte into the a register.
|
2017-12-13 16:11:02 +00:00 |
|
Chris Pressey
|
c7861d375c
|
trash indicates a value is no longer considered meaningful.
|
2017-12-13 15:23:06 +00:00 |
|
Chris Pressey
|
5f535c963e
|
Subtract word (constant or memory location) from word memory location.
|
2017-12-13 14:07:59 +00:00 |
|
Chris Pressey
|
f87bcf5ee4
|
Initial work on initialized byte tables.
|
2017-12-12 16:41:49 +00:00 |
|
Chris Pressey
|
50390b0787
|
Can copy a literal word to a word table.
|
2017-12-12 16:04:59 +00:00 |
|
Chris Pressey
|
63f75a26b4
|
Initialized word type memory locations.
|
2017-12-12 15:34:51 +00:00 |
|
Chris Pressey
|
4854077cce
|
Correctly analyze repeat { ... } forever loops.
|
2017-12-12 15:18:59 +00:00 |
|
Chris Pressey
|
3417fd96c7
|
Apparently this hack was only needed previously due to a bug?
|
2017-12-12 14:55:57 +00:00 |
|
Chris Pressey
|
0194d37bbd
|
forward modifier on location expression, instead of assign.
|
2017-12-12 14:23:34 +00:00 |
|
Chris Pressey
|
b7b28830d7
|
Introducing a new pseudo-opcode is rarely an elegant solution.
|
2017-12-12 14:09:17 +00:00 |
|
Chris Pressey
|
19dd089a03
|
Allow call and goto routines defined further down in the source.
|
2017-12-12 13:17:00 +00:00 |
|
Chris Pressey
|
8dc44673fa
|
LocationRefs are equal if names/type are; this needed __str__ tho.
|
2017-12-12 12:45:47 +00:00 |
|
Chris Pressey
|
b3d2d0bfcf
|
Clearing up a little mystery I had here.
|
2017-12-12 10:10:58 +00:00 |
|
Chris Pressey
|
ec2e051518
|
Constraint sets may only contain labels, which are resolved late.
|
2017-12-11 17:49:02 +00:00 |
|
Chris Pressey
|
2a71c7e247
|
Add failing test for a vector being able to name itself in outputs.
|
2017-12-11 16:57:18 +00:00 |
|
Chris Pressey
|
b4709268bc
|
Check in test appliance (dcc6502-adapter) that was missed.
|
2017-12-11 13:46:06 +00:00 |
|
Chris Pressey
|
2216fcec17
|
copy from word storage to word table and back, indexed by x or y.
|
2017-12-11 12:02:48 +00:00 |
|
Chris Pressey
|
b86e7491d5
|
Copy word to word table.
|
2017-12-11 11:43:53 +00:00 |
|
Chris Pressey
|
81aeb6c3f7
|
Use dcc6502 to disassemble code for comparison in unit tests.
|
2017-12-11 11:16:27 +00:00 |
|
Chris Pressey
|
404f8c72a3
|
We really need to review how storage location labels are emitted.
|
2017-12-08 16:59:31 +00:00 |
|
Chris Pressey
|
84ca6c4e96
|
Break the ground where we need to implement word table read/write.
|
2017-12-08 15:53:18 +00:00 |
|
Chris Pressey
|
689ed37f2e
|
Beginnings of implementing word tables. One test still fails.
|
2017-12-08 13:41:48 +00:00 |
|
Chris Pressey
|
ad8e0647a4
|
Use right endianness when copying literal word into storage.
|
2017-12-07 16:49:43 +00:00 |
|