| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-plugin/ |
| lto-16a.d | 2 [0-9a-f]+ [DT] foo
|
| lto-16b.d | 2 [0-9a-f]+ [DT] bar
|
| lto-17a.d | 2 [0-9a-f]+ [DT] bar
|
| lto-17b-2.d | 2 [0-9a-f]+ [DT] foo
|
| /external/llvm/unittests/IR/ |
| DominatorTreeTest.cpp | 30 DominatorTree *DT =
60 EXPECT_TRUE(DT->isReachableFromEntry(BB0));
61 EXPECT_TRUE(DT->isReachableFromEntry(BB1));
62 EXPECT_TRUE(DT->isReachableFromEntry(BB2));
63 EXPECT_FALSE(DT->isReachableFromEntry(BB3));
64 EXPECT_TRUE(DT->isReachableFromEntry(BB4));
67 EXPECT_TRUE(DT->dominates(BB0, BB0));
68 EXPECT_TRUE(DT->dominates(BB0, BB1));
69 EXPECT_TRUE(DT->dominates(BB0, BB2));
70 EXPECT_TRUE(DT->dominates(BB0, BB3))
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| PostDominators.h | 26 DominatorTreeBase<BasicBlock>* DT;
30 DT = new DominatorTreeBase<BasicBlock>(true);
42 return DT->getRoots();
46 return DT->getRootNode();
50 return DT->getNode(BB);
54 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
66 return DT->properlyDominates(A, B);
70 return DT->properlyDominates(A, B)
[all...] |
| IteratedDominanceFrontier.h | 50 IDFCalculator(DominatorTreeBase<BasicBlock> &DT) : DT(DT), useLiveIn(false) {}
88 DominatorTreeBase<BasicBlock> &DT;
|
| InstructionSimplify.h | 54 const DominatorTree *DT = nullptr,
63 const DominatorTree *DT = nullptr,
72 const DominatorTree *DT = nullptr,
81 const DominatorTree *DT = nullptr,
90 const DominatorTree *DT = nullptr,
98 const DominatorTree *DT = nullptr,
106 const DominatorTree *DT = nullptr,
114 const DominatorTree *DT = nullptr,
123 const DominatorTree *DT = nullptr,
131 const DominatorTree *DT = nullptr
[all...] |
| ValueTracking.h | 49 const DominatorTree *DT = nullptr);
59 const DominatorTree *DT = nullptr);
67 const DominatorTree *DT = nullptr);
78 const DominatorTree *DT = nullptr);
87 const DominatorTree *DT = nullptr);
93 const DominatorTree *DT = nullptr);
100 const DominatorTree *DT = nullptr);
114 const DominatorTree *DT = nullptr);
127 const DominatorTree *DT = nullptr);
245 const DominatorTree *DT = nullptr
[all...] |
| CFG.h | 61 /// Using DT or LI allows us to answer more quickly. LI reduces the cost of
63 /// single block. DT reduces the cost by allowing the search to terminate when
64 /// we find a block that dominates the block containing 'To'. DT is most useful
68 const DominatorTree *DT = nullptr,
78 const DominatorTree *DT = nullptr,
90 const DominatorTree *DT = nullptr,
|
| BasicAliasAnalysis.h | 44 DominatorTree *DT;
49 AssumptionCache &AC, DominatorTree *DT = nullptr,
51 : AAResultBase(TLI), DL(DL), AC(AC), DT(DT), LI(LI) {}
54 : AAResultBase(Arg), DL(Arg.DL), AC(Arg.AC), DT(Arg.DT), LI(Arg.LI) {}
56 : AAResultBase(std::move(Arg)), DL(Arg.DL), AC(Arg.AC), DT(Arg.DT),
138 DominatorTree *DT, bool &NSW, bool &NUW);
144 AssumptionCache *AC, DominatorTree *DT);
[all...] |
| PHITransAddr.h | 83 const DominatorTree *DT, bool MustDominate);
93 const DominatorTree &DT,
105 const DominatorTree *DT);
113 BasicBlock *PredBB, const DominatorTree &DT,
|
| /external/llvm/lib/Analysis/ |
| PostDominators.cpp | 34 DT->recalculate(F);
39 delete DT;
43 DT->print(OS);
|
| /external/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 33 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT,
39 InfoRec &VInfo = DT.Info[DT.Roots[i]];
46 InfoRec &SuccVInfo = DT.Info[*SI];
49 N = DTDFSPass(DT, *SI, N);
63 DT.Info[BB];
70 DT.Vertex.push_back(BB); // Vertex[n] = V;
95 DT.Info[Succ];
107 Eval(DominatorTreeBase<typename GraphT::NodeType> &DT,
110 DT.Info[VIn]
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachinePostDominators.h | 29 DominatorTreeBase<MachineBasicBlock> *DT;
41 return DT->getRoots();
45 return DT->getRootNode();
49 return DT->getNode(BB);
53 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
67 return DT->properlyDominates(A, B);
72 return DT->properlyDominates(A, B);
77 return DT->findNearestCommonDominator(A, B)
[all...] |
| MachineDominators.h | 62 /// \brief Apply all the recorded critical edges to the DT.
63 /// This updates the underlying DT information in a way that uses
64 /// the fast query path of DT as much as possible.
71 DominatorTreeBase<MachineBasicBlock>* DT;
79 return *DT;
90 return DT->getRoots();
95 return DT->getRoot();
100 return DT->getRootNode();
108 return DT->dominates(A, B);
114 return DT->dominates(A, B)
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SimplifyIndVar.h | 36 const DominatorTree *DT;
42 IVVisitor(): DT(nullptr), ShouldSplitOverflowIntrinsics(false) {}
45 const DominatorTree *getDomTree() const { return DT; }
52 assert(DT && "Splitting overflow intrinsics requires a DomTree.");
60 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
66 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
|
| UnrollLoop.h | 34 LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT,
39 ScalarEvolution *SE, DominatorTree *DT,
|
| /external/llvm/lib/CodeGen/ |
| MachinePostDominators.cpp | 27 DT = new DominatorTreeBase<MachineBasicBlock>(true); //true indicate
38 DT->recalculate(F);
43 delete DT;
54 DT->print(OS);
|
| MachineDominators.cpp | 41 DT->recalculate(F);
49 DT = new DominatorTreeBase<MachineBasicBlock>(false);
53 delete DT;
57 DT->releaseMemory();
61 DT->print(OS);
77 // the underlying DT.
81 MachineDomTreeNode *SuccDTNode = DT->getNode(Succ);
97 // FromBB2 since Split2 is still unknown of the underlying DT structure.
104 if (!DT->dominates(SuccDTNode, DT->getNode(PredBB)))
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 41 llvm::DominatorTreeBase<CFGBlock>* DT;
44 DT = new llvm::DominatorTreeBase<CFGBlock>(false);
47 ~DominatorTree() override { delete DT; }
49 llvm::DominatorTreeBase<CFGBlock>& getBase() { return *DT; }
54 return DT->getRoot();
60 return DT->getRootNode();
74 if (DT->compare(Other.getBase()))
85 DT->recalculate(*cfg);
95 if(DT->getNode(*I)->getIDom())
98 << DT->getNode(*I)->getIDom()->getBlock()->getBlockID(
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LCSSA.cpp | 64 static bool processInstruction(Loop &L, Instruction &Inst, DominatorTree &DT,
102 DomTreeNode *DomNode = DT.getNode(DomBB);
113 if (!DT.dominates(DomNode, DT.getNode(ExitBB)))
194 processInstruction(*OtherLoop, *I, DT, EBs, PredCache, LI);
209 DominatorTree &DT,
211 DomTreeNode *DomNode = DT.getNode(BB);
213 if (DT.dominates(DomNode, DT.getNode(ExitBB)))
219 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI
[all...] |
| /frameworks/compile/slang/ |
| slang_rs_object_ref_count.h | 71 DataType DT,
131 DataType *DT,
167 static clang::FunctionDecl *GetRSSetObjectFD(DataType DT) {
168 slangAssert(RSExportPrimitiveType::IsRSObjectType(DT));
169 if (DT >= 0 && DT < DataTypeMax) {
170 return RSSetObjectFD[DT];
181 static clang::FunctionDecl *GetRSClearObjectFD(DataType DT) {
182 slangAssert(RSExportPrimitiveType::IsRSObjectType(DT));
183 if (DT >= 0 && DT < DataTypeMax)
[all...] |
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-scripts/ |
| empty-address-3a.d | 8 0+10 [DT] __data_end
|
| empty-address-3b.d | 8 0+10 [DT] __data_end
|
