Sibling articles under this feature previously restated requirements in inconsistent forms.
Flow and algorithm
Platform spec article
Flow and algorithm
Spec standingStandard
-
This feature hub owns normative MUST/SHOULD contract text for Lowering contract.
Context
Decision
This feature hub owns normative MUST/SHOULD contract text. Sibling articles must not redefine hub requirements and should link here for authority.
Consequences
Contract changes start on the hub or in linked ADRs, then propagate to articles and implementation anchors.
Verification anchors
site/website/src/content/docs/platform-spec/compiler/codegen-and-ir/lowering-contract/index.mdxarticle bundle under the same feature directory.
-
Platform-spec text supersedes informal crate comments for Lowering contract.
Context
Implementation crates accumulated informal notes that diverged from published contracts.
Decision
Normative platform-spec prose and ADRs under this feature supersede informal comments in implementation crates until explicitly migrated into spec text.
Consequences
Engineers file spec/ADR updates when behavior changes; crate comments are non-authoritative for conformance arguments.
Verification anchors
compiler/crates/beskid_codegencompiler/crates/beskid_codegencompiler/crates/beskid_engine/src/jit_module.rs
-
Lowering was split across experimental paths.
Context
Lowering was split across experimental paths.
Decision
beskid_codegen::lower_sourceis the single lowering entry producingCodegenArtifactconsumed byJitModule.Consequences
Experimental IR dumps must not bypass this entry in release builds.
Verification anchors
compiler/crates/beskid_codegencompiler/crates/beskid_engine/src/jit_module.rs.
- Contracts and edge cases Normative guarantees and known edge cases for `Lowering contract`.
- Design model Conceptual model for `Lowering contract` and its subsystem boundaries.
- Examples Practical examples that demonstrate `Lowering contract` behavior.
- FAQ and troubleshooting Common questions and debugging guidance for `Lowering contract`.
- Flow and algorithm End-to-end control flow and major algorithmic steps for `Lowering contract`.
- Verification and traceability How `Lowering contract` requirements map to tests and implementation anchors.
0 revisions (git unavailable at build; counts may be empty)
No commits recorded for this path.
| Section id | Required | Found |
|---|---|---|
what-this-feature-specifies | yes | yes |
implementation-anchors | yes | yes |
Full tree: run pnpm verify:platform-spec-layout (writes src/generated/platform-spec-layout-report.json).
End-to-end flow
Section titled “End-to-end flow”- Input enters compiler/runtime boundary at a stable entrypoint.
- The responsible crate enforces the expected shape and emits stable structures.
- Downstream crates consume those structures without redefining semantics.
- Conformance tests assert behavior at integration boundaries.
Algorithm notes for newcomers
Section titled “Algorithm notes for newcomers”- Prefer tracing one fixture end-to-end before reading all modules.
- Verify where shape conversion happens; avoid assuming all crates mutate data.
- Keep an eye on handoff points where diagnostics or ABI constraints are locked.
Where to step through code
Section titled “Where to step through code”- Start with
beskid_codegen::lower_source` in `compiler/crates/beskid_codegen. - Then inspect
CodegenArtifact` construction in `compiler/crates/beskid_codegen. - Follow consumption path at
JitModule` consumption in `compiler/crates/beskid_engine/src/jit_module.rs. - Validate expectations using
Runtime execution coverage incompiler/crates/beskid_tests/src/runtime/jit.rs“.