diff options
| author | wren romano <2998727+wrengr@users.noreply.github.com> | 2022-07-01 12:41:01 -0700 |
|---|---|---|
| committer | wren romano <2998727+wrengr@users.noreply.github.com> | 2022-07-01 12:55:09 -0700 |
| commit | 875ee0ed1c5af58cb4909f239093e25a35d7a21a (patch) | |
| tree | 2890d3825b9796538089460cddb402f5661b9191 /llvm/tools/llvm-objdump/llvm-objdump.cpp | |
| parent | b19cbda45a01807db0cd39ada302e27ac8e5ccb5 (diff) | |
| download | llvm-875ee0ed1c5af58cb4909f239093e25a35d7a21a.zip llvm-875ee0ed1c5af58cb4909f239093e25a35d7a21a.tar.gz llvm-875ee0ed1c5af58cb4909f239093e25a35d7a21a.tar.bz2 | |
[mlir][sparse] Reducing computational complexity
This is a followup to D128847. The `AffineMap::getPermutedPosition` method performs a linear scan of the map, thus the previous implementation had asymptotic complexity of `O(|topSort| * |m|)`. This change reduces that to `O(|topSort| + |m|)`.
Reviewed By: aartbik
Differential Revision: https://reviews.llvm.org/D129011
Diffstat (limited to 'llvm/tools/llvm-objdump/llvm-objdump.cpp')
0 files changed, 0 insertions, 0 deletions