| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/ |
| H A D | nv50_ir_graph.cpp | 76 case TREE: return "tree";
302 case Graph::Edge::TREE:
343 * - TREE: edges that belong to a spanning tree of the graph
378 edge->type = Edge::TREE;
394 edge->type = Edge::TREE;
|
| H A D | nv50_ir_graph.h | 46 TREE, enumerator in enum:nv50_ir::Graph::Edge::Type
|
| H A D | nv50_ir_bb.cpp | 326 this->cfg.attach(&bb->cfg, Graph::Edge::TREE);
527 case Graph::Edge::TREE:
|
| H A D | nv50_ir_ssa.cpp | 176 nw->attach(nv, Graph::Edge::TREE);
|
| H A D | nv50_ir_from_tgsi.cpp | 3581 bb->cfg.attach(&ifBB->cfg, Graph::Edge::TREE);
3595 forkBB->cfg.attach(&elseBB->cfg, Graph::Edge::TREE);
3638 bb->cfg.attach(&lbgnBB->cfg, Graph::Edge::TREE);
3657 loopBB->cfg.attach(&getBB()->cfg, Graph::Edge::TREE);
3687 prog->main->call.attach(&s->f->call, Graph::Edge::TREE);
3705 func->call.attach(&s->f->call, Graph::Edge::TREE);
3733 bb->cfg.attach(&epilogue->cfg, Graph::Edge::TREE);
|
| H A D | nv50_ir_from_nir.cpp | 1611 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);
1726 bb->cfg.attach(&loopBB->cfg, Graph::Edge::TREE);
1745 bb->cfg.attach(&tailBB->cfg, Graph::Edge::TREE);
|
| H A D | nv50_ir_lowering_nvc0.cpp | 1455 currBB->cfg.attach(&tryLockBB->cfg, Graph::Edge::TREE);
1468 tryLockBB->cfg.attach(&setAndUnlockBB->cfg, Graph::Edge::TREE);
1523 setAndUnlockBB->cfg.attach(&failLockBB->cfg, Graph::Edge::TREE);
1530 failLockBB->cfg.attach(&joinBB->cfg, Graph::Edge::TREE);
1550 currBB->cfg.attach(&tryLockAndSetBB->cfg, Graph::Edge::TREE);
|
| H A D | nv50_ir_lowering_nv50.cpp | 927 currBB->cfg.attach(&laneBB->cfg, Graph::Edge::TREE);
|
| H A D | nv50_ir_ra.cpp | 360 if (ei.getType() == Graph::Edge::TREE ||
421 pb->cfg.attach(&pn->cfg, Graph::Edge::TREE);
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/ |
| H A D | nv50_ir_graph.cpp | 76 case TREE: return "tree";
302 case Graph::Edge::TREE:
342 * - TREE: edges that belong to a spanning tree of the graph
375 edge->type = Edge::TREE;
389 edge->type = Edge::TREE;
|
| H A D | nv50_ir_graph.h | 46 TREE, enumerator in enum:nv50_ir::Graph::Edge::Type
|
| H A D | nv50_ir_bb.cpp | 326 this->cfg.attach(&bb->cfg, Graph::Edge::TREE);
527 case Graph::Edge::TREE:
|
| H A D | nv50_ir_ssa.cpp | 176 nw->attach(nv, Graph::Edge::TREE);
|
| H A D | nv50_ir_from_tgsi.cpp | 3613 bb->cfg.attach(&ifBB->cfg, Graph::Edge::TREE);
3627 forkBB->cfg.attach(&elseBB->cfg, Graph::Edge::TREE);
3670 bb->cfg.attach(&lbgnBB->cfg, Graph::Edge::TREE);
3689 loopBB->cfg.attach(&getBB()->cfg, Graph::Edge::TREE);
3719 prog->main->call.attach(&s->f->call, Graph::Edge::TREE);
3737 func->call.attach(&s->f->call, Graph::Edge::TREE);
3765 bb->cfg.attach(&epilogue->cfg, Graph::Edge::TREE);
|
| H A D | nv50_ir_from_nir.cpp | 1389 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);
1509 bb->cfg.attach(&loopBB->cfg, Graph::Edge::TREE);
1526 loopBB->cfg.attach(&tailBB->cfg, Graph::Edge::TREE);
|
| H A D | nv50_ir_lowering_nv50.cpp | 981 currBB->cfg.attach(&laneBB->cfg, Graph::Edge::TREE);
1476 currBB->cfg.attach(&tryLockBB->cfg, Graph::Edge::TREE);
1495 tryLockBB->cfg.attach(&setAndUnlockBB->cfg, Graph::Edge::TREE);
1557 setAndUnlockBB->cfg.attach(&failLockBB->cfg, Graph::Edge::TREE);
1564 failLockBB->cfg.attach(&joinBB->cfg, Graph::Edge::TREE);
|
| H A D | nv50_ir_lowering_nvc0.cpp | 1469 currBB->cfg.attach(&tryLockBB->cfg, Graph::Edge::TREE);
1482 tryLockBB->cfg.attach(&setAndUnlockBB->cfg, Graph::Edge::TREE);
1537 setAndUnlockBB->cfg.attach(&failLockBB->cfg, Graph::Edge::TREE);
1544 failLockBB->cfg.attach(&joinBB->cfg, Graph::Edge::TREE);
1564 currBB->cfg.attach(&tryLockAndSetBB->cfg, Graph::Edge::TREE);
|
| H A D | nv50_ir_ra.cpp | 405 if (ei.getType() == Graph::Edge::TREE ||
466 pb->cfg.attach(&pn->cfg, Graph::Edge::TREE);
|