Code Like It's 198x

Fill a Connected Grid Region on Amiga

A paint fill can also discover a connected room or reveal matching puzzle cells.

A paint fill can also discover a connected room or reveal matching puzzle cells.

Amiga shows the working diagnostic row 00 09 03 01 09 09 00 00.
A completed native caller displays 00 09 03 01 09 09 00 00. The public field order below identifies these bytes; the capture is a state diagnostic, not a recording of a finished game.

Use it in a project

The caller supplies a 4×4 row-major byte grid and SEED 0–15. Replace its four-connected region with REPLACEMENT and return CHANGED. Equal source/replacement is a valid no-op. The implementation repeatedly scans for source-colour cells touching the growing replacement region, but tracks membership separately in scratch so pre-existing replacement-colour cells cannot leak into it.

Include component.inc once (MOS callers include the shared 6502 implementation through it). Reserve the public fields in this exact order: SEED, REPLACEMENT, CHANGED, VALID, C0, C1, C2, C3, C4, C5, C6, C7, C8, C9, C10, C11, C12, C13, C14, C15. They occupy 20 contiguous bytes. Also reserve the private workspace: T0, T1, T2, T3, T4, T5, T6, T7, EXPR_SAVE, V0, V1, V2, V3, V4, V5, V6, V7, V8, V9, V10, V11, V12, V13, V14, V15 (25 bytes). Array names in the explanation refer to the numbered consecutive bindings, such as C0, C1 and so on.

Call bounded_flood_fill_init once at the intended reset boundary. It clears inputs as well as outputs and workspace. Set your starting state and configuration afterwards, then call bounded_flood_fill_step whenever the described event occurs. The helper reads no device, waits for no frame and installs no interrupt handler.

Ownership Fields
Retain between calls C0–C15
Supply before service SEED and REPLACEMENT
Read after service CHANGED and VALID

A separate membership map distinguishes cells reached from the seed from cells that happened to have the replacement colour already. Repeated scans grow that membership until a scan adds nothing; only then are colours changed.

Reusable initialisation and service

component.inc
; SPDX-License-Identifier: MIT
; Fill a Connected Grid Region. See README.md for the byte interface and ownership.
; init clears the public fields and private workspace; set inputs afterwards.
bounded_flood_fill_init:
    move.b #0,d0
    move.b d0,SEED
    move.b d0,REPLACEMENT
    move.b d0,CHANGED
    move.b d0,VALID
    move.b d0,C0
    move.b d0,C1
    move.b d0,C2
    move.b d0,C3
    move.b d0,C4
    move.b d0,C5
    move.b d0,C6
    move.b d0,C7
    move.b d0,C8
    move.b d0,C9
    move.b d0,C10
    move.b d0,C11
    move.b d0,C12
    move.b d0,C13
    move.b d0,C14
    move.b d0,C15
    move.b d0,T0
    move.b d0,T1
    move.b d0,T2
    move.b d0,T3
    move.b d0,T4
    move.b d0,T5
    move.b d0,T6
    move.b d0,T7
    move.b d0,EXPR_SAVE
    move.b d0,V0
    move.b d0,V1
    move.b d0,V2
    move.b d0,V3
    move.b d0,V4
    move.b d0,V5
    move.b d0,V6
    move.b d0,V7
    move.b d0,V8
    move.b d0,V9
    move.b d0,V10
    move.b d0,V11
    move.b d0,V12
    move.b d0,V13
    move.b d0,V14
    move.b d0,V15
    rts
bounded_flood_fill_step:
; VALID = 0
    move.b #0,d0
    move.b d0,VALID
; CHANGED = 0
    move.b #0,d0
    move.b d0,CHANGED
; if SEED >= 16:
    move.b SEED,d0
    cmp.b #16,d0
    bcc bounded_flood_fill_L1
    jmp bounded_flood_fill_L2
bounded_flood_fill_L1:
; return
    rts
    jmp bounded_flood_fill_L3
bounded_flood_fill_L2:
bounded_flood_fill_L3:
; VALID = 1
    move.b #1,d0
    move.b d0,VALID
