en Copyright 2015 Java http://172.16.0.5:8080/history/llvm-project-15.0.7/llvm/test/Analysis/DDG/root-node.ll#2dd82a1c [DDG] Data Dependence Graph - Topological Sort (Memory Leak Fix)Summary:This fixes the memory leak in bec37c3fc766a7b97f8c52c181c325fd47b75259and re-delivers the reverted patch.In this patch the DDG DAG is sorted topologically to put thenodes in the graph in the order that would satisfy alldependencies. This helps transformations that would like togenerate code based on the DDG. Since the DDG is a DAG areverse-post-order traversal would give us the topologicalordering. This patch also sorts the basic blocks passed tothe builder based on program order to ensure that thedependencies are computed in the correct direction.Authored By: bmahjourReviewer: Meinersbur, fhahn, myhsu, xtian, dmgreen, kbarton, jdoerfertReviewed By: MeinersburSubscribers: ychen, arphaman, simoll, a.elovikov, mgorny, hiraditya, jfb, wuzish, llvm-commits, jsji, Whitney, etiotto, ppc-slackTags: #llvmDifferential Revision: https://reviews.llvm.org/D70609 List of files: /llvm-project-15.0.7/llvm/test/Analysis/DDG/root-node.ll Mon, 02 Dec 2019 20:23:26 +0000 Bardia Mahjour <bmahjour@ca.ibm.com> http://172.16.0.5:8080/history/llvm-project-15.0.7/llvm/test/Analysis/DDG/root-node.ll#67f0685b Revert "[DDG] Data Dependence Graph - Topological Sort"Revert for now to look into the failures on x86This reverts commit bec37c3fc766a7b97f8c52c181c325fd47b75259. List of files: /llvm-project-15.0.7/llvm/test/Analysis/DDG/root-node.ll Mon, 25 Nov 2019 21:17:41 +0000 Bardia Mahjour <bmahjour@ca.ibm.com> http://172.16.0.5:8080/history/llvm-project-15.0.7/llvm/test/Analysis/DDG/root-node.ll#bec37c3f [DDG] Data Dependence Graph - Topological SortSummary:In this patch the DDG DAG is sorted topologically to put thenodes in the graph in the order that would satisfy alldependencies. This helps transformations that would like togenerate code based on the DDG. Since the DDG is a DAG areverse-post-order traversal would give us the topologicalordering. This patch also sorts the basic blocks passed tothe builder based on program order to ensure that thedependencies are computed in the correct direction.Authored By: bmahjourReviewer: Meinersbur, fhahn, myhsu, xtian, dmgreen, kbarton, jdoerfertReviewed By: MeinersburSubscribers: ychen, arphaman, simoll, a.elovikov, mgorny, hiraditya, jfb, wuzish, llvm-commits, jsji, Whitney, etiotto, ppc-slackTags: #llvmDifferential Revision: https://reviews.llvm.org/D70609 List of files: /llvm-project-15.0.7/llvm/test/Analysis/DDG/root-node.ll Mon, 25 Nov 2019 16:12:37 +0000 bmahjour <bmahjour@ca.ibm.com> http://172.16.0.5:8080/history/llvm-project-15.0.7/llvm/test/Analysis/DDG/root-node.ll#f0af11d8 [DDG] Data Dependence Graph - Pi Block Summary: This patch adds Pi Blocks to the DDG. A pi-block represents a group of DDG nodes that are part of a strongly-connected component of the graph. Replacing all the SCCs with pi-blocks results in an acyclic representation of the DDG. For example if we have: {a -> b}, {b -> c, d}, {c -> a} the cycle a -> b -> c -> a is abstracted into a pi-block "p" as follows: {p -> d} with "p" containing: {a -> b}, {b -> c}, {c -> a} In this implementation the edges between nodes that are part of the pi-block are preserved. The crossing edges (edges where one end of the edge is in the set of nodes belonging to an SCC and the other end is outside that set) are replaced with corresponding edges to/from the pi-block node instead. Authored By: bmahjour Reviewer: Meinersbur, fhahn, myhsu, xtian, dmgreen, kbarton, jdoerfert Reviewed By: Meinersbur Subscribers: ychen, arphaman, simoll, a.elovikov, mgorny, hiraditya, jfb, wuzish, llvm-commits, jsji, Whitney, etiotto, ppc-slack Tag: #llvm Differential Revision: https://reviews.llvm.org/D68827 List of files: /llvm-project-15.0.7/llvm/test/Analysis/DDG/root-node.ll Fri, 08 Nov 2019 20:05:06 +0000 bmahjour <bmahjour@ca.ibm.com> http://172.16.0.5:8080/history/llvm-project-15.0.7/llvm/test/Analysis/DDG/root-node.ll#91b62d5c [DDG] Data Dependence Graph - Root NodeSummary: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.Authored By: bmahjourReviewer: Meinersbur, fhahn, myhsu, xtian, dmgreen, kbarton, jdoerfertReviewed By: MeinersburSubscribers: ychen, arphaman, simoll, a.elovikov, mgorny, hiraditya, jfb, wuzish, llvm-commits, jsji, Whitney, etiotto, ppc-slackTag: #llvmDifferential Revision: https://reviews.llvm.org/D67970llvm-svn: 373386 List of files: /llvm-project-15.0.7/llvm/test/Analysis/DDG/root-node.ll Tue, 01 Oct 2019 19:32:42 +0000 Bardia Mahjour <bmahjour@ca.ibm.com>