[Mlir-commits] [mlir] [Presburger] Avoid repeated hash lookups (NFC) (PR #107426)
llvmlistbot at llvm.org
llvmlistbot at llvm.org
Thu Sep 5 09:46:30 PDT 2024
llvmbot wrote:
<!--LLVM PR SUMMARY COMMENT-->
@llvm/pr-subscribers-mlir-presburger
Author: Kazu Hirata (kazutakahirata)
<details>
<summary>Changes</summary>
---
Full diff: https://github.com/llvm/llvm-project/pull/107426.diff
1 Files Affected:
- (modified) mlir/lib/Analysis/Presburger/IntegerRelation.cpp (+1-3)
``````````diff
diff --git a/mlir/lib/Analysis/Presburger/IntegerRelation.cpp b/mlir/lib/Analysis/Presburger/IntegerRelation.cpp
index 87204d2100713b..94af81f955e5a5 100644
--- a/mlir/lib/Analysis/Presburger/IntegerRelation.cpp
+++ b/mlir/lib/Analysis/Presburger/IntegerRelation.cpp
@@ -2367,10 +2367,8 @@ bool IntegerRelation::removeDuplicateConstraints() {
hashTable.insert({row, 0});
for (unsigned k = 1; k < ineqs; ++k) {
row = getInequality(k).drop_back();
- if (!hashTable.contains(row)) {
- hashTable.insert({row, k});
+ if (hashTable.try_emplace(row, k).second)
continue;
- }
// For identical cases, keep only the smaller part of the constant term.
unsigned l = hashTable[row];
``````````
</details>
https://github.com/llvm/llvm-project/pull/107426
More information about the Mlir-commits
mailing list