Home
last modified time | relevance | path

Searched refs:DominatorTree (Results 1 – 25 of 429) sorted by relevance

12345678910>>...18

/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DInstructionSimplify.h23 class DominatorTree; variable
33 const TargetData *TD = 0, const DominatorTree *DT = 0);
38 const TargetData *TD = 0, const DominatorTree *DT = 0);
43 const DominatorTree *DT = 0);
48 const DominatorTree *DT = 0);
53 const DominatorTree *DT = 0);
58 const DominatorTree *DT = 0);
63 const DominatorTree *DT = 0);
68 const DominatorTree *DT = 0);
73 const DominatorTree *DT = 0);
[all …]
/external/llvm/include/llvm/Analysis/
DInstructionSimplify.h41 class DominatorTree; variable
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,
[all …]
DValueTracking.h30 class DominatorTree; variable
56 const DominatorTree *DT = nullptr);
66 const DominatorTree *DT = nullptr);
74 const DominatorTree *DT = nullptr);
85 const DominatorTree *DT = nullptr);
94 const DominatorTree *DT = nullptr);
100 const DominatorTree *DT = nullptr);
107 const DominatorTree *DT = nullptr);
114 const DominatorTree *DT = nullptr);
121 const DominatorTree *DT = nullptr);
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/IR/
DDomTreeUpdater.cpp25 const DominatorTree::UpdateType Update) const { in isUpdateValid()
41 if (Kind == DominatorTree::Insert && !HasEdge) in isUpdateValid()
45 if (Kind == DominatorTree::Delete && HasEdge) in isUpdateValid()
52 const DominatorTree::UpdateType Update) const { in isSelfDominance()
57 bool DomTreeUpdater::applyLazyUpdate(DominatorTree::UpdateKind Kind, in applyLazyUpdate()
64 const DominatorTree::UpdateType Update = {Kind, From, To}; in applyLazyUpdate()
65 const DominatorTree::UpdateType Invert = {Kind != DominatorTree::Insert in applyLazyUpdate()
66 ? DominatorTree::Insert in applyLazyUpdate()
67 : DominatorTree::Delete, in applyLazyUpdate()
102 DT->applyUpdates(ArrayRef<DominatorTree::UpdateType>(I, E)); in applyDomTreeUpdates()
[all …]
DDominators.cpp99 bool DominatorTree::invalidate(Function &F, const PreservedAnalyses &PA, in invalidate()
111 bool DominatorTree::dominates(const Instruction *Def, in dominates()
148 bool DominatorTree::dominates(const Instruction *Def, in dominates()
174 bool DominatorTree::dominates(const BasicBlockEdge &BBE, in dominates()
226 bool DominatorTree::dominates(const BasicBlockEdge &BBE, const Use &U) const { in dominates()
244 bool DominatorTree::dominates(const Instruction *Def, const Use &U) const { in dominates()
295 bool DominatorTree::isReachableFromEntry(const Use &U) const { in isReachableFromEntry()
319 DominatorTree DominatorTreeAnalysis::run(Function &F, in run()
321 DominatorTree DT; in run()
366 assert(DT.verify(DominatorTree::VerificationLevel::Full)); in verifyAnalysis()
[all …]
/external/llvm/include/llvm/IR/
DDominators.h96 class DominatorTree : public DominatorTreeBase<BasicBlock> {
100 DominatorTree() : DominatorTreeBase<BasicBlock>(false) {}
101 explicit DominatorTree(Function &F) : DominatorTreeBase<BasicBlock>(false) {
105 DominatorTree(DominatorTree &&Arg)
107 DominatorTree &operator=(DominatorTree &&RHS) {
114 inline bool compare(const DominatorTree &Other) const {
186 template <> struct GraphTraits<DominatorTree*>
188 static NodeType *getEntryNode(DominatorTree *DT) {
192 static nodes_iterator nodes_begin(DominatorTree *N) {
196 static nodes_iterator nodes_end(DominatorTree *N) {
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DValueTracking.h33 class DominatorTree; variable
57 const DominatorTree *DT = nullptr,
64 const DominatorTree *DT = nullptr,
78 const DominatorTree *DT = nullptr);
89 const DominatorTree *DT = nullptr);
102 const DominatorTree *DT = nullptr);
115 const DominatorTree *DT = nullptr);
122 const DominatorTree *DT = nullptr);
129 const DominatorTree *DT = nullptr);
136 const DominatorTree *DT = nullptr);
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/
DDomPrinter.cpp52 struct DOTGraphTraits<DominatorTree*> : public DOTGraphTraits<DomTreeNode*> {
57 static std::string getGraphName(DominatorTree *DT) { in getGraphName()
61 std::string getNodeLabel(DomTreeNode *Node, DominatorTree *G) { in getNodeLabel()
83 void DominatorTree::viewGraph(const Twine &Name, const Twine &Title) { in viewGraph()
91 void DominatorTree::viewGraph() { in viewGraph()
101 static DominatorTree *getGraph(DominatorTreeWrapperPass *DTWP) { in getGraph()
107 DominatorTreeWrapperPass, false, DominatorTree *,
111 : DOTGraphTraitsViewer<DominatorTreeWrapperPass, false, DominatorTree *, in DomViewer()
119 DominatorTreeWrapperPass, true, DominatorTree *,
123 : DOTGraphTraitsViewer<DominatorTreeWrapperPass, true, DominatorTree *, in DomOnlyViewer()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/
DDominators.h142 class DominatorTree : public DominatorTreeBase<BasicBlock, false> {
146 DominatorTree() = default;
147 explicit DominatorTree(Function &F) { recalculate(F); }
211 template <> struct GraphTraits<DominatorTree*>
213 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
215 static nodes_iterator nodes_begin(DominatorTree *N) {
219 static nodes_iterator nodes_end(DominatorTree *N) {
231 using Result = DominatorTree;
234 DominatorTree run(Function &F, FunctionAnalysisManager &);
255 DominatorTree DT;
[all …]
DDomTreeUpdater.h32 DomTreeUpdater(DominatorTree &DT_, UpdateStrategy Strategy_) in DomTreeUpdater()
34 DomTreeUpdater(DominatorTree *DT_, UpdateStrategy Strategy_) in DomTreeUpdater()
40 DomTreeUpdater(DominatorTree &DT_, PostDominatorTree &PDT_, in DomTreeUpdater()
43 DomTreeUpdater(DominatorTree *DT_, PostDominatorTree *PDT_, in DomTreeUpdater()
95 void applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates,
172 DominatorTree &getDomTree();
205 SmallVector<DominatorTree::UpdateType, 16> PendUpdates;
208 DominatorTree *DT = nullptr;
228 bool applyLazyUpdate(DominatorTree::UpdateKind Kind, BasicBlock *From,
252 bool isUpdateValid(DominatorTree::UpdateType Update) const;
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/IR/
DDomTreeUpdaterTest.cpp55 DominatorTree DT(*F); in TEST()
80 std::vector<DominatorTree::UpdateType> Updates; in TEST()
82 Updates.push_back({DominatorTree::Delete, BB0, BB3}); in TEST()
83 Updates.push_back({DominatorTree::Delete, BB0, BB3}); in TEST()
86 Updates.push_back({DominatorTree::Insert, BB1, BB2}); in TEST()
88 Updates.push_back({DominatorTree::Delete, BB0, BB1}); in TEST()
165 DominatorTree DT(*F); in TEST()
201 DTU.applyUpdates({{DominatorTree::Delete, NewEntry, BB0}, in TEST()
202 {DominatorTree::Insert, NewEntry, BB1}}); in TEST()
239 DominatorTree DT(*F); in TEST()
[all …]
DDeferredDominanceTest.cpp54 DominatorTree DT(*F); in TEST()
71 std::vector<DominatorTree::UpdateType> Updates; in TEST()
73 Updates.push_back({DominatorTree::Delete, BB0, BB3}); in TEST()
74 Updates.push_back({DominatorTree::Delete, BB0, BB3}); in TEST()
77 Updates.push_back({DominatorTree::Insert, BB1, BB2}); in TEST()
79 Updates.push_back({DominatorTree::Delete, BB0, BB1}); in TEST()
129 DominatorTree DT(*F); in TEST()
188 DominatorTree DT(*F); in TEST()
220 DDT.applyUpdates({{DominatorTree::Delete, NewEntry, BB0}, in TEST()
221 {DominatorTree::Insert, NewEntry, BB1}}); in TEST()
[all …]
DDominatorTreeTest.cpp29 function_ref<void(Function &F, DominatorTree *DT, PostDominatorTree *PDT)> in runWithDomTree()
34 DominatorTree DT(*F); in runWithDomTree()
47 TEST(DominatorTree, Unreachable) { in TEST() argument
77 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
277 TEST(DominatorTree, NonUniqueEdges) { in TEST() argument
297 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
363 TEST(DominatorTree, DeletingEdgesIntroducesUnreachables) { in TEST() argument
381 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
405 DominatorTree NDT(F); in TEST()
455 TEST(DominatorTree, DeletingEdgesIntroducesInfiniteLoop) { in TEST() argument
[all …]
/external/swiftshader/third_party/LLVM/lib/Analysis/
DDomPrinter.cpp52 struct DOTGraphTraits<DominatorTree*> : public DOTGraphTraits<DomTreeNode*> {
57 static std::string getGraphName(DominatorTree *DT) { in getGraphName()
61 std::string getNodeLabel(DomTreeNode *Node, DominatorTree *G) { in getNodeLabel()
85 : public DOTGraphTraitsViewer<DominatorTree, false> {
87 DomViewer() : DOTGraphTraitsViewer<DominatorTree, false>("dom", ID){ in DomViewer()
93 : public DOTGraphTraitsViewer<DominatorTree, true> {
95 DomOnlyViewer() : DOTGraphTraitsViewer<DominatorTree, true>("domonly", ID){ in DomOnlyViewer()
140 : public DOTGraphTraitsPrinter<DominatorTree, false> {
142 DomPrinter() : DOTGraphTraitsPrinter<DominatorTree, false>("dom", ID) { in DomPrinter()
148 : public DOTGraphTraitsPrinter<DominatorTree, true> {
[all …]
/external/llvm/lib/Analysis/
DDomPrinter.cpp52 struct DOTGraphTraits<DominatorTree*> : public DOTGraphTraits<DomTreeNode*> {
57 static std::string getGraphName(DominatorTree *DT) { in getGraphName()
61 std::string getNodeLabel(DomTreeNode *Node, DominatorTree *G) { in getNodeLabel()
85 static DominatorTree *getGraph(DominatorTreeWrapperPass *DTWP) { in getGraph()
91 DominatorTreeWrapperPass, false, DominatorTree *,
95 : DOTGraphTraitsViewer<DominatorTreeWrapperPass, false, DominatorTree *, in DomViewer()
103 DominatorTreeWrapperPass, true, DominatorTree *,
107 : DOTGraphTraitsViewer<DominatorTreeWrapperPass, true, DominatorTree *, in DomOnlyViewer()
170 DominatorTreeWrapperPass, false, DominatorTree *,
174 : DOTGraphTraitsPrinter<DominatorTreeWrapperPass, false, DominatorTree *, in DomPrinter()
[all …]
/external/swiftshader/third_party/LLVM/lib/VMCore/
DDominators.cpp54 char DominatorTree::ID = 0;
55 INITIALIZE_PASS(DominatorTree, "domtree",
58 bool DominatorTree::runOnFunction(Function &F) { in runOnFunction()
63 void DominatorTree::verifyAnalysis() const { in verifyAnalysis()
68 DominatorTree OtherDT; in verifyAnalysis()
79 void DominatorTree::print(raw_ostream &OS, const Module *) const { in print()
85 bool DominatorTree::dominates(const Instruction *A, const Instruction *B) const{ in dominates()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Transforms/Utils/
DUnrollLoop.h29 class DominatorTree; variable
63 DominatorTree *DT, AssumptionCache *AC,
70 ScalarEvolution *SE, DominatorTree *DT,
81 DominatorTree *DT, AssumptionCache *AC, bool PreserveLCSSA);
86 DominatorTree *DT, AssumptionCache *AC,
89 bool isSafeToUnrollAndJam(Loop *L, ScalarEvolution &SE, DominatorTree &DT,
93 DominatorTree &DT, LoopInfo *LI, ScalarEvolution &SE,
102 ScalarEvolution *SE, DominatorTree *DT);
107 ScalarEvolution *SE, DominatorTree *DT,
DBasicBlockUtils.h31 class DominatorTree; variable
59 bool MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT = nullptr,
85 DominatorTree *DT;
91 CriticalEdgeSplittingOptions(DominatorTree *DT = nullptr,
179 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
186 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
204 DominatorTree *DT = nullptr,
223 DominatorTree *DT = nullptr,
257 DominatorTree *DT = nullptr,
DLoopUtils.h174 DominatorTree *DT = nullptr);
184 DominatorTree *DT = nullptr);
196 DominatorTree *DT);
363 BasicBlock *InsertPreheaderForLoop(Loop *L, DominatorTree *DT, LoopInfo *LI,
371 bool formDedicatedExitBlocks(Loop *L, DominatorTree *DT, LoopInfo *LI,
386 DominatorTree &DT, LoopInfo &LI);
399 bool formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, ScalarEvolution *SE);
410 bool formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI,
421 bool sinkRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
434 bool hoistRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
[all …]
/external/deqp-deps/SPIRV-Tools/source/opt/
Ddominator_tree.cpp217 bool DominatorTree::StrictlyDominates(uint32_t a, uint32_t b) const { in StrictlyDominates()
222 bool DominatorTree::StrictlyDominates(const BasicBlock* a, in StrictlyDominates()
224 return DominatorTree::StrictlyDominates(a->id(), b->id()); in StrictlyDominates()
227 bool DominatorTree::StrictlyDominates(const DominatorTreeNode* a, in StrictlyDominates()
233 bool DominatorTree::Dominates(uint32_t a, uint32_t b) const { in Dominates()
242 bool DominatorTree::Dominates(const DominatorTreeNode* a, in Dominates()
251 bool DominatorTree::Dominates(const BasicBlock* A, const BasicBlock* B) const { in Dominates()
255 BasicBlock* DominatorTree::ImmediateDominator(const BasicBlock* A) const { in ImmediateDominator()
259 BasicBlock* DominatorTree::ImmediateDominator(uint32_t a) const { in ImmediateDominator()
273 DominatorTreeNode* DominatorTree::GetOrInsertNode(BasicBlock* bb) { in GetOrInsertNode()
[all …]
/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Ddominator_tree.cpp217 bool DominatorTree::StrictlyDominates(uint32_t a, uint32_t b) const { in StrictlyDominates()
222 bool DominatorTree::StrictlyDominates(const BasicBlock* a, in StrictlyDominates()
224 return DominatorTree::StrictlyDominates(a->id(), b->id()); in StrictlyDominates()
227 bool DominatorTree::StrictlyDominates(const DominatorTreeNode* a, in StrictlyDominates()
233 bool DominatorTree::Dominates(uint32_t a, uint32_t b) const { in Dominates()
242 bool DominatorTree::Dominates(const DominatorTreeNode* a, in Dominates()
251 bool DominatorTree::Dominates(const BasicBlock* A, const BasicBlock* B) const { in Dominates()
255 BasicBlock* DominatorTree::ImmediateDominator(const BasicBlock* A) const { in ImmediateDominator()
259 BasicBlock* DominatorTree::ImmediateDominator(uint32_t a) const { in ImmediateDominator()
273 DominatorTreeNode* DominatorTree::GetOrInsertNode(BasicBlock* bb) { in GetOrInsertNode()
[all …]
/external/llvm/include/llvm/Transforms/Utils/
DBasicBlockUtils.h26 class DominatorTree; variable
52 bool MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT = nullptr,
77 DominatorTree *DT;
83 CriticalEdgeSplittingOptions(DominatorTree *DT = nullptr,
173 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
180 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
199 DominatorTree *DT = nullptr,
219 DominatorTree *DT = nullptr,
253 DominatorTree *DT = nullptr,
DSimplifyIndVar.h24 class DominatorTree; variable
35 const DominatorTree *DT;
43 const DominatorTree *getDomTree() const { return DT; } in getDomTree()
49 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
55 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
/external/clang/include/clang/Analysis/Analyses/
DDominators.h38 class DominatorTree : public ManagedAnalysis {
43 DominatorTree() { in DominatorTree() function
47 ~DominatorTree() override { delete DT; } in ~DominatorTree()
67 inline bool compare(DominatorTree &Other) const { in compare()
194 template <> struct GraphTraits< ::clang::DominatorTree* >
196 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
200 static nodes_iterator nodes_begin(::clang::DominatorTree *N) {
204 static nodes_iterator nodes_end(::clang::DominatorTree *N) {
/external/llvm/lib/IR/
DDominators.cpp75 bool DominatorTree::dominates(const Instruction *Def, in dominates()
112 bool DominatorTree::dominates(const Instruction *Def, in dominates()
138 bool DominatorTree::dominates(const BasicBlockEdge &BBE, in dominates()
190 bool DominatorTree::dominates(const BasicBlockEdge &BBE, const Use &U) const { in dominates()
214 bool DominatorTree::dominates(const Instruction *Def, const Use &U) const { in dominates()
265 bool DominatorTree::isReachableFromEntry(const Use &U) const { in isReachableFromEntry()
280 void DominatorTree::verifyDomTree() const { in verifyDomTree()
283 DominatorTree OtherDT; in verifyDomTree()
303 DominatorTree DominatorTreeAnalysis::run(Function &F, in run()
305 DominatorTree DT; in run()

12345678910>>...18