Compare commits

..

No commits in common. "main" and "main" have entirely different histories.

4 changed files with 255 additions and 690 deletions

View file

@ -3,7 +3,7 @@
all : mandel.xex all : mandel.xex
mandel.xex : mandel.o tables.o atari-asm-xex.cfg mandel.xex : mandel.o tables.o atari-asm-xex.cfg
ld65 -C ./atari-asm-xex.cfg --mapfile mandel.map -o $@ mandel.o tables.o ld65 -C ./atari-asm-xex.cfg -o $@ mandel.o tables.o
%.o : %.s %.o : %.s
ca65 -o $@ $< ca65 -o $@ $<
@ -15,6 +15,4 @@ clean :
rm -f tables.s rm -f tables.s
rm -f *.o rm -f *.o
rm -f *.xex rm -f *.xex
rm -f mandel.map

923
mandel.s

File diff suppressed because it is too large Load diff

View file

@ -18,7 +18,7 @@ Enjoy! I'll probably work on this off and on for the next few weeks until I've g
## Current state ## Current state
Basic rendering is functional, with interactive zoom/pan (+/-/arrows) and 6 preset viewports via the number keys. Basic rendering is functional, with interactive zoom/pan (+/-/arrows) and 4 preset viewports via the number keys.
The 16-bit signed integer multiplication takes two 16-bit inputs and emits one 32-bit output in the zero page, using the Atari OS ROM's floating point registers as workspaces. Inputs are clobbered. The 16-bit signed integer multiplication takes two 16-bit inputs and emits one 32-bit output in the zero page, using the Atari OS ROM's floating point registers as workspaces. Inputs are clobbered.
@ -27,7 +27,7 @@ The 16-bit signed integer multiplication takes two 16-bit inputs and emits one 3
* when expanded RAM is available as on 130XE, a 64KB 8-bit multiplication table accelerates the remaining multiplications * when expanded RAM is available as on 130XE, a 64KB 8-bit multiplication table accelerates the remaining multiplications
* without expanded RAM, a table of half-squares is used to implement the algorithm from https://everything2.com/title/Fast+6502+multiplication * without expanded RAM, a table of half-squares is used to implement the algorithm from https://everything2.com/title/Fast+6502+multiplication
The mandelbrot calculations are done using 3.13-precision fixed point numbers with 6.26-precision intermediates. The mandelbrot calculations are done using 4.12-precision fixed point numbers with 8.24-precision intermediates. It may be possible to squish this down to 3.13/6.26.
Iterations are capped at 255. Iterations are capped at 255.

14
todo.md
View file

@ -1,17 +1,19 @@
things to try: things to try:
* fix status bar to show elapsed time, per-iter time, per-pixel iter count * skip add on the top-byte multiply in sqr8/mul8
* should save a few cycles, suggestion by jamey
* 'turbo' mode disabling graphics in full or part
* patch the entire expanded-ram imul8xe on top of imul8 to avoid the 3-cycle thunk penalty :D * patch the entire expanded-ram imul8xe on top of imul8 to avoid the 3-cycle thunk penalty :D
* maybe clean up the load/layout of the big mul table * try 3.13 fixed point instead of 4.12 for more precision
* can we get away without the extra bit?
* consider alternate lookup tables in the top 16KB under ROM * since exit compare space would be 6.26 i think so
* y-axis mirror optimization * y-axis mirror optimization
* 'wide pixels' 2x and 4x for a fuller initial image in the tiered rendering
* maybe redo tiering to just 4x4, 2x2, 1x1?
* extract viewport for display & re-input via keyboard * extract viewport for display & re-input via keyboard
* fujinet screenshot/viewport uploader * fujinet screenshot/viewport uploader