[all-commits] [llvm/llvm-project] 875ee0: [mlir][sparse] Reducing computational complexity

[wren romano via All-commits]

  Branch: refs/heads/main
  Home:   https://github.com/llvm/llvm-project
  Commit: 875ee0ed1c5af58cb4909f239093e25a35d7a21a
      https://github.com/llvm/llvm-project/commit/875ee0ed1c5af58cb4909f239093e25a35d7a21a
  Author: wren romano <2998727+wrengr at users.noreply.github.com>
  Date:   2022-07-01 (Fri, 01 Jul 2022)

  Changed paths:
    M mlir/lib/Dialect/SparseTensor/Transforms/Sparsification.cpp

  Log Message:
  -----------
  [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