A round pickup should not become a square just because a box test was convenient.
Use it in a project
All coordinates and RADIUS are unsigned bytes in the same non-wrapping coordinate space. Return absolute DX/DY and HIT=1 when DX²+DY²≤RADIUS², including the boundary. Radius zero accepts only the centre. Inputs are preserved.
Include component.inc once (MOS callers include the shared 6502 implementation through it). Reserve the public fields in this exact order: HIT, DX, DY, POINT_X, POINT_Y, CENTRE_X, CENTRE_Y, RADIUS. They occupy 8 contiguous bytes. Also reserve the private workspace: T0, T1, T2, T3, T4, T5, T6, T7, T8, T9 (10 bytes). Array names in the explanation refer to the numbered consecutive bindings, such as C0, C1 and so on.
Call point_circle_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 point_circle_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 | none |
| Supply before service | POINT_X, POINT_Y, CENTRE_X, CENTRE_Y and RADIUS |
| Read after service | HIT, DX and DY |
Reject a point outside the radius on either axis first. For a surviving point, compare the second squared displacement with the squared-radius budget left after the first. No square root is needed.
Reusable initialisation and service
; SPDX-License-Identifier: MIT
; Test a Point Against a Circle. See README.md for the byte interface and ownership.
; init clears the public fields and private workspace; set inputs afterwards.
point_circle_init:
move.b #0,d0
move.b d0,HIT
move.b d0,DX
move.b d0,DY
move.b d0,POINT_X
move.b d0,POINT_Y
move.b d0,CENTRE_X
move.b d0,CENTRE_Y
move.b d0,RADIUS
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,T8
move.b d0,T9
rts
point_circle_step:
; HIT = 0
move.b #0,d0
move.b d0,HIT
; if POINT_X >= CENTRE_X:
move.b POINT_X,d0
move.b CENTRE_X,d1
cmp.b d1,d0
bcc point_circle_L1
jmp point_circle_L2
point_circle_L1:
; DX = POINT_X - CENTRE_X
move.b POINT_X,d0
move.b CENTRE_X,d1
sub.b d1,d0
move.b d0,DX
jmp point_circle_L3
point_circle_L2:
; DX = CENTRE_X - POINT_X
move.b CENTRE_X,d0
move.b POINT_X,d1
sub.b d1,d0
move.b d0,DX
point_circle_L3:
; if POINT_Y >= CENTRE_Y:
move.b POINT_Y,d0
move.b CENTRE_Y,d1
cmp.b d1,d0
bcc point_circle_L4
jmp point_circle_L5
point_circle_L4:
; DY = POINT_Y - CENTRE_Y
move.b POINT_Y,d0
move.b CENTRE_Y,d1
sub.b d1,d0
move.b d0,DY
jmp point_circle_L6
point_circle_L5:
; DY = CENTRE_Y - POINT_Y
move.b CENTRE_Y,d0
move.b POINT_Y,d1
sub.b d1,d0
move.b d0,DY
point_circle_L6:
; if DX > RADIUS:
move.b DX,d0
move.b RADIUS,d1
cmp.b d1,d0
bhi point_circle_L7
jmp point_circle_L8
point_circle_L7:
; return
rts
jmp point_circle_L9
point_circle_L8:
point_circle_L9:
; if DY > RADIUS:
move.b DY,d0
move.b RADIUS,d1
cmp.b d1,d0
bhi point_circle_L10
jmp point_circle_L11
point_circle_L10:
; return
rts
jmp point_circle_L12
point_circle_L11:
point_circle_L12:
; T4 = RADIUS
move.b RADIUS,d0
move.b d0,T4
; T5 = 0
move.b #0,d0
move.b d0,T5
; T1 = RADIUS
move.b RADIUS,d0
move.b d0,T1
; T6 = 0
move.b #0,d0
move.b d0,T6
; T7 = 0
move.b #0,d0
move.b d0,T7
; T0 = 8
move.b #8,d0
move.b d0,T0
; while T0 != 0:
point_circle_L13:
move.b T0,d0
cmp.b #0,d0
bne point_circle_L14
jmp point_circle_L15
point_circle_L14:
; T9 = T1 & 1
move.b T1,d0
and.b #1,d0
move.b d0,T9
; if T9 != 0:
move.b T9,d0
cmp.b #0,d0
bne point_circle_L16
jmp point_circle_L17
point_circle_L16:
; T8 = T6
move.b T6,d0
move.b d0,T8
; T6 = T6 + T4
move.b T6,d0
move.b T4,d1
add.b d1,d0
move.b d0,T6
; T9 = 0
move.b #0,d0
move.b d0,T9
; if T6 < T8:
move.b T6,d0
move.b T8,d1
cmp.b d1,d0
bcs point_circle_L19
jmp point_circle_L20
point_circle_L19:
; T9 = 1
move.b #1,d0
move.b d0,T9
jmp point_circle_L21
point_circle_L20:
point_circle_L21:
; T7 = T7 + T5
move.b T7,d0
move.b T5,d1
add.b d1,d0
move.b d0,T7
; T7 = T7 + T9
move.b T7,d0
move.b T9,d1
add.b d1,d0
move.b d0,T7
jmp point_circle_L18
point_circle_L17:
point_circle_L18:
; T9 = T4 >> 7
move.b T4,d0
lsr.b #7,d0
move.b d0,T9
; T4 = T4 << 1
move.b T4,d0
lsl.b #1,d0
move.b d0,T4
; T5 = T5 << 1
move.b T5,d0
lsl.b #1,d0
move.b d0,T5
; T5 = T5 | T9
move.b T5,d0
move.b T9,d1
or.b d1,d0
move.b d0,T5
; T1 = T1 >> 1
move.b T1,d0
lsr.b #1,d0
move.b d0,T1
; T0 = T0 - 1
move.b T0,d0
sub.b #1,d0
move.b d0,T0
jmp point_circle_L13
point_circle_L15:
; T2 = T6
move.b T6,d0
move.b d0,T2
; T3 = T7
move.b T7,d0
move.b d0,T3
; T4 = DX
move.b DX,d0
move.b d0,T4
; T5 = 0
move.b #0,d0
move.b d0,T5
; T1 = DX
move.b DX,d0
move.b d0,T1
; T6 = 0
move.b #0,d0
move.b d0,T6
; T7 = 0
move.b #0,d0
move.b d0,T7
; T0 = 8
move.b #8,d0
move.b d0,T0
; while T0 != 0:
point_circle_L22:
move.b T0,d0
cmp.b #0,d0
bne point_circle_L23
jmp point_circle_L24
point_circle_L23:
; T9 = T1 & 1
move.b T1,d0
and.b #1,d0
move.b d0,T9
; if T9 != 0:
move.b T9,d0
cmp.b #0,d0
bne point_circle_L25
jmp point_circle_L26
point_circle_L25:
; T8 = T6
move.b T6,d0
move.b d0,T8
; T6 = T6 + T4
move.b T6,d0
move.b T4,d1
add.b d1,d0
move.b d0,T6
; T9 = 0
move.b #0,d0
move.b d0,T9
; if T6 < T8:
move.b T6,d0
move.b T8,d1
cmp.b d1,d0
bcs point_circle_L28
jmp point_circle_L29
point_circle_L28:
; T9 = 1
move.b #1,d0
move.b d0,T9
jmp point_circle_L30
point_circle_L29:
point_circle_L30:
; T7 = T7 + T5
move.b T7,d0
move.b T5,d1
add.b d1,d0
move.b d0,T7
; T7 = T7 + T9
move.b T7,d0
move.b T9,d1
add.b d1,d0
move.b d0,T7
jmp point_circle_L27
point_circle_L26:
point_circle_L27:
; T9 = T4 >> 7
move.b T4,d0
lsr.b #7,d0
move.b d0,T9
; T4 = T4 << 1
move.b T4,d0
lsl.b #1,d0
move.b d0,T4
; T5 = T5 << 1
move.b T5,d0
lsl.b #1,d0
move.b d0,T5
; T5 = T5 | T9
move.b T5,d0
move.b T9,d1
or.b d1,d0
move.b d0,T5
; T1 = T1 >> 1
move.b T1,d0
lsr.b #1,d0
move.b d0,T1
; T0 = T0 - 1
move.b T0,d0
sub.b #1,d0
move.b d0,T0
jmp point_circle_L22
point_circle_L24:
; T8 = 0
move.b #0,d0
move.b d0,T8
; if T2 < T6:
move.b T2,d0
move.b T6,d1
cmp.b d1,d0
bcs point_circle_L31
jmp point_circle_L32
point_circle_L31:
; T8 = 1
move.b #1,d0
move.b d0,T8
jmp point_circle_L33
point_circle_L32:
point_circle_L33:
; T2 = T2 - T6
move.b T2,d0
move.b T6,d1
sub.b d1,d0
move.b d0,T2
; T3 = T3 - T7
move.b T3,d0
move.b T7,d1
sub.b d1,d0
move.b d0,T3
; T3 = T3 - T8
move.b T3,d0
move.b T8,d1
sub.b d1,d0
move.b d0,T3
; T4 = DY
move.b DY,d0
move.b d0,T4
; T5 = 0
move.b #0,d0
move.b d0,T5
; T1 = DY
move.b DY,d0
move.b d0,T1
; T6 = 0
move.b #0,d0
move.b d0,T6
; T7 = 0
move.b #0,d0
move.b d0,T7
; T0 = 8
move.b #8,d0
move.b d0,T0
; while T0 != 0:
point_circle_L34:
move.b T0,d0
cmp.b #0,d0
bne point_circle_L35
jmp point_circle_L36
point_circle_L35:
; T9 = T1 & 1
move.b T1,d0
and.b #1,d0
move.b d0,T9
; if T9 != 0:
move.b T9,d0
cmp.b #0,d0
bne point_circle_L37
jmp point_circle_L38
point_circle_L37:
; T8 = T6
move.b T6,d0
move.b d0,T8
; T6 = T6 + T4
move.b T6,d0
move.b T4,d1
add.b d1,d0
move.b d0,T6
; T9 = 0
move.b #0,d0
move.b d0,T9
; if T6 < T8:
move.b T6,d0
move.b T8,d1
cmp.b d1,d0
bcs point_circle_L40
jmp point_circle_L41
point_circle_L40:
; T9 = 1
move.b #1,d0
move.b d0,T9
jmp point_circle_L42
point_circle_L41:
point_circle_L42:
; T7 = T7 + T5
move.b T7,d0
move.b T5,d1
add.b d1,d0
move.b d0,T7
; T7 = T7 + T9
move.b T7,d0
move.b T9,d1
add.b d1,d0
move.b d0,T7
jmp point_circle_L39
point_circle_L38:
point_circle_L39:
; T9 = T4 >> 7
move.b T4,d0
lsr.b #7,d0
move.b d0,T9
; T4 = T4 << 1
move.b T4,d0
lsl.b #1,d0
move.b d0,T4
; T5 = T5 << 1
move.b T5,d0
lsl.b #1,d0
move.b d0,T5
; T5 = T5 | T9
move.b T5,d0
move.b T9,d1
or.b d1,d0
move.b d0,T5
; T1 = T1 >> 1
move.b T1,d0
lsr.b #1,d0
move.b d0,T1
; T0 = T0 - 1
move.b T0,d0
sub.b #1,d0
move.b d0,T0
jmp point_circle_L34
point_circle_L36:
; if T7 > T3:
move.b T7,d0
move.b T3,d1
cmp.b d1,d0
bhi point_circle_L43
jmp point_circle_L44
point_circle_L43:
; return
rts
jmp point_circle_L45
point_circle_L44:
point_circle_L45:
; if T7 == T3:
move.b T7,d0
move.b T3,d1
cmp.b d1,d0
beq point_circle_L46
jmp point_circle_L47
point_circle_L46:
; if T6 > T2:
move.b T6,d0
move.b T2,d1
cmp.b d1,d0
bhi point_circle_L49
jmp point_circle_L50
point_circle_L49:
; return
rts
jmp point_circle_L51
point_circle_L50:
point_circle_L51:
jmp point_circle_L48
point_circle_L47:
point_circle_L48:
; HIT = 1
move.b #1,d0
move.b d0,HIT
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. The samples use fixed symbol bindings. Scope or rename every label and binding, including the component_end measurement marker, and allocate a separate block for each independent instance. Different helpers can also use common field names, so combining them needs separate namespaces or explicitly renamed bindings. 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
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:
HIT: dc.b 0
DX: dc.b 0
DY: dc.b 0
POINT_X: dc.b 0
POINT_Y: dc.b 0
CENTRE_X: dc.b 0
CENTRE_Y: dc.b 0
RADIUS: 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
T8: dc.b 0
T9: dc.b 0
even
ready: dc.w 0
preview: dcb.b 8,0
OUTPUT: dcb.b 1300,0
even
signature: dc.b "198XWORLDKIT000",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,0A client retaining state between calls
preview_rules:
ifne CUSTOM
; POINT_X = 3
move.b #3,d0
move.b d0,POINT_X
; POINT_Y = 4
move.b #4,d0
move.b d0,POINT_Y
; RADIUS = 5
move.b #5,d0
move.b d0,RADIUS
ifne BROKEN
; POINT_Y = CENTRE_Y
move.b CENTRE_Y,d0
move.b d0,POINT_Y
endif
bsr checked_step
bsr emit_state
rts
else
; POINT_X = 4
move.b #4,d0
move.b d0,POINT_X
; POINT_Y = 4
move.b #4,d0
move.b d0,POINT_Y
; RADIUS = 5
move.b #5,d0
move.b d0,RADIUS
ifne BROKEN
; POINT_Y = CENTRE_Y
move.b CENTRE_Y,d0
move.b d0,POINT_Y
endif
bsr checked_step
bsr emit_state
endif
rtsCustomise it
Move onto the familiar 3–4–5 boundary. 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
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:
HIT: dc.b 0
DX: dc.b 0
DY: dc.b 0
POINT_X: dc.b 0
POINT_Y: dc.b 0
CENTRE_X: dc.b 0
CENTRE_Y: dc.b 0
RADIUS: 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
T8: dc.b 0
T9: dc.b 0
even
ready: dc.w 0
preview: dcb.b 8,0
OUTPUT: dcb.b 1300,0
even
signature: dc.b "198XWORLDKIT000",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,0The custom diagnostic row is 01 03 04 03 04 00 00 05. The full client trace in the source explains how it gets there.
Mistake and repair
The wrong caller replaces the point’s vertical coordinate with the centre’s. A point outside the round boundary is tested as though it lay on the horizontal axis. Keep both axes in the same coordinate space.
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
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:
HIT: dc.b 0
DX: dc.b 0
DY: dc.b 0
POINT_X: dc.b 0
POINT_Y: dc.b 0
CENTRE_X: dc.b 0
CENTRE_Y: dc.b 0
RADIUS: 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
T8: dc.b 0
T9: dc.b 0
even
ready: dc.w 0
preview: dcb.b 8,0
OUTPUT: dcb.b 1300,0
even
signature: dc.b "198XWORLDKIT000",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
Cost and alternatives
The measured helper extent is 1296 code bytes; public state is 8 bytes and private scratch is 10 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.
Cheap axis rejection can avoid all three products. Surviving points use three eight-stage byte products. A bounding box can precede the test; a pixel mask can follow it when the actual opaque outline matters.
This is a point/circle test, not circle/circle or pixel-mask collision. Two byte-sized squared axis distances can sum beyond 65,535; the helper avoids that overflow by subtracting DX² from the radius budget before comparing DY².
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 64 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
Rectangle overlap: Use a broad-phase box to discard distant pairs before paying for a more precise shape test.