biujs 0.1.0-alpha.0

A lightweight, embeddable JavaScript engine with ES6 support
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
use petgraph::{algo::dominators::Dominators, graph::NodeIndex};

use std::collections::{BTreeMap, HashMap, HashSet};

use crate::compiler::ir::instruction::Variable;
use crate::compiler::ir::{BlockId, ControlFlowGraph, Instruction, Value};

/// 变量版本栈,用于SSA重命名
/// 键:原始变量ID,值:版本栈(栈顶是当前活跃版本)
type VersionStack = HashMap<Variable, Vec<Variable>>;

/// 记录每个块中每个原始变量的最终版本
/// 用于在重命名后查找正确的变量版本
type BlockVarVersions = HashMap<BlockId, HashMap<Variable, Variable>>;

#[derive(Debug)]
struct VariableInfo {
    defs: Vec<(BlockId, usize)>, // 写点
    uses: Vec<(BlockId, usize)>, // 读点
}

impl VariableInfo {
    pub fn new() -> Self {
        Self {
            defs: Vec::new(),
            uses: Vec::new(),
        }
    }
}

pub struct SSABuilder<'a> {
    cfg: &'a mut ControlFlowGraph,
    dominators: Dominators<NodeIndex>,
    /// 记录每个throw块对应的异常handler块列表
    throw_to_handlers: HashMap<BlockId, Vec<BlockId>>,
}

impl<'a> SSABuilder<'a> {
    pub fn new(cfg: &'a mut ControlFlowGraph) -> Self {
        let dominators = cfg.dominators();
        Self {
            cfg,
            dominators,
            throw_to_handlers: HashMap::new(),
        }
    }

    /// 完整的SSA转换流程
    pub fn convert_to_ssa(&mut self) {
        // 0. 预处理:为所有Throw指令添加异常边到对应的SEH handler
        self.add_exception_edges_for_throws();

        // 重新计算支配关系(添加异常边后,支配关系可能改变)
        self.dominators = self.cfg.dominators();

        // 1. 收集变量的定义和使用信息
        let var_info = self.collect_var_def_and_use();

        // 2. 计算支配边界
        let dominance_frontier = self.cfg.dominance_frontier(&self.dominators);

        // 3. 确定Phi节点位置
        let phi_placements = self.determine_phi_nodes(&var_info, &dominance_frontier);

        // 3.5 Build the block → phi-variable mapping ONCE, in a deterministic
        //     order. Parameters and jump arguments must be emitted in exactly
        //     the same order, and `phi_placements` is a HashMap whose iteration
        //     order is not stable between the two traversals.
        let block_phi_vars = Self::build_block_phi_vars(&phi_placements);

        // 4. 添加Phi块参数
        self.add_phi_parameters(&block_phi_vars);



        // 5. 变量重命名,并记录每个块中每个原始变量的最终版本
        let block_var_versions = self.rename_variables(&var_info);

        // 6. 处理跳转参数(在重命名之后,使用重命名后的变量)
        self.handle_jump_args(&block_phi_vars, &block_var_versions);
    }

    /// Group phi placements by block, keeping variable ids sorted so the
    /// resulting parameter/argument order is stable.
    fn build_block_phi_vars(
        phi_placements: &HashMap<Variable, Vec<BlockId>>,
    ) -> BTreeMap<BlockId, Vec<Variable>> {
        let mut vars: Vec<Variable> = phi_placements.keys().copied().collect();
        vars.sort_by_key(|var| var.as_usize());

        let mut result: BTreeMap<BlockId, Vec<Variable>> = BTreeMap::new();
        for var in vars {
            for block_id in &phi_placements[&var] {
                let entry = result.entry(*block_id).or_default();
                if !entry.contains(&var) {
                    entry.push(var);
                }
            }
        }
        result
    }

