| /src/external/mit/isl/dist/include/isl/ |
| vertices.h | 20 isl_ctx *isl_vertex_get_ctx(__isl_keep isl_vertex *vertex);
21 isl_size isl_vertex_get_id(__isl_keep isl_vertex *vertex);
22 __isl_give isl_basic_set *isl_vertex_get_domain(__isl_keep isl_vertex *vertex);
23 __isl_give isl_multi_aff *isl_vertex_get_expr(__isl_keep isl_vertex *vertex);
24 __isl_null isl_vertex *isl_vertex_free(__isl_take isl_vertex *vertex);
31 isl_stat (*fn)(__isl_take isl_vertex *vertex, void *user), void *user);
37 isl_stat (*fn)(__isl_take isl_vertex *vertex, void *user), void *user);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| graphds.h | 33 /* Structure representing vertex of a graph. */
35 struct vertex struct
40 vertex. */
42 void *data; /* Data attached to the vertex. */
50 struct vertex *vertices; /* The vertices. */
51 struct obstack ob; /* Obstack for vertex and edge allocation. */
|
| graphds.cc | 61 g->vertices = XOBNEWVEC (&g->ob, struct vertex, n_vertices);
62 memset (g->vertices, 0, sizeof (struct vertex) * n_vertices);
73 struct vertex *vf = &g->vertices[f], *vt = &g->vertices[t];
93 struct vertex *vv = &g->vertices[v];
94 struct vertex *uu = &g->vertices[u];
118 /* Helper function for graphds_dfs. Returns the source vertex of E, in the
127 /* Helper function for graphds_dfs. Returns the destination vertex of E, in
287 connected component for each vertex of G. Returns the number of the
|
| tree-loop-distribution.cc | 166 /* A Reduced Dependence Graph (RDG) vertex representing a statement. */
169 /* The statement represented by this vertex. */
289 /* Dump vertex I in RDG to FILE. */
294 struct vertex *v = &(rdg->vertices[i]);
297 fprintf (file, "(vertex %d: (%s%s) (in:", i,
355 struct vertex *v = &(rdg->vertices[i]);
444 /* Creates an edge for the control dependences of BB to the vertex V. */
544 /* Build the Reduced Dependence Graph (RDG) with one vertex per statement of
580 the vertex V of the RDG, also including the loop exit conditions. */
720 struct vertex *v = &(rdg->vertices[i])
[all...] |
| tree-vect-slp.cc | 3560 node->vertex = vertices.length ();
3579 leafs.safe_push (node->vertex);
3656 add_edge (slpg, v.node->vertex, child->vertex);
3746 vertices[SLP_INSTANCE_TREE (instance)->vertex].perm_in = 0;
3747 vertices[SLP_INSTANCE_TREE (instance)->vertex].perm_out = 0;
3758 unsigned int node_i = SLP_INSTANCE_TREE (instance)->vertex;
3978 gcc_assert (slpg->vertices[child->vertex].pred->pred_next);
4124 && vertices[old->vertex].get_perm_materialized () != 0)
4131 int perm = vertices[old->vertex].get_perm_materialized ()
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| graphds.h | 33 /* Structure representing vertex of a graph. */
35 struct vertex struct
40 vertex. */
42 void *data; /* Data attached to the vertex. */
50 struct vertex *vertices; /* The vertices. */
51 struct obstack ob; /* Obstack for vertex and edge allocation. */
|
| graphds.cc | 61 g->vertices = XOBNEWVEC (&g->ob, struct vertex, n_vertices);
62 memset (g->vertices, 0, sizeof (struct vertex) * n_vertices);
73 struct vertex *vf = &g->vertices[f], *vt = &g->vertices[t];
93 struct vertex *vv = &g->vertices[v];
94 struct vertex *uu = &g->vertices[u];
118 /* Helper function for graphds_dfs. Returns the source vertex of E, in the
127 /* Helper function for graphds_dfs. Returns the destination vertex of E, in
294 connected component for each vertex of G. Returns the number of the
|
| tree-vect-slp.cc | 4174 /* The vertices of M_SLPG, indexed by slp_tree::vertex. */
4240 node->vertex = m_vertices.length ();
4259 m_leafs.safe_push (node->vertex);
4346 graph_edge *ud = add_edge (m_slpg, v.node->vertex, child->vertex);
4442 auto &vertex = m_vertices[node_i]; local
4443 if ((SLP_TREE_DEF_TYPE (vertex.node) == vect_external_def
4444 && !SLP_TREE_VEC_DEFS (vertex.node).exists ())
4445 || SLP_TREE_DEF_TYPE (vertex.node) == vect_constant_def)
4446 vertex.partition = -1
4758 auto &vertex = m_vertices[node_i]; local
4900 auto &vertex = m_vertices[node_i]; local
4975 auto &vertex = m_vertices[node_i]; local
5189 auto &vertex = m_vertices[node_i]; local
5323 auto &vertex = m_vertices[node_i]; local
5501 auto &vertex = m_vertices[node_i]; local
5573 auto &vertex = m_vertices[node_i]; local
5704 auto &vertex = m_vertices[m_partitioned_nodes[order_i]]; local
5727 auto &vertex = m_vertices[node_i]; local
[all...] |
| gimple-ssa-sccopy.cc | 83 SCC computation we wrap potential copy statements in the 'vertex' struct.
84 To each of these statements we also assign a vertex number ('vxnum'). Since
101 /* State of vertex during SCC discovery.
103 unvisited Vertex hasn't yet been popped from worklist.
104 vopen DFS has visited vertex for the first time. Vertex has been put
106 closed DFS has backtracked through vertex. At this point, vertex
108 in_scc Vertex has been popped from Tarjan stack. */
118 /* Information about a vertex. Used by SCC discovery. *
120 struct vertex struct in namespace:__anon13742
[all...] |
| tree-loop-distribution.cc | 167 /* A Reduced Dependence Graph (RDG) vertex representing a statement. */
170 /* The statement represented by this vertex. */
290 /* Dump vertex I in RDG to FILE. */
295 struct vertex *v = &(rdg->vertices[i]);
298 fprintf (file, "(vertex %d: (%s%s) (in:", i,
356 struct vertex *v = &(rdg->vertices[i]);
445 /* Creates an edge for the control dependences of BB to the vertex V. */
545 /* Build the Reduced Dependence Graph (RDG) with one vertex per statement of
581 the vertex V of the RDG, also including the loop exit conditions. */
721 struct vertex *v = &(rdg->vertices[i])
[all...] |
| tree-vectorizer.h | 226 int vertex; member in struct:_slp_tree
|
| /src/external/mit/isl/dist/ |
| isl_vertices.c | 49 isl_basic_set_free(vertices->v[i].vertex);
77 isl_basic_set_free(list->v.vertex);
115 /* Prepend a vertex to the linked list "list" based on the equalities in "tab".
116 * Return isl_bool_true if the vertex was actually added and
139 v->v.vertex = isl_basic_set_copy(bset);
140 v->v.vertex = isl_basic_set_cow(v->v.vertex);
141 v->v.vertex = isl_basic_set_update_from_tab(v->v.vertex, tab);
142 v->v.vertex = isl_basic_set_simplify(v->v.vertex)
1093 isl_vertex *vertex; local
1345 isl_vertex *vertex; local
1372 isl_vertex *vertex; local
1533 isl_basic_set *vertex; local
[all...] |
| isl_bernstein.c | 41 static isl_bool vertex_is_integral(__isl_keep isl_basic_set *vertex)
47 nvar = isl_basic_set_dim(vertex, isl_dim_set);
48 nparam = isl_basic_set_dim(vertex, isl_dim_param);
53 if (!isl_int_is_one(vertex->eq[r][1 + nparam + i]) &&
54 !isl_int_is_negone(vertex->eq[r][1 + nparam + i]))
62 __isl_keep isl_basic_set *vertex, int i, __isl_take isl_space *space)
73 nvar = isl_basic_set_dim(vertex, isl_dim_set);
74 nparam = isl_basic_set_dim(vertex, isl_dim_param);
75 total = isl_basic_set_dim(vertex, isl_dim_all);
80 isl_int_set(denom, vertex->eq[r][1 + nparam + i])
[all...] |
| isl_vertices_private.h | 13 /* A parametric vertex. "vertex" contains the actual description
14 * of the vertex as a singleton parametric set. "dom" is the projection
15 * of "vertex" onto the parameter space, i.e., the activity domain
16 * of the vertex.
18 * of every parametric vertex is full-dimensional.
22 isl_basic_set *vertex; member in struct:isl_vertex
|
| isl_test.c | 7967 const char *vertex[6]; member in struct:isl_vertices_test_data
7994 /* Check that "vertex" corresponds to one of the vertices in data->vertex.
7996 static isl_stat find_vertex(__isl_take isl_vertex *vertex, void *user)
8006 ctx = isl_vertex_get_ctx(vertex);
8007 bset = isl_vertex_get_domain(vertex);
8008 ma = isl_vertex_get_expr(vertex);
8014 pma_i = isl_pw_multi_aff_read_from_str(ctx, data->vertex[i]);
8023 isl_vertex_free(vertex);
|
| /src/usr.bin/nbperf/ |
| graph2.h | 39 * For each vertex in the 2/3-graph, the incidence lists need to kept.
66 struct SIZED(vertex) {
75 struct SIZED(vertex) *verts;
|
| graph2.c | 138 struct SIZED(vertex) *v;
152 struct SIZED(vertex) *v;
163 SIZED2(_remove_vertex)(struct SIZED(graph) *graph, uint32_t vertex)
165 struct SIZED(vertex) *v = graph->verts + vertex;
184 errx(1, "vertex count must have lowest bit clear");
187 errx(1, "vertex count must have lowest 2 bits clear");
|
| /src/sys/external/bsd/drm/dist/shared-core/ |
| mach64_state.c | 552 drm_mach64_vertex_t * vertex)
557 void *buf = vertex->buf;
558 unsigned long used = vertex->used;
577 /* Mach64's vertex data is actually register writes. To avoid security
707 * two sets of buffers (one set private for vertex data, the other set
827 drm_mach64_vertex_t *vertex = data; local
838 vertex->buf, vertex->used, vertex->discard);
840 if (vertex->prim < 0 || vertex->prim > MACH64_PRIM_POLYGON)
[all...] |
| radeon_state.c | 1166 /* Vertex format (X, Y, Z, W) */
1529 /* Emit the vertex buffer rendering commands */
1555 /* Emit the vertex buffer age */
2233 drm_radeon_vertex_t *vertex = data; local
2246 DRM_CURRENTPID, vertex->idx, vertex->count, vertex->discard);
2248 if (vertex->idx < 0 || vertex->idx >= dma->buf_count) {
2250 vertex->idx, dma->buf_count - 1)
2528 drm_radeon_vertex2_t *vertex = data; local
[all...] |
| r128_state.c | 600 /* Emit the vertex buffer rendering commands */
619 /* Emit the vertex buffer age */
759 /* Emit the vertex buffer age */
1353 drm_r128_vertex_t *vertex = data; local
1363 DRM_CURRENTPID, vertex->idx, vertex->count, vertex->discard);
1365 if (vertex->idx < 0 || vertex->idx >= dma->buf_count) {
1367 vertex->idx, dma->buf_count - 1)
[all...] |
| mga_state.c | 913 drm_mga_vertex_t *vertex = data; local
917 if (vertex->idx < 0 || vertex->idx > dma->buf_count)
919 buf = dma->buflist[vertex->idx];
922 buf->used = vertex->used;
923 buf_priv->discard = vertex->discard;
926 if (vertex->discard) {
|
| /src/sys/external/bsd/drm2/dist/drm/r128/ |
| r128_state.c | 606 /* Emit the vertex buffer rendering commands */
625 /* Emit the vertex buffer age */
764 /* Emit the vertex buffer age */
1325 drm_r128_vertex_t *vertex = data; local
1332 task_pid_nr(current), vertex->idx, vertex->count, vertex->discard);
1334 if (vertex->idx < 0 || vertex->idx >= dma->buf_count) {
1336 vertex->idx, dma->buf_count - 1)
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/mga/ |
| mga_state.c | 881 drm_mga_vertex_t *vertex = data; local
885 if (vertex->idx < 0 || vertex->idx > dma->buf_count)
887 buf = dma->buflist[vertex->idx];
890 buf->used = vertex->used;
891 buf_priv->discard = vertex->discard;
894 if (vertex->discard) {
|
| /src/sys/external/bsd/drm2/dist/drm/i810/ |
| i810_dma.c | 942 drm_i810_vertex_t *vertex = data; local
947 vertex->idx, vertex->used, vertex->discard);
949 if (vertex->idx < 0 || vertex->idx >= dma->buf_count)
953 dma->buflist[vertex->idx],
954 vertex->discard, vertex->used);
|
| /src/lib/libc/cdb/ |
| cdbw.c | 350 * For each vertex in the 3-graph, the incidence lists needs to be kept.
365 struct vertex { struct
384 struct vertex *vertices;
398 struct vertex *v;
411 struct vertex *v_ = &state->vertices[v];
|
