diff options
| author | Thomas Lively <tlively@google.com> | 2024-07-30 15:11:40 -0400 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-07-30 12:11:40 -0700 |
| commit | e2f666adbae7d5d431e3521ede5d9dd828f0cd97 (patch) | |
| tree | 15737b8370eab3d2a001dd9cf4c2a61224fb020d /src/passes/pass.cpp | |
| parent | 6645f0c05b8e9268f35742bb6b0a67e0a9c40795 (diff) | |
| download | binaryen-e2f666adbae7d5d431e3521ede5d9dd828f0cd97.tar.gz binaryen-e2f666adbae7d5d431e3521ede5d9dd828f0cd97.tar.bz2 binaryen-e2f666adbae7d5d431e3521ede5d9dd828f0cd97.zip | |
Add a Tarjan's Strongly Connected Component utilty (#6790)
Implement a non-recursive version of Tarjan's Strongly Connected
Component algorithm that consumes and produces iterators for maximum
flexibility.
This will be used in an optimization that transforms the heap type graph
to use minimal recursion groups, which correspond to the strongly
connected components of the type graph.
Diffstat (limited to 'src/passes/pass.cpp')
0 files changed, 0 insertions, 0 deletions