    /// 预处理:扫描所有块,为每个Throw指令添加从throw块到对应SEH handler的异常边
    fn add_exception_edges_for_throws(&mut self) {
        let mut seh_scope: Vec<(BlockId, Option<BlockId>)> = Vec::new();
        let mut throw_edges: Vec<(BlockId, BlockId)> = Vec::new();

        // Track the outer SEH scope for each finally block (the scope BEFORE its PushSeh)
        // This is used for ResumeException: when finally propagates an exception,
        // it goes to these outer handlers
        let mut finally_outer_scope: HashMap<BlockId, Vec<(BlockId, Option<BlockId>)>> =
            HashMap::new();

        for block in self.cfg.blocks() {
            for inst in block.instructions() {
                match inst {
                    Instruction::PushSeh { handler, finally } => {
                        if let Some(finally_blk) = finally {
                            finally_outer_scope.insert(*finally_blk, seh_scope.clone());
                        }
                        seh_scope.push((*handler, *finally));
                    }
                    Instruction::PopSeh => {
                        seh_scope.pop();
                    }
                    Instruction::Throw { .. } => {
                        for (catch_handler, finally_handler) in &seh_scope {
                            throw_edges.push((block.id(), *catch_handler));
                            if let Some(finally_blk) = finally_handler {
                                throw_edges.push((block.id(), *finally_blk));
                            }
                        }
                        break;
                    }
                    Instruction::ResumeException { .. } => {
                        if let Some(outer_scope) = finally_outer_scope.get(&block.id()) {
                            for (catch_handler, _) in outer_scope {
                                throw_edges.push((block.id(), *catch_handler));
                            }
                        }
                    }
                    _ => {}
                }
            }
        }

        // 记录所有含 throw / resume_exception 的块,稍后统一推导其 handler。
        // 不能只依赖线性扫描得到的 seh_scope:块的物理顺序并不等于 SEH 嵌套顺序,
        // `pop_seh` 可能弹错作用域,导致漏掉真实存在的边(例如 catch → finally)。
        let mut exception_blocks: HashSet<BlockId> = HashSet::new();

        // 添加异常边(如果尚未添加)
        for (throw_block, handler) in throw_edges {
            let successors = self.cfg.get_successors(throw_block);
            if !successors.contains(&handler) {
                self.cfg.add_edge(throw_block, handler);
            }
        }

        for block in self.cfg.blocks() {
            for inst in block.instructions() {
                if matches!(
                    inst,
                    Instruction::Throw { .. } | Instruction::ResumeException { .. }
                ) {
                    exception_blocks.insert(block.id());
                    break;
                }
            }
        }

        // 一个异常块的 handler 就是它在 CFG 中的所有后继。
        for block_id in exception_blocks {
            let successors = self.cfg.get_successors(block_id).clone();
            self.throw_to_handlers.insert(block_id, successors);
        }
    }

    /// 收集所有变量的定义和使用点
    fn collect_var_def_and_use(&self) -> HashMap<Variable, VariableInfo> {
        let mut map = HashMap::new();

        for block in self.cfg.blocks() {
            for (idx, inst) in block.instructions().iter().enumerate() {
                let (defined, used) = inst.defined_and_used_vars();

                for var in defined {
                    map.entry(var)
                        .or_insert_with(VariableInfo::new)
                        .defs
                        .push((block.id(), idx));
                }

                for var in used {
                    map.entry(var)
                        .or_insert_with(VariableInfo::new)
                        .uses
                        .push((block.id(), idx));
                }
            }
        }

        map
    }