; T0 = C[SEED]
    moveq #0,d1
    move.b SEED,d1
    lea C0,a0
    move.b 0(a0,d1.w),d0
    move.b d0,T0
; if T0 == REPLACEMENT:
    move.b T0,d0
    move.b REPLACEMENT,d1
    cmp.b d1,d0
    beq bounded_flood_fill_L4
    jmp bounded_flood_fill_L5
bounded_flood_fill_L4:
; return
    rts
    jmp bounded_flood_fill_L6
bounded_flood_fill_L5:
bounded_flood_fill_L6:
; T1 = 0
    move.b #0,d0
    move.b d0,T1
; while T1 < 16:
bounded_flood_fill_L7:
    move.b T1,d0
    cmp.b #16,d0
    bcs bounded_flood_fill_L8
    jmp bounded_flood_fill_L9
bounded_flood_fill_L8:
; V[T1] = 0
    move.b #0,d0
    move.b d0,d2
    moveq #0,d1
    move.b T1,d1
    lea V0,a0
    move.b d2,0(a0,d1.w)
; T1 = T1 + 1
    move.b T1,d0
    add.b #1,d0
    move.b d0,T1
    jmp bounded_flood_fill_L7
bounded_flood_fill_L9:
; V[SEED] = 1
    move.b #1,d0
    move.b d0,d2
    moveq #0,d1
    move.b SEED,d1
    lea V0,a0
    move.b d2,0(a0,d1.w)
; T2 = 1
    move.b #1,d0
    move.b d0,T2
; while T2 != 0:
bounded_flood_fill_L10:
    move.b T2,d0
    cmp.b #0,d0
    bne bounded_flood_fill_L11
    jmp bounded_flood_fill_L12
bounded_flood_fill_L11:
; T2 = 0
    move.b #0,d0
    move.b d0,T2
; T1 = 0
    move.b #0,d0
    move.b d0,T1
; while T1 < 16:
bounded_flood_fill_L13:
    move.b T1,d0
    cmp.b #16,d0
    bcs bounded_flood_fill_L14
    jmp bounded_flood_fill_L15
bounded_flood_fill_L14:
; T3 = V[T1]
    moveq #0,d1
    move.b T1,d1
    lea V0,a0
    move.b 0(a0,d1.w),d0
    move.b d0,T3
; if T3 == 0:
    move.b T3,d0
    cmp.b #0,d0
    beq bounded_flood_fill_L16
    jmp bounded_flood_fill_L17
bounded_flood_fill_L16:
; T3 = C[T1]
    moveq #0,d1
    move.b T1,d1
    lea C0,a0
    move.b 0(a0,d1.w),d0
    move.b d0,T3
; if T3 == T0:
    move.b T3,d0
    move.b T0,d1
    cmp.b d1,d0
    beq bounded_flood_fill_L19
    jmp bounded_flood_fill_L20
bounded_flood_fill_L19:
; T4 = 0
    move.b #0,d0
    move.b d0,T4
; T5 = T1 & 3
    move.b T1,d0
    and.b #3,d0
    move.b d0,T5
; if T5 != 0:
    move.b T5,d0
    cmp.b #0,d0
    bne bounded_flood_fill_L22
    jmp bounded_flood_fill_L23
bounded_flood_fill_L22:
; T6 = T1 - 1
    move.b T1,d0
    sub.b #1,d0
    move.b d0,T6
; T4 = V[T6]
    moveq #0,d1
    move.b T6,d1
    lea V0,a0
    move.b 0(a0,d1.w),d0
    move.b d0,T4
    jmp bounded_flood_fill_L24
bounded_flood_fill_L23:
bounded_flood_fill_L24:
; if T5 != 3:
    move.b T5,d0
    cmp.b #3,d0
    bne bounded_flood_fill_L25
    jmp bounded_flood_fill_L26
bounded_flood_fill_L25:
; T6 = T1 + 1
    move.b T1,d0
    add.b #1,d0
    move.b d0,T6
