1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-31 20:51:52 +01:00

[DDG] Break a cyclic dependency from Analysis to ScalarOpts

llvm-svn: 372240
This commit is contained in:
Benjamin Kramer 2019-09-18 18:04:45 +00:00
parent e732605b38
commit a1b459b553

View File

@ -16,9 +16,8 @@
#include "llvm/ADT/DirectedGraph.h" #include "llvm/ADT/DirectedGraph.h"
#include "llvm/Analysis/DependenceAnalysis.h" #include "llvm/Analysis/DependenceAnalysis.h"
#include "llvm/Analysis/DependenceGraphBuilder.h" #include "llvm/Analysis/DependenceGraphBuilder.h"
#include "llvm/Analysis/LoopPass.h" #include "llvm/Analysis/LoopAnalysisManager.h"
#include "llvm/IR/Instructions.h" #include "llvm/IR/Instructions.h"
#include "llvm/Transforms/Scalar/LoopPassManager.h"
#include <unordered_map> #include <unordered_map>
namespace llvm { namespace llvm {
@ -27,6 +26,7 @@ class DDGEdge;
using DDGNodeBase = DGNode<DDGNode, DDGEdge>; using DDGNodeBase = DGNode<DDGNode, DDGEdge>;
using DDGEdgeBase = DGEdge<DDGNode, DDGEdge>; using DDGEdgeBase = DGEdge<DDGNode, DDGEdge>;
using DDGBase = DirectedGraph<DDGNode, DDGEdge>; using DDGBase = DirectedGraph<DDGNode, DDGEdge>;
class LPMUpdater;
/// Data Dependence Graph Node /// Data Dependence Graph Node
/// The graph can represent the following types of nodes: /// The graph can represent the following types of nodes: