[Mlir-commits] [mlir] [mlir][affine] Use value bound inference to determine minimum/maximum trip counts in loop analysis (PR #128113)

[llvmlistbot at llvm.org]

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 HEAD~1 HEAD --extensions cpp,h -- mlir/include/mlir/Dialect/Affine/Analysis/LoopAnalysis.h mlir/lib/Dialect/Affine/Analysis/LoopAnalysis.cpp mlir/lib/Dialect/Affine/Utils/LoopUtils.cpp mlir/lib/Interfaces/ValueBoundsOpInterface.cpp
``````````

</details>

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

``````````diff
diff --git a/mlir/lib/Dialect/Affine/Analysis/LoopAnalysis.cpp b/mlir/lib/Dialect/Affine/Analysis/LoopAnalysis.cpp
index 85f6d16a1..f60293b6b 100644
--- a/mlir/lib/Dialect/Affine/Analysis/LoopAnalysis.cpp
+++ b/mlir/lib/Dialect/Affine/Analysis/LoopAnalysis.cpp
@@ -68,7 +68,7 @@ private:
   /// A node of a directed graph between MLIR Operations to model various
   /// relationships. This is meant to be used internally.
   struct DGNode {
-    DGNode(Operation *op) : op(op){};
+    DGNode(Operation *op) : op(op) {};
     Operation *op;
 
     // Start and finish visit numbers are standard in DFS to implement things

``````````

</details>


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