A pause screen should not quietly spend the player’s time allowance.
Use it in a project
RESET takes priority and clears the 16-bit low-byte-first active counter. Otherwise PAUSED nonzero freezes it; a running call adds one modulo 65,536. Inputs remain caller-owned. The clock measures serviced active ticks, not seconds.
Include component.inc once (MOS callers include the shared 6502 implementation through it). Reserve the public fields in this exact order: TIME_LO, TIME_HI, PAUSED, RESET. They occupy 4 contiguous bytes. Also reserve the private workspace: none (0 bytes). Array names in the explanation refer to the numbered consecutive bindings, such as C0, C1 and so on.
Call pause_clock_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 pause_clock_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 | TIME_LO and TIME_HI |
| Supply before service | PAUSED and RESET |
| Read after service | the two counter bytes |
A display frame and an active play tick are different events. The clock deliberately counts only the latter. You can keep an always-running clock alongside it for menus or pause-screen animation.
Reusable initialisation and service
; SPDX-License-Identifier: MIT
; Count Active Play Time. See README.md for the byte interface and ownership.
; init clears the public fields and private workspace; set inputs afterwards.
pause_clock_init:
lda #0
sta TIME_LO
sta TIME_HI
sta PAUSED
sta RESET
rts
pause_clock_step:
; if RESET != 0:
lda RESET
cmp #0
bne pause_clock_L4
pause_clock_L5:
jmp pause_clock_L2
pause_clock_L4:
jmp pause_clock_L1
pause_clock_L1:
; TIME_LO = 0
lda #0
sta TIME_LO
; TIME_HI = 0
lda #0
sta TIME_HI
; return
rts
jmp pause_clock_L3
pause_clock_L2:
pause_clock_L3:
; if PAUSED != 0:
lda PAUSED
cmp #0
bne pause_clock_L9
pause_clock_L10:
jmp pause_clock_L7
pause_clock_L9:
jmp pause_clock_L6
pause_clock_L6:
; return
rts
jmp pause_clock_L8
pause_clock_L7:
pause_clock_L8:
; TIME_LO = TIME_LO + 1
lda TIME_LO
clc
adc #1
sta TIME_LO
; if TIME_LO == 0:
lda TIME_LO
cmp #0
beq pause_clock_L14
pause_clock_L15:
jmp pause_clock_L12
pause_clock_L14:
jmp pause_clock_L11
pause_clock_L11:
; TIME_HI = TIME_HI + 1
lda TIME_HI
clc
adc #1
sta TIME_HI
jmp pause_clock_L13
pause_clock_L12:
pause_clock_L13:
rts
component_end:Machine contract
A/X/status may change; Y and decimal mode are preserved. Use CLD for binary arithmetic. A direct JSR needs two 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 diagnostic PRG owns screen, font and colour RAM and disables interrupts; it does not return to BASIC. The reusable helper does none of those things.
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. The Makefile produces normal, custom, deliberately wrong and repaired programs. Tools must already be installed; the sample downloads nothing.
Bindings and include order
TIME_LO=$80
TIME_HI=$81
PAUSED=$82
RESET=$83
STATE=$80
input_ptr=$70
cases_left=$72
ptr=$74
saved_y=$76
OUTPUT=$c000
preview=OUTPUT+1400
ready=OUTPUT+1408
CUSTOM=0
BROKEN=0
COYOTE_STEPS=4
BUFFER_STEPS=4
TEXT_CAP=8
PROPERTY_COUNT=16
STREAM_BYTES=13
CRC_POLY=7
!source "caller.inc"
!source "exercise.inc"
component_start:
!source "component.inc"
!source "data.inc"
!source "cases.inc"
hex_font:
!byte 0,0,0,0,0,0,0,0,0,56,40,40,40,56,0,0,0,16,48,16,16,56,0,0,0,56,8,56,32,56,0,0,0,56,8,56,8,56,0,0,0,40,40,56,8,8,0,0,0,56,32,56,8,56,0,0,0,56,32,56,40,56,0,0,0,56,8,8,8,8,0,0,0,56,40,56,40,56,0,0,0,56,40,56,8,56,0,0,0,16,40,56,40,40,0,0,0,48,40,48,40,48,0,0,0,56,32,32,32,56,0,0,0,48,40,40,40,48,0,0,0,56,32,48,32,56,0,0,0,56,32,48,32,32,0,0
code_end:A client retaining state between calls
preview_rules:
!if CUSTOM {
; TIME_LO = 255
lda #255
sta TIME_LO
!if BROKEN {
; PAUSED = 0
lda #0
sta PAUSED
}
jsr checked_step
jsr emit_state
!if BROKEN {
; PAUSED = 0
lda #0
sta PAUSED
}
jsr checked_step
jsr emit_state
; PAUSED = 1
lda #1
sta PAUSED
!if BROKEN {
; PAUSED = 0
lda #0
sta PAUSED
}
jsr checked_step
jsr emit_state
!if BROKEN {
; PAUSED = 0
lda #0
sta PAUSED
}
jsr checked_step
jsr emit_state
; PAUSED = 0
lda #0
sta PAUSED
!if BROKEN {
; PAUSED = 0
lda #0
sta PAUSED
}
jsr checked_step
jsr emit_state
!if BROKEN {
; PAUSED = 0
lda #0
sta PAUSED
}
jsr checked_step
jsr emit_state
rts
} else {
!if BROKEN {
; PAUSED = 0
lda #0
sta PAUSED
}
jsr checked_step
jsr emit_state
!if BROKEN {
; PAUSED = 0
lda #0
sta PAUSED
}
jsr checked_step
jsr emit_state
; PAUSED = 1
lda #1
sta PAUSED
!if BROKEN {
; PAUSED = 0
lda #0
sta PAUSED
}
jsr checked_step
jsr emit_state
!if BROKEN {
; PAUSED = 0
lda #0
sta PAUSED
}
jsr checked_step
jsr emit_state
; PAUSED = 0
lda #0
sta PAUSED
!if BROKEN {
; PAUSED = 0
lda #0
sta PAUSED
}
jsr checked_step
jsr emit_state
!if BROKEN {
; PAUSED = 0
lda #0
sta PAUSED
}
jsr checked_step
jsr emit_state
}
rtsCustomise it
Begin at 255 to exercise the carry into the high byte. 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
TIME_LO=$80
TIME_HI=$81
PAUSED=$82
RESET=$83
STATE=$80
input_ptr=$70
cases_left=$72
ptr=$74
saved_y=$76
OUTPUT=$c000
preview=OUTPUT+1400
ready=OUTPUT+1408
CUSTOM=1
BROKEN=0
COYOTE_STEPS=2
BUFFER_STEPS=2
TEXT_CAP=4
PROPERTY_COUNT=16
STREAM_BYTES=13
CRC_POLY=49
!source "caller.inc"
!source "exercise.inc"
component_start:
!source "component.inc"
!source "data.inc"
!source "cases.inc"
hex_font:
!byte 0,0,0,0,0,0,0,0,0,56,40,40,40,56,0,0,0,16,48,16,16,56,0,0,0,56,8,56,32,56,0,0,0,56,8,56,8,56,0,0,0,40,40,56,8,8,0,0,0,56,32,56,8,56,0,0,0,56,32,56,40,56,0,0,0,56,8,8,8,8,0,0,0,56,40,56,40,56,0,0,0,56,40,56,8,56,0,0,0,16,40,56,40,40,0,0,0,48,40,48,40,48,0,0,0,56,32,32,32,56,0,0,0,48,40,40,40,48,0,0,0,56,32,48,32,56,0,0,0,56,32,48,32,32,0,0
code_end:The custom diagnostic row is 03 01 00 00 00 00 00 00. The full client trace in the source explains how it gets there.
Mistake and repair
The wrong caller forces PAUSED to zero. Calls made while the pause screen is open still spend active play time. Feed the actual pause state, or deliberately stop servicing the active clock.
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
TIME_LO=$80
TIME_HI=$81
PAUSED=$82
RESET=$83
STATE=$80
input_ptr=$70
cases_left=$72
ptr=$74
saved_y=$76
OUTPUT=$c000
preview=OUTPUT+1400
ready=OUTPUT+1408
CUSTOM=0
BROKEN=1
COYOTE_STEPS=4
BUFFER_STEPS=4
TEXT_CAP=8
PROPERTY_COUNT=16
STREAM_BYTES=13
CRC_POLY=7
!source "caller.inc"
!source "exercise.inc"
component_start:
!source "component.inc"
!source "data.inc"
!source "cases.inc"
hex_font:
!byte 0,0,0,0,0,0,0,0,0,56,40,40,40,56,0,0,0,16,48,16,16,56,0,0,0,56,8,56,32,56,0,0,0,56,8,56,8,56,0,0,0,40,40,56,8,8,0,0,0,56,32,56,8,56,0,0,0,56,32,56,40,56,0,0,0,56,8,8,8,8,0,0,0,56,40,56,40,56,0,0,0,56,40,56,8,56,0,0,0,16,40,56,40,40,0,0,0,48,40,48,40,48,0,0,0,56,32,32,32,56,0,0,0,48,40,40,40,48,0,0,0,56,32,48,32,56,0,0,0,56,32,48,32,32,0,0
code_end:
Cost and alternatives
The measured helper extent is 81 code bytes; public state is 4 bytes and private scratch is 0 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; carry into the high byte occurs only on a low-byte wrap. A wider counter extends the range at the cost of state and carry handling.
Do not mix this active clock with a deadline taken from a continuously running hardware counter. Longer sessions need wider storage or explicit wrap-aware comparisons.
Execution evidence
Four variants run on PAL stock-ROM PRG, using Asm198x 0.0.72, Emu198x 0.44.2. 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
Rational tick division: Rate division decides when a tick is due; the pause policy decides whether active play should consume it.