A score name box and a numeric prompt need different input rules. Reject a bad digit without damaging the value already typed.

Use it in a project
Feed one ASCII CHARACTER. Digits 0–9 extend VALUE if the mathematical result remains 0–255. STATUS=1 accepts, 2 rejects a non-digit, 3 rejects overflow. On either rejection VALUE is unchanged. Call init once to begin a number and keep the value between characters.
Include component.inc once (MOS callers include the shared 6502 implementation through it). Reserve the public fields in this exact order: VALUE, CHARACTER, STATUS. They occupy 3 contiguous bytes. Also reserve the private workspace: T0, T1, T2 (3 bytes). Array names in the explanation refer to the numbered consecutive bindings, such as C0, C1 and so on.
Call decimal_parser_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 decimal_parser_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 | VALUE |
| Supply before service | CHARACTER |
| Read after service | STATUS |
Before multiplying by ten, compare the accepted value with 25. At exactly 25 only a final digit up to five fits. That rejects overflow before it can wrap into an apparently valid small number.
Reusable initialisation and service
; SPDX-License-Identifier: MIT
; Parse a Bounded Decimal Number. See README.md for the byte interface and ownership.
; init clears the public fields and private workspace; set inputs afterwards.
decimal_parser_init:
move.b #0,d0
move.b d0,VALUE
move.b d0,CHARACTER
move.b d0,STATUS
move.b d0,T0
move.b d0,T1
move.b d0,T2
rts
decimal_parser_step:
; STATUS = 2
move.b #2,d0
move.b d0,STATUS
; if CHARACTER < 48:
move.b CHARACTER,d0
cmp.b #48,d0
bcs decimal_parser_L1
jmp decimal_parser_L2
decimal_parser_L1:
; return
rts
jmp decimal_parser_L3
decimal_parser_L2:
decimal_parser_L3:
; if CHARACTER > 57:
move.b CHARACTER,d0
cmp.b #57,d0
bhi decimal_parser_L4
jmp decimal_parser_L5
decimal_parser_L4:
; return
rts
jmp decimal_parser_L6
decimal_parser_L5:
decimal_parser_L6:
; T0 = CHARACTER - 48
move.b CHARACTER,d0
sub.b #48,d0
move.b d0,T0
; STATUS = 3
move.b #3,d0
move.b d0,STATUS
; if VALUE > 25:
move.b VALUE,d0
cmp.b #25,d0
bhi decimal_parser_L7
jmp decimal_parser_L8
decimal_parser_L7:
; return
rts
jmp decimal_parser_L9
decimal_parser_L8:
decimal_parser_L9:
; if VALUE == 25:
move.b VALUE,d0
cmp.b #25,d0
beq decimal_parser_L10
jmp decimal_parser_L11
decimal_parser_L10:
; if T0 > 5:
move.b T0,d0
cmp.b #5,d0
bhi decimal_parser_L13
jmp decimal_parser_L14
decimal_parser_L13:
; return
rts
jmp decimal_parser_L15
decimal_parser_L14:
decimal_parser_L15:
jmp decimal_parser_L12
decimal_parser_L11:
decimal_parser_L12:
; T1 = VALUE << 1
move.b VALUE,d0
lsl.b #1,d0
move.b d0,T1
; T2 = VALUE << 3
move.b VALUE,d0
lsl.b #3,d0
move.b d0,T2
; T1 = T1 + T2
move.b T1,d0
move.b T2,d1
add.b d1,d0
move.b d0,T1
; VALUE = T1 + T0
move.b T1,d0
move.b T0,d1
add.b d1,d0
move.b d0,VALUE
; STATUS = 1
move.b #1,d0
move.b d0,STATUS
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
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:
VALUE: dc.b 0
CHARACTER: dc.b 0
STATUS: dc.b 0
T0: dc.b 0
T1: dc.b 0
T2: 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,0A client retaining state between calls
preview_rules:
ifne CUSTOM
; CHARACTER = 49
move.b #49,d0
move.b d0,CHARACTER
ifne BROKEN
; VALUE = 0
move.b #0,d0
move.b d0,VALUE
endif
bsr checked_step
bsr emit_state
; CHARACTER = 48
move.b #48,d0
move.b d0,CHARACTER
ifne BROKEN
; VALUE = 0
move.b #0,d0
move.b d0,VALUE
endif
bsr checked_step
bsr emit_state
; CHARACTER = 52
move.b #52,d0
move.b d0,CHARACTER
ifne BROKEN
; VALUE = 0
move.b #0,d0
move.b d0,VALUE
endif
bsr checked_step
bsr emit_state
rts
else
; CHARACTER = 50
move.b #50,d0
move.b d0,CHARACTER
ifne BROKEN
; VALUE = 0
move.b #0,d0
move.b d0,VALUE
endif
bsr checked_step
bsr emit_state
; CHARACTER = 53
move.b #53,d0
move.b d0,CHARACTER
ifne BROKEN
; VALUE = 0
move.b #0,d0
move.b d0,VALUE
endif
bsr checked_step
bsr emit_state
; CHARACTER = 54
move.b #54,d0
move.b d0,CHARACTER
ifne BROKEN
; VALUE = 0
move.b #0,d0
move.b d0,VALUE
endif
bsr checked_step
bsr emit_state
; CHARACTER = 53
move.b #53,d0
move.b d0,CHARACTER
ifne BROKEN
; VALUE = 0
move.b #0,d0
move.b d0,VALUE
endif
bsr checked_step
bsr emit_state
endif
rtsCustomise it
Parse 104 rather than the normal 2,5,6,5 sequence. 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:
VALUE: dc.b 0
CHARACTER: dc.b 0
STATUS: dc.b 0
T0: dc.b 0
T1: dc.b 0
T2: 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,0The custom diagnostic row is 68 34 01 00 00 00 00 00. The full client trace in the source explains how it gets there.
Mistake and repair
The wrong caller resets VALUE before every character. The final digit replaces the whole number. Initialise once at the start of input, then retain the accepted prefix through later characters and errors.
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:
VALUE: dc.b 0
CHARACTER: dc.b 0
STATUS: dc.b 0
T0: dc.b 0
T1: dc.b 0
T2: 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
Cost and alternatives
The measured helper extent is 242 code bytes; public state is 3 bytes and private scratch is 3 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.
Constant work per character. Shifts and additions replace multiplication by ten; they are justified only after the overflow precheck.
No sign, whitespace, backspace, decimal point or end-of-line handling is implicit. A prompt owns those actions. Wider integer parsing uses the same precheck idea with a wider quotient and remainder, rather than accepting wrapped results.
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
Text-entry buffers: A text buffer keeps characters for editing; the parser turns accepted digit events into a bounded numeric value.