isl_scheduler.c: compute_weights: use isl_basic_map_n_equality
[isl.git] / isl_vertices_private.h
blob37e640755087e0fc78cb4d394ba7377b750081d0
1 #ifndef ISL_VERTICES_PRIVATE_H
2 #define ISL_VERTICES_PRIVATE_H
4 #include <isl/set.h>
5 #include <isl/vertices.h>
7 #if defined(__cplusplus)
8 extern "C" {
9 #endif
11 struct isl_morph;
13 /* A parametric vertex. "vertex" contains the actual description
14 * of the vertex as a singleton parametric set. "dom" is the projection
15 * of "vertex" onto the parameter space, i.e., the activity domain
16 * of the vertex.
17 * During the construction of vertices and chambers, the activity domain
18 * of every parametric vertex is full-dimensional.
20 struct isl_vertex {
21 isl_basic_set *dom;
22 isl_basic_set *vertex;
25 /* A chamber in the chamber decomposition. The indices of the "n_vertices"
26 * active vertices are stored in "vertices".
28 struct isl_chamber {
29 int n_vertices;
30 int *vertices;
31 isl_basic_set *dom;
34 struct isl_vertices {
35 int ref;
37 /* The rational basic set spanned by the vertices. */
38 isl_basic_set *bset;
40 int n_vertices;
41 struct isl_vertex *v;
43 int n_chambers;
44 struct isl_chamber *c;
47 struct isl_cell {
48 int n_vertices;
49 int *ids;
50 isl_vertices *vertices;
51 isl_basic_set *dom;
54 struct isl_external_vertex {
55 isl_vertices *vertices;
56 int id;
59 isl_stat isl_vertices_foreach_disjoint_cell(__isl_keep isl_vertices *vertices,
60 isl_stat (*fn)(__isl_take isl_cell *cell, void *user), void *user);
61 isl_stat isl_cell_foreach_simplex(__isl_take isl_cell *cell,
62 isl_stat (*fn)(__isl_take isl_cell *simplex, void *user), void *user);
64 __isl_give isl_vertices *isl_morph_vertices(__isl_take struct isl_morph *morph,
65 __isl_take isl_vertices *vertices);
67 #if defined(__cplusplus)
69 #endif
71 #endif