[llvm] [AMDGPU] Combine redundant ballot intrinsic calls (PR #218357)

[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/Target/AMDGPU/AMDGPUUniformIntrinsicCombine.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/Target/AMDGPU/AMDGPUUniformIntrinsicCombine.cpp b/llvm/lib/Target/AMDGPU/AMDGPUUniformIntrinsicCombine.cpp
index 6e9c22567..0d180cff4 100644
--- a/llvm/lib/Target/AMDGPU/AMDGPUUniformIntrinsicCombine.cpp
+++ b/llvm/lib/Target/AMDGPU/AMDGPUUniformIntrinsicCombine.cpp
@@ -255,7 +255,8 @@ static bool combineRedundantBallots(Function &F, UniformityInfo &UI,
   // Bucket the ballots by (result type, condition); only calls landing in the
   // same bucket can possibly be identical. Visiting the dominator tree in
   // pre-order means a dominating call always precedes the calls it dominates.
-  SmallMapVector<std::pair<Type *, Value *>, SmallVector<CallInst *, 4>, 4> Buckets;
+  SmallMapVector<std::pair<Type *, Value *>, SmallVector<CallInst *, 4>, 4>
+      Buckets;
   for (const DomTreeNode *N : depth_first(DT.getRootNode())) {
     for (Instruction &I : *N->getBlock()) {
       auto *CI = dyn_cast<CallInst>(&I);

``````````

</details>


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