Searched refs:outgoing (Results 1 - 20 of 20) sorted by relevance

/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_bb.cpp106 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
313 while (!cfg.outgoing(true).end()) {
314 Graph::Edge *e = cfg.outgoing(true).getEdge();
378 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next())
380 eR = out[1]->outgoing().getType();
389 if (out[1]->outgoing().getNode() == out[0])
392 if (out[0]->outgoing().getNode() == out[1]->outgoing().getNode())
524 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
H A Dnv50_ir_graph.h67 Edge *next[2]; // next edge outgoing/incident from/to origin/target
115 inline EdgeIterator outgoing(bool reverse = false) const;
207 Graph::EdgeIterator Graph::Node::outgoing(bool reverse) const function in class:nv50_ir::Graph::Node
H A Dnv50_ir_graph.cpp131 EdgeIterator ei = this->outgoing();
186 for (EdgeIterator ei = pos->outgoing(); !ei.end(); ei.next()) {
225 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next())
300 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) {
418 for (EdgeIterator ei = c->outgoing(); !ei.end(); ei.next()) {
H A Dnv50_ir_ssa.cpp102 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) {
200 for (succIt = bb->cfg.outgoing(); !succIt.end(); succIt.next()) {
206 for (chldIt = bb->dom.outgoing(); !chldIt.end(); chldIt.next()) {
230 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
502 // Update sources of PHI ops corresponding to this BB in outgoing BBs.
503 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
525 for (Graph::EdgeIterator ei = bb->dom.outgoing(); !ei.end(); ei.next())
H A Dnv50_ir_ra.cpp359 for (Graph::EdgeIterator ei = p->cfg.outgoing(); !ei.end(); ei.next())
568 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
626 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
653 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
851 for (Graph::EdgeIterator ei = nodes[i].outgoing(); !ei.end(); ei.next())
1309 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next())
1427 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next())
H A Dnv50_ir_print.cpp805 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next())
H A Dnv50_ir_peephole.cpp3264 Graph::Edge::Type ty = term->bb->cfg.outgoing().getType();
3416 Graph::EdgeIterator ei = bb->cfg.outgoing();
3450 bb = BasicBlock::get((bL ? bL : bR)->cfg.outgoing().getNode());
H A Dnv50_ir_emit_gm107.cpp4478 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
4482 // Only test the first instruction of the outgoing block.
4487 // When the outgoing BB is empty, make sure to set the number of
H A Dnv50_ir_emit_nvc0.cpp3282 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
3286 // only test the first instruction of the outgoing block
H A Dnv50_ir_lowering_nvc0.cpp476 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_bb.cpp106 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
313 while (!cfg.outgoing(true).end()) {
314 Graph::Edge *e = cfg.outgoing(true).getEdge();
378 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next())
380 eR = out[1]->outgoing().getType();
389 if (out[1]->outgoing().getNode() == out[0])
392 if (out[0]->outgoing().getNode() == out[1]->outgoing().getNode())
524 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
H A Dnv50_ir_graph.h66 Edge *next[2]; // next edge outgoing/incident from/to origin/target
114 inline EdgeIterator outgoing(bool reverse = false) const;
206 Graph::EdgeIterator Graph::Node::outgoing(bool reverse) const function in class:nv50_ir::Graph::Node
H A Dnv50_ir_graph.cpp131 EdgeIterator ei = this->outgoing();
186 for (EdgeIterator ei = pos->outgoing(); !ei.end(); ei.next()) {
225 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next())
300 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) {
413 for (EdgeIterator ei = c->outgoing(); !ei.end(); ei.next()) {
H A Dnv50_ir_ssa.cpp102 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) {
200 for (succIt = bb->cfg.outgoing(); !succIt.end(); succIt.next()) {
206 for (chldIt = bb->dom.outgoing(); !chldIt.end(); chldIt.next()) {
230 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
502 // Update sources of PHI ops corresponding to this BB in outgoing BBs.
503 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
525 for (Graph::EdgeIterator ei = bb->dom.outgoing(); !ei.end(); ei.next())
H A Dnv50_ir_ra.cpp404 for (Graph::EdgeIterator ei = p->cfg.outgoing(); !ei.end(); ei.next())
613 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
671 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
696 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
896 for (Graph::EdgeIterator ei = nodes[i].outgoing(); !ei.end(); ei.next())
1358 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next())
1476 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next())
H A Dnv50_ir_print.cpp845 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next())
H A Dnv50_ir_peephole.cpp3338 Graph::Edge::Type ty = term->bb->cfg.outgoing().getType();
3490 Graph::EdgeIterator ei = bb->cfg.outgoing();
3524 bb = BasicBlock::get((bL ? bL : bR)->cfg.outgoing().getNode());
H A Dnv50_ir_emit_gm107.cpp4401 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
4405 // Only test the first instruction of the outgoing block.
4410 // When the outgoing BB is empty, make sure to set the number of
H A Dnv50_ir_emit_nvc0.cpp3290 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
3294 // only test the first instruction of the outgoing block
H A Dnv50_ir_lowering_nvc0.cpp487 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {

Completed in 99 milliseconds