snapshot

Author: bobzhang

lib/4.06.1/unstable/js_compiler.ml

@@ -398974,94 +398974,6 @@ let simplify_lets  (lam : Lam.t) : Lam.t =
 
   apply_lets  occ   lam
 
-end
-module Lam_inline_util : sig 
-#1 "lam_inline_util.mli"
-(* Copyright (C) 2015-2016 Bloomberg Finance L.P.
- * 
- * This program is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * In addition to the permissions granted to you by the LGPL, you may combine
- * or link a "work that uses the Library" with a publicly distributed version
- * of this file to produce a combined library or application, then distribute
- * that combined work under the terms of your choosing, with no requirement
- * to comply with the obligations normally placed on you by section 4 of the
- * LGPL version 3 (or the corresponding section of a later version of the LGPL
- * should you choose to use a 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 Lesser General Public License for more details.
- * 
- * You should have received a copy of the GNU Lesser General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *)
-
-
-
-
-
-
-
-
-(** Utilities for lambda inlining *)
-
-val maybe_functor : string -> bool
-
-val should_be_functor : string -> Lam.t -> bool 
-
-end = struct
-#1 "lam_inline_util.ml"
-(* Copyright (C) 2015-2016 Bloomberg Finance L.P.
- * 
- * This program is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * In addition to the permissions granted to you by the LGPL, you may combine
- * or link a "work that uses the Library" with a publicly distributed version
- * of this file to produce a combined library or application, then distribute
- * that combined work under the terms of your choosing, with no requirement
- * to comply with the obligations normally placed on you by section 4 of the
- * LGPL version 3 (or the corresponding section of a later version of the LGPL
- * should you choose to use a 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 Lesser General Public License for more details.
- * 
- * You should have received a copy of the GNU Lesser General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *)
-
-
-
-
-
-
-
-(* TODO: add a context, like 
-    [args]
-    [Lfunction(params,body)]
- *)
-
-
-let maybe_functor (name : string) = 
-  name.[0] >= 'A' && name.[0] <= 'Z'
-
-
-let should_be_functor (name : string) (lam : Lam.t) = 
-  maybe_functor name  &&
-  (match lam with Lfunction {attr = {is_a_functor = Functor_yes}} -> true | _ -> false)
-
-
-
 end
 module Lam_pass_remove_alias : sig 
 #1 "lam_pass_remove_alias.mli"
@@ -399275,14 +399187,14 @@ let simplify_alias
       let normal () = Lam.apply ( simpl fn) (Ext_list.map args simpl) loc status in
       begin 
         match Hash_ident.find_opt meta.ident_tbl v with
-        | Some (FunctionId {lambda = Some(Lfunction ({params; body} as m),
+        | Some (FunctionId {lambda = Some(Lfunction ({params; body; attr = {is_a_functor}} as m),
                                           rec_flag)
                            })
           -> 
 
           if Ext_list.same_length args params (* && false *)
           then               
-            if Lam_inline_util.maybe_functor v.name  
+            if is_a_functor = Functor_yes
             (* && (Set_ident.mem v meta.export_idents) && false *)
             then 
               (* TODO: check l1 if it is exported, 
@@ -399613,12 +399525,12 @@ let values_of_export
               only truly immutable values can be inlined
            *)
            then
-             if Lam_inline_util.should_be_functor x.name lambda (* can also be submodule *)
-             then
+             match lambda with 
+             | Lfunction {attr = {is_a_functor = Functor_yes}} -> 
                if Lam_closure.is_closed lambda (* TODO: seriealize more*)
                then Some lambda
                else None
-             else 
+             | _ -> 
                let lam_size = Lam_analysis.size lambda in
                (* TODO:
                   1. global need re-assocate when do the beta reduction 

lib/4.06.1/unstable/js_compiler.ml.d

@@ -398974,94 +398974,6 @@ let simplify_lets  (lam : Lam.t) : Lam.t =
 
   apply_lets  occ   lam
 
-end
-module Lam_inline_util : sig 
-#1 "lam_inline_util.mli"
-(* Copyright (C) 2015-2016 Bloomberg Finance L.P.
- * 
- * This program is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * In addition to the permissions granted to you by the LGPL, you may combine
- * or link a "work that uses the Library" with a publicly distributed version
- * of this file to produce a combined library or application, then distribute
- * that combined work under the terms of your choosing, with no requirement
- * to comply with the obligations normally placed on you by section 4 of the
- * LGPL version 3 (or the corresponding section of a later version of the LGPL
- * should you choose to use a 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 Lesser General Public License for more details.
- * 
- * You should have received a copy of the GNU Lesser General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *)
-
-
-
-
-
-
-
-
-(** Utilities for lambda inlining *)
-
-val maybe_functor : string -> bool
-
-val should_be_functor : string -> Lam.t -> bool 
-
-end = struct
-#1 "lam_inline_util.ml"
-(* Copyright (C) 2015-2016 Bloomberg Finance L.P.
- * 
- * This program is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * In addition to the permissions granted to you by the LGPL, you may combine
- * or link a "work that uses the Library" with a publicly distributed version
- * of this file to produce a combined library or application, then distribute
- * that combined work under the terms of your choosing, with no requirement
- * to comply with the obligations normally placed on you by section 4 of the
- * LGPL version 3 (or the corresponding section of a later version of the LGPL
- * should you choose to use a 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 Lesser General Public License for more details.
- * 
- * You should have received a copy of the GNU Lesser General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *)
-
-
-
-
-
-
-
-(* TODO: add a context, like 
-    [args]
-    [Lfunction(params,body)]
- *)
-
-
-let maybe_functor (name : string) = 
-  name.[0] >= 'A' && name.[0] <= 'Z'
-
-
-let should_be_functor (name : string) (lam : Lam.t) = 
-  maybe_functor name  &&
-  (match lam with Lfunction {attr = {is_a_functor = Functor_yes}} -> true | _ -> false)
-
-
-
 end
 module Lam_pass_remove_alias : sig 
 #1 "lam_pass_remove_alias.mli"
@@ -399275,14 +399187,14 @@ let simplify_alias
       let normal () = Lam.apply ( simpl fn) (Ext_list.map args simpl) loc status in
       begin 
         match Hash_ident.find_opt meta.ident_tbl v with
-        | Some (FunctionId {lambda = Some(Lfunction ({params; body} as m),
+        | Some (FunctionId {lambda = Some(Lfunction ({params; body; attr = {is_a_functor}} as m),
                                           rec_flag)
                            })
           -> 
 
           if Ext_list.same_length args params (* && false *)
           then               
-            if Lam_inline_util.maybe_functor v.name  
+            if is_a_functor = Functor_yes
             (* && (Set_ident.mem v meta.export_idents) && false *)
             then 
               (* TODO: check l1 if it is exported, 
@@ -399613,12 +399525,12 @@ let values_of_export
               only truly immutable values can be inlined
            *)
            then
-             if Lam_inline_util.should_be_functor x.name lambda (* can also be submodule *)
-             then
+             match lambda with 
+             | Lfunction {attr = {is_a_functor = Functor_yes}} -> 
                if Lam_closure.is_closed lambda (* TODO: seriealize more*)
                then Some lambda
                else None
-             else 
+             | _ -> 
                let lam_size = Lam_analysis.size lambda in
                (* TODO:
                   1. global need re-assocate when do the beta reduction