| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| D | nv50_ir_graph.h | 74 class EdgeIterator : public Iterator
77 EdgeIterator() : e(0), t(0), d(0), rev(false) { } in EdgeIterator() function
78 EdgeIterator(Graph::Edge *first, int dir, bool reverse) in EdgeIterator() function
114 inline EdgeIterator outgoing(bool reverse = false) const;
115 inline EdgeIterator incident(bool reverse = false) const;
206 Graph::EdgeIterator Graph::Node::outgoing(bool reverse) const in outgoing()
208 return EdgeIterator(out, 0, reverse); in outgoing()
211 Graph::EdgeIterator Graph::Node::incident(bool reverse) const in incident()
213 return EdgeIterator(in, 1, reverse); in incident()
219 for (EdgeIterator ei = incident(); !ei.end(); ei.next()) in incidentCountFwd()
|
| D | nv50_ir_ssa.cpp | 102 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) { in buildDFS()
145 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) { in build()
195 EdgeIterator succIt, chldIt; in findDominanceFrontiers()
230 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in buildLiveSetsPreSSA()
271 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in buildDefSetsPreSSA()
503 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in search()
509 for (Graph::EdgeIterator ei = sb->cfg.incident(); !ei.end(); ei.next()) { in search()
525 for (Graph::EdgeIterator ei = bb->dom.outgoing(); !ei.end(); ei.next()) in search()
|
| D | nv50_ir_graph.cpp | 130 EdgeIterator ei = this->outgoing(); in detach()
185 for (EdgeIterator ei = pos->outgoing(); !ei.end(); ei.next()) { in reachableBy()
224 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) in search()
299 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) { in search()
412 for (EdgeIterator ei = c->outgoing(); !ei.end(); ei.next()) { in findLightestPathWeight()
|
| D | nv50_ir_ra.cpp | 403 for (Graph::EdgeIterator ei = p->cfg.outgoing(); !ei.end(); ei.next()) in needNewElseBlock()
432 Graph::EdgeIterator ei; in splitEdges()
510 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in visit()
612 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in buildLiveSets()
670 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in collectLiveValues()
695 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in visit()
784 static inline RIG_Node *get(const Graph::EdgeIterator& ei) in get()
829 inline void checkInterference(const RIG_Node *, Graph::EdgeIterator&);
895 for (Graph::EdgeIterator ei = nodes[i].outgoing(); !ei.end(); ei.next()) in printNodeInfo()
897 for (Graph::EdgeIterator ei = nodes[i].incident(); !ei.end(); ei.next()) in printNodeInfo()
[all …]
|
| D | nv50_ir_bb.cpp | 106 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) { in clone()
378 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next()) in initiatesSimpleConditional()
524 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in printCFGraph()
|
| D | nv50_ir_print.cpp | 800 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) in visit()
816 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) in visit()
|
| D | nv50_ir_lowering_nvc0.cpp | 487 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in findFirstUsesBB()
636 for (Graph::EdgeIterator ei = n->incident(); !ei.end(); ei.next()) { in insertTextureBarriers()
731 Graph::EdgeIterator ei = bb->cfg.incident(); in tryReplaceContWithBra()
755 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in propagateJoin()
|
| D | nv50_ir_emit_nvc0.cpp | 3242 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in visit()
3282 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in visit()
|
| D | nv50_ir_emit_gm107.cpp | 4334 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in visit()
4392 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in visit()
|
| D | nv50_ir_emit_nv50.cpp | 2185 for (Graph::EdgeIterator ei = func->cfgExit->incident(); in replaceExitWithModifier()
|
| D | nv50_ir_peephole.cpp | 3462 Graph::EdgeIterator ei = bb->cfg.outgoing(); in tryPredicateConditional()
|
| /external/llvm/include/llvm/Support/ |
| D | GCOV.h | 312 typedef SmallVectorImpl<GCOVEdge *>::const_iterator EdgeIterator; typedef
339 EdgeIterator src_begin() const { return SrcEdges.begin(); } in src_begin()
340 EdgeIterator src_end() const { return SrcEdges.end(); } in src_end()
341 iterator_range<EdgeIterator> srcs() const { in srcs()
345 EdgeIterator dst_begin() const { return DstEdges.begin(); } in dst_begin()
346 EdgeIterator dst_end() const { return DstEdges.end(); } in dst_end()
347 iterator_range<EdgeIterator> dsts() const { in dsts()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ProfileData/ |
| D | GCOV.h | 322 using EdgeIterator = SmallVectorImpl<GCOVEdge *>::const_iterator;
353 EdgeIterator src_begin() const { return SrcEdges.begin(); } in src_begin()
354 EdgeIterator src_end() const { return SrcEdges.end(); } in src_end()
355 iterator_range<EdgeIterator> srcs() const { in srcs()
359 EdgeIterator dst_begin() const { return DstEdges.begin(); } in dst_begin()
360 EdgeIterator dst_end() const { return DstEdges.end(); } in dst_end()
361 iterator_range<EdgeIterator> dsts() const { in dsts()
|
| /external/llvm-project/llvm/include/llvm/XRay/ |
| D | Graph.h | 303 using EdgeIterator = typename EdgeMapT::iterator; variable
313 std::conditional_t<isConst, ConstEdgeIterator, EdgeIterator>;
460 std::pair<EdgeIterator, bool>
477 std::pair<EdgeIterator, bool>
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/XRay/ |
| D | Graph.h | 303 using EdgeIterator = typename EdgeMapT::iterator; variable
313 EdgeIterator>::type;
460 std::pair<EdgeIterator, bool>
477 std::pair<EdgeIterator, bool>
|
| /external/llvm-project/llvm/include/llvm/ProfileData/ |
| D | GCOV.h | 269 using EdgeIterator = SmallVectorImpl<GCOVArc *>::const_iterator;
284 iterator_range<EdgeIterator> srcs() const { in srcs()
288 iterator_range<EdgeIterator> dsts() const { in dsts()
|