aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Transforms/Utils/CodeMoverUtils.cpp
diff options
context:
space:
mode:
authorDaniel Sanders <daniel_l_sanders@apple.com>2019-12-17 15:43:58 +0000
committerDaniel Sanders <daniel_l_sanders@apple.com>2019-12-17 17:03:24 +0000
commit520e3d66e7257c77f1226185504bbe1cb90afcfa (patch)
tree9278271f07f79a28ef5f8e6d2e169e431ee9f648 /llvm/lib/Transforms/Utils/CodeMoverUtils.cpp
parent65f94b33808d7d69539961a6f5a2168f0a1eef41 (diff)
downloadllvm-520e3d66e7257c77f1226185504bbe1cb90afcfa.zip
llvm-520e3d66e7257c77f1226185504bbe1cb90afcfa.tar.gz
llvm-520e3d66e7257c77f1226185504bbe1cb90afcfa.tar.bz2
[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
Diffstat (limited to 'llvm/lib/Transforms/Utils/CodeMoverUtils.cpp')
0 files changed, 0 insertions, 0 deletions