| /external/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 110 class edge_iterator; variable
239 edge_iterator begin() const { in begin()
240 return edge_iterator(Edges.begin(), Edges.end()); in begin()
242 edge_iterator end() const { return edge_iterator(Edges.end(), Edges.end()); } in end()
273 class edge_iterator
274 : public iterator_adaptor_base<edge_iterator, EdgeVectorImplT::iterator,
282 edge_iterator(EdgeVectorImplT::iterator BaseI, in edge_iterator() function
290 edge_iterator() {} in edge_iterator() function
293 edge_iterator &operator++() {
756 edge_iterator begin() { in begin()
[all …]
|
| /external/google-fruit/include/fruit/impl/data_structures/ |
| D | semistatic_graph.defn.h | 83 inline typename SemistaticGraph<NodeId, Node>::edge_iterator
87 return edge_iterator{reinterpret_cast<InternalNodeId*>(itr->edges_begin)}; in neighborsBegin()
91 inline SemistaticGraph<NodeId, Node>::edge_iterator::edge_iterator(InternalNodeId* itr) : itr(itr) … in edge_iterator() function
95 SemistaticGraph<NodeId, Node>::edge_iterator::getNodeIterator(node_iterator nodes_begin) { in getNodeIterator()
100 inline void SemistaticGraph<NodeId, Node>::edge_iterator::operator++() {
106 SemistaticGraph<NodeId, Node>::edge_iterator::getNodeIterator(std::size_t i, node_iterator nodes_be… in getNodeIterator()
|
| D | semistatic_graph.h | 108 class edge_iterator;
129 edge_iterator neighborsBegin();
153 class edge_iterator {
161 explicit edge_iterator(InternalNodeId* itr);
|
| /external/google-fruit/tests/ |
| D | test_common.h | 35 using edge_iterator = Graph::edge_iterator; variable
|
| /external/llvm-project/llvm/utils/TableGen/GlobalISel/ |
| D | GIMatchDag.h | 60 using edge_iterator = raw_pointer_iterator<EdgesVec::iterator>; variable
93 edge_iterator edges_begin() { in edges_begin()
96 edge_iterator edges_end() { in edges_end()
105 iterator_range<edge_iterator> edges() { in edges()
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| D | ObjCARCOpts.cpp | 303 typedef SmallVectorImpl<BasicBlock *>::const_iterator edge_iterator; typedef in __anoned3833b40111::BBState
304 edge_iterator pred_begin() const { return Preds.begin(); } in pred_begin()
305 edge_iterator pred_end() const { return Preds.end(); } in pred_end()
306 edge_iterator succ_begin() const { return Succs.begin(); } in succ_begin()
307 edge_iterator succ_end() const { return Succs.end(); } in succ_end()
1204 BBState::edge_iterator SI(MyStates.succ_begin()), in VisitBottomUp()
1239 for (BBState::edge_iterator PI(MyStates.pred_begin()), in VisitBottomUp()
1331 BBState::edge_iterator PI(MyStates.pred_begin()), in VisitTopDown()
1419 SmallVector<std::pair<BasicBlock *, BBState::edge_iterator>, 16> PredStack; in ComputePostOrders()
1431 BBState::edge_iterator PE = BBStates[PredStack.back().first].pred_end(); in ComputePostOrders()
|
| /external/google-fruit/include/fruit/impl/injector/ |
| D | injector_storage.h | 162 Graph::node_iterator lazyGetPtr(Graph::edge_iterator deps, std::size_t dep_index);
269 Graph::node_iterator lazyGetPtr(Graph::edge_iterator deps, std::size_t dep_index,
|
| D | injector_storage.defn.h | 253 InjectorStorage::lazyGetPtr(Graph::edge_iterator deps, std::size_t dep_index, Graph::node_iterator …
502 FixedSizeAllocator& allocator, InjectorStorage::Graph::edge_iterator deps) {
574 FixedSizeAllocator& allocator, InjectorStorage::Graph::edge_iterator deps) {
704 FixedSizeAllocator& allocator, InjectorStorage::Graph::edge_iterator deps) {
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/ObjCARC/ |
| D | ObjCARCOpts.cpp | 315 using edge_iterator = SmallVectorImpl<BasicBlock *>::const_iterator; typedef in __anonb3e876160111::BBState
317 edge_iterator pred_begin() const { return Preds.begin(); } in pred_begin()
318 edge_iterator pred_end() const { return Preds.end(); } in pred_end()
319 edge_iterator succ_begin() const { return Succs.begin(); } in succ_begin()
320 edge_iterator succ_end() const { return Succs.end(); } in succ_end()
1396 BBState::edge_iterator SI(MyStates.succ_begin()), in VisitBottomUp()
1439 for (BBState::edge_iterator PI(MyStates.pred_begin()), in VisitBottomUp()
1531 BBState::edge_iterator PI(MyStates.pred_begin()), in VisitTopDown()
1626 SmallVector<std::pair<BasicBlock *, BBState::edge_iterator>, 16> PredStack; in ComputePostOrders()
1638 BBState::edge_iterator PE = BBStates[PredStack.back().first].pred_end(); in ComputePostOrders()
|
| /external/llvm-project/llvm/lib/Transforms/ObjCARC/ |
| D | ObjCARCOpts.cpp | 315 using edge_iterator = SmallVectorImpl<BasicBlock *>::const_iterator; typedef in __anon4e70dfa20111::BBState
317 edge_iterator pred_begin() const { return Preds.begin(); } in pred_begin()
318 edge_iterator pred_end() const { return Preds.end(); } in pred_end()
319 edge_iterator succ_begin() const { return Succs.begin(); } in succ_begin()
320 edge_iterator succ_end() const { return Succs.end(); } in succ_end()
1429 BBState::edge_iterator SI(MyStates.succ_begin()), in VisitBottomUp()
1472 for (BBState::edge_iterator PI(MyStates.pred_begin()), in VisitBottomUp()
1564 BBState::edge_iterator PI(MyStates.pred_begin()), in VisitTopDown()
1668 SmallVector<std::pair<BasicBlock *, BBState::edge_iterator>, 16> PredStack; in ComputePostOrders()
1680 BBState::edge_iterator PE = BBStates[PredStack.back().first].pred_end(); in ComputePostOrders()
|
| /external/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/ |
| D | JITLink.h | 171 using edge_iterator = EdgeVector::iterator; variable
235 iterator_range<edge_iterator> edges() { in edges()
252 edge_iterator removeEdge(edge_iterator I) { return Edges.erase(I); } in removeEdge()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/ExecutionEngine/JITLink/ |
| D | JITLink.cpp | 182 std::vector<Block::edge_iterator> EdgesToRemove; in splitBlock()
|
| /external/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
| D | JITLink.cpp | 209 std::vector<Block::edge_iterator> EdgesToRemove; in splitBlock()
|
| /external/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 1019 SmallVector<std::pair<Node *, edge_iterator>, 4> DFSStack; in removeInternalRefEdge()
1041 edge_iterator I; in removeInternalRefEdge()
1439 edge_iterator I; in getNextRefSCCInPostOrder()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ExecutionEngine/JITLink/ |
| D | JITLink.h | 170 using edge_iterator = EdgeVector::iterator; variable
234 iterator_range<edge_iterator> edges() { in edges()
|
| /external/llvm/test/CodeGen/X86/ |
| D | 2006-09-01-CycleInDAG.ll | 27 %struct.edge_iterator = type { i32, %struct.VEC_edge** }
|
| D | 2007-10-15-CoalescerCrash.ll | 23 %struct.edge_iterator = type { i32, %struct.VEC_edge** }
|
| /external/llvm-project/llvm/test/CodeGen/X86/ |
| D | 2006-09-01-CycleInDAG.ll | 27 %struct.edge_iterator = type { i32, %struct.VEC_edge** }
|
| D | 2007-10-15-CoalescerCrash.ll | 23 %struct.edge_iterator = type { i32, %struct.VEC_edge** }
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 118 class edge_iterator; variable
|
| /external/llvm-project/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 118 class edge_iterator; variable
|