Searched refs:VisitStack (Results 1 - 5 of 5) sorted by relevance
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 50 /// Element of VisitStack during DFS.
81 std::vector<StackElement> VisitStack; member in llvm::scc_iterator
109 assert(!CurrentSCC.empty() || VisitStack.empty()); in isAtEnd()
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC; in operator ==()
150 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); in DFSVisitOne()
159 assert(!VisitStack.empty()); in DFSVisitChildren()
160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
162 NodeRef childN = *VisitStack in DFSVisitChildren()
[all...] |
| H A D | DepthFirstIterator.h | 97 // VisitStack - Used to maintain the ordering. Top = current block
98 std::vector<StackElement> VisitStack;
103 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
111 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
121 NodeRef Node = VisitStack.back().first; in toNext()
122 Optional<ChildItTy> &Opt = VisitStack.back().second; in toNext()
128 // VisitStack.back().second actually gets updated as the iterator in toNext()
135 VisitStack.push_back(StackElement(Next, None)); in toNext()
142 VisitStack.pop_back(); in toNext()
143 } while (!VisitStack in toNext()
[all...] |
| H A D | PostOrderIterator.h | 102 // VisitStack - Used to maintain the ordering. Top = current block
104 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
108 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
117 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
127 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { in traverseChild()
128 NodeRef BB = *VisitStack.back().second++; in traverseChild()
129 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) { in traverseChild()
131 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild()
151 return VisitStack in operator ==()
[all...] |
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| H A 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()
52 // Successor is in VisitStack, it's a back edge. 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()
|
| /third_party/node/deps/v8/src/execution/ |
| H A D | isolate.cc | 1118 void VisitStack(Isolate* isolate, Visitor* visitor, in VisitStack() function
1169 VisitStack(isolate, &builder); in CaptureSimpleStackTrace()
1360 VisitStack(this, &builder, options); in CaptureDetailedStackTrace()
1404 VisitStack(this, &visitor); in CurrentScriptNameOrSourceURL()
|
Completed in 11 milliseconds