| /external/llvm/unittests/IR/ |
| D | DominatorTreeTest.cpp | 67 EXPECT_TRUE(DT->dominates(BB0, BB0)); in runOnFunction()
68 EXPECT_TRUE(DT->dominates(BB0, BB1)); in runOnFunction()
69 EXPECT_TRUE(DT->dominates(BB0, BB2)); in runOnFunction()
70 EXPECT_TRUE(DT->dominates(BB0, BB3)); in runOnFunction()
71 EXPECT_TRUE(DT->dominates(BB0, BB4)); in runOnFunction()
73 EXPECT_FALSE(DT->dominates(BB1, BB0)); in runOnFunction()
74 EXPECT_TRUE(DT->dominates(BB1, BB1)); in runOnFunction()
75 EXPECT_FALSE(DT->dominates(BB1, BB2)); in runOnFunction()
76 EXPECT_TRUE(DT->dominates(BB1, BB3)); in runOnFunction()
77 EXPECT_FALSE(DT->dominates(BB1, BB4)); in runOnFunction()
[all …]
|
| /external/llvm/lib/IR/ |
| D | Dominators.cpp | 77 bool DominatorTree::dominates(const Instruction *Def, in dominates() function in DominatorTree
99 return dominates(Def, UseBB); in dominates()
102 return dominates(DefBB, UseBB); in dominates()
114 bool DominatorTree::dominates(const Instruction *Def, in dominates() function in DominatorTree
134 return dominates(E, UseBB); in dominates()
137 return dominates(DefBB, UseBB); in dominates()
140 bool DominatorTree::dominates(const BasicBlockEdge &BBE, in dominates() function in DominatorTree
152 if (!dominates(End, UseBB)) in dominates()
186 if (!dominates(End, BB)) in dominates()
192 bool DominatorTree::dominates(const BasicBlockEdge &BBE, const Use &U) const { in dominates() function in DominatorTree
[all …]
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachinePostDominators.h | 56 bool dominates(const MachineDomTreeNode *A, in dominates() function
58 return DT->dominates(A, B); in dominates()
61 bool dominates(const MachineBasicBlock *A, const MachineBasicBlock *B) const { in dominates() function
62 return DT->dominates(A, B); in dominates()
|
| D | MachineDominators.h | 105 inline bool dominates(const MachineDomTreeNode* A, in dominates() function
108 return DT->dominates(A, B); in dominates()
111 inline bool dominates(const MachineBasicBlock* A, in dominates() function
114 return DT->dominates(A, B); in dominates()
119 bool dominates(const MachineInstr *A, const MachineInstr *B) const { in dominates() function
122 if (BBA != BBB) return DT->dominates(BBA, BBB); in dominates()
|
| D | LexicalScopes.h | 98 if (Parent && (!NewScope || !Parent->dominates(NewScope)))
103 bool dominates(const LexicalScope *S) const { in dominates() function
167 bool dominates(const DILocation *DL, MachineBasicBlock *MBB);
|
| /external/llvm/include/llvm/IR/ |
| D | Dominators.h | 115 using Base::dominates;
121 bool dominates(const Instruction *Def, const Use &U) const;
122 bool dominates(const Instruction *Def, const Instruction *User) const;
123 bool dominates(const Instruction *Def, const BasicBlock *BB) const;
124 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
125 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
|
| /external/llvm/include/llvm/Analysis/ |
| D | PostDominators.h | 57 inline bool dominates(DomTreeNode* A, DomTreeNode* B) const { in dominates() function
58 return DT->dominates(A, B); in dominates()
61 inline bool dominates(const BasicBlock* A, const BasicBlock* B) const { in dominates() function
62 return DT->dominates(A, B); in dominates()
|
| D | RegionInfoImpl.h | 115 return (DT->dominates(entry, BB) && in contains()
116 !(DT->dominates(exit, BB) && DT->dominates(entry, exit))); in contains()
564 if (DT->dominates(entry, P) && !DT->dominates(exit, P)) in isCommonDomFrontier()
580 if (!DT->dominates(entry, exit)) { in isRegion()
710 if (!DT->dominates(entry, exit)) in findRegionsWithEntry()
862 if (DT->dominates(Exit, BB)) in getMaxRegionExit()
|
| D | OrderedBasicBlock.h | 61 bool dominates(const Instruction *A, const Instruction *B);
|
| /external/llvm/test/Transforms/JumpThreading/ |
| D | assume-edge-dom.ll | 25 ; An assume that can be used to simplify this comparison dominates each
26 ; predecessor branch (although no assume dominates the cmp itself). Make sure
|
| /external/llvm/include/llvm/Support/ |
| D | GenericDomTree.h | 276 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) && in Split()
422 return dominates(A, B); in properlyDominates()
440 bool dominates(const DomTreeNodeBase<NodeT> *A, in dominates() function
476 bool dominates(const NodeT *A, const NodeT *B) const;
498 if (dominates(B, A)) in findNearestCommonDominator()
502 if (dominates(A, B)) in findNearestCommonDominator()
754 bool DominatorTreeBase<NodeT>::dominates(const NodeT *A, const NodeT *B) const { in dominates() function
761 return dominates(getNode(const_cast<NodeT *>(A)), in dominates()
773 return dominates(getNode(const_cast<NodeT *>(A)), in properlyDominates()
|
| /external/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyStoreResults.cpp | 104 if (!MDT.dominates(&MBB, Pred)) in runOnMachineFunction()
109 if (&MI == Where || !MDT.dominates(&MI, Where)) in runOnMachineFunction()
|
| D | WebAssemblyOptimizeReturned.cpp | 66 if (DT->dominates(Inst, U)) in visitCallSite()
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | Dominators.h | 109 inline bool dominates(const CFGBlock* A, const CFGBlock* B) const { in dominates() function
110 return DT->dominates(A, B); in dominates()
|
| /external/llvm/lib/Analysis/ |
| D | PHITransAddr.cpp | 210 (!DT || DT->dominates(CastI->getParent(), PredBB))) in PHITranslateSubExpr()
246 (!DT || DT->dominates(GEPI->getParent(), PredBB))) { in PHITranslateSubExpr()
299 (!DT || DT->dominates(BO->getParent(), PredBB))) in PHITranslateSubExpr()
330 if (!DT->dominates(Inst->getParent(), PredBB)) in PHITranslateValue()
|
| D | ScalarEvolutionExpander.cpp | 83 assert(SE.DT.dominates(Ret, &*BIP)); in ReuseOrCreateCast()
497 SE.DT.dominates(cast<Instruction>(V), &*Builder.GetInsertPoint())); in expandAddToGEP()
593 if (DT.dominates(A->getHeader(), B->getHeader())) return B; in PickMostRelevantLoop()
594 if (DT.dominates(B->getHeader(), A->getHeader())) return A; in PickMostRelevantLoop()
837 if (!SE.DT.dominates(OInst, IVIncInsertPos)) in isNormalAddRecExprPHI()
876 if (!OInst || SE.DT.dominates(OInst, InsertPos)) in getIVIncOperand()
887 if (!SE.DT.dominates(OInst, InsertPos)) in getIVIncOperand()
914 if (SE.DT.dominates(IncV, InsertPos)) in hoistIVInc()
920 !SE.DT.dominates(InsertPos->getParent(), IncV->getParent())) in hoistIVInc()
935 if (SE.DT.dominates(IncV, InsertPos)) in hoistIVInc()
[all …]
|
| D | CaptureTracking.cpp | 89 if (!OrderedBB->dominates(BeforeHere, I)) in isSafeToPrune()
110 if (BeforeHere != I && DT->dominates(BeforeHere, I) && in isSafeToPrune()
|
| D | ScalarEvolutionNormalization.cpp | 40 if (DT->dominates(LatchBlock, User->getParent())) in IVUseShouldUsePostIncValue()
55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i))) in IVUseShouldUsePostIncValue()
|
| D | OrderedBasicBlock.cpp | 65 bool OrderedBasicBlock::dominates(const Instruction *A, const Instruction *B) { in dominates() function in OrderedBasicBlock
|
| /external/llvm/lib/CodeGen/ |
| D | LexicalScopes.cpp | 257 if (PrevLexicalScope && !PrevLexicalScope->dominates(S)) in assignInstructionRanges()
295 bool LexicalScopes::dominates(const DILocation *DL, MachineBasicBlock *MBB) { in dominates() function in LexicalScopes
309 if (Scope->dominates(IScope)) in dominates()
|
| D | MachineSink.cpp | 251 if (!DT->dominates(MBB, UseBlock)) in AllUsesDominatedByBlock()
462 if (!DT->dominates(ToBB, *PI)) in PostponeSplitCriticalEdge()
507 if (!PDT->dominates(SuccToSinkTo, MBB)) in isProfitableToSinkTo()
740 if (!TryBreak && !DT->dominates(ParentBlock, SuccToSinkTo)) { in SinkInstruction()
|
| /external/llvm/lib/Target/AArch64/ |
| D | AArch64PromoteConstant.cpp | 351 if (NewPt == IPI.first || DT.dominates(IPI.first, NewPt) || in isDominated()
356 DT.dominates(IPI.first->getParent(), NewPt->getParent()))) { in isDominated()
502 assert(DT.dominates(LoadedCst, findInsertionPoint(*Use)) && in insertDefinitions()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | Sink.cpp | 93 if (!DT->dominates(BB, UseBlock)) in AllUsesDominatedByBlock()
215 if (!DT->dominates(Inst->getParent(), SuccToSinkTo)) in IsAcceptableTarget()
|
| /external/llvm/test/Transforms/PlaceSafepoints/ |
| D | call-in-loop.ll | 1 ; If there's a call in the loop which dominates the backedge, we
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LCSSA.cpp | 113 if (!DT.dominates(DomNode, DT.getNode(ExitBB))) in processInstruction()
213 if (DT.dominates(DomNode, DT.getNode(ExitBB))) in blockDominatesAnExit()
|