| /external/llvm/unittests/VMCore/ |
| DominatorTreeTest.cpp | 19 DominatorTree *DT = &getAnalysis<DominatorTree>();
47 EXPECT_TRUE(DT->isReachableFromEntry(BB0));
48 EXPECT_TRUE(DT->isReachableFromEntry(BB1));
49 EXPECT_TRUE(DT->isReachableFromEntry(BB2));
50 EXPECT_FALSE(DT->isReachableFromEntry(BB3));
51 EXPECT_TRUE(DT->isReachableFromEntry(BB4));
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))
[all...] |
| /external/llvm/lib/Analysis/ |
| PostDominators.cpp | 35 DT->recalculate(F);
40 delete DT;
44 DT->print(OS);
|
| PHITransAddr.cpp | 147 const DominatorTree *DT) {
191 Value *PHIIn = PHITranslateSubExpr(Cast->getOperand(0), CurBB, PredBB, DT);
210 (!DT || DT->dominates(CastI->getParent(), PredBB)))
221 Value *GEPOp = PHITranslateSubExpr(GEP->getOperand(i), CurBB, PredBB, DT);
232 if (Value *V = SimplifyGEPInst(GEPOps, TD, TLI, DT)) {
247 (!DT || DT->dominates(GEPI->getParent(), PredBB))) {
269 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT);
288 if (Value *Res = SimplifyAddInst(LHS, RHS, isNSW, isNUW, TD, TLI, DT)) {
[all...] |
| ScalarEvolutionNormalization.cpp | 30 const Loop *L, DominatorTree *DT) {
40 if (DT->dominates(LatchBlock, User->getParent()))
55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
71 DominatorTree &DT;
77 ScalarEvolution &se, DominatorTree &dt):
78 Kind(kind), Loops(loops), SE(se), DT(dt) {}
122 if (IVUseShouldUsePostIncValue(User, OperandValToReplace, L, &DT)) {
220 DominatorTree &DT) {
221 PostIncTransform Transform(Kind, Loops, SE, DT);
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DominatorInternals.h | 34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT,
40 InfoRec &VInfo = DT.Info[DT.Roots[i]];
47 InfoRec &SuccVInfo = DT.Info[*SI];
50 N = DTDFSPass(DT, *SI, N);
64 DT.Info[BB];
71 DT.Vertex.push_back(BB); // Vertex[n] = V;
96 DT.Info[Succ];
108 Eval(DominatorTreeBase<typename GraphT::NodeType>& DT,
111 DT.Info[VIn]
[all...] |
| PostDominators.h | 26 DominatorTreeBase<BasicBlock>* DT;
30 DT = new DominatorTreeBase<BasicBlock>(true);
42 return DT->getRoots();
46 return DT->getRootNode();
50 return DT->getNode(BB);
54 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
66 return DT->properlyDominates(A, B);
70 return DT->properlyDominates(A, B)
[all...] |
| InstructionSimplify.h | 37 const DominatorTree *DT = 0);
44 const DominatorTree *DT = 0);
50 const DominatorTree *DT = 0);
56 const DominatorTree *DT = 0);
62 const DominatorTree *DT = 0);
68 const DominatorTree *DT = 0);
74 const DominatorTree *DT = 0);
80 const DominatorTree *DT = 0);
86 const DominatorTree *DT = 0);
93 const DominatorTree *DT = 0)
[all...] |
| PHITransAddr.h | 74 /// dominator tree DT is non-null, the translated value must dominate
77 const DominatorTree *DT);
87 const DominatorTree &DT,
98 const DominatorTree *DT);
106 BasicBlock *PredBB, const DominatorTree &DT,
|
| ScalarEvolutionNormalization.h | 74 DominatorTree &DT);
|
| Dominators.h | 183 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType>& DT,
239 void Split(DominatorTreeBase<typename GraphT::NodeType>& DT,
260 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) &&
261 DT.isReachableFromEntry(ND)) {
272 if (DT.isReachableFromEntry(PredBlocks[i])) {
284 if (DT.isReachableFromEntry(PredBlocks[i]))
285 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i]);
289 DomTreeNodeBase<NodeT> *NewBBNode = DT.addNewBlock(NewBB, NewBBIDom);
294 DomTreeNodeBase<NodeT> *NewBBSuccNode = DT.getNode(NewBBSucc);
295 DT.changeImmediateDominator(NewBBSuccNode, NewBBNode)
[all...] |
| DominanceFrontier.h | 172 DominatorTree &DT = getAnalysis<DominatorTree>();
173 Roots = DT.getRoots();
175 calculate(DT, DT[Roots[0]]);
184 const DomSetType &calculate(const DominatorTree &DT,
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineDominators.h | 43 DominatorTreeBase<MachineBasicBlock>* DT;
49 DominatorTreeBase<MachineBasicBlock>& getBase() { return *DT; }
58 return DT->getRoots();
62 return DT->getRoot();
66 return DT->getRootNode();
72 return DT->dominates(A, B);
76 return DT->dominates(A, B);
83 if (BBA != BBB) return DT->dominates(BBA, BBB);
90 //if(!DT.IsPostDominators) {
101 return DT->properlyDominates(A, B)
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 36 llvm::DominatorTreeBase<CFGBlock>* DT;
39 DT = new llvm::DominatorTreeBase<CFGBlock>(false);
43 delete DT;
46 llvm::DominatorTreeBase<CFGBlock>& getBase() { return *DT; }
51 return DT->getRoot();
57 return DT->getRootNode();
71 if (DT->compare(Other.getBase()))
82 DT->recalculate(*cfg);
92 if(DT->getNode(*I)->getIDom())
95 << DT->getNode(*I)->getIDom()->getBlock()->getBlockID(
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineDominators.cpp | 38 DT->recalculate(F);
46 DT = new DominatorTreeBase<MachineBasicBlock>(false);
50 delete DT;
54 DT->releaseMemory();
58 DT->print(OS);
|
| StackProtector.cpp | 44 DominatorTree *DT;
95 DT = getAnalysisIfAvailable<DominatorTree>();
243 if (DT && DT->isReachableFromEntry(BB)) {
244 DT->addNewBlock(NewBB, BB);
245 FailBBDom = FailBBDom ? DT->findNearestCommonDominator(FailBBDom, BB) :BB;
266 if (DT && FailBBDom)
267 DT->addNewBlock(FailBB, FailBBDom);
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| PromoteMemToReg.h | 40 DominatorTree &DT, AliasSetTracker *AST = 0);
|
| CodeExtractor.h | 48 DominatorTree *const DT;
69 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = 0,
76 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false);
82 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
|
| /frameworks/compile/slang/ |
| slang_rs_object_ref_count.h | 66 RSExportPrimitiveType::DataType DT,
94 RSExportPrimitiveType::DataType *DT,
97 // Return a zero-initializer expr of the type DT. This processes both
100 RSExportPrimitiveType::DataType DT,
120 RSExportPrimitiveType::DataType DT) {
121 slangAssert(RSExportPrimitiveType::IsRSObjectType(DT));
122 return RSSetObjectFD[(DT - RSExportPrimitiveType::FirstRSObjectType)];
130 RSExportPrimitiveType::DataType DT) {
131 slangAssert(RSExportPrimitiveType::IsRSObjectType(DT));
132 return RSClearObjectFD[(DT - RSExportPrimitiveType::FirstRSObjectType)]
[all...] |
| /external/clang/include/clang/Lex/ |
| DirectoryLookup.h | 67 DirectoryLookup(const DirectoryEntry *dir, SrcMgr::CharacteristicKind DT,
69 : DirCharacteristic(DT), UserSupplied(isUser),
77 DirectoryLookup(const HeaderMap *map, SrcMgr::CharacteristicKind DT,
79 : DirCharacteristic(DT), UserSupplied(isUser), LookupType(LT_HeaderMap),
|
| /external/llvm/lib/Transforms/Utils/ |
| LCSSA.cpp | 55 DominatorTree *DT;
81 assert(L->isLCSSAForm(*DT) && "LCSSA form not preserved!");
105 DominatorTree *DT) {
106 DomTreeNode *DomNode = DT->getNode(BB);
108 if (DT->dominates(DomNode, DT->getNode(ExitBlocks[i])))
119 DT = &getAnalysis<DominatorTree>();
144 if (!BlockDominatesAnExit(BB, ExitBlocks, DT))
160 assert(L->isLCSSAForm(*DT));
208 DomTreeNode *DomNode = DT->getNode(DomBB)
[all...] |
| Mem2Reg.cpp | 64 DominatorTree &DT = getAnalysis<DominatorTree>();
78 PromoteMemToReg(Allocas, DT);
|
| BreakCriticalEdges.cpp | 246 DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>();
251 if (DT == 0 && LI == 0 && PI == 0)
279 if (DT) {
280 DomTreeNode *TINode = DT->getNode(TIBB);
286 DomTreeNode *NewBBNode = DT->addNewBlock(NewBB, TIBB);
289 // If NewBBDominatesDestBB hasn't been computed yet, do so with DT.
291 DestBBNode = DT->getNode(DestBB);
293 if (DomTreeNode *OPNode = DT->getNode(OtherPreds.back()))
294 NewBBDominatesDestBB = DT->dominates(DestBBNode, OPNode);
303 if (!DestBBNode) DestBBNode = DT->getNode(DestBB)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopRotation.cpp | 248 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>())
249 DT->eraseNode(Latch);
409 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>()) {
414 DomTreeNode *OrigHeaderNode = DT->getNode(OrigHeader);
417 DomTreeNode *OrigPreheaderNode = DT->getNode(OrigPreheader);
419 DT->changeImmediateDominator(HeaderChildren[I], OrigPreheaderNode);
421 assert(DT->getNode(Exit)->getIDom() == OrigPreheaderNode);
422 assert(DT->getNode(NewHeader)->getIDom() == OrigPreheaderNode);
425 DT->changeImmediateDominator(OrigHeader, OrigLatch);
447 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>())
[all...] |
| /external/clang/lib/Lex/ |
| PPExpressions.cpp | 81 static bool EvaluateDefined(PPValue &Result, Token &PeekTok, DefinedTracker &DT,
145 DT.State = DefinedTracker::DefinedMacro;
146 DT.TheMacro = II;
153 /// expression in DT. See above for information on what DT means.
158 static bool EvaluateValue(PPValue &Result, Token &PeekTok, DefinedTracker &DT,
160 DT.State = DefinedTracker::Unknown;
175 return(EvaluateDefined(Result, PeekTok, DT, ValueLive, PP));
313 if (EvaluateValue(Result, PeekTok, DT, ValueLive, PP)) return true;
318 // Just use DT unmodified as our result
[all...] |
| /external/clang/test/SemaTemplate/ |
| default-arguments.cpp | 130 typename DT>
131 container<DT> initializer(const DT& d) {
132 return container<DT>();
|
