Searched refs:dominates (Results 1 - 25 of 80) sorted by relevance

1234

/external/llvm/unittests/IR/
H A DDominatorTreeTest.cpp67 EXPECT_TRUE(DT->dominates(BB0, BB0));
68 EXPECT_TRUE(DT->dominates(BB0, BB1));
69 EXPECT_TRUE(DT->dominates(BB0, BB2));
70 EXPECT_TRUE(DT->dominates(BB0, BB3));
71 EXPECT_TRUE(DT->dominates(BB0, BB4));
73 EXPECT_FALSE(DT->dominates(BB1, BB0));
74 EXPECT_TRUE(DT->dominates(BB1, BB1));
75 EXPECT_FALSE(DT->dominates(BB1, BB2));
76 EXPECT_TRUE(DT->dominates(BB1, BB3));
77 EXPECT_FALSE(DT->dominates(BB
[all...]
/external/llvm/include/llvm/CodeGen/
H A DMachinePostDominators.h56 bool dominates(const MachineDomTreeNode *A, function in struct:llvm::MachinePostDominatorTree
58 return DT->dominates(A, B);
61 bool dominates(const MachineBasicBlock *A, const MachineBasicBlock *B) const { function in struct:llvm::MachinePostDominatorTree
62 return DT->dominates(A, B);
H A DMachineDominators.h105 inline bool dominates(const MachineDomTreeNode* A, function in class:llvm::MachineDominatorTree
108 return DT->dominates(A, B);
111 inline bool dominates(const MachineBasicBlock* A, function in class:llvm::MachineDominatorTree
114 return DT->dominates(A, B);
117 // dominates - Return true if A dominates B. This performs the
119 bool dominates(const MachineInstr *A, const MachineInstr *B) const { function in class:llvm::MachineDominatorTree
122 if (BBA != BBB) return DT->dominates(BBA, BBB);
130 // A dominates B if it is found first in the basic block.
133 // // A post-dominates
[all...]
H A DLexicalScopes.h96 // If Parent dominates NewScope then do not close Parent's instruction
98 if (Parent && (!NewScope || !Parent->dominates(NewScope)))
102 /// dominates - Return true if current scope dominates given lexical scope.
103 bool dominates(const LexicalScope *S) const { function in class:llvm::LexicalScope
165 /// dominates - Return true if DebugLoc's lexical scope dominates at least one
167 bool dominates(const MDLocation *DL, MachineBasicBlock *MBB);
/external/llvm/lib/IR/
H A DDominators.cpp78 // dominates - Return true if Def dominates a use in User. This performs
81 bool DominatorTree::dominates(const Instruction *Def, function in class:DominatorTree
98 // The value defined by an invoke dominates an instruction only if
99 // it dominates every instruction in UseBB.
100 // A PHI is dominated only if the instruction dominates every possible use
103 return dominates(Def, UseBB);
106 return dominates(DefBB, UseBB);
117 // note that dominates(Def, Def->getParent()) is false.
118 bool DominatorTree::dominates(cons function in class:DominatorTree
144 bool DominatorTree::dominates(const BasicBlockEdge &BBE, function in class:DominatorTree
195 bool DominatorTree::dominates(const BasicBlockEdge &BBE, const Use &U) const { function in class:DominatorTree
218 bool DominatorTree::dominates(const Instruction *Def, const Use &U) const { function in class:DominatorTree
[all...]
/external/llvm/include/llvm/Analysis/
H A DPostDominators.h57 inline bool dominates(DomTreeNode* A, DomTreeNode* B) const { function in struct:llvm::PostDominatorTree
58 return DT->dominates(A, B);
61 inline bool dominates(const BasicBlock* A, const BasicBlock* B) const { function in struct:llvm::PostDominatorTree
62 return DT->dominates(A, B);
H A DTrace.h79 bool dominates(const BasicBlock *B1, const BasicBlock *B2) const { function in class:llvm::Trace
H A DRegionInfoImpl.h115 return (DT->dominates(entry, BB) &&
116 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
448 if (!DT->dominates(getEntry(), *PI))
463 if (!DT->dominates(getEntry(), R->getExit())) {
467 if (!DT->dominates(R->getExit(), *PI))
551 if (DT->dominates(entry, P) && !DT->dominates(exit, P))
567 if (!DT->dominates(entry, exit)) {
697 if (!DT->dominates(entr
[all...]
/external/llvm/include/llvm/IR/
H A DDominators.h100 using Base::dominates;
102 /// \brief Return true if Def dominates a use in User.
106 bool dominates(const Instruction *Def, const Use &U) const;
107 bool dominates(const Instruction *Def, const Instruction *User) const;
108 bool dominates(const Instruction *Def, const BasicBlock *BB) const;
109 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
110 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
/external/clang/include/clang/Analysis/Analyses/
H A DDominators.h105 /// \brief This method tests if one CFGBlock dominates the other.
106 /// The method return true if A dominates B, false otherwise.
107 /// Note a block always dominates itself.
109 inline bool dominates(const CFGBlock* A, const CFGBlock* B) const { function in class:clang::DominatorTree
110 return DT->dominates(A, B);
113 /// \brief This method tests if one CFGBlock properly dominates the other.
114 /// The method return true if A properly dominates B, false otherwise.
/external/llvm/lib/CodeGen/
H A DMachineDominators.cpp104 if (!DT->dominates(SuccDTNode, DT->getNode(PredBB))) {
115 // We know FromBB dominates NewBB.
H A DLexicalScopes.cpp257 if (PrevLexicalScope && !PrevLexicalScope->dominates(S))
293 /// dominates - Return true if DebugLoc's lexical scope dominates at least one
295 bool LexicalScopes::dominates(const MDLocation *DL, MachineBasicBlock *MBB) { function in class:LexicalScopes
309 if (Scope->dominates(IScope))
H A DMachineSink.cpp238 // Check that it dominates.
239 if (!DT->dominates(MBB, UseBlock))
429 // sunk to dominates all the uses.
442 if (!DT->dominates(ToBB, *PI))
486 if (!PDT->dominates(SuccToSinkTo, MBB))
490 // loop, even if the latter post-dominates the former (PR21115).
504 // If SuccToSinkTo post dominates then also it may be profitable if MI
694 if (!TryBreak && !DT->dominates(ParentBlock, SuccToSinkTo)) {
/external/llvm/lib/Target/AArch64/
H A DAArch64PromoteConstant.cpp119 /// Map an insertion point to all the uses it dominates.
125 /// Find the closest point that dominates the given Use.
136 /// \return true if one of the insertion point in InsertPts dominates NewPt,
154 /// Compute the minimal insertion points to dominates all the interesting
157 /// contains a list of all the uses it dominates within the related function
351 if (NewPt == IPI.first || DT.dominates(IPI.first, NewPt) ||
356 DT.dominates(IPI.first->getParent(), NewPt->getParent()))) {
449 // point in a common dominator or if NewPt dominates an existing one.
502 assert(DT.dominates(LoadedCst, findInsertionPoint(*Use)) &&
H A DAArch64AddressTypePromotion.cpp389 if (DT.dominates(Inst, Pt)) {
398 if (!DT.dominates(Pt, Inst))
/external/llvm/include/llvm/Support/
H A DGenericDomTree.h276 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) &&
307 // If NewBB strictly dominates other blocks, then it is now the immediate
411 /// properlyDominates - Returns true iff A dominates B and A != B.
420 return dominates(A, B);
435 /// dominates - Returns true iff A dominates B. Note that this is not a
438 bool dominates(const DomTreeNodeBase<NodeT> *A, function in class:llvm::DominatorTreeBase
440 // A node trivially dominates itself.
448 // And dominates nothing.
474 bool dominates(cons
752 bool DominatorTreeBase<NodeT>::dominates(const NodeT *A, const NodeT *B) const { function in class:llvm::DominatorTreeBase
[all...]
/external/llvm/lib/Analysis/
H A DPHITransAddr.cpp209 (!DT || DT->dominates(CastI->getParent(), PredBB)))
245 (!DT || DT->dominates(GEPI->getParent(), PredBB))) {
303 (!DT || DT->dominates(BO->getParent(), PredBB)))
328 if (!DT->dominates(Inst->getParent(), PredBB))
H A DCaptureTracking.cpp78 // there is no need to explore the use if BeforeHere dominates use.
80 if (BeforeHere != I && DT->dominates(BeforeHere, I) &&
98 if (BeforeHere != I && DT->dominates(BeforeHere, I) &&
H A DScalarEvolutionNormalization.cpp40 if (DT->dominates(LatchBlock, User->getParent()))
55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
H A DScalarEvolutionExpander.cpp46 // where the uses will be added (only that it dominates it), we are
81 assert(SE.DT->dominates(Ret, BIP));
484 SE.DT->dominates(cast<Instruction>(V), Builder.GetInsertPoint()));
585 if (DT.dominates(A->getHeader(), B->getHeader())) return B;
586 if (DT.dominates(B->getHeader(), A->getHeader())) return A;
830 if (!SE.DT->dominates(OInst, IVIncInsertPos))
869 if (!OInst || SE.DT->dominates(OInst, InsertPos))
881 if (!SE.DT->dominates(OInst, InsertPos))
906 /// until we reach a value that dominates InsertPos.
908 if (SE.DT->dominates(Inc
[all...]
H A DCFG.cpp148 if (DT && DT->dominates(BB, StopBB))
/external/llvm/lib/Transforms/Scalar/
H A DSink.cpp92 // Check that it dominates.
93 if (!DT->dominates(BB, UseBlock))
202 if (!DT->dominates(Inst->getParent(), SuccToSinkTo))
H A DNaryReassociate.cpp80 // dominates
244 if (DT->dominates(LHS, I)) {
H A DPlaceSafepoints.cpp208 // instruction in a block which is dominated by the Header and dominates the
215 assert(DT.dominates(Header, Pred) && "loop latch not dominated by header?");
389 // can place it as late as we want as long as it dominates all calls
594 if (DT.dominates(Succ, Term->getParent())) {
781 assert(DT.dominates(before, after) && "trivially true");
/external/llvm/lib/Transforms/Utils/
H A DLCSSA.cpp87 // dominates
108 if (!DT.dominates(DomNode, DT.getNode(ExitBB)))
201 /// Return true if the specified block dominates at least
209 if (DT.dominates(DomNode, DT.getNode(ExitBlocks[i])))

Completed in 368 milliseconds

1234