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

123

/external/llvm/unittests/IR/
H A DDominatorTreeTest.cpp63 EXPECT_TRUE(DT->dominates(BB0, BB0));
64 EXPECT_TRUE(DT->dominates(BB0, BB1));
65 EXPECT_TRUE(DT->dominates(BB0, BB2));
66 EXPECT_TRUE(DT->dominates(BB0, BB3));
67 EXPECT_TRUE(DT->dominates(BB0, BB4));
69 EXPECT_FALSE(DT->dominates(BB1, BB0));
70 EXPECT_TRUE(DT->dominates(BB1, BB1));
71 EXPECT_FALSE(DT->dominates(BB1, BB2));
72 EXPECT_TRUE(DT->dominates(BB1, BB3));
73 EXPECT_FALSE(DT->dominates(BB
[all...]
/external/llvm/include/llvm/CodeGen/
H A DMachinePostDominators.h57 bool dominates(const MachineDomTreeNode *A, function in struct:llvm::MachinePostDominatorTree
59 return DT->dominates(A, B);
62 bool dominates(const MachineBasicBlock *A, const MachineBasicBlock *B) const { function in struct:llvm::MachinePostDominatorTree
63 return DT->dominates(A, B);
H A DMachineDominators.h71 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
[all...]
H A DLexicalScopes.h74 /// dominates - Return true if DebugLoc's lexical scope dominates at least one
76 bool dominates(DebugLoc DL, MachineBasicBlock *MBB);
206 // If Parent dominates NewScope then do not close Parent's instruction
208 if (Parent && (!NewScope || !Parent->dominates(NewScope)))
212 /// dominates - Return true if current scope dominates given lexical scope.
213 bool dominates(const LexicalScope *S) const { function in class:llvm::LexicalScope
/external/llvm/lib/IR/
H A DDominators.cpp96 // dominates - Return true if Def dominates a use in User. This performs
99 bool DominatorTree::dominates(const Instruction *Def, function in class:DominatorTree
116 // The value defined by an invoke dominates an instruction only if
117 // it dominates every instruction in UseBB.
118 // A PHI is dominated only if the instruction dominates every possible use
121 return dominates(Def, UseBB);
124 return dominates(DefBB, UseBB);
135 // note that dominates(Def, Def->getParent()) is false.
136 bool DominatorTree::dominates(cons function in class:DominatorTree
162 bool DominatorTree::dominates(const BasicBlockEdge &BBE, function in class:DominatorTree
213 bool DominatorTree::dominates(const BasicBlockEdge &BBE, function in class:DominatorTree
237 bool DominatorTree::dominates(const Instruction *Def, 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 DDominators.h260 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) &&
291 // If NewBB strictly dominates other blocks, then it is now the immediate
349 /// properlyDominates - Returns true iff A dominates B and A != B.
358 return dominates(A, B);
375 /// dominates - Returns true iff A dominates B. Note that this is not a
378 inline bool dominates(const DomTreeNodeBase<NodeT> *A, function in class:llvm::DominatorTreeBase
380 // A node trivially dominates itself.
388 // And dominates nothing.
414 bool dominates(cons
682 bool DominatorTreeBase<NodeT>::dominates(const NodeT *A, const NodeT *B) { function in class:llvm::DominatorTreeBase
781 inline bool dominates(const DomTreeNode* A, const DomTreeNode* B) const { function in class:llvm::DominatorTree
785 inline bool dominates(const BasicBlock* A, const BasicBlock* B) const { function in class:llvm::DominatorTree
[all...]
H A DTrace.h79 bool dominates(const BasicBlock *B1, const BasicBlock *B2) const { function in class:llvm::Trace
/external/clang/include/clang/Analysis/Analyses/
H A DDominators.h101 /// \brief This method tests if one CFGBlock dominates the other.
102 /// The method return true if A dominates B, false otherwise.
103 /// Note a block always dominates itself.
105 inline bool dominates(const CFGBlock* A, const CFGBlock* B) const { function in class:clang::DominatorTree
106 return DT->dominates(A, B);
109 /// \brief This method tests if one CFGBlock properly dominates the other.
110 /// The method return true if A properly dominates B, false otherwise.
/external/llvm/lib/Analysis/
H A DRegionInfo.cpp126 return (DT->dominates(entry, BB)
127 && !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
405 if (!DT->dominates(getEntry(), *PI))
420 if (!DT->dominates(getEntry(), R->getExit()))
423 if (!DT->dominates(R->getExit(), *PI))
487 if (DT->dominates(entry, P) && !DT->dominates(exit, P))
501 if (!DT->dominates(entry, exit)) {
628 if (!DT->dominates(entr
[all...]
H A DPHITransAddr.cpp210 (!DT || DT->dominates(CastI->getParent(), PredBB)))
247 (!DT || DT->dominates(GEPI->getParent(), PredBB))) {
306 (!DT || DT->dominates(BO->getParent(), PredBB)))
331 if (!DT->dominates(Inst->getParent(), PredBB))
H A DScalarEvolutionNormalization.cpp40 if (DT->dominates(LatchBlock, User->getParent()))
55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
H A DScalarEvolutionExpander.cpp41 // 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()));
628 if (DT.dominates(A->getHeader(), B->getHeader())) return B;
629 if (DT.dominates(B->getHeader(), A->getHeader())) return A;
873 if (!SE.DT->dominates(OInst, IVIncInsertPos))
912 if (!OInst || SE.DT->dominates(OInst, InsertPos))
924 if (!SE.DT->dominates(OInst, InsertPos))
949 /// until we reach a value that dominates InsertPos.
951 if (SE.DT->dominates(Inc
[all...]
H A DAliasAnalysis.cpp383 // there is no need to explore the use if BeforeHere dominates use.
385 if (BeforeHere != I && DT->dominates(BeforeHere, I) &&
397 if (BeforeHere != I && DT->dominates(BeforeHere, I) &&
H A DCFG.cpp202 if (DT && DT->dominates(BB, StopBB))
/external/llvm/lib/CodeGen/
H A DLexicalScopes.cpp253 if (PrevLexicalScope && !PrevLexicalScope->dominates(S))
290 /// dominates - Return true if DebugLoc's lexical scope dominates at least one
292 bool LexicalScopes::dominates(DebugLoc DL, MachineBasicBlock *MBB) { function in class:LexicalScopes
308 if (Scope->dominates(IScope))
H A DMachineSink.cpp213 // Check that it dominates.
214 if (!DT->dominates(MBB, UseBlock))
369 // sunk to dominates all the uses.
382 if (!DT->dominates(ToBB, *PI))
457 // If SuccToSinkTo post dominates then also it may be profitable if MI
510 // successor that dominates all the uses. However, there are cases where
633 if (!TryBreak && !DT->dominates(ParentBlock, SuccToSinkTo)) {
/external/llvm/lib/Transforms/Scalar/
H A DSink.cpp91 // Check that it dominates.
92 if (!DT->dominates(BB, UseBlock))
202 if (!DT->dominates(Inst->getParent(), SuccToSinkTo))
H A DLICM.cpp494 if (!DT->dominates(I.getParent(), ExitBlocks[0])) {
545 if (!DT->dominates(InstOrigBB, ExitBlock))
632 // Otherwise we have to check to make sure that the instruction dominates all
646 // Verify that the block dominates each of the exit blocks of the loop.
648 if (!DT->dominates(Inst.getParent(), ExitBlocks[i]))
H A DStructurizeCFG.cpp684 if (!DT->dominates(BB, PI->first))
705 if (!Dominated && DT->dominates(I->first, PrevNode->getEntry()))
782 bool EntryDominatesExit = DT->dominates(ParentRegion->getEntry(), Exit);
828 if (DT->dominates(II, User))
/external/llvm/lib/Transforms/Utils/
H A DLCSSA.cpp103 /// BlockDominatesAnExit - Return true if the specified block dominates at least
110 if (DT->dominates(DomNode, DT->getNode(ExitBlocks[i])))
211 // along their unwind edge. The code below tests to see whether DomBB dominates
230 if (!DT->dominates(DomNode, DT->getNode(ExitBB))) continue;
/external/libsepol/src/
H A Dgenusers.c169 /* Set the role and every role it dominates */
170 ebitmap_for_each_bit(&roldatum->dominates, rnode, bit) {
H A Dservices.c175 ebitmap_get_bit(&r1->dominates,
180 ebitmap_get_bit(&r2->dominates,
186 (&r1->dominates, val2 - 1)
187 && !ebitmap_get_bit(&r2->dominates,
/external/libsepol/tests/
H A Dtest-linker-roles.c36 * - 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 itsel
[all...]
/external/checkpolicy/
H A Dpolicy_define.c2051 if (ebitmap_or(&new->dominates, &r1->dominates, &r2->dominates)) {
2064 ebitmap_destroy(&r1->dominates);
2071 ebitmap_destroy(&r2->dominates);
2091 if (ebitmap_get_bit(&(rdatum->dominates), rdp->s.value - 1)) {
2098 /* raise types and dominates from dominated role */
2099 ebitmap_for_each_bit(&rdp->dominates, node, i) {
2102 (&rdatum->dominates, i, TRUE))
2179 if (ebitmap_set_bit(&role->dominates, rol
[all...]

Completed in 330 milliseconds

123