    /// 计算需要插入Phi节点的位置
    fn determine_phi_nodes(
        &self,
        var_info: &HashMap<Variable, VariableInfo>,
        dominance_frontier: &BTreeMap<BlockId, Vec<BlockId>>,
    ) -> HashMap<Variable, Vec<BlockId>> {
        let mut phi_placements: HashMap<Variable, Vec<BlockId>> = HashMap::new();

        for (var, info) in var_info {
            if info.defs.len() <= 1 {
                continue;
            }

            // 获取所有定义点所在的块
            let def_blocks: HashSet<BlockId> = info.defs.iter().map(|(block, _)| *block).collect();

            // 计算支配边界闭包。
            //
            // `def_blocks` 是 `HashSet`,直接迭代会让 worklist(以及最终
            // `phi_placements[var]` 的 push 顺序)随进程的哈希种子变化,进而让
            // 块参数的顺序、乃至同一份源码生成的字节码在不同运行间不同。先排序固定
            // 下来。
            let mut worklist: Vec<BlockId> = def_blocks.iter().cloned().collect();
            worklist.sort_unstable();
            let mut visited = HashSet::new();

            while let Some(block) = worklist.pop() {
                if let Some(df_blocks) = dominance_frontier.get(&block) {
                    for &df_block in df_blocks {
                        if !visited.contains(&df_block) {
                            visited.insert(df_block);
                            worklist.push(df_block);
                            phi_placements.entry(*var).or_default().push(df_block);
                        }
                    }
                }
            }

            // **新增:特别处理汇合块**
            // 获取变量的所有使用点。排序以保持确定性(见上)。
            let mut use_blocks: Vec<BlockId> = info.uses.iter().map(|(block, _)| *block).collect();
            use_blocks.sort_unstable();
            use_blocks.dedup();

            // 检查是否有多个定义流向同一个使用块
            for &use_block in &use_blocks {
                // 找到流向该使用块的所有前驱
                let predecessors = self.get_block_predecessors(use_block);

                // 检查哪些前驱块中有该变量的定义
                let preds_with_def: Vec<_> = predecessors
                    .iter()
                    .filter(|&&pred| {
                        def_blocks.contains(&pred)
                            || phi_placements
                                .get(var)
                                .is_some_and(|blocks| blocks.contains(&pred)) // 或者前驱块中有该变量的phi
                    })
                    .collect();

                // 汇合块需要 phi:只要该块有多个前驱、且其中至少一个定义了该变量,
                // 从不同前驱到达的版本就可能不同(例如 catch 块给变量赋值后,
                // 另一条经由 finally 的路径仍携带旧版本)。
                // 只统计"有定义的前驱"个数会漏掉这种情况。
                if predecessors.len() > 1 && !preds_with_def.is_empty() && !visited.contains(&use_block) {
                    visited.insert(use_block);
                    phi_placements.entry(*var).or_default().push(use_block);

                    // 将该使用块加入工作列表,因为它可能影响下游
                    worklist.push(use_block);
                }
            }
        }

        // Canonicalise the per-variable block lists so the resulting block
        // parameter order does not depend on hash iteration order.
        for blocks in phi_placements.values_mut() {
            blocks.sort_unstable();
            blocks.dedup();
        }

        phi_placements
    }

    /// 为需要Phi节点的块添加块参数
    fn add_phi_parameters(&mut self, block_phi_vars: &BTreeMap<BlockId, Vec<Variable>>) {
        for (block_id, vars) in block_phi_vars {
            for var in vars {
                self.cfg.append_block_param(*block_id, *var);
            }
        }
    }

    /// 处理跳转参数:为跳转到需要Phi参数的块的前驱块添加参数
    fn handle_jump_args(
        &mut self,
        block_phi_vars: &BTreeMap<BlockId, Vec<Variable>>,
        block_var_versions: &BlockVarVersions,
    ) {
        // 为每个需要Phi的块处理其前驱块的跳转指令
        for (block_id, sorted_vars) in block_phi_vars {
            let predecessors = self.cfg.get_precedences(*block_id).clone();

            for pred_block_id in predecessors {
                // 获取前驱块中原始变量的最终版本。
                // 缺失时必须补 `undefined` 而不是跳过,否则实参个数少于形参个数,
                // 后续所有实参都会错位。
                let arg_values: Vec<Value> = sorted_vars
                    .iter()
                    .map(|phi_var| {
                        match block_var_versions
                            .get(&pred_block_id)
                            .and_then(|pred_vars| pred_vars.get(phi_var).copied())
                        {
                            Some(var) => Value::Variable(var),
                            None => Value::Primitive(crate::bytecode::Primitive::Undefined),
                        }
                    })
                    .collect();

                // 在前驱块的跳转指令中添加参数
                self.add_jump_arguments(pred_block_id, *block_id, &arg_values);
            }
        }
    }

