Source file browse_misc.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
open Std
let dummy_type_scheme desc =
Types.create_expr desc ~level:0 ~id:0 ~scope:Btype.generic_level
let print_constructor c =
let open Types in
match c.cstr_args with
| [] -> Printtyp.tree_of_type_scheme (dummy_type_scheme (get_desc c.cstr_res))
| args ->
let desc =
Tarrow
( Ast_helper.no_label,
dummy_type_scheme (Ttuple args),
c.cstr_res,
commu_ok )
in
Printtyp.tree_of_type_scheme (dummy_type_scheme desc)
let summary_prev = function
| Env.Env_empty -> None
| Env.Env_open (s, _)
| Env.Env_value (s, _, _)
| Env.Env_type (s, _, _)
| Env.Env_extension (s, _, _)
| Env.Env_module (s, _, _, _)
| Env.Env_modtype (s, _, _)
| Env.Env_class (s, _, _)
| Env.Env_cltype (s, _, _)
| Env.Env_functor_arg (s, _)
| Env.Env_constraints (s, _)
| Env.Env_copy_types s
| Env.Env_persistent (s, _)
| Env.Env_value_unbound (s, _, _)
| Env.Env_module_unbound (s, _, _) -> Some s
let signature_of_env ?(ignore_extensions = true) env =
let signature_of_summary =
let open Env in
let open Types in
function
| Env_value (_, i, v) -> Some (Sig_value (i, v, Exported))
| Env_type (_, i, t) -> Some (Sig_type (i, t, Trec_not, Exported))
| Env_extension (_, i, e) -> begin
match e.ext_type_path with
| Path.Pident id when Ident.name id = "exn" ->
Some (Sig_typext (i, e, Text_exception, Exported))
| _ -> Some (Sig_typext (i, e, Text_first, Exported))
end
| Env_module (_, i, pr, m) ->
Some (Sig_module (i, pr, m, Trec_not, Exported))
| Env_modtype (_, i, m) -> Some (Sig_modtype (i, m, Exported))
| Env_class (_, i, c) -> Some (Sig_class (i, c, Trec_not, Exported))
| Env_cltype (_, i, c) -> Some (Sig_class_type (i, c, Trec_not, Exported))
| Env_open _
| Env_empty
| Env_functor_arg _
| Env_constraints _
| Env_copy_types _
| Env_persistent _
| Env_value_unbound _
| Env_module_unbound _ -> None
in
let summary_module_ident_opt = function
| Env.Env_module (_, i, _, _) -> Some i
| _ -> None
in
let sg = ref [] in
let append item = sg := item :: !sg in
let rec aux summary =
match summary_module_ident_opt summary with
| Some i when ignore_extensions && i = Extension.ident -> ()
| _ ->
Option.iter ~f:append (signature_of_summary summary);
Option.iter ~f:aux (summary_prev summary)
in
aux (Env.summary env);
!sg
let dump_browse node =
let attr attr =
let { Location.txt; loc }, payload = Ast_helper.Attr.as_tuple attr in
`Assoc
[ ("start", Lexing.json_of_position loc.Location.loc_start);
("end", Lexing.json_of_position loc.Location.loc_end);
( "name",
`String (txt ^ if payload = Parsetree.PStr [] then "" else " _") )
]
in
let rec append env node acc =
let loc = Mbrowse.node_loc node in
`Assoc
[ ("filename", `String loc.Location.loc_start.Lexing.pos_fname);
("start", Lexing.json_of_position loc.Location.loc_start);
("end", Lexing.json_of_position loc.Location.loc_end);
("ghost", `Bool loc.Location.loc_ghost);
("attrs", `List (List.map ~f:attr (Browse_raw.node_attributes node)));
("kind", `String (Browse_raw.string_of_node node));
("children", dump_list env node)
]
:: acc
and dump_list env node =
`List (List.sort ~cmp:compare @@ Mbrowse.fold_node append env node [])
in
`List (append Env.empty node [])
let annotate_tail_calls (ts : Mbrowse.t) :
(Env.t * Browse_raw.node * Query_protocol.is_tail_position) list =
let is_one_of candidates node = List.mem node ~set:candidates in
let find_entry_points candidates (env, node) =
(Tail_analysis.entry_points node, (env, node, is_one_of candidates node))
in
let _, entry_points = List.fold_n_map ts ~f:find_entry_points ~init:[] in
let propagate candidates (env, node, entry) =
let is_in_tail = entry || is_one_of candidates node in
( (if is_in_tail then Tail_analysis.tail_positions node else []),
(env, node, is_in_tail) )
in
let _, tail_positions = List.fold_n_map entry_points ~f:propagate ~init:[] in
List.map
~f:(fun (env, node, tail) ->
( env,
node,
if not tail then `No
else if Tail_analysis.is_call node then `Tail_call
else `Tail_position ))
tail_positions