| /external/llvm/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 161 DominatorTree *DT, AssumptionCache *AC,
232 !UnrollRuntimeLoopProlog(L, Count, AllowExpensiveTripCount, LI, SE, DT,
490 if (DT)
491 DT->recalculate(*L->getHeader()->getParent());
496 simplifyLoopIVs(L, SE, DT, LI, DeadInsts);
537 if (DT) {
541 bool Simplified = simplifyLoop(OuterL, DT, LI, SE, AC, PreserveLCSSA);
552 formLCSSARecursively(*OuterL, *DT, LI, SE);
554 assert(OuterL->isLCSSAForm(*DT) &&
|
| LoopUnrollRuntime.cpp | 65 ValueToValueMapTy &VMap, DominatorTree *DT,
130 SplitBlockPredecessors(Exit, Preds, ".unr-lcssa", DT, LI,
282 ScalarEvolution *SE, DominatorTree *DT,
338 BasicBlock *PEnd = SplitEdge(PH, Header, DT, LI);
339 BasicBlock *NewPH = SplitBlock(PEnd, PEnd->getTerminator(), DT, LI);
411 ConnectProlog(L, BECount, Count, LastLoopBB, PEnd, PH, NewPH, VMap, DT, LI,
|
| PromoteMemoryToRegister.cpp | 225 DominatorTree &DT;
271 PromoteMem2Reg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
273 : Allocas(Allocas.begin(), Allocas.end()), DT(DT),
274 DIB(*DT.getRoot()->getParent()->getParent(), /*AllowUnresolved*/ false),
338 DominatorTree &DT,
375 !DT.dominates(StoreBB, LI->getParent())) {
518 Function &F = *DT.getRoot()->getParent();
526 IDFCalculator IDF(DT);
556 if (rewriteSingleStoreAlloca(AI, Info, LBI, DT, AST))
[all...] |
| /external/llvm/include/llvm/Support/ |
| GenericDomTree.h | 179 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType> &DT,
253 void Split(DominatorTreeBase<typename GraphT::NodeType> &DT,
276 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) &&
277 DT.isReachableFromEntry(ND)) {
288 if (DT.isReachableFromEntry(PredBlocks[i])) {
300 if (DT.isReachableFromEntry(PredBlocks[i]))
301 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i]);
305 DomTreeNodeBase<NodeT> *NewBBNode = DT.addNewBlock(NewBB, NewBBIDom);
310 DomTreeNodeBase<NodeT> *NewBBSuccNode = DT.getNode(NewBBSucc);
311 DT.changeImmediateDominator(NewBBSuccNode, NewBBNode)
[all...] |
| CommandLine.h | 383 template <class DT> void setValue(const DT & /*V*/) {}
451 template <class DT> OptionValue<DataType> &operator=(const DT &V) {
695 template <class DT>
696 void addLiteralOption(const char *Name, const DT &V, const char *HelpStr) {
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| EarlyCSE.cpp | 269 DominatorTree &DT;
329 DominatorTree &DT, AssumptionCache &AC)
330 : TLI(TLI), TTI(TTI), DT(DT), AC(AC), CurrentGeneration(0) {}
534 replaceDominatedUsesWith(CondInst, ConditionalConstant, DT,
572 if (Value *V = SimplifyInstruction(Inst, DL, &TLI, &DT, &AC)) {
779 DT.getRootNode(), DT.getRootNode()->begin(), DT.getRootNode()->end()));
824 auto &DT = AM->getResult<DominatorTreeAnalysis>(F)
[all...] |
| LoopInstSimplify.cpp | 78 DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr;
125 Value *V = SimplifyInstruction(I, DL, TLI, DT, &AC);
|
| LoopUnswitch.cpp | 186 DominatorTree *DT;
201 currentLoop(nullptr), DT(nullptr), loopHeader(nullptr),
440 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
459 assert(currentLoop->isLCSSAForm(*DT));
466 DT->recalculate(*F);
750 auto Options = CriticalEdgeSplittingOptions(DT, LI).setPreserveLCSSA();
772 BasicBlock *NewPH = SplitEdge(loopPreheader, loopHeader, DT, LI);
783 BasicBlock *NewExit = SplitBlock(ExitBlock, &ExitBlock->front(), DT, LI);
[all...] |
| ConstantHoisting.cpp | 110 DominatorTree *DT;
123 ConstantHoisting() : FunctionPass(ID), TTI(nullptr), DT(nullptr),
141 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
153 DT = nullptr;
235 BasicBlock *IDom = DT->getNode(Inst->getParent())->getIDom()->getBlock();
256 BB = DT->findNearestCommonDominator(BB1, BB2);
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/metag/ |
| metadsp21.d | 73 .*: 00086182 DT ADD D0Re0,D0Re0,AC0\.0 T0,\[A0FrP\+A0FrP\+\+\]
75 .*: 0009c102 DT ADD D0Re0,D0Re0,D0Re0 \[A0FrP\+A0\.7\+\+\],T0
77 .*: 0009c142 DT ADD AC0\.0,AC0\.0,AC1\.0 \[A0FrP\+A0\.7\+\+\],T0
90 .*: 000a2182 DT ADD D0Re0,D0Re0,AC0\.0 T0,\[A0FrP\+A0\.8\+\+\]
92 .*: 000c0102 DT ADD D0Re0,D0Re0,D0Re0 \[A0FrP\],T0
94 .*: 000c0142 DT ADD AC0\.0,AC0\.0,AC1\.0 \[A0FrP\],T0
107 .*: 000c6182 DT ADD D0Re0,D0Re0,AC0\.0 T0,\[A0FrP\+\+\]
109 .*: 000cc102 DT ADD D0Re0,D0Re0,D0Re0 \[A0FrP--\],T0
111 .*: 000cc142 DT ADD AC0\.0,AC0\.0,AC1\.0 \[A0FrP--\],T0
141 .*: 00386182 DT ADD D0Re0,D0Re0,AC0\.0 T0,\[A0\.7\+A0FrP\+\+\
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineRegionInfo.h | 69 MachineDominatorTree *DT, MachineRegion *Parent = nullptr);
87 MachineDominatorTree *DT,
|
| /external/llvm/lib/Analysis/ |
| DomPrinter.cpp | 57 static std::string getGraphName(DominatorTree *DT) {
73 static std::string getGraphName(PostDominatorTree *DT) {
|
| LazyValueInfo.cpp | 363 DominatorTree *DT; ///< An optional DT pointer.
463 DominatorTree *DT = nullptr)
464 : AC(AC), DL(DL), DT(DT) {}
796 if (!isValidAssumeForContext(I, BBI, DT))
[all...] |
| ScalarEvolutionExpander.cpp | 83 assert(SE.DT.dominates(Ret, &*BIP));
497 SE.DT.dominates(cast<Instruction>(V), &*Builder.GetInsertPoint()));
588 DominatorTree &DT) {
593 if (DT.dominates(A->getHeader(), B->getHeader())) return B;
594 if (DT.dominates(B->getHeader(), A->getHeader())) return A;
620 L = PickMostRelevantLoop(L, getRelevantLoop(Op), SE.DT);
629 getRelevantLoop(D->getLHS()), getRelevantLoop(D->getRHS()), SE.DT);
639 DominatorTree &DT;
641 explicit LoopCompare(DominatorTree &dt) : DT(dt) {
[all...] |
| DemandedBits.cpp | 89 AC, UserI, DT);
95 0, AC, UserI, DT);
267 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
|
| Lint.cpp | 111 DominatorTree *DT;
186 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
507 static bool isZero(Value *V, const DataLayout &DL, DominatorTree *DT,
518 dyn_cast<Instruction>(V), DT);
548 Assert(!isZero(I.getOperand(1), I.getModule()->getDataLayout(), DT, AC),
553 Assert(!isZero(I.getOperand(1), I.getModule()->getDataLayout(), DT, AC),
558 Assert(!isZero(I.getOperand(1), I.getModule()->getDataLayout(), DT, AC),
563 Assert(!isZero(I.getOperand(1), I.getModule()->getDataLayout(), DT, AC),
682 if (Value *W = SimplifyInstruction(Inst, *DL, TLI, DT, AC))
|
| /external/llvm/include/llvm/Analysis/ |
| LoopAccessAnalysis.h | 513 DominatorTree *DT, LoopInfo *LI,
533 DominatorTree *DT);
619 DominatorTree *DT;
705 DominatorTree *DT;
|
| RegionInfo.h | 269 DomTreeT *DT;
303 /// @param DT The dominator tree of the current function.
306 RegionBase(BlockT *Entry, BlockT *Exit, RegionInfoT *RI, DomTreeT *DT,
679 DomTreeT *DT;
828 Region(BasicBlock *Entry, BasicBlock *Exit, RegionInfo *RI, DominatorTree *DT,
846 void recalculate(Function &F, DominatorTree *DT, PostDominatorTree *PDT,
[all...] |
| IVUsers.h | 125 DominatorTree *DT;
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonGenExtract.cpp | 71 DominatorTree *DT;
213 DomTreeNode *DTN = DT->getNode(B);
245 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
|
| HexagonCommonGEP.cpp | 139 DominatorTree *DT;
299 // Compute block ordering for a typical DT-based traversal of the flow
304 DomTreeNode *DTN = DT->getNode(Root);
394 // The creation of gep nodes requires DT-traversal. When processing a GEP
653 BasicBlock *nearest_common_dominator(DominatorTree *DT, T &Blocks) {
673 Dom = B ? DT->findNearestCommonDominator(Dom, B) : 0;
682 BasicBlock *nearest_common_dominatee(DominatorTree *DT, T &Blocks) {
690 return DT->getRoot();
696 if (DT->dominates(B, DomB))
698 if (!DT->dominates(DomB, B)
[all...] |
| /frameworks/compile/slang/ |
| slang_rs_export_type.cpp | 842 DataType dt = RSExportPrimitiveType::GetRSSpecificType(TypeName); local
843 switch (dt) {
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| SIAnnotateControlFlow.cpp | 67 DominatorTree *DT;
173 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
239 BasicBlock *IDom = DT->getNode(Parent)->getIDom()->getBlock();
315 BB = llvm::SplitBlockPredecessors(BB, Preds, "endcf.split", DT, LI, false);
324 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
|
| /external/llvm/lib/CodeGen/ |
| MachineSink.cpp | 60 MachineDominatorTree *DT; // Machine dominator tree
251 if (!DT->dominates(MBB, UseBlock))
267 DT = &getAnalysis<MachineDominatorTree>();
317 if (!DT->isReachableFromEntry(&MBB)) return false;
462 if (!DT->dominates(ToBB, *PI))
560 DT->getNode(MBB)->getChildren();
740 if (!TryBreak && !DT->dominates(ParentBlock, SuccToSinkTo)) {
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64AddressTypePromotion.cpp | 381 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
391 if (DT.dominates(Inst, Pt)) {
400 if (!DT.dominates(Pt, Inst))
|