    /// 为指定前驱块的跳转到目标块的指令添加参数
    fn add_jump_arguments(
        &mut self,
        pred_block_id: BlockId,
        target_block_id: BlockId,
        arg_values: &[Value],
    ) {
        // 预先获取后继信息,避免与后续可变借用冲突
        let successors: Vec<BlockId> = self.cfg.get_successors(pred_block_id).clone();
        let is_successor = successors.contains(&target_block_id);

        if let Some(pred_block) = self.cfg.get_block_mut(pred_block_id) {
            for inst in pred_block.instructions_mut().iter_mut() {
                match inst {
                    Instruction::Jump { dst, args } if dst.to_block() == target_block_id => {
                        args.extend(arg_values.iter().copied());
                    }
                    Instruction::BrIf {
                        true_blk,
                        false_blk,
                        true_args,
                        false_args,
                        ..
                    } if true_blk.to_block() == target_block_id
                        || false_blk.to_block() == target_block_id =>
                    {
                        if true_blk.to_block() == target_block_id {
                            true_args.extend(arg_values.iter().copied());
                        } else {
                            false_args.extend(arg_values.iter().copied());
                        }
                    }
                    Instruction::Throw { args, .. } => {
                        // Every successor of a `throw` is an exception handler
                        // (catch and/or finally), whether the edge was recorded
                        // by the CFG scan or added explicitly while lowering.
                        if is_successor && args.is_empty() {
                            args.extend(arg_values.iter().copied());
                        }
                    }
                    Instruction::ResumeException { args } => {
                        // Same reasoning as `throw`: a finally block re-throwing
                        // propagates to every enclosing handler edge.
                        if is_successor && args.is_empty() {
                            args.extend(arg_values.iter().copied());
                        }
                    }
                    _ => {}
                }
            }
        }
    }

    /// 获取块的前驱
    fn get_block_predecessors(&self, block_id: BlockId) -> &Vec<BlockId> {
        self.cfg.get_precedences(block_id)
    }

    /// 执行SSA重命名算法
    fn rename_variables(&mut self, var_info: &HashMap<Variable, VariableInfo>) -> BlockVarVersions {
        let mut stacks: VersionStack = HashMap::new();
        let mut block_var_versions: BlockVarVersions = HashMap::new();

        // 从入口块开始遍历支配树
        let entry = self.cfg.entry().unwrap();
        self.rename_variables_in_block(entry, &mut stacks, var_info, &mut block_var_versions);

        block_var_versions
    }

    /// 重命名指定块及其子树中的变量
    fn rename_variables_in_block(
        &mut self,
        block_id: BlockId,
        stacks: &mut VersionStack,
        var_info: &HashMap<Variable, VariableInfo>,
        block_var_versions: &mut BlockVarVersions,
    ) {
        // 保存进入此块前的栈快照(用于在处理完所有子节点后恢复)
        let initial_snapshot: HashMap<Variable, Vec<Variable>> = stacks
            .iter()
            .map(|(var_id, stack)| (*var_id, stack.clone()))
            .collect();

        // 处理块参数(Phi参数)
        self.process_block_parameters(block_id, stacks);

        // 处理块内指令
        self.process_block_instructions(block_id, stacks);

        // 记录此块中每个原始变量的最终版本
        self.record_block_final_versions(block_id, stacks, block_var_versions);

        // 递归处理支配树中的子节点(确保子节点间状态隔离)
        self.process_child_blocks(block_id, stacks, var_info, block_var_versions);

        // 恢复进入此块前的栈状态
        *stacks = initial_snapshot;
    }

    /// 处理块参数(Phi参数):创建新版本并更新块参数引用
    fn process_block_parameters(&mut self, block_id: BlockId, stacks: &mut VersionStack) {
        let param_var_ids: Vec<Variable> = self.cfg.get_block_params(block_id);

        // 为每个phi参数创建新版本
        let mut new_versions: HashMap<Variable, Variable> = HashMap::new();
        for var_id in &param_var_ids {
            let new_version = self.cfg.create_variable();
            let new_var_id = new_version.to_variable();
            new_versions.insert(*var_id, new_var_id);
        }

        // 更新块参数引用(将参数中的原始变量ID替换为新版本)
        {
            let block = self.cfg.get_block_mut(block_id).unwrap();
            for param in block.params_mut().iter_mut() {
                if let Some(new_version) = new_versions.get(param) {
                    *param = *new_version;
                }
            }
        }

        // 将新的phi参数版本压入栈中
        for (var_id, new_var_id) in new_versions {
            stacks.entry(var_id).or_default().push(new_var_id);
        }
    }

