forked from rescript-lang/rescript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlam_beta_reduce.ml
167 lines (148 loc) · 6.03 KB
/
lam_beta_reduce.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
(* 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. *)
(*
A naive beta reduce would break the invariants of the optmization.
The sane but slowest way:
when we do a beta reduction, we need rename all variables inlcuding
let-bound ones
A conservative one:
- for internal one
rename params and let bound variables
- for external one (seriaized)
if it's enclosed environment should be good enough
so far, we only inline enclosed lambdas
TODO: rename
Optimizations:
{[
(fun x y -> ... ) 100 3
]}
we can bound [x] to [100] in a single step
*)
let propogate_beta_reduce
(meta : Lam_stats.t) params body args =
match Lam_beta_reduce_util.simple_beta_reduce params body args with
| Some x -> x
| None ->
let rest_bindings, rev_new_params =
List.fold_left2
(fun (rest_bindings, acc) old_param (arg : Lam.t) ->
match arg with
| Lconst _
| Lvar _ -> rest_bindings , arg :: acc
| _ ->
let p = Ident.rename old_param in
(p,arg) :: rest_bindings , (Lam.var p) :: acc
) ([],[]) params args in
let new_body = Lam_bounded_vars.rewrite (Ident_hashtbl.of_list2 (List.rev params) (rev_new_params)) body in
List.fold_right
(fun (param, (arg : Lam.t)) l ->
let arg =
match arg with
| Lvar v ->
begin
match Ident_hashtbl.find_opt meta.ident_tbl v with
| None -> ()
| Some ident_info ->
Ident_hashtbl.add meta.ident_tbl param ident_info
end;
arg
| Lglobal_module ident
->
(* It's not completeness, its to make it sound..
Pass global module as an argument
*)
Lam_compile_global.query_lambda ident meta.env
(* alias meta param ident (Module (Global ident)) Strict *)
| Lprim {primitive = Pmakeblock (_, _, Immutable) ;args ; _} ->
Ident_hashtbl.replace meta.ident_tbl param
(Lam_util.kind_of_lambda_block Normal args ); (** *)
arg
| _ -> arg in
Lam_util.refine_let ~kind:Strict param arg l)
rest_bindings new_body
let propogate_beta_reduce_with_map
(meta : Lam_stats.t) (map : Lam_closure.stats Ident_map.t ) params body args =
match Lam_beta_reduce_util.simple_beta_reduce params body args with
| Some x -> x
| None ->
let rest_bindings, rev_new_params =
List.fold_left2
(fun (rest_bindings, acc) old_param (arg : Lam.t) ->
match arg with
| Lconst _
| Lvar _ -> rest_bindings , arg :: acc
| Lglobal_module ident
(* We can pass Global, but you also need keep track of it*)
->
let p = Ident.rename old_param in
(p,arg) :: rest_bindings , (Lam.var p) :: acc
| _ ->
if Lam_analysis.no_side_effects arg then
begin match Ident_map.find_exn old_param map with
| exception Not_found -> assert false
| {top = true ; times = 0 }
| {top = true ; times = 1 }
->
rest_bindings, arg :: acc
| _ ->
let p = Ident.rename old_param in
(p,arg) :: rest_bindings , (Lam.var p) :: acc
end
else
let p = Ident.rename old_param in
(p,arg) :: rest_bindings , (Lam.var p) :: acc
) ([],[]) params args in
let new_body = Lam_bounded_vars.rewrite (Ident_hashtbl.of_list2 (List.rev params) (rev_new_params)) body in
List.fold_right
(fun (param, (arg : Lam.t)) l ->
let arg =
match arg with
| Lvar v ->
begin
match Ident_hashtbl.find_opt meta.ident_tbl v with
| None -> ()
| Some ident_info ->
Ident_hashtbl.add meta.ident_tbl param ident_info
end;
arg
| Lglobal_module ident
->
(* It's not completeness, its to make it sound.. *)
Lam_compile_global.query_lambda ident meta.env
(* alias meta param ident (Module (Global ident)) Strict *)
| Lprim {primitive = Pmakeblock (_, _, Immutable ) ; args} ->
Ident_hashtbl.replace meta.ident_tbl param
(Lam_util.kind_of_lambda_block Normal args ); (** *)
arg
| _ -> arg in
Lam_util.refine_let ~kind:Strict param arg l)
rest_bindings new_body
let beta_reduce params body args =
match Lam_beta_reduce_util.simple_beta_reduce params body args with
| Some x -> x
| None ->
List.fold_left2
(fun l param arg ->
Lam_util.refine_let ~kind:Strict param arg l)
body params args