Searched refs:EdgeIterator (Results 1 – 12 of 12) sorted by relevance
/external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
D | nv50_ir_graph.h | 75 class EdgeIterator : public Iterator 78 EdgeIterator() : e(0), t(0), d(0), rev(false) { } in EdgeIterator() function 79 EdgeIterator(Graph::Edge *first, int dir, bool reverse) in EdgeIterator() function 115 inline EdgeIterator outgoing(bool reverse = false) const; 116 inline EdgeIterator incident(bool reverse = false) const; 207 Graph::EdgeIterator Graph::Node::outgoing(bool reverse) const in outgoing() 209 return EdgeIterator(out, 0, reverse); in outgoing() 212 Graph::EdgeIterator Graph::Node::incident(bool reverse) const in incident() 214 return EdgeIterator(in, 1, reverse); in incident() 220 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 | 131 EdgeIterator ei = this->outgoing(); in detach() 186 for (EdgeIterator ei = pos->outgoing(); !ei.end(); ei.next()) { in reachableBy() 225 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) in search() 300 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) { in search() 418 for (EdgeIterator ei = c->outgoing(); !ei.end(); ei.next()) { in findLightestPathWeight()
|
D | nv50_ir_ra.cpp | 358 for (Graph::EdgeIterator ei = p->cfg.outgoing(); !ei.end(); ei.next()) in needNewElseBlock() 387 Graph::EdgeIterator ei; in splitEdges() 465 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in visit() 567 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in buildLiveSets() 625 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in collectLiveValues() 652 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in visit() 741 static inline RIG_Node *get(const Graph::EdgeIterator& ei) in get() 785 inline void checkInterference(const RIG_Node *, Graph::EdgeIterator&); 835 for (Graph::EdgeIterator ei = nodes[i].outgoing(); !ei.end(); ei.next()) in printNodeInfo() 837 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 | 732 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) in visit() 748 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) in visit()
|
D | nv50_ir_lowering_nvc0.cpp | 301 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in findFirstUsesBB() 450 for (Graph::EdgeIterator ei = n->incident(); !ei.end(); ei.next()) { in insertTextureBarriers() 543 Graph::EdgeIterator ei = bb->cfg.incident(); in tryReplaceContWithBra() 567 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in propagateJoin()
|
D | nv50_ir_emit_nvc0.cpp | 3140 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in visit() 3180 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in visit()
|
D | nv50_ir_emit_gm107.cpp | 4065 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in visit() 4123 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 | 3022 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()
|