Searched refs:Graph (Results 1 - 25 of 33) sorted by relevance

12

/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.h31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
35 class Graph class in namespace:nv50_ir
72 friend class Graph;
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
99 Graph::Edge *e;
100 Graph::Edge *t;
129 Graph *getGraph() const { return graph; }
136 Graph *grap
[all...]
H A Dnv50_ir_graph.cpp31 Graph::Graph() function in class:nv50_ir::Graph
38 Graph::~Graph()
44 void Graph::insert(Node *node)
53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
87 Graph::Node::Node(void *priv) : data(priv),
95 void Graph::Node::attach(Node *node, Edge::Type kind)
129 bool Graph
[all...]
H A Dnv50_ir_bb.cpp106 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
117 Graph::Node *dn = dom.parent();
314 Graph::Edge *e = cfg.outgoing(true).getEdge();
326 this->cfg.attach(&bb->cfg, Graph::Edge::TREE);
358 Graph::Node *bn = &that->dom;
359 Graph::Node *dn = &this->dom;
370 Graph::Node *out[2];
372 Graph::Edge::Type eR;
378 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next())
383 if (eR == Graph
[all...]
H A Dnv50_ir_ssa.cpp32 class DominatorTree : public Graph
35 DominatorTree(Graph *cfg);
52 Graph *cfg;
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph),
98 void DominatorTree::buildDFS(Graph::Node *node)
102 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) {
145 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) {
176 nw->attach(nv, Graph::Edge::TREE);
230 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
271 for (Graph
[all...]
H A Dnv50_ir.h1152 static inline BasicBlock *get(Graph::Node *);
1155 Graph::Node cfg; // first edge is branch *taken* (the ELSE branch)
1156 Graph::Node dom;
1191 static inline Function *get(Graph::Node *node);
1222 Graph cfg;
1223 Graph::Node *cfgExit;
1224 Graph *domTree;
1225 Graph::Node call; // node in the call graph
1305 Graph calls;
H A Dnv50_ir_inlines.h404 BasicBlock *BasicBlock::get(Graph::Node *node)
410 Function *Function::get(Graph::Node *node)
H A Dnv50_ir_ra.cpp359 for (Graph::EdgeIterator ei = p->cfg.outgoing(); !ei.end(); ei.next())
360 if (ei.getType() == Graph::Edge::TREE ||
361 ei.getType() == Graph::Edge::FORWARD)
388 Graph::EdgeIterator ei;
421 pb->cfg.attach(&pn->cfg, Graph::Edge::TREE);
422 pn->cfg.attach(&bb->cfg, Graph::Edge::FORWARD);
466 for (Graph::EdgeIterator ei = bb->cfg.incident(); !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()) {
627 if (ei.getType() == Graph
[all...]
H A Dnv50_ir_lowering_nvc0.cpp476 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
600 Graph::Node *n = reinterpret_cast<Graph::Node *>(bi->get());
622 Graph::Node *n = reinterpret_cast<Graph::Node *>(bi->get());
625 for (Graph::EdgeIterator ei = n->incident(); !ei.end(); ei.next()) {
647 Graph::Node *n = reinterpret_cast<Graph::Node *>(bi->get());
720 Graph::EdgeIterator ei = bb->cfg.incident();
721 if (ei.getType() != Graph
[all...]
H A Dnv50_ir_print.cpp789 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next())
805 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next())
H A Dnv50_ir_from_nir.cpp1611 bb->cfg.attach(&exit->cfg, Graph::Edge::TREE);
1671 bb->cfg.attach(&ifBB->cfg, Graph::Edge::TREE);
1672 bb->cfg.attach(&elseBB->cfg, Graph::Edge::TREE);
1693 bb->cfg.attach(&tailBB->cfg, Graph::Edge::FORWARD);
1706 bb->cfg.attach(&tailBB->cfg, Graph::Edge::FORWARD);
1726 bb->cfg.attach(&loopBB->cfg, Graph::Edge::TREE);
1740 bb->cfg.attach(&loopBB->cfg, Graph::Edge::BACK);
1745 bb->cfg.attach(&tailBB->cfg, Graph::Edge::TREE);
2626 bb->cfg.attach(&exit->cfg, Graph::Edge::CROSS);
2635 bb->cfg.attach(&target->cfg, isBreak ? Graph
[all...]
H A Dnv50_ir_from_tgsi.cpp3581 bb->cfg.attach(&ifBB->cfg, Graph::Edge::TREE);
3595 forkBB->cfg.attach(&elseBB->cfg, Graph::Edge::TREE);
3616 bb->cfg.attach(&convBB->cfg, Graph::Edge::FORWARD);
3620 prevBB->cfg.attach(&convBB->cfg, Graph::Edge::FORWARD);
3638 bb->cfg.attach(&lbgnBB->cfg, Graph::Edge::TREE);
3649 bb->cfg.attach(&loopBB->cfg, Graph::Edge::BACK);
3657 loopBB->cfg.attach(&getBB()->cfg, Graph::Edge::TREE);
3666 bb->cfg.attach(&brkBB->cfg, Graph::Edge::CROSS);
3676 bb->cfg.attach(&contBB->cfg, Graph::Edge::BACK);
3687 prog->main->call.attach(&s->f->call, Graph
[all...]
H A Dnv50_ir_lowering_nv50.cpp924 currBB->cfg.attach(&texiBB->cfg, Graph::Edge::FORWARD);
927 currBB->cfg.attach(&laneBB->cfg, Graph::Edge::TREE);
H A Dnv50_ir_emit_gm107.cpp4420 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
4422 if (ei.getType() == Graph::Edge::BACK) // sched would be uninitialized
4478 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
4481 if (ei.getType() != Graph::Edge::BACK) {
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.h31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
35 class Graph class in namespace:nv50_ir
71 friend class Graph;
78 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
86 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
98 Graph::Edge *e;
99 Graph::Edge *t;
128 Graph *getGraph() const { return graph; }
135 Graph *grap
[all...]
H A Dnv50_ir_graph.cpp31 Graph::Graph() function in class:nv50_ir::Graph
38 Graph::~Graph()
44 void Graph::insert(Node *node)
53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
86 Graph::Node::Node(void *priv) : data(priv),
95 void Graph::Node::attach(Node *node, Edge::Type kind)
129 bool Graph
[all...]
H A Dnv50_ir_bb.cpp106 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
117 Graph::Node *dn = dom.parent();
314 Graph::Edge *e = cfg.outgoing(true).getEdge();
326 this->cfg.attach(&bb->cfg, Graph::Edge::TREE);
358 Graph::Node *bn = &that->dom;
359 Graph::Node *dn = &this->dom;
370 Graph::Node *out[2];
372 Graph::Edge::Type eR;
378 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next())
383 if (eR == Graph
[all...]
H A Dnv50_ir_ssa.cpp32 class DominatorTree : public Graph
35 DominatorTree(Graph *cfg);
52 Graph *cfg;
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph),
98 void DominatorTree::buildDFS(Graph::Node *node)
102 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) {
145 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) {
176 nw->attach(nv, Graph::Edge::TREE);
230 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
271 for (Graph
[all...]
H A Dnv50_ir.h1206 static inline BasicBlock *get(Graph::Node *);
1209 Graph::Node cfg; // first edge is branch *taken* (the ELSE branch)
1210 Graph::Node dom;
1245 static inline Function *get(Graph::Node *node);
1276 Graph cfg;
1277 Graph::Node *cfgExit;
1278 Graph *domTree;
1279 Graph::Node call; // node in the call graph
1359 Graph calls;
H A Dnv50_ir_inlines.h404 BasicBlock *BasicBlock::get(Graph::Node *node)
410 Function *Function::get(Graph::Node *node)
H A Dnv50_ir_ra.cpp404 for (Graph::EdgeIterator ei = p->cfg.outgoing(); !ei.end(); ei.next())
405 if (ei.getType() == Graph::Edge::TREE ||
406 ei.getType() == Graph::Edge::FORWARD)
433 Graph::EdgeIterator ei;
466 pb->cfg.attach(&pn->cfg, Graph::Edge::TREE);
467 pn->cfg.attach(&bb->cfg, Graph::Edge::FORWARD);
511 for (Graph::EdgeIterator ei = bb->cfg.incident(); !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
[all...]
H A Dnv50_ir_lowering_nvc0.cpp487 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
611 Graph::Node *n = reinterpret_cast<Graph::Node *>(bi->get());
633 Graph::Node *n = reinterpret_cast<Graph::Node *>(bi->get());
636 for (Graph::EdgeIterator ei = n->incident(); !ei.end(); ei.next()) {
658 Graph::Node *n = reinterpret_cast<Graph::Node *>(bi->get());
731 Graph::EdgeIterator ei = bb->cfg.incident();
732 if (ei.getType() != Graph
[all...]
H A Dnv50_ir_from_nir.cpp1389 bb->cfg.attach(&exit->cfg, Graph::Edge::TREE);
1449 bb->cfg.attach(&ifBB->cfg, Graph::Edge::TREE);
1450 bb->cfg.attach(&elseBB->cfg, Graph::Edge::TREE);
1464 bb->cfg.attach(&tailBB->cfg, Graph::Edge::FORWARD);
1478 bb->cfg.attach(&tailBB->cfg, Graph::Edge::FORWARD);
1509 bb->cfg.attach(&loopBB->cfg, Graph::Edge::TREE);
1522 bb->cfg.attach(&loopBB->cfg, Graph::Edge::BACK);
1526 loopBB->cfg.attach(&tailBB->cfg, Graph::Edge::TREE);
2402 bb->cfg.attach(&exit->cfg, Graph::Edge::CROSS);
2410 bb->cfg.attach(&target->cfg, isBreak ? Graph
[all...]
H A Dnv50_ir_from_tgsi.cpp3613 bb->cfg.attach(&ifBB->cfg, Graph::Edge::TREE);
3627 forkBB->cfg.attach(&elseBB->cfg, Graph::Edge::TREE);
3648 bb->cfg.attach(&convBB->cfg, Graph::Edge::FORWARD);
3652 prevBB->cfg.attach(&convBB->cfg, Graph::Edge::FORWARD);
3670 bb->cfg.attach(&lbgnBB->cfg, Graph::Edge::TREE);
3681 bb->cfg.attach(&loopBB->cfg, Graph::Edge::BACK);
3689 loopBB->cfg.attach(&getBB()->cfg, Graph::Edge::TREE);
3698 bb->cfg.attach(&brkBB->cfg, Graph::Edge::CROSS);
3708 bb->cfg.attach(&contBB->cfg, Graph::Edge::BACK);
3719 prog->main->call.attach(&s->f->call, Graph
[all...]
H A Dnv50_ir_lowering_nv50.cpp978 currBB->cfg.attach(&texiBB->cfg, Graph::Edge::FORWARD);
981 currBB->cfg.attach(&laneBB->cfg, Graph::Edge::TREE);
1476 currBB->cfg.attach(&tryLockBB->cfg, Graph::Edge::TREE);
1494 tryLockBB->cfg.attach(&failLockBB->cfg, Graph::Edge::CROSS);
1495 tryLockBB->cfg.attach(&setAndUnlockBB->cfg, Graph::Edge::TREE);
1557 setAndUnlockBB->cfg.attach(&failLockBB->cfg, Graph::Edge::TREE);
1563 failLockBB->cfg.attach(&tryLockBB->cfg, Graph::Edge::BACK);
1564 failLockBB->cfg.attach(&joinBB->cfg, Graph::Edge::TREE);
H A Dnv50_ir_print.cpp829 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next())
845 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next())

Completed in 86 milliseconds

12