[polly] [Polly] Data flow reduction detection to cover more cases (PR #84901)

via llvm-commits llvm-commits at lists.llvm.org
Thu Jul 25 21:58:07 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 341aecc2dd0f6debcbe9f251a6d2e8a60d327eea cec891d7e451d7dc58de07e3b5e194e0b5b0a102 --extensions cpp,h -- polly/include/polly/ScopBuilder.h polly/include/polly/ScopInfo.h polly/lib/Analysis/ScopBuilder.cpp polly/lib/Analysis/ScopInfo.cpp
``````````

</details>

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

``````````diff
diff --git a/polly/lib/Analysis/ScopBuilder.cpp b/polly/lib/Analysis/ScopBuilder.cpp
index 655542e0248..1e3fe961478 100644
--- a/polly/lib/Analysis/ScopBuilder.cpp
+++ b/polly/lib/Analysis/ScopBuilder.cpp
@@ -2590,11 +2590,11 @@ bool checkCandidatePairAccesses(MemoryAccess *LoadMA, MemoryAccess *StoreMA,
 }
 
 void ScopBuilder::checkForReductions(ScopStmt &Stmt) {
-// Perform a data flow analysis on the current scop statement to propagate the
-// uses of loaded values. Then check and mark the memory accesses which are
-// part of reduction like chains.
-//
-// NOTE: This assumes independent scop statements and breaks otherwise.
+  // Perform a data flow analysis on the current scop statement to propagate the
+  // uses of loaded values. Then check and mark the memory accesses which are
+  // part of reduction like chains.
+  //
+  // NOTE: This assumes independent scop statements and breaks otherwise.
 
   // During the data flow analysis we use the State variable to keep track of
   // the used "load-instructions" for each instruction in the scop statement.

``````````

</details>


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


More information about the llvm-commits mailing list