forked from rescript-lang/rescript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlam_compile_main.pp.ml
336 lines (302 loc) · 11.4 KB
/
lam_compile_main.pp.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
(* Copyright (C) 2015 - 2016 Bloomberg Finance L.P.
* Copyright (C) 2017 - Hongbo Zhang, Authors of ReScript
* 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. *)
(* module E = Js_exp_make *)
(* module S = Js_stmt_make *)
let compile_group (meta : Lam_stats.t)
(x : Lam_group.t) : Js_output.t =
match x with
(*
We need
2. [E.builtin_dot] for javascript builtin
3. [E.mldot]
*)
(* ATTENTION: check {!Lam_compile_global} for consistency *)
(* Special handling for values in [Pervasives] *)
(*
we delegate [stdout, stderr, and stdin] into [caml_io] module,
the motivation is to help dead code eliminatiion, it's helpful
to make those parts pure (not a function call), then it can be removed
if unused
*)
(* QUICK hack to make hello world example nicer,
Note the arity of [print_endline] is already analyzed before,
so it should be safe
*)
| Single (kind, id, lam) ->
(* let lam = Optimizer.simplify_lets [] lam in *)
(* can not apply again, it's wrong USE it with care*)
(* ([Js_stmt_make.comment (Gen_of_env.query_type id env )], None) ++ *)
Lam_compile.compile_lambda { continuation = Declare (kind, id);
jmp_table = Lam_compile_context.empty_handler_map;
meta
} lam
| Recursive id_lams ->
Lam_compile.compile_recursive_lets
{ continuation = EffectCall Not_tail;
jmp_table = Lam_compile_context.empty_handler_map;
meta
}
id_lams
| Nop lam -> (* TODO: Side effect callls, log and see statistics *)
Lam_compile.compile_lambda {continuation = EffectCall Not_tail;
jmp_table = Lam_compile_context.empty_handler_map;
meta
} lam
;;
(** Also need analyze its depenency is pure or not *)
let no_side_effects (rest : Lam_group.t list) : string option =
Ext_list.find_opt rest (fun x ->
match x with
| Single(kind,id,body) ->
begin
match kind with
| Strict | Variable ->
if not @@ Lam_analysis.no_side_effects body
then Some (Printf.sprintf "%s" id.name)
else None
| _ -> None
end
| Recursive bindings ->
Ext_list.find_opt bindings (fun (id,lam) ->
if not @@ Lam_analysis.no_side_effects lam
then Some (Printf.sprintf "%s" id.Ident.name )
else None
)
| Nop lam ->
if not @@ Lam_analysis.no_side_effects lam
then
(* (Lam_util.string_of_lambda lam) *)
Some ""
else None (* TODO :*))
let _d = fun s lam ->
#ifndef RELEASE
Lam_util.dump s lam ;
Ext_log.dwarn ~__POS__ "START CHECKING PASS %s@." s;
ignore @@ Lam_check.check !Location.input_name lam;
Ext_log.dwarn ~__POS__ "FINISH CHECKING PASS %s@." s;
#endif
lam
let _j = Js_pass_debug.dump
(** Actually simplify_lets is kind of global optimization since it requires you to know whether
it's used or not
*)
let compile
(output_prefix : string)
export_idents
(lam : Lambda.lambda) =
let export_ident_sets = Set_ident.of_list export_idents in
(* To make toplevel happy - reentrant for js-demo *)
let () =
#ifndef RELEASE
Ext_list.iter export_idents
(fun id -> Ext_log.dwarn ~__POS__ "export idents: %s/%d" id.name id.stamp) ;
#endif
Lam_compile_env.reset () ;
in
let lam, may_required_modules = Lam_convert.convert export_ident_sets lam in
let lam = _d "initial" lam in
let lam = Lam_pass_deep_flatten.deep_flatten lam in
let lam = _d "flatten0" lam in
let meta : Lam_stats.t =
Lam_stats.make
~export_idents
~export_ident_sets in
let () = Lam_pass_collect.collect_info meta lam in
let lam =
let lam =
lam
|> _d "flattern1"
|> Lam_pass_exits.simplify_exits
|> _d "simplyf_exits"
|> (fun lam -> Lam_pass_collect.collect_info meta lam;
#ifndef RELEASE
let () =
Ext_log.dwarn ~__POS__ "Before simplify_alias: %a@." Lam_stats.print meta in
#endif
lam)
|> Lam_pass_remove_alias.simplify_alias meta
|> _d "simplify_alias"
|> Lam_pass_deep_flatten.deep_flatten
|> _d "flatten2"
in (* Inling happens*)
let () = Lam_pass_collect.collect_info meta lam in
let lam = Lam_pass_remove_alias.simplify_alias meta lam in
let lam = Lam_pass_deep_flatten.deep_flatten lam in
let () = Lam_pass_collect.collect_info meta lam in
let lam =
lam
|> _d "alpha_before"
|> Lam_pass_alpha_conversion.alpha_conversion meta
|> _d "alpha_after"
|> Lam_pass_exits.simplify_exits in
let () = Lam_pass_collect.collect_info meta lam in
lam
|> _d "simplify_alias_before"
|> Lam_pass_remove_alias.simplify_alias meta
|> _d "alpha_conversion"
|> Lam_pass_alpha_conversion.alpha_conversion meta
|> _d "before-simplify_lets"
(* we should investigate a better way to put different passes : )*)
|> Lam_pass_lets_dce.simplify_lets
|> _d "before-simplify-exits"
(* |> (fun lam -> Lam_pass_collect.collect_info meta lam
; Lam_pass_remove_alias.simplify_alias meta lam) *)
(* |> Lam_group_pass.scc_pass
|> _d "scc" *)
|> Lam_pass_exits.simplify_exits
|> _d "simplify_lets"
#ifndef RELEASE
|> (fun lam ->
let () =
Ext_log.dwarn ~__POS__ "Before coercion: %a@." Lam_stats.print meta in
Lam_check.check !Location.input_name lam
)
#endif
in
let ({Lam_coercion.groups = groups } as coerced_input , meta) =
Lam_coercion.coerce_and_group_big_lambda meta lam
in
#ifndef RELEASE
let () =
Ext_log.dwarn ~__POS__ "After coercion: %a@." Lam_stats.print meta ;
if Js_config.get_diagnose () then
let f =
Ext_filename.new_extension !Location.input_name ".lambda" in
Ext_fmt.with_file_as_pp f begin fun fmt ->
Format.pp_print_list ~pp_sep:Format.pp_print_newline
Lam_group.pp_group fmt (coerced_input.groups)
end;
in
#endif
let maybe_pure = no_side_effects groups in
#ifndef RELEASE
let () = Ext_log.dwarn ~__POS__ "\n@[[TIME:]Pre-compile: %f@]@." (Sys.time () *. 1000.) in
#endif
let body =
Ext_list.map groups (fun group -> compile_group meta group)
|> Js_output.concat
|> Js_output.output_as_block
in
#ifndef RELEASE
let () = Ext_log.dwarn ~__POS__ "\n@[[TIME:]Post-compile: %f@]@." (Sys.time () *. 1000.) in
#endif
(* The file is not big at all compared with [cmo] *)
(* Ext_marshal.to_file (Ext_path.chop_extension filename ^ ".mj") js; *)
let meta_exports = meta.exports in
let export_set = Set_ident.of_list meta_exports in
let js : J.program =
{
exports = meta_exports ;
export_set;
block = body}
in
js
|> _j "initial"
|> Js_pass_flatten.program
|> _j "flattern"
|> Js_pass_tailcall_inline.tailcall_inline
|> _j "inline_and_shake"
|> Js_pass_flatten_and_mark_dead.program
|> _j "flatten_and_mark_dead"
(* |> Js_inline_and_eliminate.inline_and_shake *)
(* |> _j "inline_and_shake" *)
|> (fun js -> ignore @@ Js_pass_scope.program js ; js )
|> Js_shake.shake_program
|> _j "shake"
|> ( fun (program: J.program) ->
let external_module_ids : Lam_module_ident.t list =
if !Js_config.all_module_aliases then []
else
let hard_deps =
Js_fold_basic.calculate_hard_dependencies program.block in
Lam_compile_env.populate_required_modules
may_required_modules hard_deps ;
Ext_list.sort_via_array (Lam_module_ident.Hash_set.to_list hard_deps)
(fun id1 id2 ->
Ext_string.compare (Lam_module_ident.name id1) (Lam_module_ident.name id2)
)
in
Warnings.check_fatal();
let effect =
Lam_stats_export.get_dependent_module_effect
maybe_pure external_module_ids in
let v : Js_cmj_format.t =
Lam_stats_export.export_to_cmj
meta
effect
coerced_input.export_map
(if Ext_char.is_lower_case (Filename.basename output_prefix).[0] then Little else Upper)
in
(if not !Clflags.dont_write_files then
Js_cmj_format.to_file
~check_exists:(not !Js_config.force_cmj)
(output_prefix ^ Literals.suffix_cmj) v);
{J.program = program ; side_effect = effect ; modules = external_module_ids }
)
;;
let (//) = Filename.concat
let lambda_as_module
(lambda_output : J.deps_program)
(output_prefix : string)
: unit =
let package_info = Js_packages_state.get_packages_info () in
if Js_packages_info.is_empty package_info && !Js_config.js_stdout then begin
Js_dump_program.dump_deps_program ~output_prefix NodeJS lambda_output stdout
end else
Js_packages_info.iter package_info (fun {module_system; path; suffix} ->
let output_chan chan =
Js_dump_program.dump_deps_program ~output_prefix
module_system
lambda_output
chan in
let basename =
Ext_namespace.change_ext_ns_suffix
(Filename.basename
output_prefix)
(Ext_js_suffix.to_string suffix)
in
let target_file =
(Lazy.force Ext_path.package_dir //
path //
basename
(* #913 only generate little-case js file *)
) in
(if not !Clflags.dont_write_files then
Ext_pervasives.with_file_as_chan
target_file output_chan );
if !Warnings.has_warnings then begin
Warnings.has_warnings := false ;
#ifdef BROWSER
#else
if Sys.file_exists target_file then begin
Bs_hash_stubs.set_as_old_file target_file
end
#endif
end
)
(* We can use {!Env.current_unit = "Pervasives"} to tell if it is some specific module,
We need handle some definitions in standard libraries in a special way, most are io specific,
includes {!Pervasives.stdin, Pervasives.stdout, Pervasives.stderr}
However, use filename instead of {!Env.current_unit} is more honest, since node-js module system is coupled with the file name
*)