| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | SCCIterator.h | 81 std::vector<StackElement> VisitStack; variable
109 assert(!CurrentSCC.empty() || VisitStack.empty()); in isAtEnd()
114 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
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.back().NextChild++; in DFSVisitChildren()
172 if (VisitStack.back().MinVisited > childNum) in DFSVisitChildren()
173 VisitStack.back().MinVisited = childNum; in DFSVisitChildren()
179 while (!VisitStack.empty()) { in GetNextSCC()
[all …]
|
| D | DepthFirstIterator.h | 96 std::vector<StackElement> VisitStack; variable
101 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
109 VisitStack.push_back(StackElement(Node, None)); in df_iterator()
119 NodeRef Node = VisitStack.back().first; in toNext()
120 Optional<ChildItTy> &Opt = VisitStack.back().second; in toNext()
133 VisitStack.push_back(StackElement(Next, None)); in toNext()
140 VisitStack.pop_back(); in toNext()
141 } while (!VisitStack.empty()); in toNext()
164 return VisitStack == x.VisitStack;
168 const NodeRef &operator*() const { return VisitStack.back().first; }
[all …]
|
| D | PostOrderIterator.h | 104 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack; variable
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 == x.VisitStack;
155 const NodeRef &operator*() const { return VisitStack.back().first; }
164 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-10.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/cronet/base/allocator/partition_allocator/starscan/stack/ |
| D | stack.cc | 110 visitor->VisitStack(reinterpret_cast<uintptr_t*>(stack_ptr), in IterateSafeStackIfNecessary()
132 visitor->VisitStack(stack_ptr, in IteratePointersImpl()
|
| D | stack.h | 24 virtual void VisitStack(uintptr_t* stack_ptr, uintptr_t* stack_top) = 0;
|
| D | stack_unittest.cc | 44 void VisitStack(uintptr_t* stack_ptr, uintptr_t* stack_top) final { in VisitStack() function in partition_alloc::internal::__anona18031ef0111::StackScanner
333 void VisitStack(uintptr_t*, uintptr_t*) final { in VisitStack() function in partition_alloc::internal::CheckStackAlignmentVisitor
|
| /external/cronet/base/allocator/partition_allocator/starscan/ |
| D | pcscan_internal.cc | 808 void VisitStack(uintptr_t* stack_ptr, uintptr_t* stack_top) override { in VisitStack() function in partition_alloc::internal::PCScanTask::StackVisitor
|
| /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()
|