| /frameworks/compile/slang/ |
| slang_rs_export_type.cpp | 842 DataType dt = RSExportPrimitiveType::GetRSSpecificType(TypeName); local
843 switch (dt) {
[all...] |
| slang_rs_object_ref_count.cpp | 80 DataType DT = RSExportPrimitiveType::GetRSSpecificType(RST.getTypePtr());
81 slangAssert(RSExportPrimitiveType::IsRSObjectType(DT)
84 if (DT >= 0 && DT < DataTypeMax) {
85 RSObjectFD[DT] = FD;
478 DataType DT = RSExportPrimitiveType::GetRSSpecificType(BaseType);
484 } else if (DT == DataTypeUnknown) {
513 DataType DT = RSExportPrimitiveType::GetRSSpecificType(T);
514 if (DT != DataTypeUnknown) {
515 return (RSExportPrimitiveType::IsRSObjectType(DT) ? 1 : 0)
[all...] |
| /external/clang/test/CXX/drs/ |
| dr4xx.cpp | 1038 typedef D DT; // expected-note {{here}}
1040 struct N::DT {}; // expected-error {{conflicts with typedef}}
|
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolution.h | 377 DominatorTree &DT;
[all...] |
| /external/llvm/lib/Analysis/ |
| BasicAliasAnalysis.cpp | 184 AssumptionCache *AC, DominatorTree *DT, bool &NSW, bool &NUW) {
224 BOp, DT)) {
232 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW);
237 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW);
242 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW);
248 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW);
275 Depth + 1, AC, DT, NSW, NUW);
338 const DataLayout &DL, AssumptionCache *AC, DominatorTree *DT) {
426 SExtBits, DL, 0, AC, DT, NSW, NUW);
[all...] |
| 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...] |
| InstructionSimplify.cpp | 51 const DominatorTree *DT;
56 const DominatorTree *dt, AssumptionCache *ac = nullptr,
58 : DL(DL), TLI(tli), DT(dt), AC(ac), CxtI(cxti) {}
104 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) {
117 if (DT) {
118 if (!DT->isReachableFromEntry(P->getParent()))
120 if (!DT->isReachableFromEntry(I->getParent()))
122 return DT->dominates(I, P);
461 if (!ValueDominatesPHI(RHS, PI, Q.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...] |
| /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;
584 if (auto *DT = dyn_cast<DIDerivedType>(BaseType))
585 return getBaseTypeSize(DD, DT);
[all...] |
| DwarfDebug.cpp | 190 auto *DT = cast<DIDerivedType>(Elements[i]);
191 if (getName() == DT->getName())
192 return resolve(DT->getBaseType());
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineLICM.cpp | 83 MachineDominatorTree *DT; // Machine dominator tree for the cur loop
295 DT = &getAnalysis<MachineDominatorTree>();
318 MachineDomTreeNode *N = DT->getNode(CurLoop->getHeader());
582 if (!DT->dominates(BB, CurrentLoopExitingBlocks[i])) {
748 B = DT->findNearestCommonDominator(B, MI.getParent());
[all...] |
| PeepholeOptimizer.cpp | 127 MachineDominatorTree *DT; // Machine dominator tree
498 } else if (Aggressive && DT->dominates(MBB, UseMBB)) {
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| SampleProfile.cpp | 109 : ModulePass(ID), DT(nullptr), PDT(nullptr), LI(nullptr), Reader(),
180 std::unique_ptr<DominatorTree> DT;
385 DT = nullptr;
794 DT->getDescendants(BB1, DominatedBBs);
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopIdiomRecognize.cpp | 71 DominatorTree *DT;
202 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
354 if (!DT->dominates(BB, ExitBlocks[i]))
[all...] |
| LoopRerollPass.cpp | 164 DominatorTree *DT;
357 TargetLibraryInfo *TLI, DominatorTree *DT, LoopInfo *LI,
360 : Parent(Parent), L(L), SE(SE), AA(AA), TLI(TLI), DT(DT), LI(LI),
407 DominatorTree *DT;
[all...] |
| LoopUnrollPass.cpp | 522 analyzeLoopUnrollCost(const Loop *L, unsigned TripCount, DominatorTree &DT,
553 assert(L->isLCSSAForm(DT) &&
[all...] |
| 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...] |
| StructurizeCFG.cpp | 60 DominatorTree *DT;
71 DT = DomTree;
77 DomTreeNode *Node = DT->getNode(BB);
172 DominatorTree *DT;
531 NearestCommonDominator Dominator(DT);
606 NearestCommonDominator Dominator(DT);
673 Dominator = DT->findNearestCommonDominator(Dominator, BB);
679 DT->changeImmediateDominator(NewExit, Dominator);
690 DT->changeImmediateDominator(NewExit, BB);
701 DT->addNewBlock(Flow, Dominator)
[all...] |
| IndVarSimplify.cpp | 93 DominatorTree *DT;
103 : LoopPass(ID), LI(nullptr), SE(nullptr), DT(nullptr), Changed(false) {
219 DominatorTree *DT, LoopInfo *LI) {
234 InsertBB = DT->findNearestCommonDominator(InsertPt->getParent(), InsertBB);
243 assert(DT->dominates(DefI, InsertPt) && "def does not dominate all uses");
248 for (auto *DTN = (*DT)[InsertPt->getParent()]; DTN; DTN = DTN->getIDom())
544 assert(L->isRecursivelyLCSSAForm(*DT) && "Indvars did not preserve LCSSA!");
[all...] |
| ScalarReplAggregates.cpp | 231 "Scalar Replacement of Aggregates (DT)", false, false)
235 "Scalar Replacement of Aggregates (DT)", false, false)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| InlineFunction.cpp | 519 DominatorTree DT;
520 DT.recalculate(const_cast<Function&>(*CalledFunc));
685 /* StoreCaptures */ false, I, &DT)))
732 // already in the caller. To do this, we might need a DT of the caller.
733 DominatorTree DT;
743 DT.recalculate(const_cast<Function&>(*CS.getInstruction()->getParent()
753 &DT) >= Align)
[all...] |
| /frameworks/rs/java/tests/VrDemo/src/com/example/android/rs/vr/loaders/ |
| LoaderDicom.java | 88 static final short DT = vr("DT");
108 AE, AS, CS, DA, DS, DT, IS, LO, LT, PN, SH, ST, TM, UT
|
| /external/clang/lib/Sema/ |
| SemaCast.cpp | [all...] |
| /external/llvm/lib/Target/Hexagon/ |
| 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...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| DataFlowSanitizer.cpp | 286 DominatorTree DT;
311 DT.recalculate(*F);
[all...] |
