[PATCH] D67970: [DDG] Data Dependence Graph - Root Node

[Bardia Mahjour via Phabricator via llvm-commits]

bmahjour created this revision.
bmahjour added reviewers: Meinersbur, fhahn, xtian, myhsu, kbarton, jdoerfert, dmgreen.
bmahjour added a project: LLVM.

This patch adds Root Node to the DDG. The purpose of the root node is to create a single entry node that allows graph walk iterators to iterate through **all** nodes of the graph, making sure that no node is left unvisited during a graph walk (eg. SCC or DFS). Once the DDG is fully constructed it will have exactly one root node. Every node in the graph is reachable from the root. The algorithm for connecting the root node is based on depth-first-search that keeps track of visited nodes to try to avoid creating unnecessary edges.

Previous related revisions:
https://reviews.llvm.org/D65350


Repository:
  rL LLVM

https://reviews.llvm.org/D67970

Files:
  llvm/include/llvm/Analysis/DDG.h
  llvm/include/llvm/Analysis/DependenceGraphBuilder.h
  llvm/lib/Analysis/DDG.cpp
  llvm/lib/Analysis/DependenceGraphBuilder.cpp
  llvm/test/Analysis/DDG/root-node.ll

-------------- next part --------------
A non-text attachment was scrubbed...
Name: D67970.221543.patch
Type: text/x-patch
Size: 9804 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20190924/21a3d350/attachment.bin>