forked from rescript-lang/rescript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathjs_pass_flatten.ml
104 lines (93 loc) · 3.99 KB
/
js_pass_flatten.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
(* 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. *)
(* open recursion is hard
Take cond for example:
CHECK? Trick semantics difference
super#statement (S.if_ a ([ (\* self#statement *\) (S.exp b) ])
~else_:([self#statement (S.exp c)])
)
*)
module E = Js_exp_make
module S = Js_stmt_make
let flatten_map =
object(self)
inherit Js_map.map as super
method! statement x =
match x.statement_desc with
| Exp ({expression_desc = Seq _; _} as v) ->
S.block ( List.rev_map self#statement (Js_analyzer.rev_flatten_seq v ))
| Exp {expression_desc = Caml_block (args, _mutable_flag, _tag, _tag_info )}
->
S.block (Ext_list.map args (fun arg -> self#statement (S.exp arg)))
| Exp ({expression_desc = Cond(a,b,c); comment} ) ->
{ statement_desc = If (a, [ self#statement (S.exp b)],
[ self#statement (S.exp c)]); comment}
| Exp ({expression_desc = Bin(Eq, a, ({expression_desc = Seq _; _ } as v)); _} )
->
let block = Js_analyzer.rev_flatten_seq v in
begin match block with
| {statement_desc = Exp last_one ; _} :: rest_rev
->
S.block (Ext_list.rev_map_append rest_rev
[self#statement @@ S.exp (E.assign a last_one)]
self#statement
)
(* TODO: here we introduce a block, should avoid it *)
(* super#statement *)
(* (S.block (List.rev_append rest_rev [S.exp (E.assign a last_one)])) *)
| _ ->
assert false
end
| Return {expression_desc = Cond (a,b,c); comment}
->
{ statement_desc = If (a, [self#statement (S.return_stmt b)],
[ self#statement (S.return_stmt c)]); comment}
| Return ({expression_desc = Seq _; _} as v) ->
let block = Js_analyzer.rev_flatten_seq v in
begin match block with
| {statement_desc = Exp last_one ; _} :: rest_rev
->
super#statement
(S.block (Ext_list.rev_map_append rest_rev [S.return_stmt last_one] (self#statement)))
| _ -> assert false
end
| Block [x]
->
self#statement x
| _ -> super#statement x
method! block b =
match b with
| {statement_desc = Block bs } :: rest ->
self#block ( bs @ rest)
| x::rest
->
let st = self#statement x in
let block = self#block rest in
begin match st.statement_desc with
| Block bs -> bs @ block
| _ -> st :: block
end
| [] -> []
end
let program ( x : J.program) = flatten_map # program x