[llvm] [SCEV] Add function to compute minium of countable exits. (PR #93498)
via llvm-commits
llvm-commits at lists.llvm.org
Mon May 27 20:21:27 PDT 2024
github-actions[bot] wrote:
<!--LLVM CODE FORMAT COMMENT: {clang-format}-->
:warning: C/C++ code formatter, clang-format found issues in your code. :warning:
<details>
<summary>
You can test this locally with the following command:
</summary>
``````````bash
git-clang-format --diff 0f08ef1b66cb3de81a10a237624e3e173b0c7c68 c354c6bb33a27c2388cf0b6f6a795ee841f58eca -- llvm/include/llvm/Analysis/ScalarEvolution.h llvm/lib/Analysis/ScalarEvolution.cpp
``````````
</details>
<details>
<summary>
View the diff from clang-format here.
</summary>
``````````diff
diff --git a/llvm/include/llvm/Analysis/ScalarEvolution.h b/llvm/include/llvm/Analysis/ScalarEvolution.h
index 4d75b9f616..bca68328c7 100644
--- a/llvm/include/llvm/Analysis/ScalarEvolution.h
+++ b/llvm/include/llvm/Analysis/ScalarEvolution.h
@@ -912,12 +912,14 @@ public:
return getBackedgeTakenCount(L, SymbolicMaximum);
}
- /// When successful, return the minimum of the exit counts for all countable exits, ignoring uncountable exits. This is an upper bound on the number of iterations of the loop.
+ /// When successful, return the minimum of the exit counts for all countable
+ /// exits, ignoring uncountable exits. This is an upper bound on the number
+ /// of iterations of the loop.
const SCEV *getBackedgeTakenCountForCountableExits(const Loop *L);
- /// Similar to getBackedgeTakenCountForCountableExits, except it will add a set of
- /// SCEV predicates to Predicates that are required to be true in order for
- /// the answer to be correct. Predicates can be checked with run-time
+ /// Similar to getBackedgeTakenCountForCountableExits, except it will add a
+ /// set of SCEV predicates to Predicates that are required to be true in order
+ /// for the answer to be correct. Predicates can be checked with run-time
/// checks and can be used to perform loop versioning.
const SCEV *getPredicatedBackedgeTakenCountForCountableExits(
const Loop *L, SmallVector<const SCEVPredicate *, 4> &Predicates);
@@ -2327,7 +2329,8 @@ public:
/// Get the (predicated) backedge count for the analyzed loop.
const SCEV *getBackedgeTakenCount();
- // Get the (predicated) minimum of the exit counts for all countable exits, ignoring uncountable exits.
+ // Get the (predicated) minimum of the exit counts for all countable exits,
+ // ignoring uncountable exits.
const SCEV *getBackedgeTakenCountForCountableExits();
/// Adds a new predicate.
``````````
</details>
https://github.com/llvm/llvm-project/pull/93498
More information about the llvm-commits
mailing list