| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| DepthFirstIterator.h | 98 // VisitStack - Used to maintain the ordering. Top = current block
99 std::vector<StackElement> VisitStack;
104 VisitStack.push_back(StackElement(Node, None));
112 VisitStack.push_back(StackElement(Node, None));
122 NodeRef Node = VisitStack.back().first;
123 Optional<ChildItTy> &Opt = VisitStack.back().second;
129 // VisitStack.back().second actually gets updated as the iterator
136 VisitStack.push_back(StackElement(Next, None));
143 VisitStack.pop_back();
144 } while (!VisitStack.empty())
[all...] |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
129 NodeRef BB = *VisitStack.back().second++;
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| DepthFirstIterator.h | 98 // VisitStack - Used to maintain the ordering. Top = current block
99 std::vector<StackElement> VisitStack;
104 VisitStack.push_back(StackElement(Node, None));
112 VisitStack.push_back(StackElement(Node, None));
122 NodeRef Node = VisitStack.back().first;
123 Optional<ChildItTy> &Opt = VisitStack.back().second;
129 // VisitStack.back().second actually gets updated as the iterator
136 VisitStack.push_back(StackElement(Next, None));
143 VisitStack.pop_back();
144 } while (!VisitStack.empty())
[all...] |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
129 NodeRef BB = *VisitStack.back().second++;
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| DepthFirstIterator.h | 98 // VisitStack - Used to maintain the ordering. Top = current block
99 std::vector<StackElement> VisitStack;
104 VisitStack.push_back(StackElement(Node, None));
112 VisitStack.push_back(StackElement(Node, None));
122 NodeRef Node = VisitStack.back().first;
123 Optional<ChildItTy> &Opt = VisitStack.back().second;
129 // VisitStack.back().second actually gets updated as the iterator
136 VisitStack.push_back(StackElement(Next, None));
143 VisitStack.pop_back();
144 } while (!VisitStack.empty())
[all...] |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
129 NodeRef BB = *VisitStack.back().second++;
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| DepthFirstIterator.h | 98 // VisitStack - Used to maintain the ordering. Top = current block
99 std::vector<StackElement> VisitStack;
104 VisitStack.push_back(StackElement(Node, None));
112 VisitStack.push_back(StackElement(Node, None));
122 NodeRef Node = VisitStack.back().first;
123 Optional<ChildItTy> &Opt = VisitStack.back().second;
129 // VisitStack.back().second actually gets updated as the iterator
136 VisitStack.push_back(StackElement(Next, None));
143 VisitStack.pop_back();
144 } while (!VisitStack.empty())
[all...] |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
129 NodeRef BB = *VisitStack.back().second++;
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| DepthFirstIterator.h | 98 // VisitStack - Used to maintain the ordering. Top = current block
99 std::vector<StackElement> VisitStack;
104 VisitStack.push_back(StackElement(Node, None));
112 VisitStack.push_back(StackElement(Node, None));
122 NodeRef Node = VisitStack.back().first;
123 Optional<ChildItTy> &Opt = VisitStack.back().second;
129 // VisitStack.back().second actually gets updated as the iterator
136 VisitStack.push_back(StackElement(Next, None));
143 VisitStack.pop_back();
144 } while (!VisitStack.empty())
[all...] |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
129 NodeRef BB = *VisitStack.back().second++;
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
| /external/llvm/include/llvm/ADT/ |
| DepthFirstIterator.h | 75 // VisitStack - Used to maintain the ordering. Top = current block
78 std::vector<std::pair<PointerIntTy, ChildItTy>> VisitStack;
83 VisitStack.push_back(
92 VisitStack.push_back(
104 std::pair<PointerIntTy, ChildItTy> &Top = VisitStack.back();
118 VisitStack.push_back(
125 VisitStack.pop_back();
126 } while (!VisitStack.empty());
145 return VisitStack == x.VisitStack;
[all...] |
| PostOrderIterator.h | 101 // VisitStack - Used to maintain the ordering. Top = current block
103 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack;
106 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
107 NodeType *BB = *VisitStack.back().second++;
108 if (this->insertEdge(VisitStack.back().first, BB)) {
110 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
117 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
125 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
148 return VisitStack == x.VisitStack
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| DepthFirstIterator.h | 75 // VisitStack - Used to maintain the ordering. Top = current block
78 std::vector<std::pair<PointerIntTy, ChildItTy> > VisitStack;
82 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
91 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
103 std::pair<PointerIntTy, ChildItTy> &Top = VisitStack.back();
118 VisitStack.push_back(std::make_pair(PointerIntTy(Next, 0),
125 VisitStack.pop_back();
126 } while (!VisitStack.empty());
146 return VisitStack == x.VisitStack;
[all...] |
| PostOrderIterator.h | 60 // VisitStack - Used to maintain the ordering. Top = current block
62 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack;
65 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
66 NodeType *BB = *VisitStack.back().second++;
68 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
75 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
83 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
105 return VisitStack == x.VisitStack;
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 89 SmallVector<WorklistItem, 16> VisitStack;
97 VisitStack.clear();
100 VisitStack.push_back(WorklistItem(L->getHeader(), false));
102 while (!VisitStack.empty()) {
103 WorklistItem Item = VisitStack.pop_back_val();
156 VisitStack.push_back(WorklistItem(SuccBB, true));
164 VisitStack.push_back(WorklistItem(ExitBB, false));
175 VisitStack.push_back(WorklistItem(SuccBB, false));
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 77 SmallVector<WorklistItem, 16> VisitStack;
85 VisitStack.clear();
88 VisitStack.push_back(WorklistItem(L->getHeader(), false));
90 while (!VisitStack.empty()) {
91 WorklistItem Item = VisitStack.pop_back_val();
138 VisitStack.push_back(WorklistItem(SuccBB, true));
146 VisitStack.push_back(WorklistItem(ExitBB, false));
157 VisitStack.push_back(WorklistItem(SuccBB, false));
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
108 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
109 NodeRef BB = *VisitStack.back().second++;
110 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
112 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
119 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
129 NodeRef BB = *VisitStack.back().second++;
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
129 NodeRef BB = *VisitStack.back().second++;
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
129 NodeRef BB = *VisitStack.back().second++;
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
129 NodeRef BB = *VisitStack.back().second++;
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
129 NodeRef BB = *VisitStack.back().second++;
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
129 NodeRef BB = *VisitStack.back().second++;
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
108 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
109 NodeRef BB = *VisitStack.back().second++;
110 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
112 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
119 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| PostOrderIterator.h | 103 // VisitStack - Used to maintain the ordering. Top = current block
105 std::vector<std::pair<NodeRef, ChildItTy>> VisitStack;
109 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
118 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
128 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
129 NodeRef BB = *VisitStack.back().second++;
130 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
132 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
152 return VisitStack == x.VisitStack
[all...] |