; T7 = V[T6]
    moveq #0,d1
    move.b T6,d1
    lea V0,a0
    move.b 0(a0,d1.w),d0
    move.b d0,T7
; T4 = T4 | T7
    move.b T4,d0
    move.b T7,d1
    or.b d1,d0
    move.b d0,T4
    jmp bounded_flood_fill_L27
bounded_flood_fill_L26:
bounded_flood_fill_L27:
; if T1 >= 4:
    move.b T1,d0
    cmp.b #4,d0
    bcc bounded_flood_fill_L28
    jmp bounded_flood_fill_L29
bounded_flood_fill_L28:
; T6 = T1 - 4
    move.b T1,d0
    sub.b #4,d0
    move.b d0,T6
; T7 = V[T6]
    moveq #0,d1
    move.b T6,d1
    lea V0,a0
    move.b 0(a0,d1.w),d0
    move.b d0,T7
; T4 = T4 | T7
    move.b T4,d0
    move.b T7,d1
    or.b d1,d0
    move.b d0,T4
    jmp bounded_flood_fill_L30
bounded_flood_fill_L29:
bounded_flood_fill_L30:
; if T1 < 12:
    move.b T1,d0
    cmp.b #12,d0
    bcs bounded_flood_fill_L31
    jmp bounded_flood_fill_L32
bounded_flood_fill_L31:
; T6 = T1 + 4
    move.b T1,d0
    add.b #4,d0
    move.b d0,T6
; T7 = V[T6]
    moveq #0,d1
    move.b T6,d1
    lea V0,a0
    move.b 0(a0,d1.w),d0
    move.b d0,T7
; T4 = T4 | T7
    move.b T4,d0
    move.b T7,d1
    or.b d1,d0
    move.b d0,T4
    jmp bounded_flood_fill_L33
bounded_flood_fill_L32:
bounded_flood_fill_L33:
; if T4 != 0:
    move.b T4,d0
    cmp.b #0,d0
    bne bounded_flood_fill_L34
    jmp bounded_flood_fill_L35
bounded_flood_fill_L34:
; V[T1] = 1
    move.b #1,d0
    move.b d0,d2
    moveq #0,d1
    move.b T1,d1
    lea V0,a0
    move.b d2,0(a0,d1.w)
; T2 = 1
    move.b #1,d0
    move.b d0,T2
    jmp bounded_flood_fill_L36
bounded_flood_fill_L35:
bounded_flood_fill_L36:
    jmp bounded_flood_fill_L21
bounded_flood_fill_L20:
bounded_flood_fill_L21:
    jmp bounded_flood_fill_L18
bounded_flood_fill_L17:
bounded_flood_fill_L18:
; T1 = T1 + 1
    move.b T1,d0
    add.b #1,d0
    move.b d0,T1
    jmp bounded_flood_fill_L13
bounded_flood_fill_L15:
    jmp bounded_flood_fill_L10
bounded_flood_fill_L12:
; T1 = 0
    move.b #0,d0
    move.b d0,T1
; while T1 < 16:
bounded_flood_fill_L37:
    move.b T1,d0
    cmp.b #16,d0
    bcs bounded_flood_fill_L38
    jmp bounded_flood_fill_L39
bounded_flood_fill_L38:
; T3 = V[T1]
    moveq #0,d1
    move.b T1,d1
    lea V0,a0
    move.b 0(a0,d1.w),d0
    move.b d0,T3
; if T3 != 0:
    move.b T3,d0
    cmp.b #0,d0
    bne bounded_flood_fill_L40
    jmp bounded_flood_fill_L41
bounded_flood_fill_L40:
; C[T1] = REPLACEMENT
    move.b REPLACEMENT,d0
    move.b d0,d2
    moveq #0,d1
    move.b T1,d1
    lea C0,a0
    move.b d2,0(a0,d1.w)
; CHANGED = CHANGED + 1
    move.b CHANGED,d0
    add.b #1,d0
    move.b d0,CHANGED
    jmp bounded_flood_fill_L42
