Searched refs:vertices (Results 1 - 13 of 13) sorted by relevance

/haiku-buildtools/isl/
H A Disl_vertices_private.h2 #include <isl/vertices.h>
21 * active vertices are stored in "vertices".
25 int *vertices; member in struct:isl_chamber
32 /* The rational basic set spanned by the vertices. */
45 isl_vertices *vertices; member in struct:isl_cell
50 isl_vertices *vertices; member in struct:isl_external_vertex
54 int isl_vertices_foreach_disjoint_cell(__isl_keep isl_vertices *vertices,
60 __isl_take isl_vertices *vertices);
H A Disl_vertices.c25 __isl_take isl_vertices *vertices);
27 __isl_give isl_vertices *isl_vertices_copy(__isl_keep isl_vertices *vertices) argument
29 if (!vertices)
32 vertices->ref++;
33 return vertices;
36 void isl_vertices_free(__isl_take isl_vertices *vertices) argument
40 if (!vertices)
43 if (--vertices->ref > 0)
46 for (i = 0; i < vertices->n_vertices; ++i) {
47 isl_basic_set_free(vertices
84 isl_vertices *vertices; local
155 isl_vertices *vertices; local
183 isl_vertices *vertices; local
344 isl_vertices *vertices; local
402 isl_vertices *vertices; local
546 vertices_add_chambers( __isl_take isl_vertices *vertices, int n_chambers, struct isl_chamber_list *list) argument
604 add_chamber(struct isl_chamber_list **list, __isl_keep isl_vertices *vertices, struct isl_tab *tab, int *selection) argument
858 compute_chambers(__isl_take isl_basic_set *bset, __isl_take isl_vertices *vertices) argument
1016 isl_vertex_alloc(__isl_take isl_vertices *vertices, int id) argument
1074 isl_cell_alloc(__isl_take isl_vertices *vertices, __isl_take isl_basic_set *dom, int id) argument
1200 isl_vertices_foreach_disjoint_cell(__isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_cell *cell, void *user), void *user) argument
1261 isl_vertices_foreach_cell(__isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_cell *cell, void *user), void *user) argument
1289 isl_vertices_foreach_vertex(__isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_vertex *vertex, void *user), void *user) argument
1344 isl_vertices_get_ctx(__isl_keep isl_vertices *vertices) argument
1349 isl_vertices_get_n_vertices(__isl_keep isl_vertices *vertices) argument
1354 isl_morph_vertices(__isl_take isl_morph *morph, __isl_take isl_vertices *vertices) argument
[all...]
H A Disl_bernstein.c107 return vertex_is_integral(cell->vertices->v[v].vertex);
232 /* Perform bernstein expansion on the parametric vertices that are active
287 v = vertex_coordinate(cell->vertices->v[k].vertex, j,
330 * and then perform bernstein expansion on the parametric vertices
340 isl_vertices *vertices; local
374 vertices = isl_basic_set_compute_vertices(bset);
375 isl_vertices_foreach_disjoint_cell(vertices,
377 isl_vertices_free(vertices);
H A Disl_test.c24 #include <isl/vertices.h>
3345 isl_vertices *vertices; local
3349 vertices = isl_basic_set_compute_vertices(bset);
3351 isl_vertices_free(vertices);
3352 if (!vertices)
3357 vertices = isl_basic_set_compute_vertices(bset);
3359 isl_vertices_free(vertices);
3360 if (!vertices)
4488 { "vertices", &test_vertices },
/haiku-buildtools/isl/include/isl/
H A Dvertices.h27 isl_ctx *isl_vertices_get_ctx(__isl_keep isl_vertices *vertices);
28 int isl_vertices_get_n_vertices(__isl_keep isl_vertices *vertices);
29 int isl_vertices_foreach_vertex(__isl_keep isl_vertices *vertices,
31 void isl_vertices_free(__isl_take isl_vertices *vertices);
39 int isl_vertices_foreach_cell(__isl_keep isl_vertices *vertices,
/haiku-buildtools/gcc/gcc/
H A Dgraphds.c38 if (!g->vertices[i].pred
39 && !g->vertices[i].succ)
42 fprintf (f, "%d (%d)\t<-", i, g->vertices[i].component);
43 for (e = g->vertices[i].pred; e; e = e->pred_next)
48 for (e = g->vertices[i].succ; e; e = e->succ_next)
54 /* Creates a new graph with N_VERTICES vertices. */
63 g->vertices = XOBNEWVEC (&g->ob, struct vertex, n_vertices);
64 memset (g->vertices, 0, sizeof (struct vertex) * n_vertices);
75 struct vertex *vf = &g->vertices[f], *vt = &g->vertices[
[all...]
H A Dgraphds.h49 int n_vertices; /* Number of vertices. */
50 struct vertex *vertices; /* The vertices. */ member in struct:graph
H A Dcfgloopanal.c173 for (ge = g->vertices[i].succ; ge; ge = ge->succ_next)
176 /* edge E in graph G is irreducible if it connects two vertices in the
181 gcc_assert (g->vertices[ge->src].component >= g->vertices[ge->dest].component);
183 if (g->vertices[ge->src].component != g->vertices[ge->dest].component)
H A Dtree-loop-distribution.c115 #define RDG_STMT(RDG, I) RDGV_STMT (&(RDG->vertices[I]))
116 #define RDG_DATAREFS(RDG, I) RDGV_DATAREFS (&(RDG->vertices[I]))
117 #define RDG_MEM_WRITE_STMT(RDG, I) RDGV_HAS_MEM_WRITE (&(RDG->vertices[I]))
118 #define RDG_MEM_READS_STMT(RDG, I) RDGV_HAS_MEM_READS (&(RDG->vertices[I]))
146 struct vertex *v = &(rdg->vertices[i]);
207 struct vertex *v = &(rdg->vertices[i]);
360 /* Build the vertices of the reduced dependence graph RDG. Return false
372 struct vertex *v = &(rdg->vertices[i]);
442 struct vertex *v = &(rdg->vertices[i]);
469 /* Create the RDG vertices fro
[all...]
H A Dgraphite-sese-to-poly.c1686 /* First print all the vertices. */
1747 int *vertices; variable
1761 vertices = XNEWVEC (int, num_vertices);
1776 *(bap->alias_set) = g->vertices[i].component + 1;
1783 /* Get all vertices whose DFS component number is the same as i. */
1785 if (g->vertices[j].component == i)
1786 vertices[num_vertices_in_component++] = j;
1788 /* Now test if the vertices in 'vertices' form a clique, by testing
1795 /* Check if the two vertices ar
1816 free (vertices); variable
[all...]
H A Ddominance.c1176 the dominance tree of graph G. BBS maps the vertices of G to the basic
1220 sccs[g->vertices[a].component].safe_push (a);
1305 edges from BBS, creating a forest F. We form a graph G whose vertices
1370 g->vertices[y].data = BITMAP_ALLOC (NULL);
1382 if (!bitmap_set_bit ((bitmap) g->vertices[dom_i].data, i))
1389 BITMAP_FREE (g->vertices[y].data);
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.mike/
H A Dp1989.C354 { vertices.clear(); }
357 { return vertices.length(); }
360 { return vertices.first(); }
362 { vertices.next(x); }
364 { return vertices(x).item; }
373 List_DLS<vertex<T> > vertices; member in class:Graph
378 vertices()
383 vertices()
429 for (Pix x=vertices.first(); 0 != x; vertices
[all...]
/haiku-buildtools/isl/doc/
H A Dimplementation.tex1101 has integer vertices, then the approximation is exact, i.e.,
1102 $Q_i = P_i'$. In this case, the vertices of $\Delta'_i(\vec s)$
1434 strongly connected components in the graph with as vertices
1456 two vertices, we evaluate \eqref{eq:transitive:edge}.
1687 Otherwise, we apply Floyd-Warshall on the graph with as vertices
1689 the appropriate pairs of vertices.
1703 pass through earlier vertices since $R_{rr}$ itself has been updated

Completed in 81 milliseconds