Apple-2-SW/prog8
1
0
Fork 0
mirror of https://github.com/irmen/prog8.git synced 2024-11-26 11:49:22 +00:00
Code Issues Projects Releases Wiki Activity

increase flood fill stack size a bit

Browse Source
This commit is contained in:
Irmen de Jong 2024-08-23 20:49:26 +02:00
parent e2592b4e0b
commit 48d0185ea4
3 changed files with 6 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
compiler/res/prog8lib/cx16/gfx2.p8
View File

@ -632,7 +632,7 @@ gfx2 {
; Non-recursive scanline flood fill. ; Non-recursive scanline flood fill.
; based loosely on code found here https://www.codeproject.com/Articles/6017/QuickFill-An-efficient-flood-fill-algorithm ; based loosely on code found here https://www.codeproject.com/Articles/6017/QuickFill-An-efficient-flood-fill-algorithm
; with the fixes applied to the seedfill_4 routine as mentioned in the comments. ; with the fixes applied to the seedfill_4 routine as mentioned in the comments.
const ubyte MAXDEPTH = 64 const ubyte MAXDEPTH = 100
word @zp xx = x as word word @zp xx = x as word
word @zp yy = y as word word @zp yy = y as word
word[MAXDEPTH] @split @shared stack_xl word[MAXDEPTH] @split @shared stack_xl

2
compiler/res/prog8lib/cx16/monogfx.p8
View File

@ -708,7 +708,7 @@ invert:
; Non-recursive scanline flood fill. ; Non-recursive scanline flood fill.
; based loosely on code found here https://www.codeproject.com/Articles/6017/QuickFill-An-efficient-flood-fill-algorithm ; based loosely on code found here https://www.codeproject.com/Articles/6017/QuickFill-An-efficient-flood-fill-algorithm
; with the fixes applied to the seedfill_4 routine as mentioned in the comments. ; with the fixes applied to the seedfill_4 routine as mentioned in the comments.
const ubyte MAXDEPTH = 64 const ubyte MAXDEPTH = 100
word @zp xx = x as word word @zp xx = x as word
word @zp yy = y as word word @zp yy = y as word
word[MAXDEPTH] @split @shared stack_xl word[MAXDEPTH] @split @shared stack_xl

12
compiler/res/prog8lib/virtual/monogfx.p8
View File

@ -377,7 +377,7 @@ monogfx {
; Non-recursive scanline flood fill. ; Non-recursive scanline flood fill.
; based loosely on code found here https://www.codeproject.com/Articles/6017/QuickFill-An-efficient-flood-fill-algorithm ; based loosely on code found here https://www.codeproject.com/Articles/6017/QuickFill-An-efficient-flood-fill-algorithm
; with the fixes applied to the seedfill_4 routine as mentioned in the comments. ; with the fixes applied to the seedfill_4 routine as mentioned in the comments.
const ubyte MAXDEPTH = 64 const ubyte MAXDEPTH = 100
word @zp xx = x as word word @zp xx = x as word
word @zp yy = y as word word @zp yy = y as word
word[MAXDEPTH] @split @shared stack_xl word[MAXDEPTH] @split @shared stack_xl
@ -423,11 +423,10 @@ monogfx {
while xx >= 0 { while xx >= 0 {
if pget(xx as uword, yy as uword) as ubyte != cx16.r11L if pget(xx as uword, yy as uword) as ubyte != cx16.r11L
break break
plot(xx as uword, yy as uword, cx16.r10L as bool)
xx-- xx--
} }
if x1!=xx if x1==xx
horizontal_line(xx as uword+1, yy as uword, x1-xx as uword, cx16.r10L as bool)
else
goto skip goto skip
left = xx + 1 left = xx + 1
@ -436,15 +435,12 @@ monogfx {
xx = x1 + 1 xx = x1 + 1
do { do {
cx16.r9 = xx as uword
while xx <= width-1 { while xx <= width-1 {
if pget(xx as uword, yy as uword) as ubyte != cx16.r11L if pget(xx as uword, yy as uword) as ubyte != cx16.r11L
break break
plot(xx as uword, yy as uword, cx16.r10L as bool)
xx++ xx++
} }
if cx16.r9!=xx
horizontal_line(cx16.r9, yy as uword, (xx as uword)-cx16.r9, cx16.r10L as bool)
push_stack(left, xx - 1, yy, dy) push_stack(left, xx - 1, yy, dy)
if xx > x2 + 1 if xx > x2 + 1
push_stack(x2 + 1, xx - 1, yy, -dy) push_stack(x2 + 1, xx - 1, yy, -dy)