[PATCH] D69117: [gicombiner] Process the MatchDag such that every node is reachable from the roots

[Daniel Sanders via Phabricator via llvm-commits]

dsanders created this revision.
dsanders added reviewers: volkan, bogner.
Herald added a subscriber: dexonsmith.
Herald added a project: LLVM.

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 <https://reviews.llvm.org/D69077>


Repository:
  rG LLVM Github Monorepo

https://reviews.llvm.org/D69117

Files:
  llvm/include/llvm/ADT/iterator.h
  llvm/test/TableGen/GICombinerEmitter/parse-match-pattern.td
  llvm/utils/TableGen/GICombinerEmitter.cpp
  llvm/utils/TableGen/GlobalISel/GIMatchDag.h
  llvm/utils/TableGen/GlobalISel/GIMatchDagEdge.cpp
  llvm/utils/TableGen/GlobalISel/GIMatchDagEdge.h

-------------- next part --------------
A non-text attachment was scrubbed...
Name: D69117.225456.patch
Type: text/x-patch
Size: 8851 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20191017/92395249/attachment.bin>