15 Commits

Author	SHA1	Message	Date
Thomas Harte	b965f2053a	Start experimenting with a simple AND for operand validation.	2022-04-24 10:43:06 -04:00
Thomas Harte	d4b766bf3f	Introduce directional ADD/SUB/AND/OR. ... Just 512 failures to go.	2022-04-22 20:37:09 -04:00
Thomas Harte	977192f480	Resolve D-page decoding errors. ... In particular: that I'd overlooked CMPM, and was treating NOT as two-operand.	2022-04-22 09:24:16 -04:00
Thomas Harte	343a8e0192	Resolve wrong-headed mapping of LEA to MOVEAl.	2022-04-19 19:36:21 -04:00
Thomas Harte	19f7335926	Add post validation step.	2022-04-19 09:44:02 -04:00
Thomas Harte	1991ed0804	Introduce failing [partial-]test of new 68000 decoder.	2022-04-18 07:23:25 -04:00
Thomas Harte	bfb29a58f3	Take another crack at neatness; make LEA overt.	2022-04-15 20:33:59 -04:00
Thomas Harte	89b8b59658	Ostensibly completes the 0 line.	2022-04-15 15:33:54 -04:00
Thomas Harte	de55a1adc4	Require a model for decoding; shift a bunch of immediates into ExtendedOperation.	2022-04-15 09:40:37 -04:00
Thomas Harte	d1613025ee	For now, assume the .q actions can be handled inside Preinstruction.	2022-04-13 09:29:12 -04:00
Thomas Harte	cc4431c409	Expand decode to accept a wider array of operations, and then funnel them down.	2022-04-12 16:17:30 -04:00
Thomas Harte	c50556dde4	Create empty line decoders.	2022-04-12 08:16:29 -04:00
Thomas Harte	dd5bdd67d7	Add B page and a large chunk of 4.	2022-04-12 07:49:08 -04:00
Thomas Harte	21ac9363e9	Add page 8.	2022-04-11 16:32:57 -04:00
Thomas Harte	8e3cccf4d6	Begins a formalised 68k decoder.	2022-04-11 15:00:55 -04:00