forked from bytecodealliance/wasm-tools
-
Notifications
You must be signed in to change notification settings - Fork 1
/
dfg.rs
1503 lines (1374 loc) · 67.3 KB
/
dfg.rs
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
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//! DFG extractor for Wasm functions. It converts Wasm operators to the [Lang]
//! intermediate representation.
use super::eggsy::encoder::rebuild::build_expr;
use crate::mutators::peephole::{
Lang, MemArg, MemArgLane, MemoryCopy, MemoryInit, RefType, TableCopy, TableInit,
};
use crate::mutators::OperatorAndByteOffset;
use crate::{ModuleInfo, WasmMutate};
use egg::{Id, Language, RecExpr};
use std::collections::HashMap;
use std::ops::Range;
use wasmparser::Operator;
/// It executes a minimal symbolic evaluation of the stack to detect operands
/// location in the code for certain operators
///
/// For example, the `i32.add` operator should know who are its operands
pub struct DFGBuilder {
/// Current color of the state of the world. This is incremented any time
/// the Wasm mutates state, for example makes a function call or writes to
/// memory. We generally only apply mutations to expressions where all
/// subexpressions have the same color as the root expression. This helps us
/// avoid incorrectly reordering side-effectful operations.
color: u32,
stack: Vec<usize>,
dfg_map: Vec<StackEntry>,
operator_index_to_entry_index: HashMap<usize, usize>,
parents: Vec<Option<usize>>,
preserve_semantics: bool,
}
/// Basic block of a Wasm's function defined as a range of operators in the Wasm
/// function
#[derive(Debug)]
pub struct BBlock {
pub(crate) range: Range<usize>,
}
/// Node of a DFG extracted from a basic block in the Wasm code
#[derive(Debug, Clone)]
pub struct StackEntry {
/// Lang enode operator mapping
pub operator: Lang,
/// Index in the MiniDFG entries collection
pub entry_idx: usize,
/// Color of the dfg part
pub color: u32,
/// Instruction index if its apply
pub operator_idx: usize,
}
/// DFG structre for a piece of Wasm's function
#[derive(Clone, Default)]
pub struct MiniDFG {
/// Some of the operators have no stack entry
/// This will help to decide or not to mutate the operators, avoiding egrapphp creation, etc
/// Each (key, value) entry corresponds to the index of the instruction in
/// the Wasm BasicBlock and the index of the stack entry in the `entries` field
pub map: HashMap<usize, usize>,
/// Each stack entry represents a position in the operators stream
/// containing its children
pub entries: Vec<StackEntry>,
/// For each stack entry we keep the parental relation, the ith value is the index of
/// the ith instruction's parent instruction.
/// We write each stack entry having no parent, i.e. a root in the dfg
pub parents: Vec<Option<usize>>,
}
impl MiniDFG {
/// Return true if the coloring of the children subtrees is the same as the root
/// Notice that this value can be calcuated when the tree is built
pub fn is_subtree_consistent(&self, current: usize) -> bool {
let entry = &self.entries[current];
let mut colors = vec![];
let mut worklist = vec![entry];
while let Some(entry) = worklist.pop() {
colors.push(entry.color);
for i in entry.operator.children() {
worklist.push(&self.entries[usize::from(*i)]);
}
}
// All nodes in the tree should have the same color
colors
.get(0)
.map(|&val| colors.iter().all(|&x| x == val))
.or(Some(false))
.unwrap()
}
/// Return true if the coloring of the children subtrees is the same as the root
/// Notice that this value can be calcuated when the tree is built
pub fn is_subtree_consistent_from_root(&self) -> bool {
let current = self.entries.len() - 1;
self.is_subtree_consistent(current)
}
/// Default pretty print
/// It prints the stack entry instead of the Wasm operator
pub fn pretty_print_default(&self) -> String {
self.pretty_print(&|entry: &StackEntry| format!("{:?}", entry.operator))
}
/// Pretty prints the DFG forest in a tree structure
/// It receives a custom function to format how the entry information will be written
/// For an example, see the implementation of the `pretty_print_default` method.
pub fn pretty_print(&self, entryformatter: &dyn Fn(&StackEntry) -> String) -> String {
let mut builder = String::from("");
builder.push_str("DFG forest\n");
fn get_ansi_term_color(color: u32) -> &'static str {
match color {
0 => "\u{001b}[31m", // red
1 => "\u{001b}[32m", // green
2 => "\u{001b}[33m", // yellow
3 => "\u{001b}[34m", // blue
4 => "\u{001b}[35m", // magenta
5 => "\u{001b}[36m", // cyan
6 => "\u{001b}[37;1m", // bright white
7 => "\u{001b}[32;1m", // bright green
8 => "\u{001b}[33;1m", // bright yellow
9 => "\u{001b}[36;1m", // bright cyan
10 => "\u{001b}[35;1m", // bright magenta
UNDEF_COLOR => "\u{001b}[31;1m", // bright red
_ => "\u{001b}[0m", // reset color (terminal default)
}
}
fn write_child(
minidfg: &MiniDFG,
entryidx: usize,
preffix: &str,
entryformatter: &dyn Fn(&StackEntry) -> String,
childrenpreffix: &str,
builder: &mut String,
) {
let entry = &minidfg.entries[entryidx];
builder.push_str(&(&preffix).to_string());
let color = get_ansi_term_color(entry.color);
builder.push_str(
format!(
"{}({})(at {}) {:?}\u{001b}[0m\n",
color,
entry.color,
entry.operator_idx,
entryformatter(entry)
)
.as_str(),
);
for (idx, op) in entry.operator.children().iter().enumerate() {
if idx < entry.operator.children().len() - 1 {
// Has no next child
let preffix = format!("{}{}", childrenpreffix, "├──");
let childrenpreffix = format!("{}{}", childrenpreffix, "│ ");
write_child(
minidfg,
usize::from(*op),
&preffix,
entryformatter,
&childrenpreffix,
builder,
);
} else {
let preffix = format!("{}{}", childrenpreffix, "└──");
let childrenpreffix = format!("{}{}", childrenpreffix, " ");
write_child(
minidfg,
usize::from(*op),
&preffix,
entryformatter,
&childrenpreffix,
builder,
);
}
}
}
// Print the roots.
for (entryidx, parent) in self.parents.iter().enumerate() {
if parent.is_none() {
write_child(self, entryidx, "", entryformatter, "", &mut builder);
}
}
builder
}
/// Returns a RecExpr from the stack entry
/// by cleaning spurious nodes
pub fn get_expr(&self, at: usize) -> RecExpr<Lang> {
let root = self.map[&at];
let entries = &self.entries[..=root];
build_expr(Id::from(root), |id| &entries[usize::from(id)].operator)
}
}
const UNDEF_COLOR: u32 = u32::MAX;
impl<'a> DFGBuilder {
/// Returns a new DFG builder
pub fn new(config: &WasmMutate) -> Self {
DFGBuilder {
color: 0,
stack: Vec::new(),
dfg_map: Vec::new(),
operator_index_to_entry_index: HashMap::new(),
parents: Vec::new(),
preserve_semantics: config.preserve_semantics,
}
}
/// Linear algorithm to construct the basic block
/// This follows the tradition way
/// 1 - Every jump instruction creates a new BB right after (in wasm: br, br_if, loop, block, if, else)
/// 2 - Every operator that could be a target of a jump also starts a BB (end ... :) Wasm always jumps to end)
/// 3 - The first operator is the start of a BB
///
/// However, since we only need the current basic block,
/// the iteration over the operators will be done upward until the basic block starts
pub fn get_bb_from_operator(
&self,
operator_index: usize,
operators: &[OperatorAndByteOffset],
) -> Option<BBlock> {
// The range is inclusive in the last operator
let mut range = operator_index..operator_index + 1;
// We only need the basic block upward
let mut found = false;
loop {
let (operator, _) = &operators[range.start];
match operator {
Operator::If { .. }
| Operator::Else { .. }
| Operator::End
| Operator::Block { .. }
| Operator::Loop { .. }
| Operator::Br { .. }
| Operator::BrIf { .. }
| Operator::Return
| Operator::Unreachable
| Operator::BrTable { .. } => {
if !found {
// If the insertion point is a jump
// Break inmediatly
return None;
}
range.start += 1; // Do not include the last jmp
break;
}
_ => {
found = true;
if range.start > 0 {
range.start -= 1;
} else {
break;
}
}
}
}
if range.end - range.start > 0 {
Some(BBlock { range })
} else {
// It only contains the jump
// This will help to filter out which operator can be mmutated or not in the PeepholeMutator process
None
}
}
fn empty_node(&mut self, operator: Lang, operator_idx: usize) -> usize {
self.register_node(operator, operator_idx, false)
}
fn push_node(&mut self, operator: Lang, operator_idx: usize) -> usize {
self.register_node(operator, operator_idx, true)
}
fn register_node(&mut self, operator: Lang, operator_idx: usize, push_to_stack: bool) -> usize {
let entry_idx = self.dfg_map.len();
// Add the parent links for this node's operands.
for id in operator.children() {
let id = usize::from(*id);
debug_assert!(self.parents[id].is_none());
self.parents[id] = Some(entry_idx);
}
let new_node = StackEntry {
operator,
entry_idx,
color: self.color,
operator_idx,
};
self.operator_index_to_entry_index
.insert(operator_idx, entry_idx);
if push_to_stack {
self.stack.push(entry_idx)
} else {
self.new_color();
}
// Add the data flow link
self.dfg_map.push(new_node);
self.parents.push(None);
entry_idx
}
fn pop_operand(&mut self, operator_idx: usize, insert_in_dfg: bool) -> usize {
self.stack
.pop()
.or_else(|| {
let entry_idx = self.dfg_map.len();
let leaf = StackEntry {
operator: Lang::Undef,
entry_idx,
color: UNDEF_COLOR,
operator_idx,
};
if insert_in_dfg {
self.operator_index_to_entry_index
.insert(operator_idx, entry_idx);
}
// Add the data flow link. No parent yet.
self.dfg_map.push(leaf);
self.parents.push(None);
Some(entry_idx)
})
.unwrap()
}
fn new_color(&mut self) {
// If we're not in semantics preservation mode then there's no need to
// ever switch colors because the color here is only used to ensure that
// we don't break edges between effectful instructions, which is all
// about preserving semantics.
if self.preserve_semantics {
self.color += 1;
assert!(self.color < UNDEF_COLOR);
}
}
/// This method should build lane dfg information
/// It returns a map of operator indexes over the function operators,
/// in which every key refers to a vector of ranges determining the operands
/// in the code
///
/// This process can is done inside basic blocsks, control flow information
/// is not taken into account in the peephole mutators
pub fn get_dfg(
&mut self,
info: &ModuleInfo,
operators: &'a [OperatorAndByteOffset],
basicblock: &BBlock,
) -> Option<MiniDFG> {
// Create a DFG from the BB. Start from the first operator and simulate
// the stack. If an operator is missing in the stack then it probably
// comes from a previous BB.
for idx in basicblock.range.start..basicblock.range.end {
// We dont care about the jump
let (operator, _) = &operators[idx];
// Check if it is not EOF
match operator {
Operator::Call { function_index } => {
let typeinfo = info.get_functype_idx(*function_index);
match typeinfo {
crate::module::TypeInfo::Func(tpe) => {
// Skip if it returns more than one value
// since it is not yet supported
if tpe.returns.len() > 1 {
return None;
}
// Pop as many parameters from the stack
let mut operands = (0..tpe.params.len())
.map(|_| self.pop_operand(idx, true))
.collect::<Vec<usize>>();
// reverse operands
operands.reverse();
// Add this as a new operator
self.register_node(
Lang::Call(
*function_index,
operands.iter().map(|i| Id::from(*i)).collect::<Vec<_>>(),
),
idx,
!tpe.returns.is_empty(),
);
self.new_color();
}
}
}
Operator::LocalGet { local_index } => {
self.push_node(Lang::LocalGet(*local_index), idx);
}
Operator::GlobalGet { global_index } => {
self.push_node(Lang::GlobalGet(*global_index), idx);
}
Operator::GlobalSet { global_index } => {
let child = self.pop_operand(idx, true);
self.empty_node(Lang::GlobalSet(*global_index, Id::from(child)), idx);
}
Operator::I32Const { value } => {
self.push_node(Lang::I32(*value), idx);
}
Operator::I64Const { value } => {
self.push_node(Lang::I64(*value), idx);
}
Operator::F32Const { value } => {
self.push_node(Lang::F32((*value).into()), idx);
}
Operator::F64Const { value } => {
self.push_node(Lang::F64((*value).into()), idx);
}
Operator::V128Const { value } => {
self.push_node(Lang::V128(value.i128()), idx);
}
Operator::LocalSet { local_index } => {
let val = self.pop_operand(idx, true);
self.empty_node(Lang::LocalSet(*local_index, Id::from(val)), idx);
}
Operator::LocalTee { local_index } => {
let val = self.pop_operand(idx, true);
self.push_node(Lang::LocalTee(*local_index, Id::from(val)), idx);
self.new_color();
}
Operator::Nop => {
self.empty_node(Lang::Nop, idx);
}
Operator::I32Store { memarg } => self.store(idx, memarg, Lang::I32Store),
Operator::I64Store { memarg } => self.store(idx, memarg, Lang::I64Store),
Operator::F32Store { memarg } => self.store(idx, memarg, Lang::F32Store),
Operator::F64Store { memarg } => self.store(idx, memarg, Lang::F64Store),
Operator::I32Store8 { memarg } => self.store(idx, memarg, Lang::I32Store8),
Operator::I32Store16 { memarg } => self.store(idx, memarg, Lang::I32Store16),
Operator::I64Store8 { memarg } => self.store(idx, memarg, Lang::I64Store8),
Operator::I64Store16 { memarg } => self.store(idx, memarg, Lang::I64Store16),
Operator::I64Store32 { memarg } => self.store(idx, memarg, Lang::I64Store32),
// All memory loads
Operator::I32Load { memarg } => self.load(idx, memarg, Lang::I32Load),
Operator::I64Load { memarg } => self.load(idx, memarg, Lang::I64Load),
Operator::F32Load { memarg } => self.load(idx, memarg, Lang::F32Load),
Operator::F64Load { memarg } => self.load(idx, memarg, Lang::F64Load),
Operator::I32Load8S { memarg } => self.load(idx, memarg, Lang::I32Load8S),
Operator::I32Load8U { memarg } => self.load(idx, memarg, Lang::I32Load8U),
Operator::I32Load16S { memarg } => self.load(idx, memarg, Lang::I32Load16S),
Operator::I32Load16U { memarg } => self.load(idx, memarg, Lang::I32Load16U),
Operator::I64Load8S { memarg } => self.load(idx, memarg, Lang::I64Load8S),
Operator::I64Load8U { memarg } => self.load(idx, memarg, Lang::I64Load8U),
Operator::I64Load16S { memarg } => self.load(idx, memarg, Lang::I64Load16S),
Operator::I64Load16U { memarg } => self.load(idx, memarg, Lang::I64Load16U),
Operator::I64Load32S { memarg } => self.load(idx, memarg, Lang::I64Load32S),
Operator::I64Load32U { memarg } => self.load(idx, memarg, Lang::I64Load32U),
Operator::I32Eqz => self.unop(idx, Lang::I32Eqz),
Operator::I64Eqz => self.unop(idx, Lang::I64Eqz),
Operator::F32Eq => self.binop(idx, Lang::F32Eq),
Operator::F32Ne => self.binop(idx, Lang::F32Ne),
Operator::F32Lt => self.binop(idx, Lang::F32Lt),
Operator::F32Gt => self.binop(idx, Lang::F32Gt),
Operator::F32Le => self.binop(idx, Lang::F32Le),
Operator::F32Ge => self.binop(idx, Lang::F32Ge),
Operator::F64Eq => self.binop(idx, Lang::F64Eq),
Operator::F64Ne => self.binop(idx, Lang::F64Ne),
Operator::F64Lt => self.binop(idx, Lang::F64Lt),
Operator::F64Gt => self.binop(idx, Lang::F64Gt),
Operator::F64Le => self.binop(idx, Lang::F64Le),
Operator::F64Ge => self.binop(idx, Lang::F64Ge),
Operator::I32Clz => self.unop(idx, Lang::I32Clz),
Operator::I32Ctz => self.unop(idx, Lang::I32Ctz),
Operator::I64Clz => self.unop(idx, Lang::I64Clz),
Operator::I64Ctz => self.unop(idx, Lang::I64Ctz),
Operator::F32Abs => self.unop(idx, Lang::F32Abs),
Operator::F32Neg => self.unop(idx, Lang::F32Neg),
Operator::F32Ceil => self.unop(idx, Lang::F32Ceil),
Operator::F32Floor => self.unop(idx, Lang::F32Floor),
Operator::F32Trunc => self.unop(idx, Lang::F32Trunc),
Operator::F32Nearest => self.unop(idx, Lang::F32Nearest),
Operator::F32Sqrt => self.unop(idx, Lang::F32Sqrt),
Operator::F32Add => self.binop(idx, Lang::F32Add),
Operator::F32Sub => self.binop(idx, Lang::F32Sub),
Operator::F32Mul => self.binop(idx, Lang::F32Mul),
Operator::F32Div => self.binop(idx, Lang::F32Div),
Operator::F32Min => self.binop(idx, Lang::F32Min),
Operator::F32Max => self.binop(idx, Lang::F32Max),
Operator::F32Copysign => self.binop(idx, Lang::F32Copysign),
Operator::F64Abs => self.unop(idx, Lang::F64Abs),
Operator::F64Neg => self.unop(idx, Lang::F64Neg),
Operator::F64Ceil => self.unop(idx, Lang::F64Ceil),
Operator::F64Floor => self.unop(idx, Lang::F64Floor),
Operator::F64Trunc => self.unop(idx, Lang::F64Trunc),
Operator::F64Nearest => self.unop(idx, Lang::F64Nearest),
Operator::F64Sqrt => self.unop(idx, Lang::F64Sqrt),
Operator::F64Add => self.binop(idx, Lang::F64Add),
Operator::F64Sub => self.binop(idx, Lang::F64Sub),
Operator::F64Mul => self.binop(idx, Lang::F64Mul),
Operator::F64Div => self.binop(idx, Lang::F64Div),
Operator::F64Min => self.binop(idx, Lang::F64Min),
Operator::F64Max => self.binop(idx, Lang::F64Max),
Operator::F64Copysign => self.binop(idx, Lang::F64Copysign),
Operator::I32TruncF32S => self.unop(idx, Lang::I32TruncF32S),
Operator::I32TruncF32U => self.unop(idx, Lang::I32TruncF32U),
Operator::I32TruncF64S => self.unop(idx, Lang::I32TruncF64S),
Operator::I32TruncF64U => self.unop(idx, Lang::I32TruncF64U),
Operator::I64TruncF32S => self.unop(idx, Lang::I64TruncF32S),
Operator::I64TruncF32U => self.unop(idx, Lang::I64TruncF32U),
Operator::I64TruncF64S => self.unop(idx, Lang::I64TruncF64S),
Operator::I64TruncF64U => self.unop(idx, Lang::I64TruncF64U),
Operator::F32ConvertI32S => self.unop(idx, Lang::F32ConvertI32S),
Operator::F32ConvertI32U => self.unop(idx, Lang::F32ConvertI32U),
Operator::F32ConvertI64S => self.unop(idx, Lang::F32ConvertI64S),
Operator::F32ConvertI64U => self.unop(idx, Lang::F32ConvertI64U),
Operator::F64ConvertI32S => self.unop(idx, Lang::F64ConvertI32S),
Operator::F64ConvertI32U => self.unop(idx, Lang::F64ConvertI32U),
Operator::F64ConvertI64S => self.unop(idx, Lang::F64ConvertI64S),
Operator::F64ConvertI64U => self.unop(idx, Lang::F64ConvertI64U),
Operator::F64PromoteF32 => self.unop(idx, Lang::F64PromoteF32),
Operator::F32DemoteF64 => self.unop(idx, Lang::F32DemoteF64),
Operator::I32ReinterpretF32 => self.unop(idx, Lang::I32ReinterpretF32),
Operator::I64ReinterpretF64 => self.unop(idx, Lang::I64ReinterpretF64),
Operator::F32ReinterpretI32 => self.unop(idx, Lang::F32ReinterpretI32),
Operator::F64ReinterpretI64 => self.unop(idx, Lang::F64ReinterpretI64),
Operator::I32TruncSatF32S => self.unop(idx, Lang::I32TruncSatF32S),
Operator::I32TruncSatF32U => self.unop(idx, Lang::I32TruncSatF32U),
Operator::I32TruncSatF64S => self.unop(idx, Lang::I32TruncSatF64S),
Operator::I32TruncSatF64U => self.unop(idx, Lang::I32TruncSatF64U),
Operator::I64TruncSatF32S => self.unop(idx, Lang::I64TruncSatF32S),
Operator::I64TruncSatF32U => self.unop(idx, Lang::I64TruncSatF32U),
Operator::I64TruncSatF64S => self.unop(idx, Lang::I64TruncSatF64S),
Operator::I64TruncSatF64U => self.unop(idx, Lang::I64TruncSatF64U),
Operator::I32Add => self.binop(idx, Lang::I32Add),
Operator::I32Sub => self.binop(idx, Lang::I32Sub),
Operator::I32Eq => self.binop(idx, Lang::I32Eq),
Operator::I32Ne => self.binop(idx, Lang::I32Ne),
Operator::I32LtS => self.binop(idx, Lang::I32LtS),
Operator::I32LtU => self.binop(idx, Lang::I32LtU),
Operator::I32GtS => self.binop(idx, Lang::I32GtS),
Operator::I32GtU => self.binop(idx, Lang::I32GtU),
Operator::I32LeS => self.binop(idx, Lang::I32LeS),
Operator::I32LeU => self.binop(idx, Lang::I32LeU),
Operator::I32GeS => self.binop(idx, Lang::I32GeS),
Operator::I32GeU => self.binop(idx, Lang::I32GeU),
Operator::I32Mul => self.binop(idx, Lang::I32Mul),
Operator::I32DivS => self.binop(idx, Lang::I32DivS),
Operator::I32DivU => self.binop(idx, Lang::I32DivU),
Operator::I32RemS => self.binop(idx, Lang::I32RemS),
Operator::I32RemU => self.binop(idx, Lang::I32RemU),
Operator::I32Shl => self.binop(idx, Lang::I32Shl),
Operator::I32ShrS => self.binop(idx, Lang::I32ShrS),
Operator::I32ShrU => self.binop(idx, Lang::I32ShrU),
Operator::I32Xor => self.binop(idx, Lang::I32Xor),
Operator::I32Or => self.binop(idx, Lang::I32Or),
Operator::I32And => self.binop(idx, Lang::I32And),
Operator::I32Rotl => self.binop(idx, Lang::I32RotL),
Operator::I32Rotr => self.binop(idx, Lang::I32RotR),
Operator::I64Add => self.binop(idx, Lang::I64Add),
Operator::I64Sub => self.binop(idx, Lang::I64Sub),
Operator::I64Eq => self.binop(idx, Lang::I64Eq),
Operator::I64Ne => self.binop(idx, Lang::I64Ne),
Operator::I64LtS => self.binop(idx, Lang::I64LtS),
Operator::I64LtU => self.binop(idx, Lang::I64LtU),
Operator::I64GtS => self.binop(idx, Lang::I64GtS),
Operator::I64GtU => self.binop(idx, Lang::I64GtU),
Operator::I64LeS => self.binop(idx, Lang::I64LeS),
Operator::I64LeU => self.binop(idx, Lang::I64LeU),
Operator::I64GeS => self.binop(idx, Lang::I64GeS),
Operator::I64GeU => self.binop(idx, Lang::I64GeU),
Operator::I64Mul => self.binop(idx, Lang::I64Mul),
Operator::I64DivS => self.binop(idx, Lang::I64DivS),
Operator::I64DivU => self.binop(idx, Lang::I64DivU),
Operator::I64RemS => self.binop(idx, Lang::I64RemS),
Operator::I64RemU => self.binop(idx, Lang::I64RemU),
Operator::I64Shl => self.binop(idx, Lang::I64Shl),
Operator::I64ShrS => self.binop(idx, Lang::I64ShrS),
Operator::I64ShrU => self.binop(idx, Lang::I64ShrU),
Operator::I64Xor => self.binop(idx, Lang::I64Xor),
Operator::I64Or => self.binop(idx, Lang::I64Or),
Operator::I64And => self.binop(idx, Lang::I64And),
Operator::I64Rotl => self.binop(idx, Lang::I64RotL),
Operator::I64Rotr => self.binop(idx, Lang::I64RotR),
Operator::V128Not => self.unop(idx, Lang::V128Not),
Operator::V128And => self.binop(idx, Lang::V128And),
Operator::V128AndNot => self.binop(idx, Lang::V128AndNot),
Operator::V128Or => self.binop(idx, Lang::V128Or),
Operator::V128Xor => self.binop(idx, Lang::V128Xor),
Operator::V128AnyTrue => self.unop(idx, Lang::V128AnyTrue),
Operator::V128Bitselect => self.ternop(idx, Lang::V128Bitselect),
Operator::Drop => {
let arg = self.pop_operand(idx, false);
self.empty_node(Lang::Drop([Id::from(arg)]), idx);
}
// conversion between integers
Operator::I32WrapI64 => self.unop(idx, Lang::Wrap),
Operator::I32Extend8S => self.unop(idx, Lang::I32Extend8S),
Operator::I32Extend16S => self.unop(idx, Lang::I32Extend16S),
Operator::I64Extend8S => self.unop(idx, Lang::I64Extend8S),
Operator::I64Extend16S => self.unop(idx, Lang::I64Extend16S),
Operator::I64Extend32S => self.unop(idx, Lang::I64Extend32S),
Operator::I64ExtendI32S => self.unop(idx, Lang::I64ExtendI32S),
Operator::I64ExtendI32U => self.unop(idx, Lang::I64ExtendI32U),
Operator::I32Popcnt => self.unop(idx, Lang::I32Popcnt),
Operator::I64Popcnt => self.unop(idx, Lang::I64Popcnt),
Operator::Select => {
let condition = self.pop_operand(idx, false);
let alternative = self.pop_operand(idx, false);
let consequent = self.pop_operand(idx, false);
self.push_node(
Lang::Select([
Id::from(consequent),
Id::from(alternative),
Id::from(condition),
]),
idx,
);
}
Operator::MemoryGrow { mem, mem_byte: _ } => {
let arg = self.pop_operand(idx, false);
self.push_node(Lang::MemoryGrow(*mem, Id::from(arg)), idx);
}
Operator::MemorySize { mem, mem_byte: _ } => {
self.push_node(Lang::MemorySize(*mem), idx);
}
Operator::TableGrow { table } => {
let elem = self.pop_operand(idx, false);
let size = self.pop_operand(idx, false);
self.push_node(
Lang::TableGrow(*table, [Id::from(size), Id::from(elem)]),
idx,
);
}
Operator::TableSize { table } => {
self.push_node(Lang::TableSize(*table), idx);
}
Operator::DataDrop { data_index } => {
self.empty_node(Lang::DataDrop(*data_index), idx);
}
Operator::ElemDrop { elem_index } => {
self.empty_node(Lang::ElemDrop(*elem_index), idx);
}
Operator::MemoryInit { mem, data_index } => {
let a = Id::from(self.pop_operand(idx, false));
let b = Id::from(self.pop_operand(idx, false));
let c = Id::from(self.pop_operand(idx, false));
self.empty_node(
Lang::MemoryInit(
MemoryInit {
memory: *mem,
segment: *data_index,
},
[c, b, a],
),
idx,
);
}
Operator::MemoryCopy { src_mem, dst_mem } => {
let a = Id::from(self.pop_operand(idx, false));
let b = Id::from(self.pop_operand(idx, false));
let c = Id::from(self.pop_operand(idx, false));
self.empty_node(
Lang::MemoryCopy(
MemoryCopy {
src: *src_mem,
dst: *dst_mem,
},
[c, b, a],
),
idx,
);
}
Operator::MemoryFill { mem } => {
let a = Id::from(self.pop_operand(idx, false));
let b = Id::from(self.pop_operand(idx, false));
let c = Id::from(self.pop_operand(idx, false));
self.empty_node(Lang::MemoryFill(*mem, [c, b, a]), idx);
}
Operator::TableInit { table, elem_index } => {
let a = Id::from(self.pop_operand(idx, false));
let b = Id::from(self.pop_operand(idx, false));
let c = Id::from(self.pop_operand(idx, false));
self.empty_node(
Lang::TableInit(
TableInit {
table: *table,
segment: *elem_index,
},
[c, b, a],
),
idx,
);
}
Operator::TableCopy {
src_table,
dst_table,
} => {
let a = Id::from(self.pop_operand(idx, false));
let b = Id::from(self.pop_operand(idx, false));
let c = Id::from(self.pop_operand(idx, false));
self.empty_node(
Lang::TableCopy(
TableCopy {
src: *src_table,
dst: *dst_table,
},
[c, b, a],
),
idx,
);
}
Operator::TableFill { table } => {
let a = Id::from(self.pop_operand(idx, false));
let b = Id::from(self.pop_operand(idx, false));
let c = Id::from(self.pop_operand(idx, false));
self.empty_node(Lang::TableFill(*table, [c, b, a]), idx);
}
Operator::TableGet { table } => {
let arg = Id::from(self.pop_operand(idx, false));
self.push_node(Lang::TableGet(*table, arg), idx);
}
Operator::TableSet { table } => {
let arg1 = Id::from(self.pop_operand(idx, false));
let arg2 = Id::from(self.pop_operand(idx, false));
self.empty_node(Lang::TableSet(*table, [arg2, arg1]), idx);
}
Operator::RefNull {
ty: wasmparser::ValType::ExternRef,
} => {
self.push_node(Lang::RefNull(RefType::Extern), idx);
}
Operator::RefNull {
ty: wasmparser::ValType::FuncRef,
} => {
self.push_node(Lang::RefNull(RefType::Func), idx);
}
Operator::RefFunc { function_index } => {
self.push_node(Lang::RefFunc(*function_index), idx);
}
Operator::RefIsNull => {
let arg = Id::from(self.pop_operand(idx, false));
self.push_node(Lang::RefIsNull(arg), idx);
}
Operator::V128Load { memarg } => self.load(idx, memarg, Lang::V128Load),
Operator::V128Load8x8S { memarg } => self.load(idx, memarg, Lang::V128Load8x8S),
Operator::V128Load8x8U { memarg } => self.load(idx, memarg, Lang::V128Load8x8U),
Operator::V128Load16x4S { memarg } => self.load(idx, memarg, Lang::V128Load16x4S),
Operator::V128Load16x4U { memarg } => self.load(idx, memarg, Lang::V128Load16x4U),
Operator::V128Load32x2S { memarg } => self.load(idx, memarg, Lang::V128Load32x2S),
Operator::V128Load32x2U { memarg } => self.load(idx, memarg, Lang::V128Load32x2U),
Operator::V128Load8Splat { memarg } => self.load(idx, memarg, Lang::V128Load8Splat),
Operator::V128Load16Splat { memarg } => {
self.load(idx, memarg, Lang::V128Load16Splat)
}
Operator::V128Load32Splat { memarg } => {
self.load(idx, memarg, Lang::V128Load32Splat)
}
Operator::V128Load64Splat { memarg } => {
self.load(idx, memarg, Lang::V128Load64Splat)
}
Operator::V128Load32Zero { memarg } => self.load(idx, memarg, Lang::V128Load32Zero),
Operator::V128Load64Zero { memarg } => self.load(idx, memarg, Lang::V128Load64Zero),
Operator::V128Store { memarg } => self.store(idx, memarg, Lang::V128Store),
Operator::V128Load8Lane { memarg, lane } => {
self.load_lane(idx, memarg, lane, Lang::V128Load8Lane)
}
Operator::V128Load16Lane { memarg, lane } => {
self.load_lane(idx, memarg, lane, Lang::V128Load16Lane)
}
Operator::V128Load32Lane { memarg, lane } => {
self.load_lane(idx, memarg, lane, Lang::V128Load32Lane)
}
Operator::V128Load64Lane { memarg, lane } => {
self.load_lane(idx, memarg, lane, Lang::V128Load64Lane)
}
Operator::V128Store8Lane { memarg, lane } => {
self.store_lane(idx, memarg, lane, Lang::V128Store8Lane)
}
Operator::V128Store16Lane { memarg, lane } => {
self.store_lane(idx, memarg, lane, Lang::V128Store16Lane)
}
Operator::V128Store32Lane { memarg, lane } => {
self.store_lane(idx, memarg, lane, Lang::V128Store32Lane)
}
Operator::V128Store64Lane { memarg, lane } => {
self.store_lane(idx, memarg, lane, Lang::V128Store64Lane)
}
Operator::I8x16ExtractLaneS { lane } => {
self.extract_lane(idx, lane, Lang::I8x16ExtractLaneS)
}
Operator::I8x16ExtractLaneU { lane } => {
self.extract_lane(idx, lane, Lang::I8x16ExtractLaneU)
}
Operator::I8x16ReplaceLane { lane } => {
self.replace_lane(idx, lane, Lang::I8x16ReplaceLane)
}
Operator::I16x8ExtractLaneS { lane } => {
self.extract_lane(idx, lane, Lang::I16x8ExtractLaneS)
}
Operator::I16x8ExtractLaneU { lane } => {
self.extract_lane(idx, lane, Lang::I16x8ExtractLaneU)
}
Operator::I16x8ReplaceLane { lane } => {
self.replace_lane(idx, lane, Lang::I16x8ReplaceLane)
}
Operator::I32x4ExtractLane { lane } => {
self.extract_lane(idx, lane, Lang::I32x4ExtractLane)
}
Operator::I32x4ReplaceLane { lane } => {
self.replace_lane(idx, lane, Lang::I32x4ReplaceLane)
}
Operator::I64x2ExtractLane { lane } => {
self.extract_lane(idx, lane, Lang::I64x2ExtractLane)
}
Operator::I64x2ReplaceLane { lane } => {
self.replace_lane(idx, lane, Lang::I64x2ReplaceLane)
}
Operator::F32x4ExtractLane { lane } => {
self.extract_lane(idx, lane, Lang::F32x4ExtractLane)
}
Operator::F32x4ReplaceLane { lane } => {
self.replace_lane(idx, lane, Lang::F32x4ReplaceLane)
}
Operator::F64x2ExtractLane { lane } => {
self.extract_lane(idx, lane, Lang::F64x2ExtractLane)
}
Operator::F64x2ReplaceLane { lane } => {
self.replace_lane(idx, lane, Lang::F64x2ReplaceLane)
}
Operator::I8x16Swizzle => self.binop(idx, Lang::I8x16Swizzle),
Operator::I8x16Splat => self.unop(idx, Lang::I8x16Splat),
Operator::I16x8Splat => self.unop(idx, Lang::I16x8Splat),
Operator::I32x4Splat => self.unop(idx, Lang::I32x4Splat),
Operator::I64x2Splat => self.unop(idx, Lang::I64x2Splat),
Operator::F32x4Splat => self.unop(idx, Lang::F32x4Splat),
Operator::F64x2Splat => self.unop(idx, Lang::F64x2Splat),
Operator::I8x16Eq => self.binop(idx, Lang::I8x16Eq),
Operator::I8x16Ne => self.binop(idx, Lang::I8x16Ne),
Operator::I8x16LtS => self.binop(idx, Lang::I8x16LtS),
Operator::I8x16LtU => self.binop(idx, Lang::I8x16LtU),
Operator::I8x16GtS => self.binop(idx, Lang::I8x16GtS),
Operator::I8x16GtU => self.binop(idx, Lang::I8x16GtU),
Operator::I8x16LeS => self.binop(idx, Lang::I8x16LeS),
Operator::I8x16LeU => self.binop(idx, Lang::I8x16LeU),
Operator::I8x16GeS => self.binop(idx, Lang::I8x16GeS),
Operator::I8x16GeU => self.binop(idx, Lang::I8x16GeU),
Operator::I16x8Eq => self.binop(idx, Lang::I16x8Eq),
Operator::I16x8Ne => self.binop(idx, Lang::I16x8Ne),
Operator::I16x8LtS => self.binop(idx, Lang::I16x8LtS),
Operator::I16x8LtU => self.binop(idx, Lang::I16x8LtU),
Operator::I16x8GtS => self.binop(idx, Lang::I16x8GtS),
Operator::I16x8GtU => self.binop(idx, Lang::I16x8GtU),
Operator::I16x8LeS => self.binop(idx, Lang::I16x8LeS),
Operator::I16x8LeU => self.binop(idx, Lang::I16x8LeU),
Operator::I16x8GeS => self.binop(idx, Lang::I16x8GeS),
Operator::I16x8GeU => self.binop(idx, Lang::I16x8GeU),
Operator::I32x4Eq => self.binop(idx, Lang::I32x4Eq),
Operator::I32x4Ne => self.binop(idx, Lang::I32x4Ne),
Operator::I32x4LtS => self.binop(idx, Lang::I32x4LtS),
Operator::I32x4LtU => self.binop(idx, Lang::I32x4LtU),
Operator::I32x4GtS => self.binop(idx, Lang::I32x4GtS),
Operator::I32x4GtU => self.binop(idx, Lang::I32x4GtU),
Operator::I32x4LeS => self.binop(idx, Lang::I32x4LeS),
Operator::I32x4LeU => self.binop(idx, Lang::I32x4LeU),
Operator::I32x4GeS => self.binop(idx, Lang::I32x4GeS),
Operator::I32x4GeU => self.binop(idx, Lang::I32x4GeU),
Operator::I64x2Eq => self.binop(idx, Lang::I64x2Eq),
Operator::I64x2Ne => self.binop(idx, Lang::I64x2Ne),
Operator::I64x2LtS => self.binop(idx, Lang::I64x2LtS),
Operator::I64x2GtS => self.binop(idx, Lang::I64x2GtS),
Operator::I64x2LeS => self.binop(idx, Lang::I64x2LeS),
Operator::I64x2GeS => self.binop(idx, Lang::I64x2GeS),
Operator::F32x4Eq => self.binop(idx, Lang::F32x4Eq),
Operator::F32x4Ne => self.binop(idx, Lang::F32x4Ne),
Operator::F32x4Lt => self.binop(idx, Lang::F32x4Lt),
Operator::F32x4Gt => self.binop(idx, Lang::F32x4Gt),
Operator::F32x4Le => self.binop(idx, Lang::F32x4Le),
Operator::F32x4Ge => self.binop(idx, Lang::F32x4Ge),
Operator::F64x2Eq => self.binop(idx, Lang::F64x2Eq),
Operator::F64x2Ne => self.binop(idx, Lang::F64x2Ne),
Operator::F64x2Lt => self.binop(idx, Lang::F64x2Lt),
Operator::F64x2Gt => self.binop(idx, Lang::F64x2Gt),
Operator::F64x2Le => self.binop(idx, Lang::F64x2Le),
Operator::F64x2Ge => self.binop(idx, Lang::F64x2Ge),
Operator::I8x16Abs => self.unop(idx, Lang::I8x16Abs),
Operator::I8x16Neg => self.unop(idx, Lang::I8x16Neg),
Operator::I8x16Popcnt => self.unop(idx, Lang::I8x16Popcnt),
Operator::I8x16AllTrue => self.unop(idx, Lang::I8x16AllTrue),
Operator::I8x16Bitmask => self.unop(idx, Lang::I8x16Bitmask),
Operator::I8x16NarrowI16x8S => self.binop(idx, Lang::I8x16NarrowI16x8S),
Operator::I8x16NarrowI16x8U => self.binop(idx, Lang::I8x16NarrowI16x8U),
Operator::I8x16Shl => self.binop(idx, Lang::I8x16Shl),
Operator::I8x16ShrS => self.binop(idx, Lang::I8x16ShrS),
Operator::I8x16ShrU => self.binop(idx, Lang::I8x16ShrU),
Operator::I8x16Add => self.binop(idx, Lang::I8x16Add),
Operator::I8x16AddSatS => self.binop(idx, Lang::I8x16AddSatS),
Operator::I8x16AddSatU => self.binop(idx, Lang::I8x16AddSatU),
Operator::I8x16Sub => self.binop(idx, Lang::I8x16Sub),
Operator::I8x16SubSatS => self.binop(idx, Lang::I8x16SubSatS),
Operator::I8x16SubSatU => self.binop(idx, Lang::I8x16SubSatU),
Operator::I8x16MinS => self.binop(idx, Lang::I8x16MinS),
Operator::I8x16MinU => self.binop(idx, Lang::I8x16MinU),
Operator::I8x16MaxS => self.binop(idx, Lang::I8x16MaxS),
Operator::I8x16MaxU => self.binop(idx, Lang::I8x16MaxU),
Operator::I8x16AvgrU => self.binop(idx, Lang::I8x16AvgrU),
Operator::I16x8ExtAddPairwiseI8x16S => {
self.unop(idx, Lang::I16x8ExtAddPairwiseI8x16S)
}
Operator::I16x8ExtAddPairwiseI8x16U => {
self.unop(idx, Lang::I16x8ExtAddPairwiseI8x16U)
}
Operator::I16x8Abs => self.unop(idx, Lang::I16x8Abs),
Operator::I16x8Neg => self.unop(idx, Lang::I16x8Neg),
Operator::I16x8Q15MulrSatS => self.binop(idx, Lang::I16x8Q15MulrSatS),
Operator::I16x8AllTrue => self.unop(idx, Lang::I16x8AllTrue),
Operator::I16x8Bitmask => self.unop(idx, Lang::I16x8Bitmask),
Operator::I16x8NarrowI32x4S => self.binop(idx, Lang::I16x8NarrowI32x4S),
Operator::I16x8NarrowI32x4U => self.binop(idx, Lang::I16x8NarrowI32x4U),
Operator::I16x8ExtendLowI8x16S => self.unop(idx, Lang::I16x8ExtendLowI8x16S),
Operator::I16x8ExtendHighI8x16S => self.unop(idx, Lang::I16x8ExtendHighI8x16S),
Operator::I16x8ExtendLowI8x16U => self.unop(idx, Lang::I16x8ExtendLowI8x16U),
Operator::I16x8ExtendHighI8x16U => self.unop(idx, Lang::I16x8ExtendHighI8x16U),
Operator::I16x8Shl => self.binop(idx, Lang::I16x8Shl),
Operator::I16x8ShrS => self.binop(idx, Lang::I16x8ShrS),
Operator::I16x8ShrU => self.binop(idx, Lang::I16x8ShrU),
Operator::I16x8Add => self.binop(idx, Lang::I16x8Add),
Operator::I16x8AddSatS => self.binop(idx, Lang::I16x8AddSatS),
Operator::I16x8AddSatU => self.binop(idx, Lang::I16x8AddSatU),
Operator::I16x8Sub => self.binop(idx, Lang::I16x8Sub),
Operator::I16x8SubSatS => self.binop(idx, Lang::I16x8SubSatS),
Operator::I16x8SubSatU => self.binop(idx, Lang::I16x8SubSatU),
Operator::I16x8Mul => self.binop(idx, Lang::I16x8Mul),
Operator::I16x8MinS => self.binop(idx, Lang::I16x8MinS),
Operator::I16x8MinU => self.binop(idx, Lang::I16x8MinU),
Operator::I16x8MaxS => self.binop(idx, Lang::I16x8MaxS),
Operator::I16x8MaxU => self.binop(idx, Lang::I16x8MaxU),
Operator::I16x8AvgrU => self.binop(idx, Lang::I16x8AvgrU),
Operator::I16x8ExtMulLowI8x16S => self.binop(idx, Lang::I16x8ExtMulLowI8x16S),
Operator::I16x8ExtMulHighI8x16S => self.binop(idx, Lang::I16x8ExtMulHighI8x16S),
Operator::I16x8ExtMulLowI8x16U => self.binop(idx, Lang::I16x8ExtMulLowI8x16U),
Operator::I16x8ExtMulHighI8x16U => self.binop(idx, Lang::I16x8ExtMulHighI8x16U),
Operator::I32x4ExtAddPairwiseI16x8S => {
self.unop(idx, Lang::I32x4ExtAddPairwiseI16x8S)
}
Operator::I32x4ExtAddPairwiseI16x8U => {
self.unop(idx, Lang::I32x4ExtAddPairwiseI16x8U)
}
Operator::I32x4Abs => self.unop(idx, Lang::I32x4Abs),
Operator::I32x4Neg => self.unop(idx, Lang::I32x4Neg),
Operator::I32x4AllTrue => self.unop(idx, Lang::I32x4AllTrue),
Operator::I32x4Bitmask => self.unop(idx, Lang::I32x4Bitmask),
Operator::I32x4ExtendLowI16x8S => self.unop(idx, Lang::I32x4ExtendLowI16x8S),
Operator::I32x4ExtendHighI16x8S => self.unop(idx, Lang::I32x4ExtendHighI16x8S),
Operator::I32x4ExtendLowI16x8U => self.unop(idx, Lang::I32x4ExtendLowI16x8U),
Operator::I32x4ExtendHighI16x8U => self.unop(idx, Lang::I32x4ExtendHighI16x8U),