A short tune needs a clock and a sequence of notes, not a fresh sound effect every frame.
Use it in a project
COUNT is 0–8 pairs N/U. N=0 is rest, 1–95 is a logical note, and 255 ends immediately. Other note codes or a zero duration on a note/rest are invalid. INDEX counts consumed pairs and must not exceed COUNT. If REMAINING is nonzero, decrement it first; when it reaches zero consume the next pair in the same call. A newly emitted note/rest holds for U service intervals, with REMAINING set to U. EVENT=1 emits NOTE; EVENT=2 is a one-shot stop on count exhaustion or N=255. FINISHED is sticky. Validate only the consumed pair before advancing INDEX. Invalid state returns VALID=0 and no event; an elapsed timer may already reach zero.
Include component.inc once (MOS callers include the shared 6502 implementation through it). Reserve the public fields in this exact order: NOTE, EVENT, FINISHED, VALID, INDEX, REMAINING, COUNT, N0, N1, N2, N3, N4, N5, N6, N7, U0, U1, U2, U3, U4, U5, U6, U7. They occupy 23 contiguous bytes. Also reserve the private workspace: T0, T1 (2 bytes). Array names in the explanation refer to the numbered consecutive bindings, such as C0, C1 and so on.
Call music_command_stream_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 music_command_stream_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 | INDEX, REMAINING, FINISHED and NOTE; immutable N/U pairs |
| Supply before service | COUNT and one service tick |
| Read after service | EVENT, NOTE, FINISHED and VALID |
Only consume a pair when its predecessor’s interval has expired. A bounded count prevents reading past the stream; explicit end and exhausted count each emit a stop exactly once.
Reusable initialisation and service
; SPDX-License-Identifier: MIT
; Sequence Counted Notes and Rests. See README.md for the byte interface and ownership.
; init clears the public fields and private workspace; set inputs afterwards.
music_command_stream_init:
ld a,0
ld (NOTE),a
ld (EVENT),a
ld (FINISHED),a
ld (VALID),a
ld (INDEX),a
ld (REMAINING),a
ld (COUNT),a
ld (N0),a
ld (N1),a
ld (N2),a
ld (N3),a
ld (N4),a
ld (N5),a
ld (N6),a
ld (N7),a
ld (U0),a
ld (U1),a
ld (U2),a
ld (U3),a
ld (U4),a
ld (U5),a
ld (U6),a
ld (U7),a
ld (T0),a
ld (T1),a
ret
music_command_stream_step:
; EVENT = 0
ld a,0
ld (EVENT),a
; VALID = 0
ld a,0
ld (VALID),a
; if COUNT > 8:
ld a,(COUNT)
cp 8
jp z,music_command_stream_L2
jp nc,music_command_stream_L1
jp music_command_stream_L2
music_command_stream_L1:
; return
ret
jp music_command_stream_L3
music_command_stream_L2:
music_command_stream_L3:
; if INDEX > COUNT:
ld a,(INDEX)
ld b,a
ld a,(COUNT)
ld c,a
ld a,b
cp c
jp z,music_command_stream_L5
jp nc,music_command_stream_L4
jp music_command_stream_L5
music_command_stream_L4:
; return
ret
jp music_command_stream_L6
music_command_stream_L5:
music_command_stream_L6:
; VALID = 1
ld a,1
ld (VALID),a
; if FINISHED != 0:
ld a,(FINISHED)
cp 0
jp nz,music_command_stream_L7
jp music_command_stream_L8
music_command_stream_L7:
; return
ret
jp music_command_stream_L9
music_command_stream_L8:
music_command_stream_L9:
; if REMAINING != 0:
ld a,(REMAINING)
cp 0
jp nz,music_command_stream_L10
jp music_command_stream_L11
music_command_stream_L10:
; REMAINING = REMAINING - 1
ld a,(REMAINING)
sub 1
ld (REMAINING),a
; if REMAINING != 0:
ld a,(REMAINING)
cp 0
jp nz,music_command_stream_L13
jp music_command_stream_L14
music_command_stream_L13:
; return
ret
jp music_command_stream_L15
music_command_stream_L14:
music_command_stream_L15:
jp music_command_stream_L12
music_command_stream_L11:
music_command_stream_L12:
; if INDEX == COUNT:
ld a,(INDEX)
ld b,a
ld a,(COUNT)
ld c,a
ld a,b
cp c
jp z,music_command_stream_L16
jp music_command_stream_L17
music_command_stream_L16:
; FINISHED = 1
ld a,1
ld (FINISHED),a
; NOTE = 0
ld a,0
ld (NOTE),a
; EVENT = 2
ld a,2
ld (EVENT),a
; return
ret
jp music_command_stream_L18
music_command_stream_L17:
music_command_stream_L18:
; T0 = N[INDEX]
ld a,(INDEX)
ld e,a
ld d,0
ld hl,N0
add hl,de
ld a,(hl)
ld (T0),a
; T1 = U[INDEX]
ld a,(INDEX)
ld e,a
ld d,0
ld hl,U0
add hl,de
ld a,(hl)
ld (T1),a
; if T0 == 255:
ld a,(T0)
cp 255
jp z,music_command_stream_L19
jp music_command_stream_L20
music_command_stream_L19:
; INDEX = INDEX + 1
ld a,(INDEX)
add a,1
ld (INDEX),a
; FINISHED = 1
ld a,1
ld (FINISHED),a
; NOTE = 0
ld a,0
ld (NOTE),a
; EVENT = 2
ld a,2
ld (EVENT),a
; return
ret
jp music_command_stream_L21
music_command_stream_L20:
music_command_stream_L21:
; if T0 > 95:
ld a,(T0)
cp 95
jp z,music_command_stream_L23
jp nc,music_command_stream_L22
jp music_command_stream_L23
music_command_stream_L22:
; VALID = 0
ld a,0
ld (VALID),a
; return
ret
jp music_command_stream_L24
music_command_stream_L23:
music_command_stream_L24:
; if T1 == 0:
ld a,(T1)
cp 0
jp z,music_command_stream_L25
jp music_command_stream_L26
music_command_stream_L25:
; VALID = 0
ld a,0
ld (VALID),a
; return
ret
jp music_command_stream_L27
music_command_stream_L26:
music_command_stream_L27:
; NOTE = T0
ld a,(T0)
ld (NOTE),a
; REMAINING = T1
ld a,(T1)
ld (REMAINING),a
; INDEX = INDEX + 1
ld a,(INDEX)
add a,1
ld (INDEX),a
; EVENT = 1
ld a,1
ld (EVENT),a
ret
component_end:Machine contract
AF/BC/DE/HL may change; IX/IY are preserved. A direct CALL 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. 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 48K diagnostic boots through ROM tape loading and USR, disables interrupts and owns the screen. The helper performs no port or screen writes.
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
org $8000
CUSTOM equ 0
BROKEN equ 0
COYOTE_STEPS equ 4
BUFFER_STEPS equ 4
TEXT_CAP equ 8
PROPERTY_COUNT equ 16
STREAM_BYTES equ 13
CRC_POLY equ 7
include "caller.inc"
include "exercise.inc"
component_start:
include "component.inc"
include "data.inc"
include "cases.inc"
include "../../physics/rectangle-overlap/display.inc"
code_end:
STATE:
NOTE: defb 0
EVENT: defb 0
FINISHED: defb 0
VALID: defb 0
INDEX: defb 0
REMAINING: defb 0
COUNT: defb 0
N0: defb 0
N1: defb 0
N2: defb 0
N3: defb 0
N4: defb 0
N5: defb 0
N6: defb 0
N7: defb 0
U0: defb 0
U1: defb 0
U2: defb 0
U3: defb 0
U4: defb 0
U5: defb 0
U6: defb 0
U7: defb 0
T0: defb 0
T1: defb 0
input_ptr: defw 0
output_ptr: defw 0
cases_left: defb 0
ready: defb 0
preview: defs 8,0
OUTPUT: defs 1300,0
end startA client retaining state between calls
preview_rules:
if CUSTOM
; COUNT = 2
ld a,2
ld (COUNT),a
; N0 = 72
ld a,72
ld (N0),a
; U0 = 1
ld a,1
ld (U0),a
; N1 = 255
ld a,255
ld (N1),a
; U1 = 0
ld a,0
ld (U1),a
if BROKEN
; REMAINING = 0
ld a,0
ld (REMAINING),a
endif
call checked_step
call emit_state
if BROKEN
; REMAINING = 0
ld a,0
ld (REMAINING),a
endif
call checked_step
call emit_state
if BROKEN
; REMAINING = 0
ld a,0
ld (REMAINING),a
endif
call checked_step
call emit_state
ret
else
; COUNT = 3
ld a,3
ld (COUNT),a
; N0 = 40
ld a,40
ld (N0),a
; U0 = 2
ld a,2
ld (U0),a
; N1 = 0
ld a,0
ld (N1),a
; U1 = 1
ld a,1
ld (U1),a
; N2 = 44
ld a,44
ld (N2),a
; U2 = 1
ld a,1
ld (U2),a
if BROKEN
; REMAINING = 0
ld a,0
ld (REMAINING),a
endif
call checked_step
call emit_state
if BROKEN
; REMAINING = 0
ld a,0
ld (REMAINING),a
endif
call checked_step
call emit_state
if BROKEN
; REMAINING = 0
ld a,0
ld (REMAINING),a
endif
call checked_step
call emit_state
endif
retCustomise it
Play one higher note then an explicit end command, whose duration is ignored. 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
org $8000
CUSTOM equ 1
BROKEN equ 0
COYOTE_STEPS equ 2
BUFFER_STEPS equ 2
TEXT_CAP equ 4
PROPERTY_COUNT equ 16
STREAM_BYTES equ 13
CRC_POLY equ 49
include "caller.inc"
include "exercise.inc"
component_start:
include "component.inc"
include "data.inc"
include "cases.inc"
include "../../physics/rectangle-overlap/display.inc"
code_end:
STATE:
NOTE: defb 0
EVENT: defb 0
FINISHED: defb 0
VALID: defb 0
INDEX: defb 0
REMAINING: defb 0
COUNT: defb 0
N0: defb 0
N1: defb 0
N2: defb 0
N3: defb 0
N4: defb 0
N5: defb 0
N6: defb 0
N7: defb 0
U0: defb 0
U1: defb 0
U2: defb 0
U3: defb 0
U4: defb 0
U5: defb 0
U6: defb 0
U7: defb 0
T0: defb 0
T1: defb 0
input_ptr: defw 0
output_ptr: defw 0
cases_left: defb 0
ready: defb 0
preview: defs 8,0
OUTPUT: defs 1300,0
end startThe custom diagnostic row is 00 00 01 01 02 00 02 48. The full client trace in the source explains how it gets there.
Mistake and repair
The wrong client discards each note’s hold time. It advances to a rest or next note one service too early. Retain REMAINING and use one consistent service 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
org $8000
CUSTOM equ 0
BROKEN equ 1
COYOTE_STEPS equ 4
BUFFER_STEPS equ 4
TEXT_CAP equ 8
PROPERTY_COUNT equ 16
STREAM_BYTES equ 13
CRC_POLY equ 7
include "caller.inc"
include "exercise.inc"
component_start:
include "component.inc"
include "data.inc"
include "cases.inc"
include "../../physics/rectangle-overlap/display.inc"
code_end:
STATE:
NOTE: defb 0
EVENT: defb 0
FINISHED: defb 0
VALID: defb 0
INDEX: defb 0
REMAINING: defb 0
COUNT: defb 0
N0: defb 0
N1: defb 0
N2: defb 0
N3: defb 0
N4: defb 0
N5: defb 0
N6: defb 0
N7: defb 0
U0: defb 0
U1: defb 0
U2: defb 0
U3: defb 0
U4: defb 0
U5: defb 0
U6: defb 0
U7: defb 0
T0: defb 0
T1: defb 0
input_ptr: defw 0
output_ptr: defw 0
cases_left: defb 0
ready: defb 0
preview: defs 8,0
OUTPUT: defs 1300,0
end start
Cost and alternatives
The measured helper extent is 356 code bytes; public state is 23 bytes and private scratch is 2 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.
One pair at most per service, with no scan over instant commands. Rich formats can add instrument/loop commands, but need a command budget to stop malformed streams looping forever.
This is a logical sequencer, not an audible chip driver, tracker, tempo converter or general music format. The caller maps note numbers to chip periods and handles rest/stop by silencing its owned voice. SID, APU and Paula have different tuning, envelope and channel rules; Spectrum beeper playback also consumes CPU time. No emitted PCM or audible-timing claim is made by the state diagnostic.
Execution evidence
Four variants run on 48K PAL ROM tape load and USR, using Asm198x 0.0.72, Emu198x 0.44.2. Each executes 43 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
Logical envelope: Drive the existing logical envelope or the documented machine sound trigger from note events; avoid retriggering on every held tick.