const Function &F = *From.getFunction();
bool Result = true;
if (From.getFunction() == To.getFunction())
- Result = isPotentiallyReachable(
- &From, &To, nullptr, AG.getAnalysis<DominatorTreeAnalysis>(F),
- AG.getAnalysis<LoopAnalysis>(F));
+ Result = isPotentiallyReachable(&From, &To, nullptr,
+ AG.getAnalysis<DominatorTreeAnalysis>(F),
+ AG.getAnalysis<LoopAnalysis>(F));
PotentiallyReachableMap.insert(std::make_pair(KeyPair, Result));
return Result;
}
bool Attributor::checkForAllUses(function_ref<bool(const Use &, bool &)> Pred,
const AbstractAttribute &QueryingAA,
- const Value &V,
- bool CheckBBLivenessOnly,
+ const Value &V, bool CheckBBLivenessOnly,
DepClassTy LivenessDepClass) {
// Check the trivial case first as it catches void values.
OS << '\n';
}
-raw_ostream &llvm::operator<<(raw_ostream &OS, const AAPointerInfo::Access &Acc) {
- OS << " ["<< Acc.getKind() << "] " << *Acc.getRemoteInst();
+raw_ostream &llvm::operator<<(raw_ostream &OS,
+ const AAPointerInfo::Access &Acc) {
+ OS << " [" << Acc.getKind() << "] " << *Acc.getRemoteInst();
if (Acc.getLocalInst() != Acc.getRemoteInst())
OS << " via " << *Acc.getLocalInst() << "\n";
return OS;
// Process any value that we might call.
auto ProcessCalledOperand = [&](Value *V, Instruction *Ctx) {
- if (!genericValueTraversal<bool>(
- A, IRPosition::value(*V), *this, HasUnknownCallee, VisitValue,
- nullptr, false)) {
+ if (!genericValueTraversal<bool>(A, IRPosition::value(*V), *this,
+ HasUnknownCallee, VisitValue, nullptr,
+ false)) {
// If we haven't gone through all values, assume that there are unknown
// callees.
HasUnknownCallee = true;