[all-commits] [llvm/llvm-project] f84986: [MLIR] Reduce complexity of searching circular fun...

[Michele Scuttari via All-commits]

  Branch: refs/heads/main
  Home:   https://github.com/llvm/llvm-project
  Commit: f849866fc5e62091088e3e2b58214c614437ff68
      https://github.com/llvm/llvm-project/commit/f849866fc5e62091088e3e2b58214c614437ff68
  Author: Michele Scuttari <michele.scuttari at outlook.com>
  Date:   2025-06-06 (Fri, 06 Jun 2025)

  Changed paths:
    M mlir/lib/Dialect/Bufferization/Transforms/OneShotModuleBufferize.cpp

  Log Message:
  -----------
  [MLIR] Reduce complexity of searching circular function calls in bufferization (#142099)

The current algorithm searching for circular function calls scales quadratically due to the linear scan of the functions vector that is performed for each element of the vector itself. The PR replaces such algorithm with an O(V + E) version based on the Khan's algorithm for topological sorting, where V is the number of functions and E is the number of function calls.



To unsubscribe from these emails, change your notification settings at https://github.com/llvm/llvm-project/settings/notifications