midenc-dialect-scf 0.8.0

Miden IR Structured Control Flow Dialect
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
use alloc::rc::Rc;
use core::{any::TypeId, ops::Index};

use midenc_hir::{
    patterns::{Pattern, PatternBenefit, PatternInfo, PatternKind, RewritePattern},
    *,
};

use crate::*;

/// Lift common yield results from their regions to their predecessors.
pub struct FoldRedundantYields {
    info: PatternInfo,
}

impl FoldRedundantYields {
    pub fn new(context: Rc<Context>) -> Self {
        Self {
            info: PatternInfo::new(
                context,
                "fold-redundant-yields",
                PatternKind::Trait(TypeId::of::<dyn RegionBranchOpInterface>()),
                PatternBenefit::MAX,
            ),
        }
    }
}

impl Pattern for FoldRedundantYields {
    fn info(&self) -> &PatternInfo {
        &self.info
    }
}

impl RewritePattern for FoldRedundantYields {
    fn match_and_rewrite(
        &self,
        op_ref: OperationRef,
        rewriter: &mut dyn Rewriter,
    ) -> Result<bool, Report> {
        let op = op_ref.borrow();

        let Some(br_op) = op.as_trait::<dyn RegionBranchOpInterface>() else {
            return Ok(false);
        };

        // For each successor gather its terminator and the terminator operands.
        let mut term_ops: SmallVec<[_; 4]> = SmallVec::new();
        let mut region_yields: SmallVec<[_; 4]> = SmallVec::new();

        for succ_region in br_op.get_successor_regions(RegionBranchPoint::Parent) {
            let Some(region_ref) = succ_region.successor() else {
                return Ok(false);
            };

            // Several assertions follow: an SCF region always has a single block, that block must
            // have a terminator which then implements RegionBranchTerminatorOpInterface.
            let region = region_ref.borrow();

            assert!(region.has_one_block());

            let block = region.entry();
            let term_op_ref =
                block.terminator().expect("All region blocks must have a terminator.");

            // Got the terminator.
            let term_op = term_op_ref.borrow();
            let term_op = term_op.as_trait::<dyn RegionBranchTerminatorOpInterface>().expect(
                "All region block terminators must impl RegionBranchTerminatorOpInterface.",
            );

            // For now we only support regions with a simple `yield` terminator.  This may change
            // in the future if/when we support other RegionBranchOps (e.g., `while`).
            if !term_op.as_operation().is::<Yield>() {
                return Ok(false);
            }

            // Save the terminator and each of its opands paired with their indices.
            term_ops.push(term_op_ref);
            region_yields.push(
                term_op
                    .get_successor_operands(RegionBranchPoint::Parent)
                    .forwarded()
                    .iter()
                    .map(|opand_ref| {
                        let opand = opand_ref.borrow();
                        (opand.index(), opand.as_value_ref())
                    })
                    .collect::<adt::SmallSet<_, 4>>(),
            );
        }

        if region_yields.len() < 2 {
            return Ok(false);
        }

        // Fold the yield opand sets down via intersection to a final set which will contain the
        // redundant values.
        let redundant_yield_vals = region_yields
            .into_iter()
            .reduce(|acc, region_yield_vals| acc.intersection(&region_yield_vals))
            .expect("Have already checked region_yields is non-empty.");

        if redundant_yield_vals.is_empty() {
            // No redundant values found.
            return Ok(false);
        }

        // Save a copy of the redundant result positions.
        let mut redundant_result_positions =
            redundant_yield_vals.iter().map(|(pos, _)| *pos).collect::<SmallVec<[_; 4]>>();

        let all_results_are_redundant = redundant_yield_vals.len() == op.num_results();

        if all_results_are_redundant && op.is_memory_effect_free() {
            // The entire operation is actually redundant; just remove it.  Make sure the yield
            // vals are sorted first.
            let mut sorted_vals = redundant_yield_vals.into_vec();
            sorted_vals.sort_unstable_by(|a, b| a.0.cmp(&b.0));

            // Wrap each of the values in Some.
            let some_vals =
                sorted_vals.into_iter().map(|(_, val)| Some(val)).collect::<SmallVec<[_; 4]>>();

            // Replace the operation.
            drop(op);
            rewriter.replace_op_with_values(op_ref, &some_vals);
        } else {
            // Replace all uses of the redundant results.
            for (redundant_opand_pos, redundant_yield_val) in redundant_yield_vals {
                let result_val_ref =
                    op.results().index(redundant_opand_pos).borrow().as_value_ref();
                if result_val_ref.borrow().is_used() {
                    rewriter.replace_all_uses_of_value_with(result_val_ref, redundant_yield_val);
                }
            }

            // Next remove the redundant results.  Iterate for each position in reverse to avoid
            // invalidating offsets as we go.
            redundant_result_positions.sort_unstable_by(|a, b| b.cmp(a));
            {
                let mut op = op.into_entity_mut().unwrap();
                for idx in &redundant_result_positions {
                    op.results_mut().group_mut(0).erase(*idx);
                }
            }

            // And remove the redundant terminator operands.
            for mut term_op in term_ops {
                let mut new_opands = SmallVec::<[ValueRef; 4]>::default();

                // Make a copy of the old operands, except for the redundant value, except in the
                // case where they're all redundant where we need no operands.
                if !all_results_are_redundant {
                    for old_opand in term_op.borrow().operands().iter() {
                        if !redundant_result_positions.contains(&old_opand.index()) {
                            new_opands.push(old_opand.borrow().as_value_ref());
                        }
                    }
                }

                // Update the terminator with the new operands.
                let _guard = rewriter.modify_op_in_place(term_op);
                let mut term_op_mut = term_op.borrow_mut();
                term_op_mut.set_operands(new_opands);
            }
        }

        Ok(true)
    }
}

