1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-02-01 05:01:59 +01:00
Daniel Sanders 67474bbe7f [gicombiner] Process the MatchDag such that every node is reachable from the roots
Summary:
When we build the walk across these DAG's we need to be able to reach every node
from the roots. Flip and traversal edges (so that use->def becomes def->uses)
that make nodes unreachable. Note that early on we'll just error out on these
flipped edges as def->uses edges are more complicated to match due to their
one->many nature.

Depends on D69077

Reviewers: volkan, bogner

Subscribers: llvm-commits
2019-12-17 17:03:24 +00:00
..
2019-12-17 15:28:35 +00:00
2019-11-19 09:54:07 +00:00
2019-01-03 14:11:33 +00:00
2019-01-03 14:11:33 +00:00
2019-01-03 14:11:33 +00:00
2019-01-03 14:12:30 +00:00
2019-01-03 14:12:44 +00:00
2019-01-03 14:11:33 +00:00