Michele Scuttari f849866fc5 [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.

2025-06-06 10:35:58 +02:00

24 KiB

Raw Blame History

View Raw