1 /* Gimple Represented as Polyhedra.
2 Copyright (C) 2009 Free Software Foundation, Inc.
3 Contributed by Sebastian Pop <sebastian.pop@inria.fr>
4 and Tobias Grosser <grosser@fim.uni-passau.de>.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
21 #ifndef GCC_GRAPHITE_PPL_H
22 #define GCC_GRAPHITE_PPL_H
24 #include "double-int.h"
27 CloogMatrix *new_Cloog_Matrix_from_ppl_Polyhedron (ppl_const_Polyhedron_t);
28 CloogDomain *new_Cloog_Domain_from_ppl_Polyhedron (ppl_const_Polyhedron_t);
29 CloogDomain * new_Cloog_Domain_from_ppl_Pointset_Powerset (
30 ppl_Pointset_Powerset_C_Polyhedron_t);
31 void new_C_Polyhedron_from_Cloog_Matrix (ppl_Polyhedron_t *, CloogMatrix *);
32 void insert_constraint_into_matrix (CloogMatrix *, int, ppl_const_Constraint_t);
33 ppl_Polyhedron_t ppl_strip_loop (ppl_Polyhedron_t, ppl_dimension_type, int);
34 int ppl_lexico_compare_linear_expressions (ppl_Linear_Expression_t,
35 ppl_Linear_Expression_t);
37 void ppl_print_polyhedron_matrix (FILE *, ppl_const_Polyhedron_t);
38 void ppl_print_powerset_matrix (FILE *, ppl_Pointset_Powerset_C_Polyhedron_t);
39 void debug_ppl_polyhedron_matrix (ppl_Polyhedron_t);
40 void debug_ppl_powerset_matrix (ppl_Pointset_Powerset_C_Polyhedron_t);
41 void ppl_read_polyhedron_matrix (ppl_Polyhedron_t *, FILE *);
42 void ppl_insert_dimensions (ppl_Polyhedron_t, int, int);
43 void ppl_insert_dimensions_pointset (ppl_Pointset_Powerset_C_Polyhedron_t, int,
45 void ppl_set_inhomogeneous_gmp (ppl_Linear_Expression_t, Value);
46 void ppl_set_coef_gmp (ppl_Linear_Expression_t, ppl_dimension_type, Value);
48 /* Assigns to RES the value of the INTEGER_CST T. */
51 tree_int_to_gmp (tree t, Value res)
53 double_int di = tree_to_double_int (t);
54 mpz_set_double_int (res, di, TYPE_UNSIGNED (TREE_TYPE (t)));
57 /* Converts a GMP constant VAL to a tree and returns it. */
60 gmp_cst_to_tree (tree type, Value val)
62 tree t = type ? type : integer_type_node;
67 value_assign (tmp, val);
68 di = mpz_get_double_int (t, tmp, true);
71 return double_int_to_tree (t, di);
74 /* Set the inhomogeneous term of E to the integer X. */
77 ppl_set_inhomogeneous (ppl_Linear_Expression_t e, int x)
82 ppl_set_inhomogeneous_gmp (e, v);
86 /* Set the inhomogeneous term of E to the tree X. */
89 ppl_set_inhomogeneous_tree (ppl_Linear_Expression_t e, tree x)
93 tree_int_to_gmp (x, v);
94 ppl_set_inhomogeneous_gmp (e, v);
98 /* Set E[I] to integer X. */
101 ppl_set_coef (ppl_Linear_Expression_t e, ppl_dimension_type i, int x)
106 ppl_set_coef_gmp (e, i, v);
110 /* Set E[I] to tree X. */
113 ppl_set_coef_tree (ppl_Linear_Expression_t e, ppl_dimension_type i, tree x)
117 tree_int_to_gmp (x, v);
118 ppl_set_coef_gmp (e, i, v);
122 /* Sets RES to the max of V1 and V2. */
125 value_max (Value res, Value v1, Value v2)
127 if (value_compare (v1, v2) < 0)
128 value_assign (res, v2);
129 value_assign (res, v1);
132 /* Builds a new identity map for dimension DIM. */
134 static inline ppl_dimension_type *
135 ppl_new_id_map (ppl_dimension_type dim)
137 ppl_dimension_type *map, i;
139 map = (ppl_dimension_type *) XNEWVEC (ppl_dimension_type, dim);
141 for (i = 0; i < dim; i++)
147 /* Builds an interchange of dimensions A and B in MAP. */
150 ppl_interchange (ppl_dimension_type *map,
151 ppl_dimension_type a,
152 ppl_dimension_type b)