@@ -107,12 +107,12 @@ module UfMake<LocationSig Location, UniversalFlowInput<Location> I> {
107
107
108
108
private module Scc = QlBuiltins:: EquivalenceRelation< FlowNode , sccEdge / 2 > ;
109
109
110
- private class TypeFlowScc = Scc:: EquivalenceClass ;
110
+ private class FlowScc = Scc:: EquivalenceClass ;
111
111
112
112
/** Holds if `n` is part of an SCC of size 2 or more represented by `scc`. */
113
- private predicate sccRepr ( FlowNode n , TypeFlowScc scc ) { scc = Scc:: getEquivalenceClass ( n ) }
113
+ private predicate sccRepr ( FlowNode n , FlowScc scc ) { scc = Scc:: getEquivalenceClass ( n ) }
114
114
115
- private predicate sccJoinStepNotNull ( FlowNode n , TypeFlowScc scc ) {
115
+ private predicate sccJoinStepNotNull ( FlowNode n , FlowScc scc ) {
116
116
exists ( FlowNode mid |
117
117
joinStepNotNull ( n , mid ) and
118
118
sccRepr ( mid , scc ) and
@@ -221,7 +221,7 @@ module UfMake<LocationSig Location, UniversalFlowInput<Location> I> {
221
221
}
222
222
223
223
private module SccJoinStep implements Edge {
224
- class Node = TypeFlowScc ;
224
+ class Node = FlowScc ;
225
225
226
226
predicate edge = sccJoinStepNotNull / 2 ;
227
227
}
@@ -256,11 +256,11 @@ module UfMake<LocationSig Location, UniversalFlowInput<Location> I> {
256
256
// `forex(FlowNode mid | joinStepNotNull(mid, n) | hasPropery(mid))`
257
257
ForAll< FlowNode , RankedJoinStep , Propagation > :: flowJoin ( n , _)
258
258
or
259
- exists ( TypeFlowScc scc |
259
+ exists ( FlowScc scc |
260
260
sccRepr ( n , scc ) and
261
261
// Optimized version of
262
262
// `forex(FlowNode mid | sccJoinStepNotNull(mid, scc) | hasPropery(mid))`
263
- ForAll< TypeFlowScc , RankedSccJoinStep , Propagation > :: flowJoin ( scc , _)
263
+ ForAll< FlowScc , RankedSccJoinStep , Propagation > :: flowJoin ( scc , _)
264
264
)
265
265
)
266
266
}
@@ -304,11 +304,11 @@ module UfMake<LocationSig Location, UniversalFlowInput<Location> I> {
304
304
// `forex(FlowNode mid | joinStepNotNull(mid, n) | hasPropery(mid, t))`
305
305
ForAll< FlowNode , RankedJoinStep , Propagation > :: flowJoin ( n , t )
306
306
or
307
- exists ( TypeFlowScc scc |
307
+ exists ( FlowScc scc |
308
308
sccRepr ( n , scc ) and
309
309
// Optimized version of
310
310
// `forex(FlowNode mid | sccJoinStepNotNull(mid, scc) | hasPropery(mid, t))`
311
- ForAll< TypeFlowScc , RankedSccJoinStep , Propagation > :: flowJoin ( scc , t )
311
+ ForAll< FlowScc , RankedSccJoinStep , Propagation > :: flowJoin ( scc , t )
312
312
)
313
313
)
314
314
}
0 commit comments