Searched refs:n_vertices (Results 1 - 9 of 9) sorted by relevance

/haiku-buildtools/isl/
H A Disl_vertices_private.h20 /* A chamber in the chamber decomposition. The indices of the "n_vertices"
24 int n_vertices; member in struct:isl_chamber
35 int n_vertices; member in struct:isl_vertices
43 int n_vertices; member in struct:isl_cell
H A Disl_vertices.c46 for (i = 0; i < vertices->n_vertices; ++i) {
80 int n_vertices, struct isl_vertex_list *list)
91 vertices->v = isl_alloc_array(bset->ctx, struct isl_vertex, n_vertices);
92 if (n_vertices && !vertices->v)
94 vertices->n_vertices = n_vertices;
169 vertices->n_vertices = 0;
200 vertices->n_vertices = 1;
210 vertices->c[0].n_vertices = 1;
401 int n_vertices local
79 vertices_from_list(__isl_keep isl_basic_set *bset, int n_vertices, struct isl_vertex_list *list) argument
609 int n_vertices = 0; local
[all...]
H A Disl_bernstein.c252 int n_vertices; local
262 n_vertices = cell->n_vertices;
265 if (n_vertices > nvar + 1 && ctx->opt->bernstein_triangulate)
275 dim_dst = isl_space_add_dims(dim_dst, isl_dim_set, n_vertices);
280 for (i = 0; i < n_vertices; ++i) {
290 1 + nvar + n_vertices);
300 poly = isl_qpolynomial_add_dims(poly, isl_dim_in, n_vertices);
/haiku-buildtools/gcc/gcc/
H A Dgraphds.c36 for (i = 0; i < g->n_vertices; i++)
57 new_graph (int n_vertices) argument
62 g->n_vertices = n_vertices;
63 g->vertices = XOBNEWVEC (&g->ob, struct vertex, n_vertices);
64 memset (g->vertices, 0, sizeof (struct vertex) * n_vertices);
194 struct graph_edge **stack = XNEWVEC (struct graph_edge *, g->n_vertices);
208 for (i = 0; i < g->n_vertices; i++)
276 int *queue = XNEWVEC (int, g->n_vertices);
292 for (i = 0; i < g->n_vertices;
[all...]
H A Dgraphds.h49 int n_vertices; /* Number of vertices. */ member in struct:graph
H A Dtree-loop-distribution.c182 for (int i = 0; i < rdg->n_vertices; i++)
205 for (i = 0; i < rdg->n_vertices; i++)
332 for (i = 0; i < rdg->n_vertices; i++)
345 for (i = 0; i < rdg->n_vertices; i++)
440 for (i = 0; i < rdg->n_vertices; i++)
1298 for (i = 0; i < rdg->n_vertices; i++)
1650 qsort (pg->vertices, pg->n_vertices, sizeof (vertex), pgcmp);
1652 for (i = 0; i < pg->n_vertices; ++i)
H A Dcfgloopanal.c172 for (i = 0; i < g->n_vertices; i++)
H A Ddominance.c1369 for (y = 0; y < g->n_vertices; y++)
1388 for (y = 0; y < g->n_vertices; y++)
H A Dgraphite-sese-to-poly.c1767 for (i = 0; i < g->n_vertices; i++)
1846 for (i = 0; i < g->n_vertices; i++)

Completed in 320 milliseconds