bounded_flood_fill_L41:
bounded_flood_fill_L42:
; T1 = T1 + 1
    move.b T1,d0
    add.b #1,d0
    move.b d0,T1
    jmp bounded_flood_fill_L37
bounded_flood_fill_L39:
    rts
component_end:

Machine contract

D0–D3/A0–A1/CCR may change; D4–D7/A2–A6 are preserved. A direct BSR/JSR needs four return-address stack bytes. The helper makes no nested calls and adds no other stack use. Its named scratch is private workspace, not a pointer, a ROM variable or shared zero-page space that the game may borrow concurrently. Scope or rename routine and field labels and allocate a separate block for each independent instance. Give each block one mutation owner.

The A500 OCS diagnostic cold-boots an OFS disk, owns the Copper and bitplane and disables interrupt/DMA sources. The helper does not take over hardware or allocate Chip RAM.

Adapt the caller

demo.asm supplies the bindings and include order. exercise.inc first runs table cases, then a separate client retaining state between calls. A game can call the public step entry directly and remove the diagnostic packet and display. Do not copy the diagnostic’s hardware takeover into an existing game loop.

Build with make ASM198X=/path/to/asm198x and BUILD198X=/path/to/build198x. The Makefile produces normal, custom, deliberately wrong and repaired programs. Tools must already be installed; the sample downloads nothing.

Bindings and include order

demo.asm
    section code,code_c
CUSTOM = 0
BROKEN = 0
COYOTE_STEPS = 4
BUFFER_STEPS = 4
TEXT_CAP = 8
PROPERTY_COUNT = 16
STREAM_BYTES = 13
CRC_POLY = 7
    include "caller.inc"
    include "exercise.inc"
component_start:
    include "component.inc"
    even
    include "data.inc"
    include "cases.inc"
    even
    include "display.inc"
    include "../../framework/turn-deadline/font.inc"
code_end:
STATE:
SEED: dc.b 0
REPLACEMENT: dc.b 0
CHANGED: dc.b 0
VALID: dc.b 0
C0: dc.b 0
C1: dc.b 0
C2: dc.b 0
C3: dc.b 0
C4: dc.b 0
C5: dc.b 0
C6: dc.b 0
C7: dc.b 0
C8: dc.b 0
C9: dc.b 0
C10: dc.b 0
C11: dc.b 0
C12: dc.b 0
C13: dc.b 0
C14: dc.b 0
C15: dc.b 0
T0: dc.b 0
T1: dc.b 0
T2: dc.b 0
T3: dc.b 0
T4: dc.b 0
T5: dc.b 0
T6: dc.b 0
T7: dc.b 0
EXPR_SAVE: dc.b 0
V0: dc.b 0
V1: dc.b 0
V2: dc.b 0
V3: dc.b 0
V4: dc.b 0
V5: dc.b 0
V6: dc.b 0
V7: dc.b 0
V8: dc.b 0
V9: dc.b 0
V10: dc.b 0
V11: dc.b 0
V12: dc.b 0
V13: dc.b 0
V14: dc.b 0
V15: dc.b 0
    even
ready: dc.w 0
preview: dcb.b 8,0
OUTPUT: dcb.b 1300,0
    even
signature: dc.b "198XGAMEKIT0000",0
    even
copperlist:
    dc.w $08e,$2c81,$090,$2cc1,$092,$0038,$094,$00d0
    dc.w $100,$1200,$102,0,$104,0,$108,0,$10a,0
    dc.w $180,$012,$182,$fff
copbpl:
    dc.w $0e0,0,$0e2,0
    dc.w $ffff,$fffe
plane: dcb.b 10240,0

A client retaining state between calls

exercise.inc, excerpt
preview_rules:
    ifne CUSTOM
; SEED = 15
    move.b #15,d0
    move.b d0,SEED
; REPLACEMENT = 9
    move.b #9,d0
    move.b d0,REPLACEMENT
; C0 = 1
    move.b #1,d0
    move.b d0,C0
; C1 = 1
    move.b #1,d0
    move.b d0,C1
; C4 = 1
    move.b #1,d0
    move.b d0,C4
