-
Notifications
You must be signed in to change notification settings - Fork 10
Expand file tree
/
Copy pathpre.pre_ds.m
More file actions
336 lines (276 loc) · 12.8 KB
/
pre.pre_ds.m
File metadata and controls
336 lines (276 loc) · 12.8 KB
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
%-----------------------------------------------------------------------%
% Plasma pre-core representation
% vim: ts=4 sw=4 et
%
% Copyright (C) Plasma Team
% Distributed under the terms of the MIT License see ../LICENSE.code
%
% This module represents the pre-core representation.
%
%-----------------------------------------------------------------------%
:- module pre.pre_ds.
%-----------------------------------------------------------------------%
:- interface.
:- import_module list.
:- import_module map.
:- import_module maybe.
:- import_module set.
:- import_module context.
:- import_module common_types.
:- import_module varmap.
%-----------------------------------------------------------------------%
% Compared with the AST representation, the pre representation has
% variables resolved, and restricts where expressions can appear
% (they're not allowed as the switched-on variable in switches or return
% expressions).
%
:- type pre_function
---> pre_function(
f_func_id :: func_id,
f_varmap :: varmap,
f_param_vars :: list(var_or_wildcard(var)),
f_arity :: arity,
f_body :: pre_statements,
f_context :: context
).
%-----------------------------------------------------------------------%
:- type pre_statements == list(pre_statement).
:- type pre_statement
---> pre_statement(
s_type :: pre_stmt_type,
s_info :: pre_stmt_info
).
:- type pre_stmt_type
---> s_call(pre_call)
; s_decl_vars(list(var))
; s_assign(list(var_or_wildcard(var)), list(pre_expr))
; s_return(list(var))
; s_match(var, list(pre_case)).
:- type pre_stmt_info
---> stmt_info(
si_context :: context,
% Use vars the set of variables whose values are needed
% by this computation. They appear on the LHS of
% assignments or anywhere within other statement types.
si_use_vars :: set(var),
% Def vars is the set of variables that are computed by
% this computation. They appear on the RHS of
% assignments. They may intersect with use vars, for
% example if this is a compound statement containing an
% assignment of a variable followed by the use of the
% same variable.
si_def_vars :: set(var),
% Whether the end of this statment is reachable.
si_reachable :: stmt_reachable
).
:- type stmt_reachable
---> stmt_always_fallsthrough
% NOTE: All visible cases are covered, uncovered cases cannot be
% detected until after typechecking.
; stmt_always_returns
; stmt_may_return.
:- type pre_call
% XXX: Maybe use only variables as call arguments?
---> pre_call(func_id, list(pre_expr), with_bang)
; pre_ho_call(pre_expr, list(pre_expr), with_bang).
:- type with_bang
---> with_bang
; without_bang.
:- type pre_case
---> pre_case(pre_pattern, pre_statements).
:- type pre_pattern
---> p_number(int)
; p_var(var)
% The pattern is for one of the possible constructors
; p_constr(set(ctor_id), list(pre_pattern))
; p_wildcard.
:- type pre_expr
---> e_call(pre_call)
; e_match(pre_expr, list(pre_expr_case))
; e_var(var)
; e_construction(
set(ctor_id),
list(pre_expr)
)
; e_lambda(pre_lambda)
; e_constant(const_type).
:- type pre_expr_case
---> pre_e_case(pre_pattern, list(pre_expr)).
:- type pre_lambda
---> pre_lambda(
pl_id :: func_id,
pl_params :: list(var_or_wildcard(var)),
% Filled in during nonlocals processing.
pl_captured :: maybe(set(var)),
pl_arity :: arity,
pl_body :: pre_statements
).
%-----------------------------------------------------------------------%
:- func stmt_all_vars(pre_statement) = set(var).
:- func pattern_all_vars(pre_pattern) = set(var).
:- pred stmt_rename(set(var)::in, pre_statement::in, pre_statement::out,
map(var, var)::in, map(var, var)::out, varmap::in, varmap::out) is det.
:- pred pat_rename(set(var)::in, pre_pattern::in, pre_pattern::out,
map(var, var)::in, map(var, var)::out, varmap::in, varmap::out) is det.
%-----------------------------------------------------------------------%
%-----------------------------------------------------------------------%
:- implementation.
:- import_module require.
:- import_module util.
:- import_module util.mercury.
%-----------------------------------------------------------------------%
stmt_all_vars(pre_statement(Type, _)) = Vars :-
( Type = s_call(Call),
Vars = call_all_vars(Call)
; Type = s_decl_vars(VarsList),
Vars = list_to_set(VarsList)
; Type = s_assign(LVarsOrWildcards, Exprs),
filter_map(vow_is_var, LVarsOrWildcards, LVars),
Vars = list_to_set(LVars) `union`
union_list(map(expr_all_vars, Exprs))
; Type = s_return(RVars),
Vars = list_to_set(RVars)
; Type = s_match(Var, Cases),
Vars = make_singleton_set(Var) `union`
union_list(map(case_all_vars, Cases))
).
:- func case_all_vars(pre_case) = set(var).
case_all_vars(pre_case(Pat, Stmts)) = pattern_all_vars(Pat) `union`
union_list(map(stmt_all_vars, Stmts)).
pattern_all_vars(p_number(_)) = set.init.
pattern_all_vars(p_var(Var)) = make_singleton_set(Var).
pattern_all_vars(p_wildcard) = set.init.
pattern_all_vars(p_constr(_, Args)) =
union_list(map(pattern_all_vars, Args)).
:- func expr_all_vars(pre_expr) = set(var).
expr_all_vars(e_call(Call)) = call_all_vars(Call).
expr_all_vars(e_match(MatchExpr, Cases)) = expr_all_vars(MatchExpr) `union`
union_list(map(func(pre_e_case(Pat, Expr)) =
pattern_all_vars(Pat) `union` union_list(map(expr_all_vars, Expr)),
Cases)).
expr_all_vars(e_var(Var)) = make_singleton_set(Var).
expr_all_vars(e_construction(_, Args)) = union_list(map(expr_all_vars, Args)).
expr_all_vars(e_lambda(Lambda)) =
union_list(map(stmt_all_vars, Body)) `union` list_to_set(ParamVars) :-
Body = Lambda ^ pl_body,
filter_map(vow_is_var, Lambda ^ pl_params, ParamVars).
expr_all_vars(e_constant(_)) = set.init.
:- func call_all_vars(pre_call) = set(var).
call_all_vars(pre_call(_, Exprs, _)) =
union_list(map(expr_all_vars, Exprs)).
call_all_vars(pre_ho_call(CalleeExpr, ArgsExprs, _)) =
union_list(map(expr_all_vars, ArgsExprs)) `union` expr_all_vars(CalleeExpr).
%-----------------------------------------------------------------------%
stmt_rename(Vars, pre_statement(Type0, Info0), pre_statement(Type, Info),
!Renaming, !Varmap) :-
( Type0 = s_call(Call0),
call_rename(Vars, Call0, Call, !Renaming, !Varmap),
Type = s_call(Call)
; Type0 = s_decl_vars(DVars0),
map_foldl2(var_rename(Vars), DVars0, DVars, !Renaming, !Varmap),
Type = s_decl_vars(DVars)
; Type0 = s_assign(LVars0, Exprs0),
map_foldl2(var_or_wild_rename(Vars), LVars0, LVars, !Renaming, !Varmap),
map_foldl2(expr_rename(Vars), Exprs0, Exprs, !Renaming, !Varmap),
Type = s_assign(LVars, Exprs)
; Type0 = s_return(RVars0),
map_foldl2(var_rename(Vars), RVars0, RVars, !Renaming, !Varmap),
Type = s_return(RVars)
; Type0 = s_match(Var0, Cases0),
var_rename(Vars, Var0, Var, !Renaming, !Varmap),
map_foldl2(case_rename(Vars), Cases0, Cases, !Renaming, !Varmap),
Type = s_match(Var, Cases)
),
Info0 = stmt_info(Context, UseVars0, DefVars0, StmtReturns),
set_map_foldl2(var_rename(Vars), UseVars0, UseVars, !Renaming, !Varmap),
set_map_foldl2(var_rename(Vars), DefVars0, DefVars, !Renaming, !Varmap),
Info = stmt_info(Context, UseVars, DefVars, StmtReturns).
:- pred case_rename(set(var)::in, pre_case::in, pre_case::out,
map(var, var)::in, map(var, var)::out, varmap::in, varmap::out) is det.
case_rename(Vars, pre_case(Pat0, Stmts0), pre_case(Pat, Stmts),
!Renaming, !Varmap) :-
pat_rename(Vars, Pat0, Pat, !Renaming, !Varmap),
map_foldl2(stmt_rename(Vars), Stmts0, Stmts, !Renaming, !Varmap).
pat_rename(_, p_number(N), p_number(N), !Renaming, !Varmap).
pat_rename(Vars, p_var(Var0), p_var(Var), !Renaming, !Varmap) :-
var_rename(Vars, Var0, Var, !Renaming, !Varmap).
pat_rename(_, p_wildcard, p_wildcard, !Renaming, !Varmap).
pat_rename(Vars, p_constr(Cs, Args0), p_constr(Cs, Args), !Renaming, !Varmap) :-
map_foldl2(pat_rename(Vars), Args0, Args, !Renaming, !Varmap).
:- pred expr_rename(set(var)::in, pre_expr::in, pre_expr::out,
map(var, var)::in, map(var, var)::out, varmap::in, varmap::out) is det.
expr_rename(Vars, e_call(Call0), e_call(Call), !Renaming, !Varmap) :-
call_rename(Vars, Call0, Call, !Renaming, !Varmap).
expr_rename(Vars, e_match(Expr0, Cases0), e_match(Expr, Cases), !Renaming,
!Varmap) :-
expr_rename(Vars, Expr0, Expr, !Renaming, !Varmap),
map_foldl2(expr_case_rename(Vars), Cases0, Cases, !Renaming, !Varmap).
expr_rename(Vars, e_var(Var0), e_var(Var), !Renaming, !Varmap) :-
var_rename(Vars, Var0, Var, !Renaming, !Varmap).
expr_rename(Vars, e_construction(Cs, Args0), e_construction(Cs, Args),
!Renaming, !Varmap) :-
map_foldl2(expr_rename(Vars), Args0, Args, !Renaming, !Varmap).
expr_rename(Vars, e_lambda(!.Lambda), e_lambda(!:Lambda), !Renaming, !Varmap) :-
map_foldl2(var_or_wild_rename(Vars), !.Lambda ^ pl_params, Params,
!Renaming, !Varmap),
MaybeCaptured0 = !.Lambda ^ pl_captured,
( MaybeCaptured0 = yes(Captured0),
set_rename(Vars, Captured0, Captured, !Renaming, !Varmap),
!Lambda ^ pl_captured := yes(Captured)
; MaybeCaptured0 = no
),
map_foldl2(stmt_rename(Vars), !.Lambda ^ pl_body, Body,
!Renaming, !Varmap),
!Lambda ^ pl_params := Params,
!Lambda ^ pl_body := Body.
expr_rename(_, e_constant(C), e_constant(C), !Renaming, !Varmap).
:- pred call_rename(set(var)::in, pre_call::in, pre_call::out,
map(var, var)::in, map(var, var)::out, varmap::in, varmap::out) is det.
call_rename(Vars, pre_call(Func, Exprs0, Bang), pre_call(Func, Exprs, Bang),
!Renaming, !Varmap) :-
map_foldl2(expr_rename(Vars), Exprs0, Exprs, !Renaming, !Varmap).
call_rename(Vars, pre_ho_call(CalleeExpr0, ArgExprs0, Bang),
pre_ho_call(CalleeExpr, ArgExprs, Bang), !Renaming, !Varmap) :-
expr_rename(Vars, CalleeExpr0, CalleeExpr, !Renaming, !Varmap),
map_foldl2(expr_rename(Vars), ArgExprs0, ArgExprs, !Renaming, !Varmap).
:- pred expr_case_rename(set(var)::in,
pre_expr_case::in, pre_expr_case::out,
map(var, var)::in, map(var, var)::out, varmap::in, varmap::out) is det.
expr_case_rename(Vars, pre_e_case(Pat0, Exprs0), pre_e_case(Pat, Exprs),
!Renaming, !Varmap) :-
pat_rename(Vars, Pat0, Pat, !Renaming, !Varmap),
map_foldl2(expr_rename(Vars), Exprs0, Exprs, !Renaming, !Varmap).
:- pred set_rename(set(var)::in, set(var)::in, set(var)::out,
map(var, var)::in, map(var, var)::out, varmap::in, varmap::out) is det.
set_rename(Vars, !Set, !Renaming, !Varmap) :-
fold3(set_rename_2(Vars), !.Set, set.init, !:Set, !Renaming, !Varmap).
:- pred set_rename_2(set(var)::in, var::in, set(var)::in, set(var)::out,
map(var, var)::in, map(var, var)::out, varmap::in, varmap::out) is det.
set_rename_2(Vars, Var0, !Set, !Renaming, !Varmap) :-
var_rename(Vars, Var0, Var, !Renaming, !Varmap),
( if insert_new(Var, !Set) then
true
else
unexpected($file, $pred, "Renaming vars in a set is broken")
).
:- pred var_or_wild_rename(set(var)::in,
var_or_wildcard(var)::in, var_or_wildcard(var)::out,
map(var, var)::in, map(var, var)::out, varmap::in, varmap::out) is det.
var_or_wild_rename(Vars, var(Var0), var(Var), !Renaming, !Varmap) :-
var_rename(Vars, Var0, Var, !Renaming, !Varmap).
var_or_wild_rename(_, wildcard, wildcard, !Renaming, !Varmap).
:- pred var_rename(set(var)::in, var::in, var::out,
map(var, var)::in, map(var, var)::out, varmap::in, varmap::out) is det.
var_rename(Vars, Var0, Var, !Renaming, !Varmap) :-
( if member(Var0, Vars) then
( if search(!.Renaming, Var0, VarPrime) then
Var = VarPrime
else
add_fresh_var(get_var_name_no_suffix(!.Varmap, Var0), Var, !Varmap),
det_insert(Var0, Var, !Renaming)
)
else
Var = Var0
).
%-----------------------------------------------------------------------%
%-----------------------------------------------------------------------%