[llvm] [ScalarEvolution] Avoid recursive proof blowup for recurrence starts (PR #225000)

[via llvm-commits]

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 origin/main HEAD --extensions cpp -- llvm/lib/Analysis/ScalarEvolution.cpp --diff_from_common_commit
``````````

:warning:
The reproduction instructions above might return results for more than one PR
in a stack if you are using a stacked PR workflow. You can limit the results by
changing `origin/main` to the base branch/commit you want to compare against.
:warning:

</details>

<details>
<summary>
View the diff from clang-format here.
</summary>

``````````diff
diff --git a/llvm/lib/Analysis/ScalarEvolution.cpp b/llvm/lib/Analysis/ScalarEvolution.cpp
index 0067f0fe2..b0a4de387 100644
--- a/llvm/lib/Analysis/ScalarEvolution.cpp
+++ b/llvm/lib/Analysis/ScalarEvolution.cpp
@@ -13197,7 +13197,8 @@ bool ScalarEvolution::isKnownViaNonRecursiveReasoning(CmpPredicate Pred,
          isKnownPredicateViaConstantRanges(Pred, LHS, RHS) ||
          IsKnownPredicateViaMinOrMax(*this, Pred, LHS, RHS) ||
          IsKnownPredicateViaAddRecStart(
-             Pred, LHS, RHS, [&](const SCEV *LStart, const SCEV *RStart) {
+             Pred, LHS, RHS,
+             [&](const SCEV *LStart, const SCEV *RStart) {
                // Reentering the full predicate prover here can recursively
                // branch into induction proofs for a chain of recurrences.
                return isKnownViaNonRecursiveReasoning(Pred, LStart, RStart);

``````````

</details>


https://github.com/llvm/llvm-project/pull/225000