@@ -199,12 +199,12 @@ bool SimpleCaptureInfo::isNotCapturedBefore(const Value *Object,
199
199
return isNonEscapingLocalObject (Object, &IsCapturedCache);
200
200
}
201
201
202
- static bool isNotInCycle (const Instruction *I, const DominatorTree & DT,
202
+ static bool isNotInCycle (const Instruction *I, const DominatorTree * DT,
203
203
const LoopInfo *LI) {
204
204
BasicBlock *BB = const_cast <BasicBlock *>(I->getParent ());
205
205
SmallVector<BasicBlock *> Succs (successors (BB));
206
206
return Succs.empty () ||
207
- !isPotentiallyReachableFromMany (Succs, BB, nullptr , & DT, LI);
207
+ !isPotentiallyReachableFromMany (Succs, BB, nullptr , DT, LI);
208
208
}
209
209
210
210
bool EarliestEscapeInfo::isNotCapturedBefore (const Value *Object,
@@ -231,7 +231,7 @@ bool EarliestEscapeInfo::isNotCapturedBefore(const Value *Object,
231
231
if (I == Iter.first ->second ) {
232
232
if (OrAt)
233
233
return false ;
234
- return isNotInCycle (I, DT, LI);
234
+ return isNotInCycle (I, & DT, LI);
235
235
}
236
236
237
237
return !isPotentiallyReachable (Iter.first ->second , I, nullptr , &DT, LI);
@@ -1721,7 +1721,7 @@ bool BasicAAResult::isValueEqualInPotentialCycles(const Value *V,
1721
1721
if (!Inst || Inst->getParent ()->isEntryBlock ())
1722
1722
return true ;
1723
1723
1724
- return isNotInCycle (Inst, * DT, /* LI*/ nullptr );
1724
+ return isNotInCycle (Inst, DT, /* LI*/ nullptr );
1725
1725
}
1726
1726
1727
1727
// / Computes the symbolic difference between two de-composed GEPs.
0 commit comments