| /src/external/mit/isl/dist/ |
| isl_vertices_private.h | 5 #include <isl/vertices.h>
17 * During the construction of vertices and chambers, the activity domain
26 * active vertices are stored in "vertices".
30 int *vertices; member in struct:isl_chamber
37 /* The rational basic set spanned by the vertices. */
50 isl_vertices *vertices; member in struct:isl_cell
55 isl_vertices *vertices; member in struct:isl_external_vertex
59 isl_stat isl_vertices_foreach_disjoint_cell(__isl_keep isl_vertices *vertices,
65 __isl_take isl_vertices *vertices);
[all...] |
| isl_vertices.c | 27 __isl_take isl_vertices *vertices);
29 __isl_give isl_vertices *isl_vertices_copy(__isl_keep isl_vertices *vertices)
31 if (!vertices)
34 vertices->ref++;
35 return vertices;
38 __isl_null isl_vertices *isl_vertices_free(__isl_take isl_vertices *vertices)
42 if (!vertices)
45 if (--vertices->ref > 0)
48 for (i = 0; i < vertices->n_vertices; ++i) {
49 isl_basic_set_free(vertices->v[i].vertex)
90 isl_vertices *vertices; local
171 isl_vertices *vertices; local
196 isl_vertices *vertices; local
332 isl_vertices *vertices; local
434 isl_vertices *vertices; local
[all...] |
| isl_bernstein.c | 121 return vertex_is_integral(cell->vertices->v[v].vertex);
254 /* Perform bernstein expansion on the parametric vertices that are active
313 v = vertex_coordinate(cell->vertices->v[k].vertex, j,
360 * and then perform bernstein expansion on the parametric vertices
376 isl_vertices *vertices; local
399 vertices = isl_basic_set_compute_vertices(bset);
400 if (isl_vertices_foreach_disjoint_cell(vertices,
403 isl_vertices_free(vertices);
|
| /src/usr.bin/nbperf/ |
| graph2.c | 88 if (ea->vertices[i] < eb->vertices[i])
90 if (ea->vertices[i] > eb->vertices[i])
142 v = graph->verts + e->vertices[i];
156 v = graph->verts + e->vertices[i];
199 e->vertices[j] = hashes[j] % graph->v;
200 if (j == 1 && e->vertices[0] == e->vertices[1]) {
203 e->vertices[1] ^= 1; /* toggle bit to differ *
[all...] |
| nbperf-chm.c | 60 * Each edge in the represents a key. The vertices are the reminder of
93 if (!state->visited[e->vertices[0]]) {
94 v0 = e->vertices[0];
95 v1 = e->vertices[1];
96 v2 = e->vertices[2];
97 } else if (!state->visited[e->vertices[1]]) {
98 v0 = e->vertices[1];
99 v1 = e->vertices[0];
100 v2 = e->vertices[2];
102 v0 = e->vertices[2]
[all...] |
| nbperf-bdz.c | 58 * Each edge in the represents a key. The vertices are the reminder of
65 * vertices, so that the sum of all vertices of the edge modulo 4 is
94 if (!state->visited[e->vertices[0]]) {
96 t = e->vertices[0];
97 } else if (!state->visited[e->vertices[1]]) {
99 t = e->vertices[1];
101 if (state->visited[e->vertices[2]])
104 t = e->vertices[2];
108 if (state->visited[e->vertices[0]] == 0
[all...] |
| graph2.h | 49 * and the vertices of the edge don't have to be copied.
71 uint32_t vertices[GRAPH_SIZE]; local
|
| /src/external/mit/isl/dist/include/isl/ |
| vertices.h | 28 isl_ctx *isl_vertices_get_ctx(__isl_keep isl_vertices *vertices);
29 isl_size isl_vertices_get_n_vertices(__isl_keep isl_vertices *vertices);
30 isl_stat isl_vertices_foreach_vertex(__isl_keep isl_vertices *vertices,
32 __isl_null isl_vertices *isl_vertices_free(__isl_take isl_vertices *vertices);
40 isl_stat isl_vertices_foreach_cell(__isl_keep isl_vertices *vertices,
|
| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-ssa-sccopy.cc | 124 which vertices are part of this subgraph. */
143 vertex* vertices; /* Indexed by SSA_NAME_VERSION. */ member in class:__anon13742::scc_discovery
153 vertices = XNEWVEC (struct vertex, num_ssa_names);
156 vertices[i].active = false;
161 XDELETEVEC (vertices);
175 if (!vertices[neigh_version].active)
178 vstate neigh_state = vertices[neigh_version].state;
179 vstate parent_state = vertices[parent_version].state;
191 vertices[parent_version].lowlink
192 = std::min (vertices[parent_version].lowlink
[all...] |
| graphds.cc | 36 if (!g->vertices[i].pred
37 && !g->vertices[i].succ)
40 fprintf (f, "%d (%d)\t<-", i, g->vertices[i].component);
41 for (e = g->vertices[i].pred; e; e = e->pred_next)
46 for (e = g->vertices[i].succ; e; e = e->succ_next)
52 /* Creates a new graph with N_VERTICES vertices. */
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]
[all...] |
| graphds.h | 49 int n_vertices; /* Number of vertices. */
50 struct vertex *vertices; /* The vertices. */ member in struct:graph
|
| cfgloopanal.cc | 150 for (ge = g->vertices[i].succ; ge; ge = ge->succ_next)
153 /* edge E in graph G is irreducible if it connects two vertices in the
158 gcc_assert (g->vertices[ge->src].component >= g->vertices[ge->dest].component);
160 if (g->vertices[ge->src].component != g->vertices[ge->dest].component)
|
| tree-loop-distribution.cc | 49 The vertices (RDG:V) model all statements in the loop and the edges
59 The vertices (PG:V) model all partitions and the edges (PG:E) model
187 #define RDG_STMT(RDG, I) RDGV_STMT (&(RDG->vertices[I]))
188 #define RDG_DATAREFS(RDG, I) RDGV_DATAREFS (&(RDG->vertices[I]))
189 #define RDG_MEM_WRITE_STMT(RDG, I) RDGV_HAS_MEM_WRITE (&(RDG->vertices[I]))
190 #define RDG_MEM_READS_STMT(RDG, I) RDGV_HAS_MEM_READS (&(RDG->vertices[I]))
295 struct vertex *v = &(rdg->vertices[i]);
356 struct vertex *v = &(rdg->vertices[i]);
533 /* Build the vertices of the reduced dependence graph RDG. Return false
721 struct vertex *v = &(rdg->vertices[i])
[all...] |
| dominance.cc | 1307 the dominance tree of graph G. BBS maps the vertices of G to the basic
1351 sccs[g->vertices[a].component].safe_push (a);
1436 edges from BBS, creating a forest F. We form a graph G whose vertices
1503 g->vertices[y].data = BITMAP_ALLOC (NULL);
1515 if (!bitmap_set_bit ((bitmap) g->vertices[dom_i].data, i))
1522 BITMAP_FREE (g->vertices[y].data);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| graphds.cc | 36 if (!g->vertices[i].pred
37 && !g->vertices[i].succ)
40 fprintf (f, "%d (%d)\t<-", i, g->vertices[i].component);
41 for (e = g->vertices[i].pred; e; e = e->pred_next)
46 for (e = g->vertices[i].succ; e; e = e->succ_next)
52 /* Creates a new graph with N_VERTICES vertices. */
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]
[all...] |
| graphds.h | 49 int n_vertices; /* Number of vertices. */
50 struct vertex *vertices; /* The vertices. */ member in struct:graph
|
| cfgloopanal.cc | 150 for (ge = g->vertices[i].succ; ge; ge = ge->succ_next)
153 /* edge E in graph G is irreducible if it connects two vertices in the
158 gcc_assert (g->vertices[ge->src].component >= g->vertices[ge->dest].component);
160 if (g->vertices[ge->src].component != g->vertices[ge->dest].component)
|
| tree-vect-slp.cc | 3548 /* Fill the vertices and leafs vector with all nodes in the SLP graph. */
3552 vec<slpg_vertex> &vertices, vec<int> &leafs)
3560 node->vertex = vertices.length ();
3561 vertices.safe_push (slpg_vertex (node));
3569 vect_slp_build_vertices (visited, child, vertices, leafs);
3582 /* Fill the vertices and leafs vector with all nodes in the SLP graph. */
3585 vect_slp_build_vertices (vec_info *info, vec<slpg_vertex> &vertices,
3592 vect_slp_build_vertices (visited, SLP_INSTANCE_TREE (instance), vertices,
3648 auto_vec<slpg_vertex> vertices; local
3650 vect_slp_build_vertices (vinfo, vertices, leafs)
[all...] |
| tree-loop-distribution.cc | 49 The vertices (RDG:V) model all statements in the loop and the edges
59 The vertices (PG:V) model all partitions and the edges (PG:E) model
186 #define RDG_STMT(RDG, I) RDGV_STMT (&(RDG->vertices[I]))
187 #define RDG_DATAREFS(RDG, I) RDGV_DATAREFS (&(RDG->vertices[I]))
188 #define RDG_MEM_WRITE_STMT(RDG, I) RDGV_HAS_MEM_WRITE (&(RDG->vertices[I]))
189 #define RDG_MEM_READS_STMT(RDG, I) RDGV_HAS_MEM_READS (&(RDG->vertices[I]))
294 struct vertex *v = &(rdg->vertices[i]);
355 struct vertex *v = &(rdg->vertices[i]);
532 /* Build the vertices of the reduced dependence graph RDG. Return false
720 struct vertex *v = &(rdg->vertices[i])
[all...] |
| dominance.cc | 1304 the dominance tree of graph G. BBS maps the vertices of G to the basic
1348 sccs[g->vertices[a].component].safe_push (a);
1433 edges from BBS, creating a forest F. We form a graph G whose vertices
1500 g->vertices[y].data = BITMAP_ALLOC (NULL);
1512 if (!bitmap_set_bit ((bitmap) g->vertices[dom_i].data, i))
1519 BITMAP_FREE (g->vertices[y].data);
|
| /src/lib/libc/cdb/ |
| cdbw.c | 360 * and the vertices of the edge don't have to be copied.
371 uint32_t vertices[3]; member in struct:edge
384 struct vertex *vertices; member in struct:state
402 v = &state->vertices[e_->vertices[i]];
411 struct vertex *v_ = &state->vertices[v];
433 memset(state->vertices, 0, sizeof(*state->vertices) * state->entries);
446 e->vertices[j] = fast_remainder32(hashes[j],
451 if (e->vertices[0] == e->vertices[1]
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-xray/ |
| xray-graph-diff.cpp | 153 cl::desc("Output graphs with vertices labeled with this field"),
157 "Do not label Vertices"),
177 cl::desc("Output graphs with vertices colored by this field"),
181 "Do not color Vertices"),
218 for (const auto &V : G.vertices()) {
362 // Get numbering of vertices for dot output.
366 for (const auto &V : G.vertices()) {
389 for (const auto &V : G.vertices()) {
|
| xray-graph.cpp | 84 cl::desc("Output graphs with vertices labeled with this field"),
88 "Do not label Vertices"),
131 "color-vertices",
136 "Do not color vertices"),
311 for (auto &V : G.vertices()) {
339 for (auto &V : G.vertices()) {
396 // through all edges then vertices and then outputting them and their
419 for (const auto &V : G.vertices()) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/XRay/ |
| Graph.h | 48 /// Usage Example Graph with weighted edges and vertices:
55 /// for(const auto &v : G.vertices()){
56 /// // Do something with the vertices in the graph;
66 /// char vb[] = "Vertex B"; // Vertices are referenced by String Refs.
76 /// These objects are used to name edges and vertices in the graph.
80 /// This type is the value_type of all iterators which range over vertices,
81 /// Determined by the Vertices DenseMap
115 VertexMapT Vertices;
268 /// A class for ranging over the vertices in the graph.
284 iterator begin() { return G.Vertices.begin();
349 VertexView<false> vertices() { return VertexView<false>(*this); } function in class:llvm::xray::Graph
351 VertexView<true> vertices() const { return VertexView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /src/external/mit/isl/lib/libisl/ |
| Makefile | 71 vertices.h
|
