package smtml
Source file eval.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(***************************************************************************) (* This file is part of the third-party OCaml library `smtml`. *) (* Copyright (C) 2023-2024 formalsec *) (* *) (* This program is free software: you can redistribute it and/or modify *) (* it under the terms of the GNU General Public License as published by *) (* the Free Software Foundation, either version 3 of the License, or *) (* (at your option) any later version. *) (* *) (* This program is distributed in the hope that it will be useful, *) (* but WITHOUT ANY WARRANTY; without even the implied warranty of *) (* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *) (* GNU General Public License for more details. *) (* *) (* You should have received a copy of the GNU General Public License *) (* along with this program. If not, see <https://www.gnu.org/licenses/>. *) (***************************************************************************) (* Adapted from: *) (* - https://github.com/WebAssembly/spec/blob/main/interpreter/exec/ixx.ml, *) (* - https://github.com/WebAssembly/spec/blob/main/interpreter/exec/fxx.ml, and *) (* - https://github.com/WebAssembly/spec/blob/main/interpreter/exec *) (* TODO: This module should be concrete or a part of the reducer *) open Ty exception Value of Ty.t exception TypeError of int * Value.t * Ty.t exception DivideByZero exception ConversionToInteger exception IntegerOverflow let of_arg f n v = try f v with Value t -> raise (TypeError (n, v, t)) [@@inline] module Int = struct let to_value (i : int) : Value.t = Int i [@@inline] let of_value (n : int) (v : Value.t) : int = of_arg (function Int i -> i | _ -> raise_notrace (Value Ty_int)) n v [@@inline] let unop (op : unop) (v : Value.t) : Value.t = let f = match op with | Neg -> ( ~- ) | _ -> Log.err {|unop: Unsupported int operator "%a"|} Ty.pp_unop op in to_value (f (of_value 1 v)) let binop (op : binop) (v1 : Value.t) (v2 : Value.t) : Value.t = let f = match op with | Add -> ( + ) | Sub -> ( - ) | Mul -> ( * ) | Div -> ( / ) | Rem -> ( mod ) | Pow -> fun x y -> int_of_float (float_of_int x ** float_of_int y) | Min -> min | Max -> max | _ -> Log.err {|binop: Unsupported int operator "%a"|} Ty.pp_binop op in to_value (f (of_value 1 v1) (of_value 2 v2)) let relop (op : relop) (v1 : Value.t) (v2 : Value.t) : bool = let f = match op with | Lt -> ( < ) | Le -> ( <= ) | Gt -> ( > ) | Ge -> ( >= ) | _ -> Log.err {|relop: Unsupported int operator "%a"|} Ty.pp_relop op in f (of_value 1 v1) (of_value 2 v2) end module Real = struct let to_value (v : float) : Value.t = Real v [@@inline] let of_value (n : int) (v : Value.t) : float = of_arg (function Real v -> v | _ -> raise_notrace (Value Ty_int)) n v [@@inline] let unop (op : unop) (v : Value.t) : Value.t = let v = of_value 1 v in match op with | Neg -> to_value @@ Float.neg v | Abs -> to_value @@ Float.abs v | Sqrt -> to_value @@ Float.sqrt v | Nearest -> to_value @@ Float.round v | Ceil -> to_value @@ Float.ceil v | Floor -> to_value @@ Float.floor v | Trunc -> to_value @@ Float.trunc v | Is_nan -> if Float.is_nan v then Value.True else Value.False | _ -> Log.err {|unop: Unsupported real operator "%a"|} Ty.pp_unop op let binop (op : binop) (v1 : Value.t) (v2 : Value.t) : Value.t = let f = match op with | Add -> Float.add | Sub -> Float.sub | Mul -> Float.mul | Div -> Float.div | Rem -> Float.rem | Min -> Float.min | Max -> Float.max | _ -> Log.err {|binop: Unsupported real operator "%a"|} Ty.pp_binop op in to_value (f (of_value 1 v1) (of_value 2 v2)) let relop (op : relop) (v1 : Value.t) (v2 : Value.t) : bool = let f = match op with | Lt -> ( < ) | Le -> ( <= ) | Gt -> ( > ) | Ge -> ( >= ) | _ -> Log.err {|relop: Unsupported real operator "%a"|} Ty.pp_relop op in f (of_value 1 v1) (of_value 2 v2) let cvtop (op : cvtop) (v : Value.t) : Value.t = match op with | ToString -> Str (Float.to_string (of_value 1 v)) | OfString -> let v = match v with Str v -> v | _ -> raise_notrace (Value Ty_str) in to_value (Float.of_string v) | Reinterpret_int -> let v = match v with Int v -> v | _ -> raise_notrace (Value Ty_int) in to_value (Float.of_int v) | _ -> Log.err {|cvtop: Unsupported real operator "%a"|} Ty.pp_cvtop op end module Bool = struct let to_value (b : bool) : Value.t = if b then True else False [@@inline] let of_value (n : int) (v : Value.t) : bool = of_arg (function | True -> true | False -> false | _ -> raise_notrace (Value Ty_bool) ) n v [@@inline] let unop (op : unop) (v : Value.t) : Value.t = let b = of_value 1 v in match op with | Not -> to_value (not b) | _ -> Log.err {|unop: Unsupported bool operator "%a"|} Ty.pp_unop op let xor b1 b2 = match (b1, b2) with | true, true -> false | true, false -> true | false, true -> true | false, false -> false let binop (op : binop) (v1 : Value.t) (v2 : Value.t) : Value.t = let f = match op with | And -> ( && ) | Or -> ( || ) | Xor -> xor | _ -> Log.err {|binop: Unsupported bool operator "%a"|} Ty.pp_binop op in to_value (f (of_value 1 v1) (of_value 2 v2)) let triop (op : triop) (c : Value.t) (v1 : Value.t) (v2 : Value.t) : Value.t = match op with | Ite -> ( match of_value 1 c with true -> v1 | false -> v2 ) | _ -> Log.err {|triop: Unsupported bool operator "%a"|} Ty.pp_triop op let relop (op : relop) (v1 : Value.t) (v2 : Value.t) = match op with | Eq -> Value.equal v1 v2 | Ne -> not (Value.equal v1 v2) | _ -> Log.err {|relop: Unsupported bool operator "%a"|} Ty.pp_relop op let cvtop _ _ = assert false end module Str = struct let to_value (str : string) : Value.t = Str str [@@inline] let of_value (n : int) (v : Value.t) : string = of_arg (function Str str -> str | _ -> raise_notrace (Value Ty_str)) n v [@@inline] let replace _s _t _t' = (* TODO *) Log.err "TODO: string.replace s t t'" let indexof s sub start = let len_s = String.length s in let len_sub = String.length sub in let max_i = len_s - 1 in let rec loop i = if i > max_i then ~-1 else if i + len_sub > len_s then ~-1 else if String.sub s i len_sub = sub then i else loop (i + 1) in if start <= 0 then loop 0 else loop start let contains s sub = if indexof s sub 0 < 0 then false else true let unop (op : unop) (v : Value.t) : Value.t = let str = of_value 1 v in match op with | Seq_length -> Int.to_value (String.length str) | Trim -> to_value (String.trim str) | _ -> Log.err {|unop: Unsupported str operator "%a"|} Ty.pp_unop op let binop (op : binop) (v1 : Value.t) (v2 : Value.t) : Value.t = let str = of_value 1 v1 in match op with | Seq_at -> let i = Int.of_value 2 v2 in to_value (Format.sprintf "%c" (String.get str i)) | Seq_concat -> to_value (str ^ of_value 2 v2) | Seq_prefix -> Bool.to_value (String.starts_with ~prefix:str (of_value 2 v2)) | Seq_suffix -> Bool.to_value (String.ends_with ~suffix:str (of_value 2 v2)) | Seq_contains -> Bool.to_value (contains str (of_value 2 v2)) | _ -> Log.err {|binop: Unsupported str operator "%a"|} Ty.pp_binop op let triop (op : triop) (v1 : Value.t) (v2 : Value.t) (v3 : Value.t) : Value.t = let str = of_value 1 v1 in match op with | Seq_extract -> let i = Int.of_value 2 v2 in let len = Int.of_value 3 v3 in to_value (String.sub str i len) | Seq_replace -> let t = of_value 2 v2 in let t' = of_value 2 v3 in to_value (replace str t t') | Seq_index -> let t = of_value 2 v2 in let i = Int.of_value 3 v3 in Int.to_value (indexof str t i) | Ite -> Log.err {|triop: Unsupported str operator "%a"|} Ty.pp_triop op let relop _ = assert false let cvtop (op : cvtop) (v : Value.t) : Value.t = match op with | String_to_code -> let str = of_value 1 v in Int.to_value (Char.code str.[0]) | String_from_code -> let code = Int.of_value 1 v in to_value (String.make 1 (Char.chr code)) | String_to_int -> Int.to_value (int_of_string (of_value 1 v)) | String_from_int -> to_value (string_of_int (Int.of_value 1 v)) | _ -> Log.err {|cvtop: Unsupported str operator "%a"|} Ty.pp_cvtop op end module I32 = struct let to_value (i : int32) : Value.t = Num (I32 i) [@@inline] let of_value (n : int) (v : Value.t) : int32 = of_arg (function Num (I32 i) -> i | _ -> raise_notrace (Value (Ty_bitv 32))) n v [@@inline] let cmp_u x op y = op Int32.(add x min_int) Int32.(add y min_int) [@@inline] let lt_u x y = cmp_u x ( < ) y [@@inline] let le_u x y = cmp_u x ( <= ) y [@@inline] let gt_u x y = cmp_u x ( > ) y [@@inline] let ge_u x y = cmp_u x ( >= ) y [@@inline] let shift f x y = f x Int32.(to_int (logand y 31l)) [@@inline] let shl x y = shift Int32.shift_left x y [@@inline] let shr_s x y = shift Int32.shift_right x y [@@inline] let shr_u x y = shift Int32.shift_right_logical x y [@@inline] (* Stolen rotl and rotr from: *) (* https://github.com/OCamlPro/owi/blob/main/src/int32.ml *) (* We must mask the count to implement rotates via shifts. *) let clamp_rotate_count n = Int32.(to_int (logand n 31l)) [@@inline] let rotl x y = let n = clamp_rotate_count y in Int32.logor (shl x (Int32.of_int n)) (shr_u x (Int32.of_int (32 - n))) [@@inline] let rotr x y = let n = clamp_rotate_count y in Int32.logor (shr_u x (Int32.of_int n)) (shl x (Int32.of_int (32 - n))) [@@inline] let clz n = let n = Ocaml_intrinsics.Int32.count_leading_zeros n in Int32.of_int n let ctz n = let n = Ocaml_intrinsics.Int32.count_trailing_zeros n in Int32.of_int n let unop (op : unop) (v : Value.t) : Value.t = let f = match op with | Neg -> Int32.neg | Not -> Int32.lognot | Clz -> clz | Ctz -> ctz | _ -> Log.err {|unop: Unsupported i32 operator "%a"|} Ty.pp_unop op in to_value (f (of_value 1 v)) let binop (op : binop) (v1 : Value.t) (v2 : Value.t) : Value.t = let f = match op with | Add -> Int32.add | Sub -> Int32.sub | Mul -> Int32.mul | Div -> Int32.div | DivU -> Int32.unsigned_div | Rem -> Int32.rem | RemU -> Int32.unsigned_rem | And -> Int32.logand | Or -> Int32.logor | Xor -> Int32.logxor | Shl -> shl | ShrL -> shr_u | ShrA -> shr_s | Rotl -> rotl | Rotr -> rotr | _ -> Log.err {|binop: Unsupported i32 operator "%a"|} Ty.pp_binop op in to_value (f (of_value 1 v1) (of_value 2 v2)) let relop (op : relop) (v1 : Value.t) (v2 : Value.t) : bool = let f = match op with | Lt -> ( < ) | LtU -> lt_u | Le -> ( <= ) | LeU -> le_u | Gt -> ( > ) | GtU -> gt_u | Ge -> ( >= ) | GeU -> ge_u | Eq | Ne -> assert false in f (of_value 1 v1) (of_value 2 v2) end module I64 = struct let to_value (i : int64) : Value.t = Num (I64 i) [@@inline] let of_value (n : int) (v : Value.t) : int64 = of_arg (function Num (I64 i) -> i | _ -> raise_notrace (Value (Ty_bitv 64))) n v [@@inline] let cmp_u x op y = op Int64.(add x min_int) Int64.(add y min_int) [@@inline] let lt_u x y = cmp_u x ( < ) y [@@inline] let le_u x y = cmp_u x ( <= ) y [@@inline] let gt_u x y = cmp_u x ( > ) y [@@inline] let ge_u x y = cmp_u x ( >= ) y [@@inline] let shift f x y = f x Int64.(to_int (logand y 63L)) [@@inline] let shl x y = shift Int64.shift_left x y [@@inline] let shr_s x y = shift Int64.shift_right x y [@@inline] let shr_u x y = shift Int64.shift_right_logical x y [@@inline] (* Stolen rotl and rotr from: *) (* https://github.com/OCamlPro/owi/blob/main/src/int64.ml *) (* We must mask the count to implement rotates via shifts. *) let clamp_rotate_count n = Int64.(to_int (logand n (of_int 63))) [@@inline] let rotl x y = let n = clamp_rotate_count y in Int64.logor (shl x (Int64.of_int n)) (shr_u x (Int64.of_int (64 - n))) [@@inline] let rotr x y = let n = clamp_rotate_count y in Int64.logor (shr_u x (Int64.of_int n)) (shl x (Int64.of_int (64 - n))) [@@inline] let clz n = let n = Ocaml_intrinsics.Int64.count_leading_zeros n in Int64.of_int n let ctz n = let n = Ocaml_intrinsics.Int64.count_trailing_zeros n in Int64.of_int n let unop (op : unop) (v : Value.t) : Value.t = let f = match op with | Neg -> Int64.neg | Not -> Int64.lognot | Clz -> clz | Ctz -> ctz | _ -> Log.err {|unop: Unsupported i64 operator "%a"|} Ty.pp_unop op in to_value (f (of_value 1 v)) let binop (op : binop) (v1 : Value.t) (v2 : Value.t) : Value.t = let f = match op with | Add -> Int64.add | Sub -> Int64.sub | Mul -> Int64.mul | Div -> Int64.div | DivU -> Int64.unsigned_div | Rem -> Int64.rem | RemU -> Int64.unsigned_rem | And -> Int64.logand | Or -> Int64.logor | Xor -> Int64.logxor | Shl -> shl | ShrL -> shr_u | ShrA -> shr_s | Rotl -> rotl | Rotr -> rotr | _ -> Log.err {|binop: Unsupported i64 operator "%a"|} Ty.pp_binop op in to_value (f (of_value 1 v1) (of_value 2 v2)) let relop (op : relop) (v1 : Value.t) (v2 : Value.t) : bool = let f = match op with | Lt -> ( < ) | LtU -> lt_u | Le -> ( <= ) | LeU -> le_u | Gt -> ( > ) | GtU -> gt_u | Ge -> ( >= ) | GeU -> ge_u | Eq | Ne -> assert false in f (of_value 1 v1) (of_value 2 v2) end module F32 = struct let to_float (v : int32) : float = Int32.float_of_bits v [@@inline] let of_float (v : float) : int32 = Int32.bits_of_float v [@@inline] let to_value (f : int32) : Value.t = Num (F32 f) [@@inline] let to_value' (f : float) : Value.t = to_value @@ of_float f [@@inline] let of_value (i : int) (v : Value.t) : int32 = of_arg (function Num (F32 f) -> f | _ -> raise_notrace (Value (Ty_fp 32))) i v [@@inline] let of_value' (i : int) (v : Value.t) : float = of_value i v |> to_float [@@inline] let unop (op : unop) (v : Value.t) : Value.t = let v = to_float @@ of_value 1 v in match op with | Neg -> to_value' @@ Float.neg v | Abs -> to_value' @@ Float.abs v | Sqrt -> to_value' @@ Float.sqrt v | Nearest -> to_value' @@ Float.round v | Ceil -> to_value' @@ Float.ceil v | Floor -> to_value' @@ Float.floor v | Trunc -> to_value' @@ Float.trunc v | Is_nan -> if Float.is_nan v then Value.True else Value.False | Not | Clz | Ctz | Trim | Seq_length -> Log.err {|unop: Unsupported f32 operator "%a"|} Ty.pp_unop op let binop (op : binop) (v1 : Value.t) (v2 : Value.t) : Value.t = let f = match op with | Add -> Float.add | Sub -> Float.sub | Mul -> Float.mul | Div -> Float.div | Rem -> Float.rem | Min -> Float.min | Max -> Float.max | _ -> Log.err {|binop: Unsupported f32 operator "%a"|} Ty.pp_binop op in to_value' (f (of_value' 1 v1) (of_value' 2 v2)) let relop (op : relop) (v1 : Value.t) (v2 : Value.t) : bool = let f = match op with | Eq -> ( = ) | Ne -> ( <> ) | Lt -> ( < ) | Le -> ( <= ) | Gt -> ( > ) | Ge -> ( >= ) | _ -> Log.err {|relop: Unsupported f32 operator "%a"|} Ty.pp_relop op in f (of_value' 1 v1) (of_value' 2 v2) end module F64 = struct let to_float (v : int64) : float = Int64.float_of_bits v [@@inline] let of_float (v : float) : int64 = Int64.bits_of_float v [@@inline] let to_value (f : int64) : Value.t = Num (F64 f) [@@inline] let to_value' (f : float) : Value.t = to_value @@ of_float f [@@inline] let of_value (i : int) (v : Value.t) : int64 = of_arg (function Num (F64 f) -> f | _ -> raise_notrace (Value (Ty_fp 64))) i v [@@inline] let of_value' (i : int) (v : Value.t) : float = of_value i v |> to_float [@@inline] let unop (op : unop) (v : Value.t) : Value.t = let v = of_value' 1 v in match op with | Neg -> to_value' @@ Float.neg v | Abs -> to_value' @@ Float.abs v | Sqrt -> to_value' @@ Float.sqrt v | Nearest -> to_value' @@ Float.round v | Ceil -> to_value' @@ Float.ceil v | Floor -> to_value' @@ Float.floor v | Trunc -> to_value' @@ Float.trunc v | Is_nan -> if Float.is_nan v then Value.True else Value.False | Not | Clz | Ctz | Trim | Seq_length -> Log.err {|unop: Unsupported f32 operator "%a"|} Ty.pp_unop op let binop (op : binop) (v1 : Value.t) (v2 : Value.t) : Value.t = let f = match op with | Add -> Float.add | Sub -> Float.sub | Mul -> Float.mul | Div -> Float.div | Rem -> Float.rem | Min -> Float.min | Max -> Float.max | _ -> Log.err {|binop: Unsupported f32 operator "%a"|} Ty.pp_binop op in to_value' (f (of_value' 1 v1) (of_value' 2 v2)) let relop (op : relop) (v1 : Value.t) (v2 : Value.t) : bool = let f = match op with | Eq -> ( = ) | Ne -> ( <> ) | Lt -> ( < ) | Le -> ( <= ) | Gt -> ( > ) | Ge -> ( >= ) | _ -> Log.err {|relop: Unsupported f32 operator "%a"|} Ty.pp_relop op in f (of_value' 1 v1) (of_value' 2 v2) end module IntCvtOp = struct let of_bool : Value.t -> int = function | True -> 1 | False -> 0 | Int i -> i | _ -> assert false [@@inline] let cvtop (op : cvtop) (v : Value.t) : Value.t = match op with | OfBool -> Int.to_value (of_bool v) | _ -> Log.err {|cvtop: Unsupported int operator "%a"|} Ty.pp_cvtop op end module I32CvtOp = struct let extend_s (n : int) (x : int32) : int32 = let shift = 32 - n in Int32.(shift_right (shift_left x shift) shift) let trunc_f32_s (x : int32) = if x <> x then raise ConversionToInteger else let xf = F32.to_float x in if xf >= -.Int32.(to_float min_int) || xf < Int32.(to_float min_int) then raise IntegerOverflow else Int32.of_float xf let trunc_f32_u (x : int32) = if x <> x then raise ConversionToInteger else let xf = F32.to_float x in if xf >= -.Int32.(to_float min_int) *. 2.0 || xf <= -1.0 then raise IntegerOverflow else Int32.of_float xf let trunc_f64_s (x : int64) = if x <> x then raise ConversionToInteger else let xf = F64.to_float x in if xf >= -.Int64.(to_float min_int) || xf < Int64.(to_float min_int) then raise IntegerOverflow else Int32.of_float xf let trunc_f64_u (x : int64) = if x <> x then raise ConversionToInteger else let xf = F64.to_float x in if xf >= -.Int64.(to_float min_int) *. 2.0 || xf <= -1.0 then raise IntegerOverflow else Int32.of_float xf let cvtop (op : cvtop) (v : Value.t) : Value.t = match op with | WrapI64 -> I32.to_value (Int64.to_int32 (I64.of_value 1 v)) | TruncSF32 -> I32.to_value (trunc_f32_s (F32.of_value 1 v)) | TruncUF32 -> I32.to_value (trunc_f32_u (F32.of_value 1 v)) | TruncSF64 -> I32.to_value (trunc_f64_s (F64.of_value 1 v)) | TruncUF64 -> I32.to_value (trunc_f64_u (F64.of_value 1 v)) | Reinterpret_float -> I32.to_value (F32.of_value 1 v) | Sign_extend n -> I32.to_value (extend_s n (I32.of_value 1 v)) | Zero_extend _n -> I32.to_value (I32.of_value 1 v) | OfBool -> v (* already a num here *) | ToBool | _ -> Log.err {|cvtop: Unsupported i32 operator "%a"|} Ty.pp_cvtop op end module I64CvtOp = struct (* let extend_s n x = *) (* let shift = 64 - n in *) (* Int64.(shift_right (shift_left x shift) shift) *) let extend_i32_u (x : int32) = Int64.(logand (of_int32 x) 0x0000_0000_ffff_ffffL) let trunc_f32_s (x : int32) = if x <> x then raise ConversionToInteger else let xf = F32.to_float x in if xf >= -.Int64.(to_float min_int) || xf < Int64.(to_float min_int) then raise IntegerOverflow else Int64.of_float xf let trunc_f32_u x = if x <> x then raise ConversionToInteger else let xf = F32.to_float x in if xf >= -.Int64.(to_float min_int) *. 2.0 || xf <= -1.0 then raise IntegerOverflow else if xf >= -.Int64.(to_float min_int) then Int64.(logxor (of_float (xf -. 0x1p63)) min_int) else Int64.of_float xf let trunc_f64_s (x : int64) = if x <> x then raise ConversionToInteger else let xf = F64.to_float x in if xf >= -.Int64.(to_float min_int) || xf < Int64.(to_float min_int) then raise IntegerOverflow else Int64.of_float xf let trunc_f64_u x = if x <> x then raise ConversionToInteger else let xf = F64.to_float x in if xf >= -.Int64.(to_float min_int) *. 2.0 || xf <= -1.0 then raise IntegerOverflow else if xf >= -.Int64.(to_float min_int) then Int64.(logxor (of_float (xf -. 0x1p63)) min_int) else Int64.of_float xf let cvtop (op : cvtop) (v : Value.t) : Value.t = match op with | Sign_extend 32 -> I64.to_value (Int64.of_int32 (I32.of_value 1 v)) | Zero_extend 32 -> I64.to_value (extend_i32_u (I32.of_value 1 v)) | TruncSF32 -> I64.to_value (trunc_f32_s (F32.of_value 1 v)) | TruncUF32 -> I64.to_value (trunc_f32_u (F32.of_value 1 v)) | TruncSF64 -> I64.to_value (trunc_f64_s (F64.of_value 1 v)) | TruncUF64 -> I64.to_value (trunc_f64_u (F64.of_value 1 v)) | Reinterpret_float -> I64.to_value (F64.of_value 1 v) | WrapI64 -> raise (TypeError (1, v, Ty_bitv 64)) | ToBool | OfBool | _ -> Log.err {|cvtop: Unsupported i64 operator "%a"|} Ty.pp_cvtop op end module F32CvtOp = struct let demote_f64 x = let xf = F64.to_float x in if xf = xf then F32.of_float xf else let nan64bits = x in let sign_field = Int64.(shift_left (shift_right_logical nan64bits 63) 31) in let significand_field = Int64.(shift_right_logical (shift_left nan64bits 12) 41) in let fields = Int64.logor sign_field significand_field in Int32.logor 0x7fc0_0000l (Int64.to_int32 fields) let convert_i32_s x = F32.of_float (Int32.to_float x) let convert_i32_u x = F32.of_float Int32.( if x >= 0l then to_float x else to_float (logor (shift_right_logical x 1) (logand x 1l)) *. 2.0 ) let convert_i64_s x = F32.of_float Int64.( if abs x < 0x10_0000_0000_0000L then to_float x else let r = if logand x 0xfffL = 0L then 0L else 1L in to_float (logor (shift_right x 12) r) *. 0x1p12 ) let convert_i64_u x = F32.of_float Int64.( if I64.lt_u x 0x10_0000_0000_0000L then to_float x else let r = if logand x 0xfffL = 0L then 0L else 1L in to_float (logor (shift_right_logical x 12) r) *. 0x1p12 ) let cvtop (op : cvtop) (v : Value.t) : Value.t = match op with | DemoteF64 -> F32.to_value (demote_f64 (F64.of_value 1 v)) | ConvertSI32 -> F32.to_value (convert_i32_s (I32.of_value 1 v)) | ConvertUI32 -> F32.to_value (convert_i32_u (I32.of_value 1 v)) | ConvertSI64 -> F32.to_value (convert_i64_s (I64.of_value 1 v)) | ConvertUI64 -> F32.to_value (convert_i64_u (I64.of_value 1 v)) | Reinterpret_int -> F32.to_value (I32.of_value 1 v) | PromoteF32 -> raise (TypeError (1, v, Ty_fp 32)) | ToString | OfString | _ -> Log.err {|cvtop: Unsupported f32 operator "%a"|} Ty.pp_cvtop op end module F64CvtOp = struct let promote_f32 x = let xf = F32.to_float x in if xf = xf then F64.of_float xf else let nan32bits = I64CvtOp.extend_i32_u x in let sign_field = Int64.(shift_left (shift_right_logical nan32bits 31) 63) in let significand_field = Int64.(shift_right_logical (shift_left nan32bits 41) 12) in let fields = Int64.logor sign_field significand_field in Int64.logor 0x7ff8_0000_0000_0000L fields let convert_i32_s x = F64.of_float (Int32.to_float x) (* * Unlike the other convert_u functions, the high half of the i32 range is * within the range where f32 can represent odd numbers, so we can't do the * shift. Instead, we can use int64 signed arithmetic. *) let convert_i32_u x = F64.of_float Int64.(to_float (logand (of_int32 x) 0x0000_0000_ffff_ffffL)) let convert_i64_s x = F64.of_float (Int64.to_float x) (* * Values in the low half of the int64 range can be converted with a signed * conversion. The high half is beyond the range where f64 can represent odd * numbers, so we can shift the value right, adjust the least significant * bit to round correctly, do a conversion, and then scale it back up. *) let convert_i64_u (x : int64) = F64.of_float Int64.( if x >= 0L then to_float x else to_float (logor (shift_right_logical x 1) (logand x 1L)) *. 2.0 ) let cvtop (op : cvtop) v : Value.t = match op with | PromoteF32 -> F64.to_value (promote_f32 (F32.of_value 1 v)) | ConvertSI32 -> F64.to_value (convert_i32_s (I32.of_value 1 v)) | ConvertUI32 -> F64.to_value (convert_i32_u (I32.of_value 1 v)) | ConvertSI64 -> F64.to_value (convert_i64_s (I64.of_value 1 v)) | ConvertUI64 -> F64.to_value (convert_i64_u (I64.of_value 1 v)) | Reinterpret_int -> F64.to_value (I64.of_value 1 v) | DemoteF64 -> raise (TypeError (1, v, Ty_bitv 64)) | ToString | OfString | _ -> Log.err {|cvtop: Unsupported f64 operator "%a"|} Ty.pp_cvtop op end (* Dispatch *) let op int real bool str i32 i64 f32 f64 ty op = match ty with | Ty_int -> int op | Ty_real -> real op | Ty_bool -> bool op | Ty_str -> str op | Ty_bitv 32 -> i32 op | Ty_bitv 64 -> i64 op | Ty_fp 32 -> f32 op | Ty_fp 64 -> f64 op | Ty_bitv _ | Ty_fp _ | Ty_array | Ty_list | Ty_tuple -> assert false [@@inline] let unop = op Int.unop Real.unop Bool.unop Str.unop I32.unop I64.unop F32.unop F64.unop let binop = op Int.binop Real.binop Bool.binop Str.binop I32.binop I64.binop F32.binop F64.binop let triop = function | Ty_bool -> Bool.triop | Ty_str -> Str.triop | _ -> assert false let relop = op Int.relop Real.relop Bool.relop Str.relop I32.relop I64.relop F32.relop F64.relop let cvtop = op IntCvtOp.cvtop Real.cvtop Bool.cvtop Str.cvtop I32CvtOp.cvtop I64CvtOp.cvtop F32CvtOp.cvtop F64CvtOp.cvtop