Searched refs:Edge (Results 1 - 25 of 31) sorted by relevance

12

/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.h32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
40 class Edge class in class:nv50_ir::Graph
53 Edge(Node *dst, Node *src, Type kind);
54 ~Edge() { unlink(); }
67 Edge *next[2]; // next edge outgoing/incident from/to origin/target
68 Edge *prev[2];
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
95 inline Edge *getEdge() const { return e; }
96 inline Edge
[all...]
H A Dnv50_ir_graph.cpp53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
95 void Graph::Node::attach(Node *node, Edge::Type kind)
97 Edge *edge = new Edge(this, node, kind);
125 if (kind == Edge::UNKNOWN)
158 Graph::Edge::Edge(Node *org, Node *tgt, Type kind) function in class:nv50_ir::Graph::Edge
187 if (ei.getType() == Edge::BACK || ei.getType() == Edge
[all...]
H A Dnv50_ir_bb.cpp314 Graph::Edge *e = cfg.outgoing(true).getEdge();
326 this->cfg.attach(&bb->cfg, Graph::Edge::TREE);
372 Graph::Edge::Type eR;
383 if (eR == Graph::Edge::CROSS || eR == Graph::Edge::BACK)
527 case Graph::Edge::TREE:
530 case Graph::Edge::FORWARD:
533 case Graph::Edge::CROSS:
536 case Graph::Edge::BACK:
539 case Graph::Edge
[all...]
H A Dnv50_ir_lowering_nvc0.cpp721 if (ei.getType() != Graph::Edge::BACK)
723 if (ei.getType() != Graph::Edge::BACK)
734 assert(ei.end() || ei.getType() != Graph::Edge::BACK);
1455 currBB->cfg.attach(&tryLockBB->cfg, Graph::Edge::TREE);
1467 tryLockBB->cfg.attach(&failLockBB->cfg, Graph::Edge::CROSS);
1468 tryLockBB->cfg.attach(&setAndUnlockBB->cfg, Graph::Edge::TREE);
1523 setAndUnlockBB->cfg.attach(&failLockBB->cfg, Graph::Edge::TREE);
1529 failLockBB->cfg.attach(&tryLockBB->cfg, Graph::Edge::BACK);
1530 failLockBB->cfg.attach(&joinBB->cfg, Graph::Edge::TREE);
1550 currBB->cfg.attach(&tryLockAndSetBB->cfg, Graph::Edge
[all...]
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::Edge
[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::Edge
[all...]
H A Dnv50_ir_ssa.cpp176 nw->attach(nv, Graph::Edge::TREE);
H A Dnv50_ir_ra.cpp360 if (ei.getType() == Graph::Edge::TREE ||
361 ei.getType() == Graph::Edge::FORWARD)
421 pb->cfg.attach(&pn->cfg, Graph::Edge::TREE);
422 pn->cfg.attach(&bb->cfg, Graph::Edge::FORWARD);
627 if (ei.getType() == Graph::Edge::DUMMY)
1157 this->attach(node, Graph::Edge::CROSS);
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_peephole.cpp3264 Graph::Edge::Type ty = term->bb->cfg.outgoing().getType();
3268 if (ty == Graph::Edge::CROSS || ty == Graph::Edge::BACK)
H A Dnv50_ir_emit_gm107.cpp4422 if (ei.getType() == Graph::Edge::BACK) // sched would be uninitialized
4481 if (ei.getType() != Graph::Edge::BACK) {
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.h32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
40 class Edge class in class:nv50_ir::Graph
52 Edge(Node *dst, Node *src, Type kind);
53 ~Edge() { unlink(); }
66 Edge *next[2]; // next edge outgoing/incident from/to origin/target
67 Edge *prev[2];
78 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
86 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
94 inline Edge *getEdge() const { return e; }
95 inline Edge
[all...]
H A Dnv50_ir_graph.cpp53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
95 void Graph::Node::attach(Node *node, Edge::Type kind)
97 Edge *edge = new Edge(this, node, kind);
125 if (kind == Edge::UNKNOWN)
158 Graph::Edge::Edge(Node *org, Node *tgt, Type kind) function in class:nv50_ir::Graph::Edge
187 if (ei.getType() == Edge::BACK)
302 case Graph::Edge
[all...]
H A Dnv50_ir_bb.cpp314 Graph::Edge *e = cfg.outgoing(true).getEdge();
326 this->cfg.attach(&bb->cfg, Graph::Edge::TREE);
372 Graph::Edge::Type eR;
383 if (eR == Graph::Edge::CROSS || eR == Graph::Edge::BACK)
527 case Graph::Edge::TREE:
530 case Graph::Edge::FORWARD:
533 case Graph::Edge::CROSS:
536 case Graph::Edge::BACK:
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::Edge
[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::Edge
[all...]
H A Dnv50_ir_lowering_nvc0.cpp732 if (ei.getType() != Graph::Edge::BACK)
734 if (ei.getType() != Graph::Edge::BACK)
745 assert(ei.end() || ei.getType() != Graph::Edge::BACK);
1469 currBB->cfg.attach(&tryLockBB->cfg, Graph::Edge::TREE);
1481 tryLockBB->cfg.attach(&failLockBB->cfg, Graph::Edge::CROSS);
1482 tryLockBB->cfg.attach(&setAndUnlockBB->cfg, Graph::Edge::TREE);
1537 setAndUnlockBB->cfg.attach(&failLockBB->cfg, Graph::Edge::TREE);
1543 failLockBB->cfg.attach(&tryLockBB->cfg, Graph::Edge::BACK);
1544 failLockBB->cfg.attach(&joinBB->cfg, Graph::Edge::TREE);
1564 currBB->cfg.attach(&tryLockAndSetBB->cfg, Graph::Edge
[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_ssa.cpp176 nw->attach(nv, Graph::Edge::TREE);
H A Dnv50_ir_ra.cpp405 if (ei.getType() == Graph::Edge::TREE ||
406 ei.getType() == Graph::Edge::FORWARD)
466 pb->cfg.attach(&pn->cfg, Graph::Edge::TREE);
467 pn->cfg.attach(&bb->cfg, Graph::Edge::FORWARD);
1204 this->attach(node, Graph::Edge::CROSS);
H A Dnv50_ir_peephole.cpp3338 Graph::Edge::Type ty = term->bb->cfg.outgoing().getType();
3342 if (ty == Graph::Edge::CROSS || ty == Graph::Edge::BACK)
/xsrc/external/mit/libXrender/dist/src/
H A DPoly.c29 typedef struct _Edge Edge; typedef in typeref:struct:_Edge
35 Edge *next, *prev;
41 const Edge *e1 = o1, *e2 = o2;
90 XRenderComputeTrapezoids (Edge *edges,
98 Edge *active;
99 Edge *e, *en, *next;
102 qsort (edges, (size_t) nedges, sizeof (Edge), CompareEdge);
246 Edge *edges;
252 edges = Xmalloc (((size_t) npoints * sizeof (Edge)) +
/xsrc/external/mit/mesa-demos/dist/src/demos/
H A Dmorph3d.c107 Edge radius:
108 Edge Radius For Pentagon (ERp)
121 Edge Radius For Triangle (this one is well known: 1/3 of the triangle height)
206 #define TRIANGLE(Edge, Amp, Divisions, Z) \
213 GLfloat Vr=(Edge)*SQRT3/3; \
215 GLfloat Zf=(Edge)*(Z); \
217 Ax=(Edge)*(+0.5/(Divisions)), Ay=(Edge)*(-SQRT3/(2*Divisions)); \
218 Bx=(Edge)*(-0.5/(Divisions)); \
263 #define SQUARE(Edge, Am
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/swr/rasterizer/core/core/
H A Drasterizer_impl.h408 INLINE double adjustScalarEdge(const double a, const double b, const double Edge) argument
413 return (Edge - manh);
425 "Edge equation expected to be in x.16 fixed point");
428 "Edge offset assumes conservative rasterization is enabled");
/xsrc/external/mit/MesaLib/dist/src/compiler/spirv/
H A Dspirv.core.grammar.json6581 { "kind" : "IdRef", "name" : "'Left Edge Luma Pixels'" },
6583 { "kind" : "IdRef", "name" : "'Upper Edge Luma Pixels'" },
6584 { "kind" : "IdRef", "name" : "'Upper Right Edge Luma Pixels'" },
6600 { "kind" : "IdRef", "name" : "'Left Edge Luma Pixels'" },
6602 { "kind" : "IdRef", "name" : "'Upper Edge Luma Pixels'" },
6603 { "kind" : "IdRef", "name" : "'Upper Right Edge Luma Pixels'" },
6604 { "kind" : "IdRef", "name" : "'Left Edge Chroma Pixels'" },
6606 { "kind" : "IdRef", "name" : "'Upper Edge Chroma Pixels'" },

Completed in 112 milliseconds

12