rose-ash

coop/rose-ash

Fork 0

Commit Graph

Author	SHA1	Message	Date
giles	eb4233ff36	Add inline VM opcodes for hot primitives (OP_ADD through OP_DEC) 16 new opcodes (160-175) bypass the CALL_PRIM hashtable lookup for the most frequently called primitives: Arithmetic: OP_ADD, OP_SUB, OP_MUL, OP_DIV, OP_INC, OP_DEC, OP_NEG Comparison: OP_EQ, OP_LT, OP_GT, OP_NOT Collection: OP_LEN, OP_FIRST, OP_REST, OP_NTH, OP_CONS The compiler (compiler.sx) recognizes these names at compile time and emits the inline opcode instead of CALL_PRIM. The opcode is self- contained — no constant pool index, no argc byte. Each primitive is a single byte in the bytecode stream. Implementation in all three VMs: - OCaml (sx_vm.ml): direct pattern match, no allocation - SX spec (vm.sx): delegates to existing primitives - JS (transpiled): same as SX spec 66 new tests in spec/tests/vm-inline.sx covering arithmetic, comparison, collection ops, composition, and edge cases. Tests: 1314 JS (full), 1114 OCaml, 32 Playwright Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>	2026-03-24 20:10:48 +00:00
giles	c8533181ab	SX bytecode compiler working: all core expressions compile correctly Fixed compiler.sx: hex literals → decimal (Python parser compat), variadic subtraction → nested binary ops. Verified compilation of: (+ 1 2) → CONST 1; CONST 2; CALL_PRIM "+" 2; RETURN (if (> x 0) ...) → JMP_FALSE with correct offset patching (let ((x 1)) ...) → LOCAL_SET/GET with slot indices (no hash) (define f (fn)) → CLOSURE with nested bytecode + pool The compiler resolves all variable references at compile time: - let bindings → LOCAL_GET/SET with numeric slot - fn params → LOCAL_GET with numeric slot - globals/primitives → GLOBAL_GET / CALL_PRIM - tail calls → TAIL_CALL (not yet wired to VM) Next: wire compiled code into OCaml VM and benchmark vs CEK. Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>	2026-03-19 18:43:30 +00:00
giles	40d0f1a438	SX bytecode: format definition, compiler, OCaml VM (Phase 1) Three new files forming the bytecode compilation pipeline: spec/bytecode.sx — opcode definitions (~65 ops): - Stack/constant ops (CONST, NIL, TRUE, POP, DUP) - Lexical variable access (LOCAL_GET/SET, UPVALUE_GET/SET, GLOBAL_GET/SET) - Jump-based control flow (JUMP, JUMP_IF_FALSE/TRUE) - Function ops (CALL, TAIL_CALL, RETURN, CLOSURE, CALL_PRIM) - HO form ops (ITER_INIT/NEXT, MAP_OPEN/APPEND/CLOSE) - Scope/continuation ops (SCOPE_PUSH/POP, RESET, SHIFT) - Aser specialization (ASER_TAG, ASER_FRAG) spec/compiler.sx — SX-to-bytecode compiler (SX code, portable): - Scope analysis: resolve variables to local/upvalue/global at compile time - Tail position detection for TCO - Code generation for: if, when, and, or, let, begin, lambda, define, set!, quote, function calls, primitive calls - Constant pool with deduplication - Jump patching for forward references hosts/ocaml/lib/sx_vm.ml — bytecode interpreter (OCaml): - Stack-based VM with array-backed operand stack - Call frames with base pointer for locals - Direct opcode dispatch via pattern match - Zero allocation per step (unlike CEK machine's dict-per-step) - Handles: constants, variables, jumps, calls, primitives, collections, string concat, define Architecture: compiler.sx is spec (SX, portable). VM is platform (OCaml-native). Same bytecode runs on JS/WASM VMs. Also includes: CekFrame record optimization in transpiler.sx (29 frame types as records instead of Hashtbl). Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>	2026-03-19 18:25:41 +00:00

Author

SHA1

Message

Date

giles

eb4233ff36

Add inline VM opcodes for hot primitives (OP_ADD through OP_DEC)

16 new opcodes (160-175) bypass the CALL_PRIM hashtable lookup for
the most frequently called primitives:

  Arithmetic: OP_ADD, OP_SUB, OP_MUL, OP_DIV, OP_INC, OP_DEC, OP_NEG
  Comparison: OP_EQ, OP_LT, OP_GT, OP_NOT
  Collection: OP_LEN, OP_FIRST, OP_REST, OP_NTH, OP_CONS

The compiler (compiler.sx) recognizes these names at compile time and
emits the inline opcode instead of CALL_PRIM. The opcode is self-
contained — no constant pool index, no argc byte. Each primitive is
a single byte in the bytecode stream.

Implementation in all three VMs:
- OCaml (sx_vm.ml): direct pattern match, no allocation
- SX spec (vm.sx): delegates to existing primitives
- JS (transpiled): same as SX spec

66 new tests in spec/tests/vm-inline.sx covering arithmetic, comparison,
collection ops, composition, and edge cases.

Tests: 1314 JS (full), 1114 OCaml, 32 Playwright

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

2026-03-24 20:10:48 +00:00

giles

c8533181ab

SX bytecode compiler working: all core expressions compile correctly

Fixed compiler.sx: hex literals → decimal (Python parser compat),
variadic subtraction → nested binary ops.

Verified compilation of:
  (+ 1 2)           → CONST 1; CONST 2; CALL_PRIM "+" 2; RETURN
  (if (> x 0) ...)  → JMP_FALSE with correct offset patching
  (let ((x 1)) ...) → LOCAL_SET/GET with slot indices (no hash)
  (define f (fn))    → CLOSURE with nested bytecode + pool

The compiler resolves all variable references at compile time:
  - let bindings → LOCAL_GET/SET with numeric slot
  - fn params → LOCAL_GET with numeric slot
  - globals/primitives → GLOBAL_GET / CALL_PRIM
  - tail calls → TAIL_CALL (not yet wired to VM)

Next: wire compiled code into OCaml VM and benchmark vs CEK.

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

2026-03-19 18:43:30 +00:00

giles

40d0f1a438

SX bytecode: format definition, compiler, OCaml VM (Phase 1)

Three new files forming the bytecode compilation pipeline:

spec/bytecode.sx — opcode definitions (~65 ops):
  - Stack/constant ops (CONST, NIL, TRUE, POP, DUP)
  - Lexical variable access (LOCAL_GET/SET, UPVALUE_GET/SET, GLOBAL_GET/SET)
  - Jump-based control flow (JUMP, JUMP_IF_FALSE/TRUE)
  - Function ops (CALL, TAIL_CALL, RETURN, CLOSURE, CALL_PRIM)
  - HO form ops (ITER_INIT/NEXT, MAP_OPEN/APPEND/CLOSE)
  - Scope/continuation ops (SCOPE_PUSH/POP, RESET, SHIFT)
  - Aser specialization (ASER_TAG, ASER_FRAG)

spec/compiler.sx — SX-to-bytecode compiler (SX code, portable):
  - Scope analysis: resolve variables to local/upvalue/global at compile time
  - Tail position detection for TCO
  - Code generation for: if, when, and, or, let, begin, lambda,
    define, set!, quote, function calls, primitive calls
  - Constant pool with deduplication
  - Jump patching for forward references

hosts/ocaml/lib/sx_vm.ml — bytecode interpreter (OCaml):
  - Stack-based VM with array-backed operand stack
  - Call frames with base pointer for locals
  - Direct opcode dispatch via pattern match
  - Zero allocation per step (unlike CEK machine's dict-per-step)
  - Handles: constants, variables, jumps, calls, primitives,
    collections, string concat, define

Architecture: compiler.sx is spec (SX, portable). VM is platform
(OCaml-native). Same bytecode runs on JS/WASM VMs.

Also includes: CekFrame record optimization in transpiler.sx
(29 frame types as records instead of Hashtbl).

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

2026-03-19 18:25:41 +00:00

3 Commits