mirror of
https://github.com/irmen/prog8.git
synced 2024-11-23 07:32:10 +00:00
377 lines
11 KiB
Lua
377 lines
11 KiB
Lua
%import textio
|
|
|
|
; bitmap pixel graphics module for the C64
|
|
; only black/white monochrome 320x200 for now
|
|
; assumes bitmap screen memory is $2000-$3fff
|
|
|
|
graphics {
|
|
const uword BITMAP_ADDRESS = $2000
|
|
const uword WIDTH = 320
|
|
const ubyte HEIGHT = 200
|
|
|
|
sub enable_bitmap_mode() {
|
|
; enable bitmap screen, erase it and set colors to black/white.
|
|
c64.SCROLY = %00111011
|
|
c64.SCROLX = %00001000
|
|
c64.VMCSB = (c64.VMCSB & %11110000) | %00001000 ; $2000-$3fff
|
|
clear_screen(1, 0)
|
|
}
|
|
|
|
sub disable_bitmap_mode() {
|
|
; enables text mode, erase the text screen, color white
|
|
c64.SCROLY = %00011011
|
|
c64.SCROLX = %00001000
|
|
c64.VMCSB = (c64.VMCSB & %11110000) | %00000100 ; $1000-$2fff
|
|
txt.fill_screen(' ', 1)
|
|
}
|
|
|
|
sub clear_screen(ubyte pixelcolor, ubyte bgcolor) {
|
|
sys.memset(BITMAP_ADDRESS, 320*200/8, 0)
|
|
txt.fill_screen(pixelcolor << 4 | bgcolor, 0)
|
|
}
|
|
|
|
sub line(uword @zp x1, ubyte @zp y1, uword @zp x2, ubyte @zp y2) {
|
|
; Bresenham algorithm.
|
|
; This code special-cases various quadrant loops to allow simple ++ and -- operations.
|
|
; TODO implement this as optimized assembly, for instance https://github.com/EgonOlsen71/bresenham/blob/main/src/asm/graphics.asm ??
|
|
; or from here https://retro64.altervista.org/blog/an-introduction-to-vector-based-graphics-the-commodore-64-rotating-simple-3d-objects/
|
|
|
|
if y1>y2 {
|
|
; make sure dy is always positive to have only 4 instead of 8 special cases
|
|
cx16.r0 = x1
|
|
x1 = x2
|
|
x2 = cx16.r0
|
|
cx16.r0L = y1
|
|
y1 = y2
|
|
y2 = cx16.r0L
|
|
}
|
|
word @zp dx = (x2 as word)-x1
|
|
word @zp dy = (y2 as word)-y1
|
|
|
|
if dx==0 {
|
|
vertical_line(x1, y1, abs(dy) as ubyte +1)
|
|
return
|
|
}
|
|
if dy==0 {
|
|
if x1>x2
|
|
x1=x2
|
|
horizontal_line(x1, y1, abs(dx) as uword +1)
|
|
return
|
|
}
|
|
|
|
word @zp d = 0
|
|
ubyte positive_ix = true
|
|
if dx < 0 {
|
|
dx = -dx
|
|
positive_ix = false
|
|
}
|
|
word @zp dx2 = dx*2
|
|
word @zp dy2 = dy*2
|
|
internal_plotx = x1
|
|
|
|
if dx >= dy {
|
|
if positive_ix {
|
|
repeat {
|
|
internal_plot(y1)
|
|
if internal_plotx==x2
|
|
return
|
|
internal_plotx++
|
|
d += dy2
|
|
if d > dx {
|
|
y1++
|
|
d -= dx2
|
|
}
|
|
}
|
|
} else {
|
|
repeat {
|
|
internal_plot(y1)
|
|
if internal_plotx==x2
|
|
return
|
|
internal_plotx--
|
|
d += dy2
|
|
if d > dx {
|
|
y1++
|
|
d -= dx2
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
if positive_ix {
|
|
repeat {
|
|
internal_plot(y1)
|
|
if y1 == y2
|
|
return
|
|
y1++
|
|
d += dx2
|
|
if d > dy {
|
|
internal_plotx++
|
|
d -= dy2
|
|
}
|
|
}
|
|
} else {
|
|
repeat {
|
|
internal_plot(y1)
|
|
if y1 == y2
|
|
return
|
|
y1++
|
|
d += dx2
|
|
if d > dy {
|
|
internal_plotx--
|
|
d -= dy2
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
sub rect(uword x, ubyte y, uword width, ubyte height) {
|
|
if width==0 or height==0
|
|
return
|
|
horizontal_line(x, y, width)
|
|
if height==1
|
|
return
|
|
horizontal_line(x, y+height-1, width)
|
|
vertical_line(x, y+1, height-2)
|
|
if width==1
|
|
return
|
|
vertical_line(x+width-1, y+1, height-2)
|
|
}
|
|
|
|
sub fillrect(uword x, ubyte y, uword width, ubyte height) {
|
|
if width==0
|
|
return
|
|
repeat height {
|
|
horizontal_line(x, y, width)
|
|
y++
|
|
}
|
|
}
|
|
|
|
sub horizontal_line(uword x, ubyte y, uword length) {
|
|
if length<8 {
|
|
internal_plotx=x
|
|
repeat lsb(length) {
|
|
internal_plot(y)
|
|
internal_plotx++
|
|
}
|
|
return
|
|
}
|
|
|
|
ubyte separate_pixels = lsb(x) & 7
|
|
uword addr = get_y_lookup(y) + (x&$fff8)
|
|
|
|
if separate_pixels {
|
|
%asm {{
|
|
lda addr
|
|
sta P8ZP_SCRATCH_W1
|
|
lda addr+1
|
|
sta P8ZP_SCRATCH_W1+1
|
|
ldy separate_pixels
|
|
lda hline_filled_right,y
|
|
eor #255
|
|
ldy #0
|
|
ora (P8ZP_SCRATCH_W1),y
|
|
sta (P8ZP_SCRATCH_W1),y
|
|
}}
|
|
addr += 8
|
|
length += separate_pixels
|
|
length -= 8
|
|
}
|
|
|
|
if length {
|
|
%asm {{
|
|
lda length
|
|
and #7
|
|
sta separate_pixels
|
|
stx P8ZP_SCRATCH_REG
|
|
lsr length+1
|
|
ror length
|
|
lsr length+1
|
|
ror length
|
|
lsr length+1
|
|
ror length
|
|
lda addr
|
|
sta _modified+1
|
|
lda addr+1
|
|
sta _modified+2
|
|
lda length
|
|
ora length+1
|
|
beq _zero
|
|
ldy length
|
|
ldx #$ff
|
|
_modified stx $ffff ; modified
|
|
lda _modified+1
|
|
clc
|
|
adc #8
|
|
sta _modified+1
|
|
bcc +
|
|
inc _modified+2
|
|
+ dey
|
|
bne _modified
|
|
_zero ldx P8ZP_SCRATCH_REG
|
|
|
|
ldy separate_pixels
|
|
beq hline_zero2
|
|
lda _modified+1
|
|
sta P8ZP_SCRATCH_W1
|
|
lda _modified+2
|
|
sta P8ZP_SCRATCH_W1+1
|
|
lda hline_filled_right,y
|
|
ldy #0
|
|
ora (P8ZP_SCRATCH_W1),y
|
|
sta (P8ZP_SCRATCH_W1),y
|
|
jmp hline_zero2
|
|
hline_filled_right .byte 0, %10000000, %11000000, %11100000, %11110000, %11111000, %11111100, %11111110
|
|
hline_zero2
|
|
}}
|
|
}
|
|
}
|
|
|
|
sub vertical_line(uword x, ubyte y, ubyte height) {
|
|
internal_plotx = x
|
|
repeat height {
|
|
internal_plot(y)
|
|
y++
|
|
}
|
|
}
|
|
|
|
sub circle(uword xcenter, ubyte ycenter, ubyte radius) {
|
|
; Midpoint algorithm
|
|
if radius==0
|
|
return
|
|
ubyte @zp ploty
|
|
ubyte @zp yy = 0
|
|
word @zp decisionOver2 = (1 as word)-radius
|
|
|
|
while radius>=yy {
|
|
internal_plotx = xcenter + radius
|
|
ploty = ycenter + yy
|
|
internal_plot(ploty)
|
|
internal_plotx = xcenter - radius
|
|
internal_plot(ploty)
|
|
internal_plotx = xcenter + radius
|
|
ploty = ycenter - yy
|
|
internal_plot(ploty)
|
|
internal_plotx = xcenter - radius
|
|
internal_plot(ploty)
|
|
internal_plotx = xcenter + yy
|
|
ploty = ycenter + radius
|
|
internal_plot(ploty)
|
|
internal_plotx = xcenter - yy
|
|
internal_plot(ploty)
|
|
internal_plotx = xcenter + yy
|
|
ploty = ycenter - radius
|
|
internal_plot(ploty)
|
|
internal_plotx = xcenter - yy
|
|
internal_plot(ploty)
|
|
yy++
|
|
if decisionOver2<=0
|
|
decisionOver2 += (yy as word)*2+1
|
|
else {
|
|
radius--
|
|
decisionOver2 += (yy as word -radius)*2+1
|
|
}
|
|
}
|
|
}
|
|
|
|
sub disc(uword xcenter, ubyte ycenter, ubyte radius) {
|
|
; Midpoint algorithm, filled
|
|
if radius==0
|
|
return
|
|
ubyte @zp yy = 0
|
|
word decisionOver2 = (1 as word)-radius
|
|
|
|
while radius>=yy {
|
|
horizontal_line(xcenter-radius, ycenter+yy, radius*2+1)
|
|
horizontal_line(xcenter-radius, ycenter-yy, radius*2+1)
|
|
horizontal_line(xcenter-yy, ycenter+radius, yy*2+1)
|
|
horizontal_line(xcenter-yy, ycenter-radius, yy*2+1)
|
|
yy++
|
|
if decisionOver2<=0
|
|
decisionOver2 += (yy as word)*2+1
|
|
else {
|
|
radius--
|
|
decisionOver2 += (yy as word -radius)*2+1
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
; here is the non-asm code for the plot routine below:
|
|
; sub plot_nonasm(uword px, ubyte py) {
|
|
; ubyte[] ormask = [128, 64, 32, 16, 8, 4, 2, 1]
|
|
; uword addr = BITMAP_ADDRESS + 320*(py>>3) + (py & 7) + (px & %0000000111111000)
|
|
; @(addr) |= ormask[lsb(px) & 7]
|
|
; }
|
|
|
|
inline asmsub plot(uword plotx @XY, ubyte ploty @A) clobbers (A, X, Y) {
|
|
%asm {{
|
|
stx graphics.internal_plotx
|
|
sty graphics.internal_plotx+1
|
|
jsr graphics.internal_plot
|
|
}}
|
|
}
|
|
|
|
; for efficiency of internal algorithms here is the internal plot routine
|
|
; that takes the plotx coordinate in a separate variable instead of the XY register pair:
|
|
|
|
uword @zp internal_plotx ; 0..319 ; separate 'parameter' for internal_plot()
|
|
|
|
asmsub internal_plot(ubyte ploty @A) clobbers (A, X, Y) { ; internal_plotx is 16 bits 0 to 319... doesn't fit in a register
|
|
%asm {{
|
|
tay
|
|
lda internal_plotx+1
|
|
sta P8ZP_SCRATCH_W2+1
|
|
lsr a ; 0
|
|
sta P8ZP_SCRATCH_W2
|
|
lda internal_plotx
|
|
pha
|
|
and #7
|
|
tax
|
|
|
|
lda _y_lookup_lo,y
|
|
clc
|
|
adc P8ZP_SCRATCH_W2
|
|
sta P8ZP_SCRATCH_W2
|
|
lda _y_lookup_hi,y
|
|
adc P8ZP_SCRATCH_W2+1
|
|
sta P8ZP_SCRATCH_W2+1
|
|
|
|
pla ; internal_plotx
|
|
and #%11111000
|
|
tay
|
|
lda (P8ZP_SCRATCH_W2),y
|
|
ora _ormask,x
|
|
sta (P8ZP_SCRATCH_W2),y
|
|
rts
|
|
|
|
_ormask .byte 128, 64, 32, 16, 8, 4, 2, 1
|
|
|
|
; note: this can be even faster if we also have a 256 byte x-lookup table, but hey.
|
|
; see http://codebase64.org/doku.php?id=base:various_techniques_to_calculate_adresses_fast_common_screen_formats_for_pixel_graphics
|
|
; the y lookup tables encodes this formula: BITMAP_ADDRESS + 320*(py>>3) + (py & 7) (y from 0..199)
|
|
; We use the 64tass syntax for range expressions to calculate this table on assembly time.
|
|
|
|
_plot_y_values := $2000 + 320*(range(200)>>3) + (range(200) & 7)
|
|
|
|
_y_lookup_lo .byte <_plot_y_values
|
|
_y_lookup_hi .byte >_plot_y_values
|
|
|
|
}}
|
|
}
|
|
|
|
asmsub get_y_lookup(ubyte y @Y) -> uword @AY {
|
|
%asm {{
|
|
lda internal_plot._y_lookup_lo,y
|
|
pha
|
|
lda internal_plot._y_lookup_hi,y
|
|
tay
|
|
pla
|
|
rts
|
|
}}
|
|
}
|
|
|
|
}
|
|
|
|
|