#[cfg(test)]
mod tests {
    use alloc::{boxed::Box, format, rc::Rc, sync::Arc, vec::Vec};

    use midenc_dialect_cf::{ControlFlowOpBuilder, SwitchCase};
    use midenc_expect_test::expect_file;
    use midenc_hir::{
        Context, Report, SourceSpan, Type,
        dialects::{builtin::BuiltinOpBuilder, test::TestOpBuilder},
        pass::{Pass, PassExecutionState},
        patterns::{
            FrozenRewritePatternSet, GreedyRewriteConfig, RewritePattern, RewritePatternSet,
        },
        testing::Test,
    };

    use super::*;

    struct SingleCanonicalizerPass {
        rewrites: Rc<FrozenRewritePatternSet>,
        should_modify: bool,
    }

    impl SingleCanonicalizerPass {
        fn new(
            context: Rc<Context>,
            pattern: Box<dyn RewritePattern>,
            should_modify: bool,
        ) -> Self {
            let pattern_set = RewritePatternSet::from_iter(context, [pattern]);
            let rewrites = Rc::new(FrozenRewritePatternSet::new(pattern_set));

            Self {
                rewrites,
                should_modify,
            }
        }
    }

    impl Pass for SingleCanonicalizerPass {
        type Target = Operation;

        fn name(&self) -> &'static str {
            "test-single-rewriter"
        }

        fn can_schedule_on(&self, _name: &OperationName) -> bool {
            true
        }

