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
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
use crate::{
access_path::{AbsAddr, AccessPath, AccessPathMap, FootprintDomain, Offset, Root},
dataflow_domains::{AbstractDomain, JoinResult, MapDomain},
};
use im::ordmap::Entry;
use move_core_types::language_storage::TypeTag;
use move_model::{
ast::TempIndex,
model::{FunctionEnv, GlobalEnv},
ty::Type,
};
use std::{
fmt,
fmt::Formatter,
ops::{Deref, DerefMut},
};
#[derive(Debug, Clone, PartialOrd, PartialEq, Eq)]
pub struct TrieNode<T: FootprintDomain> {
data: Option<T>,
children: MapDomain<Offset, TrieNode<T>>,
}
#[derive(Debug, Clone, Eq, PartialEq, PartialOrd)]
pub struct AccessPathTrie<T: FootprintDomain>(MapDomain<Root, TrieNode<T>>);
impl<T: FootprintDomain> TrieNode<T> {
pub fn new(data: T) -> Self {
TrieNode {
data: Some(data),
children: MapDomain::default(),
}
}
pub fn new_opt(data: Option<T>) -> Self {
TrieNode {
data,
children: MapDomain::default(),
}
}
pub fn join_data_opt_(mut data: &mut Option<T>, other: &Option<T>) -> JoinResult {
match (&mut data, other) {
(Some(data1), Some(data2)) => data1.join(data2),
(None, Some(d)) => {
*data = Some(d.clone());
JoinResult::Changed
}
(_, None) => JoinResult::Unchanged,
}
}
pub fn join_data_opt(&mut self, other: &Option<T>) -> JoinResult {
Self::join_data_opt_(&mut self.data, other)
}
pub fn join_child_data(&self, mut acc: Option<T>) -> Option<T> {
Self::join_data_opt_(&mut acc, &self.data);
for v in self.children.values() {
acc = v.join_child_data(acc)
}
acc
}
pub fn get_child_data(&self) -> Option<T> {
self.join_child_data(None)
}
pub fn data(&self) -> &Option<T> {
&self.data
}
pub fn children(&self) -> &MapDomain<Offset, TrieNode<T>> {
&self.children
}
pub fn entry(&mut self, o: Offset) -> Entry<Offset, TrieNode<T>> {
self.children.entry(o)
}
pub fn get_offset(&self, o: &Offset) -> Option<&Self> {
self.children.get(o)
}
pub fn get_offset_mut(&mut self, o: &Offset) -> Option<&mut Self> {
self.children.get_mut(o)
}
pub fn remove_offset(&mut self, o: &Offset) -> Option<Self> {
self.children.remove(o)
}
pub fn keys_statically_known(&self) -> bool {
for (offset, child) in self.children.iter() {
if !offset.is_statically_known() || !child.keys_statically_known() {
return false;
}
}
true
}
pub fn substitute_footprint<F>(
mut self,
actuals: &[TempIndex],
type_actuals: &[Type],
func_env: &FunctionEnv,
sub_map: &dyn AccessPathMap<AbsAddr>,
mut sub_data: F,
) -> Self
where
F: FnMut(&mut T, &[TempIndex], &[Type], &FunctionEnv, &dyn AccessPathMap<AbsAddr>) + Copy,
{
match &mut self.data {
Some(d) => sub_data(d, actuals, type_actuals, func_env, sub_map),
None => (),
}
let mut acc = Self::new_opt(self.data);
for (mut k, v) in self.children.into_iter() {
k.substitute_footprint(type_actuals);
acc.children.insert_join(
k,
v.substitute_footprint(actuals, type_actuals, func_env, sub_map, sub_data),
);
}
acc
}
pub fn iter_values<F>(&mut self, f: F)
where
F: FnMut(&mut TrieNode<T>) + Copy,
{
self.children.update_values(f);
}
pub fn iter_offsets<F>(&self, mut f: F) -> F
where
F: FnMut(&Offset),
{
for (k, v) in self.children.iter() {
f(k);
f = v.iter_offsets(f);
}
f
}
fn iter_paths_opt<F>(&self, ap: &AccessPath, mut f: F) -> F
where
F: FnMut(&AccessPath, &Option<&T>),
{
f(ap, &self.data.as_ref());
for (k, v) in self.children.iter() {
let mut new_ap = ap.clone();
new_ap.add_offset(k.clone());
f = v.iter_paths_opt(&new_ap, f)
}
f
}
}
impl<T: FootprintDomain> AbstractDomain for TrieNode<T> {
fn join(&mut self, other: &Self) -> JoinResult {
let data_result = self.join_data_opt(&other.data);
let children_result = self.children.join(&other.children);
if data_result == JoinResult::Unchanged && children_result == JoinResult::Unchanged {
JoinResult::Unchanged
} else {
JoinResult::Changed
}
}
}
impl<T: FootprintDomain + PartialEq> AbstractDomain for AccessPathTrie<T> {
fn join(&mut self, other: &Self) -> JoinResult {
if self == other {
return JoinResult::Unchanged;
}
let mut acc = AccessPathTrie::default();
acc.join_footprint(self, other);
acc.join_footprint(other, self);
*self = acc;
JoinResult::Changed
}
}
impl<T: FootprintDomain> AccessPathMap<T> for AccessPathTrie<T> {
fn get_access_path(&self, ap: AccessPath) -> Option<&T> {
match self.get_node(ap) {
Some(n) => n.data.as_ref(),
None => None,
}
}
fn remove_access_path(&mut self, ap: AccessPath) -> Option<T> {
self.remove_node(ap).and_then(|n| n.data)
}
}
impl<T: FootprintDomain> AccessPathTrie<T> {
fn join_footprint(&mut self, t1: &Self, t2: &Self) {
t1.iter_paths_opt(|ap, data1_opt| {
let data2_opt = t2.get_access_path(ap.clone());
match (*data1_opt, data2_opt) {
(Some(data1), Some(data2)) => {
let mut new_data = data1.clone();
new_data.join(data2);
self.update_access_path_weak(ap.clone(), Some(new_data));
}
(None, Some(data)) | (Some(data), None) => {
let mut new_data = data.clone();
if let Some(footprint) = T::make_footprint(ap.clone()) {
new_data.join(&footprint);
}
self.update_access_path_weak(ap.clone(), Some(new_data));
}
(None, None) => (),
}
})
}
fn get_node(&self, ap: AccessPath) -> Option<&TrieNode<T>> {
let mut node = match self.0.get(ap.root()) {
Some(n) => n,
None => return None,
};
for offset in ap.offsets() {
node = match node.get_offset(offset) {
Some(n) => n,
None => return None,
}
}
Some(node)
}
pub fn remove_node(&mut self, ap: AccessPath) -> Option<TrieNode<T>> {
let mut node = self.0.get_mut(ap.root())?;
if ap.offsets().is_empty() {
if node.children.is_empty() {
return self.0.remove(ap.root());
} else {
node.data = None;
}
} else {
let offsets_count = ap.offsets().len();
for offset in &ap.offsets()[0..offsets_count - 1] {
node = node.get_offset_mut(offset)?;
}
let last_offset = &ap.offsets()[offsets_count - 1];
let to_remove = node.get_offset_mut(last_offset)?;
if to_remove.children.is_empty() {
return node.remove_offset(last_offset);
} else {
to_remove.data = None;
}
}
None
}
pub fn get_child_data(&self) -> Option<T> {
let mut acc = None;
for v in self.values() {
acc = v.join_child_data(acc)
}
acc
}
pub fn update_access_path_weak(&mut self, ap: AccessPath, data: Option<T>) {
self.update_access_path_(ap, TrieNode::new_opt(data), true)
}
pub fn update_access_path(&mut self, ap: AccessPath, data: Option<T>) {
self.update_access_path_(ap, TrieNode::new_opt(data), false)
}
pub fn join_access_path(&mut self, ap: AccessPath, node: TrieNode<T>) {
self.update_access_path_(ap, node, true)
}
fn update_access_path_(
&mut self,
ap: AccessPath,
new_node: TrieNode<T>,
mut weak_update: bool,
) {
let (root, offsets) = ap.into();
let needs_weak_update = match &root {
Root::Local(_) | Root::Formal(_) | Root::Return(_) => false,
Root::Global(g) => !g.is_statically_known(),
};
if needs_weak_update {
weak_update = true
};
let mut node = self.0.entry(root).or_insert_with(TrieNode::default);
for offset in offsets.into_iter() {
weak_update = weak_update || !offset.is_statically_known();
node = node.entry(offset).or_insert_with(TrieNode::default);
}
if weak_update {
node.join(&new_node);
} else {
*node = new_node
}
}
pub fn bind_local(&mut self, local_index: TempIndex, data: T, fun_env: &FunctionEnv) {
self.bind_root(Root::from_index(local_index, fun_env), data)
}
pub fn bind_local_node(
&mut self,
local_index: TempIndex,
node: TrieNode<T>,
fun_env: &FunctionEnv,
) {
self.0.insert(Root::from_index(local_index, fun_env), node);
}
pub fn remove_local(&mut self, local_index: TempIndex, fun_env: &FunctionEnv) {
self.0.remove(&Root::from_index(local_index, fun_env));
}
pub fn bind_return(&mut self, return_index: usize, data: T) {
self.bind_root(Root::ret(return_index), data)
}
fn bind_root(&mut self, root: Root, data: T) {
self.0.insert(root, TrieNode::new(data));
}
pub fn get_local(&self, local_index: TempIndex, fun_env: &FunctionEnv) -> Option<&T> {
self.get_local_node(local_index, fun_env)
.and_then(|n| n.data.as_ref())
}
pub fn get_local_node(
&self,
local_index: TempIndex,
fun_env: &FunctionEnv,
) -> Option<&TrieNode<T>> {
self.0.get(&Root::from_index(local_index, fun_env))
}
pub fn local_exists(&self, local_index: TempIndex, fun_env: &FunctionEnv) -> bool {
self.0.contains_key(&Root::from_index(local_index, fun_env))
}
pub fn keys_statically_known(&self) -> bool {
for (root, node) in self.0.iter() {
if !root.is_statically_known() || !node.keys_statically_known() {
return false;
}
}
true
}
pub fn substitute_footprint<F>(
self,
actuals: &[TempIndex],
type_actuals: &[Type],
func_env: &FunctionEnv,
sub_map: &dyn AccessPathMap<AbsAddr>,
sub_data: F,
) -> Self
where
F: FnMut(&mut T, &[TempIndex], &[Type], &FunctionEnv, &dyn AccessPathMap<AbsAddr>) + Copy,
{
let mut acc = Self::default();
for (mut k, v) in self.0.into_iter() {
k.substitute_footprint(actuals, type_actuals, func_env, sub_map);
let new_v = v.substitute_footprint(actuals, type_actuals, func_env, sub_map, sub_data);
acc.insert_join(k, new_v);
}
acc
}
pub fn substitute_footprint_skip_data(
self,
actuals: &[TempIndex],
type_actuals: &[Type],
func_env: &FunctionEnv,
sub_map: &dyn AccessPathMap<AbsAddr>,
) -> Self {
fn no_op<T>(
_: &mut T,
_: &[TempIndex],
_: &[Type],
_: &FunctionEnv,
_: &dyn AccessPathMap<AbsAddr>,
) {
}
self.substitute_footprint(actuals, type_actuals, func_env, sub_map, no_op)
}
pub fn substitute_footprint_concrete(
self,
actuals: &[TempIndex],
type_actuals: &[TypeTag],
func_env: &FunctionEnv,
sub_map: &dyn AccessPathMap<AbsAddr>,
env: &GlobalEnv,
) -> Self {
let types = type_actuals
.iter()
.map(|t| Type::from_type_tag(t, env))
.collect::<Vec<Type>>();
self.substitute_footprint_skip_data(actuals, &types, func_env, sub_map)
}
pub fn iter_values<F>(&mut self, mut f: F)
where
F: FnMut(&mut TrieNode<T>) + Copy,
{
self.update_values(|node| {
f(node);
node.iter_values(f);
});
}
pub fn iter_offsets<F>(&self, mut f: F)
where
F: FnMut(&Offset),
{
for (_k, node) in self.0.iter() {
f = node.iter_offsets(f)
}
}
pub fn iter_paths_opt<F>(&self, mut f: F)
where
F: FnMut(&AccessPath, &Option<&T>),
{
for (root, node) in self.iter() {
let ap = AccessPath::new_root(root.clone());
f = node.iter_paths_opt(&ap, f)
}
}
pub fn iter_paths<F>(&self, mut f: F)
where
F: FnMut(&AccessPath, &T),
{
self.iter_paths_opt(|ap, t_opt| {
t_opt.map(|t| f(ap, t));
})
}
pub fn filter_map_paths<F, R>(&self, mut f: F) -> Vec<R>
where
F: FnMut(&AccessPath, &T) -> Option<R>,
{
let mut results = vec![];
self.iter_paths(|a, b| {
if let Some(r) = f(a, b) {
results.push(r);
}
});
results
}
pub fn display<'a>(&'a self, env: &'a FunctionEnv) -> AccessPathTrieDisplay<'a, T> {
AccessPathTrieDisplay { t: self, env }
}
}
impl<T: FootprintDomain> Default for TrieNode<T> {
fn default() -> Self {
TrieNode {
data: None,
children: MapDomain::default(),
}
}
}
impl<T: FootprintDomain> Default for AccessPathTrie<T> {
fn default() -> Self {
AccessPathTrie(MapDomain::default())
}
}
impl<T: FootprintDomain> Deref for AccessPathTrie<T> {
type Target = MapDomain<Root, TrieNode<T>>;
fn deref(&self) -> &Self::Target {
&self.0
}
}
impl<T: FootprintDomain> DerefMut for AccessPathTrie<T> {
fn deref_mut(&mut self) -> &mut Self::Target {
&mut self.0
}
}
pub struct AccessPathTrieDisplay<'a, T: FootprintDomain> {
t: &'a AccessPathTrie<T>,
env: &'a FunctionEnv<'a>,
}
impl<'a, T: FootprintDomain> fmt::Display for AccessPathTrieDisplay<'a, T> {
fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
self.t
.iter_paths(|path, v| writeln!(f, "{}: {:?}", path.display(self.env), v).unwrap());
Ok(())
}
}