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
|
(** This module contains various utilities for the assumed functions.
Note that `Box::free` is peculiar: we don't really handle it as a function,
because it is legal to free a box whose boxed value is `⊥` (it often
happens that we move a value out of a box before freeing this box).
Semantically speaking, we thus handle `Box::free` as a value drop and
not as a function call, and thus never need its signature.
TODO: implementing the concrete evaluation functions for the assumed
functions is really annoying (see
[InterpreterStatements.eval_non_local_function_call_concrete]).
I think it should be possible, in most situations, to write bodies which
model the behaviour of those unsafe functions. For instance, `Box::deref_mut`
should simply be:
```
fn deref_mut<'a, T>(x : &'a mut Box<T>) -> &'a mut T {
&mut ( *x ) // box dereferencement is a primitive operation
}
```
For vectors, we could "cheat" by using the index as a field index (vectors
would be encoded as ADTs with a variable number of fields). Of course, it
would require a bit of engineering, but it would probably be quite lightweight
in the end.
```
Vec::get_mut<'a,T>(v : &'a mut Vec<T>, i : usize) -> &'a mut T {
&mut ( ( *x ).i )
}
```
*)
module T = Types
module A = CfimAst
open TypesUtils
module Sig = struct
(** A few utilities *)
let rvar_id_0 = T.RegionVarId.of_int 0
let rvar_0 : T.RegionVarId.id T.region = T.Var rvar_id_0
let rg_id_0 = T.RegionGroupId.of_int 0
let tvar_id_0 = T.TypeVarId.of_int 0
let tvar_0 : T.sty = T.TypeVar tvar_id_0
(** Region 'a of id 0 *)
let region_param_0 : T.region_var = { T.index = rvar_id_0; name = Some "'a" }
(** Region group: { parent={}; regions:{'a of id 0} } *)
let region_group_0 : T.region_var_group =
{ T.id = rg_id_0; regions = [ rvar_id_0 ]; parents = [] }
(** Type parameter `T` of id 0 *)
let type_param_0 : T.type_var = { T.index = tvar_id_0; name = "T" }
let mk_ref_ty (r : T.RegionVarId.id T.region) (ty : T.sty) (is_mut : bool) :
T.sty =
let ref_kind = if is_mut then T.Mut else T.Shared in
mk_ref_ty r ty ref_kind
(** `fn<T>(&'a mut T, T) -> T` *)
let mem_replace_sig : A.fun_sig =
(* The signature fields *)
let region_params = [ region_param_0 ] (* <'a> *) in
let regions_hierarchy = [ region_group_0 ] (* [{<'a>}] *) in
let type_params = [ type_param_0 ] (* <T> *) in
let inputs =
[ mk_ref_ty rvar_0 tvar_0 true (* &'a mut T *); tvar_0 (* T *) ]
in
let output = tvar_0 (* T *) in
{
region_params;
num_early_bound_regions = 0;
regions_hierarchy;
type_params;
inputs;
output;
}
(** `fn<T>(T) -> Box<T>` *)
let box_new_sig : A.fun_sig =
{
region_params = [];
num_early_bound_regions = 0;
regions_hierarchy = [];
type_params = [ type_param_0 ] (* <T> *);
inputs = [ tvar_0 (* T *) ];
output = mk_box_ty tvar_0 (* Box<T> *);
}
(** Helper for `Box::deref_shared` and `Box::deref_mut`.
Returns:
`fn<'a, T>(&'a (mut) Box<T>) -> &'a (mut) T`
*)
let box_deref_gen_sig (is_mut : bool) : A.fun_sig =
(* The signature fields *)
let region_params = [ region_param_0 ] in
let regions_hierarchy = [ region_group_0 ] (* <'a> *) in
{
region_params;
num_early_bound_regions = 0;
regions_hierarchy;
type_params = [ type_param_0 ] (* <T> *);
inputs =
[ mk_ref_ty rvar_0 (mk_box_ty tvar_0) is_mut (* &'a (mut) Box<T> *) ];
output = mk_ref_ty rvar_0 tvar_0 is_mut (* &'a (mut) T *);
}
(** `fn<'a, T>(&'a Box<T>) -> &'a T` *)
let box_deref_shared_sig = box_deref_gen_sig false
(** `fn<'a, T>(&'a mut Box<T>) -> &'a mut T` *)
let box_deref_mut_sig = box_deref_gen_sig true
(** `fn<T>() -> Vec<T>` *)
let vec_new_sig : A.fun_sig =
let region_params = [] in
let regions_hierarchy = [] in
let type_params = [ type_param_0 ] (* <T> *) in
let inputs = [] in
let output = mk_vec_ty tvar_0 (* Vec<T> *) in
{
region_params;
num_early_bound_regions = 0;
regions_hierarchy;
type_params;
inputs;
output;
}
(** `fn<T>(&'a mut Vec<T>, T)` *)
let vec_push_sig : A.fun_sig =
(* The signature fields *)
let region_params = [ region_param_0 ] in
let regions_hierarchy = [ region_group_0 ] (* <'a> *) in
let type_params = [ type_param_0 ] (* <T> *) in
let inputs =
[
mk_ref_ty rvar_0 (mk_vec_ty tvar_0) true (* &'a mut Vec<T> *);
tvar_0 (* T *);
]
in
let output = mk_unit_ty (* () *) in
{
region_params;
num_early_bound_regions = 0;
regions_hierarchy;
type_params;
inputs;
output;
}
(** `fn<T>(&'a mut Vec<T>, usize, T)` *)
let vec_insert_sig : A.fun_sig =
(* The signature fields *)
let region_params = [ region_param_0 ] in
let regions_hierarchy = [ region_group_0 ] (* <'a> *) in
let type_params = [ type_param_0 ] (* <T> *) in
let inputs =
[
mk_ref_ty rvar_0 (mk_vec_ty tvar_0) true (* &'a mut Vec<T> *);
mk_usize_ty (* usize *);
tvar_0 (* T *);
]
in
let output = mk_unit_ty (* () *) in
{
region_params;
num_early_bound_regions = 0;
regions_hierarchy;
type_params;
inputs;
output;
}
(** `fn<T>(&'a Vec<T>) -> usize` *)
let vec_len_sig : A.fun_sig =
(* The signature fields *)
let region_params = [ region_param_0 ] in
let regions_hierarchy = [ region_group_0 ] (* <'a> *) in
let type_params = [ type_param_0 ] (* <T> *) in
let inputs =
[ mk_ref_ty rvar_0 (mk_vec_ty tvar_0) false (* &'a Vec<T> *) ]
in
let output = mk_usize_ty (* usize *) in
{
region_params;
num_early_bound_regions = 0;
regions_hierarchy;
type_params;
inputs;
output;
}
(** Helper:
`fn<T>(&'a (mut) Vec<T>, usize) -> &'a (mut) T`
*)
let vec_index_gen_sig (is_mut : bool) : A.fun_sig =
(* The signature fields *)
let region_params = [ region_param_0 ] in
let regions_hierarchy = [ region_group_0 ] (* <'a> *) in
let type_params = [ type_param_0 ] (* <T> *) in
let inputs =
[
mk_ref_ty rvar_0 (mk_vec_ty tvar_0) is_mut (* &'a (mut) Vec<T> *);
mk_usize_ty;
(* usize *)
]
in
let output = mk_ref_ty rvar_0 tvar_0 is_mut (* &'a (mut) T *) in
{
region_params;
num_early_bound_regions = 0;
regions_hierarchy;
type_params;
inputs;
output;
}
(** `fn<T>(&'a Vec<T>, usize) -> &'a T` *)
let vec_index_shared_sig : A.fun_sig = vec_index_gen_sig false
(** `fn<T>(&'a mut Vec<T>, usize) -> &'a mut T` *)
let vec_index_mut_sig : A.fun_sig = vec_index_gen_sig true
end
type assumed_info = A.assumed_fun_id * A.fun_sig * bool * Identifiers.name
(** The list of assumed functions and all their information:
- their signature
- a boolean indicating whether they are monadic or not (i.e., if they
can fail or not)
- their name
Rk.: following what is written above, we don't include `Box::free`.
Remark about the vector functions: for `Vec::len` to be correct and return
a `usize`, we have to make sure that vectors are bounded by the max usize.
Followingly, `Vec::push` is monadic.
*)
let assumed_infos : assumed_info list =
let deref_pre = [ "core"; "ops"; "deref" ] in
let vec_pre = [ "alloc"; "vec"; "Vec" ] in
let index_pre = [ "core"; "ops"; "index" ] in
[
(Replace, Sig.mem_replace_sig, false, [ "core"; "mem"; "replace" ]);
(BoxNew, Sig.box_new_sig, false, [ "alloc"; "boxed"; "Box"; "new" ]);
(BoxDeref, Sig.box_deref_shared_sig, false, deref_pre @ [ "Deref"; "deref" ]);
( BoxDerefMut,
Sig.box_deref_mut_sig,
false,
deref_pre @ [ "DerefMut"; "deref_mut" ] );
(VecNew, Sig.vec_new_sig, false, vec_pre @ [ "new" ]);
(VecPush, Sig.vec_push_sig, true, vec_pre @ [ "push" ]);
(VecInsert, Sig.vec_insert_sig, true, vec_pre @ [ "insert" ]);
(VecLen, Sig.vec_len_sig, false, vec_pre @ [ "len" ]);
(VecIndex, Sig.vec_index_shared_sig, true, index_pre @ [ "Index"; "index" ]);
( VecIndexMut,
Sig.vec_index_mut_sig,
true,
index_pre @ [ "IndexMut"; "index_mut" ] );
]
let get_assumed_info (id : A.assumed_fun_id) : assumed_info =
List.find (fun (id', _, _, _) -> id = id') assumed_infos
let get_assumed_sig (id : A.assumed_fun_id) : A.fun_sig =
let _, sg, _, _ = get_assumed_info id in
sg
let get_assumed_name (id : A.assumed_fun_id) : Identifiers.fun_name =
let _, _, _, name = get_assumed_info id in
Identifiers.Regular name
let assumed_is_monadic (id : A.assumed_fun_id) : bool =
let _, _, b, _ = get_assumed_info id in
b
|