/external/llvm/lib/CodeGen/ |
GCStrategy.cpp | 274 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>()) 275 DT->DT->recalculate(F);
|
PeepholeOptimizer.cpp | 95 MachineDominatorTree *DT; // Machine dominator tree 238 } else if (Aggressive && DT->dominates(MBB, UseMBB)) { 491 DT = Aggressive ? &getAnalysis<MachineDominatorTree>() : 0;
|
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)
|
MachineCSE.cpp | 44 MachineDominatorTree *DT; 659 DT = &getAnalysis<MachineDominatorTree>(); 660 return PerformCSE(DT->getRootNode());
|
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/Transforms/Scalar/ |
CodeGenPrepare.cpp | 80 DominatorTree *DT; 150 DT = getAnalysisIfAvailable<DominatorTree>(); 224 if (ModifiedDT && DT) 225 DT->DT->recalculate(F); 435 if (DT && !ModifiedDT) { 436 BasicBlock *BBIDom = DT->getNode(BB)->getIDom()->getBlock(); 437 BasicBlock *DestBBIDom = DT->getNode(DestBB)->getIDom()->getBlock(); 438 BasicBlock *NewIDom = DT->findNearestCommonDominator(BBIDom, DestBBIDom); 439 DT->changeImmediateDominator(DestBB, NewIDom) [all...] |
LoopIdiomRecognize.cpp | 135 DominatorTree *DT; 143 TD = 0; DT = 0; SE = 0; TLI = 0; TTI = 0; 188 return DT ? DT : (DT=&getAnalysis<DominatorTree>()); 670 // set DT 735 if (!DT->dominates(BB, ExitBlocks[i])) [all...] |
LoopStrengthReduce.cpp | 818 ScalarEvolution &SE, DominatorTree &DT, 828 ScalarEvolution &SE, DominatorTree &DT); 832 ScalarEvolution &SE, DominatorTree &DT, 842 ScalarEvolution &SE, DominatorTree &DT) { 863 RateRegister(AR->getOperand(1), Regs, L, SE, DT); 890 ScalarEvolution &SE, DominatorTree &DT, 897 RateRegister(Reg, Regs, L, SE, DT); 908 ScalarEvolution &SE, DominatorTree &DT, 916 RatePrimaryRegister(ScaledReg, Regs, L, SE, DT, LoserRegs); [all...] |
MemCpyOptimizer.cpp | 674 DominatorTree &DT = getAnalysis<DominatorTree>(); 676 if (!DT.dominates(cpyDestInst, C)) 687 MR = AA.callCapturesBefore(C, cpyDest, srcSize, &DT); [all...] |
/external/llvm/lib/Analysis/ |
RegionPrinter.cpp | 64 static std::string getGraphName(RegionInfo *DT) {
|
LoopInfo.cpp | 176 bool Loop::isLCSSAForm(DominatorTree &DT) const { 197 DT.isReachableFromEntry(UserBB))
|
MemoryDependenceAnalysis.cpp | 93 DT = getAnalysisIfAvailable<DominatorTree>(); 518 MR = AA->callCapturesBefore(Inst, MemLoc, DT); [all...] |
Lint.cpp | 105 DominatorTree *DT; 179 DT = &getAnalysis<DominatorTree>(); 654 if (Value *W = SimplifyInstruction(Inst, TD, TLI, DT))
|
/external/llvm/lib/CodeGen/AsmPrinter/ |
DwarfCompileUnit.h | 370 DIE *createMemberDIE(DIDerivedType DT); 373 DIE *createStaticMemberDIE(DIDerivedType DT);
|
/external/webkit/LayoutTests/dom/html/level2/html/ |
HTMLElement112.js | 80 Retrieve the dir attribute of the DT element and examine its value. 99 nodeList = doc.getElementsByTagName("dt");
|
HTMLElement83.js | 80 Retrieve the lang attribute of the DT element and examine its value. 99 nodeList = doc.getElementsByTagName("dt");
|
/external/webkit/LayoutTests/dom/xhtml/level2/html/ |
HTMLElement112.js | 80 Retrieve the dir attribute of the DT element and examine its value. 99 nodeList = doc.getElementsByTagName("dt");
|
HTMLElement83.js | 80 Retrieve the lang attribute of the DT element and examine its value. 99 nodeList = doc.getElementsByTagName("dt");
|
/external/llvm/lib/Transforms/Vectorize/ |
LoopVectorize.cpp | 148 DominatorTree *DT, DataLayout *DL, 151 : OrigLoop(OrigLoop), SE(SE), LI(LI), DT(DT), DL(DL), TLI(TLI), 276 DominatorTree *DT; 333 DominatorTree *DT, TargetTransformInfo* TTI, 335 : TheLoop(L), SE(SE), DL(DL), DT(DT), TTI(TTI), AA(AA), TLI(TLI), 514 DominatorTree *DT; 648 DominatorTree *DT; 661 DT = &getAnalysis<DominatorTree>() [all...] |
/external/llvm/lib/Transforms/Utils/ |
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...] |
LoopUnroll.cpp | 415 if (DominatorTree *DT = LPM->getAnalysisIfAvailable<DominatorTree>()) 416 DT->runOnFunction(*L->getHeader()->getParent());
|
/external/llvm/include/llvm/Analysis/ |
MemoryDependenceAnalysis.h | 327 DominatorTree *DT;
|
ScalarEvolutionExpander.h | 132 unsigned replaceCongruentIVs(Loop *L, const DominatorTree *DT,
|
/frameworks/rs/driver/ |
rsdRuntimeStubs.cpp | 560 static void * ElementAt1D(Allocation *a, RsDataType dt, uint32_t vecSize, uint32_t x) { 579 if (dt != e->getType()) { 580 sprintf(buf, "Data type mismatch for ElementAt %i of %i", dt, e->getType()); 591 static void * ElementAt2D(Allocation *a, RsDataType dt, uint32_t vecSize, uint32_t x, uint32_t y) { 616 if (dt != e->getType()) { 617 sprintf(buf, "Data type mismatch for ElementAt %i of %i", dt, e->getType()); 629 static void * ElementAt3D(Allocation *a, RsDataType dt, uint32_t vecSize, uint32_t x, uint32_t y, uint32_t z) { 660 if (dt != e->getType()) { 661 sprintf(buf, "Data type mismatch for ElementAt %i of %i", dt, e->getType()); 708 #define ELEMENT_AT(T, DT, VS) [all...] |
/external/llvm/include/llvm/ |
DebugInfo.h | 755 void processType(DIType DT); 779 bool addType(DIType DT);
|