Searched refs:ExitCounts (Results 1 - 4 of 4) sorted by relevance
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopPredication.cpp | 1008 SmallVector<const SCEV *, 4> ExitCounts; local 1016 ExitCounts.push_back(ExitCount); 1018 if (ExitCounts.size() < 2) 1020 return SE.getUMinFromMismatchedTypes(ExitCounts);
|
H A D | IndVarSimplify.cpp | 2691 SmallVector<const SCEV*, 4> ExitCounts; local 2701 ExitCounts.push_back(ExitCount); 2704 if (ExitCounts.empty()) 2706 return SE.getUMinFromMismatchedTypes(ExitCounts);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolution.h | 1299 BackedgeTakenInfo(ArrayRef<EdgeExitInfo> ExitCounts, bool Complete, 1325 /// argument or not from the way the ExitCounts vector was computed.
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ScalarEvolution.cpp | 7067 ExitCounts, 7072 ExitNotTaken.reserve(ExitCounts.size()); 7074 ExitCounts.begin(), ExitCounts.end(), std::back_inserter(ExitNotTaken), 7107 SmallVector<EdgeExitInfo, 4> ExitCounts; 7114 // Compute the ExitLimit for each loop exit. Use this to populate ExitCounts 7135 // 1. For each exit that can be computed, add an entry to ExitCounts. 7142 ExitCounts.emplace_back(ExitBB, EL); 7177 return BackedgeTakenInfo(std::move(ExitCounts), CouldComputeBECount,
|
Completed in 88 milliseconds