    /// 处理块内指令:重命名并更新变量栈
    fn process_block_instructions(&mut self, block_id: BlockId, stacks: &mut VersionStack) {
        let block = self.cfg.get_block_mut(block_id).unwrap();
        let mut instructions: Vec<Instruction> = block.instructions_mut().drain(..).collect();

        for inst in instructions.iter_mut() {
            let (defined, _) = inst.defined_and_used_vars();

            // 为定义创建新版本(先不压栈)
            let mut new_versions = HashMap::new();
            for var in &defined {
                let new_ver = self.cfg.create_variable().to_variable();
                new_versions.insert(*var, Value::Variable(new_ver));
            }

            // 重命名指令(使用点使用当前栈,定义点使用新版本)
            SSABuilder::rename_instruction(inst, &new_versions, stacks);

            // 将新定义的变量版本压栈
            for var in &defined {
                if let Some(new_ver) = new_versions.get(var)
                    && let Value::Variable(var_id) = new_ver
                {
                    stacks.entry(*var).or_default().push(*var_id);
                }
            }

            // 如果本条是 Jump/BrIf,立即回退它的 def (如果它定义了变量)
            if matches!(inst, Instruction::Jump { .. } | Instruction::BrIf { .. }) {
                for var in defined {
                    if let Some(stack) = stacks.get_mut(&var) {
                        stack.pop(); // 弹出jump/brif定义的变量
                    }
                }
            }
        }

        // 将处理后的指令放回块中
        let block = self.cfg.get_block_mut(block_id).unwrap();
        *block.instructions_mut() = instructions;
    }

    /// 记录此块中每个原始变量的最终版本
    fn record_block_final_versions(
        &self,
        block_id: BlockId,
        stacks: &VersionStack,
        block_var_versions: &mut BlockVarVersions,
    ) {
        for (var_id, stack) in stacks.iter() {
            if let Some(&current_version) = stack.last() {
                block_var_versions
                    .entry(block_id)
                    .or_default()
                    .insert(*var_id, current_version);
            }
        }
    }

    /// 递归处理支配树中的子节点,确保子节点间状态隔离
    fn process_child_blocks(
        &mut self,
        block_id: BlockId,
        stacks: &mut VersionStack,
        var_info: &HashMap<Variable, VariableInfo>,
        block_var_versions: &mut BlockVarVersions,
    ) {
        let block_node = self.cfg.graph_node(block_id);

        // 收集所有子节点
        let child_nodes: Vec<_> = self
            .cfg
            .graph_node_indices()
            .iter()
            .cloned()
            .filter(|node| self.dominators.immediate_dominator(*node) == Some(block_node))
            .collect();

        // 为每个子节点处理,确保状态隔离
        for child_node in child_nodes {
            let child_block_id = self.cfg.graph_node_weight(child_node);

            // 保存当前状态
            let child_snapshot: HashMap<Variable, Vec<Variable>> = stacks
                .iter()
                .map(|(var_id, stack)| (*var_id, stack.clone()))
                .collect();

            // 处理子节点
            self.rename_variables_in_block(child_block_id, stacks, var_info, block_var_versions);

            // 恢复状态以处理下一个子节点
            *stacks = child_snapshot;
        }
    }

