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
|
// Copyright 2017 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
use datafrog::{Iteration, Relation, RelationLeaper};
use std::time::Instant;
use crate::facts::FactTypes;
use crate::output::{Context, Output};
pub(super) fn compute<T: FactTypes>(
ctx: &Context<'_, T>,
result: &mut Output<T>,
) -> (
Relation<(T::Loan, T::Point)>,
Relation<(T::Origin, T::Origin)>,
) {
let timer = Instant::now();
let (potential_errors, potential_subset_errors) = {
// Static inputs
let origin_live_on_entry = &ctx.origin_live_on_entry;
let loan_invalidated_at = &ctx.loan_invalidated_at;
let placeholder_origin = &ctx.placeholder_origin;
let placeholder_loan = &ctx.placeholder_loan;
let known_contains = &ctx.known_contains;
// subset(Origin1, Origin2) :-
// subset_base(Origin1, Origin2, _).
let subset = Relation::from_iter(
ctx.subset_base
.iter()
.map(|&(origin1, origin2, _point)| (origin1, origin2)),
);
// Create a new iteration context, ...
let mut iteration = Iteration::new();
// .. some variables, ..
let origin_contains_loan_on_entry =
iteration.variable::<(T::Origin, T::Loan)>("origin_contains_loan_on_entry");
let potential_errors = iteration.variable::<(T::Loan, T::Point)>("potential_errors");
let potential_subset_errors =
iteration.variable::<(T::Origin, T::Origin)>("potential_subset_errors");
// load initial facts.
// origin_contains_loan_on_entry(Origin, Loan) :-
// loan_issued_at(Origin, Loan, _).
origin_contains_loan_on_entry.extend(
ctx.loan_issued_at
.iter()
.map(|&(origin, loan, _point)| (origin, loan)),
);
// origin_contains_loan_on_entry(Origin, Loan) :-
// placeholder_loan(Origin, Loan).
origin_contains_loan_on_entry.extend(
placeholder_loan
.iter()
.map(|&(loan, origin)| (origin, loan)),
);
// .. and then start iterating rules!
while iteration.changed() {
// origin_contains_loan_on_entry(Origin2, Loan) :-
// origin_contains_loan_on_entry(Origin1, Loan),
// subset(Origin1, Origin2).
//
// Note: Since `subset` is effectively a static input, this join can be ported to
// a leapjoin. Doing so, however, was 7% slower on `clap`.
origin_contains_loan_on_entry.from_join(
&origin_contains_loan_on_entry,
&subset,
|&_origin1, &loan, &origin2| (origin2, loan),
);
// loan_live_at(Loan, Point) :-
// origin_contains_loan_on_entry(Origin, Loan),
// origin_live_on_entry(Origin, Point)
//
// potential_errors(Loan, Point) :-
// loan_invalidated_at(Loan, Point),
// loan_live_at(Loan, Point).
//
// Note: we don't need to materialize `loan_live_at` here
// so we can inline it in the `potential_errors` relation.
//
potential_errors.from_leapjoin(
&origin_contains_loan_on_entry,
(
origin_live_on_entry.extend_with(|&(origin, _loan)| origin),
loan_invalidated_at.extend_with(|&(_origin, loan)| loan),
),
|&(_origin, loan), &point| (loan, point),
);
// potential_subset_errors(Origin1, Origin2) :-
// placeholder(Origin1, Loan1),
// placeholder(Origin2, _),
// origin_contains_loan_on_entry(Origin2, Loan1),
// !known_contains(Origin2, Loan1).
potential_subset_errors.from_leapjoin(
&origin_contains_loan_on_entry,
(
known_contains.filter_anti(|&(origin2, loan1)| (origin2, loan1)),
placeholder_origin.filter_with(|&(origin2, _loan1)| (origin2, ())),
placeholder_loan.extend_with(|&(_origin2, loan1)| loan1),
// remove symmetries:
datafrog::ValueFilter::from(|&(origin2, _loan1), &origin1| origin2 != origin1),
),
|&(origin2, _loan1), &origin1| (origin1, origin2),
);
}
if result.dump_enabled {
for &(origin1, origin2) in subset.iter() {
result
.subset_anywhere
.entry(origin1)
.or_default()
.insert(origin2);
}
let origin_contains_loan_on_entry = origin_contains_loan_on_entry.complete();
for &(origin, loan) in origin_contains_loan_on_entry.iter() {
result
.origin_contains_loan_anywhere
.entry(origin)
.or_default()
.insert(loan);
}
}
(
potential_errors.complete(),
potential_subset_errors.complete(),
)
};
info!(
"analysis done: {} `potential_errors` tuples, {} `potential_subset_errors` tuples, {:?}",
potential_errors.len(),
potential_subset_errors.len(),
timer.elapsed()
);
(potential_errors, potential_subset_errors)
}
|
