-
Notifications
You must be signed in to change notification settings - Fork 66
/
Copy pathfunction_bindgen.rs
1572 lines (1456 loc) · 67.7 KB
/
function_bindgen.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
use crate::intrinsics::Intrinsic;
use crate::source;
use crate::{uwrite, uwriteln};
use heck::*;
use std::collections::{BTreeMap, BTreeSet};
use std::fmt::Write;
use std::mem;
use wasmtime_environ::component::{ResourceIndex, TypeResourceTableIndex};
use wit_bindgen_core::abi::{Bindgen, Bitcast, Instruction};
use wit_component::StringEncoding;
use wit_parser::abi::WasmType;
use wit_parser::*;
#[derive(PartialEq)]
pub enum ErrHandling {
None,
ThrowResultErr,
ResultCatchHandler,
}
#[derive(Clone, Debug, PartialEq)]
pub enum ResourceData {
Host {
tid: TypeResourceTableIndex,
rid: ResourceIndex,
local_name: String,
dtor_name: Option<String>,
},
Guest {
resource_name: String,
prefix: Option<String>,
},
}
///
/// Map used for resource function bindgen within a given component
///
/// Mapping from the instance + resource index in that component (internal or external)
/// to the unique global resource id used to key the resource tables for this resource.
///
/// The id value uniquely identifies the resource table so that if a resource is used
/// by n components, there should be n different indices and spaces in use. The map is
/// therefore entirely unique and fully distinct for each instance's function bindgen.
///
/// The second bool is true if it is an imported resource.
///
/// For a given resource table id {x}, with resource index {y} the local variables are assumed:
/// - handleTable{x}
/// - captureTable{y} (rep to instance map for captured imported tables, only for JS import bindgen,
/// not hybrid)
/// - captureCnt{y} for assigning capture rep
///
/// For component-defined resources:
/// - finalizationRegistry{x}
///
/// handleTable internally will be allocated with { rep: i32, own: bool } entries
///
/// In the case of an imported resource tables, in place of "rep" we just store
/// the direct JS object being referenced, since in JS the object is its own handle.
///
///
#[derive(Clone, Debug, PartialEq)]
pub struct ResourceTable {
pub imported: bool,
pub data: ResourceData,
}
pub type ResourceMap = BTreeMap<TypeId, ResourceTable>;
pub struct FunctionBindgen<'a> {
pub resource_map: &'a ResourceMap,
pub cur_resource_borrows: bool,
pub intrinsics: &'a mut BTreeSet<Intrinsic>,
pub valid_lifting_optimization: bool,
pub sizes: &'a SizeAlign,
pub err: ErrHandling,
pub tmp: usize,
pub src: source::Source,
pub block_storage: Vec<source::Source>,
pub blocks: Vec<(String, Vec<String>)>,
pub params: Vec<String>,
pub memory: Option<&'a String>,
pub realloc: Option<&'a String>,
pub post_return: Option<&'a String>,
pub tracing_prefix: Option<&'a String>,
pub encoding: StringEncoding,
pub callee: &'a str,
pub callee_resource_dynamic: bool,
pub resolve: &'a Resolve,
}
impl FunctionBindgen<'_> {
fn tmp(&mut self) -> usize {
let ret = self.tmp;
self.tmp += 1;
ret
}
fn intrinsic(&mut self, intrinsic: Intrinsic) -> String {
self.intrinsics.insert(intrinsic);
intrinsic.name().to_string()
}
fn clamp_guest<T>(&mut self, results: &mut Vec<String>, operands: &[String], min: T, max: T)
where
T: std::fmt::Display,
{
let clamp = self.intrinsic(Intrinsic::ClampGuest);
results.push(format!("{}({}, {}, {})", clamp, operands[0], min, max));
}
fn load(&mut self, method: &str, offset: i32, operands: &[String], results: &mut Vec<String>) {
let view = self.intrinsic(Intrinsic::DataView);
let memory = self.memory.as_ref().unwrap();
results.push(format!(
"{view}({memory}).{method}({} + {offset}, true)",
operands[0],
));
}
fn store(&mut self, method: &str, offset: i32, operands: &[String]) {
let view = self.intrinsic(Intrinsic::DataView);
let memory = self.memory.as_ref().unwrap();
uwriteln!(
self.src,
"{view}({memory}).{method}({} + {offset}, {}, true);",
operands[1],
operands[0]
);
}
fn bind_results(&mut self, amt: usize, results: &mut Vec<String>) {
match amt {
0 => {}
1 => {
uwrite!(self.src, "const ret = ");
results.push("ret".to_string());
}
n => {
uwrite!(self.src, "var [");
for i in 0..n {
if i > 0 {
uwrite!(self.src, ", ");
}
uwrite!(self.src, "ret{}", i);
results.push(format!("ret{}", i));
}
uwrite!(self.src, "] = ");
}
}
}
fn bitcast(&mut self, cast: &Bitcast, op: &str) -> String {
match cast {
Bitcast::I32ToF32 => {
let cvt = self.intrinsic(Intrinsic::I32ToF32);
format!("{cvt}({op})")
}
Bitcast::F32ToI32 => {
let cvt = self.intrinsic(Intrinsic::F32ToI32);
format!("{cvt}({op})")
}
Bitcast::I64ToF64 => {
let cvt = self.intrinsic(Intrinsic::I64ToF64);
format!("{cvt}({op})")
}
Bitcast::F64ToI64 => {
let cvt = self.intrinsic(Intrinsic::F64ToI64);
format!("{}({})", cvt, op)
}
Bitcast::I32ToI64 => format!("BigInt({op})"),
Bitcast::I64ToI32 => format!("Number({op})"),
Bitcast::I64ToF32 => {
let cvt = self.intrinsic(Intrinsic::I32ToF32);
format!("{cvt}(Number({op}))")
}
Bitcast::F32ToI64 => {
let cvt = self.intrinsic(Intrinsic::F32ToI32);
format!("BigInt({cvt}({op}))")
}
Bitcast::None
| Bitcast::P64ToI64
| Bitcast::LToI32
| Bitcast::I32ToL
| Bitcast::LToP
| Bitcast::PToL
| Bitcast::PToI32
| Bitcast::I32ToP => op.to_string(),
Bitcast::PToP64 | Bitcast::I64ToP64 | Bitcast::LToI64 => format!("BigInt({op})"),
Bitcast::P64ToP | Bitcast::I64ToL => format!("Number({op})"),
Bitcast::Sequence(casts) => {
let mut statement = op.to_string();
for cast in casts.iter() {
statement = self.bitcast(cast, &statement);
}
statement
}
}
}
}
impl Bindgen for FunctionBindgen<'_> {
type Operand = String;
fn sizes(&self) -> &SizeAlign {
self.sizes
}
fn push_block(&mut self) {
let prev = mem::take(&mut self.src);
self.block_storage.push(prev);
}
fn finish_block(&mut self, operands: &mut Vec<String>) {
let to_restore = self.block_storage.pop().unwrap();
let src = mem::replace(&mut self.src, to_restore);
self.blocks.push((src.into(), mem::take(operands)));
}
fn return_pointer(&mut self, _size: usize, _align: usize) -> String {
unimplemented!();
}
fn is_list_canonical(&self, resolve: &Resolve, ty: &Type) -> bool {
array_ty(resolve, ty).is_some()
}
fn emit(
&mut self,
resolve: &Resolve,
inst: &Instruction<'_>,
operands: &mut Vec<String>,
results: &mut Vec<String>,
) {
match inst {
Instruction::GetArg { nth } => results.push(self.params[*nth].clone()),
Instruction::I32Const { val } => results.push(val.to_string()),
Instruction::ConstZero { tys } => {
for t in tys.iter() {
match t {
WasmType::I64 | WasmType::PointerOrI64 => results.push("0n".to_string()),
WasmType::I32
| WasmType::F32
| WasmType::F64
| WasmType::Pointer
| WasmType::Length => results.push("0".to_string()),
}
}
}
// The representation of i32 in JS is a number, so 8/16-bit values
// get further clamped to ensure that the upper bits aren't set when
// we pass the value, ensuring that only the right number of bits
// are transferred.
Instruction::U8FromI32 => self.clamp_guest(results, operands, u8::MIN, u8::MAX),
Instruction::S8FromI32 => self.clamp_guest(results, operands, i8::MIN, i8::MAX),
Instruction::U16FromI32 => self.clamp_guest(results, operands, u16::MIN, u16::MAX),
Instruction::S16FromI32 => self.clamp_guest(results, operands, i16::MIN, i16::MAX),
// Use `>>>0` to ensure the bits of the number are treated as
// unsigned.
Instruction::U32FromI32 => results.push(format!("{} >>> 0", operands[0])),
// All bigints coming from wasm are treated as signed, so convert
// it to ensure it's treated as unsigned.
Instruction::U64FromI64 => results.push(format!("BigInt.asUintN(64, {})", operands[0])),
// Nothing to do signed->signed where the representations are the
// same.
Instruction::S32FromI32 | Instruction::S64FromI64 => {
results.push(operands.pop().unwrap())
}
// All values coming from the host and going to wasm need to have
// their ranges validated, since the host could give us any value.
Instruction::I32FromU8 => {
let conv = self.intrinsic(Intrinsic::ToUint8);
results.push(format!("{conv}({op})", op = operands[0]))
}
Instruction::I32FromS8 => {
let conv = self.intrinsic(Intrinsic::ToInt8);
results.push(format!("{conv}({op})", op = operands[0]))
}
Instruction::I32FromU16 => {
let conv = self.intrinsic(Intrinsic::ToUint16);
results.push(format!("{conv}({op})", op = operands[0]))
}
Instruction::I32FromS16 => {
let conv = self.intrinsic(Intrinsic::ToInt16);
results.push(format!("{conv}({op})", op = operands[0]))
}
Instruction::I32FromU32 => {
let conv = self.intrinsic(Intrinsic::ToUint32);
results.push(format!("{conv}({op})", op = operands[0]))
}
Instruction::I32FromS32 => {
let conv = self.intrinsic(Intrinsic::ToInt32);
results.push(format!("{conv}({op})", op = operands[0]))
}
Instruction::I64FromU64 => {
let conv = self.intrinsic(Intrinsic::ToBigUint64);
results.push(format!("{conv}({op})", op = operands[0]))
}
Instruction::I64FromS64 => {
let conv = self.intrinsic(Intrinsic::ToBigInt64);
results.push(format!("{conv}({op})", op = operands[0]))
}
// The native representation in JS of f32 and f64 is just a number,
// so there's nothing to do here. Everything wasm gives us is
// representable in JS.
Instruction::F32FromCoreF32 | Instruction::F64FromCoreF64 => {
results.push(operands.pop().unwrap())
}
// Use a unary `+` to cast to a float.
Instruction::CoreF32FromF32 | Instruction::CoreF64FromF64 => {
results.push(format!("+{}", operands[0]))
}
// Validate that i32 values coming from wasm are indeed valid code
// points.
Instruction::CharFromI32 => {
let validate = self.intrinsic(Intrinsic::ValidateGuestChar);
results.push(format!("{}({})", validate, operands[0]));
}
// Validate that strings are indeed 1 character long and valid
// unicode.
Instruction::I32FromChar => {
let validate = self.intrinsic(Intrinsic::ValidateHostChar);
results.push(format!("{}({})", validate, operands[0]));
}
Instruction::Bitcasts { casts } => {
for (cast, op) in casts.iter().zip(operands) {
results.push(self.bitcast(cast, op));
}
}
Instruction::BoolFromI32 => {
let tmp = self.tmp();
uwrite!(self.src, "var bool{} = {};\n", tmp, operands[0]);
if self.valid_lifting_optimization {
results.push(format!("!!bool{tmp}"));
} else {
let throw = self.intrinsic(Intrinsic::ThrowInvalidBool);
results.push(format!(
"bool{tmp} == 0 ? false : (bool{tmp} == 1 ? true : {throw}())"
));
}
}
Instruction::I32FromBool => {
results.push(format!("{} ? 1 : 0", operands[0]));
}
Instruction::RecordLower { record, .. } => {
// use destructuring field access to get each
// field individually.
let tmp = self.tmp();
let mut expr = "var {".to_string();
for (i, field) in record.fields.iter().enumerate() {
if i > 0 {
expr.push_str(", ");
}
let name = format!("v{}_{}", tmp, i);
expr.push_str(&field.name.to_lower_camel_case());
expr.push_str(": ");
expr.push_str(&name);
results.push(name);
}
uwrite!(self.src, "{} }} = {};\n", expr, operands[0]);
}
Instruction::RecordLift { record, .. } => {
// records are represented as plain objects, so we
// make a new object and set all the fields with an object
// literal.
let mut result = "{\n".to_string();
for (field, op) in record.fields.iter().zip(operands) {
result.push_str(&format!("{}: {},\n", field.name.to_lower_camel_case(), op));
}
result.push('}');
results.push(result);
}
Instruction::TupleLower { tuple, .. } => {
// Tuples are represented as an array, sowe can use
// destructuring assignment to lower the tuple into its
// components.
let tmp = self.tmp();
let mut expr = "var [".to_string();
for i in 0..tuple.types.len() {
if i > 0 {
expr.push_str(", ");
}
let name = format!("tuple{}_{}", tmp, i);
expr.push_str(&name);
results.push(name);
}
uwrite!(self.src, "{}] = {};\n", expr, operands[0]);
}
Instruction::TupleLift { .. } => {
// Tuples are represented as an array, so we just shove all
// the operands into an array.
results.push(format!("[{}]", operands.join(", ")));
}
// This lowers flags from a dictionary of booleans in accordance with https://webidl.spec.whatwg.org/#es-dictionary.
Instruction::FlagsLower { flags, .. } => {
let op0 = &operands[0];
// Generate the result names.
for _ in 0..flags.repr().count() {
let tmp = self.tmp();
let name = format!("flags{tmp}");
// Default to 0 so that in the null/undefined case, everything is false by
// default.
uwrite!(self.src, "let {name} = 0;\n");
results.push(name);
}
uwrite!(
self.src,
"if (typeof {op0} === 'object' && {op0} !== null) {{\n"
);
for (i, chunk) in flags.flags.chunks(32).enumerate() {
let result_name = &results[i];
uwrite!(self.src, "{result_name} = ");
for (i, flag) in chunk.iter().enumerate() {
if i != 0 {
uwrite!(self.src, " | ");
}
let flag = flag.name.to_lower_camel_case();
uwrite!(self.src, "Boolean({op0}.{flag}) << {i}");
}
uwrite!(self.src, ";\n");
}
uwrite!(
self.src,
"\
}} else if ({op0} !== null && {op0} !== undefined) {{
throw new TypeError('only an object, undefined or null can be converted to flags');
}}
");
// We don't need to do anything else for the null/undefined
// case, since that's interpreted as everything false, and we
// already defaulted everyting to 0.
}
Instruction::FlagsLift { flags, .. } => {
let tmp = self.tmp();
results.push(format!("flags{tmp}"));
if let Some(op) = operands.last() {
// We only need an extraneous bits check if the number of flags isn't a multiple
// of 32, because if it is then all the bits are used and there are no
// extraneous bits.
if flags.flags.len() % 32 != 0 && !self.valid_lifting_optimization {
let mask: u32 = 0xffffffff << (flags.flags.len() % 32);
uwriteln!(
self.src,
"if (({op} & {mask}) !== 0) {{
throw new TypeError('flags have extraneous bits set');
}}"
);
}
}
uwriteln!(self.src, "var flags{tmp} = {{");
for (i, flag) in flags.flags.iter().enumerate() {
let flag = flag.name.to_lower_camel_case();
let op = &operands[i / 32];
let mask: u32 = 1 << (i % 32);
uwriteln!(self.src, "{flag}: Boolean({op} & {mask}),");
}
uwriteln!(self.src, "}};");
}
Instruction::VariantPayloadName => results.push("e".to_string()),
Instruction::VariantLower {
variant,
results: result_types,
name,
..
} => {
let blocks = self
.blocks
.drain(self.blocks.len() - variant.cases.len()..)
.collect::<Vec<_>>();
let tmp = self.tmp();
let op = &operands[0];
uwriteln!(self.src, "var variant{tmp} = {op};");
for i in 0..result_types.len() {
uwriteln!(self.src, "let variant{tmp}_{i};");
results.push(format!("variant{}_{}", tmp, i));
}
let expr_to_match = format!("variant{tmp}.tag");
uwriteln!(self.src, "switch ({expr_to_match}) {{");
for (case, (block, block_results)) in variant.cases.iter().zip(blocks) {
uwriteln!(self.src, "case '{}': {{", case.name.as_str());
if case.ty.is_some() {
uwriteln!(self.src, "const e = variant{tmp}.val;");
}
self.src.push_str(&block);
for (i, result) in block_results.iter().enumerate() {
uwriteln!(self.src, "variant{tmp}_{i} = {result};");
}
uwriteln!(
self.src,
"break;
}}"
);
}
let variant_name = name.to_upper_camel_case();
uwriteln!(
self.src,
r#"default: {{
throw new TypeError(`invalid variant tag value \`${{JSON.stringify({expr_to_match})}}\` (received \`${{variant{tmp}}}\`) specified for \`{variant_name}\``);
}}"#,
);
uwriteln!(self.src, "}}");
}
Instruction::VariantLift { variant, name, .. } => {
let blocks = self
.blocks
.drain(self.blocks.len() - variant.cases.len()..)
.collect::<Vec<_>>();
let tmp = self.tmp();
let op = &operands[0];
uwriteln!(
self.src,
"let variant{tmp};
switch ({op}) {{"
);
for (i, (case, (block, block_results))) in
variant.cases.iter().zip(blocks).enumerate()
{
let tag = case.name.as_str();
uwriteln!(
self.src,
"case {i}: {{
{block}\
variant{tmp} = {{
tag: '{tag}',"
);
if case.ty.is_some() {
assert!(block_results.len() == 1);
uwriteln!(self.src, " val: {}", block_results[0]);
} else {
assert!(block_results.is_empty());
}
uwriteln!(
self.src,
" }};
break;
}}"
);
}
let variant_name = name.to_upper_camel_case();
if !self.valid_lifting_optimization {
uwriteln!(
self.src,
"default: {{
throw new TypeError('invalid variant discriminant for {variant_name}');
}}",
);
}
uwriteln!(self.src, "}}");
results.push(format!("variant{}", tmp));
}
Instruction::OptionLower {
payload,
results: result_types,
..
} => {
let (mut some, some_results) = self.blocks.pop().unwrap();
let (mut none, none_results) = self.blocks.pop().unwrap();
let tmp = self.tmp();
let op = &operands[0];
uwriteln!(self.src, "var variant{tmp} = {op};");
for i in 0..result_types.len() {
uwriteln!(self.src, "let variant{tmp}_{i};");
results.push(format!("variant{tmp}_{i}"));
let some_result = &some_results[i];
let none_result = &none_results[i];
uwriteln!(some, "variant{tmp}_{i} = {some_result};");
uwriteln!(none, "variant{tmp}_{i} = {none_result};");
}
if maybe_null(resolve, payload) {
uwriteln!(
self.src,
"switch (variant{tmp}.tag) {{
case 'none': {{
{none}\
break;
}}
case 'some': {{
const e = variant{tmp}.val;
{some}\
break;
}}
default: {{
throw new TypeError('invalid variant specified for option');
}}
}}",
);
} else {
uwriteln!(
self.src,
"if (variant{tmp} === null || variant{tmp} === undefined) {{
{none}\
}} else {{
const e = variant{tmp};
{some}\
}}"
);
}
}
Instruction::OptionLift { payload, .. } => {
let (some, some_results) = self.blocks.pop().unwrap();
let (none, none_results) = self.blocks.pop().unwrap();
assert!(none_results.is_empty());
assert!(some_results.len() == 1);
let some_result = &some_results[0];
let tmp = self.tmp();
let op = &operands[0];
let (v_none, v_some) = if maybe_null(resolve, payload) {
(
"{ tag: 'none' }",
format!(
"{{
tag: 'some',
val: {some_result}
}}"
),
)
} else {
("undefined", some_result.into())
};
if !self.valid_lifting_optimization {
uwriteln!(
self.src,
"let variant{tmp};
switch ({op}) {{
case 0: {{
{none}\
variant{tmp} = {v_none};
break;
}}
case 1: {{
{some}\
variant{tmp} = {v_some};
break;
}}
default: {{
throw new TypeError('invalid variant discriminant for option');
}}
}}",
);
} else {
uwriteln!(
self.src,
"let variant{tmp};
if ({op}) {{
{some}\
variant{tmp} = {v_some};
}} else {{
{none}\
variant{tmp} = {v_none};
}}"
);
}
results.push(format!("variant{tmp}"));
}
Instruction::ResultLower {
results: result_types,
..
} => {
let (mut err, err_results) = self.blocks.pop().unwrap();
let (mut ok, ok_results) = self.blocks.pop().unwrap();
let tmp = self.tmp();
let op = &operands[0];
uwriteln!(self.src, "var variant{tmp} = {op};");
for i in 0..result_types.len() {
uwriteln!(self.src, "let variant{tmp}_{i};");
results.push(format!("variant{tmp}_{i}"));
let ok_result = &ok_results[i];
let err_result = &err_results[i];
uwriteln!(ok, "variant{tmp}_{i} = {ok_result};");
uwriteln!(err, "variant{tmp}_{i} = {err_result};");
}
uwriteln!(
self.src,
"switch (variant{tmp}.tag) {{
case 'ok': {{
const e = variant{tmp}.val;
{ok}\
break;
}}
case 'err': {{
const e = variant{tmp}.val;
{err}\
break;
}}
default: {{
throw new TypeError('invalid variant specified for result');
}}
}}",
);
}
Instruction::ResultLift { result, .. } => {
let (err, err_results) = self.blocks.pop().unwrap();
let (ok, ok_results) = self.blocks.pop().unwrap();
let ok_result = if result.ok.is_some() {
assert_eq!(ok_results.len(), 1);
ok_results[0].to_string()
} else {
assert_eq!(ok_results.len(), 0);
String::from("undefined")
};
let err_result = if result.err.is_some() {
assert_eq!(err_results.len(), 1);
err_results[0].to_string()
} else {
assert_eq!(err_results.len(), 0);
String::from("undefined")
};
let tmp = self.tmp();
let op0 = &operands[0];
if !self.valid_lifting_optimization {
uwriteln!(
self.src,
"let variant{tmp};
switch ({op0}) {{
case 0: {{
{ok}\
variant{tmp} = {{
tag: 'ok',
val: {ok_result}
}};
break;
}}
case 1: {{
{err}\
variant{tmp} = {{
tag: 'err',
val: {err_result}
}};
break;
}}
default: {{
throw new TypeError('invalid variant discriminant for expected');
}}
}}",
);
} else {
uwriteln!(
self.src,
"let variant{tmp};
if ({op0}) {{
{err}\
variant{tmp} = {{
tag: 'err',
val: {err_result}
}};
}} else {{
{ok}\
variant{tmp} = {{
tag: 'ok',
val: {ok_result}
}};
}}"
);
}
results.push(format!("variant{tmp}"));
}
// Lowers an enum in accordance with https://webidl.spec.whatwg.org/#es-enumeration.
Instruction::EnumLower { name, enum_, .. } => {
let tmp = self.tmp();
let op = &operands[0];
uwriteln!(self.src, "var val{tmp} = {op};");
// Declare a variable to hold the result.
uwriteln!(
self.src,
"let enum{tmp};
switch (val{tmp}) {{"
);
for (i, case) in enum_.cases.iter().enumerate() {
uwriteln!(
self.src,
"case '{case}': {{
enum{tmp} = {i};
break;
}}",
case = case.name
);
}
uwriteln!(self.src, "default: {{");
if !self.valid_lifting_optimization {
uwriteln!(
self.src,
"if (({op}) instanceof Error) {{
console.error({op});
}}"
);
}
uwriteln!(
self.src,
"
throw new TypeError(`\"${{val{tmp}}}\" is not one of the cases of {name}`);
}}
}}",
);
results.push(format!("enum{tmp}"));
}
Instruction::EnumLift { name, enum_, .. } => {
let tmp = self.tmp();
uwriteln!(
self.src,
"let enum{tmp};
switch ({}) {{",
operands[0]
);
for (i, case) in enum_.cases.iter().enumerate() {
uwriteln!(
self.src,
"case {i}: {{
enum{tmp} = '{case}';
break;
}}",
case = case.name
);
}
if !self.valid_lifting_optimization {
let name = name.to_upper_camel_case();
uwriteln!(
self.src,
"default: {{
throw new TypeError('invalid discriminant specified for {name}');
}}",
);
}
uwriteln!(self.src, "}}");
results.push(format!("enum{tmp}"));
}
Instruction::ListCanonLower { element, .. } => {
let tmp = self.tmp();
let memory = self.memory.as_ref().unwrap();
let realloc = self.realloc.unwrap();
let size = self.sizes.size(element).size_wasm32();
let align = ArchitectureSize::from(self.sizes.align(element)).size_wasm32();
uwriteln!(self.src, "var val{tmp} = {};", operands[0]);
if matches!(element, Type::U8) {
uwriteln!(self.src, "var len{tmp} = val{tmp}.byteLength;");
} else {
uwriteln!(self.src, "var len{tmp} = val{tmp}.length;");
}
uwriteln!(
self.src,
"var ptr{tmp} = {realloc}(0, 0, {align}, len{tmp} * {size});",
);
// TODO: this is the wrong endianness
if matches!(element, Type::U8) {
uwriteln!(
self.src,
"var src{tmp} = new Uint8Array(val{tmp}.buffer || val{tmp}, val{tmp}.byteOffset, len{tmp} * {size});",
);
} else {
uwriteln!(
self.src,
"var src{tmp} = new Uint8Array(val{tmp}.buffer, val{tmp}.byteOffset, len{tmp} * {size});",
);
}
uwriteln!(
self.src,
"(new Uint8Array({memory}.buffer, ptr{tmp}, len{tmp} * {size})).set(src{tmp});",
);
results.push(format!("ptr{}", tmp));
results.push(format!("len{}", tmp));
}
Instruction::ListCanonLift { element, .. } => {
let tmp = self.tmp();
let memory = self.memory.as_ref().unwrap();
uwriteln!(self.src, "var ptr{tmp} = {};", operands[0]);
uwriteln!(self.src, "var len{tmp} = {};", operands[1]);
// TODO: this is the wrong endianness
let array_ty = array_ty(resolve, element).unwrap();
uwriteln!(
self.src,
"var result{tmp} = new {array_ty}({memory}.buffer.slice(ptr{tmp}, ptr{tmp} + len{tmp} * {}));",
self.sizes.size(element).size_wasm32(),
);
results.push(format!("result{tmp}"));
}
Instruction::StringLower { .. } => {
// Only Utf8 and Utf16 supported for now
assert!(matches!(
self.encoding,
StringEncoding::UTF8 | StringEncoding::UTF16
));
let intrinsic = if self.encoding == StringEncoding::UTF16 {
Intrinsic::Utf16Encode
} else {
Intrinsic::Utf8Encode
};
let encode = self.intrinsic(intrinsic);
let tmp = self.tmp();
let memory = self.memory.as_ref().unwrap();
let str = String::from("cabi_realloc");
let realloc = self.realloc.unwrap_or(&str);
uwriteln!(
self.src,
"var ptr{tmp} = {encode}({}, {realloc}, {memory});",
operands[0],
);
if self.encoding == StringEncoding::UTF8 {
let encoded_len = self.intrinsic(Intrinsic::Utf8EncodedLen);
uwriteln!(self.src, "var len{tmp} = {encoded_len};");
} else {
uwriteln!(self.src, "var len{tmp} = {}.length;", operands[0]);
}
results.push(format!("ptr{}", tmp));
results.push(format!("len{}", tmp));
}
Instruction::StringLift => {
// Only Utf8 and Utf16 supported for now
assert!(matches!(
self.encoding,
StringEncoding::UTF8 | StringEncoding::UTF16
));
let intrinsic = if self.encoding == StringEncoding::UTF16 {
Intrinsic::Utf16Decoder
} else {
Intrinsic::Utf8Decoder
};
let decoder = self.intrinsic(intrinsic);
let tmp = self.tmp();
let memory = self.memory.as_ref().unwrap();
uwriteln!(self.src, "var ptr{tmp} = {};", operands[0]);
uwriteln!(self.src, "var len{tmp} = {};", operands[1]);
uwriteln!(
self.src,
"var result{tmp} = {decoder}.decode(new Uint{}Array({memory}.buffer, ptr{tmp}, len{tmp}));",
if self.encoding == StringEncoding::UTF16 { "16" } else { "8" }
);
results.push(format!("result{tmp}"));
}
Instruction::ListLower { element, .. } => {
let (body, body_results) = self.blocks.pop().unwrap();
assert!(body_results.is_empty());
let tmp = self.tmp();
let vec = format!("vec{}", tmp);
let result = format!("result{}", tmp);
let len = format!("len{}", tmp);
let size = self.sizes.size(element).size_wasm32();
let align = ArchitectureSize::from(self.sizes.align(element)).size_wasm32();
// first store our vec-to-lower in a temporary since we'll