| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_graph.cpp | 31 Graph::Graph()
38 Graph::~Graph()
44 void Graph::insert(Node *node)
49 node->graph = this;
53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
86 Graph::Node::Node(void *priv) : data(priv),
87 in(0), out(0), graph(0)
[all...] |
| nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
34 // A connected graph.
35 class Graph
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 *graph; member in class:nv50_ir::Graph::Node
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_graph.cpp | 31 Graph::Graph()
38 Graph::~Graph()
44 void Graph::insert(Node *node)
49 node->graph = this;
53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
87 Graph::Node::Node(void *priv) : data(priv),
88 in(0), out(0), graph(0)
[all...] |
| nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
34 // A connected graph.
35 class Graph
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 *graph; member in class:nv50_ir::Graph::Node
[all...] |
| /xsrc/external/mit/xorg-server.old/dist/hw/xfree86/loader/ |
| loadext.c | 144 NODE *n_next; /* next node in graph */
153 static NODE *graph = NULL, **cycle_buf = NULL, **longest_cycle = NULL; variable
157 /* Find a node in the graph (insert if not found) and return a pointer to it. */
163 for (n = graph; n && n->n_name && strcmp(n->n_name, name);
178 if ((n->n_next = graph) != NULL)
179 graph->n_prevp = &n->n_next;
180 n->n_prevp = &graph;
181 graph = n;
187 * add an arc from node s1 to node s2 in the graph. If s1 or s2 are not in
188 * the graph, then add them
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r300/compiler/ |
| radeon_pair_regalloc.c | 523 struct ra_graph * graph; local
569 graph = ra_alloc_interference_graph(ra_state->regs,
573 ra_set_node_class(graph, node_index, node_classes[node_index]);
576 /* Build the interference graph */
589 ra_add_node_interference(graph,
599 /* Add input registers to the interference graph */
609 ra_add_node_interference(graph, node_index,
614 ra_set_node_reg(graph, node_count + input_node, get_reg_id(
619 if (!ra_allocate(graph)) {
627 int reg = ra_get_node_reg(graph, node_index)
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r300/compiler/ |
| radeon_pair_regalloc.c | 523 struct ra_graph * graph; local
569 graph = ra_alloc_interference_graph(ra_state->regs,
573 ra_set_node_class(graph, node_index, node_classes[node_index]);
576 /* Build the interference graph */
589 ra_add_node_interference(graph,
599 /* Add input registers to the interference graph */
609 ra_add_node_interference(graph, node_index,
614 ra_set_node_reg(graph, node_count + input_node, get_reg_id(
619 if (!ra_allocate(graph)) {
627 int reg = ra_get_node_reg(graph, node_index)
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/hud/ |
| hud_context.c | 385 /* draw horizontal lines inside the graph */
764 * Set the maximum value for the Y axis of the graph.
765 * This scales the graph accordingly.
774 /* The following code determines the max_value in the graph as well as
863 * again needlessly in case the pane has more than one graph.
916 * Add a graph to an existing pane.
990 hud_graph_destroy(struct hud_graph *graph, struct pipe_context *pipe)
992 FREE(graph->vertices);
993 if (graph->free_query_data)
994 graph->free_query_data(graph->query_data, pipe)
1434 struct hud_graph *graph; local
1790 struct hud_graph *graph, *graph_tmp; local
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/hud/ |
| hud_context.c | 385 /* draw horizontal lines inside the graph */
765 * Set the maximum value for the Y axis of the graph.
766 * This scales the graph accordingly.
775 /* The following code determines the max_value in the graph as well as
864 * again needlessly in case the pane has more than one graph.
917 * Add a graph to an existing pane.
991 hud_graph_destroy(struct hud_graph *graph, struct pipe_context *pipe)
993 FREE(graph->vertices);
994 if (graph->free_query_data)
995 graph->free_query_data(graph->query_data, pipe)
1435 struct hud_graph *graph; local
1748 struct hud_graph *graph, *graph_tmp; local
[all...] |
