| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| D | SCCIterator.h | 82 std::vector<StackElement> VisitStack; variable
110 assert(!CurrentSCC.empty() || VisitStack.empty()); in isAtEnd()
115 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); in DFSVisitOne()
157 assert(!VisitStack.empty()); in DFSVisitChildren()
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
160 NodeRef childN = *VisitStack.back().NextChild++; in DFSVisitChildren()
170 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
171 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
177 while (!VisitStack.empty()) { in GetNextSCC()
[all …]
|
| D | DepthFirstIterator.h | 99 std::vector<StackElement> VisitStack; variable
104 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
112 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
122 NodeRef Node = VisitStack.back().first; in toNext()
123 Optional<ChildItTy> &Opt = VisitStack.back().second; in toNext()
136 VisitStack.push_back(StackElement(Next, None)); in toNext()
143 VisitStack.pop_back(); in toNext()
144 } while (!VisitStack.empty()); in toNext()
163 return VisitStack == x.VisitStack;
167 const NodeRef &operator*() const { return VisitStack.back().first; }
[all …]
|
| D | PostOrderIterator.h | 105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack; variable
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { in traverseChild()
129 NodeRef BB = *VisitStack.back().second++; in traverseChild()
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) { in traverseChild()
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild()
152 return VisitStack == x.VisitStack;
156 const NodeRef &operator*() const { return VisitStack.back().first; }
165 this->finishPostorder(VisitStack.back().first);
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | SCCIterator.h | 80 std::vector<StackElement> VisitStack; variable
108 assert(!CurrentSCC.empty() || VisitStack.empty()); in isAtEnd()
113 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
146 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); in DFSVisitOne()
155 assert(!VisitStack.empty()); in DFSVisitChildren()
156 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
158 NodeType *childN = *VisitStack.back().NextChild++; in DFSVisitChildren()
168 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
169 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
175 while (!VisitStack.empty()) { in GetNextSCC()
[all …]
|
| D | DepthFirstIterator.h | 78 std::vector<std::pair<PointerIntTy, ChildItTy>> VisitStack; variable
83 VisitStack.push_back( in df_iterator()
92 VisitStack.push_back( in df_iterator()
104 std::pair<PointerIntTy, ChildItTy> &Top = VisitStack.back(); in toNext()
118 VisitStack.push_back( in toNext()
125 VisitStack.pop_back(); in toNext()
126 } while (!VisitStack.empty()); in toNext()
145 return VisitStack == x.VisitStack;
149 pointer operator*() const { return VisitStack.back().first.getPointer(); }
167 VisitStack.pop_back(); in skipChildren()
[all …]
|
| D | PostOrderIterator.h | 103 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack; variable
106 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { in traverseChild()
107 NodeType *BB = *VisitStack.back().second++; in traverseChild()
108 if (this->insertEdge(VisitStack.back().first, BB)) { in traverseChild()
110 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild()
117 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
125 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
148 return VisitStack == x.VisitStack;
152 pointer operator*() const { return VisitStack.back().first; }
161 this->finishPostorder(VisitStack.back().first);
[all …]
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopInstSimplify.cpp | 89 SmallVector<WorklistItem, 16> VisitStack; in runOnLoop() local
97 VisitStack.clear(); in runOnLoop()
100 VisitStack.push_back(WorklistItem(L->getHeader(), false)); in runOnLoop()
102 while (!VisitStack.empty()) { in runOnLoop()
103 WorklistItem Item = VisitStack.pop_back_val(); in runOnLoop()
156 VisitStack.push_back(WorklistItem(SuccBB, true)); in runOnLoop()
164 VisitStack.push_back(WorklistItem(ExitBB, false)); in runOnLoop()
175 VisitStack.push_back(WorklistItem(SuccBB, false)); in runOnLoop()
|
| /external/llvm/lib/Analysis/ |
| D | CFG.cpp | 34 SmallVector<std::pair<const BasicBlock*, succ_const_iterator>, 8> VisitStack; in FindFunctionBackedges() local
38 VisitStack.push_back(std::make_pair(BB, succ_begin(BB))); in FindFunctionBackedges()
41 std::pair<const BasicBlock*, succ_const_iterator> &Top = VisitStack.back(); in FindFunctionBackedges()
60 VisitStack.push_back(std::make_pair(BB, succ_begin(BB))); in FindFunctionBackedges()
63 InStack.erase(VisitStack.pop_back_val().first); in FindFunctionBackedges()
65 } while (!VisitStack.empty()); in FindFunctionBackedges()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| D | CFG.cpp | 34 SmallVector<std::pair<const BasicBlock*, succ_const_iterator>, 8> VisitStack; in FindFunctionBackedges() local
38 VisitStack.push_back(std::make_pair(BB, succ_begin(BB))); in FindFunctionBackedges()
41 std::pair<const BasicBlock*, succ_const_iterator> &Top = VisitStack.back(); in FindFunctionBackedges()
60 VisitStack.push_back(std::make_pair(BB, succ_begin(BB))); in FindFunctionBackedges()
63 InStack.erase(VisitStack.pop_back_val().first); in FindFunctionBackedges()
65 } while (!VisitStack.empty()); in FindFunctionBackedges()
|
| /external/clang/lib/Sema/ |
| D | SemaDecl.cpp | 7569 SmallVector<const Decl *, 4> VisitStack; in checkIsValidOpenCLKernelParameter() local
7577 VisitStack.push_back(PD); in checkIsValidOpenCLKernelParameter()
7579 assert(VisitStack.back() && "First decl null?"); in checkIsValidOpenCLKernelParameter()
7582 const Decl *Next = VisitStack.pop_back_val(); in checkIsValidOpenCLKernelParameter()
7603 VisitStack.push_back(nullptr); in checkIsValidOpenCLKernelParameter()
7616 VisitStack.push_back(FD); in checkIsValidOpenCLKernelParameter()
7654 } while (!VisitStack.empty()); in checkIsValidOpenCLKernelParameter()
|