| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 203 DominatorTree& DT = getAnalysis<DominatorTree>();
209 ChildNodes.insert(ChildNodes.begin(), DT[*LI]->begin(), DT[*LI]->end());
212 DT.changeImmediateDominator(*DI, DT[preheader]);
216 DT.eraseNode(*LI);
|
| /frameworks/compile/libbcc/lib/ |
| RSInvokeHelperPass.cpp | 121 bool insertSetObjectHelper(llvm::CallInst *Call, llvm::Value *V, enum RsDataType DT) {
124 switch (DT) {
202 enum RsDataType DT = RS_TYPE_NONE;
204 DT = getRsDataTypeForType(T->getPointerElementType());
206 if (DT != RS_TYPE_NONE) {
208 changed |= insertSetObjectHelper(call, V, DT);
|
| /external/llvm/lib/Transforms/Scalar/ |
| GuardWidening.cpp | 62 DominatorTree &DT;
206 explicit GuardWideningImpl(DominatorTree &DT, PostDominatorTree &PDT,
208 : DT(DT), PDT(PDT), LI(LI) {}
247 for (auto DFI = df_begin(DT.getRootNode()), DFE = df_end(DT.getRootNode());
329 assert(DT.dominates(BestSoFar, GuardInst) && "Should be!");
372 if (!Inst || DT.dominates(Inst, Loc) || Visited.count(Inst))
375 if (!isSafeToSpeculativelyExecute(Inst, Loc, &DT) ||
384 assert(DT.isReachableFromEntry(Inst->getParent()) &
[all...] |
| LoopLoadElimination.cpp | 113 DominatorTree *DT) {
118 return DT->dominates(StoreBlock, Latch);
131 DominatorTree *DT)
132 : L(L), LI(LI), LAI(LAI), DT(DT), PSE(LAI.getPSE()) {}
455 if (!doesStoreDominatesAllLatches(Cand.Store->getParent(), L, DT))
505 LoopVersioning LV(LAI, L, LI, DT, PSE.getSE(), false);
532 DominatorTree *DT;
550 auto *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
568 LoadEliminationForLoop LEL(L, LI, LAI, DT);
[all...] |
| SeparateConstOffsetFromGEP.cpp | 221 User *&UserChainTail, const DominatorTree *DT);
226 const DominatorTree *DT);
229 ConstantOffsetExtractor(Instruction *InsertionPt, const DominatorTree *DT)
230 : IP(InsertionPt), DL(InsertionPt->getModule()->getDataLayout()), DT(DT) {
311 const DominatorTree *DT;
322 : FunctionPass(ID), DL(nullptr), DT(nullptr), TM(TM), LowerGEP(LowerGEP) {
411 DominatorTree *DT;
462 !haveNoCommonBitsSet(LHS, RHS, DL, nullptr, BO, DT))
692 const DominatorTree *DT) {
[all...] |
| LoopInterchange.cpp | 333 LoopInfo *LI, DominatorTree *DT, bool PreserveLCSSA)
334 : OuterLoop(Outer), InnerLoop(Inner), SE(SE), LI(LI), DT(DT),
361 DominatorTree *DT;
392 LoopInfo *LI, DominatorTree *DT,
395 : OuterLoop(Outer), InnerLoop(Inner), SE(SE), LI(LI), DT(DT),
419 DominatorTree *DT;
430 DominatorTree *DT;
433 : FunctionPass(ID), SE(nullptr), LI(nullptr), DI(nullptr), DT(nullptr)
[all...] |
| NaryReassociate.cpp | 178 DominatorTree *DT;
215 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
245 for (auto Node = GraphTraits<DominatorTree *>::nodes_begin(DT);
246 Node != GraphTraits<DominatorTree *>::nodes_end(DT); ++Node) {
342 if (isKnownNonNegative(ZExt->getOperand(0), *DL, 0, AC, GEP, DT))
351 computeOverflowForSignedAdd(AO, *DL, AC, GEP, DT) !=
379 if (isKnownNonNegative(LHS, *DL, 0, AC, GEP, DT) &&
540 if (DT->dominates(CandidateInstruction, Dominatee))
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| RegionInfo.cpp | 57 DominatorTree *dt, Region *Parent)
58 : RegionNode(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
86 assert(DT->getNode(BB) && "BB not part of the dominance tree");
94 return (DT->dominates(entry, BB)
95 && !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
144 if (DT->getNode(Pred) && !contains(Pred)) {
391 if (!DT->dominates(getEntry(), *PI))
398 return new Region(getEntry(), *succ_begin(exit), RI, DT);
[all...] |
| /external/llvm/lib/Analysis/ |
| ValueTracking.cpp | 66 // the context instruction are not in the same block then the DT helps in
72 const DominatorTree *DT;
87 const DominatorTree *DT)
88 : DL(DL), AC(AC), CxtI(CxtI), DT(DT), NumExcluded(0) {}
91 : DL(Q.DL), AC(Q.AC), CxtI(Q.CxtI), DT(Q.DT), NumExcluded(Q.NumExcluded) {
128 const DominatorTree *DT) {
130 Query(DL, AC, safeCxtI(V, CxtI), DT));
135 const DominatorTree *DT) {
[all...] |
| IVUsers.cpp | 89 static bool isSimplifiedLoopNest(BasicBlock *BB, const DominatorTree *DT,
93 for (DomTreeNode *Rung = DT->getNode(BB);
175 if (!isSimplifiedLoopNest(UseBB, DT, LI, SimpleLoopNests))
208 *SE, *DT);
217 NewUse.PostIncLoops, *SE, *DT);
268 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
334 *SE, *DT);
|
| DemandedBits.cpp | 91 &AC, UserI, &DT);
97 0, &AC, UserI, &DT);
252 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
253 DB.emplace(F, AC, DT);
395 auto &DT = AM.getResult<DominatorTreeAnalysis>(F);
396 return DemandedBits(F, AC, DT);
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfUnit.cpp | 460 auto *DT = cast<DIDerivedType>(Fields[i]);
461 StringRef fieldName = DT->getName();
463 forwardingField = DT;
465 varField = DT;
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| CodeExtractor.cpp | 123 : DT(nullptr), AggregateArgs(AggregateArgs||AggregateArgsOpt),
126 CodeExtractor::CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT,
128 : DT(DT), AggregateArgs(AggregateArgs||AggregateArgsOpt),
131 CodeExtractor::CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs)
132 : DT(&DT), AggregateArgs(AggregateArgs||AggregateArgsOpt),
135 CodeExtractor::CodeExtractor(DominatorTree &DT, const RegionNode &RN,
137 : DT(&DT), AggregateArgs(AggregateArgs||AggregateArgsOpt)
[all...] |
| LoopUnrollRuntime.cpp | 65 DominatorTree *DT, LoopInfo *LI, bool PreserveLCSSA) {
132 SplitBlockPredecessors(Exit, Preds, ".unr-lcssa", DT, LI,
154 ValueToValueMapTy &VMap, DominatorTree *DT,
253 SplitBlockPredecessors(Exit, Preds, ".epilog-lcssa", DT, LI,
435 DominatorTree *DT, bool PreserveLCSSA) {
506 NewPreHeader = SplitBlock(PreHeader, PreHeader->getTerminator(), DT, LI);
511 DT, LI, PreserveLCSSA);
513 EpilogPreHeader = SplitBlock(NewExit, NewExit->getTerminator(), DT, LI);
518 PrologPreHeader = SplitEdge(PreHeader, Header, DT, LI);
521 DT, LI)
[all...] |
| MemorySSA.cpp | 155 DominatorTree *DT;
251 for (auto DFI = df_begin(DT->getRootNode()), DFE = df_end(DT->getRootNode());
260 assert(!DT->isReachableFromEntry(BB) &&
268 if (!DT->isReachableFromEntry(S))
296 MemorySSA::MemorySSA(Function &Func, AliasAnalysis *AA, DominatorTree *DT)
297 : AA(AA), DT(DT), F(Func), LiveOnEntryDef(nullptr), Walker(nullptr),
303 : AA(MSSA.AA), DT(MSSA.DT), F(MSSA.F)
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 184 DominatorTree *DT);
323 BasicBlock *InsertPreheaderForLoop(Loop *L, DominatorTree *DT, LoopInfo *LI,
337 bool formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, ScalarEvolution *SE);
348 bool formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI,
395 bool isGuaranteedToExecute(const Instruction &Inst, const DominatorTree *DT,
|
| /external/llvm/lib/Transforms/IPO/ |
| PartialInlining.cpp | 127 DominatorTree DT;
128 DT.recalculate(*duplicateFunction);
132 = CodeExtractor(toExtract, &DT).extractCodeRegion();
|
| /external/llvm/unittests/Analysis/ |
| CFGTest.cpp | 92 DominatorTree *DT =
96 EXPECT_EQ(isPotentiallyReachable(A, B, DT, nullptr), ExpectedResult);
98 EXPECT_EQ(isPotentiallyReachable(A, B, DT, LI), ExpectedResult);
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/IPO/ |
| PartialInlining.cpp | 121 DominatorTree DT;
122 DT.runOnFunction(*duplicateFunction);
125 Function* extractedFunction = ExtractCodeRegion(DT, toExtract);
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 169 if (DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()) {
170 if (DomTreeNode *DTN = DT->getNode(BB)) {
171 DomTreeNode *PredDTN = DT->getNode(PredBB);
175 DT->changeImmediateDominator(*DI, PredDTN);
177 DT->eraseNode(BB);
300 if (DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()) {
302 if (DomTreeNode *OldNode = DT->getNode(Old)) {
308 DomTreeNode *NewNode = DT->addNewBlock(New,Old);
311 DT->changeImmediateDominator(*I, NewNode);
356 DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()
[all...] |
| /external/llvm/include/llvm/IR/ |
| DebugInfo.h | 76 void processType(DIType *DT);
82 bool addType(DIType *DT);
|
| /external/llvm/include/llvm/Transforms/Scalar/ |
| ConstantHoisting.h | 100 bool runImpl(Function &F, TargetTransformInfo &TTI, DominatorTree &DT,
114 DominatorTree *DT;
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64CleanupLocalDynamicTLSPass.cpp | 51 MachineDominatorTree *DT = &getAnalysis<MachineDominatorTree>();
52 return VisitNode(DT->getRootNode(), 0);
|
| /external/llvm/lib/Target/SystemZ/ |
| SystemZLDCleanup.cpp | 79 MachineDominatorTree *DT = &getAnalysis<MachineDominatorTree>();
80 return VisitNode(DT->getRootNode(), 0);
|
| /external/pdfium/core/fxcodec/jbig2/ |
| JBig2_TrdProc.cpp | 32 int32_t DT;
33 if (pHuffmanDecoder->decodeAValue(SBHUFFDT, &DT) != 0)
36 DT *= SBSTRIPS;
37 STRIPT = STRIPT + DT;
278 int32_t DT;
279 if (!pIADT->decode(pArithDecoder, &DT))
281 DT *= SBSTRIPS;
282 STRIPT += DT;
|
