[llvm] [SLP][REVEC] reorderNodeWithReuses should not be called if all users of a TreeEntry are ShuffleVectorInst. (PR #118260)

[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 010317e1731d76b91c00ed1241583e518380d65f 1d738c0a576de988cb321601ce2dbf3c8727eb0f --extensions cpp -- llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp
``````````

</details>

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

``````````diff
diff --git a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp
index d2aeb413cb..33657c2635 100644
--- a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp
+++ b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp
@@ -6084,10 +6084,10 @@ void BoUpSLP::reorderTopToBottom() {
                 }))
               continue;
             assert(none_of(TE->UserTreeIndices,
-                          [&](const EdgeInfo &EI) {
-                            return isa<ShuffleVectorInst>(
-                                EI.UserTE->getMainOp());
-                          }) &&
+                           [&](const EdgeInfo &EI) {
+                             return isa<ShuffleVectorInst>(
+                                 EI.UserTE->getMainOp());
+                           }) &&
                    "Does not know how to reorder.");
           }
           // Update ordering of the operands with the smaller VF than the given

``````````

</details>


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