A velocity of −1 must sort below zero even though its stored byte is 255.

Use it in a project
LEFT and RIGHT hold two’s-complement values −128..127. Return ORDER=0 for less, 1 for equal or 2 for greater. Preserve the input bytes.
Include component.inc once (MOS callers include the shared 6502 implementation through it). Reserve the public fields in this exact order: ORDER, LEFT, RIGHT. They occupy 3 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 signed_byte_order_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 signed_byte_order_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 | LEFT and RIGHT |
| Read after service | ORDER |
Flipping bit seven maps the signed sequence −128..127 onto the unsigned sequence 0..255. The normal unsigned comparison then gives the signed order without subtracting and overflowing.
Reusable initialisation and service
; SPDX-License-Identifier: MIT
; Compare Signed Byte Values. See README.md for the byte interface and ownership.
; init clears the public fields and private workspace; set inputs afterwards.
signed_byte_order_init:
ld a,0
ld (ORDER),a
ld (LEFT),a
ld (RIGHT),a
ld (T0),a
ld (T1),a
ret
signed_byte_order_step:
; T0 = LEFT ^ 128
ld a,(LEFT)
xor 128
ld (T0),a
; T1 = RIGHT ^ 128
ld a,(RIGHT)
xor 128
ld (T1),a
; ORDER = 1
ld a,1
ld (ORDER),a
; if T0 < T1:
ld a,(T0)
ld b,a
ld a,(T1)
ld c,a
ld a,b
cp c
jp c,signed_byte_order_L1
jp signed_byte_order_L2
signed_byte_order_L1:
; ORDER = 0
ld a,0
ld (ORDER),a
jp signed_byte_order_L3
signed_byte_order_L2:
signed_byte_order_L3:
; if T0 > T1:
ld a,(T0)
ld b,a
ld a,(T1)
ld c,a
ld a,b
cp c
jp z,signed_byte_order_L5
jp nc,signed_byte_order_L4
jp signed_byte_order_L5
signed_byte_order_L4:
; ORDER = 2
ld a,2
ld (ORDER),a
jp signed_byte_order_L6
signed_byte_order_L5:
signed_byte_order_L6:
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:
ORDER: defb 0
LEFT: defb 0
RIGHT: 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
; LEFT = 128
ld a,128
ld (LEFT),a
; RIGHT = 127
ld a,127
ld (RIGHT),a
if BROKEN
; LEFT = LEFT & 127
ld a,(LEFT)
and 127
ld (LEFT),a
endif
call checked_step
call emit_state
ret
else
; LEFT = 255
ld a,255
ld (LEFT),a
; RIGHT = 0
ld a,0
ld (RIGHT),a
if BROKEN
; LEFT = LEFT & 127
ld a,(LEFT)
and 127
ld (LEFT),a
endif
call checked_step
call emit_state
endif
retCustomise it
Compare the two extremes of the signed byte range. 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:
ORDER: defb 0
LEFT: defb 0
RIGHT: 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 80 7F 00 00 00 00 00. The full client trace in the source explains how it gets there.
Mistake and repair
The wrong caller strips the sign bit, turning −1 into +127. Keep the encoded signed byte intact; masking a sign bit is not an absolute-value operation.
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:
ORDER: defb 0
LEFT: defb 0
RIGHT: 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 91 code bytes; public state is 3 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.
Constant work and two scratch bytes. Native signed branches can shorten the 68000 version; MOS code must reason about overflow when using a subtraction instead.
This routine compares encoded signed bytes; it does not convert them to magnitudes or handle sixteen-bit velocities.
Execution evidence
Four variants run on 48K PAL ROM tape load and USR, 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
Fractional positions: Choose a representation before comparing a signed velocity with a threshold.