        fn run_on_operation(
            &mut self,
            op: EntityMut<'_, Self::Target>,
            state: &mut PassExecutionState,
        ) -> Result<(), Report> {
            let op_ref = op.as_operation_ref();
            drop(op);

            let converged = patterns::apply_patterns_and_fold_greedily(
                op_ref,
                self.rewrites.clone(),
                GreedyRewriteConfig::default(),
            );

            let changed = match converged {
                Ok(b) => b,
                Err(e) => {
                    panic!("Pass returned error: {e}");
                }
            };

            match (changed, self.should_modify) {
                (true, false) => panic!("Pass modified input unexpectedly."),
                (false, true) => panic!("Pass did not modify input."),
                _ => {}
            }

            state.set_post_pass_status(changed.into());

            Ok(())
        }
    }

    fn run_single_canonicalizer(test: &mut Test, should_modify: bool) -> Result<(), Report> {
        // UNCOMMENT TO DUMP (SHOW DIFF OF) CF INPUT.
        // let input = format!("{}", &operation.borrow());
        // expect_file!["non-existentent"].assert_eq(&input);

        // Run the CF->SCF pass first, then the canonicalisation pass.  Need to register the SCF
        // dialect to make sure the patterns are registered.
        test.apply_pass::<transforms::LiftControlFlowToSCF>(false)?;

        // Confirm the CF->SCF transformed IR is correct.
        let function = test.function().as_operation_ref();
        let input = format!("{}", function.borrow());
        let before_file_path = format!("expected/{}_before.hir", test.name());
        expect_file![before_file_path.as_str()].assert_eq(&input);

        let context = test.context_rc();
        let pattern = Box::new(FoldRedundantYields::new(context.clone()));
        test.apply_boxed_pass(
            Box::new(SingleCanonicalizerPass::new(context, pattern, should_modify)),
            true,
        )?;

        // Confirm the canonicalised IR is correct.
        let output = format!("{}", test.function().as_operation_ref().borrow());
        let after_file_path = format!("expected/{}_after.hir", test.name());
        expect_file![after_file_path.as_str()].assert_eq(&output);

        Ok(())
    }

    #[test]
    fn fold_redundant_yields_subset_if_switch() -> Result<(), Report> {
        let mut test =
            Test::new("fold_redundant_yields_subset_if_switch", &[Type::U32], &[Type::U32]);

        let span = SourceSpan::default();

        let mut builder = test.function_builder();
        let if_then = builder.create_block();
        let if_else = builder.create_block();
        let switch_on_one_block = builder.create_block();
        let switch_on_two_block = builder.create_block();
        let switch_default_block = builder.create_block();
        let if_final = builder.create_block();

        let if_sum_lhs = builder.append_block_param(if_final, Type::U32, span);
        let if_sum_rhs = builder.append_block_param(if_final, Type::U32, span);

        let input = builder.current_block().borrow().arguments()[0].upcast();
        let redundant_val = builder.u32(11, span)?;

        let zero = builder.u32(0, span)?;
        let is_zero = builder.eq(input, zero, span)?;
        builder.cond_br(is_zero, if_then, [], if_else, [], span)?;

        builder.switch_to_block(if_then);
        let then_non_redundant_val = builder.u32(22, span)?;
        builder.br(if_final, [redundant_val, then_non_redundant_val], span)?;

        let switch_on_one_case = SwitchCase::create(1, switch_on_one_block, Default::default());
        let switch_on_two_case = SwitchCase::create(2, switch_on_two_block, Default::default());

        builder.switch_to_block(if_else);
        builder.switch(
            input,
            [switch_on_one_case, switch_on_two_case],
            switch_default_block,
            Vec::default(),
            span,
        )?;

        builder.switch_to_block(switch_on_one_block);
        let switch_on_one_non_redundant_val = builder.u32(33, span)?;
        builder.br(if_final, [redundant_val, switch_on_one_non_redundant_val], span)?;

        builder.switch_to_block(switch_on_two_block);
        let switch_on_two_non_redundant_val = builder.u32(44, span)?;
        builder.br(if_final, [redundant_val, switch_on_two_non_redundant_val], span)?;

        builder.switch_to_block(switch_default_block);
        let switch_default_non_redundant_val = builder.u32(55, span)?;
        builder.br(if_final, [redundant_val, switch_default_non_redundant_val], span)?;

        // Add all the results together along with the redundant value to give them all users.
        builder.switch_to_block(if_final);
        let if_sum0 = builder.add(if_sum_lhs, if_sum_rhs, span)?;
        let if_sum1 = builder.add(if_sum0, redundant_val, span)?;
        builder.ret(Some(if_sum1), span)?;

        run_single_canonicalizer(&mut test, true)
    }

    #[test]
    fn fold_redundant_yields_all_if_switch() -> Result<(), Report> {
        let mut test = Test::new("fold_redundant_yields_all_if_switch", &[Type::U32], &[Type::U32]);

        let span = SourceSpan::default();

        let mut builder = test.function_builder();

        let switch_on_one_block = builder.create_block();
        let if_then_block = builder.create_block();
        let if_else_block = builder.create_block();
        let switch_on_two_block = builder.create_block();
        let switch_default_block = builder.create_block();
        let switch_final_block = builder.create_block();

        let sum_lhs = builder.append_block_param(switch_final_block, Type::U32, span);
        let sum_rhs = builder.append_block_param(switch_final_block, Type::U32, span);

        let input = builder.current_block().borrow().arguments()[0].upcast();
        let redundant_val0 = builder.u32(11, span)?;
        let redundant_val1 = builder.u32(22, span)?;

        let switch_on_one_case = SwitchCase::create(1, switch_on_one_block, Default::default());
        let switch_on_two_case = SwitchCase::create(2, switch_on_two_block, Default::default());

        builder.switch(
            input,
            [switch_on_one_case, switch_on_two_case],
            switch_default_block,
            Vec::default(),
            span,
        )?;

        builder.switch_to_block(switch_on_one_block);
        builder.br(switch_final_block, [redundant_val0, redundant_val1], span)?;

        builder.switch_to_block(switch_on_two_block);
        let zero = builder.u32(0, span)?;
        let is_zero = builder.eq(input, zero, span)?;
        builder.cond_br(is_zero, if_then_block, [], if_else_block, [], span)?;

        builder.switch_to_block(if_then_block);
        builder.br(switch_final_block, [redundant_val0, redundant_val1], span)?;

        builder.switch_to_block(if_else_block);
        builder.br(switch_final_block, [redundant_val0, redundant_val1], span)?;

        builder.switch_to_block(switch_default_block);
        builder.br(switch_final_block, [redundant_val0, redundant_val1], span)?;

        // Add all the results together along with the redundant value to give them all users.
        builder.switch_to_block(switch_final_block);
        let sum = builder.add(sum_lhs, sum_rhs, span)?;
        builder.ret(Some(sum), span)?;

        run_single_canonicalizer(&mut test, true)
    }

    #[test]
    fn fold_redundant_yields_all_switch_if() -> Result<(), Report> {
        let mut test = Test::new("fold_redundant_yields_all_switch_if", &[Type::U32], &[Type::U32]);

        let span = SourceSpan::default();

        let mut builder = test.function_builder();

        let if_then_block = builder.create_block();
        let switch_on_one_block = builder.create_block();
        let switch_on_two_block = builder.create_block();
        let switch_default_block = builder.create_block();
        let if_else_block = builder.create_block();
        let if_final_block = builder.create_block();

        let sum_lhs = builder.append_block_param(if_final_block, Type::U32, span);
        let sum_rhs = builder.append_block_param(if_final_block, Type::U32, span);

        let input = builder.current_block().borrow().arguments()[0].upcast();
        let redundant_val0 = builder.u32(11, span)?;
        let redundant_val1 = builder.u32(22, span)?;

        let zero = builder.u32(0, span)?;
        let is_not_zero = builder.neq(input, zero, span)?;
        builder.cond_br(is_not_zero, if_then_block, [], if_else_block, [], span)?;

        let switch_on_one_case = SwitchCase::create(1, switch_on_one_block, Default::default());
        let switch_on_two_case = SwitchCase::create(2, switch_on_two_block, Default::default());

        builder.switch_to_block(if_then_block);
        builder.switch(
            input,
            [switch_on_one_case, switch_on_two_case],
            switch_default_block,
            Vec::default(),
            span,
        )?;

        builder.switch_to_block(switch_on_one_block);
        builder.br(if_final_block, [redundant_val0, redundant_val1], span)?;

        builder.switch_to_block(switch_on_two_block);
        builder.br(if_final_block, [redundant_val0, redundant_val1], span)?;

        builder.switch_to_block(switch_default_block);
        builder.br(if_final_block, [redundant_val0, redundant_val1], span)?;

        builder.switch_to_block(if_else_block);
        builder.br(if_final_block, [redundant_val0, redundant_val1], span)?;

        builder.switch_to_block(if_final_block);
        let sum = builder.add(sum_lhs, sum_rhs, span)?;
        builder.ret(Some(sum), span)?;

        run_single_canonicalizer(&mut test, true)
    }

    #[test]
    fn fold_redundant_yields_many_switch() -> Result<(), Report> {
        let mut test = Test::new("fold_redundant_yields_many_switch", &[Type::U32], &[Type::U32]);

        let span = SourceSpan::default();

        let mut builder = test.function_builder();

        let switch_on_one_block = builder.create_block();
        let switch_on_two_block = builder.create_block();
        let switch_on_three_block = builder.create_block();
        let switch_on_default_block = builder.create_block();
        let switch_final_block = builder.create_block();
        let exit_block = builder.create_block();

        let final_arg0 = builder.append_block_param(switch_final_block, Type::U32, span);
        let final_arg1 = builder.append_block_param(switch_final_block, Type::U32, span);
        let final_arg2 = builder.append_block_param(switch_final_block, Type::U32, span);
        let final_arg3 = builder.append_block_param(switch_final_block, Type::U32, span);
        let final_arg4 = builder.append_block_param(switch_final_block, Type::U32, span);

        let ret_val = builder.append_block_param(exit_block, Type::U32, span);

        let input = builder.current_block().borrow().arguments()[0].upcast();

        let redundant_val11 = builder.u32(11, span)?;
        let redundant_val22 = builder.u32(22, span)?;
        let redundant_val33 = builder.u32(33, span)?;

        let switch_on_one_case = SwitchCase::create(1, switch_on_one_block, Default::default());
        let switch_on_two_case = SwitchCase::create(2, switch_on_two_block, Default::default());
        let switch_on_three_case = SwitchCase::create(3, switch_on_three_block, Default::default());

        builder.switch(
            input,
            [switch_on_one_case, switch_on_two_case, switch_on_three_case],
            switch_on_default_block,
            Vec::default(),
            span,
        )?;

        builder.switch_to_block(switch_on_one_block);
        let switch_on_one_non_redundant_val0 = builder.u32(100, span)?;
        let switch_on_one_non_redundant_val1 = builder.u32(101, span)?;
        builder.br(
            switch_final_block,
            [
                redundant_val11,
                redundant_val22,
                switch_on_one_non_redundant_val0,
                redundant_val33,
                switch_on_one_non_redundant_val1,
            ],
            span,
        )?;

        builder.switch_to_block(switch_on_two_block);
        let switch_on_two_non_redundant_val0 = builder.u32(200, span)?;
        let switch_on_two_non_redundant_val1 = builder.u32(201, span)?;
        builder.br(
            switch_final_block,
            [
                redundant_val11,
                redundant_val22,
                switch_on_two_non_redundant_val0,
                redundant_val33,
                switch_on_two_non_redundant_val1,
            ],
            span,
        )?;

        builder.switch_to_block(switch_on_three_block);
        let switch_on_three_non_redundant_val0 = builder.u32(300, span)?;
        let switch_on_three_non_redundant_val1 = builder.u32(301, span)?;
        builder.br(
            switch_final_block,
            [
                redundant_val11,
                redundant_val22,
                switch_on_three_non_redundant_val0,
                redundant_val33,
                switch_on_three_non_redundant_val1,
            ],
            span,
        )?;

        builder.switch_to_block(switch_on_default_block);
        let switch_on_default_non_redundant_val0 = builder.u32(400, span)?;
        let switch_on_default_non_redundant_val1 = builder.u32(401, span)?;
        builder.br(
            switch_final_block,
            [
                redundant_val11,
                redundant_val22,
                switch_on_default_non_redundant_val0,
                redundant_val33,
                switch_on_default_non_redundant_val1,
            ],
            span,
        )?;

        // Add all the results together.
        builder.switch_to_block(switch_final_block);
        let sum0 = builder.add(final_arg0, final_arg1, span)?;
        let sum1 = builder.add(sum0, final_arg2, span)?;
        let sum2 = builder.add(sum1, final_arg3, span)?;
        let sum3 = builder.add(sum2, final_arg4, span)?;
        builder.br(exit_block, [sum3], span)?;

        builder.switch_to_block(exit_block);
        builder.ret(Some(ret_val), span)?;

        run_single_canonicalizer(&mut test, true)
    }

    #[test]
    fn fold_redundant_yields_different_pos_switch() -> Result<(), Report> {
        let mut test =
            Test::new("fold_redundant_yields_different_pos_switch", &[Type::U32], &[Type::U32]);

        let span = SourceSpan::default();

        let mut builder = test.function_builder();

        let switch_on_one_block = builder.create_block();
        let switch_on_two_block = builder.create_block();
        let switch_on_default_block = builder.create_block();
        let switch_final_block = builder.create_block();

        let final_arg0 = builder.append_block_param(switch_final_block, Type::U32, span);
        let final_arg1 = builder.append_block_param(switch_final_block, Type::U32, span);

        let input = builder.current_block().borrow().arguments()[0].upcast();

        let redundant_val11 = builder.u32(11, span)?;
        let redundant_val22 = builder.u32(22, span)?;

        let switch_on_one_case = SwitchCase::create(1, switch_on_one_block, Default::default());
        let switch_on_two_case = SwitchCase::create(2, switch_on_two_block, Default::default());

        builder.switch(
            input,
            [switch_on_one_case, switch_on_two_case],
            switch_on_default_block,
            Vec::default(),
            span,
        )?;

        builder.switch_to_block(switch_on_one_block);
        builder.br(switch_final_block, [redundant_val11, redundant_val22], span)?;

        // 'yielding' args in reverse order.
        builder.switch_to_block(switch_on_two_block);
        builder.br(switch_final_block, [redundant_val22, redundant_val11], span)?;

        builder.switch_to_block(switch_on_default_block);
        builder.br(switch_final_block, [redundant_val11, redundant_val22], span)?;

        // Add all the results together.
        builder.switch_to_block(switch_final_block);
        let sum = builder.add(final_arg0, final_arg1, span)?;
        builder.ret(Some(sum), span)?;

        run_single_canonicalizer(
            &mut test, false, // Should not modify input.
        )
    }

    #[test]
    fn fold_redundant_yields_all_but_one_switch() -> Result<(), Report> {
        let mut test =
            Test::new("fold_redundant_yields_all_but_one_switch", &[Type::U32], &[Type::U32]);

        let span = SourceSpan::default();

        let mut builder = test.function_builder();

        let switch_on_one_block = builder.create_block();
        let switch_on_two_block = builder.create_block();
        let switch_on_three_block = builder.create_block();
        let switch_on_default_block = builder.create_block();
        let switch_final_block = builder.create_block();
        let exit_block = builder.create_block();

        let final_arg0 = builder.append_block_param(switch_final_block, Type::U32, span);
        let final_arg1 = builder.append_block_param(switch_final_block, Type::U32, span);
        let final_arg2 = builder.append_block_param(switch_final_block, Type::U32, span);

        let ret_val = builder.append_block_param(exit_block, Type::U32, span);

        let input = builder.current_block().borrow().arguments()[0].upcast();

        let redundant_val11 = builder.u32(11, span)?;
        let redundant_val22 = builder.u32(22, span)?;
        let redundant_val33 = builder.u32(33, span)?;

        let switch_on_one_case = SwitchCase::create(1, switch_on_one_block, Default::default());
        let switch_on_two_case = SwitchCase::create(2, switch_on_two_block, Default::default());
        let switch_on_three_case = SwitchCase::create(3, switch_on_three_block, Default::default());

        builder.switch(
            input,
            [switch_on_one_case, switch_on_two_case, switch_on_three_case],
            switch_on_default_block,
            Vec::default(),
            span,
        )?;

        builder.switch_to_block(switch_on_one_block);
        builder.br(
            switch_final_block,
            [redundant_val11, redundant_val22, redundant_val33],
            span,
        )?;

        builder.switch_to_block(switch_on_two_block);
        builder.br(
            switch_final_block,
            [redundant_val11, redundant_val22, redundant_val33],
            span,
        )?;

        builder.switch_to_block(switch_on_three_block);
        builder.br(
            switch_final_block,
            [redundant_val11, redundant_val22, redundant_val33],
            span,
        )?;

        builder.switch_to_block(switch_on_default_block);
        let non_redundant_val44 = builder.u32(44, span)?;
        builder.br(
            switch_final_block,
            [redundant_val11, non_redundant_val44, redundant_val33],
            span,
        )?;

        // Add all the results together.
        builder.switch_to_block(switch_final_block);
        let sum0 = builder.add(final_arg0, final_arg1, span)?;
        let sum1 = builder.add(sum0, final_arg2, span)?;
        builder.br(exit_block, [sum1], span)?;

        builder.switch_to_block(exit_block);
        builder.ret(Some(ret_val), span)?;

        run_single_canonicalizer(&mut test, true)
    }

    #[test]
    fn fold_redundant_yields_effects_if() -> Result<(), Report> {
        let mut test = Test::new(
            "fold_redundant_yields_effects_if",
            &[Type::U32, Type::Ptr(Arc::new(PointerType::new(Type::U32)))],
            &[Type::U32],
        );

        let span = SourceSpan::default();

        let mut builder = test.function_builder();

        let if_then = builder.create_block();
        let if_else = builder.create_block();
        let if_final = builder.create_block();

        let ret_val = builder.append_block_param(if_final, Type::U32, span);

        let input = builder.current_block().borrow().arguments()[0].upcast();
        let input_ptr = builder.current_block().borrow().arguments()[1].upcast();
        let redundant_val = builder.u32(11, span)?;

        let zero = builder.u32(0, span)?;
        let is_zero = builder.eq(input, zero, span)?;
        builder.cond_br(is_zero, if_then, [], if_else, [], span)?;

        builder.switch_to_block(if_then);
        builder.br(if_final, [redundant_val], span)?;

        builder.switch_to_block(if_else);
        builder.store(input_ptr, redundant_val, span)?;
        builder.br(if_final, [redundant_val], span)?;

        // Add all the results together along with the redundant value to give them all users.
        builder.switch_to_block(if_final);
        builder.ret(Some(ret_val), span)?;

        run_single_canonicalizer(&mut test, true)
    }

    /* A `while` test which initially showed that this rewriter probably isn't suited for them. {{{

    #[test]
    fn fold_redundant_yields_subset_while() -> Result<(), Report> {
        let context = Rc::new(Context::default());
        let mut builder = OpBuilder::new(context.clone());

        let span = SourceSpan::default();
        let function = {
            let builder = builder.create::<builtin::Function, (_, _)>(span);
            let name = Ident::new("test".into(), span);
            let signature = Signature::new([AbiParam::new(Type::U32)], [AbiParam::new(Type::U32)]);
            builder(name, signature).unwrap()
        };

        let mut builder = FunctionBuilder::new(function, &mut builder);

        let input = builder.current_block().borrow().arguments()[0].upcast();
        let redundant_val = builder.u32(11, span)?;

        // Create a while op, pass zero.
        let zero = builder.u32(0, span)?;
        let while_op = builder.r#while([zero], &[Type::U32], span)?;
        let while_before_block = while_op.borrow().before().entry().as_block_ref();
        let while_after_block = while_op.borrow().after().entry().as_block_ref();

        // Check the passed arg against the function arg.
        builder.switch_to_block(while_before_block);
        let while_cond_arg = while_before_block.borrow().arguments()[0].upcast();
        let finished = builder.eq(while_cond_arg, input, span)?;
        let next_iter = builder.incr(while_cond_arg, span)?;
        builder.condition(finished, [next_iter], span)?;

        // Just yield the final results from the while op.
        builder.switch_to_block(while_after_block);
        let yield_values = while_after_block
            .borrow()
            .arguments()
            .iter()
            .map(|a| a.borrow().as_value_ref())
            .collect::<SmallVec<[_; 4]>>();
        builder.r#yield(yield_values, span)?;

        // Add all the results together along with the redundant value to give them all users.
        builder.switch_to_block(builder.entry_block());
        let summed_while_results =
            while_op.borrow().results().iter().try_fold(zero, |acc, res| {
                let res_val_ref = res.borrow().as_value_ref();
                builder.add(acc, res_val_ref, span)
            })?;
        let final_sum = builder.add(summed_while_results, redundant_val, span)?;
        builder.ret(Some(final_sum), span)?;

        run_single_canonicalizer(
            context,
            function.as_operation_ref(),
            "fold_redundant_yields_subset_while",
        )
    }
    }}} */
}