| /haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
| H A D | host_assoc_types_1.f90 | 8 TYPE vertex type in module:test
10 END TYPE vertex
13 TYPE(vertex) :: a ! { dg-error "cannot be host associated" }
14 vertex : DO i=1,2 ! { dg-error "incompatible object of the same name" }
15 ENDDO vertex
|
| /haiku-buildtools/isl/include/isl/ |
| H A D | vertices.h | 19 isl_ctx *isl_vertex_get_ctx(__isl_keep isl_vertex *vertex);
20 int isl_vertex_get_id(__isl_keep isl_vertex *vertex);
21 __isl_give isl_basic_set *isl_vertex_get_domain(__isl_keep isl_vertex *vertex);
22 __isl_give isl_basic_set *isl_vertex_get_expr(__isl_keep isl_vertex *vertex);
23 void isl_vertex_free(__isl_take isl_vertex *vertex);
30 int (*fn)(__isl_take isl_vertex *vertex, void *user), void *user);
36 int (*fn)(__isl_take isl_vertex *vertex, void *user), void *user);
|
| /haiku-buildtools/gcc/gcc/ |
| H A D | 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. */
|
| H A D | graphds.c | 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[t];
94 struct vertex *vv = &g->vertices[v];
95 struct vertex *uu = &g->vertices[u];
119 /* Helper function for graphds_dfs. Returns the source vertex of E, in the
128 /* Helper function for graphds_dfs. Returns the destination vertex of E, in
270 connected component for each vertex of G. Returns the number of the
|
| H A D | tree-loop-distribution.c | 95 /* A Reduced Dependence Graph (RDG) vertex representing a statement. */
98 /* The statement represented by this vertex. */
141 /* Dump vertex I in RDG to FILE. */
146 struct vertex *v = &(rdg->vertices[i]);
149 fprintf (file, "(vertex %d: (%s%s) (in:", i,
207 struct vertex *v = &(rdg->vertices[i]);
296 /* Creates an edge for the control dependences of BB to the vertex V. */
372 struct vertex *v = &(rdg->vertices[i]);
374 /* Record statement to vertex mapping. */
442 struct vertex *
[all...] |
| /haiku-buildtools/isl/ |
| H A D | isl_vertices.c | 47 isl_basic_set_free(vertices->v[i].vertex);
73 isl_basic_set_free(list->v.vertex);
109 /* Prepend a vertex to the linked list "list" based on the equalities in "tab".
128 v->v.vertex = isl_basic_set_copy(bset);
129 v->v.vertex = isl_basic_set_cow(v->v.vertex);
130 v->v.vertex = isl_basic_set_update_from_tab(v->v.vertex, tab);
131 v->v.vertex = isl_basic_set_simplify(v->v.vertex);
978 isl_vertex_get_ctx(__isl_keep isl_vertex *vertex) argument
983 isl_vertex_get_id(__isl_keep isl_vertex *vertex) argument
988 isl_vertex_get_domain(__isl_keep isl_vertex *vertex) argument
1004 isl_vertex_get_expr(__isl_keep isl_vertex *vertex) argument
1020 isl_vertex *vertex; local
1039 isl_vertex_free(__isl_take isl_vertex *vertex) argument
1289 isl_vertices_foreach_vertex(__isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_vertex *vertex, void *user), void *user) argument
1293 isl_vertex *vertex; local
1316 isl_cell_foreach_vertex(__isl_keep isl_cell *cell, int (*fn)(__isl_take isl_vertex *vertex, void *user), void *user) argument
1320 isl_vertex *vertex; local
1445 vertex_on_facet(__isl_keep isl_basic_set *vertex, __isl_keep isl_basic_set *bset, int facet, __isl_keep isl_vec *v) argument
1481 isl_basic_set *vertex; local
[all...] |
| H A D | isl_bernstein.c | 40 static int vertex_is_integral(__isl_keep isl_basic_set *vertex) argument
46 nvar = isl_basic_set_dim(vertex, isl_dim_set);
47 nparam = isl_basic_set_dim(vertex, isl_dim_param);
50 if (!isl_int_is_one(vertex->eq[r][1 + nparam + i]) &&
51 !isl_int_is_negone(vertex->eq[r][1 + nparam + i]))
59 __isl_keep isl_basic_set *vertex, int i, __isl_take isl_space *dim)
67 nvar = isl_basic_set_dim(vertex, isl_dim_set);
68 nparam = isl_basic_set_dim(vertex, isl_dim_param);
72 isl_int_set(denom, vertex->eq[r][1 + nparam + i]);
73 isl_assert(vertex
58 vertex_coordinate( __isl_keep isl_basic_set *vertex, int i, __isl_take isl_space *dim) argument
[all...] |
| H A D | isl_vertices_private.h | 10 /* A parametric vertex. "vertex" contains the actual description
11 * of the vertex as a singleton parametric set. "dom" is the projection
12 * of "vertex" onto the parameter space, i.e., the activity domain
13 * of the vertex.
17 isl_basic_set *vertex; member in struct:isl_vertex
|
| /haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/ |
| H A D | pr47313.C | 22 const Vertex_handle& vertex(int i) const { function in struct:Periodic_3_triangulation_ds_cell_base_3
43 Vertex_handle nearest = c->vertex(0);
44 nearest = (compare_distance() == -1) ? nearest : c->vertex(0);
|
| /haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.mike/ |
| H A D | p1989.C | 333 struct vertex { struct
335 List_DL<vertex<T> *> fanout;
337 vertex(): item(), fanout() // { dg-bogus "" } function in struct:vertex
339 vertex(const T& i): item(), fanout() // { dg-bogus "" } function in struct:vertex
370 vertex<T> *lookup(const T& from) const;
371 vertex<T> *lookup_new(const T& from);
373 List_DLS<vertex<T> > vertices;
402 vertex<T> *fromv = lookup_new(from);
405 vertex<T> *tov = lookup_new(to);
413 vertex<
[all...] |
| /haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.robertl/ |
| H A D | eb109.C | 27 typedef std::pair<VertexType, Successor> vertex; typedef in class:Graph
28 typedef std::vector<vertex> GraphType;
|