    /// 重命名指令中的变量引用
    fn rename_instruction(
        inst: &mut Instruction,
        new_versions: &HashMap<Variable, Value>,
        stacks: &VersionStack,
    ) {
        match inst {
            Instruction::LoadArg { dst, .. } => {
                SSABuilder::rename_definition(dst, new_versions);
            }
            Instruction::LoadConst { dst, .. } => {
                SSABuilder::rename_definition(dst, new_versions);
            }
            Instruction::LoadEnv { dst, .. } => {
                SSABuilder::rename_definition(dst, new_versions);
            }
            Instruction::Move { dst, src } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(src, stacks);
            }
            Instruction::UnaryOp { dst, src, .. } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(src, stacks);
            }
            Instruction::BinaryOp { dst, lhs, rhs, .. } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(lhs, stacks);
                SSABuilder::rename_use(rhs, stacks);
            }
            Instruction::Call { func, args, result } => {
                SSABuilder::rename_definition(result, new_versions);
                SSABuilder::rename_use(func, stacks);
                for arg in args.iter_mut() {
                    SSABuilder::rename_use(arg, stacks);
                }
            }
            Instruction::CallEx {
                callable,
                args,
                result,
            } => {
                SSABuilder::rename_definition(result, new_versions);
                SSABuilder::rename_use(callable, stacks);
                for arg in args.iter_mut() {
                    SSABuilder::rename_use(arg, stacks);
                }
            }
            Instruction::CallNative { func, args, result } => {
                SSABuilder::rename_definition(result, new_versions);
                SSABuilder::rename_use(func, stacks);
                for arg in args.iter_mut() {
                    SSABuilder::rename_use(arg, stacks);
                }
            }
            Instruction::PropertyGet {
                dst,
                object,
                property,
            } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(object, stacks);
                SSABuilder::rename_use(property, stacks);
            }
            Instruction::PropertyDelete {
                dst,
                object,
                property,
            } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(object, stacks);
                SSABuilder::rename_use(property, stacks);
            }
            Instruction::IndexDelete {
                dst,
                object,
                index,
            } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(object, stacks);
                SSABuilder::rename_use(index, stacks);
            }
            Instruction::StoreEnv { name, value } => {
                SSABuilder::rename_use(name, stacks);
                SSABuilder::rename_use(value, stacks);
            }
            Instruction::Arguments { dst } => {
                SSABuilder::rename_definition(dst, new_versions);
            }
            Instruction::LoadNewTarget { dst } => {
                SSABuilder::rename_definition(dst, new_versions);
            }
            Instruction::LoadCurrentFunction { dst } => {
                SSABuilder::rename_definition(dst, new_versions);
            }
            Instruction::Yield { dst, src } => {
                SSABuilder::rename_definition(dst, new_versions);
                if let Some(src) = src {
                    SSABuilder::rename_use(src, stacks);
                }
            }
            Instruction::IteratorClose { iter } => {
                SSABuilder::rename_use(iter, stacks);
            }
            Instruction::ToString { dst, src } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(src, stacks);
            }
            Instruction::MakeRest { dst, .. } => {
                SSABuilder::rename_definition(dst, new_versions);
            }
            Instruction::CallSpread {
                result,
                callee,
                this,
                args,
            } => {
                SSABuilder::rename_definition(result, new_versions);
                SSABuilder::rename_use(callee, stacks);
                SSABuilder::rename_use(this, stacks);
                SSABuilder::rename_use(args, stacks);
            }
            Instruction::NewSpread {
                dst,
                constructor,
                args,
            } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(constructor, stacks);
                SSABuilder::rename_use(args, stacks);
            }
            Instruction::CallSuper {
                result,
                callee,
                this,
                args,
            } => {
                SSABuilder::rename_definition(result, new_versions);
                SSABuilder::rename_use(callee, stacks);
                SSABuilder::rename_use(this, stacks);
                SSABuilder::rename_use(args, stacks);
            }
            Instruction::PropertySet {
                object,
                property,
                value,
            } => {
                SSABuilder::rename_use(object, stacks);
                SSABuilder::rename_use(property, stacks);
                SSABuilder::rename_use(value, stacks);
            }
            Instruction::PropertyCall {
                object,
                property,
                args,
                result,
            } => {
                SSABuilder::rename_definition(result, new_versions);
                SSABuilder::rename_use(object, stacks);
                SSABuilder::rename_use(property, stacks);
                for arg in args.iter_mut() {
                    SSABuilder::rename_use(arg, stacks);
                }
            }
            Instruction::Return { value } => {
                if let Some(val) = value {
                    SSABuilder::rename_use(val, stacks);
                }
            }
            Instruction::Jump { dst, args } => {
                SSABuilder::rename_use(dst, stacks);
                for arg in args.iter_mut() {
                    SSABuilder::rename_use(arg, stacks);
                }
            }
            Instruction::BrIf {
                condition,
                true_blk,
                false_blk,
                true_args,
                false_args,
            } => {
                SSABuilder::rename_use(condition, stacks);
                SSABuilder::rename_use(true_blk, stacks);
                SSABuilder::rename_use(false_blk, stacks);
                for arg in true_args.iter_mut() {
                    SSABuilder::rename_use(arg, stacks);
                }
                for arg in false_args.iter_mut() {
                    SSABuilder::rename_use(arg, stacks);
                }
            }
            Instruction::MakeIterator { src, dst } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(src, stacks);
            }
            Instruction::IterateNext {
                iter,
                item,
                has_next,
            } => {
                SSABuilder::rename_definition(item, new_versions);
                SSABuilder::rename_definition(has_next, new_versions);
                SSABuilder::rename_use(iter, stacks);
            }
            Instruction::MakeArray { dst } => {
                SSABuilder::rename_definition(dst, new_versions);
            }
            Instruction::ArrayPush { array, value } => {
                SSABuilder::rename_use(array, stacks);
                SSABuilder::rename_use(value, stacks);
            }
            Instruction::ArrayPushSpread { array, src } => {
                SSABuilder::rename_use(array, stacks);
                SSABuilder::rename_use(src, stacks);
            }
            Instruction::MakeObject { dst } => {
                SSABuilder::rename_definition(dst, new_versions);
            }
            Instruction::IndexGet { dst, object, index } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(object, stacks);
                SSABuilder::rename_use(index, stacks);
            }
            Instruction::IndexSet {
                object,
                index,
                value,
            } => {
                SSABuilder::rename_use(object, stacks);
                SSABuilder::rename_use(index, stacks);
                SSABuilder::rename_use(value, stacks);
            }
            Instruction::Halt { value } => {
                if let Some(v) = value {
                    SSABuilder::rename_use(v, stacks);
                }
            }
            Instruction::PushSeh { .. } => {}
            Instruction::PopSeh => {}
            Instruction::Throw { value, args } => {
                SSABuilder::rename_use(value, stacks);
                for arg in args.iter_mut() {
                    SSABuilder::rename_use(arg, stacks);
                }
            }
            Instruction::LoadException { dst } => {
                SSABuilder::rename_definition(dst, new_versions);
            }
            Instruction::ResumeException { .. } => {
                // No variables to rename
            }
            Instruction::DelayedJump { .. } => {
                // No variables to rename
            }
            Instruction::TypeOf { dst, src } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(src, stacks);
            }
            Instruction::TypeOfEnv { dst, name } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(name, stacks);
            }
            Instruction::New {
                dst,
                constructor,
                args,
            } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(constructor, stacks);
                for arg in args.iter_mut() {
                    SSABuilder::rename_use(arg, stacks);
                }
            }
            Instruction::LoadThis { dst } => {
                SSABuilder::rename_definition(dst, new_versions);
            }
            Instruction::MakeFuncObj { dst, func_id } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(func_id, stacks);
            }
            Instruction::MakeArrowFuncObj {
                dst,
                func_id,
                captured_this,
            } => {
                SSABuilder::rename_definition(dst, new_versions);
                SSABuilder::rename_use(func_id, stacks);
                SSABuilder::rename_use(captured_this, stacks);
            }
            Instruction::ClosureVar { name: _, value } => {
                SSABuilder::rename_use(value, stacks);
            }
        }
    }

    /// 重命名定义点:使用预创建的新版本
    fn rename_definition(var: &mut Value, new_versions: &HashMap<Variable, Value>) {
        if let Value::Variable(var_id) = var
            && let Some(new_version) = new_versions.get(var_id)
        {
            *var = *new_version;
        }
    }

    /// 重命名使用点:从栈顶获取当前版本
    fn rename_use(var: &mut Value, stacks: &VersionStack) {
        if let Value::Variable(var_id) = var
            && let Some(stack) = stacks.get(var_id)
            && let Some(current_version) = stack.last()
        {
            *var = Value::Variable(*current_version);
        }
        // 如果栈为空,说明变量未定义,保持原样(可能会在后端报错)
    }

    /// 提取throw_to_handlers映射并消费SSABuilder
    pub fn into_throw_to_handlers(self) -> HashMap<BlockId, Vec<BlockId>> {
        self.throw_to_handlers
    }
}