| /external/llvm/unittests/IR/ |
| DominatorTreeTest.cpp | 66 EXPECT_TRUE(DT->dominates(BB0, BB0));
67 EXPECT_TRUE(DT->dominates(BB0, BB1));
68 EXPECT_TRUE(DT->dominates(BB0, BB2));
69 EXPECT_TRUE(DT->dominates(BB0, BB3));
70 EXPECT_TRUE(DT->dominates(BB0, BB4));
72 EXPECT_FALSE(DT->dominates(BB1, BB0));
73 EXPECT_TRUE(DT->dominates(BB1, BB1));
74 EXPECT_FALSE(DT->dominates(BB1, BB2));
75 EXPECT_TRUE(DT->dominates(BB1, BB3));
76 EXPECT_FALSE(DT->dominates(BB1, BB4))
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachinePostDominators.h | 56 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);
|
| MachineDominators.h | 71 inline bool dominates(const MachineDomTreeNode* A, function in class:llvm::MachineDominatorTree
73 return DT->dominates(A, B);
76 inline bool dominates(const MachineBasicBlock* A, function in class:llvm::MachineDominatorTree
78 return DT->dominates(A, B);
81 // dominates - Return true if A dominates B. This performs the
83 bool dominates(const MachineInstr *A, const MachineInstr *B) const { function in class:llvm::MachineDominatorTree
85 if (BBA != BBB) return DT->dominates(BBA, BBB);
93 // A dominates B if it is found first in the basic block.
96 // // A post-dominates B if B is found first in the basic block
[all...] |
| LexicalScopes.h | 93 // If Parent dominates NewScope then do not close Parent's instruction
95 if (Parent && (!NewScope || !Parent->dominates(NewScope)))
99 /// dominates - Return true if current scope dominates given lexical scope.
100 bool dominates(const LexicalScope *S) const { function in class:llvm::LexicalScope
168 /// dominates - Return true if DebugLoc's lexical scope dominates at least one
170 bool dominates(DebugLoc DL, MachineBasicBlock *MBB);
|
| /external/llvm/lib/IR/ |
| Dominators.cpp | 77 // dominates - Return true if Def dominates a use in User. This performs
80 bool DominatorTree::dominates(const Instruction *Def, function in class:DominatorTree
97 // The value defined by an invoke dominates an instruction only if
98 // it dominates every instruction in UseBB.
99 // A PHI is dominated only if the instruction dominates every possible use
102 return dominates(Def, UseBB);
105 return dominates(DefBB, UseBB);
116 // note that dominates(Def, Def->getParent()) is false.
117 bool DominatorTree::dominates(const Instruction *Def function in class:DominatorTree
143 bool DominatorTree::dominates(const BasicBlockEdge &BBE, function in class:DominatorTree
194 bool DominatorTree::dominates(const BasicBlockEdge &BBE, const Use &U) const { function in class:DominatorTree
217 bool DominatorTree::dominates(const Instruction *Def, const Use &U) const { function in class:DominatorTree
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| PostDominators.h | 57 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);
|
| Trace.h | 79 bool dominates(const BasicBlock *B1, const BasicBlock *B2) const { function in class:llvm::Trace
|
| /external/llvm/include/llvm/IR/ |
| Dominators.h | 88 using Base::dominates;
90 /// \brief Return true if Def dominates a use in User.
94 bool dominates(const Instruction *Def, const Use &U) const;
95 bool dominates(const Instruction *Def, const Instruction *User) const;
96 bool dominates(const Instruction *Def, const BasicBlock *BB) const;
97 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
98 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
|
| /external/llvm/include/llvm/Support/ |
| GenericDomTree.h | 254 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) &&
285 // If NewBB strictly dominates other blocks, then it is now the immediate
363 /// properlyDominates - Returns true iff A dominates B and A != B.
372 return dominates(A, B);
389 /// dominates - Returns true iff A dominates B. Note that this is not a
392 inline bool dominates(const DomTreeNodeBase<NodeT> *A, function in class:llvm::DominatorTreeBase
394 // A node trivially dominates itself.
402 // And dominates nothing.
428 bool dominates(const NodeT *A, const NodeT *B) const
711 bool DominatorTreeBase<NodeT>::dominates(const NodeT *A, const NodeT *B) const { function in class:llvm::DominatorTreeBase
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 107 /// \brief This method tests if one CFGBlock dominates the other.
108 /// The method return true if A dominates B, false otherwise.
109 /// Note a block always dominates itself.
111 inline bool dominates(const CFGBlock* A, const CFGBlock* B) const { function in class:clang::DominatorTree
112 return DT->dominates(A, B);
115 /// \brief This method tests if one CFGBlock properly dominates the other.
116 /// The method return true if A properly dominates B, false otherwise.
|
| /external/llvm/lib/Analysis/ |
| RegionInfo.cpp | 122 return (DT->dominates(entry, BB)
123 && !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
407 if (!DT->dominates(getEntry(), *PI))
422 if (!DT->dominates(getEntry(), R->getExit()))
425 if (!DT->dominates(R->getExit(), *PI))
489 if (DT->dominates(entry, P) && !DT->dominates(exit, P))
503 if (!DT->dominates(entry, exit)) {
630 if (!DT->dominates(entry, exit)
[all...] |
| PHITransAddr.cpp | 209 (!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))
|
| ScalarEvolutionNormalization.cpp | 40 if (DT->dominates(LatchBlock, User->getParent()))
55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
|
| ScalarEvolutionExpander.cpp | 44 // where the uses will be added (only that it dominates it), we are
79 assert(SE.DT->dominates(Ret, BIP));
521 SE.DT->dominates(cast<Instruction>(V), Builder.GetInsertPoint()));
621 if (DT.dominates(A->getHeader(), B->getHeader())) return B;
622 if (DT.dominates(B->getHeader(), A->getHeader())) return A;
[all...] |
| AliasAnalysis.cpp | 405 // there is no need to explore the use if BeforeHere dominates use.
407 if (BeforeHere != I && DT->dominates(BeforeHere, I) &&
419 if (BeforeHere != I && DT->dominates(BeforeHere, I) &&
|
| CFG.cpp | 148 if (DT && DT->dominates(BB, StopBB))
|
| /external/llvm/lib/CodeGen/ |
| LexicalScopes.cpp | 273 if (PrevLexicalScope && !PrevLexicalScope->dominates(S))
309 /// dominates - Return true if DebugLoc's lexical scope dominates at least one
311 bool LexicalScopes::dominates(DebugLoc DL, MachineBasicBlock *MBB) { function in class:LexicalScopes
327 if (Scope->dominates(IScope))
|
| MachineSink.cpp | 202 // Check that it dominates.
203 if (!DT->dominates(MBB, UseBlock))
378 // sunk to dominates all the uses.
391 if (!DT->dominates(ToBB, *PI))
463 // If SuccToSinkTo post dominates then also it may be profitable if MI
516 // successor that dominates all the uses. However, there are cases where
643 if (!TryBreak && !DT->dominates(ParentBlock, SuccToSinkTo)) {
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64PromoteConstant.cpp | 117 /// Map an insertion point to all the uses it dominates.
123 /// Find the closest point that dominates the given Use.
134 /// \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
356 if (NewPt == IPI.first || DT.dominates(IPI.first, NewPt) ||
361 DT.dominates(IPI.first->getParent(), NewPt->getParent()))) {
455 // point in a common dominator or if NewPt dominates an existing one.
518 assert((DT.dominates(LoadedCst, cast<Instruction>(*Use)) ||
520 DT.dominates(LoadedCst, findInsertionPoint(Use)))) &
[all...] |
| AArch64AddressTypePromotion.cpp | 388 if (DT.dominates(Inst, Pt)) {
397 if (!DT.dominates(Pt, Inst))
|
| /external/llvm/lib/Transforms/Scalar/ |
| Sink.cpp | 92 // Check that it dominates.
93 if (!DT->dominates(BB, UseBlock))
205 if (!DT->dominates(Inst->getParent(), SuccToSinkTo))
|
| StructurizeCFG.cpp | 689 if (!DT->dominates(BB, PI->first))
710 if (!Dominated && DT->dominates(I->first, PrevNode->getEntry()))
801 bool EntryDominatesExit = DT->dominates(ParentRegion->getEntry(), Exit);
841 if (DT->dominates(II, User))
|
| /external/llvm/lib/Transforms/Utils/ |
| LCSSA.cpp | 87 // dominates
107 if (!DT.dominates(DomNode, DT.getNode(ExitBB)))
169 /// Return true if the specified block dominates at least
177 if (DT.dominates(DomNode, DT.getNode(ExitBlocks[i])))
|
| /external/libsepol/src/ |
| genusers.c | 170 /* Set the role and every role it dominates */
171 ebitmap_for_each_bit(&roldatum->dominates, rnode, bit) {
|
| /external/libsepol/tests/ |
| test-linker-roles.c | 36 * - dominates bitmap is correct
54 * value in its dominates ebitmap */
61 ebitmap_for_each_bit(&role->dominates, tnode, i) {
96 /* and only dominates itself */
117 /* and only dominates itself */
127 /* and only dominates itself */
141 /* and only dominates itself */
154 /* and only dominates itself */
166 /* and only dominates itself */
178 /* and only dominates itself *
[all...] |
