/netbsd-current/external/mit/isl/dist/ |
H A D | isl_vertices_private.h | 25 /* A chamber in the chamber decomposition. The indices of the "n_vertices" 29 int n_vertices; member in struct:isl_chamber 40 int n_vertices; member in struct:isl_vertices 48 int n_vertices; member in struct:isl_cell
|
H A D | isl_vertices.c | 48 for (i = 0; i < vertices->n_vertices; ++i) { 86 int n_vertices, struct isl_vertex_list *list) 97 vertices->v = isl_alloc_array(bset->ctx, struct isl_vertex, n_vertices); 98 if (n_vertices && !vertices->v) 100 vertices->n_vertices = n_vertices; 182 vertices->n_vertices = 0; 210 vertices->n_vertices = 1; 220 vertices->c[0].n_vertices = 1; 433 int n_vertices local 85 vertices_from_list(__isl_keep isl_basic_set *bset, int n_vertices, struct isl_vertex_list *list) argument 667 int n_vertices = 0; local [all...] |
H A D | isl_bernstein.c | 276 int n_vertices; local 287 n_vertices = cell->n_vertices; 290 if (n_vertices > nvar + 1 && ctx->opt->bernstein_triangulate) 300 space_dst = isl_space_add_dims(space_dst, isl_dim_set, n_vertices); 306 for (i = 0; i < n_vertices; ++i) { 316 1 + nvar + n_vertices); 326 poly = isl_qpolynomial_add_dims(poly, isl_dim_in, n_vertices);
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | graphds.c | 34 for (i = 0; i < g->n_vertices; i++) 55 new_graph (int n_vertices) argument 60 g->n_vertices = n_vertices; 61 g->vertices = XOBNEWVEC (&g->ob, struct vertex, n_vertices); 62 memset (g->vertices, 0, sizeof (struct vertex) * n_vertices); 210 struct graph_edge **stack = XNEWVEC (struct graph_edge *, g->n_vertices); 224 for (i = 0; i < g->n_vertices; i++) 294 int *queue = XNEWVEC (int, g->n_vertices); 310 for (i = 0; i < g->n_vertices; [all...] |
H A D | graphds.h | 49 int n_vertices; /* Number of vertices. */ member in struct:graph
|
H A D | tree-loop-distribution.c | 326 for (int i = 0; i < rdg->n_vertices; i++) 349 for (i = 0; i < rdg->n_vertices; i++) 476 for (i = 0; i < rdg->n_vertices; i++) 489 for (i = 0; i < rdg->n_vertices; i++) 774 for (i = 0; i < rdg->n_vertices; i++) 1981 for (i = 0; i < rdg->n_vertices; i++) 2238 for (i = 0; i < pg->n_vertices; ++i) 2326 qsort (pg->vertices, pg->n_vertices, sizeof (vertex), pgcmp); 2328 for (i = 0; i < pg->n_vertices; ++i) 2494 cbdata.vertices_component = XNEWVEC (int, pg->n_vertices); [all...] |
H A D | cfgloopanal.c | 149 for (i = 0; i < g->n_vertices; i++)
|
H A D | dominance.c | 1492 for (y = 0; y < g->n_vertices; y++) 1511 for (y = 0; y < g->n_vertices; y++)
|
H A D | graphite-scop-detection.c | 1449 for (i = 0; i < g->n_vertices; i++)
|
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | graphds.cc | 34 for (i = 0; i < g->n_vertices; i++) 55 new_graph (int n_vertices) argument 60 g->n_vertices = n_vertices; 61 g->vertices = XOBNEWVEC (&g->ob, struct vertex, n_vertices); 62 memset (g->vertices, 0, sizeof (struct vertex) * n_vertices); 210 struct graph_edge **stack = XNEWVEC (struct graph_edge *, g->n_vertices); 224 for (i = 0; i < g->n_vertices; i++) 294 int *queue = XNEWVEC (int, g->n_vertices); 310 for (i = 0; i < g->n_vertices; [all...] |
H A D | graphds.h | 49 int n_vertices; /* Number of vertices. */ member in struct:graph
|
H A D | tree-loop-distribution.cc | 330 for (int i = 0; i < rdg->n_vertices; i++) 353 for (i = 0; i < rdg->n_vertices; i++) 480 for (i = 0; i < rdg->n_vertices; i++) 493 for (i = 0; i < rdg->n_vertices; i++) 784 for (i = 0; i < rdg->n_vertices; i++) 2009 for (i = 0; i < rdg->n_vertices; i++) 2266 for (i = 0; i < pg->n_vertices; ++i) 2354 qsort (pg->vertices, pg->n_vertices, sizeof (vertex), pgcmp); 2356 for (i = 0; i < pg->n_vertices; ++i) 2523 cbdata.vertices_component = XNEWVEC (int, pg->n_vertices); [all...] |
H A D | cfgloopanal.cc | 149 for (i = 0; i < g->n_vertices; i++)
|
H A D | dominance.cc | 1499 for (y = 0; y < g->n_vertices; y++) 1518 for (y = 0; y < g->n_vertices; y++)
|
H A D | graphite-scop-detection.cc | 1447 for (i = 0; i < g->n_vertices; i++)
|