mirror of
https://github.com/pjh456/OxideJS.git
synced 2026-10-23 18:21:13 +08:00
916 lines
35 KiB
Rust
916 lines
35 KiB
Rust
//! emit：AST → IR 代码生成（parse → IR → bytecode 中段）。
|
||
//!
|
||
//! `Emitter` 提供各语法域的 emit_* 方法；核心状态集中在 `CompileCtx`：
|
||
//! 执行流字段（insts/registers/constants/labels）平铺其上，标识符绑定与
|
||
//! 闭包捕获分别下沉到 `SymbolTable` / `captured_bindings`。产出分域组合的
|
||
//! `IRFunction`，由 `oxide_ir::lower` 降为 bytecode。
|
||
|
||
use std::collections::{BTreeMap, HashMap, HashSet};
|
||
|
||
use oxide_bytecode::module::UpvalueCapture;
|
||
use oxide_bytecode::opcode::OpCode;
|
||
use oxide_ir::inst::Inst;
|
||
use oxide_ir::operand::{LabelId, Operand};
|
||
use oxide_ir::IRFunction;
|
||
|
||
use crate::emit_ctx::{LabelCtx, ScopeCtx};
|
||
use crate::symbol_table::{Binding, ScopeKind, SymbolTable};
|
||
|
||
/// 常量池项（bytecode module 类型）re-export，供调用方构造常量。
|
||
pub use oxide_bytecode::module::Constant;
|
||
/// 变量声明种类（var/let/const），re-export 自 parser。
|
||
pub use oxide_parser::VariableDeclarationKind;
|
||
/// AST 语法树节点与运算符类型，re-export 自 parser。
|
||
pub use oxide_parser::{AssignmentOperator, BinaryOperator, Expression, Statement, UnaryOperator};
|
||
|
||
/// 编译入口（marker 类型）。方法按语法域组织在 `impl Emitter` 中。
|
||
pub struct Emitter;
|
||
|
||
/// 判断 f64 是否为整数值且在 i32 范围内（整数常量编码用）。
|
||
pub fn is_int_literal(value: f64) -> bool {
|
||
value.fract() == 0.0 && value >= i32::MIN as f64 && value <= i32::MAX as f64
|
||
}
|
||
|
||
/// 判断表达式是否无副作用（字面量/标识符/纯二元运算等）。
|
||
/// 用于可丢弃值的优化路径。
|
||
pub fn is_side_effect_free(expr: &Expression) -> bool {
|
||
let mut stack = vec![expr];
|
||
while let Some(expr) = stack.pop() {
|
||
match expr {
|
||
Expression::NumericLiteral(_)
|
||
| Expression::StringLiteral(_)
|
||
| Expression::BooleanLiteral(_)
|
||
| Expression::NullLiteral(_)
|
||
| Expression::Identifier(_)
|
||
| Expression::RegExpLiteral(_)
|
||
| Expression::ThisExpression(_) => {}
|
||
Expression::ParenthesizedExpression(p) => stack.push(&p.expression),
|
||
Expression::BinaryExpression(bin) => {
|
||
stack.push(&bin.left);
|
||
stack.push(&bin.right);
|
||
}
|
||
Expression::UnaryExpression(un) if !matches!(un.operator, UnaryOperator::Delete) => {
|
||
stack.push(&un.argument);
|
||
}
|
||
_ => return false,
|
||
}
|
||
}
|
||
true
|
||
}
|
||
|
||
const BUILTIN_GLOBALS: &[&str] = &[
|
||
"NaN",
|
||
"undefined",
|
||
"Infinity",
|
||
"globalThis",
|
||
"Object",
|
||
"Array",
|
||
"String",
|
||
"Number",
|
||
"Boolean",
|
||
"Function",
|
||
"Error",
|
||
"TypeError",
|
||
"ReferenceError",
|
||
"RangeError",
|
||
"SyntaxError",
|
||
"URIError",
|
||
"EvalError",
|
||
"Math",
|
||
"JSON",
|
||
"Promise",
|
||
"Date",
|
||
"Set",
|
||
"Map",
|
||
"RegExp",
|
||
"Symbol",
|
||
"parseInt",
|
||
"parseFloat",
|
||
"isNaN",
|
||
"isFinite",
|
||
"Proxy",
|
||
"WeakMap",
|
||
"WeakSet",
|
||
"WeakRef",
|
||
"FinalizationRegistry",
|
||
"Atomics",
|
||
"SharedArrayBuffer",
|
||
"ArrayBuffer",
|
||
"DataView",
|
||
"Iterator",
|
||
"BigInt",
|
||
"Int8Array",
|
||
"Uint8Array",
|
||
"Uint8ClampedArray",
|
||
"Int16Array",
|
||
"Uint16Array",
|
||
"Int32Array",
|
||
"Uint32Array",
|
||
"Float32Array",
|
||
"Float64Array",
|
||
"BigInt64Array",
|
||
"BigUint64Array",
|
||
"Reflect",
|
||
"escape",
|
||
"unescape",
|
||
"encodeURI",
|
||
"decodeURI",
|
||
"encodeURIComponent",
|
||
"decodeURIComponent",
|
||
];
|
||
|
||
pub(crate) struct FieldBuffer {
|
||
pub(crate) insts: Vec<Inst>,
|
||
pub(crate) labels: Vec<(LabelId, usize)>,
|
||
}
|
||
|
||
/// A labeled-statement scope active during emission. `break label` targets
|
||
/// `break_label`; `continue label` targets `continue_label` (only set when the
|
||
/// labeled statement directly wraps an iteration statement).
|
||
#[derive(Debug, Clone)]
|
||
pub struct LabelScope {
|
||
pub(crate) name: String,
|
||
pub(crate) break_label: LabelId,
|
||
pub(crate) continue_label: Option<LabelId>,
|
||
}
|
||
|
||
/// 单函数编译上下文：执行流 + 作用域 + 闭包捕获的聚合状态。
|
||
/// 指令、常量池、寄存器分配平铺于此，作用域/绑定见 `ScopeCtx`，跳转见 `LabelCtx`。
|
||
pub struct CompileCtx {
|
||
pub(crate) insts: Vec<Inst>,
|
||
pub(crate) constants: Vec<Constant>,
|
||
constant_map: HashMap<ConstantKey, u16>,
|
||
next_reg: u32,
|
||
pub(crate) max_regs: u32,
|
||
reserved_reg_start: u32,
|
||
pub(crate) labels: LabelCtx,
|
||
pub(crate) scopes: ScopeCtx,
|
||
pub(crate) nested: Vec<IRFunction>,
|
||
/// Register holding `this` in the enclosing function context.
|
||
/// Used by arrow functions to capture lexical `this`.
|
||
/// Initialized to 254 (conventional this register) at the top level.
|
||
pub(crate) enclosing_this_reg: u8,
|
||
pub(crate) in_derived_constructor: bool,
|
||
pub(crate) in_instance_method: bool,
|
||
pub(crate) in_static_method: bool,
|
||
pub(crate) static_block_this_reg: Option<u8>,
|
||
pub(crate) field_buffer: Option<FieldBuffer>,
|
||
pub(crate) current_upvalue_captures: Vec<UpvalueCapture>,
|
||
/// 本函数作用域声明的绑定名（参数 + 变量/函数声明，AST 收集，emit 前确定）。
|
||
pub(crate) own_bindings: HashSet<String>,
|
||
/// 本函数被嵌套函数捕获的绑定名 → cell_idx（名字排序分配，稳定跨 run）。
|
||
/// 捕获判断（MAKE_CELL / CELL_GET / CELL_SET）与子函数 upvalue cell_idx 统一查此映射，
|
||
/// 消除符号表时序依赖与 cell 索引错位。
|
||
pub(crate) captured_bindings: BTreeMap<String, u8>,
|
||
pub(crate) const_overflow: bool,
|
||
}
|
||
|
||
/// 函数体编译上下文：决定 `this`/`super` 绑定与参数前导（prologue）形态。
|
||
#[derive(Clone, Copy)]
|
||
pub enum FunctionBodyContext {
|
||
/// 普通函数：自身 `this`、独立作用域。
|
||
Ordinary,
|
||
/// 箭头函数：词法捕获外层 `this`，不生成参数前导。
|
||
Arrow,
|
||
/// 类元素方法：按类语义处理 `super` 与 home object。
|
||
ClassElement,
|
||
}
|
||
|
||
/// 参数规格：普通形参为标识符，解构形参用合成名 + 原始 pattern。
|
||
pub enum ParamSpec<'a> {
|
||
Identifier(String),
|
||
Pattern {
|
||
synthetic_name: String,
|
||
pattern: &'a oxide_parser::BindingPattern<'a>,
|
||
},
|
||
}
|
||
|
||
impl ParamSpec<'_> {
|
||
pub(crate) fn register_name(&self) -> &str {
|
||
match self {
|
||
Self::Identifier(name) => name,
|
||
Self::Pattern { synthetic_name, .. } => synthetic_name,
|
||
}
|
||
}
|
||
}
|
||
|
||
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
|
||
enum ConstantKey {
|
||
Number(u64),
|
||
Int(i32),
|
||
String(String),
|
||
Boolean(bool),
|
||
Null,
|
||
Undefined,
|
||
}
|
||
|
||
impl CompileCtx {
|
||
pub(crate) fn new() -> Self {
|
||
Self {
|
||
insts: Vec::new(),
|
||
constants: Vec::new(),
|
||
constant_map: HashMap::new(),
|
||
next_reg: 1,
|
||
max_regs: 1,
|
||
reserved_reg_start: 1,
|
||
labels: LabelCtx {
|
||
label_pos: Vec::new(),
|
||
loop_stack: Vec::new(),
|
||
switch_stack: Vec::new(),
|
||
label_scopes: Vec::new(),
|
||
pending_loop_labels: Vec::new(),
|
||
label_counter: 0,
|
||
},
|
||
scopes: ScopeCtx {
|
||
symbols: SymbolTable::new(),
|
||
builtin_reg_map: Vec::new(),
|
||
private_name_map: Vec::new(),
|
||
next_private_name_id: 1,
|
||
},
|
||
nested: Vec::new(),
|
||
enclosing_this_reg: 254, // conventional this register at top level
|
||
in_derived_constructor: false,
|
||
in_instance_method: false,
|
||
in_static_method: false,
|
||
static_block_this_reg: None,
|
||
field_buffer: None,
|
||
current_upvalue_captures: Vec::new(),
|
||
own_bindings: HashSet::new(),
|
||
captured_bindings: BTreeMap::new(),
|
||
const_overflow: false,
|
||
}
|
||
}
|
||
|
||
pub(crate) fn inst(&mut self, inst: Inst) {
|
||
self.insts.push(inst);
|
||
}
|
||
|
||
pub(crate) fn alloc_reg(&mut self) -> u32 {
|
||
let r = self.next_reg;
|
||
// vreg 化（D-02）：寄存器号无上限，RegAlloc 阶段负责压缩到物理域（≤253）。
|
||
// 254/255 是 VM 保留的 this/new.target，vreg 世界允许虚拟号越过它们，
|
||
// 只有 RegAlloc 完成映射后 lower 的物理域检查才相关。
|
||
self.next_reg += 1;
|
||
if self.next_reg > self.max_regs {
|
||
self.max_regs = self.next_reg;
|
||
}
|
||
r
|
||
}
|
||
|
||
pub(crate) fn reset_regs(&mut self) {
|
||
self.next_reg = self.builtin_reg_floor().max(self.reserved_reg_start);
|
||
self.labels.label_counter = 0;
|
||
}
|
||
|
||
pub(crate) fn reserve_reg(&mut self, reg: u32) {
|
||
let next = reg.wrapping_add(1);
|
||
if self.next_reg <= reg {
|
||
self.next_reg = next;
|
||
}
|
||
if self.max_regs < next {
|
||
self.max_regs = next;
|
||
}
|
||
}
|
||
|
||
pub(crate) fn add_constant(&mut self, c: Constant) -> u16 {
|
||
if let Some(key) = ConstantKey::from_constant(&c) {
|
||
if let Some(&idx) = self.constant_map.get(&key) {
|
||
return idx;
|
||
}
|
||
|
||
if self.constants.len() >= u16::MAX as usize {
|
||
self.const_overflow = true;
|
||
return u16::MAX;
|
||
}
|
||
let idx = self.constants.len() as u16;
|
||
self.constants.push(c);
|
||
self.constant_map.insert(key, idx);
|
||
return idx;
|
||
}
|
||
|
||
let idx = self.constants.len();
|
||
if idx >= u16::MAX as usize {
|
||
self.const_overflow = true;
|
||
return u16::MAX;
|
||
}
|
||
self.constants.push(c);
|
||
idx as u16
|
||
}
|
||
|
||
pub(crate) fn push_scope(&mut self) {
|
||
self.scopes.symbols.push_scope();
|
||
}
|
||
|
||
pub(crate) fn pop_scope(&mut self) {
|
||
self.scopes.symbols.pop_scope();
|
||
}
|
||
|
||
pub(crate) fn declare(
|
||
&mut self, name: &str, reg: u32, kind: VariableDeclarationKind, is_const: bool,
|
||
) -> Result<(), String> {
|
||
self.scopes.symbols.declare(name, reg, kind, is_const)
|
||
}
|
||
|
||
pub(crate) fn declare_initialized(
|
||
&mut self, name: &str, reg: u32, kind: VariableDeclarationKind, is_const: bool,
|
||
) -> Result<(), String> {
|
||
self.scopes.symbols.declare_initialized(name, reg, kind, is_const)
|
||
}
|
||
|
||
pub(crate) fn push_scope_with_kind(&mut self, kind: ScopeKind) {
|
||
self.scopes.symbols.push_scope_with_kind(kind);
|
||
}
|
||
|
||
pub(crate) fn lookup(&self, name: &str) -> Result<u32, String> {
|
||
self.scopes.symbols.lookup(name)
|
||
}
|
||
|
||
pub(crate) fn lookup_or_builtin(&mut self, name: &str) -> Result<u32, String> {
|
||
match self.scopes.symbols.lookup(name) {
|
||
Ok(reg) => Ok(reg),
|
||
Err(err) if Self::is_known_builtin(name) && err.contains("is not defined") => {
|
||
let reg = self.alloc_reg();
|
||
self.scopes.symbols.pre_register_global(name, reg);
|
||
self.scopes.builtin_reg_map.push((name.to_string(), reg));
|
||
Ok(reg)
|
||
}
|
||
Err(err) => Err(err),
|
||
}
|
||
}
|
||
|
||
pub(crate) fn lookup_or_global(&mut self, name: &str) -> u32 {
|
||
if let Some(reg) = self.scopes.symbols.lookup_any(name) {
|
||
return reg;
|
||
}
|
||
let reg = self.alloc_reg();
|
||
self.scopes.symbols.lookup_or_global(name, reg)
|
||
}
|
||
|
||
pub(crate) fn lookup_const_flag(&self, name: &str) -> bool {
|
||
self.scopes.symbols.lookup_is_const(name)
|
||
}
|
||
|
||
pub(crate) fn init_var(&mut self, name: &str) {
|
||
self.scopes.symbols.init_var(name);
|
||
}
|
||
|
||
pub(crate) fn next_label_id(&mut self) -> u32 {
|
||
let id = self.labels.label_counter;
|
||
self.labels.label_counter += 1;
|
||
id
|
||
}
|
||
|
||
pub(crate) fn push_loop(&mut self, break_label: LabelId, continue_label: LabelId) {
|
||
self.labels.loop_stack.push((break_label, continue_label));
|
||
}
|
||
|
||
pub(crate) fn pop_loop(&mut self) {
|
||
self.labels.loop_stack.pop();
|
||
}
|
||
|
||
pub(crate) fn current_loop(&self) -> Option<&(LabelId, LabelId)> {
|
||
self.labels.loop_stack.last()
|
||
}
|
||
|
||
pub(crate) fn push_switch(&mut self, break_label: LabelId) {
|
||
self.labels.switch_stack.push(break_label);
|
||
}
|
||
|
||
pub(crate) fn pop_switch(&mut self) {
|
||
self.labels.switch_stack.pop();
|
||
}
|
||
|
||
pub(crate) fn current_switch(&self) -> Option<&LabelId> {
|
||
self.labels.switch_stack.last()
|
||
}
|
||
|
||
pub(crate) fn push_label_scope(
|
||
&mut self, name: &str, break_label: LabelId, continue_label: Option<LabelId>,
|
||
) -> Result<(), String> {
|
||
if self.labels.label_scopes.iter().any(|s| s.name == name) {
|
||
return Err(format!("SyntaxError: Label '{name}' has already been declared"));
|
||
}
|
||
self.labels.label_scopes.push(LabelScope {
|
||
name: name.to_string(),
|
||
break_label,
|
||
continue_label,
|
||
});
|
||
Ok(())
|
||
}
|
||
|
||
pub(crate) fn pop_label_scope(&mut self) {
|
||
self.labels.label_scopes.pop();
|
||
}
|
||
|
||
pub(crate) fn find_label(&self, name: &str) -> Option<&LabelScope> {
|
||
self.labels.label_scopes.iter().rev().find(|s| s.name == name)
|
||
}
|
||
|
||
/// Queue a label name to be bound to the continue target of the next loop
|
||
/// emitted as the labeled statement's body. Rejects duplicates in the active
|
||
/// or pending sets.
|
||
pub(crate) fn queue_loop_label(&mut self, name: &str) -> Result<(), String> {
|
||
if self.labels.label_scopes.iter().any(|s| s.name == name)
|
||
|| self.labels.pending_loop_labels.iter().any(|n| n == name)
|
||
{
|
||
return Err(format!("SyntaxError: Label '{name}' has already been declared"));
|
||
}
|
||
self.labels.pending_loop_labels.push(name.to_string());
|
||
Ok(())
|
||
}
|
||
|
||
/// Drain queued loop labels into active scopes bound to this loop's break and
|
||
/// continue targets. Returns how many scopes were pushed (to pop after).
|
||
pub(crate) fn take_pending_loop_labels(&mut self, break_label: LabelId, continue_label: LabelId) -> usize {
|
||
let names = std::mem::take(&mut self.labels.pending_loop_labels);
|
||
let count = names.len();
|
||
for name in names {
|
||
self.labels.label_scopes.push(LabelScope {
|
||
name,
|
||
break_label,
|
||
continue_label: Some(continue_label),
|
||
});
|
||
}
|
||
count
|
||
}
|
||
|
||
pub(crate) fn pop_label_scopes(&mut self, n: usize) {
|
||
for _ in 0..n {
|
||
self.labels.label_scopes.pop();
|
||
}
|
||
}
|
||
|
||
pub(crate) fn is_builtin(&self, name: &str) -> bool {
|
||
self.scopes.builtin_reg_map.iter().any(|(n, _)| n == name)
|
||
}
|
||
|
||
pub(crate) fn is_known_builtin(name: &str) -> bool {
|
||
BUILTIN_GLOBALS.contains(&name)
|
||
}
|
||
|
||
fn builtin_reg_floor(&self) -> u32 {
|
||
self.scopes
|
||
.builtin_reg_map
|
||
.iter()
|
||
.map(|(_, reg)| reg.saturating_add(1))
|
||
.max()
|
||
.unwrap_or(0)
|
||
}
|
||
|
||
pub(crate) fn pre_register_builtins(&mut self) {
|
||
// Builtin globals are resolved lazily by lookup_or_builtin(). Keeping this
|
||
// hook preserves the compile pipeline without reserving ~60 registers in
|
||
// every module.
|
||
}
|
||
|
||
/// 组装 IRFunction（两出口共用），take 走编译产物状态。
|
||
/// `parent_ctx` 用于补全 upvalue_captures 的 enclosing_reg（父符号表在父 emit 完成后完整）。
|
||
fn assemble_ir(&mut self, param_layout: oxide_ir::ParamLayout, parent_ctx: Option<&CompileCtx>) -> IRFunction {
|
||
let upvalue_captures = self
|
||
.current_upvalue_captures
|
||
.iter()
|
||
.map(|u| {
|
||
let enclosing_reg = parent_ctx
|
||
.and_then(|p| p.scopes.symbols.lookup_any(u.name.as_str()))
|
||
.unwrap_or(0);
|
||
UpvalueCapture {
|
||
name: u.name.clone(),
|
||
enclosing_reg,
|
||
cell_idx: u.cell_idx,
|
||
}
|
||
})
|
||
.collect();
|
||
IRFunction {
|
||
insts: std::mem::take(&mut self.insts),
|
||
label_pos: std::mem::take(&mut self.labels.label_pos),
|
||
label_count: self.labels.label_counter,
|
||
constants: std::mem::take(&mut self.constants),
|
||
param_layout,
|
||
builtin_reg_map: std::mem::take(&mut self.scopes.builtin_reg_map),
|
||
upvalue_captures,
|
||
cells_needed: self.captured_bindings.len() as u8,
|
||
n_registers: self.max_regs,
|
||
is_arrow: false,
|
||
is_class_constructor: false,
|
||
is_derived_constructor: false,
|
||
needs_home_object: false,
|
||
captured_this_const_idx: 0,
|
||
function_name: None,
|
||
is_top_level: parent_ctx.is_none(),
|
||
const_overflow: self.const_overflow,
|
||
nested: std::mem::take(&mut self.nested),
|
||
}
|
||
}
|
||
}
|
||
|
||
impl ConstantKey {
|
||
fn from_constant(value: &Constant) -> Option<Self> {
|
||
match value {
|
||
Constant::Number(v) => Some(Self::Number(v.to_bits())),
|
||
Constant::Int(v) => Some(Self::Int(*v)),
|
||
Constant::String(v) => Some(Self::String(v.clone())),
|
||
Constant::Boolean(v) => Some(Self::Boolean(*v)),
|
||
Constant::Null => Some(Self::Null),
|
||
Constant::Undefined => Some(Self::Undefined),
|
||
}
|
||
}
|
||
}
|
||
|
||
impl Emitter {
|
||
/// 构造空 `Emitter`（无内部状态，所有状态在 `CompileCtx` 中）。
|
||
pub fn new() -> Self {
|
||
Self
|
||
}
|
||
|
||
// ── 闭包捕获分析（AST 级，时序无关）──
|
||
|
||
/// 收集函数参数的绑定名（BindingIdentifier 形态）。
|
||
pub(crate) fn extract_function_parts<'a>(
|
||
&self, function: &'a oxide_parser::Function<'a>,
|
||
) -> Result<(Vec<ParamSpec<'a>>, &'a [Statement<'a>]), String> {
|
||
let mut param_specs = Vec::new();
|
||
for (idx, param) in function.params.items.iter().enumerate() {
|
||
match ¶m.pattern {
|
||
oxide_parser::BindingPattern::BindingIdentifier(bi) => {
|
||
param_specs.push(ParamSpec::Identifier(bi.name.to_string()));
|
||
}
|
||
pattern => {
|
||
param_specs.push(ParamSpec::Pattern {
|
||
synthetic_name: format!("@@param_{idx}"),
|
||
pattern,
|
||
});
|
||
}
|
||
}
|
||
}
|
||
let body_stmts: &[Statement] = if let Some(body) = &function.body { &body.statements } else { &[] };
|
||
Ok((param_specs, body_stmts))
|
||
}
|
||
|
||
/// Compile a function body (used for FD, FE, and arrow functions).
|
||
/// This performs both counting and emitting in one pass.
|
||
/// When `is_expression_body` is true (arrow function with expression body),
|
||
/// the last expression's value is returned instead of undefined.
|
||
/// `is_arrow` controls whether super flags are inherited from the parent scope
|
||
/// (true for arrow functions, which have lexical super) or reset to false
|
||
/// (false for regular functions, which create a new super scope).
|
||
pub(crate) fn compile_function_body<'a>(
|
||
&self, param_specs: &[ParamSpec<'a>], body_stmts: &[Statement<'a>], parent_ctx: &CompileCtx,
|
||
is_expression_body: bool, is_arrow: bool,
|
||
) -> Result<IRFunction, String> {
|
||
let body_context = if is_arrow {
|
||
FunctionBodyContext::Arrow
|
||
} else {
|
||
FunctionBodyContext::Ordinary
|
||
};
|
||
self.compile_function_body_with_bindings(
|
||
param_specs,
|
||
body_stmts,
|
||
parent_ctx,
|
||
is_expression_body,
|
||
&[],
|
||
body_context,
|
||
)
|
||
}
|
||
|
||
pub(crate) fn compile_function_body_with_bindings<'a>(
|
||
&self, param_specs: &[ParamSpec<'a>], body_stmts: &[Statement<'a>], parent_ctx: &CompileCtx,
|
||
is_expression_body: bool, extra_bindings: &[(&str, u32)], body_context: FunctionBodyContext,
|
||
) -> Result<IRFunction, String> {
|
||
self.compile_function_body_with_field_hooks(
|
||
param_specs,
|
||
body_stmts,
|
||
parent_ctx,
|
||
is_expression_body,
|
||
extra_bindings,
|
||
body_context,
|
||
None::<fn(&Emitter, &mut CompileCtx) -> Result<(), String>>,
|
||
false,
|
||
)
|
||
}
|
||
|
||
|
||
/// Pre-register all builtin identifiers referenced anywhere in this body
|
||
/// (expressions, member objects, call args, class fields, etc.) so their
|
||
/// register slots are reserved *before* any temporary register is emitted.
|
||
///
|
||
/// vreg 化（D-01）后临时值不复用（独立 vreg），但 builtin 槽预注册仍
|
||
/// 保证分配序稳定：builtin 槽先于临时值池，nested 继承边界（B012）不受扰。
|
||
#[allow(clippy::too_many_arguments)]
|
||
pub(crate) fn compile_function_body_with_field_hooks<'a, E>(
|
||
&self, param_specs: &[ParamSpec<'a>], body_stmts: &[Statement<'a>], parent_ctx: &CompileCtx,
|
||
is_expression_body: bool, extra_bindings: &[(&str, u32)], body_context: FunctionBodyContext,
|
||
mut emit_fields: Option<E>, fields_after_super: bool,
|
||
) -> Result<IRFunction, String>
|
||
where
|
||
E: FnMut(&Emitter, &mut CompileCtx) -> Result<(), String>,
|
||
{
|
||
let mut ctx = CompileCtx::new();
|
||
|
||
// Inherit parent's builtin_reg_map so builtin identifiers (Math, Object, etc.)
|
||
// resolve to the correct pre-allocated registers in the sub-module's register file.
|
||
ctx.scopes.builtin_reg_map = parent_ctx.scopes.builtin_reg_map.clone();
|
||
ctx.scopes.private_name_map = parent_ctx.scopes.private_name_map.clone();
|
||
ctx.scopes.next_private_name_id = parent_ctx.scopes.next_private_name_id;
|
||
|
||
// Propagate enclosing_this_reg so nested arrow functions capture the correct `this`.
|
||
ctx.enclosing_this_reg = parent_ctx.enclosing_this_reg;
|
||
// Arrow functions inherit lexical super. Class method bodies also need the
|
||
// class-provided super context for their top-level body compilation.
|
||
if matches!(body_context, FunctionBodyContext::Arrow | FunctionBodyContext::ClassElement) {
|
||
ctx.in_derived_constructor = parent_ctx.in_derived_constructor;
|
||
ctx.in_instance_method = parent_ctx.in_instance_method;
|
||
ctx.in_static_method = parent_ctx.in_static_method;
|
||
} else {
|
||
ctx.in_derived_constructor = false;
|
||
ctx.in_instance_method = false;
|
||
ctx.in_static_method = false;
|
||
}
|
||
|
||
// Inherit parent's global scope entries so previously-declared function names
|
||
// are visible from within the body.
|
||
let mut inherited_reg_start = 1u32.max(ctx.builtin_reg_floor());
|
||
for (name, binding) in &parent_ctx.scopes.symbols.scopes[0].bindings {
|
||
ctx.scopes.symbols.scopes[0].bindings.insert(
|
||
name.clone(),
|
||
Binding {
|
||
reg: binding.reg,
|
||
initialized: binding.initialized,
|
||
is_const: binding.is_const,
|
||
},
|
||
);
|
||
inherited_reg_start = inherited_reg_start.max(binding.reg.saturating_add(1));
|
||
}
|
||
for (name, reg) in extra_bindings {
|
||
ctx.scopes.symbols.scopes[0].bindings.insert(
|
||
(*name).to_string(),
|
||
Binding {
|
||
reg: *reg,
|
||
initialized: true,
|
||
is_const: true,
|
||
},
|
||
);
|
||
inherited_reg_start = inherited_reg_start.max(reg.saturating_add(1));
|
||
}
|
||
ctx.reserved_reg_start = inherited_reg_start.max(1);
|
||
|
||
// Align next_reg with builtin count so both count and emit passes start at the
|
||
// same register offset (params go after builtin slots).
|
||
ctx.reset_regs();
|
||
|
||
let param_base = self.emit_params_prologue(param_specs, body_stmts, parent_ctx, &mut ctx, body_context)?;
|
||
|
||
self.predeclare_function_declarations(body_stmts, &mut ctx);
|
||
|
||
// Pre-register builtin identifier references before emitting any temporary
|
||
// register, so builtin slots never collide with reused temporaries.
|
||
self.pre_register_builtin_references(body_stmts, &mut ctx);
|
||
|
||
// Pre-declare `var` names so hoisted function declarations (emitted in the
|
||
// first sub-pass below) can resolve the outer vars they close over.
|
||
self.predeclare_var_declarations(body_stmts, &mut ctx);
|
||
|
||
if let Some(emit) = emit_fields.as_mut() {
|
||
if fields_after_super {
|
||
let mut parent_insts = Vec::new();
|
||
let mut parent_label_pos = Vec::new();
|
||
std::mem::swap(&mut ctx.insts, &mut parent_insts);
|
||
std::mem::swap(&mut ctx.labels.label_pos, &mut parent_label_pos);
|
||
emit(self, &mut ctx)?;
|
||
let field_buffer = FieldBuffer {
|
||
insts: std::mem::take(&mut ctx.insts),
|
||
labels: std::mem::take(&mut ctx.labels.label_pos)
|
||
.into_iter()
|
||
.enumerate()
|
||
.filter_map(|(id, pos)| pos.map(|p| (id as LabelId, p)))
|
||
.collect(),
|
||
};
|
||
ctx.insts = parent_insts;
|
||
ctx.labels.label_pos = parent_label_pos;
|
||
ctx.field_buffer = Some(field_buffer);
|
||
} else {
|
||
emit(self, &mut ctx)?;
|
||
}
|
||
}
|
||
|
||
// Emit body statements（先函数声明 hoisting，再其余）。
|
||
let last_result_reg = self.emit_body_stmts(body_stmts, &mut ctx)?;
|
||
|
||
// Emit implicit RETURN: expression body returns the last expression,
|
||
// statement body returns undefined.
|
||
if is_expression_body {
|
||
if let Some(reg) = last_result_reg {
|
||
ctx.inst(Inst::new(OpCode::RETURN, Operand::Reg(reg), Operand::None, Operand::None));
|
||
} else {
|
||
let undef_idx = ctx.add_constant(Constant::Undefined);
|
||
let undef_reg = ctx.alloc_reg();
|
||
ctx.inst(Inst::load_const(Operand::Reg(undef_reg), undef_idx));
|
||
ctx.inst(Inst::new(OpCode::RETURN, Operand::Reg(undef_reg), Operand::None, Operand::None));
|
||
}
|
||
} else {
|
||
let undef_idx = ctx.add_constant(Constant::Undefined);
|
||
let undef_reg = ctx.alloc_reg();
|
||
ctx.inst(Inst::load_const(Operand::Reg(undef_reg), undef_idx));
|
||
ctx.inst(Inst::new(OpCode::RETURN, Operand::Reg(undef_reg), Operand::None, Operand::None));
|
||
}
|
||
|
||
let ir = ctx.assemble_ir(
|
||
oxide_ir::ParamLayout {
|
||
base: param_base,
|
||
count: param_specs.len() as u32,
|
||
},
|
||
Some(parent_ctx),
|
||
);
|
||
Ok(ir)
|
||
}
|
||
|
||
/// 参数 prologue：函数作用域 + 参数声明/解构 + 闭包捕获与 upvalue 分析。返回 param_base。
|
||
fn emit_params_prologue<'a>(
|
||
&self, param_specs: &[ParamSpec<'a>], body_stmts: &[Statement<'a>], parent_ctx: &CompileCtx,
|
||
ctx: &mut CompileCtx, body_context: FunctionBodyContext,
|
||
) -> Result<u32, String> {
|
||
ctx.push_scope_with_kind(ScopeKind::FunctionScope);
|
||
let param_base = ctx.next_reg;
|
||
|
||
// Emit parameters and destructuring prologue.
|
||
for spec in param_specs {
|
||
let name = spec.register_name();
|
||
let reg = ctx.alloc_reg();
|
||
ctx.declare_initialized(name, reg, VariableDeclarationKind::Var, false)?;
|
||
}
|
||
|
||
for spec in param_specs {
|
||
if let ParamSpec::Pattern { synthetic_name, pattern } = spec {
|
||
let src_reg = ctx.lookup(synthetic_name)?;
|
||
self.emit_binding_pattern(pattern, src_reg, VariableDeclarationKind::Var, false, ctx)?;
|
||
}
|
||
}
|
||
|
||
// 闭包捕获分析（AST 级，emit 前确定，时序无关）
|
||
let param_names: Vec<&str> = param_specs.iter().map(|s| s.register_name()).collect();
|
||
ctx.own_bindings = self.collect_own_binding_names(¶m_names, body_stmts);
|
||
ctx.captured_bindings = self.collect_captured_bindings(body_stmts, &ctx.own_bindings);
|
||
|
||
// 被捕获的参数也必须建 cell（MAKE_CELL）：否则子函数经 lazy upvalue 路径读
|
||
// 自身寄存器（依赖调用者寄存器残留），vreg 化/RegAlloc 移动寄存器后读到垃圾。
|
||
// 与 var/let/const 的 MAKE_CELL 语义一致（binding.rs:50）。
|
||
for spec in param_specs {
|
||
let name = spec.register_name();
|
||
if let Some(&cell_idx) = ctx.captured_bindings.get(name) {
|
||
let reg = ctx.lookup(name)?;
|
||
ctx.inst(Inst::new(OpCode::MAKE_CELL, Operand::Reg(reg), Operand::Imm(cell_idx as u16), Operand::None));
|
||
}
|
||
}
|
||
|
||
// Free variable analysis for upvalue capture (Ordinary + Arrow functions only)
|
||
if matches!(body_context, FunctionBodyContext::Ordinary | FunctionBodyContext::Arrow) {
|
||
ctx.current_upvalue_captures =
|
||
self.collect_upvalue_names(body_stmts, &parent_ctx.captured_bindings, &ctx.own_bindings);
|
||
}
|
||
|
||
Ok(param_base)
|
||
}
|
||
|
||
/// 双 sub-pass emit body：先函数声明（hoisting），再其余语句。返回最后结果寄存器。
|
||
fn emit_body_stmts(&self, body_stmts: &[Statement], ctx: &mut CompileCtx) -> Result<Option<u32>, String> {
|
||
let mut last_result_reg = None;
|
||
for stmt in body_stmts {
|
||
if matches!(stmt, Statement::FunctionDeclaration(_)) {
|
||
if let Some(reg) = self.emit_statement(stmt, ctx)? {
|
||
last_result_reg = Some(reg);
|
||
}
|
||
}
|
||
}
|
||
for stmt in body_stmts {
|
||
if matches!(stmt, Statement::FunctionDeclaration(_)) {
|
||
continue;
|
||
}
|
||
if let Some(reg) = self.emit_statement(stmt, ctx)? {
|
||
last_result_reg = Some(reg);
|
||
}
|
||
}
|
||
Ok(last_result_reg)
|
||
}
|
||
|
||
pub(crate) fn emit_statement(&self, stmt: &Statement, ctx: &mut CompileCtx) -> Result<Option<u32>, String> {
|
||
match stmt {
|
||
Statement::ExpressionStatement(_) | Statement::ReturnStatement(_) | Statement::EmptyStatement(_) => {
|
||
self.emit_basic_domain(stmt, ctx)
|
||
}
|
||
Statement::BlockStatement(_) => self.emit_block_domain(stmt, ctx),
|
||
Statement::VariableDeclaration(_) | Statement::FunctionDeclaration(_) | Statement::ClassDeclaration(_) => {
|
||
self.emit_declaration_domain(stmt, ctx)
|
||
}
|
||
Statement::IfStatement(_) => self.emit_control_domain(stmt, ctx),
|
||
Statement::WhileStatement(_)
|
||
| Statement::DoWhileStatement(_)
|
||
| Statement::ForStatement(_)
|
||
| Statement::ForInStatement(_)
|
||
| Statement::ForOfStatement(_) => self.emit_iteration_domain(stmt, ctx),
|
||
Statement::SwitchStatement(_) => self.emit_switch_domain(stmt, ctx),
|
||
Statement::ThrowStatement(_) | Statement::TryStatement(_) => self.emit_exception_domain(stmt, ctx),
|
||
Statement::BreakStatement(b) => self.emit_break_statement(b, ctx),
|
||
Statement::ContinueStatement(c) => self.emit_continue_statement(c, ctx),
|
||
Statement::LabeledStatement(ls) => self.emit_labeled_statement(ls, ctx),
|
||
_ => Ok(None),
|
||
}
|
||
}
|
||
|
||
pub(crate) fn emit_expression(&self, expr: &Expression, ctx: &mut CompileCtx) -> Result<u32, String> {
|
||
match expr {
|
||
Expression::NumericLiteral(_)
|
||
| Expression::StringLiteral(_)
|
||
| Expression::BooleanLiteral(_)
|
||
| Expression::NullLiteral(_)
|
||
| Expression::RegExpLiteral(_) => self.emit_literal(expr, ctx),
|
||
Expression::BinaryExpression(_)
|
||
| Expression::PrivateInExpression(_)
|
||
| Expression::UnaryExpression(_)
|
||
| Expression::ConditionalExpression(_)
|
||
| Expression::LogicalExpression(_)
|
||
| Expression::UpdateExpression(_) => self.emit_operator(expr, ctx),
|
||
Expression::StaticMemberExpression(_)
|
||
| Expression::ComputedMemberExpression(_)
|
||
| Expression::PrivateFieldExpression(_)
|
||
| Expression::ChainExpression(_) => self.emit_member_domain(expr, ctx),
|
||
Expression::ObjectExpression(_) | Expression::ArrayExpression(_) => self.emit_object_domain(expr, ctx),
|
||
Expression::AssignmentExpression(assign) => self.emit_assignment_expression(assign, ctx),
|
||
Expression::TemplateLiteral(_) | Expression::TaggedTemplateExpression(_) => {
|
||
self.emit_template_domain(expr, ctx)
|
||
}
|
||
Expression::ArrowFunctionExpression(_)
|
||
| Expression::FunctionExpression(_)
|
||
| Expression::ClassExpression(_)
|
||
| Expression::NewExpression(_) => self.emit_function_domain(expr, ctx),
|
||
Expression::Identifier(ident) => self.emit_identifier_expression(ident, ctx),
|
||
Expression::CallExpression(_) => self.emit_call_domain(expr, ctx),
|
||
Expression::ThisExpression(_) => self.emit_this_expression(ctx),
|
||
Expression::SequenceExpression(seq) => self.emit_sequence_expression(seq, ctx),
|
||
Expression::ParenthesizedExpression(p) => self.emit_parenthesized_expression(p, ctx),
|
||
_ => self.emit_unsupported_expression(expr, ctx),
|
||
}
|
||
}
|
||
|
||
/// Emit a full program into an IRFunction (top-level module body).
|
||
/// Split from the original `Compiler::compile`: this is the emit half;
|
||
/// oxide_compiler::Compiler::compile calls this then `oxide_ir::lower::lower`.
|
||
pub fn emit_program(&self, program: &oxide_parser::Program) -> Result<IRFunction, String> {
|
||
let mut ctx = CompileCtx::new();
|
||
ctx.pre_register_builtins();
|
||
self.predeclare_function_declarations(&program.body, &mut ctx);
|
||
|
||
// Pre-register builtin identifier references before any temporary register
|
||
// is emitted, keeping builtin slots clear of the temporary register pool.
|
||
self.pre_register_builtin_references(&program.body, &mut ctx);
|
||
|
||
// Pre-declare top-level `var` names so hoisted function declarations
|
||
// (emitted in the first sub-pass below) can resolve the outer vars.
|
||
self.predeclare_var_declarations(&program.body, &mut ctx);
|
||
|
||
// 闭包捕获分析（AST 级，emit 前确定）
|
||
ctx.own_bindings = self.collect_own_binding_names(&[], &program.body);
|
||
ctx.captured_bindings = self.collect_captured_bindings(&program.body, &ctx.own_bindings);
|
||
|
||
// First sub-pass: emit FunctionDeclarations (hoisting)
|
||
// This ensures function objects are available before any code runs.
|
||
for stmt in &program.body {
|
||
if matches!(stmt, Statement::FunctionDeclaration(_)) {
|
||
self.emit_statement(stmt, &mut ctx)?;
|
||
}
|
||
}
|
||
|
||
// Second sub-pass: emit all other statements
|
||
let mut last_result: Option<u32> = None;
|
||
for stmt in &program.body {
|
||
if matches!(stmt, Statement::FunctionDeclaration(_)) {
|
||
continue; // Already emitted above
|
||
}
|
||
match self.emit_statement(stmt, &mut ctx)? {
|
||
Some(r) => last_result = Some(r),
|
||
None => last_result = None,
|
||
}
|
||
}
|
||
if let Some(r) = last_result {
|
||
ctx.inst(Inst::new(OpCode::LOAD_VAR, Operand::None, Operand::Reg(r), Operand::None));
|
||
} else {
|
||
let undef_idx = ctx.add_constant(Constant::Undefined);
|
||
ctx.inst(Inst::load_const(Operand::None, undef_idx));
|
||
}
|
||
ctx.inst(Inst::new(OpCode::HALT, Operand::None, Operand::None, Operand::None));
|
||
|
||
let ir = ctx.assemble_ir(
|
||
oxide_ir::ParamLayout {
|
||
base: ctx.scopes.builtin_reg_map.len() as u32,
|
||
count: 0,
|
||
},
|
||
None,
|
||
);
|
||
Ok(ir)
|
||
}
|
||
}
|
||
|
||
impl Default for Emitter {
|
||
fn default() -> Self {
|
||
Self::new()
|
||
}
|
||
}
|