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 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714
|
(**************************************************************************)
(* *)
(* OCaml *)
(* *)
(* Xavier Leroy, projet Cristal, INRIA Rocquencourt *)
(* *)
(* Copyright 1996 Institut National de Recherche en Informatique et *)
(* en Automatique. *)
(* *)
(* All rights reserved. This file is distributed under the terms of *)
(* the GNU Lesser General Public License version 2.1, with the *)
(* special exception on linking described in the file LICENSE. *)
(* *)
(**************************************************************************)
(* Translation from typed abstract syntax to lambda terms,
for the module language *)
open Misc
open Asttypes
open Path
open Types
open Typedtree
open Lambda
open Translobj
open Translcore
open Translclass
open Debuginfo.Scoped_location
type unsafe_component =
| Unsafe_module_binding
| Unsafe_functor
| Unsafe_non_function
| Unsafe_typext
type unsafe_info =
| Unsafe of { reason:unsafe_component; loc:Location.t; subid:Ident.t }
| Unnamed
type error =
Circular_dependency of (Ident.t * unsafe_info) list
| Conflicting_inline_attributes
exception Error of Location.t * error
let cons_opt x_opt xs =
match x_opt with
| None -> xs
| Some x -> x :: xs
(* Keep track of the root path (from the root of the namespace to the
currently compiled module expression). Useful for naming extensions. *)
let global_path glob = Some(Pident glob)
let functor_path path param =
match path with
None -> None
| Some p -> Some(Papply(p, Pident param))
let field_path path field =
match path with
None -> None
| Some p -> Some(Pdot(p, Ident.name field))
(* Compile type extensions *)
let transl_type_extension ~scopes env rootpath tyext body =
List.fold_right
(fun ext body ->
let lam =
transl_extension_constructor ~scopes env
(field_path rootpath ext.ext_id) ext
in
Llet(Strict, Pgenval, ext.ext_id, lam, body))
tyext.tyext_constructors
body
(* Compile a coercion *)
let rec apply_coercion loc strict restr arg =
match restr with
Tcoerce_none ->
arg
| Tcoerce_structure(pos_cc_list, id_pos_list) ->
name_lambda strict arg (fun id ->
let get_field pos =
if pos < 0 then lambda_unit
else Lprim(Pfield (pos, Pointer, Mutable), [Lvar id], loc)
in
let lam =
Lprim(Pmakeblock(0, Immutable, None),
List.map (apply_coercion_field loc get_field) pos_cc_list,
loc)
in
wrap_id_pos_list loc id_pos_list get_field lam)
| Tcoerce_functor(cc_arg, cc_res) ->
let param = Ident.create_local "funarg" in
let carg = apply_coercion loc Alias cc_arg (Lvar param) in
apply_coercion_result loc strict arg [param, Pgenval] [carg] cc_res
| Tcoerce_primitive { pc_loc = _; pc_desc; pc_env; pc_type; } ->
Translprim.transl_primitive loc pc_desc pc_env pc_type None
| Tcoerce_alias (env, path, cc) ->
let lam = transl_module_path loc env path in
name_lambda strict arg
(fun _ -> apply_coercion loc Alias cc lam)
and apply_coercion_field loc get_field (pos, cc) =
apply_coercion loc Alias cc (get_field pos)
and apply_coercion_result loc strict funct params args cc_res =
match cc_res with
| Tcoerce_functor(cc_arg, cc_res) ->
let param = Ident.create_local "funarg" in
let arg = apply_coercion loc Alias cc_arg (Lvar param) in
apply_coercion_result loc strict funct
((param, Pgenval) :: params) (arg :: args) cc_res
| _ ->
name_lambda strict funct
(fun id ->
lfunction
~kind:Curried
~params:(List.rev params)
~return:Pgenval
~attr:{ default_function_attribute with
is_a_functor = true;
stub = true;
may_fuse_arity = true; }
~loc
~body:(apply_coercion
loc Strict cc_res
(Lapply{
ap_loc=loc;
ap_func=Lvar id;
ap_args=List.rev args;
ap_tailcall=Default_tailcall;
ap_inlined=Default_inline;
ap_specialised=Default_specialise;
})))
and wrap_id_pos_list loc id_pos_list get_field lam =
let fv = free_variables lam in
(*Format.eprintf "%a@." Printlambda.lambda lam;
Ident.Set.iter (fun id -> Format.eprintf "%a " Ident.print id) fv;
Format.eprintf "@.";*)
let (lam, _fv, s) =
List.fold_left (fun (lam, fv, s) (id',pos,c) ->
if Ident.Set.mem id' fv then
let id'' = Ident.create_local (Ident.name id') in
let rhs = apply_coercion loc Alias c (get_field pos) in
let fv_rhs = free_variables rhs in
(Llet(Alias, Pgenval, id'', rhs, lam),
Ident.Set.union fv fv_rhs,
Ident.Map.add id' id'' s)
else (lam, fv, s))
(lam, fv, Ident.Map.empty) id_pos_list
in
if s == Ident.Map.empty then lam else Lambda.rename s lam
(* Compose two coercions
apply_coercion c1 (apply_coercion c2 e) behaves like
apply_coercion (compose_coercions c1 c2) e. *)
let rec compose_coercions c1 c2 =
match (c1, c2) with
(Tcoerce_none, c2) -> c2
| (c1, Tcoerce_none) -> c1
| (Tcoerce_structure (pc1, ids1), Tcoerce_structure (pc2, ids2)) ->
let v2 = Array.of_list pc2 in
let ids1 =
List.map (fun (id,pos1,c1) ->
if pos1 < 0 then (id, pos1, c1)
else
let (pos2,c2) = v2.(pos1) in
(id, pos2, compose_coercions c1 c2))
ids1
in
Tcoerce_structure
(List.map
(fun pc ->
match pc with
| _, (Tcoerce_primitive _ | Tcoerce_alias _) ->
(* These cases do not take an argument (the position is -1),
so they do not need adjusting. *)
pc
| (p1, c1) ->
let (p2, c2) = v2.(p1) in
(p2, compose_coercions c1 c2))
pc1,
ids1 @ ids2)
| (Tcoerce_functor(arg1, res1), Tcoerce_functor(arg2, res2)) ->
Tcoerce_functor(compose_coercions arg2 arg1,
compose_coercions res1 res2)
| (c1, Tcoerce_alias (env, path, c2)) ->
Tcoerce_alias (env, path, compose_coercions c1 c2)
| (_, _) ->
fatal_error "Translmod.compose_coercions"
(*
let apply_coercion a b c =
Format.eprintf "@[<2>apply_coercion@ %a@]@." Includemod.print_coercion b;
apply_coercion a b c
let compose_coercions c1 c2 =
let c3 = compose_coercions c1 c2 in
let open Includemod in
Format.eprintf "@[<2>compose_coercions@ (%a)@ (%a) =@ %a@]@."
print_coercion c1 print_coercion c2 print_coercion c3;
c3
*)
(* Record the primitive declarations occurring in the module compiled *)
let primitive_declarations = ref ([] : Primitive.description list)
let record_primitive = function
| {val_kind=Val_prim p;val_loc} ->
Translprim.check_primitive_arity val_loc p;
primitive_declarations := p :: !primitive_declarations
| _ -> ()
(* Utilities for compiling "module rec" definitions *)
let mod_prim = Lambda.transl_prim "CamlinternalMod"
let undefined_location loc =
let (fname, line, char) = Location.get_pos_info loc.Location.loc_start in
Lconst(Const_block(0,
[Const_base(Const_string (fname, loc, None));
const_int line;
const_int char]))
exception Initialization_failure of unsafe_info
let init_shape id modl =
let rec init_shape_mod subid loc env mty =
match Mtype.scrape env mty with
Mty_ident _
| Mty_alias _ ->
raise (Initialization_failure
(Unsafe {reason=Unsafe_module_binding;loc;subid}))
| Mty_signature sg ->
Const_block(0, [Const_block(0, init_shape_struct env sg)])
| Mty_functor _ ->
(* can we do better? *)
raise (Initialization_failure
(Unsafe {reason=Unsafe_functor;loc;subid}))
and init_shape_struct env sg =
match sg with
[] -> []
| Sig_value(subid, {val_kind=Val_reg; val_type=ty; val_loc=loc},_) :: rem ->
let init_v =
match get_desc (Ctype.expand_head env ty) with
Tarrow(_,_,_,_) ->
const_int 0 (* camlinternalMod.Function *)
| Tconstr(p, _, _) when Path.same p Predef.path_lazy_t ->
const_int 1 (* camlinternalMod.Lazy *)
| _ ->
let not_a_function =
Unsafe {reason=Unsafe_non_function; loc; subid }
in
raise (Initialization_failure not_a_function) in
init_v :: init_shape_struct env rem
| Sig_value(_, {val_kind=Val_prim _}, _) :: rem ->
init_shape_struct env rem
| Sig_value _ :: _rem ->
assert false
| Sig_type(id, tdecl, _, _) :: rem ->
init_shape_struct (Env.add_type ~check:false id tdecl env) rem
| Sig_typext (subid, {ext_loc=loc},_,_) :: _ ->
raise (Initialization_failure (Unsafe {reason=Unsafe_typext;loc;subid}))
| Sig_module(id, Mp_present, md, _, _) :: rem ->
init_shape_mod id md.md_loc env md.md_type ::
init_shape_struct (Env.add_module_declaration ~check:false
id Mp_present md env) rem
| Sig_module(id, Mp_absent, md, _, _) :: rem ->
init_shape_struct
(Env.add_module_declaration ~check:false
id Mp_absent md env) rem
| Sig_modtype(id, minfo, _) :: rem ->
init_shape_struct (Env.add_modtype id minfo env) rem
| Sig_class _ :: rem ->
const_int 2 (* camlinternalMod.Class *)
:: init_shape_struct env rem
| Sig_class_type _ :: rem ->
init_shape_struct env rem
in
try
Ok(undefined_location modl.mod_loc,
Lconst(init_shape_mod id modl.mod_loc modl.mod_env modl.mod_type))
with Initialization_failure reason -> Result.Error(reason)
(* Reorder bindings to honor dependencies. *)
type binding_status =
| Undefined
| Inprogress of int option (** parent node *)
| Defined
type id_or_ignore_loc =
| Id of Ident.t
| Ignore_loc of Lambda.scoped_location
let extract_unsafe_cycle id status init cycle_start =
let info i = match init.(i) with
| Result.Error r ->
begin match id.(i) with
| Id id -> id, r
| Ignore_loc _ ->
assert false (* Can't refer to something without a name. *)
end
| Ok _ -> assert false in
let rec collect stop l i = match status.(i) with
| Inprogress None | Undefined | Defined -> assert false
| Inprogress Some i when i = stop -> info i :: l
| Inprogress Some i -> collect stop (info i::l) i in
collect cycle_start [] cycle_start
let reorder_rec_bindings bindings =
let id = Array.of_list (List.map (fun (id,_,_,_) -> id) bindings)
and loc = Array.of_list (List.map (fun (_,loc,_,_) -> loc) bindings)
and init = Array.of_list (List.map (fun (_,_,init,_) -> init) bindings)
and rhs = Array.of_list (List.map (fun (_,_,_,rhs) -> rhs) bindings) in
let fv = Array.map Lambda.free_variables rhs in
let num_bindings = Array.length id in
let status = Array.make num_bindings Undefined in
let res = ref [] in
let is_unsafe i = match init.(i) with
| Ok _ -> false
| Result.Error _ -> true in
let init_res i = match init.(i) with
| Result.Error _ -> None
| Ok(a,b) -> Some(a,b) in
let rec emit_binding parent i =
match status.(i) with
Defined -> ()
| Inprogress _ ->
status.(i) <- Inprogress parent;
let cycle = extract_unsafe_cycle id status init i in
raise(Error(loc.(i), Circular_dependency cycle))
| Undefined ->
if is_unsafe i then begin
status.(i) <- Inprogress parent;
for j = 0 to num_bindings - 1 do
match id.(j) with
| Id id when Ident.Set.mem id fv.(i) -> emit_binding (Some i) j
| _ -> ()
done
end;
res := (id.(i), init_res i, rhs.(i)) :: !res;
status.(i) <- Defined in
for i = 0 to num_bindings - 1 do
match status.(i) with
Undefined -> emit_binding None i
| Inprogress _ -> assert false
| Defined -> ()
done;
List.rev !res
(* Generate lambda-code for a reordered list of bindings *)
let eval_rec_bindings bindings cont =
let rec bind_inits = function
[] ->
bind_strict bindings
| (Ignore_loc _, _, _) :: rem
| (_, None, _) :: rem ->
bind_inits rem
| (Id id, Some(loc, shape), _rhs) :: rem ->
Llet(Strict, Pgenval, id,
Lapply{
ap_loc=Loc_unknown;
ap_func=mod_prim "init_mod";
ap_args=[loc; shape];
ap_tailcall=Default_tailcall;
ap_inlined=Default_inline;
ap_specialised=Default_specialise;
},
bind_inits rem)
and bind_strict = function
[] ->
patch_forwards bindings
| (Ignore_loc loc, None, rhs) :: rem ->
Lsequence(Lprim(Pignore, [rhs], loc), bind_strict rem)
| (Id id, None, rhs) :: rem ->
Llet(Strict, Pgenval, id, rhs, bind_strict rem)
| (_id, Some _, _rhs) :: rem ->
bind_strict rem
and patch_forwards = function
[] ->
cont
| (Ignore_loc _, _, _rhs) :: rem
| (_, None, _rhs) :: rem ->
patch_forwards rem
| (Id id, Some(_loc, shape), rhs) :: rem ->
Lsequence(
Lapply {
ap_loc=Loc_unknown;
ap_func=mod_prim "update_mod";
ap_args=[shape; Lvar id; rhs];
ap_tailcall=Default_tailcall;
ap_inlined=Default_inline;
ap_specialised=Default_specialise;
},
patch_forwards rem)
in
bind_inits bindings
let compile_recmodule ~scopes compile_rhs bindings cont =
eval_rec_bindings
(reorder_rec_bindings
(List.map
(fun {mb_id=id; mb_name; mb_expr=modl; _} ->
let id_or_ignore_loc, shape =
match id with
| None ->
let loc = of_location ~scopes mb_name.loc in
Ignore_loc loc, Result.Error Unnamed
| Some id -> Id id, init_shape id modl
in
(id_or_ignore_loc, modl.mod_loc, shape, compile_rhs id modl))
bindings))
cont
(* Code to translate class entries in a structure *)
let transl_class_bindings ~scopes cl_list =
let ids = List.map (fun (ci, _) -> ci.ci_id_class) cl_list in
(ids,
List.map
(fun ({ci_id_class=id; ci_expr=cl; ci_virt=vf}, meths) ->
let def, rkind = transl_class ~scopes ids id meths cl vf in
(id, rkind, def))
cl_list)
(* Compile one or more functors, merging curried functors to produce
multi-argument functors. Any [@inline] attribute on a functor that is
merged must be consistent with any other [@inline] attribute(s) on the
functor(s) being merged with. Such an attribute will be placed on the
resulting merged functor. *)
let merge_inline_attributes attr1 attr2 loc =
match Lambda.merge_inline_attributes attr1 attr2 with
| Some attr -> attr
| None -> raise (Error (to_location loc, Conflicting_inline_attributes))
let merge_functors ~scopes mexp coercion root_path =
let rec merge ~scopes mexp coercion path acc inline_attribute =
let finished = acc, mexp, path, coercion, inline_attribute in
match mexp.mod_desc with
| Tmod_functor (param, body) ->
let inline_attribute' =
Translattribute.get_inline_attribute mexp.mod_attributes
in
let arg_coercion, res_coercion =
match coercion with
| Tcoerce_none -> Tcoerce_none, Tcoerce_none
| Tcoerce_functor (arg_coercion, res_coercion) ->
arg_coercion, res_coercion
| _ -> fatal_error "Translmod.merge_functors: bad coercion"
in
let loc = of_location ~scopes mexp.mod_loc in
let path, param =
match param with
| Unit -> None, Ident.create_local "*"
| Named (None, _, _) ->
let id = Ident.create_local "_" in
functor_path path id, id
| Named (Some id, _, _) -> functor_path path id, id
in
let inline_attribute =
merge_inline_attributes inline_attribute inline_attribute' loc
in
merge ~scopes body res_coercion path ((param, loc, arg_coercion) :: acc)
inline_attribute
| _ -> finished
in
merge ~scopes mexp coercion root_path [] Default_inline
let rec compile_functor ~scopes mexp coercion root_path loc =
let functor_params_rev, body, body_path, res_coercion, inline_attribute =
merge_functors ~scopes mexp coercion root_path
in
assert (List.length functor_params_rev >= 1); (* cf. [transl_module] *)
let params, body =
List.fold_left (fun (params, body) (param, loc, arg_coercion) ->
let param' = Ident.rename param in
let arg = apply_coercion loc Alias arg_coercion (Lvar param') in
let params = (param', Pgenval) :: params in
let body = Llet (Alias, Pgenval, param, arg, body) in
params, body)
([], transl_module ~scopes res_coercion body_path body)
functor_params_rev
in
lfunction
~kind:Curried
~params
~return:Pgenval
~attr:{
inline = inline_attribute;
specialise = Default_specialise;
local = Default_local;
poll = Default_poll;
is_a_functor = true;
stub = false;
tmc_candidate = false;
may_fuse_arity = true;
}
~loc
~body
(* Compile a module expression *)
and transl_module ~scopes cc rootpath mexp =
let loc = of_location ~scopes mexp.mod_loc in
match mexp.mod_desc with
| Tmod_ident (path,_) ->
apply_coercion loc Strict cc
(transl_module_path loc mexp.mod_env path)
| Tmod_structure str ->
fst (transl_struct ~scopes loc [] cc rootpath str)
| Tmod_functor _ ->
oo_wrap mexp.mod_env true (fun () ->
compile_functor ~scopes mexp cc rootpath loc) ()
| Tmod_apply(funct, arg, ccarg) ->
let translated_arg = transl_module ~scopes ccarg None arg in
transl_apply ~scopes ~loc ~cc mexp.mod_env funct translated_arg
| Tmod_apply_unit funct ->
transl_apply ~scopes ~loc ~cc mexp.mod_env funct lambda_unit
| Tmod_constraint(arg, _, _, ccarg) ->
transl_module ~scopes (compose_coercions cc ccarg) rootpath arg
| Tmod_unpack(arg, _) ->
apply_coercion loc Strict cc (Translcore.transl_exp ~scopes arg)
and transl_apply ~scopes ~loc ~cc mod_env funct translated_arg =
let inlined_attribute =
Translattribute.get_inlined_attribute_on_module funct
in
oo_wrap mod_env true
(apply_coercion loc Strict cc)
(Lapply{
ap_loc=loc;
ap_func=transl_module ~scopes Tcoerce_none None funct;
ap_args=[translated_arg];
ap_tailcall=Default_tailcall;
ap_inlined=inlined_attribute;
ap_specialised=Default_specialise})
and transl_struct ~scopes loc fields cc rootpath {str_final_env; str_items; _} =
transl_structure ~scopes loc fields cc rootpath str_final_env str_items
(* The function transl_structure is called by the bytecode compiler.
Some effort is made to compile in top to bottom order, in order to display
warning by increasing locations. *)
and transl_structure ~scopes loc fields cc rootpath final_env = function
[] ->
let body, size =
match cc with
Tcoerce_none ->
Lprim(Pmakeblock(0, Immutable, None),
List.map (fun id -> Lvar id) (List.rev fields), loc),
List.length fields
| Tcoerce_structure(pos_cc_list, id_pos_list) ->
(* Do not ignore id_pos_list ! *)
(*Format.eprintf "%a@.@[" Includemod.print_coercion cc;
List.iter (fun l -> Format.eprintf "%a@ " Ident.print l)
fields;
Format.eprintf "@]@.";*)
let v = Array.of_list (List.rev fields) in
let get_field pos =
if pos < 0 then lambda_unit
else Lvar v.(pos)
in
let ids = List.fold_right Ident.Set.add fields Ident.Set.empty in
let lam =
Lprim(Pmakeblock(0, Immutable, None),
List.map
(fun (pos, cc) ->
match cc with
Tcoerce_primitive p ->
Translprim.transl_primitive
(of_location ~scopes p.pc_loc)
p.pc_desc p.pc_env p.pc_type None
| _ -> apply_coercion loc Strict cc (get_field pos))
pos_cc_list, loc)
and id_pos_list =
List.filter (fun (id,_,_) -> not (Ident.Set.mem id ids))
id_pos_list
in
wrap_id_pos_list loc id_pos_list get_field lam,
List.length pos_cc_list
| _ ->
fatal_error "Translmod.transl_structure"
in
(* This debugging event provides information regarding the structure
items. It is ignored by the OCaml debugger but is used by
Js_of_ocaml to preserve variable names. *)
(if !Clflags.debug && not !Clflags.native_code then
Levent(body,
{lev_loc = loc;
lev_kind = Lev_pseudo;
lev_repr = None;
lev_env = final_env})
else
body),
size
| item :: rem ->
match item.str_desc with
| Tstr_eval (expr, _) ->
let body, size =
transl_structure ~scopes loc fields cc rootpath final_env rem
in
Lsequence(transl_exp ~scopes expr, body), size
| Tstr_value(rec_flag, pat_expr_list) ->
(* Translate bindings first *)
let mk_lam_let =
transl_let ~scopes ~in_structure:true rec_flag pat_expr_list in
let ext_fields =
List.rev_append (let_bound_idents pat_expr_list) fields in
(* Then, translate remainder of struct *)
let body, size =
transl_structure ~scopes loc ext_fields cc rootpath final_env rem
in
mk_lam_let body, size
| Tstr_primitive descr ->
record_primitive descr.val_val;
transl_structure ~scopes loc fields cc rootpath final_env rem
| Tstr_type _ ->
transl_structure ~scopes loc fields cc rootpath final_env rem
| Tstr_typext(tyext) ->
let ids = List.map (fun ext -> ext.ext_id) tyext.tyext_constructors in
let body, size =
transl_structure ~scopes loc (List.rev_append ids fields)
cc rootpath final_env rem
in
transl_type_extension ~scopes item.str_env rootpath tyext body, size
| Tstr_exception ext ->
let id = ext.tyexn_constructor.ext_id in
let path = field_path rootpath id in
let body, size =
transl_structure ~scopes loc (id::fields) cc rootpath final_env rem
in
Llet(Strict, Pgenval, id,
transl_extension_constructor ~scopes
item.str_env
path
ext.tyexn_constructor, body),
size
| Tstr_module ({mb_presence=Mp_present} as mb) ->
let id = mb.mb_id in
(* Translate module first *)
let subscopes = match id with
| None -> scopes
| Some id -> enter_module_definition ~scopes id in
let module_body =
transl_module ~scopes:subscopes Tcoerce_none
(Option.bind id (field_path rootpath)) mb.mb_expr
in
let module_body =
Translattribute.add_inline_attribute module_body mb.mb_loc
mb.mb_attributes
in
(* Translate remainder second *)
let body, size =
transl_structure ~scopes loc (cons_opt id fields)
cc rootpath final_env rem
in
begin match id with
| None ->
Lsequence (Lprim(Pignore, [module_body],
of_location ~scopes mb.mb_name.loc), body),
size
| Some id ->
Llet(pure_module mb.mb_expr, Pgenval, id, module_body, body), size
end
| Tstr_module ({mb_presence=Mp_absent}) ->
transl_structure ~scopes loc fields cc rootpath final_env rem
| Tstr_recmodule bindings ->
let ext_fields =
List.rev_append (List.filter_map (fun mb -> mb.mb_id) bindings)
fields
in
let body, size =
transl_structure ~scopes loc ext_fields cc rootpath final_env rem
in
let lam =
compile_recmodule ~scopes (fun id modl ->
match id with
| None -> transl_module ~scopes Tcoerce_none None modl
| Some id ->
transl_module
~scopes:(enter_module_definition ~scopes id)
Tcoerce_none (field_path rootpath id) modl
) bindings body
in
lam, size
| Tstr_class cl_list ->
let (ids, class_bindings) = transl_class_bindings ~scopes cl_list in
let body, size =
transl_structure ~scopes loc (List.rev_append ids fields)
cc rootpath final_env rem
in
Value_rec_compiler.compile_letrec class_bindings body, size
| Tstr_include incl ->
let ids = bound_value_identifiers incl.incl_type in
let modl = incl.incl_mod in
let mid = Ident.create_local "include" in
let rec rebind_idents pos newfields = function
[] ->
transl_structure ~scopes loc newfields cc rootpath final_env rem
| id :: ids ->
let body, size =
rebind_idents (pos + 1) (id :: newfields) ids
in
Llet(Alias, Pgenval, id,
Lprim(Pfield (pos, Pointer, Mutable),
[Lvar mid], of_location ~scopes incl.incl_loc), body),
size
in
let body, size = rebind_idents 0 fields ids in
Llet(pure_module modl, Pgenval, mid,
transl_module ~scopes Tcoerce_none None modl, body),
size
| Tstr_open od ->
let pure = pure_module od.open_expr in
(* this optimization shouldn't be needed because Simplif would
actually remove the [Llet] when it's not used.
But since [scan_used_globals] runs before Simplif, we need to do
it. *)
begin match od.open_bound_items with
| [] when pure = Alias ->
transl_structure ~scopes loc fields cc rootpath final_env rem
| _ ->
let ids = bound_value_identifiers od.open_bound_items in
let mid = Ident.create_local "open" in
let rec rebind_idents pos newfields = function
[] -> transl_structure
~scopes loc newfields cc rootpath final_env rem
| id :: ids ->
let body, size =
rebind_idents (pos + 1) (id :: newfields) ids
in
Llet(Alias, Pgenval, id,
Lprim(Pfield (pos, Pointer, Mutable), [Lvar mid],
of_location ~scopes od.open_loc), body),
size
in
let body, size = rebind_idents 0 fields ids in
Llet(pure, Pgenval, mid,
transl_module ~scopes Tcoerce_none None od.open_expr, body),
size
end
| Tstr_modtype _
| Tstr_class_type _
| Tstr_attribute _ ->
transl_structure ~scopes loc fields cc rootpath final_env rem
(* Update forward declaration in Translcore *)
let _ =
Translcore.transl_module := transl_module
(* Introduce dependencies on modules referenced only by "external". *)
let scan_used_globals lam =
let is_compunit id = not (Ident.is_predef id) in
let globals = ref Ident.Set.empty in
let rec scan lam =
Lambda.iter_head_constructor scan lam;
match lam with
Lprim ((Pgetglobal id | Psetglobal id), _, _) when (is_compunit id) ->
globals := Ident.Set.add id !globals
| _ -> ()
in
scan lam; !globals
let required_globals ~flambda body =
let globals = scan_used_globals body in
let add_global id req =
if not flambda && Ident.Set.mem id globals then
req
else
Ident.Set.add id req
in
let required =
List.fold_left
(fun acc path -> add_global (Path.head path) acc)
(if flambda then globals else Ident.Set.empty)
(Translprim.get_used_primitives ())
in
let required =
List.fold_right add_global (Env.get_required_globals ()) required
in
Env.reset_required_globals ();
Translprim.clear_used_primitives ();
required
(* Compile an implementation *)
let transl_implementation_flambda module_name (str, cc) =
reset_labels ();
primitive_declarations := [];
Translprim.clear_used_primitives ();
let module_id = Ident.create_persistent module_name in
let scopes = enter_module_definition ~scopes:empty_scopes module_id in
let body, size =
Translobj.transl_label_init
(fun () -> transl_struct ~scopes Loc_unknown [] cc
(global_path module_id) str)
in
{ module_ident = module_id;
main_module_block_size = size;
required_globals = required_globals ~flambda:true body;
code = body }
let transl_implementation module_name (str, cc) =
let implementation =
transl_implementation_flambda module_name (str, cc)
in
let code =
Lprim (Psetglobal implementation.module_ident, [implementation.code],
Loc_unknown)
in
{ implementation with code }
(* Build the list of value identifiers defined by a toplevel structure
(excluding primitive declarations). *)
let rec defined_idents = function
[] -> []
| item :: rem ->
match item.str_desc with
| Tstr_eval _ -> defined_idents rem
| Tstr_value(_rec_flag, pat_expr_list) ->
let_bound_idents pat_expr_list @ defined_idents rem
| Tstr_primitive _ -> defined_idents rem
| Tstr_type _ -> defined_idents rem
| Tstr_typext tyext ->
List.map (fun ext -> ext.ext_id) tyext.tyext_constructors
@ defined_idents rem
| Tstr_exception ext -> ext.tyexn_constructor.ext_id :: defined_idents rem
| Tstr_module {mb_id = Some id; mb_presence=Mp_present} ->
id :: defined_idents rem
| Tstr_module ({mb_id = None}
|{mb_presence=Mp_absent}) -> defined_idents rem
| Tstr_recmodule decls ->
List.filter_map (fun mb -> mb.mb_id) decls @ defined_idents rem
| Tstr_modtype _ -> defined_idents rem
| Tstr_open od ->
bound_value_identifiers od.open_bound_items @ defined_idents rem
| Tstr_class cl_list ->
List.map (fun (ci, _) -> ci.ci_id_class) cl_list @ defined_idents rem
| Tstr_class_type _ -> defined_idents rem
| Tstr_include incl ->
bound_value_identifiers incl.incl_type @ defined_idents rem
| Tstr_attribute _ -> defined_idents rem
(* second level idents (module M = struct ... let id = ... end),
and all sub-levels idents *)
let rec more_idents = function
[] -> []
| item :: rem ->
match item.str_desc with
| Tstr_eval _ -> more_idents rem
| Tstr_value _ -> more_idents rem
| Tstr_primitive _ -> more_idents rem
| Tstr_type _ -> more_idents rem
| Tstr_typext _ -> more_idents rem
| Tstr_exception _ -> more_idents rem
| Tstr_recmodule _ -> more_idents rem
| Tstr_modtype _ -> more_idents rem
| Tstr_open od ->
let rest = more_idents rem in
begin match od.open_expr.mod_desc with
| Tmod_structure str -> all_idents str.str_items @ rest
| _ -> rest
end
| Tstr_class _ -> more_idents rem
| Tstr_class_type _ -> more_idents rem
| Tstr_include{incl_mod={mod_desc =
Tmod_constraint ({mod_desc = Tmod_structure str},
_, _, _)
| Tmod_structure str }} ->
all_idents str.str_items @ more_idents rem
| Tstr_include _ -> more_idents rem
| Tstr_module
{mb_presence=Mp_present; mb_expr={mod_desc = Tmod_structure str}}
| Tstr_module
{mb_presence=Mp_present;
mb_expr={mod_desc=
Tmod_constraint ({mod_desc = Tmod_structure str}, _, _, _)}} ->
all_idents str.str_items @ more_idents rem
| Tstr_module _ -> more_idents rem
| Tstr_attribute _ -> more_idents rem
and all_idents = function
[] -> []
| item :: rem ->
match item.str_desc with
| Tstr_eval _ -> all_idents rem
| Tstr_value(_rec_flag, pat_expr_list) ->
let_bound_idents pat_expr_list @ all_idents rem
| Tstr_primitive _ -> all_idents rem
| Tstr_type _ -> all_idents rem
| Tstr_typext tyext ->
List.map (fun ext -> ext.ext_id) tyext.tyext_constructors
@ all_idents rem
| Tstr_exception ext -> ext.tyexn_constructor.ext_id :: all_idents rem
| Tstr_recmodule decls ->
List.filter_map (fun mb -> mb.mb_id) decls @ all_idents rem
| Tstr_modtype _ -> all_idents rem
| Tstr_open od ->
let rest = all_idents rem in
begin match od.open_expr.mod_desc with
| Tmod_structure str ->
bound_value_identifiers od.open_bound_items
@ all_idents str.str_items
@ rest
| _ -> bound_value_identifiers od.open_bound_items @ rest
end
| Tstr_class cl_list ->
List.map (fun (ci, _) -> ci.ci_id_class) cl_list @ all_idents rem
| Tstr_class_type _ -> all_idents rem
| Tstr_include{incl_type;
incl_mod={mod_desc =
( Tmod_constraint({mod_desc=Tmod_structure str}, _, _, _)
| Tmod_structure str )}} ->
bound_value_identifiers incl_type
@ all_idents str.str_items
@ all_idents rem
| Tstr_include incl ->
bound_value_identifiers incl.incl_type @ all_idents rem
| Tstr_module
{ mb_id = Some id;
mb_presence=Mp_present;
mb_expr={mod_desc = Tmod_structure str} }
| Tstr_module
{ mb_id = Some id;
mb_presence = Mp_present;
mb_expr =
{mod_desc =
Tmod_constraint ({mod_desc = Tmod_structure str}, _, _, _)}} ->
id :: all_idents str.str_items @ all_idents rem
| Tstr_module {mb_id = Some id;mb_presence=Mp_present} ->
id :: all_idents rem
| Tstr_module ({mb_id = None} | {mb_presence=Mp_absent}) -> all_idents rem
| Tstr_attribute _ -> all_idents rem
(* A variant of transl_structure used to compile toplevel structure definitions
for the native-code compiler. Store the defined values in the fields
of the global as soon as they are defined, in order to reduce register
pressure. Also rewrites the defining expressions so that they
refer to earlier fields of the structure through the fields of
the global, not by their names.
"map" is a table from defined idents to (pos in global block, coercion).
"prim" is a list of (pos in global block, primitive declaration). *)
let transl_store_subst = ref Ident.Map.empty
(** In the native toplevel, this reference is threaded through successive
calls of transl_store_structure *)
let nat_toplevel_name id =
try match Ident.Map.find id !transl_store_subst with
| Lprim(Pfield (pos, _, _),
[Lprim(Pgetglobal glob, [], _)], _) -> (glob,pos)
| _ -> raise Not_found
with Not_found ->
fatal_error("Translmod.nat_toplevel_name: " ^ Ident.unique_name id)
let field_of_str loc str =
let ids = Array.of_list (defined_idents str.str_items) in
fun (pos, cc) ->
match cc with
| Tcoerce_primitive { pc_loc = _; pc_desc; pc_env; pc_type; } ->
Translprim.transl_primitive loc pc_desc pc_env pc_type None
| Tcoerce_alias (env, path, cc) ->
let lam = transl_module_path loc env path in
apply_coercion loc Alias cc lam
| _ -> apply_coercion loc Strict cc (Lvar ids.(pos))
let transl_store_structure ~scopes glob map prims aliases str =
let no_env_update _ _ env = env in
let rec transl_store ~scopes rootpath subst cont = function
[] ->
transl_store_subst := subst;
Lambda.subst no_env_update subst cont
| item :: rem ->
match item.str_desc with
| Tstr_eval (expr, _attrs) ->
Lsequence(Lambda.subst no_env_update subst
(transl_exp ~scopes expr),
transl_store ~scopes rootpath subst cont rem)
| Tstr_value(rec_flag, pat_expr_list) ->
let ids = let_bound_idents pat_expr_list in
let lam =
transl_let ~scopes ~in_structure:true rec_flag pat_expr_list
(store_idents Loc_unknown ids)
in
Lsequence(Lambda.subst no_env_update subst lam,
transl_store ~scopes rootpath
(add_idents false ids subst) cont rem)
| Tstr_primitive descr ->
record_primitive descr.val_val;
transl_store ~scopes rootpath subst cont rem
| Tstr_type _ ->
transl_store ~scopes rootpath subst cont rem
| Tstr_typext(tyext) ->
let ids =
List.map (fun ext -> ext.ext_id) tyext.tyext_constructors
in
let lam =
transl_type_extension ~scopes item.str_env rootpath tyext
(store_idents Loc_unknown ids)
in
Lsequence(Lambda.subst no_env_update subst lam,
transl_store ~scopes rootpath
(add_idents false ids subst) cont rem)
| Tstr_exception ext ->
let id = ext.tyexn_constructor.ext_id in
let path = field_path rootpath id in
let loc = of_location ~scopes ext.tyexn_constructor.ext_loc in
let lam =
transl_extension_constructor ~scopes
item.str_env
path
ext.tyexn_constructor
in
Lsequence(Llet(Strict, Pgenval, id,
Lambda.subst no_env_update subst lam,
store_ident loc id),
transl_store ~scopes rootpath
(add_ident false id subst) cont rem)
| Tstr_module
{mb_id=None; mb_name; mb_presence=Mp_present; mb_expr=modl;
mb_loc=loc; mb_attributes} ->
let lam =
Translattribute.add_inline_attribute
(transl_module ~scopes Tcoerce_none None modl)
loc mb_attributes
in
Lsequence(
Lprim(Pignore,[Lambda.subst no_env_update subst lam],
of_location ~scopes mb_name.loc),
transl_store ~scopes rootpath subst cont rem
)
| Tstr_module{mb_id=Some id;mb_loc=loc;mb_presence=Mp_present;
mb_expr={mod_desc = Tmod_structure str}} ->
let loc = of_location ~scopes loc in
let lam =
transl_store
~scopes:(enter_module_definition ~scopes id)
(field_path rootpath id) subst
lambda_unit str.str_items
in
(* Careful: see next case *)
let subst = !transl_store_subst in
Lsequence(lam,
Llet(Strict, Pgenval, id,
Lambda.subst no_env_update subst
(Lprim(Pmakeblock(0, Immutable, None),
List.map (fun id -> Lvar id)
(defined_idents str.str_items), loc)),
Lsequence(store_ident loc id,
transl_store ~scopes rootpath
(add_ident true id subst)
cont rem)))
| Tstr_module{
mb_id=Some id;mb_loc=loc;mb_presence=Mp_present;
mb_expr= {
mod_desc = Tmod_constraint (
{mod_desc = Tmod_structure str}, _, _,
(Tcoerce_structure (map, _) as _cc))}
} ->
(* Format.printf "coerc id %s: %a@." (Ident.unique_name id)
Includemod.print_coercion cc; *)
let loc = of_location ~scopes loc in
let lam =
transl_store
~scopes:(enter_module_definition ~scopes id)
(field_path rootpath id) subst
lambda_unit str.str_items
in
(* Careful: see next case *)
let subst = !transl_store_subst in
let field = field_of_str loc str in
Lsequence(lam,
Llet(Strict, Pgenval, id,
Lambda.subst no_env_update subst
(Lprim(Pmakeblock(0, Immutable, None),
List.map field map, loc)),
Lsequence(store_ident loc id,
transl_store ~scopes rootpath
(add_ident true id subst)
cont rem)))
| Tstr_module
{mb_id=Some id; mb_presence=Mp_present; mb_expr=modl;
mb_loc=loc; mb_attributes} ->
let lam =
Translattribute.add_inline_attribute
(transl_module
~scopes:(enter_module_definition ~scopes id)
Tcoerce_none (field_path rootpath id) modl)
loc mb_attributes
in
(* Careful: the module value stored in the global may be different
from the local module value, in case a coercion is applied.
If so, keep using the local module value (id) in the remainder of
the compilation unit (add_ident true returns subst unchanged).
If not, we can use the value from the global
(add_ident true adds id -> Pgetglobal... to subst). *)
Llet(Strict, Pgenval, id, Lambda.subst no_env_update subst lam,
Lsequence(store_ident (of_location ~scopes loc) id,
transl_store ~scopes rootpath
(add_ident true id subst)
cont rem))
| Tstr_module ({mb_presence=Mp_absent}) ->
transl_store ~scopes rootpath subst cont rem
| Tstr_recmodule bindings ->
let ids = List.filter_map (fun mb -> mb.mb_id) bindings in
compile_recmodule ~scopes
(fun id modl ->
Lambda.subst no_env_update subst
(match id with
| None ->
transl_module ~scopes Tcoerce_none None modl
| Some id ->
transl_module
~scopes:(enter_module_definition ~scopes id)
Tcoerce_none (field_path rootpath id) modl))
bindings
(Lsequence(store_idents Loc_unknown ids,
transl_store ~scopes rootpath
(add_idents true ids subst) cont rem))
| Tstr_class cl_list ->
let (ids, class_bindings) = transl_class_bindings ~scopes cl_list in
let lam =
Value_rec_compiler.compile_letrec class_bindings
(store_idents Loc_unknown ids)
in
Lsequence(Lambda.subst no_env_update subst lam,
transl_store ~scopes rootpath (add_idents false ids subst)
cont rem)
| Tstr_include({
incl_loc=loc;
incl_mod= {
mod_desc = Tmod_constraint (
({mod_desc = Tmod_structure str}), _, _,
(Tcoerce_structure _ | Tcoerce_none))}
| ({ mod_desc = Tmod_structure str});
incl_type;
} as incl) ->
let lam =
transl_store ~scopes None subst lambda_unit str.str_items
(* It is tempting to pass rootpath instead of None
in order to give a more precise name to exceptions
in the included structured, but this would introduce
a difference of behavior compared to bytecode. *)
in
let subst = !transl_store_subst in
let field = field_of_str (of_location ~scopes loc) str in
let ids0 = bound_value_identifiers incl_type in
let rec loop ids args =
match ids, args with
| [], [] ->
transl_store ~scopes rootpath (add_idents true ids0 subst)
cont rem
| id :: ids, arg :: args ->
Llet(Alias, Pgenval, id,
Lambda.subst no_env_update subst (field arg),
Lsequence(store_ident (of_location ~scopes loc) id,
loop ids args))
| _ -> assert false
in
let map =
match incl.incl_mod.mod_desc with
| Tmod_constraint (_, _, _, Tcoerce_structure (map, _)) ->
map
| Tmod_structure _
| Tmod_constraint (_, _, _, Tcoerce_none) ->
List.init (List.length ids0) (fun i -> i, Tcoerce_none)
| _ -> assert false
in
Lsequence(lam, loop ids0 map)
| Tstr_include incl ->
let ids = bound_value_identifiers incl.incl_type in
let modl = incl.incl_mod in
let mid = Ident.create_local "include" in
let loc = incl.incl_loc in
let rec store_idents pos = function
| [] -> transl_store
~scopes rootpath (add_idents true ids subst) cont rem
| id :: idl ->
Llet(Alias, Pgenval, id,
Lprim(Pfield (pos, Pointer, Mutable), [Lvar mid],
of_location ~scopes loc),
Lsequence(store_ident (of_location ~scopes loc) id,
store_idents (pos + 1) idl))
in
Llet(Strict, Pgenval, mid,
Lambda.subst no_env_update subst
(transl_module ~scopes Tcoerce_none None modl),
store_idents 0 ids)
| Tstr_open od ->
begin match od.open_expr.mod_desc with
| Tmod_structure str ->
let lam =
transl_store ~scopes rootpath subst lambda_unit str.str_items
in
let loc = of_location ~scopes od.open_loc in
let ids = Array.of_list (defined_idents str.str_items) in
let ids0 = bound_value_identifiers od.open_bound_items in
let subst = !transl_store_subst in
let rec store_idents pos = function
| [] -> transl_store ~scopes rootpath
(add_idents true ids0 subst) cont rem
| id :: idl ->
Llet(Alias, Pgenval, id, Lvar ids.(pos),
Lsequence(store_ident loc id,
store_idents (pos + 1) idl))
in
Lsequence(lam, Lambda.subst no_env_update subst
(store_idents 0 ids0))
| _ ->
let pure = pure_module od.open_expr in
(* this optimization shouldn't be needed because Simplif would
actually remove the [Llet] when it's not used.
But since [scan_used_globals] runs before Simplif, we need to
do it. *)
match od.open_bound_items with
| [] when pure = Alias ->
transl_store ~scopes rootpath subst cont rem
| _ ->
let ids = bound_value_identifiers od.open_bound_items in
let mid = Ident.create_local "open" in
let loc = of_location ~scopes od.open_loc in
let rec store_idents pos = function
[] -> transl_store ~scopes rootpath
(add_idents true ids subst) cont rem
| id :: idl ->
Llet(Alias, Pgenval, id,
Lprim(Pfield (pos, Pointer, Mutable),
[Lvar mid], loc),
Lsequence(store_ident loc id,
store_idents (pos + 1) idl))
in
Llet(
pure, Pgenval, mid,
Lambda.subst no_env_update subst
(transl_module ~scopes Tcoerce_none None od.open_expr),
store_idents 0 ids)
end
| Tstr_modtype _
| Tstr_class_type _
| Tstr_attribute _ ->
transl_store ~scopes rootpath subst cont rem
and store_ident loc id =
try
let (pos, cc) = Ident.find_same id map in
let init_val = apply_coercion loc Alias cc (Lvar id) in
Lprim(Psetfield(pos, Pointer, Root_initialization),
[Lprim(Pgetglobal glob, [], loc); init_val],
loc)
with Not_found ->
fatal_error("Translmod.store_ident: " ^ Ident.unique_name id)
and store_idents loc idlist =
make_sequence (store_ident loc) idlist
and add_ident may_coerce id subst =
try
let (pos, cc) = Ident.find_same id map in
match cc with
Tcoerce_none ->
Ident.Map.add id
(Lprim(Pfield (pos, Pointer, Immutable),
[Lprim(Pgetglobal glob, [], Loc_unknown)],
Loc_unknown))
subst
| _ ->
if may_coerce then subst else assert false
with Not_found ->
assert false
and add_idents may_coerce idlist subst =
List.fold_right (add_ident may_coerce) idlist subst
and store_primitive (pos, prim) cont =
Lsequence(Lprim(Psetfield(pos, Pointer, Root_initialization),
[Lprim(Pgetglobal glob, [], Loc_unknown);
Translprim.transl_primitive Loc_unknown
prim.pc_desc prim.pc_env prim.pc_type None],
Loc_unknown),
cont)
and store_alias (pos, env, path, cc) =
let path_lam = transl_module_path Loc_unknown env path in
let init_val = apply_coercion Loc_unknown Strict cc path_lam in
Lprim(Psetfield(pos, Pointer, Root_initialization),
[Lprim(Pgetglobal glob, [], Loc_unknown);
init_val],
Loc_unknown)
in
let aliases = make_sequence store_alias aliases in
List.fold_right store_primitive prims
(transl_store ~scopes (global_path glob) !transl_store_subst aliases str)
(* Transform a coercion and the list of value identifiers defined by
a toplevel structure into a table [id -> (pos, coercion)],
with [pos] being the position in the global block where the value of
[id] must be stored, and [coercion] the coercion to be applied to it.
A given identifier may appear several times
in the coercion (if it occurs several times in the signature); remember
to assign it the position of its last occurrence.
Identifiers that are not exported are assigned positions at the
end of the block (beyond the positions of all exported idents).
Also compute the total size of the global block,
and the list of all primitives exported as values. *)
let build_ident_map restr idlist more_ids =
let rec natural_map pos map prims aliases = function
| [] ->
(map, prims, aliases, pos)
| id :: rem ->
natural_map (pos+1)
(Ident.add id (pos, Tcoerce_none) map) prims aliases rem
in
let (map, prims, aliases, pos) =
match restr with
| Tcoerce_none ->
natural_map 0 Ident.empty [] [] idlist
| Tcoerce_structure (pos_cc_list, _id_pos_list) ->
(* ignore _id_pos_list as the ids are already bound *)
let idarray = Array.of_list idlist in
let rec export_map pos map prims aliases undef = function
| [] ->
natural_map pos map prims aliases undef
| (_source_pos, Tcoerce_primitive p) :: rem ->
export_map (pos + 1) map
((pos, p) :: prims) aliases undef rem
| (_source_pos, Tcoerce_alias(env, path, cc)) :: rem ->
export_map (pos + 1) map prims
((pos, env, path, cc) :: aliases) undef rem
| (source_pos, cc) :: rem ->
let id = idarray.(source_pos) in
export_map (pos + 1) (Ident.add id (pos, cc) map)
prims aliases (list_remove id undef) rem
in
export_map 0 Ident.empty [] [] idlist pos_cc_list
| _ ->
fatal_error "Translmod.build_ident_map"
in
natural_map pos map prims aliases more_ids
(* Compile an implementation using transl_store_structure
(for the native-code compiler). *)
let transl_store_gen ~scopes module_name ({ str_items = str }, restr) topl =
reset_labels ();
primitive_declarations := [];
Translprim.clear_used_primitives ();
let module_id = Ident.create_persistent module_name in
let (map, prims, aliases, size) =
build_ident_map restr (defined_idents str) (more_idents str) in
let f = function
| [ { str_desc = Tstr_eval (expr, _attrs) } ] when topl ->
assert (size = 0);
Lambda.subst (fun _ _ env -> env) !transl_store_subst
(transl_exp ~scopes expr)
| str -> transl_store_structure ~scopes module_id map prims aliases str
in
transl_store_label_init module_id size f str
(*size, transl_label_init (transl_store_structure module_id map prims str)*)
let transl_store_phrases module_name str =
let scopes =
enter_module_definition ~scopes:empty_scopes
(Ident.create_persistent module_name)
in
transl_store_gen ~scopes module_name (str,Tcoerce_none) true
let transl_store_implementation module_name (str, restr) =
let s = !transl_store_subst in
transl_store_subst := Ident.Map.empty;
let module_ident = Ident.create_persistent module_name in
let scopes = enter_module_definition ~scopes:empty_scopes module_ident in
let (i, code) = transl_store_gen ~scopes module_name (str, restr) false in
transl_store_subst := s;
{ Lambda.main_module_block_size = i;
code;
(* module_ident is not used by closure, but this allow to share
the type with the flambda version *)
module_ident;
required_globals = required_globals ~flambda:true code }
(* Compile a toplevel phrase *)
let toploop_ident = Ident.create_persistent "Toploop"
let toploop_getvalue_pos = 0 (* position of getvalue in module Toploop *)
let toploop_setvalue_pos = 1 (* position of setvalue in module Toploop *)
let aliased_idents = ref Ident.empty
let set_toplevel_unique_name id =
aliased_idents :=
Ident.add id (Ident.unique_toplevel_name id) !aliased_idents
let toplevel_name id =
try Ident.find_same id !aliased_idents
with Not_found -> Ident.name id
let toploop_getvalue id =
Lapply{
ap_loc=Loc_unknown;
ap_func=Lprim(Pfield (toploop_getvalue_pos, Pointer, Mutable),
[Lprim(Pgetglobal toploop_ident, [], Loc_unknown)],
Loc_unknown);
ap_args=[Lconst(Const_base(
Const_string (toplevel_name id, Location.none, None)))];
ap_tailcall=Default_tailcall;
ap_inlined=Default_inline;
ap_specialised=Default_specialise;
}
let toploop_setvalue id lam =
Lapply{
ap_loc=Loc_unknown;
ap_func=Lprim(Pfield (toploop_setvalue_pos, Pointer, Mutable),
[Lprim(Pgetglobal toploop_ident, [], Loc_unknown)],
Loc_unknown);
ap_args=
[Lconst(Const_base(
Const_string(toplevel_name id, Location.none, None)));
lam];
ap_tailcall=Default_tailcall;
ap_inlined=Default_inline;
ap_specialised=Default_specialise;
}
let toploop_setvalue_id id = toploop_setvalue id (Lvar id)
let close_toplevel_term (lam, ()) =
Ident.Set.fold (fun id l -> Llet(Strict, Pgenval, id,
toploop_getvalue id, l))
(free_variables lam) lam
let transl_toplevel_item ~scopes item =
match item.str_desc with
Tstr_eval (expr, _)
| Tstr_value(Nonrecursive,
[{vb_pat = {pat_desc=Tpat_any};vb_expr = expr}]) ->
(* special compilation for toplevel "let _ = expr", so
that Toploop can display the result of the expression.
Otherwise, the normal compilation would result
in a Lsequence returning unit. *)
transl_exp ~scopes expr
| Tstr_value(rec_flag, pat_expr_list) ->
let idents = let_bound_idents pat_expr_list in
transl_let ~scopes ~in_structure:true rec_flag pat_expr_list
(make_sequence toploop_setvalue_id idents)
| Tstr_typext(tyext) ->
let idents =
List.map (fun ext -> ext.ext_id) tyext.tyext_constructors
in
(* we need to use unique name in case of multiple
definitions of the same extension constructor in the toplevel *)
List.iter set_toplevel_unique_name idents;
transl_type_extension ~scopes item.str_env None tyext
(make_sequence toploop_setvalue_id idents)
| Tstr_exception ext ->
set_toplevel_unique_name ext.tyexn_constructor.ext_id;
toploop_setvalue ext.tyexn_constructor.ext_id
(transl_extension_constructor ~scopes
item.str_env None ext.tyexn_constructor)
| Tstr_module {mb_id=None; mb_presence=Mp_present; mb_expr=modl} ->
transl_module ~scopes Tcoerce_none None modl
| Tstr_module {mb_id=Some id; mb_presence=Mp_present; mb_expr=modl} ->
(* we need to use the unique name for the module because of issues
with "open" (PR#8133) *)
set_toplevel_unique_name id;
let lam = transl_module
~scopes:(enter_module_definition ~scopes id)
Tcoerce_none (Some(Pident id)) modl in
toploop_setvalue id lam
| Tstr_recmodule bindings ->
let idents = List.filter_map (fun mb -> mb.mb_id) bindings in
compile_recmodule ~scopes
(fun id modl ->
match id with
| None ->
transl_module ~scopes Tcoerce_none None modl
| Some id ->
transl_module
~scopes:(enter_module_definition ~scopes id)
Tcoerce_none (Some (Pident id)) modl)
bindings
(make_sequence toploop_setvalue_id idents)
| Tstr_class cl_list ->
(* we need to use unique names for the classes because there might
be a value named identically *)
let (ids, class_bindings) = transl_class_bindings ~scopes cl_list in
List.iter set_toplevel_unique_name ids;
Value_rec_compiler.compile_letrec class_bindings
(make_sequence toploop_setvalue_id ids)
| Tstr_include incl ->
let ids = bound_value_identifiers incl.incl_type in
let modl = incl.incl_mod in
let mid = Ident.create_local "include" in
let rec set_idents pos = function
[] ->
lambda_unit
| id :: ids ->
Lsequence(toploop_setvalue id
(Lprim(Pfield (pos, Pointer, Mutable),
[Lvar mid], Loc_unknown)),
set_idents (pos + 1) ids) in
Llet(Strict, Pgenval, mid,
transl_module ~scopes Tcoerce_none None modl, set_idents 0 ids)
| Tstr_primitive descr ->
record_primitive descr.val_val;
lambda_unit
| Tstr_open od ->
let pure = pure_module od.open_expr in
(* this optimization shouldn't be needed because Simplif would
actually remove the [Llet] when it's not used.
But since [scan_used_globals] runs before Simplif, we need to do
it. *)
begin match od.open_bound_items with
| [] when pure = Alias -> lambda_unit
| _ ->
let ids = bound_value_identifiers od.open_bound_items in
let mid = Ident.create_local "open" in
let rec set_idents pos = function
[] ->
lambda_unit
| id :: ids ->
Lsequence(toploop_setvalue id
(Lprim(Pfield (pos, Pointer, Mutable),
[Lvar mid], Loc_unknown)),
set_idents (pos + 1) ids)
in
Llet(pure, Pgenval, mid,
transl_module ~scopes Tcoerce_none None od.open_expr,
set_idents 0 ids)
end
| Tstr_module ({mb_presence=Mp_absent}) ->
lambda_unit
| Tstr_modtype _
| Tstr_type _
| Tstr_class_type _
| Tstr_attribute _ ->
lambda_unit
let transl_toplevel_item_and_close ~scopes itm =
close_toplevel_term
(transl_label_init (fun () -> transl_toplevel_item ~scopes itm, ()))
let transl_toplevel_definition str =
reset_labels ();
Translprim.clear_used_primitives ();
make_sequence
(transl_toplevel_item_and_close ~scopes:empty_scopes)
str.str_items
(* Compile the initialization code for a packed library *)
let get_component = function
None -> Lconst const_unit
| Some id -> Lprim(Pgetglobal id, [], Loc_unknown)
let transl_package_flambda component_names coercion =
let size =
match coercion with
| Tcoerce_none -> List.length component_names
| Tcoerce_structure (l, _) -> List.length l
| Tcoerce_functor _
| Tcoerce_primitive _
| Tcoerce_alias _ -> assert false
in
size,
apply_coercion Loc_unknown Strict coercion
(Lprim(Pmakeblock(0, Immutable, None),
List.map get_component component_names,
Loc_unknown))
let transl_package component_names target_name coercion =
let components =
Lprim(Pmakeblock(0, Immutable, None),
List.map get_component component_names, Loc_unknown) in
Lprim(Psetglobal target_name,
[apply_coercion Loc_unknown Strict coercion components],
Loc_unknown)
(*
let components =
match coercion with
Tcoerce_none ->
List.map get_component component_names
| Tcoerce_structure (pos_cc_list, id_pos_list) ->
(* ignore id_pos_list as the ids are already bound *)
let g = Array.of_list component_names in
List.map
(fun (pos, cc) -> apply_coercion Strict cc (get_component g.(pos)))
pos_cc_list
| _ ->
assert false in
Lprim(Psetglobal target_name, [Lprim(Pmakeblock(0, Immutable), components)])
*)
let transl_store_package component_names target_name coercion =
let rec make_sequence fn pos arg =
match arg with
[] -> lambda_unit
| hd :: tl -> Lsequence(fn pos hd, make_sequence fn (pos + 1) tl) in
match coercion with
Tcoerce_none ->
(List.length component_names,
make_sequence
(fun pos id ->
Lprim(Psetfield(pos, Pointer, Root_initialization),
[Lprim(Pgetglobal target_name, [], Loc_unknown);
get_component id],
Loc_unknown))
0 component_names)
| Tcoerce_structure (pos_cc_list, _id_pos_list) ->
let components =
Lprim(Pmakeblock(0, Immutable, None),
List.map get_component component_names,
Loc_unknown)
in
let blk = Ident.create_local "block" in
(List.length pos_cc_list,
Llet (Strict, Pgenval, blk,
apply_coercion Loc_unknown Strict coercion components,
make_sequence
(fun pos _id ->
Lprim(Psetfield(pos, Pointer, Root_initialization),
[Lprim(Pgetglobal target_name, [], Loc_unknown);
Lprim(Pfield (pos, Pointer, Mutable),
[Lvar blk], Loc_unknown)],
Loc_unknown))
0 pos_cc_list))
(*
(* ignore id_pos_list as the ids are already bound *)
let id = Array.of_list component_names in
(List.length pos_cc_list,
make_sequence
(fun dst (src, cc) ->
Lprim(Psetfield(dst, false),
[Lprim(Pgetglobal target_name, []);
apply_coercion Strict cc (get_component id.(src))]))
0 pos_cc_list)
*)
| _ -> assert false
(* Error report *)
open Format_doc
module Style = Misc.Style
let print_cycle ppf cycle =
let print_ident ppf (x,_) = pp_print_string ppf (Ident.name x) in
let pp_sep ppf () = fprintf ppf "@ -> " in
fprintf ppf "%a%a%s"
(pp_print_list ~pp_sep print_ident) cycle
pp_sep ()
(Ident.name @@ fst @@ List.hd cycle)
(* we repeat the first element to make the cycle more apparent *)
let explanation_submsg (id, unsafe_info) =
match unsafe_info with
| Unnamed -> assert false (* can't be part of a cycle. *)
| Unsafe {reason;loc;subid} ->
let print fmt =
let printer = doc_printf fmt
Style.inline_code (Ident.name id)
Style.inline_code (Ident.name subid) in
Location.mkloc printer loc in
match reason with
| Unsafe_module_binding ->
print "Module %a defines an unsafe module, %a ."
| Unsafe_functor -> print "Module %a defines an unsafe functor, %a ."
| Unsafe_typext ->
print "Module %a defines an unsafe extension constructor, %a ."
| Unsafe_non_function -> print "Module %a defines an unsafe value, %a ."
let report_error loc = function
| Circular_dependency cycle ->
let[@manual.ref "s:recursive-modules"] manual_ref = [ 12; 2 ] in
Location.errorf ~loc ~sub:(List.map explanation_submsg cycle)
"Cannot safely evaluate the definition of the following cycle@ \
of recursively-defined modules:@ %a.@ \
There are no safe modules in this cycle@ %a."
print_cycle cycle Misc.print_see_manual manual_ref
| Conflicting_inline_attributes ->
Location.errorf "@[Conflicting %a attributes@]"
Style.inline_code "inline"
let () =
Location.register_error_of_exn
(function
| Error (loc, err) -> Some (report_error loc err)
| _ ->
None
)
let reset () =
primitive_declarations := [];
transl_store_subst := Ident.Map.empty;
aliased_idents := Ident.empty;
Env.reset_required_globals ();
Translprim.clear_used_primitives ()
|