; C5 = 2
    move.b #2,d0
    move.b d0,C5
; C15 = 1
    move.b #1,d0
    move.b d0,C15
    ifne BROKEN
; SEED = 15
    move.b #15,d0
    move.b d0,SEED
    endif
    bsr checked_step
    bsr emit_state
    rts
    else
; SEED = 0
    move.b #0,d0
    move.b d0,SEED
; REPLACEMENT = 9
    move.b #9,d0
    move.b d0,REPLACEMENT
; C0 = 1
    move.b #1,d0
    move.b d0,C0
; C1 = 1
    move.b #1,d0
    move.b d0,C1
; C4 = 1
    move.b #1,d0
    move.b d0,C4
; C5 = 2
    move.b #2,d0
    move.b d0,C5
; C15 = 1
    move.b #1,d0
    move.b d0,C15
    ifne BROKEN
; SEED = 15
    move.b #15,d0
    move.b d0,SEED
    endif
    bsr checked_step
    bsr emit_state
    endif
    rts

Customise it

Seed the disconnected bottom-right cell instead of the upper-left region. The maintained custom caller changes its inputs or client sequence rather than hiding a different implementation behind the same label. Compare every state of the two clients, not only their final display.

Custom client selection

custom.asm
    section code,code_c
CUSTOM = 1
BROKEN = 0
COYOTE_STEPS = 2
BUFFER_STEPS = 2
TEXT_CAP = 4
PROPERTY_COUNT = 16
STREAM_BYTES = 13
CRC_POLY = 49
    include "caller.inc"
    include "exercise.inc"
component_start:
    include "component.inc"
    even
    include "data.inc"
    include "cases.inc"
    even
    include "display.inc"
    include "../../framework/turn-deadline/font.inc"
code_end:
STATE:
SEED: dc.b 0
REPLACEMENT: dc.b 0
CHANGED: dc.b 0
VALID: dc.b 0
C0: dc.b 0
C1: dc.b 0
C2: dc.b 0
C3: dc.b 0
C4: dc.b 0
C5: dc.b 0
C6: dc.b 0
C7: dc.b 0
C8: dc.b 0
C9: dc.b 0
C10: dc.b 0
C11: dc.b 0
C12: dc.b 0
C13: dc.b 0
C14: dc.b 0
C15: dc.b 0
T0: dc.b 0
T1: dc.b 0
T2: dc.b 0
T3: dc.b 0
T4: dc.b 0
T5: dc.b 0
T6: dc.b 0
T7: dc.b 0
EXPR_SAVE: dc.b 0
V0: dc.b 0
V1: dc.b 0
V2: dc.b 0
V3: dc.b 0
V4: dc.b 0
V5: dc.b 0
V6: dc.b 0
V7: dc.b 0
V8: dc.b 0
V9: dc.b 0
V10: dc.b 0
V11: dc.b 0
V12: dc.b 0
V13: dc.b 0
V14: dc.b 0
V15: dc.b 0
    even
ready: dc.w 0
preview: dcb.b 8,0
OUTPUT: dcb.b 1300,0
    even
signature: dc.b "198XGAMEKIT0000",0
    even
copperlist:
    dc.w $08e,$2c81,$090,$2cc1,$092,$0038,$094,$00d0
    dc.w $100,$1200,$102,0,$104,0,$108,0,$10a,0
    dc.w $180,$012,$182,$fff
copbpl:
    dc.w $0e0,0,$0e2,0
    dc.w $ffff,$fffe
plane: dcb.b 10240,0

The custom diagnostic row is 0F 09 01 01 01 01 00 00. The full client trace in the source explains how it gets there.

Mistake and repair

The wrong caller always supplies SEED=15. It changes the disconnected bottom-right region instead of the selected upper-left region. Convert the selected cell to a checked row-major index, then pass that index unchanged.

The BROKEN branch lives in the sequential client, not the reusable helper. wrong.asm selects it; repaired.asm restores the normal call sequence. The repaired executable matches the normal program (for Spectrum, compare loaded CODE rather than the tape filename).

