| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCContract.cpp | 54 DominatorTree *DT;
326 DT = &getAnalysis<DominatorTree>();
461 if (DT->isReachableFromEntry(U) && DT->dominates(Inst, U)) {
|
| /external/mksh/src/ |
| tree.c | 894 #define DT(x) case x: shf_puts(#x, shf); break;
899 DT(IOREAD)
900 DT(IOWRITE)
901 DT(IORDWR)
902 DT(IOHERE)
903 DT(IOCAT)
904 DT(IODUP)
936 #undef DT
|
| /external/llvm/include/llvm/Analysis/ |
| MemoryDependenceAnalysis.h | 327 DominatorTree *DT;
|
| ScalarEvolution.h | 235 /// DT - The dominator tree.
237 DominatorTree *DT;
[all...] |
| 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...] |
| /external/llvm/lib/Analysis/ |
| Lint.cpp | 105 DominatorTree *DT;
179 DT = &getAnalysis<DominatorTree>();
654 if (Value *W = SimplifyInstruction(Inst, TD, TLI, DT))
|
| InstructionSimplify.cpp | 47 const DominatorTree *DT;
50 const DominatorTree *dt) : TD(td), TLI(tli), DT(dt) {}
93 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) {
106 if (DT) {
107 if (!DT->isReachableFromEntry(P->getParent()))
109 if (!DT->isReachableFromEntry(I->getParent()))
111 return DT->dominates(I, P);
522 if (!ValueDominatesPHI(RHS, PI, Q.DT))
[all...] |
| ScalarEvolutionExpander.cpp | 79 assert(SE.DT->dominates(Ret, BIP));
521 SE.DT->dominates(cast<Instruction>(V), Builder.GetInsertPoint()));
623 DominatorTree &DT) {
628 if (DT.dominates(A->getHeader(), B->getHeader())) return B;
629 if (DT.dominates(B->getHeader(), A->getHeader())) return A;
657 L = PickMostRelevantLoop(L, getRelevantLoop(*I), *SE.DT);
668 *SE.DT);
678 DominatorTree &DT;
680 explicit LoopCompare(DominatorTree &dt) : DT(dt) {
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineCSE.cpp | 44 MachineDominatorTree *DT;
659 DT = &getAnalysis<MachineDominatorTree>();
660 return PerformCSE(DT->getRootNode());
|
| ShrinkWrapping.cpp | 403 MachineDominatorTree &DT = getAnalysis<MachineDominatorTree>();
500 if (! DT.dominates(MBB, ReturnBlocks[ri])) {
[all...] |
| StrongPHIElimination.cpp | 146 MachineDominatorTree *DT;
236 DT = &getAnalysis<MachineDominatorTree>();
264 for (df_iterator<MachineDomTreeNode*> DI = df_begin(DT->getRootNode()),
265 DE = df_end(DT->getRootNode()); DI != DE; ++DI) {
564 while (NewParent && (!DT->dominates(MRI->getVRegDef(NewParent), *BBI)
620 && (!DT->dominates(MRI->getVRegDef(NewParent)->getParent(), &MBB)
|
| MachineLICM.cpp | 75 MachineDominatorTree *DT; // Machine dominator tree for the cur loop
352 DT = &getAnalysis<MachineDominatorTree>();
375 MachineDomTreeNode *N = DT->getNode(CurLoop->getHeader());
640 if (!DT->dominates(BB, CurrentLoopExitingBlocks[i])) {
[all...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64InstrInfo.cpp | 710 MachineDominatorTree *DT = &getAnalysis<MachineDominatorTree>();
711 return VisitNode(DT->getRootNode(), 0);
|
| /external/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 48 DominatorTree *DT;
52 DSE() : FunctionPass(ID), AA(0), MD(0), DT(0) {
59 DT = &getAnalysis<DominatorTree>();
66 if (DT->isReachableFromEntry(I))
69 AA = 0; MD = 0; DT = 0;
642 BasicBlock *BB, DominatorTree *DT) {
650 if (DT->isReachableFromEntry(Pred))
698 FindUnconditionalPreds(Blocks, BB, DT);
|
| EarlyCSE.cpp | 277 DominatorTree *DT;
445 if (Value *V = SimplifyInstruction(Inst, TD, TLI, DT)) {
569 DT = &getAnalysis<DominatorTree>();
585 CurrentGeneration, DT->getRootNode(),
586 DT->getRootNode()->begin(),
587 DT->getRootNode()->end()));
|
| LICM.cpp | 104 DominatorTree *DT; // Dominator Tree for the current Loop.
211 DT = &getAnalysis<DominatorTree>();
269 SinkRegion(DT->getNode(L->getHeader()));
271 HoistRegion(DT->getNode(L->getHeader()));
494 if (!DT->dominates(I.getParent(), ExitBlocks[0])) {
545 if (!DT->dominates(InstOrigBB, ExitBlock))
648 if (!DT->dominates(Inst.getParent(), ExitBlocks[i]))
[all...] |
| MemCpyOptimizer.cpp | 680 DominatorTree &DT = getAnalysis<DominatorTree>();
682 if (!DT.dominates(cpyDestInst, C))
693 MR = AA.callCapturesBefore(C, cpyDest, srcSize, &DT);
[all...] |
| StructurizeCFG.cpp | 55 DominatorTree *DT;
66 DT = DomTree;
72 DomTreeNode *Node = DT->getNode(BB);
167 DominatorTree *DT;
466 NearestCommonDominator Dominator(DT);
541 NearestCommonDominator Dominator(DT);
608 Dominator = DT->findNearestCommonDominator(Dominator, BB);
614 DT->changeImmediateDominator(NewExit, Dominator);
625 DT->changeImmediateDominator(NewExit, BB);
636 DT->addNewBlock(Flow, Dominator)
[all...] |
| CodeGenPrepare.cpp | 82 DominatorTree *DT;
153 DT = getAnalysisIfAvailable<DominatorTree>();
227 if (ModifiedDT && DT)
228 DT->DT->recalculate(F);
438 if (DT && !ModifiedDT) {
439 BasicBlock *BBIDom = DT->getNode(BB)->getIDom()->getBlock();
440 BasicBlock *DestBBIDom = DT->getNode(DestBB)->getIDom()->getBlock();
441 BasicBlock *NewIDom = DT->findNearestCommonDominator(BBIDom, DestBBIDom);
442 DT->changeImmediateDominator(DestBB, NewIDom)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 170 if (DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()) {
171 if (DomTreeNode *DTN = DT->getNode(BB)) {
172 DomTreeNode *PredDTN = DT->getNode(PredBB);
176 DT->changeImmediateDominator(*DI, PredDTN);
178 DT->eraseNode(BB);
284 if (DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()) {
286 if (DomTreeNode *OldNode = DT->getNode(Old)) {
292 DomTreeNode *NewNode = DT->addNewBlock(New,Old);
295 DT->changeImmediateDominator(*I, NewNode);
340 DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()
[all...] |
| LoopSimplify.cpp | 79 DominatorTree *DT;
134 DT = &getAnalysis<DominatorTree>();
277 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
349 DomTreeNode *Node = DT->getNode(ExitingBlock);
354 DT->changeImmediateDominator(Child, Node->getIDom());
356 DT->eraseNode(ExitingBlock);
469 static PHINode *FindPHIToPartitionLoops(Loop *L, DominatorTree *DT,
474 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
557 PHINode *PN = FindPHIToPartitionLoops(L, DT, AA, LI);
617 if (DT->dominates(Header, P)
[all...] |
| Local.cpp | 512 DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>();
513 if (DT) {
514 BasicBlock *PredBBIDom = DT->getNode(PredBB)->getIDom()->getBlock();
515 DT->changeImmediateDominator(DestBB, PredBBIDom);
516 DT->eraseNode(PredBB);
[all...] |
| /frameworks/compile/slang/ |
| slang_rs_export_type.cpp | 704 RSExportPrimitiveType::DataType dt = local
706 switch (dt) {
887 bool RSExportPrimitiveType::IsRSMatrixType(DataType DT) {
888 return ((DT >= FirstRSMatrixType) && (DT <= LastRSMatrixType));
891 bool RSExportPrimitiveType::IsRSObjectType(DataType DT) {
892 return ((DT >= FirstRSObjectType) && (DT <= LastRSObjectType));
926 RSExportPrimitiveType::DataType DT = GetRSSpecificType(FT);
927 if (IsRSObjectType(DT)) {
[all...] |
| /external/clang/lib/Sema/ |
| SemaCast.cpp | [all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfCompileUnit.cpp | 537 DIDerivedType DT = DIDerivedType(Element);
538 StringRef fieldName = DT.getName();
[all...] |
