/external/llvm/unittests/VMCore/ |
H A D | DominatorTreeTest.cpp | 54 EXPECT_TRUE(DT->dominates(BB0, BB0)); 55 EXPECT_TRUE(DT->dominates(BB0, BB1)); 56 EXPECT_TRUE(DT->dominates(BB0, BB2)); 57 EXPECT_TRUE(DT->dominates(BB0, BB3)); 58 EXPECT_TRUE(DT->dominates(BB0, BB4)); 60 EXPECT_FALSE(DT->dominates(BB1, BB0)); 61 EXPECT_TRUE(DT->dominates(BB1, BB1)); 62 EXPECT_FALSE(DT->dominates(BB1, BB2)); 63 EXPECT_TRUE(DT->dominates(BB1, BB3)); 64 EXPECT_FALSE(DT->dominates(BB [all...] |
/external/llvm/lib/VMCore/ |
H A D | Dominators.cpp | 96 // 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 D | 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);
|
H A D | Dominators.h | 260 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 this dominates N and this != N. 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 683 bool DominatorTreeBase<NodeT>::dominates(const NodeT *A, const NodeT *B) { function in class:llvm::DominatorTreeBase 782 inline bool dominates(const DomTreeNode* A, const DomTreeNode* B) const { function in class:llvm::DominatorTree 786 inline bool dominates(const BasicBlock* A, const BasicBlock* B) const { function in class:llvm::DominatorTree [all...] |
H A D | Trace.h | 79 bool dominates(const BasicBlock *B1, const BasicBlock *B2) const { function in class:llvm::Trace
|
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineDominators.h | 71 inline bool dominates(MachineDomTreeNode* A, MachineDomTreeNode* B) const { function in class:llvm::MachineDominatorTree 72 return DT->dominates(A, B); 75 inline bool dominates(MachineBasicBlock* A, MachineBasicBlock* B) const { function in class:llvm::MachineDominatorTree 76 return DT->dominates(A, B); 79 // dominates - Return true if A dominates B. This performs the 81 bool dominates(MachineInstr *A, MachineInstr *B) const { function in class:llvm::MachineDominatorTree 83 if (BBA != BBB) return DT->dominates(BBA, BBB); 91 // A dominates B if it is found first in the basic block. 94 // // A post-dominates [all...] |
H A D | LexicalScopes.h | 74 /// dominates - Return true if DebugLoc's lexical scope dominates at least one 76 bool dominates(DebugLoc DL, MachineBasicBlock *MBB); 209 // If Parent dominates NewScope then do not close Parent's instruction 211 if (Parent && (!NewScope || !Parent->dominates(NewScope))) 215 /// dominates - Return true if current scope dominates given lexical scope. 216 bool dominates(const LexicalScope *S) const { function in class:llvm::LexicalScope
|
/external/clang/include/clang/Analysis/Analyses/ |
H A D | Dominators.h | 102 /// \brief This method tests if one CFGBlock dominates the other. 103 /// The method return true if A dominates B, false otherwise. 104 /// Note a block always dominates itself. 106 inline bool dominates(const CFGBlock* A, const CFGBlock* B) const { function in class:clang::DominatorTree 107 return DT->dominates(A, B); 110 /// \brief This method tests if one CFGBlock properly dominates the other. 111 /// The method return true if A properly dominates B, false otherwise.
|
/external/llvm/lib/Analysis/ |
H A D | RegionInfo.cpp | 94 return (DT->dominates(entry, BB) 95 && !(DT->dominates(exit, BB) && DT->dominates(entry, exit))); 373 if (!DT->dominates(getEntry(), *PI)) 388 if (!DT->dominates(getEntry(), R->getExit())) 391 if (!DT->dominates(R->getExit(), *PI)) 455 if (DT->dominates(entry, P) && !DT->dominates(exit, P)) 469 if (!DT->dominates(entry, exit)) { 596 if (!DT->dominates(entr [all...] |
H A D | PHITransAddr.cpp | 210 (!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 D | ScalarEvolutionNormalization.cpp | 40 if (DT->dominates(LatchBlock, User->getParent())) 55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
|
H A D | ScalarEvolutionExpander.cpp | 41 // where the uses will be added (only that it dominates it), we are 79 assert(SE.DT->dominates(Ret, BIP)); 522 SE.DT->dominates(cast<Instruction>(V), Builder.GetInsertPoint())); 629 if (DT.dominates(A->getHeader(), B->getHeader())) return B; 630 if (DT.dominates(B->getHeader(), A->getHeader())) return A; 875 if (!SE.DT->dominates(OInst, IVIncInsertPos)) 914 if (!OInst || SE.DT->dominates(OInst, InsertPos)) 926 if (!SE.DT->dominates(OInst, InsertPos)) 951 /// until we reach a value that dominates InsertPos. 953 if (SE.DT->dominates(Inc [all...] |
H A D | AliasAnalysis.cpp | 376 (!DT->isReachableFromEntry(BB) || DT->dominates(BeforeHere, I))) 385 (!DT->isReachableFromEntry(BB) || DT->dominates(BeforeHere, I)))
|
/external/llvm/lib/CodeGen/ |
H A D | LexicalScopes.cpp | 253 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 D | MachineSink.cpp | 214 // Check that it dominates. 215 if (!DT->dominates(MBB, UseBlock)) 371 // sunk to dominates all the uses. 384 if (!DT->dominates(ToBB, *PI)) 459 // If SuccToSinkTo post dominates then also it may be profitable if MI 512 // successor that dominates all the uses. However, there are cases where 635 if (!TryBreak && !DT->dominates(ParentBlock, SuccToSinkTo)) {
|
H A D | LiveRangeCalc.cpp | 282 // IDom dominates all of our predecessors, but it may not be their 307 if (DomTree->dominates(IDom, Value.second)) {
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | Sink.cpp | 91 // Check that it dominates. 92 if (!DT->dominates(BB, UseBlock)) 202 if (!DT->dominates(Inst->getParent(), SuccToSinkTo))
|
H A D | LICM.cpp | 492 if (!DT->dominates(I.getParent(), ExitBlocks[0])) { 543 if (!DT->dominates(InstOrigBB, ExitBlock)) 630 // Otherwise we have to check to make sure that the instruction dominates all 644 // Verify that the block dominates each of the exit blocks of the loop. 646 if (!DT->dominates(Inst.getParent(), ExitBlocks[i]))
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LCSSA.cpp | 101 /// BlockDominatesAnExit - Return true if the specified block dominates at least 108 if (DT->dominates(DomNode, DT->getNode(ExitBlocks[i]))) 201 // along their unwind edge. The code below tests to see whether DomBB dominates 220 if (!DT->dominates(DomNode, DT->getNode(ExitBB))) continue;
|
H A D | BreakCriticalEdges.cpp | 255 // the TIBB, TIBB clearly dominates NewBB. TIBB usually doesn't dominate 258 // loop header) then NewBB dominates DestBB. 294 NewBBDominatesDestBB = DT->dominates(DestBBNode, OPNode); 300 // If NewBBDominatesDestBB, then NewBB dominates DestBB, otherwise it
|
/external/libsepol/src/ |
H A D | genusers.c | 160 /* Set the role and every role it dominates */ 161 ebitmap_for_each_bit(&roldatum->dominates, rnode, bit) {
|
H A D | services.c | 174 ebitmap_get_bit(&r1->dominates, 179 ebitmap_get_bit(&r2->dominates, 185 (&r1->dominates, val2 - 1) 186 && !ebitmap_get_bit(&r2->dominates,
|
H A D | users.c | 169 /* Set the role and every role it dominates */ 170 ebitmap_for_each_bit(&roldatum->dominates, rnode, bit) {
|
/external/libsepol/tests/ |
H A D | 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 itsel [all...] |
/external/checkpolicy/ |
H A D | policy_define.c | 1955 if (ebitmap_or(&new->dominates, &r1->dominates, &r2->dominates)) { 1966 ebitmap_destroy(&r1->dominates); 1973 ebitmap_destroy(&r2->dominates); 1993 if (ebitmap_get_bit(&(rdatum->dominates), rdp->s.value - 1)) { 2000 /* raise types and dominates from dominated role */ 2001 ebitmap_for_each_bit(&rdp->dominates, node, i) { 2004 (&rdatum->dominates, i, TRUE)) 2081 if (ebitmap_set_bit(&role->dominates, rol [all...] |