Select the deliberately wrong client

wrong.asm
    section code,code_c
CUSTOM = 0
BROKEN = 1
COYOTE_STEPS = 4
BUFFER_STEPS = 4
TEXT_CAP = 8
PROPERTY_COUNT = 16
STREAM_BYTES = 13
CRC_POLY = 7
    include "caller.inc"
    include "exercise.inc"
component_start:
    include "component.inc"
    even
    include "data.inc"
    include "cases.inc"
    even
    include "display.inc"
    include "../../framework/turn-deadline/font.inc"
code_end:
STATE:
SEED: dc.b 0
REPLACEMENT: dc.b 0
CHANGED: dc.b 0
VALID: dc.b 0
C0: dc.b 0
C1: dc.b 0
C2: dc.b 0
C3: dc.b 0
C4: dc.b 0
C5: dc.b 0
C6: dc.b 0
C7: dc.b 0
C8: dc.b 0
C9: dc.b 0
C10: dc.b 0
C11: dc.b 0
C12: dc.b 0
C13: dc.b 0
C14: dc.b 0
C15: dc.b 0
T0: dc.b 0
T1: dc.b 0
T2: dc.b 0
T3: dc.b 0
T4: dc.b 0
T5: dc.b 0
T6: dc.b 0
T7: dc.b 0
EXPR_SAVE: dc.b 0
V0: dc.b 0
V1: dc.b 0
V2: dc.b 0
V3: dc.b 0
V4: dc.b 0
V5: dc.b 0
V6: dc.b 0
V7: dc.b 0
V8: dc.b 0
V9: dc.b 0
V10: dc.b 0
V11: dc.b 0
V12: dc.b 0
V13: dc.b 0
V14: dc.b 0
V15: dc.b 0
    even
ready: dc.w 0
preview: dcb.b 8,0
OUTPUT: dcb.b 1300,0
    even
signature: dc.b "198XGAMEKIT0000",0
    even
copperlist:
    dc.w $08e,$2c81,$090,$2cc1,$092,$0038,$094,$00d0
    dc.w $100,$1200,$102,0,$104,0,$108,0,$10a,0
    dc.w $180,$012,$182,$fff
copbpl:
    dc.w $0e0,0,$0e2,0
    dc.w $ffff,$fffe
plane: dcb.b 10240,0
Amiga shows the deliberate error row 0F 09 01 01 01 01 00 00.
The wrong client completes with 0F 09 01 01 01 01 00 00; its changed inputs and state explain the result.

Cost and alternatives

The measured helper extent is 1026 code bytes; public state is 20 bytes and private scratch is 25 bytes. There are no immutable helper tables. Caller data, the test cases, return-address stack, alignment and display buffers cost additional space. These are assembled sizes, not cycle measurements.

Repeated full scans deliberately favour a small fixed workspace over a queue. At most fifteen growth scans can add cells, followed by a terminating scan. Larger or frame-budgeted maps need a different implementation.

The fixed 16-cell scan trades a queue for sixteen scratch membership bytes. It may scan repeatedly; larger maps should use an explicit bounded queue or span fill and budget work across frames. Diagonal contact is not connectivity. It is not a complete navigation solver.

Execution evidence

Four variants run on A500 OCS PAL, Kickstart1.3 OFS cold boot, using Asm198x 0.0.72, Emu198x 0.44.2 and Build198x 0.2.9. Each executes 50 boundary/varied/error table cases, dirty initialisation and the separate retained-state client. An independent mathematical/container model checks every public byte after every call. This is bounded example coverage, not exhaustive correctness for every possible state.

The records retain loaded immutable code, completion, register sentinels, full packets, source/tool/firmware hashes and captures. The public gate validates these retained observations and rejects altered evidence; it does not run restricted firmware. No firmware is distributed. The eight displayed bytes are the first eight public fields, zero-padded when shorter; the packet includes every field.

Where it fits

Tile-map queries: The fill changes a connected region in storage; a separate map query or redraw path can consume that result.

The Craft · Maths for Games · Source and native evidence.