HomeSort by: relevance | last modified time | path
    Searched defs:n_vertices (Results 1 - 5 of 5) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
graphds.h 49 int n_vertices; /* Number of vertices. */ member in struct:graph
  /src/external/gpl3/gcc.old/dist/gcc/
graphds.h 49 int n_vertices; /* Number of vertices. */ member in struct:graph
  /src/external/mit/isl/dist/
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
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);
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 = 0 local
667 int n_vertices = 0; local
    [all...]

Completed in 23 milliseconds