Compile is 1.5–3× slower than QuickJS: the stack-code layer and front-end allocation

Offen
#154 0 Kommentare 0 Reaktionen 0 zugewiesene Personen Auf GitHub ansehen

Dieses Issue hat noch niemand übernommen.

Bewertung

Schwierigkeit
5/5
Geschätzter Aufwand
Über eine Woche
Anfängerfreundlichkeit
30/100
Issue-Typ
Refactoring
Klarheit
Größtenteils klar
Aktivitätsstatus
Aktiv
Tech-Stack
rust

Rechercherichtung

Start with the compiler path described in the issue: lexer and parser, FunctionIr, resolution, lowering, flow, and register::analysis; use compile_matrix.py and the listed profiles to locate the measured costs. The proposed direct IR-to-register lowering and front-end allocation changes span several compiler subsystems. Done means reaching within 1.5× of QuickJS on every listed corpus row while keeping Test262, the differential corpus, and register-stress unchanged.

Vom Indexierungsmodell aus dem Issue-Text verfasst.

Beschreibung

Compile-only throughput of 0.3.0 against QuickJS 2026-06-04 (compile_matrix.py, generated corpus, one process per sample, median of 5, Ryzen 7 7840HS):

Corpus Size oxide MB/s QuickJS MB/s QuickJS faster by
expressions 64 KB 11.7 27.2 2.3×
expressions 512 KB 10.0 29.7 3.0×
expressions 4 MB 10.3 25.0 2.4×
functions 64 KB 8.1 14.1 1.7×
syntax-mixed 64 KB 6.8 10.3 1.5×

(At 512 KB and 4 MB the functions and syntax-mixed corpora are superlinear in QuickJS, so those rows are left out; see the name-resolution issue for ours.)

The whole-program effect shows in Octane CodeLoad, 2.32× QuickJS's time: 56% of its samples are in the compiler and another 33% in malloc/free, mostly compile-time allocation. Top symbols: Lexer::next_token_into 8.8%, _int_malloc 4.8%, Parser::probe_token 4.7%, lowering::lower_unlinked_tree 4.1%, lowering::lower_ops 4.1%, register::analysis::analyze 4.0%.

Where the work goes

Source reaches register code through: lexer and parser → linear FunctionIr → resolution → lowering to QuickJS-shaped stack code (UnlinkedFunction) → relocation/flow/optimize → register::analysis (re-derives stack depth and catch regions per instruction) → register lowering → CodeStore::publish validation. QuickJS emits bytecode while parsing and then runs resolve_variables and resolve_labels.

  • The stack code is a complete intermediate representation (instructions, constants, debug tables, closure-variable tables) whose only consumer is the register lowering.
  • Stack depth is computed twice (flow and register::analysis); source positions are projected for stack code and mapped again for register code.
  • The lexer re-scans by cloning itself (probe_token), and the front end allocates per identifier and per function table without an arena.

Direction

  • Lower from the IR (after resolution) straight to register code, removing the stack-code layer and its second analysis.
  • Until then: hand flow's depths to the register lowering instead of recomputing them; cut front-end allocation (arena or reused buffers; no lexer clones for lookahead).

Acceptance: compile throughput within 1.5× of QuickJS on every corpus row above, with Test262, the differential corpus and register-stress unchanged.

Vorherrschende Sprache
Rust
Sterne
61
Forks
2
PR-Merge-Kennzahlen
Keine gemergten PRs in 30 T.

Entwicklungsumgebung

Die Einrichtungsdateien dieses Projekts haben wir noch nicht geprüft. Beginnen Sie mit der README; die allgemeinen Schritte stehen in unserem Leitfaden für den ersten Beitrag.

Erste Schritte

  1. Lesen Sie das ganze Issue und danach den Beitragsleitfaden des Projekts.
  2. Schreiben Sie ins Issue, dass Sie es übernehmen — das erspart doppelte Arbeit.
  3. Forken Sie das Repository und arbeiten Sie in einem Branch.
  4. Öffnen Sie einen Pull Request, der die Issue-Nummer nennt.

Mehr aus pocket-stack/quickjs-oxide

Alle Issues in pocket-stack/quickjs-oxide

Ähnliche Issues

Weitere Issues zu Rust

Neue Issues direkt in Ihr Postfach

Eine kurze Übersicht über anfängerfreundliche GitHub-Issues.