diff options
| author | Thomas Lively <tlively@google.com> | 2024-09-10 15:24:16 -0700 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-09-10 22:24:16 +0000 |
| commit | 1a2d26f4092897f88f8fc60fc7a4dee2083ae531 (patch) | |
| tree | 8cbf4ab801fef574ce1666b42aa296493dedba45 /src/passes/DeadCodeElimination.cpp | |
| parent | b0c955d4e5d1454dd9d6036d25ec9118146eee4c (diff) | |
| download | binaryen-1a2d26f4092897f88f8fc60fc7a4dee2083ae531.tar.gz binaryen-1a2d26f4092897f88f8fc60fc7a4dee2083ae531.tar.bz2 binaryen-1a2d26f4092897f88f8fc60fc7a4dee2083ae531.zip | |
Replace the old topological sort everywhere (#6902)
To avoid having two separate topological sort utilities in the code
base, replace remaining uses of the old DFS-based, CRTP topological sort
with the newer Kahn's algorithm implementation.
This would be NFC, except that the new topological sort produces a
different order than the old topological sort, so the output of some
passes is reordered.
Diffstat (limited to 'src/passes/DeadCodeElimination.cpp')
0 files changed, 0 insertions, 0 deletions