| /src/usr.bin/nbperf/ |
| graph2.h | 49 * and the vertices of the edge don't have to be copied.
71 uint32_t vertices[GRAPH_SIZE]; local
|
| /src/external/gpl3/gcc/dist/gcc/ |
| graphds.h | 49 int n_vertices; /* Number of vertices. */
50 struct vertex *vertices; /* The vertices. */ member in struct:graph
|
| 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...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| graphds.h | 49 int n_vertices; /* Number of vertices. */
50 struct vertex *vertices; /* The vertices. */ member in struct:graph
|
| 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...] |
| /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_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);
|
| 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_test.c | 7994 /* Check that "vertex" corresponds to one of the vertices in data->vertex.
8037 isl_vertices *vertices; local
8042 vertices = isl_basic_set_compute_vertices(bset);
8043 n = isl_vertices_get_n_vertices(vertices);
8046 if (isl_vertices_foreach_vertex(vertices, &find_vertex,
8049 isl_vertices_free(vertices);
8055 isl_die(ctx, isl_error_unknown, "unexpected vertices",
10875 isl_vertices *vertices; local
10880 vertices = isl_basic_set_compute_vertices(bset);
10882 if (isl_vertices_foreach_disjoint_cell(vertices, &add_cell
[all...] |
| /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/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...] |
