package wax-lib
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Libraries for Wax, a Rust-like syntax for WebAssembly
Install
dune-project
Dependency
Authors
Maintainers
Sources
wax-0.1.0.tbz
sha256=41b580846af8d41bdf6c3f005f62e38feda3e60fe2e9e4aa440db34ce515a153
sha512=4b3a181fcc7d743194a8647260870fb5190770066a197bcc48104c2b77fd40c643228b795c2bcd6b29a120820e969eb42a37a9bcec98b3f608d13f152d9f6579
doc/src/wax-lib.wasm/output.ml.html
Source file output.ml
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 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395open Wax_utils.Colors module Printer = Wax_utils.Printer module Trivia = Wax_utils.Trivia module Styled = Wax_utils.Styled_printer module Uint32 = Wax_utils.Uint32 module Uint64 = Wax_utils.Uint64 open Ast.Text (*** Printer primitives and sexp model ***) let get_theme use_color = if use_color then wat_theme else no_color type format = Compact | Expansive | Hybrid | Adaptive type ctx = { base : Styled.t; format : format; indent_level : int } let _ = (Compact, Hybrid, Adaptive) (* The styling and trivia plumbing is shared with the Wax printer in [Wax_utils.Styled_printer]; only [format]/[indent_level] are specific here. *) let print_styled ctx style ?(len = None) text = Styled.print_styled ctx.base style ~len text let print_trivia ctx lst = Styled.print_trivia ctx.base lst let get_trivia ctx loc = Styled.get_trivia ctx.base loc let atomic_node ctx loc f = Styled.atomic_node ctx.base loc f let string_node ctx loc style len s = atomic_node ctx loc @@ fun () -> print_styled ctx style ~len s type sexp = | Atom of { loc : Ast.location option; len : int option; style : style; s : string; } | List of Ast.location option * sexp list | Block of { loc : Ast.location option; l : sexp list; transparent : bool; bk : [ `Box | `Hov | `Hv ]; } | Vertical_block of Ast.location option * sexp list | Structured_block of Ast.location option * structure list and structure = Delimiter of sexp | Contents of sexp list let rec needs_vertical_layout = function | Vertical_block _ | Structured_block _ -> true | Atom _ -> false | List (_, l) -> List.exists needs_vertical_layout l | Block { l; _ } -> List.exists needs_vertical_layout l let rec format_sexp in_block depth first ctx s = let p = ctx.base.printer in match s with | Atom { loc; len; style; s } -> string_node ctx loc style len s | List (loc, l) when (ctx.format = Hybrid && depth > 1) || ctx.format = Compact -> let trivia = get_trivia ctx loc in print_trivia ctx trivia.before; Printer.box p (fun () -> print_styled ctx Punctuation "("; Printer.hvbox p ~indent:(ctx.indent_level - 1) (fun () -> List.iteri (fun i v -> if i > 0 then Printer.space p (); format_sexp in_block depth (i = 0) ctx v) l); print_trivia ctx trivia.within; print_styled ctx Punctuation ")"; print_trivia ctx trivia.after) | List (loc, l) -> let trivia = get_trivia ctx loc in print_trivia ctx trivia.before; (if ((not in_block) && ctx.format = Expansive) || List.exists needs_vertical_layout l then Printer.vbox else Printer.hvbox) p (fun () -> print_styled ctx Punctuation "("; Printer.indent p ctx.indent_level (fun () -> List.iteri (fun i v -> if i > 0 then Printer.space p (); format_sexp in_block (depth + 1) (i = 0) ctx v) l); Printer.cut p (); print_trivia ctx trivia.within; Printer.box p (fun () -> print_styled ctx Punctuation ")"; print_trivia ctx trivia.after)) | Block { l; transparent; loc; bk } -> ( let trivia = get_trivia ctx loc in let indent = if first then ctx.indent_level - 1 else 0 in print_trivia ctx trivia.before; let render () = List.iteri (fun i v -> if i > 0 then Printer.space p (); format_sexp (in_block || not transparent) depth (first && i = 0) ctx v) l; print_trivia ctx trivia.within; print_trivia ctx trivia.after in match bk with | `Hv -> Printer.hvbox p ~indent render | `Hov -> Printer.hovbox p ~indent render | `Box -> (if (not in_block) && transparent && ctx.format = Expansive then Printer.vbox else Printer.box) p ~indent render) | Vertical_block (loc, l) -> let trivia = get_trivia ctx loc in (* Printed before the box opens so a comment leading the first element merges with the line break before the block instead of doubling it into a blank line. *) print_trivia ctx trivia.before; Printer.vbox p (fun () -> List.iteri (fun i v -> if i > 0 then Printer.space p (); format_sexp in_block depth false ctx v) l; print_trivia ctx trivia.within; print_trivia ctx trivia.after) | Structured_block (loc, l) -> let trivia = get_trivia ctx loc in print_trivia ctx trivia.before; Printer.vbox p (fun () -> let len = List.length l in List.iteri (fun i s -> match s with | Delimiter d -> if i > 0 then Printer.newline p (); if i = len - 1 then print_trivia ctx trivia.within; Printer.box p (fun () -> format_sexp in_block depth false ctx d; print_trivia ctx trivia.after) | Contents [] -> () | Contents l -> Printer.indent p ctx.indent_level (fun () -> Printer.newline p (); Printer.vbox p (fun () -> List.iteri (fun i v -> if i > 0 then Printer.newline p (); format_sexp in_block depth false ctx v) l))) l) let atom ~style ?loc s = Atom { loc; len = None; style; s } let keyword ?loc s = atom ~style:Keyword ?loc s let instruction ?loc s = atom ~style:Instruction ?loc s let type_ ?loc s = atom ~style:Type ?loc s let list ?loc l = List (loc, l) let block ?loc ?(transparent = false) ?(bk = `Box) l = Block { loc; l; transparent; bk } let structured_block ?loc l = Structured_block (loc, l) let option f x = match x with None -> [] | Some x -> f x let u32 ~style ?loc i = atom ~style ?loc (Uint32.to_string i) let u64 ?loc i = atom ?loc (Uint64.to_string i) let escape_string = Wax_utils.Unicode.escape_string (* The source text of a [$id] and its terminal width: a plain identifier is written [$x], anything else in the quoted [$"…"] form with escaping. *) let id_parts x = if Lexer.is_valid_identifier x then (Wax_utils.Unicode.terminal_width x + 1, "$" ^ x) else let i, s = escape_string x in (i + 3, "$\"" ^ s ^ "\"") let id_string x = snd (id_parts x) let id ?(style = Identifier) ?loc x = let len, s = id_parts x in Atom { loc; style; len = Some len; s } let opt_id = option (fun i -> [ id ~loc:i.Ast.info i.Ast.desc ]) let index ?(style = Identifier) x = let loc = x.Ast.info in match x.desc with Num i -> u32 ~style ~loc i | Id s -> id ~style ~loc s (*** Type printing ***) let heaptype (ty : heaptype) = match heaptype_keyword ty with | Some kw -> type_ kw | None -> ( match ty with | Type t -> index t | Exact t -> list [ type_ "exact"; index t ] | _ -> assert false) let reftype { nullable; typ } = match (nullable, typ) with | true, Func -> type_ "funcref" | true, NoFunc -> type_ "nullfuncref" | true, Extern -> type_ "externref" | true, NoExtern -> type_ "nullexternref" | true, Any -> type_ "anyref" | true, Eq -> type_ "eqref" | true, I31 -> type_ "i31ref" | true, Struct -> type_ "structref" | true, Array -> type_ "arrayref" | true, None_ -> type_ "nullref" | true, Exn -> type_ "exnref" | true, NoExn -> type_ "nullexnref" | true, Cont -> type_ "contref" | true, NoCont -> type_ "nullcontref" | _ -> let r = [ heaptype typ ] in list (type_ "ref" :: (if nullable then type_ "null" :: r else r)) let valtype (t : valtype) = match t with | I32 -> type_ "i32" | I64 -> type_ "i64" | F32 -> type_ "f32" | F64 -> type_ "f64" | V128 -> type_ "v128" | Ref ty -> reftype ty let packedtype t = match t with I8 -> type_ "i8" | I16 -> type_ "i16" let make_list ~kind ?(always = false) name f l = if (not always) && l = [] then [] else [ list (kind name :: f l) ] let valtype_list name tl = make_list ~kind:keyword name (fun tl -> List.map valtype tl) tl let functype { params; results } = let params = Array.to_list params in let params_sexp = if List.for_all (fun p -> fst p.Ast.desc = None) params then valtype_list "param" (List.map (fun p -> snd p.Ast.desc) params) else (* Anchor each [(param …)] at the parameter's own location (the name is anchored separately via [opt_id]), so a trailing comment attaches to the parameter. *) List.map (fun p -> let i, t = p.Ast.desc in list ~loc:p.Ast.info (keyword "param" :: (opt_id i @ [ valtype t ]))) params in params_sexp @ valtype_list "result" (Array.to_list results) let storagetype typ = match typ with Value typ -> valtype typ | Packed typ -> packedtype typ let mut_type f { mut; typ } = if mut then list [ keyword "mut"; f typ ] else f typ let fieldtype typ = mut_type (fun t -> storagetype t) typ let globaltype typ = mut_type (fun t -> valtype t) typ let comptype (typ : comptype) = match typ with | Func ty -> list (keyword "func" :: functype ty) | Struct l -> list (keyword "struct" :: List.map (fun fld -> let nm, f = fld.Ast.desc in list ~loc:fld.Ast.info (keyword "field" :: (opt_id nm @ [ fieldtype f ]))) (Array.to_list l)) | Array ty -> list [ keyword "array"; fieldtype ty ] | Cont idx -> list [ keyword "cont"; index idx ] let typeuse idx = [ list [ keyword "type"; index idx ] ] let typeuse' (idx, typ) = option typeuse idx @ option functype typ let blocktype = option @@ fun t -> match t with | Valtype t -> [ list [ keyword "result"; valtype t ] ] | Typeuse t -> typeuse' t let address_type at = match at with `I32 -> [] | `I64 -> [ keyword "i64" ] let limits { Ast.desc = { mi; ma; address_type = at; page_size_log2; }; _ } = address_type at @ (u64 ~style:Constant mi :: option (fun i -> [ u64 ~style:Constant i ]) ma) @ (if shared then [ keyword "shared" ] else []) @ match page_size_log2 with | None -> [] | Some p -> [ list [ keyword "pagesize"; u64 ~style:Constant (Uint64.of_int64 (Int64.shift_left 1L p)); ]; ] let tabletype { limits = l; reftype = typ } = limits l @ [ reftype typ ] (*** Operators, immediates, and SIMD ***) let quoted_string s = let loc = s.Ast.info in let i, s = escape_string s.Ast.desc in Atom { loc = Some loc; style = String; len = Some (i + 2); s = "\"" ^ s ^ "\"" } let exports l = List.map (fun name -> list [ keyword "export"; quoted_string name ]) l let type_prefix op nm = (match op with | I32 _ -> "i32." | I64 _ -> "i64." | F32 _ -> "f32." | F64 _ -> "f64.") ^ nm let signage op (s : signage) = op ^ match s with Signed -> "_s" | Unsigned -> "_u" let size sz = match sz with `F32 -> "f32" | `F64 -> "f64" | `I32 -> "i32" | `I64 -> "i64" let int_un_op width op = match op with | Clz -> "clz" | Ctz -> "ctz" | Popcnt -> "popcnt" | Eqz -> "eqz" | Trunc (sz, s) -> signage ("trunc_" ^ size sz) s | TruncSat (sz, s) -> signage ("trunc_sat_" ^ size sz) s | Reinterpret -> "reinterpret_f" ^ width | ExtendS sz -> ( match sz with | `_8 -> "extend8_s" | `_16 -> "extend16_s" | `_32 -> "extend32_s") let int_bin_op _ (op : int_bin_op) = match op with | Add -> "add" | Sub -> "sub" | Mul -> "mul" | Div s -> signage "div" s | Rem s -> signage "rem" s | And -> "and" | Or -> "or" | Xor -> "xor" | Shl -> "shl" | Shr s -> signage "shr" s | Rotl -> "rotl" | Rotr -> "rotr" | Eq -> "eq" | Ne -> "ne" | Lt s -> signage "lt" s | Gt s -> signage "gt" s | Le s -> signage "le" s | Ge s -> signage "ge" s let float_un_op sz op = match op with | Neg -> "neg" | Abs -> "abs" | Ceil -> "ceil" | Floor -> "floor" | Trunc -> "trunc" | Nearest -> "nearest" | Sqrt -> "sqrt" | Convert (`I32, s) -> signage "convert_i32" s | Convert (`I64, s) -> signage "convert_i64" s | Reinterpret -> "reinterpret_i" ^ sz let float_bin_op _ op = match op with | Add -> "add" | Sub -> "sub" | Mul -> "mul" | Div -> "div" | Min -> "min" | Max -> "max" | CopySign -> "copysign" | Eq -> "eq" | Ne -> "ne" | Lt -> "lt" | Gt -> "gt" | Le -> "le" | Ge -> "ge" let select i32 i64 f32 f64 _ op = match op with | I32 x -> i32 "32" x | I64 x -> i64 "64" x | F32 x -> f32 "32" x | F64 x -> f64 "64" x let memidx i = if i.Ast.desc = Num Uint32.zero then [] else [ index i ] let memarg align' { offset; align } = (if offset = Uint64.zero then [] else [ atom ~style:Attribute ("offset=" ^ Uint64.to_string offset) ]) @ if align = align' then [] else [ atom ~style:Attribute (Printf.sprintf "align=" ^ Uint64.to_string align) ] let vec_shape = function | I8x16 -> "i8x16" | I16x8 -> "i16x8" | I32x4 -> "i32x4" | I64x2 -> "i64x2" | F32x4 -> "f32x4" | F64x2 -> "f64x2" let vec_tern_op op = match op with | VecRelaxedMAdd _ -> "relaxed_madd" | VecRelaxedNMAdd _ -> "relaxed_nmadd" | VecRelaxedLaneSelect _ -> "relaxed_laneselect" | VecRelaxedDotAdd -> "relaxed_dot_i8x16_i7x16_add_s" let vec_const { Wax_utils.V128.shape; components } = keyword (match shape with | I8x16 -> "i8x16" | I16x8 -> "i16x8" | I32x4 -> "i32x4" | I64x2 -> "i64x2" | F32x4 -> "f32x4" | F64x2 -> "f64x2") :: List.map (atom ~style:Constant) components (* One data-segment element (WAT numeric-values proposal): a quoted byte string, a typed numeric run [(i16 -1 2)], or a run of [v128] constants. *) let data_elem_sexp e = match e.Ast.desc with | Str s -> quoted_string { e with Ast.desc = s } | Numlist (ty, l) -> list (storagetype ty :: List.map (atom ~style:Constant) l) | V128list vs -> list (keyword "v128" :: List.concat_map vec_const vs) let vec_load_op_nat_align = function | Load128 -> 16 | Load8x8S | Load8x8U | Load16x4S | Load16x4U | Load32x2S | Load32x2U | Load64Zero -> 8 | Load32Zero -> 4 let vec_lane_op_nat_align = function | `I8 -> 1 | `I16 -> 2 | `I32 -> 4 | `I64 -> 8 let num_type_nat_align = function NumI32 | NumF32 -> 4 | NumI64 | NumF64 -> 8 let storage_type_nat_align = function `I8 -> 1 | `I16 -> 2 | `I32 -> 4 let catches l = List.map (fun c -> match c with | Catch (x, l) -> list [ keyword "catch"; index x; index l ] | CatchRef (x, l) -> list [ keyword "catch_ref"; index x; index l ] | CatchAll l -> list [ keyword "catch_all"; index l ] | CatchAllRef l -> list [ keyword "catch_all_ref"; index l ]) l let on_clauses l = List.map (fun c -> match c with | OnLabel (x, l) -> list [ keyword "on"; index x; index l ] | OnSwitch x -> list [ keyword "on"; index x; keyword "switch" ]) l let cmp_op_string (op : Ast.cmp_op) = match op with | Eq -> "=" | Ne -> "<>" | Lt -> "<" | Gt -> ">" | Le -> "<=" | Ge -> ">=" let rec cond_doc (c : Ast.cond) = match c with | Cond_var v -> id ~style:Annotation ~loc:v.Ast.info v.Ast.desc | Cond_string s -> let i, str = escape_string s.Ast.desc in Atom { loc = Some s.Ast.info; style = Annotation; len = Some (i + 2); s = "\"" ^ str ^ "\""; } | Cond_version (a, b, c) -> list (List.map (fun n -> atom ~style:Annotation (string_of_int n)) [ a; b; c ]) | Cond_and l -> list (atom ~style:Annotation "and" :: List.map cond_doc l) | Cond_or l -> list (atom ~style:Annotation "or" :: List.map cond_doc l) | Cond_not e -> list [ atom ~style:Annotation "not"; cond_doc e ] | Cond_cmp (op, a, b) -> list [ atom ~style:Annotation (cmp_op_string op); cond_doc a; cond_doc b ] (* Branch-hinting proposal: the [(@metadata.code.branch_hint "\00"|"\01")] annotation that prefixes a hinted conditional branch. *) let branch_hint_annotation (likely : bool) = let i, s = escape_string (if likely then "\001" else "\000") in list [ atom ~style:Annotation "@metadata.code.branch_hint"; Atom { loc = None; style = Annotation; len = Some (i + 2); s = "\"" ^ s ^ "\""; }; ] (*** The instruction printer ***) let rec instr i = let loc = i.Ast.info in match i.Ast.desc with | ExternConvertAny -> instruction ~loc "extern.convert_any" | AnyConvertExtern -> instruction ~loc "any.convert_extern" | Const op -> block ~loc [ instruction (type_prefix op "const"); atom ~style:Constant (select (fun _ i -> i) (fun _ i -> i) (fun _ i -> i) (fun _ i -> i) (fun _ i -> i) op); ] | UnOp (I32 op) -> instruction ~loc ("i32." ^ int_un_op "32" op) | UnOp (I64 op) -> instruction ~loc ("i64." ^ int_un_op "64" op) | UnOp (F32 op) -> instruction ~loc ("f32." ^ float_un_op "32" op) | UnOp (F64 op) -> instruction ~loc ("f64." ^ float_un_op "64" op) | BinOp (I32 op) -> instruction ~loc ("i32." ^ int_bin_op "32" op) | BinOp (I64 op) -> instruction ~loc ("i64." ^ int_bin_op "64" op) | BinOp (F32 op) -> instruction ~loc ("f32." ^ float_bin_op "32" op) | BinOp (F64 op) -> instruction ~loc ("f64." ^ float_bin_op "64" op) | Add128 -> instruction ~loc "i64.add128" | Sub128 -> instruction ~loc "i64.sub128" | MulWide s -> instruction ~loc (signage "i64.mul_wide" s) | I32WrapI64 -> instruction ~loc "i32.wrap_i64" | I64ExtendI32 s -> instruction ~loc (signage "i64.extend_i32" s) | F32DemoteF64 -> instruction ~loc "f32.demote_f64" | F64PromoteF32 -> instruction ~loc "f64.promote_f32" | VecConst c -> block ~loc (instruction "v128.const" :: vec_const c) | VecShuffle lanes -> block ~loc (instruction "i8x16.shuffle" :: List.init 16 (fun i -> atom ~style:Constant (Int.to_string (Char.code lanes.[i])))) | VecExtract (op, s, lane) -> block ~loc [ instruction ~loc (vec_shape op ^ ".extract_lane" ^ match s with Some s -> signage "" s | None -> ""); atom ~style:Constant (Int.to_string lane); ] | VecReplace (op, lane) -> block [ instruction ~loc (vec_shape op ^ ".replace_lane"); atom ~style:Constant (Int.to_string lane); ] | (VecSplat _ | VecUnOp _ | VecBinOp _ | VecTest _ | VecShift _ | VecBitmask _) as desc -> (* Plain vector instructions share their WAT mnemonics with the lexer via the Simd registry. *) instruction ~loc (Option.get (Simd.wat_mnemonic desc)) | VecTernOp op -> let shape_str = match op with | VecRelaxedMAdd s | VecRelaxedNMAdd s -> ( match s with `F32 -> "f32x4" | `F64 -> "f64x2") | VecRelaxedLaneSelect s -> vec_shape s | VecRelaxedDotAdd -> "i32x4" in instruction ~loc (shape_str ^ "." ^ vec_tern_op op) | VecBitselect -> instruction ~loc "v128.bitselect" | VecLoad (i, op, m) -> block ~loc (instruction (match op with | Load128 -> "v128.load" | Load8x8S -> "v128.load8x8_s" | Load8x8U -> "v128.load8x8_u" | Load16x4S -> "v128.load16x4_s" | Load16x4U -> "v128.load16x4_u" | Load32x2S -> "v128.load32x2_s" | Load32x2U -> "v128.load32x2_u" | Load32Zero -> "v128.load32_zero" | Load64Zero -> "v128.load64_zero") :: (memidx i @ memarg (Uint64.of_int (vec_load_op_nat_align op)) m)) | VecStore (i, m) -> block ~loc (instruction "v128.store" :: (memidx i @ memarg (Uint64.of_int 16) m)) | VecLoadLane (i, op, m, lane) -> block ~loc (instruction (Printf.sprintf "v128.load%s_lane" (match op with | `I8 -> "8" | `I16 -> "16" | `I32 -> "32" | `I64 -> "64")) :: (memidx i @ memarg (Uint64.of_int (vec_lane_op_nat_align op)) m @ [ atom ~style:Constant (Int.to_string lane) ])) | VecStoreLane (i, op, m, lane) -> block ~loc (instruction (Printf.sprintf "v128.store%s_lane" (match op with | `I8 -> "8" | `I16 -> "16" | `I32 -> "32" | `I64 -> "64")) :: (memidx i @ memarg (Uint64.of_int (vec_lane_op_nat_align op)) m @ [ atom ~style:Constant (Int.to_string lane) ])) | VecLoadSplat (i, op, m) -> block ~loc (instruction (Printf.sprintf "v128.load%s_splat" (match op with | `I8 -> "8" | `I16 -> "16" | `I32 -> "32" | `I64 -> "64")) :: (memidx i @ memarg (Uint64.of_int (vec_lane_op_nat_align op)) m)) | Load (i, m, sz) -> block ~loc (instruction (Printf.sprintf "%s.load" (match sz with | NumI32 -> "i32" | NumI64 -> "i64" | NumF32 -> "f32" | NumF64 -> "f64")) :: (memidx i @ memarg (Uint64.of_int (num_type_nat_align sz)) m)) | LoadS (i, m, sz, sz', s) -> block ~loc (instruction (signage (Printf.sprintf "%s.load%s" (match sz with `I32 -> "i32" | `I64 -> "i64") (match sz' with `I8 -> "8" | `I16 -> "16" | `I32 -> "32")) s) :: (memidx i @ memarg (Uint64.of_int (storage_type_nat_align sz')) m)) | Store (i, m, sz) -> block ~loc (instruction (Printf.sprintf "%s.store" (match sz with | NumI32 -> "i32" | NumI64 -> "i64" | NumF32 -> "f32" | NumF64 -> "f64")) :: (memidx i @ memarg (Uint64.of_int (num_type_nat_align sz)) m)) | StoreS (i, m, sz, sz') -> block ~loc (instruction (Printf.sprintf "%s.store%s" (match sz with `I32 -> "i32" | `I64 -> "i64") (match sz' with `I8 -> "8" | `I16 -> "16" | `I32 -> "32")) :: (memidx i @ memarg (Uint64.of_int (storage_type_nat_align sz')) m)) | Atomic (i, op, m) -> block ~loc (instruction (Atomics.name op) :: (memidx i @ memarg (Uint64.of_int (1 lsl Atomics.natural_align_log2 op)) m)) | AtomicFence -> instruction ~loc "atomic.fence" | MemorySize m -> block ~loc (instruction "memory.size" :: memidx m) | MemoryGrow m -> block ~loc (instruction "memory.grow" :: memidx m) | MemoryFill m -> block ~loc (instruction "memory.fill" :: memidx m) | MemoryCopy (m, m') -> block ~loc (instruction "memory.copy" :: (if m.desc = Num Uint32.zero && m'.desc = Num Uint32.zero then [] else [ index m; index m' ])) | MemoryInit (m, d) -> block ~loc (instruction "memory.init" :: (memidx m @ [ index d ])) | DataDrop d -> block ~loc [ instruction "data.drop"; index d ] | TableGet m -> block ~loc (instruction "table.get" :: memidx m) | TableSet m -> block ~loc (instruction "table.set" :: memidx m) | TableSize m -> block ~loc (instruction "table.size" :: memidx m) | TableGrow m -> block ~loc (instruction "table.grow" :: memidx m) | TableFill m -> block ~loc (instruction "table.fill" :: memidx m) | TableCopy (m, m') -> block ~loc (instruction "table.copy" :: (if m.desc = Num Uint32.zero && m'.desc = Num Uint32.zero then [] else [ index m; index m' ])) | TableInit (m, d) -> block ~loc (instruction "table.init" :: (memidx m @ [ index d ])) | ElemDrop d -> block ~loc [ instruction "elem.drop"; index d ] | LocalGet i -> block ~loc [ instruction "local.get"; index i ] | LocalTee i -> block ~loc [ instruction "local.tee"; index i ] | GlobalGet i -> block ~loc [ instruction "global.get"; index i ] | CallIndirect (id, typ) -> block ~loc (instruction "call_indirect" :: ((if id.desc = Num Uint32.zero then [] else [ index id ]) @ typeuse' typ)) | ReturnCallIndirect (id, typ) -> block ~loc (instruction "return_call_indirect" :: ((if id.desc = Num Uint32.zero then [] else [ index id ]) @ typeuse' typ)) | Call f -> block ~loc [ instruction "call"; index f ] | Select t -> block ~loc (instruction "select" :: option (fun t -> valtype_list "result" t) t) | RefFunc i -> block ~loc [ instruction "ref.func"; index i ] | RefIsNull -> block ~loc [ instruction "ref.is_null" ] | RefAsNonNull -> block ~loc [ instruction "ref.as_non_null" ] | CallRef t -> block ~loc [ instruction "call_ref"; index t ] | RefI31 -> instruction ~loc "ref.i31" | I31Get s -> instruction ~loc (signage "i31.get" s) | ArrayNew t -> block ~loc [ instruction "array.new"; index t ] | ArrayNewDefault t -> block ~loc [ instruction "array.new_default"; index t ] | ArrayNewFixed (t, i) -> block ~loc [ instruction "array.new_fixed"; index t; u32 ~style:Constant i ] | ArrayNewElem (i, i') -> block ~loc [ instruction "array.new_elem"; index i; index i' ] | ArrayNewData (typ, data) -> block ~loc [ instruction "array.new_data"; index typ; index data ] | ArrayInitData (i, i') -> block ~loc [ instruction "array.init_data"; index i; index i' ] | ArrayInitElem (i, i') -> block ~loc [ instruction "array.init_elem"; index i; index i' ] | ArrayGet (None, typ) -> block ~loc [ instruction "array.get"; index typ ] | ArrayGet (Some s, typ) -> block ~loc [ instruction (signage "array.get" s); index typ ] | ArrayLen -> instruction ~loc "array.len" | ArrayCopy (i, i') -> block ~loc [ instruction "array.copy"; index i; index i' ] | ArrayFill i -> block ~loc [ instruction "array.fill"; index i ] | StructNew typ -> block ~loc [ instruction "struct.new"; index typ ] | StructNewDefault typ -> block ~loc [ instruction "struct.new_default"; index typ ] | StructNewDesc typ -> block ~loc [ instruction "struct.new_desc"; index typ ] | StructNewDefaultDesc typ -> block ~loc [ instruction "struct.new_default_desc"; index typ ] | StructGet (None, typ, f) -> block ~loc [ instruction "struct.get"; index typ; index f ] | StructGet (Some s, typ, f) -> block ~loc [ instruction (signage "struct.get" s); index typ; index f ] | RefCast ty -> block ~loc [ instruction "ref.cast"; reftype ty ] | RefCastDescEq ty -> block ~loc [ instruction "ref.cast_desc_eq"; reftype ty ] | RefGetDesc i -> block ~loc [ instruction "ref.get_desc"; index i ] | RefTest ty -> block ~loc [ instruction "ref.test"; reftype ty ] | RefEq -> instruction ~loc "ref.eq" | RefNull ty -> block ~loc [ instruction "ref.null"; heaptype ty ] | If { label; typ; if_block; else_block } -> structured_block ~loc (Delimiter (block (instruction "if" :: (opt_id label @ blocktype typ))) :: Contents (List.map instr if_block.desc) :: (if else_block.desc = [] then [ Delimiter (instruction "end") ] else [ Delimiter (instruction "else"); Contents (List.map instr else_block.desc); Delimiter (instruction "end"); ])) | Drop -> instruction ~loc "drop" | LocalSet i -> block ~loc [ instruction "local.set"; index i ] | GlobalSet i -> block ~loc [ instruction "global.set"; index i ] | Block { label; typ; block = b } -> structured_block ~loc [ Delimiter (block (instruction "block" :: (opt_id label @ blocktype typ))); Contents (List.map instr b.desc); Delimiter (instruction "end"); ] | Loop { label; typ; block = b } -> structured_block ~loc [ Delimiter (block (instruction "loop" :: (opt_id label @ blocktype typ))); Contents (List.map instr b.desc); Delimiter (instruction "end"); ] | TryTable { label; typ; catches = c; block = b } -> structured_block ~loc [ Delimiter (block (instruction "try_table" :: (opt_id label @ blocktype typ))); Contents (catches c @ List.map instr b.desc); Delimiter (instruction "end"); ] | Try { label; typ; block = b; catches; catch_all } -> structured_block ~loc (Delimiter (block (instruction "try" :: (opt_id label @ blocktype typ))) :: Contents (List.map instr b.desc) :: (List.flatten (List.map (fun (i, l) -> [ Delimiter (block [ instruction "catch"; index i ]); Contents (List.map instr l.Ast.desc); ]) catches) @ (match catch_all with | None -> [] | Some c -> [ Delimiter (instruction "catch_all"); Contents (List.map instr c.desc); ]) @ [ Delimiter (instruction "end") ])) | Br_table (l, i) -> block ~loc (instruction "br_table" :: List.map (fun i -> index i) (l @ [ i ])) | Br i -> block ~loc [ instruction "br"; index i ] | Br_if i -> block ~loc [ instruction "br_if"; index i ] | Br_on_null i -> block ~loc [ instruction "br_on_null"; index i ] | Br_on_non_null i -> block ~loc [ instruction "br_on_non_null"; index i ] | Br_on_cast (i, ty, ty') -> block ~loc [ instruction "br_on_cast"; index i; reftype ty; reftype ty' ] | Br_on_cast_fail (i, ty, ty') -> block ~loc [ instruction "br_on_cast_fail"; index i; reftype ty; reftype ty' ] | Br_on_cast_desc_eq (i, ty, ty') -> block ~loc [ instruction "br_on_cast_desc_eq"; index i; reftype ty; reftype ty' ] | Br_on_cast_desc_eq_fail (i, ty, ty') -> block ~loc [ instruction "br_on_cast_desc_eq_fail"; index i; reftype ty; reftype ty'; ] (* Branch-hinting proposal: unfolded hinted branch — the annotation precedes the wrapped instruction. A block-form [if] keeps its own multi-line layout (the annotation on its own line above it); an inline [br_if]/[br_on_*] stays on one line with the annotation. *) | Hinted (h, inner) -> ( match inner.Ast.desc with | If _ -> Vertical_block (Some loc, [ branch_hint_annotation h; instr inner ]) | _ -> block ~loc ~transparent:true [ branch_hint_annotation h; instr inner ] ) | Return -> instruction ~loc "return" | Throw tag -> block ~loc [ instruction "throw"; index tag ] | ThrowRef -> block ~loc [ instruction "throw_ref" ] | ContNew i -> block ~loc [ instruction "cont.new"; index i ] | ContBind (i, j) -> block ~loc [ instruction "cont.bind"; index i; index j ] | Suspend i -> block ~loc [ instruction "suspend"; index i ] | Resume (i, clauses) -> block ~loc (instruction "resume" :: index i :: on_clauses clauses) | ResumeThrow (i, j, clauses) -> block ~loc (instruction "resume_throw" :: index i :: index j :: on_clauses clauses) | ResumeThrowRef (i, clauses) -> block ~loc (instruction "resume_throw_ref" :: index i :: on_clauses clauses) | Switch (i, j) -> block ~loc [ instruction "switch"; index i; index j ] | Nop -> instruction ~loc "nop" | Unreachable -> instruction ~loc "unreachable" | ArraySet typ -> block ~loc [ instruction "array.set"; index typ ] | StructSet (typ, i) -> block ~loc [ instruction "struct.set"; index typ; index i ] | ReturnCall f -> block ~loc [ instruction "return_call"; index f ] | ReturnCallRef typ -> block ~loc [ instruction "return_call_ref"; index typ ] | Folded ({ desc = If { label; typ; if_block; else_block }; _ }, l) -> (* Give each clause the location of its (then ...)/(else ...) group so a comment trailing the clause attaches to it. *) let clause ?(always = false) name b = if (not always) && b.Ast.desc = [] then [] else [ list ~loc:b.Ast.info (instruction name :: List.map instr b.Ast.desc); ] in list ~loc (block ~transparent:true (block (instruction "if" :: (opt_id label @ blocktype typ)) :: List.map instr l) :: (clause ~always:true "then" if_block @ clause "else" else_block)) | Folded ({ desc = Block { label; typ; block = b }; _ }, l) -> assert (l = []); list ~loc (block (instruction "block" :: (opt_id label @ blocktype typ)) :: List.map instr b.desc) | Folded ({ desc = Loop { label; typ; block = b }; _ }, l) -> assert (l = []); list ~loc (block (instruction "loop" :: (opt_id label @ blocktype typ)) :: List.map instr b.desc) | Folded ({ desc = TryTable { label; typ; catches = c; block = b }; _ }, l) -> assert (l = []); list ~loc (block (instruction "try_table" :: (opt_id label @ blocktype typ)) :: block (catches c) :: List.map instr b.desc) | Folded ({ desc = Try { label; typ; block = b; catches; catch_all }; _ }, l) -> assert (l = []); list ~loc (block (instruction "try" :: (opt_id label @ blocktype typ)) :: list (instruction "do" :: List.map instr b.desc) :: (List.map (fun (i, l) -> list (block [ instruction "catch"; index i ] :: List.map instr l.Ast.desc)) catches @ match catch_all with | None -> [] | Some l -> [ list (instruction "catch_all" :: List.map instr l.Ast.desc) ]) ) | String (id, s) | Folded ({ desc = String (id, s); _ }, []) -> list ~loc (block (atom ~style:Annotation "@string" :: option (fun id -> [ index ~style:Annotation id ]) id) :: List.map (fun s -> let loc = Some s.Ast.info in let i, s = escape_string s.Ast.desc in Atom { loc; style = Annotation; len = Some (i + 2); s = "\"" ^ s ^ "\""; }) s) | Char c | Folded ({ desc = Char c; _ }, []) -> let n = Uchar.utf_8_byte_length c in let b = Bytes.create n in ignore (Bytes.set_utf_8_uchar b 0 c); list ~loc [ atom ~style:Annotation "@char"; (let i, s = escape_string (Bytes.to_string b) in Atom { loc = None; style = Annotation; len = Some (i + 2); s = "\"" ^ s ^ "\""; }); ] | If_annotation { cond; then_body; else_body } | Folded ({ desc = If_annotation { cond; then_body; else_body }; _ }, []) -> let clause head body = list ~loc:body.Ast.info (atom ~style:Annotation ("@" ^ head) :: List.map instr body.Ast.desc) in list ~loc (block [ atom ~style:Annotation "@if"; cond_doc cond ] :: clause "then" then_body :: option (fun e -> [ clause "else" e ]) else_body) (* Branch-hinting proposal: a folded hinted branch puts the annotation *before* the folded group — [(@…) (br_if …)] / [(@…) (if …)] — not inside it. The wrapped instruction is printed as its own folded node. *) | Folded ({ desc = Hinted (h, inner); info }, l) -> block ~loc ~transparent:true [ branch_hint_annotation h; instr { Ast.desc = Folded (inner, l); info }; ] | Folded (i, l) -> list ~loc [ block ~transparent:true (instr i :: List.map instr l) ] let instr_list_needs_vertical_layout l = List.exists (fun (i : _ Ast.Text.instr) -> match i.Ast.desc with Folded _ -> false | _ -> true) l let inline_instrs l = List.map instr l let instrs l = match l with | [] -> [] | _ -> let docs = List.map instr l in if instr_list_needs_vertical_layout l then [ Vertical_block (None, docs) ] else docs (*** Types, declarations, and module fields ***) let subtype ?loc t = let id, { typ; supertype; final; descriptor; describes } = t.Ast.desc in let loc = match loc with Some _ -> loc | None -> Some t.Ast.info in (* [(describes $o)] / [(descriptor $d)] clauses precede the composite type. *) let clauses = option (fun i -> [ list [ keyword "describes"; index i ] ]) describes @ option (fun i -> [ list [ keyword "descriptor"; index i ] ]) descriptor in if final && Option.is_none supertype then list ?loc (block (keyword "type" :: opt_id id) :: (clauses @ [ block [ comptype typ ] ])) else list ?loc [ block (keyword "type" :: opt_id id); list [ block (block (keyword "sub" :: ((if final then [ keyword "final" ] else []) @ option (fun i -> [ index i ]) supertype)) :: (clauses @ [ comptype typ ])); ]; ] let fundecl (idx, typ) = option typeuse idx @ option (fun { params; results } -> if params = [||] && results = [||] then [] else [ block ((if Array.for_all (fun p -> fst p.Ast.desc = None) params then make_list ~kind:keyword "param" (fun tl -> List.map valtype tl) (Array.to_list (Array.map (fun p -> snd p.Ast.desc) params)) else Array.to_list (Array.map (fun p -> let i, t = p.Ast.desc in list ~loc:p.Ast.info (keyword "param" :: (opt_id i @ [ valtype t ]))) params)) @ valtype_list "result" (Array.to_list results)); ]) typ let expr name e = match e with | [ ({ Ast.desc = Folded _; _ } as i) ] -> instr i | _ -> list (keyword name :: inline_instrs e) let function_indices lst = let extract i = match i with | [ ( { Ast.desc = RefFunc idx; _ } | { Ast.desc = Folded ({ desc = RefFunc idx; _ }, []); _ } ); ] -> Some idx | _ -> None in if List.for_all (fun i -> extract i <> None) lst then Some (List.filter_map extract lst) else None (* The [(kind …)] descriptor s-expression shared by a plain import and a compact group item, e.g. [(func $id (type 0))] / [(global i32)]. *) let import_desc_block id (desc : importdesc) = let kind, typ = match desc with | Func { exact; typ } -> ( "func", if exact then [ list (type_ "exact" :: fundecl typ) ] else fundecl typ ) | Global ty -> ("global", [ globaltype ty ]) | Tag typ -> ("tag", fundecl typ) | Memory l -> ("memory", limits l) | Table ty -> ("table", tabletype ty) in block (keyword kind :: (opt_id id @ typ)) let rec modulefield f = let loc = f.Ast.info in match f.Ast.desc with (* Carry the field location (which spans the whole type definition) so a leading comment or blank line attaches before the type rather than to its inner name — the array element itself is built with a dummy location. *) | Types [| t |] -> subtype ~loc t | Types l -> list ~loc (keyword "rec" :: List.map subtype (Array.to_list l)) | Func { id; typ; locals; instrs = i; exports = e } -> let local_sexp e = let nm, t = e.Ast.desc in (* The hovbox lets a comment before any local break correctly while the locals stay packed. *) list ~loc:e.Ast.info (keyword "local" :: (opt_id nm @ [ valtype t ])) in let locals_block = match locals with | [] -> [] | _ -> [ block ~bk:`Hov (List.map local_sexp locals) ] in list ~loc (block (keyword "func" :: (opt_id id @ exports e @ fundecl typ)) :: (locals_block @ instrs i)) | Import { module_; name; id; desc; exports = e } -> ( match e with | [] -> list ~loc [ block [ keyword "import"; quoted_string module_; quoted_string name ]; list [ import_desc_block id desc ]; ] | _ -> let kind, typ = match desc with | Func { exact; typ } -> ( "func", if exact then [ list (type_ "exact" :: fundecl typ) ] else fundecl typ ) | Global ty -> ("global", [ globaltype ty ]) | Tag typ -> ("tag", fundecl typ) | Memory l -> ("memory", limits l) | Table ty -> ("table", tabletype ty) in list ~loc (block (keyword kind :: (opt_id id @ exports e @ [ list [ keyword "import"; quoted_string module_; quoted_string name; ]; ])) :: typ)) (* compact-import-section: [(import "m" (item "n" (kind …)) …)] with a type per item, and [(import "m" (item "n") … (kind …))] with one shared trailing type on name-only items. *) | Import_group1 { module_; items } -> list ~loc (block [ keyword "import"; quoted_string module_ ] :: List.map (fun (name, id, desc) -> list [ keyword "item"; quoted_string name; list [ import_desc_block id desc ]; ]) items) | Import_group2 { module_; desc; items } -> list ~loc (block [ keyword "import"; quoted_string module_ ] :: List.map (fun (name, id) -> list (keyword "item" :: (opt_id id @ [ quoted_string name ]))) items @ [ list [ import_desc_block None desc ] ]) | Global { id; typ; init; exports = e } -> list ~loc (block (keyword "global" :: (opt_id id @ exports e @ [ globaltype typ ])) :: instrs init) | Tag { id; typ; exports = e } -> list ~loc [ block (keyword "tag" :: (opt_id id @ exports e @ fundecl typ)) ] | Data { id; init; mode } -> let head = keyword "data" :: (opt_id id @ match mode with | Passive -> [] | Active (i, e) -> (if i.desc = Num Uint32.zero then [] else [ list [ keyword "memory"; index i ] ]) @ [ expr "offset" e ]) in list ~loc (block head :: List.map data_elem_sexp init) | Start idx -> list ~loc [ keyword "start"; index idx ] | Memory { id; limits = l; init; exports = e } -> let head = keyword "memory" :: (opt_id id @ exports e @ match init with | None -> limits l | Some _ -> address_type l.desc.address_type) in list ~loc (block head :: (match init with | None -> [] | Some init -> [ list (keyword "data" :: List.map data_elem_sexp init) ]) ) | Table { id; typ; init; exports = e } -> list ~loc (block (keyword "table" :: (opt_id id @ exports e @ match init with | Init_default | Init_expr _ -> tabletype typ | Init_segment _ -> address_type typ.limits.desc.address_type @ [ reftype typ.reftype ])) :: (match init with | Init_default -> [] | Init_expr i -> instrs i | Init_segment seg -> [ list (keyword "elem" :: (match function_indices seg with | Some lst -> List.map index lst | None -> List.map (fun e -> expr "item" e) seg)); ])) | Export { name; kind; index = i } -> list ~loc [ keyword "export"; quoted_string name; list [ keyword (match kind with | Func -> "func" | Memory -> "memory" | Table -> "table" | Tag -> "tag" | Global -> "global"); index i; ]; ] | Elem { id; typ; init; mode } -> let lst = (* The [func] shorthand denotes element type [(ref func)] (non-null, matching the [ref.func] elements), not the nullable [funcref]. It may therefore only be used for a non-nullable [Func] type; abbreviating a [funcref] segment would silently drop its nullability. *) match typ with | { nullable = false; typ = Func } -> function_indices init | _ -> None in list ~loc [ block (keyword "elem" :: (opt_id id @ (match mode with | Passive -> [] | Active (idx, ofs) -> (if idx.desc = Num Uint32.zero then [] else [ list [ keyword "table"; index idx ] ]) @ [ expr "offset" ofs ] | Declare -> [ keyword "declare" ]) @ [ (if lst = None then reftype typ else keyword "func") ])); block (match lst with | Some lst -> List.map index lst | _ -> List.map (fun e -> expr "item" e) init); ] | String_global { id = i; typ; init } -> list ~loc (block (atom ~style:Annotation "@string" :: id ~style:Annotation i.Ast.desc :: option (fun id -> [ index ~style:Annotation id ]) typ) :: List.map (fun s -> let i, s = escape_string s.Ast.desc in Atom { loc = None; style = Annotation; len = Some (i + 2); s = "\"" ^ s ^ "\""; }) init) | Feature_annotation name -> let i, s = escape_string name.Ast.desc in list ~loc [ atom ~style:Annotation "@feature"; Atom { loc = None; style = Annotation; len = Some (i + 2); s = "\"" ^ s ^ "\""; }; ] | Module_if_annotation { cond; then_fields; else_fields } -> let clause head fields = list ~loc:fields.Ast.info (atom ~style:Annotation ("@" ^ head) :: List.map modulefield fields.Ast.desc) in list ~loc (block [ atom ~style:Annotation "@if"; cond_doc cond ] :: clause "then" then_fields :: option (fun e -> [ clause "else" e ]) else_fields) (*** Entry points ***) let module_ ?(color = Auto) ?out_channel ?(tail = []) ?collect printer ~trivia (id, fields) = (* [collect] marks the dry trivia-collection traversal; time the real emit only, so a single "output" timing is reported. *) Wax_utils.Debug.timed_if (collect = None) "output" @@ fun () -> let use_color = should_use_color ~color ~out_channel in let theme = get_theme use_color in let ctx = { base = Styled.create ~printer ~theme ?collect ~trivia (); format = Hybrid; indent_level = 2; } in let sexp = (* Top-level fields are laid out strictly one per line. *) if id = None then Vertical_block (None, List.map modulefield fields) else list (block ~transparent:true (keyword "module" :: opt_id id) :: List.map modulefield fields) in format_sexp false (if id = None then 1 else 0) false ctx sexp; (* Comments owned by no location (trailing comments, or the whole file for an empty module) are printed last so they are not dropped. Blank lines at the very end are dropped (end-of-file whitespace), but blank lines separating tail comments are kept. *) let tail = Trivia.drop_trailing_blank_lines tail in print_trivia ctx tail let instr printer i = let use_color = should_use_color ~color:Auto ~out_channel:(Some stderr) in let theme = get_theme use_color in format_sexp false 2 false { base = Styled.create ~printer ~theme ~trivia:(Hashtbl.create 16) (); format = Compact; indent_level = 2; } (instr i) (* A type definition rendered to a plain (uncoloured) one-line-ish string, for the editor to show on hover over a type identifier. *) let subtype_string t = let buf = Buffer.create 64 in let fmt = Format.formatter_of_buffer buf in Printer.run fmt (fun printer -> format_sexp false 2 false { base = Styled.create ~printer ~theme:(get_theme false) ~trivia:(Hashtbl.create 16) (); format = Compact; indent_level = 2; } (subtype t)); Format.pp_print_flush fmt (); String.trim (Buffer.contents buf)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>