Searched refs:PostDominatorTree (Results 1 - 10 of 10) sorted by relevance

/external/llvm/lib/Analysis/
H A DPostDominators.cpp26 // PostDominatorTree Implementation
29 char PostDominatorTree::ID = 0;
30 INITIALIZE_PASS(PostDominatorTree, "postdomtree",
33 bool PostDominatorTree::runOnFunction(Function &F) {
38 PostDominatorTree::~PostDominatorTree() {
42 void PostDominatorTree::print(raw_ostream &OS, const Module *) const {
48 return new PostDominatorTree();
H A DDomPrinter.cpp67 struct DOTGraphTraits<PostDominatorTree*>
73 static std::string getGraphName(PostDominatorTree *DT) {
77 std::string getNodeLabel(DomTreeNode *Node, PostDominatorTree *G ) {
115 : public DOTGraphTraitsViewer<PostDominatorTree, false> {
118 DOTGraphTraitsViewer<PostDominatorTree, false>("postdom", ID){
124 : public DOTGraphTraitsViewer<PostDominatorTree, true> {
127 DOTGraphTraitsViewer<PostDominatorTree, true>("postdomonly", ID){
178 : public DOTGraphTraitsPrinter<PostDominatorTree, false> {
181 DOTGraphTraitsPrinter<PostDominatorTree, false>("postdom", ID) {
187 : public DOTGraphTraitsPrinter<PostDominatorTree, tru
[all...]
H A DRegionInfo.cpp98 PostDominatorTree *PDT_, DominanceFrontier *DF_) {
131 auto PDT = &getAnalysis<PostDominatorTree>();
149 AU.addRequired<PostDominatorTree>();
168 INITIALIZE_PASS_DEPENDENCY(PostDominatorTree)
H A DDivergenceAnalysis.cpp88 PostDominatorTree &PDT, DenseSet<const Value *> &DV)
110 PostDominatorTree &PDT;
262 INITIALIZE_PASS_DEPENDENCY(PostDominatorTree)
272 AU.addRequired<PostDominatorTree>();
290 getAnalysis<PostDominatorTree>(), DivergentValues);
/external/llvm/include/llvm/Analysis/
H A DPostDominators.h21 /// PostDominatorTree Class - Concrete subclass of DominatorTree that is used to
24 struct PostDominatorTree : public FunctionPass { struct in namespace:llvm
28 PostDominatorTree() : FunctionPass(ID) { function in struct:llvm::PostDominatorTree
33 ~PostDominatorTree() override;
97 template <> struct GraphTraits<PostDominatorTree*>
99 static NodeType *getEntryNode(PostDominatorTree *DT) {
103 static nodes_iterator nodes_begin(PostDominatorTree *N) {
110 static nodes_iterator nodes_end(PostDominatorTree *N) {
H A DRegionInfo.h67 struct PostDominatorTree;
87 typedef PostDominatorTree PostDomTreeT;
846 void recalculate(Function &F, DominatorTree *DT, PostDominatorTree *PDT,
/external/llvm/lib/CodeGen/
H A DMachineRegionInfo.cpp107 AU.addRequired<PostDominatorTree>();
/external/llvm/unittests/IR/
H A DDominatorTreeTest.cpp32 PostDominatorTree *PDT = &getAnalysis<PostDominatorTree>();
209 AU.addRequired<PostDominatorTree>();
258 INITIALIZE_PASS_DEPENDENCY(PostDominatorTree)
/external/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp93 AU.addRequired<PostDominatorTree>();
94 AU.addPreserved<PostDominatorTree>();
140 PostDominatorTree *PDT;
150 INITIALIZE_PASS_DEPENDENCY(PostDominatorTree)
1279 PDT = &getAnalysis<PostDominatorTree>();
/external/llvm/include/llvm/Support/
H A DGenericDomTree.h66 struct PostDominatorTree;
76 friend struct PostDominatorTree;

Completed in 797 milliseconds