[Mlir-commits] [mlir] [mlir] Deterministic containers in BytecodeWriter (PR #187819)
llvmlistbot at llvm.org
llvmlistbot at llvm.org
Fri Mar 20 16:03:46 PDT 2026
llvmbot wrote:
<!--LLVM PR SUMMARY COMMENT-->
@llvm/pr-subscribers-mlir
Author: Colin He (CPlusMinus2000)
<details>
<summary>Changes</summary>
Iteration over use lists in writeUseListOrders is non-deterministic as a result of using a DenseMap. Replacing with a Vector-backed `MapVector` restores deterministic behaviour.
---
Full diff: https://github.com/llvm/llvm-project/pull/187819.diff
1 Files Affected:
- (modified) mlir/lib/Bytecode/Writer/BytecodeWriter.cpp (+2-5)
``````````diff
diff --git a/mlir/lib/Bytecode/Writer/BytecodeWriter.cpp b/mlir/lib/Bytecode/Writer/BytecodeWriter.cpp
index a04e3c3e3f177..6061d2adcbcec 100644
--- a/mlir/lib/Bytecode/Writer/BytecodeWriter.cpp
+++ b/mlir/lib/Bytecode/Writer/BytecodeWriter.cpp
@@ -1094,7 +1094,7 @@ void BytecodeWriter::writeUseListOrders(EncodingEmitter &emitter,
uint8_t &opEncodingMask,
ValueRange range) {
// Loop over the results and store the use-list order per result index.
- DenseMap<unsigned, llvm::SmallVector<unsigned>> map;
+ MapVector<unsigned, llvm::SmallVector<unsigned>> map;
for (auto item : llvm::enumerate(range)) {
auto value = item.value();
// No need to store a custom use-list order if the result does not have
@@ -1147,10 +1147,7 @@ void BytecodeWriter::writeUseListOrders(EncodingEmitter &emitter,
emitter.emitVarInt(map.size(), "custom use-list size");
}
- for (const auto &item : map) {
- auto resultIdx = item.getFirst();
- auto useListOrder = item.getSecond();
-
+ for (const auto &[resultIdx, useListOrder] : map) {
// Compute the number of uses that are actually shuffled. If those are less
// than half of the total uses, encoding the index pair `(src, dst)` is more
// space efficient.
``````````
</details>
https://github.com/llvm/llvm-project/pull/187819
More information about the Mlir-commits
mailing list