Searched refs:incident (Results 1 - 16 of 16) sorted by relevance

/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.h67 Edge *next[2]; // next edge outgoing/incident from/to origin/target
116 inline EdgeIterator incident(bool reverse = false) const;
118 inline Node *parent() const; // returns NULL if count(incident edges) != 1
125 inline int incidentCountFwd() const; // count of incident non-back edges
212 Graph::EdgeIterator Graph::Node::incident(bool reverse) const function in class:nv50_ir::Graph::Node
220 for (EdgeIterator ei = incident(); !ei.end(); ei.next())
H A Dnv50_ir_ssa.cpp145 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) {
271 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
476 // PHI sources get definitions from the passes through the incident BBs,
509 for (Graph::EdgeIterator ei = sb->cfg.incident(); !ei.end(); ei.next()) {
H A Dnv50_ir_ra.cpp377 // specific edge transitions. Unfortunately manipulating incident edges into a
379 // by incident edge order.
392 for (ei = bb->cfg.incident(); !ei.end(); ei.next()) {
409 for (ei = bb->cfg.incident(); !ei.end(); ei.next(), j++) {
438 for (ei = bb->cfg.incident(); !ei.end(); ei.next(), j++) {
466 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
853 for (Graph::EdgeIterator ei = nodes[i].incident(); !ei.end(); ei.next())
1312 for (Graph::EdgeIterator ei = node->incident(); !ei.end(); ei.next())
1429 for (Graph::EdgeIterator ei = node->incident(); !ei.end(); ei.next())
H A Dnv50_ir_print.cpp789 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next())
H A Dnv50_ir_lowering_nvc0.cpp625 for (Graph::EdgeIterator ei = n->incident(); !ei.end(); ei.next()) {
720 Graph::EdgeIterator ei = bb->cfg.incident();
744 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
H A Dnv50_ir_emit_nv50.cpp2185 for (Graph::EdgeIterator ei = func->cfgExit->incident();
H A Dnv50_ir_emit_gm107.cpp4420 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
H A Dnv50_ir_emit_nvc0.cpp3242 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.h66 Edge *next[2]; // next edge outgoing/incident from/to origin/target
115 inline EdgeIterator incident(bool reverse = false) const;
117 inline Node *parent() const; // returns NULL if count(incident edges) != 1
124 inline int incidentCountFwd() const; // count of incident non-back edges
211 Graph::EdgeIterator Graph::Node::incident(bool reverse) const function in class:nv50_ir::Graph::Node
219 for (EdgeIterator ei = incident(); !ei.end(); ei.next())
H A Dnv50_ir_ssa.cpp145 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) {
271 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
476 // PHI sources get definitions from the passes through the incident BBs,
509 for (Graph::EdgeIterator ei = sb->cfg.incident(); !ei.end(); ei.next()) {
H A Dnv50_ir_ra.cpp422 // specific edge transitions. Unfortunately manipulating incident edges into a
424 // by incident edge order.
437 for (ei = bb->cfg.incident(); !ei.end(); ei.next()) {
454 for (ei = bb->cfg.incident(); !ei.end(); ei.next(), j++) {
483 for (ei = bb->cfg.incident(); !ei.end(); ei.next(), j++) {
511 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
898 for (Graph::EdgeIterator ei = nodes[i].incident(); !ei.end(); ei.next())
1361 for (Graph::EdgeIterator ei = node->incident(); !ei.end(); ei.next())
1478 for (Graph::EdgeIterator ei = node->incident(); !ei.end(); ei.next())
H A Dnv50_ir_print.cpp829 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next())
H A Dnv50_ir_lowering_nvc0.cpp636 for (Graph::EdgeIterator ei = n->incident(); !ei.end(); ei.next()) {
731 Graph::EdgeIterator ei = bb->cfg.incident();
755 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
H A Dnv50_ir_emit_nv50.cpp2272 for (Graph::EdgeIterator ei = func->cfgExit->incident();
H A Dnv50_ir_emit_gm107.cpp4343 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
H A Dnv50_ir_emit_nvc0.cpp3250 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {

Completed in 54 milliseconds