xref: /dflybsd-src/contrib/gcc-4.7/gcc/graphite-ppl.h (revision 04febcfb30580676d3e95f58a16c5137ee478b32)
1*e4b17023SJohn Marino /* Gimple Represented as Polyhedra.
2*e4b17023SJohn Marino    Copyright (C) 2009, 2010 Free Software Foundation, Inc.
3*e4b17023SJohn Marino    Contributed by Sebastian Pop <sebastian.pop@inria.fr>
4*e4b17023SJohn Marino    and Tobias Grosser <grosser@fim.uni-passau.de>.
5*e4b17023SJohn Marino 
6*e4b17023SJohn Marino This file is part of GCC.
7*e4b17023SJohn Marino 
8*e4b17023SJohn Marino GCC is free software; you can redistribute it and/or modify
9*e4b17023SJohn Marino it under the terms of the GNU General Public License as published by
10*e4b17023SJohn Marino the Free Software Foundation; either version 3, or (at your option)
11*e4b17023SJohn Marino any later version.
12*e4b17023SJohn Marino 
13*e4b17023SJohn Marino GCC is distributed in the hope that it will be useful,
14*e4b17023SJohn Marino but WITHOUT ANY WARRANTY; without even the implied warranty of
15*e4b17023SJohn Marino MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
16*e4b17023SJohn Marino GNU General Public License for more details.
17*e4b17023SJohn Marino 
18*e4b17023SJohn Marino You should have received a copy of the GNU General Public License
19*e4b17023SJohn Marino along with GCC; see the file COPYING3.  If not see
20*e4b17023SJohn Marino <http://www.gnu.org/licenses/>.  */
21*e4b17023SJohn Marino #ifndef GCC_GRAPHITE_PPL_H
22*e4b17023SJohn Marino #define GCC_GRAPHITE_PPL_H
23*e4b17023SJohn Marino 
24*e4b17023SJohn Marino #include "double-int.h"
25*e4b17023SJohn Marino #include "tree.h"
26*e4b17023SJohn Marino 
27*e4b17023SJohn Marino ppl_Polyhedron_t ppl_strip_loop (ppl_Polyhedron_t, ppl_dimension_type, int);
28*e4b17023SJohn Marino int ppl_lexico_compare_linear_expressions (ppl_Linear_Expression_t,
29*e4b17023SJohn Marino 					   ppl_Linear_Expression_t);
30*e4b17023SJohn Marino 
31*e4b17023SJohn Marino void ppl_print_polyhedron_matrix (FILE *, ppl_const_Polyhedron_t);
32*e4b17023SJohn Marino void ppl_print_powerset_matrix (FILE *, ppl_Pointset_Powerset_C_Polyhedron_t);
33*e4b17023SJohn Marino void debug_ppl_polyhedron_matrix (ppl_Polyhedron_t);
34*e4b17023SJohn Marino void debug_ppl_powerset_matrix (ppl_Pointset_Powerset_C_Polyhedron_t);
35*e4b17023SJohn Marino void ppl_print_linear_expr (FILE *, ppl_Linear_Expression_t);
36*e4b17023SJohn Marino void debug_ppl_linear_expr (ppl_Linear_Expression_t);
37*e4b17023SJohn Marino void ppl_read_polyhedron_matrix (ppl_Polyhedron_t *, FILE *);
38*e4b17023SJohn Marino void ppl_insert_dimensions (ppl_Polyhedron_t, int, int);
39*e4b17023SJohn Marino void ppl_insert_dimensions_pointset (ppl_Pointset_Powerset_C_Polyhedron_t, int,
40*e4b17023SJohn Marino 				     int);
41*e4b17023SJohn Marino void ppl_set_inhomogeneous_gmp (ppl_Linear_Expression_t, mpz_t);
42*e4b17023SJohn Marino void ppl_set_coef_gmp (ppl_Linear_Expression_t, ppl_dimension_type, mpz_t);
43*e4b17023SJohn Marino void ppl_max_for_le_pointset (ppl_Pointset_Powerset_C_Polyhedron_t,
44*e4b17023SJohn Marino                               ppl_Linear_Expression_t, mpz_t);
45*e4b17023SJohn Marino void ppl_min_for_le_pointset (ppl_Pointset_Powerset_C_Polyhedron_t,
46*e4b17023SJohn Marino 			      ppl_Linear_Expression_t, mpz_t);
47*e4b17023SJohn Marino ppl_Constraint_t ppl_build_relation (int, int, int, int,
48*e4b17023SJohn Marino 				     enum ppl_enum_Constraint_Type);
49*e4b17023SJohn Marino void debug_gmp_value (mpz_t);
50*e4b17023SJohn Marino bool ppl_powerset_is_empty (ppl_Pointset_Powerset_C_Polyhedron_t);
51*e4b17023SJohn Marino 
52*e4b17023SJohn Marino 
53*e4b17023SJohn Marino /* Assigns to RES the value of the INTEGER_CST T.  */
54*e4b17023SJohn Marino 
55*e4b17023SJohn Marino static inline void
tree_int_to_gmp(tree t,mpz_t res)56*e4b17023SJohn Marino tree_int_to_gmp (tree t, mpz_t res)
57*e4b17023SJohn Marino {
58*e4b17023SJohn Marino   double_int di = tree_to_double_int (t);
59*e4b17023SJohn Marino   mpz_set_double_int (res, di, TYPE_UNSIGNED (TREE_TYPE (t)));
60*e4b17023SJohn Marino }
61*e4b17023SJohn Marino 
62*e4b17023SJohn Marino /* Converts a GMP constant VAL to a tree and returns it.  */
63*e4b17023SJohn Marino 
64*e4b17023SJohn Marino static inline tree
gmp_cst_to_tree(tree type,mpz_t val)65*e4b17023SJohn Marino gmp_cst_to_tree (tree type, mpz_t val)
66*e4b17023SJohn Marino {
67*e4b17023SJohn Marino   tree t = type ? type : integer_type_node;
68*e4b17023SJohn Marino   mpz_t tmp;
69*e4b17023SJohn Marino   double_int di;
70*e4b17023SJohn Marino 
71*e4b17023SJohn Marino   mpz_init (tmp);
72*e4b17023SJohn Marino   mpz_set (tmp, val);
73*e4b17023SJohn Marino   di = mpz_get_double_int (t, tmp, true);
74*e4b17023SJohn Marino   mpz_clear (tmp);
75*e4b17023SJohn Marino 
76*e4b17023SJohn Marino   return double_int_to_tree (t, di);
77*e4b17023SJohn Marino }
78*e4b17023SJohn Marino 
79*e4b17023SJohn Marino /* Set the inhomogeneous term of E to the integer X.  */
80*e4b17023SJohn Marino 
81*e4b17023SJohn Marino static inline void
ppl_set_inhomogeneous(ppl_Linear_Expression_t e,int x)82*e4b17023SJohn Marino ppl_set_inhomogeneous (ppl_Linear_Expression_t e, int x)
83*e4b17023SJohn Marino {
84*e4b17023SJohn Marino   mpz_t v;
85*e4b17023SJohn Marino   mpz_init (v);
86*e4b17023SJohn Marino   mpz_set_si (v, x);
87*e4b17023SJohn Marino   ppl_set_inhomogeneous_gmp (e, v);
88*e4b17023SJohn Marino   mpz_clear (v);
89*e4b17023SJohn Marino }
90*e4b17023SJohn Marino 
91*e4b17023SJohn Marino /* Set the inhomogeneous term of E to the tree X.  */
92*e4b17023SJohn Marino 
93*e4b17023SJohn Marino static inline void
ppl_set_inhomogeneous_tree(ppl_Linear_Expression_t e,tree x)94*e4b17023SJohn Marino ppl_set_inhomogeneous_tree (ppl_Linear_Expression_t e, tree x)
95*e4b17023SJohn Marino {
96*e4b17023SJohn Marino   mpz_t v;
97*e4b17023SJohn Marino   mpz_init (v);
98*e4b17023SJohn Marino   tree_int_to_gmp (x, v);
99*e4b17023SJohn Marino   ppl_set_inhomogeneous_gmp (e, v);
100*e4b17023SJohn Marino   mpz_clear (v);
101*e4b17023SJohn Marino }
102*e4b17023SJohn Marino 
103*e4b17023SJohn Marino /* Set E[I] to integer X.  */
104*e4b17023SJohn Marino 
105*e4b17023SJohn Marino static inline void
ppl_set_coef(ppl_Linear_Expression_t e,ppl_dimension_type i,int x)106*e4b17023SJohn Marino ppl_set_coef (ppl_Linear_Expression_t e, ppl_dimension_type i, int x)
107*e4b17023SJohn Marino {
108*e4b17023SJohn Marino   mpz_t v;
109*e4b17023SJohn Marino   mpz_init (v);
110*e4b17023SJohn Marino   mpz_set_si (v, x);
111*e4b17023SJohn Marino   ppl_set_coef_gmp (e, i, v);
112*e4b17023SJohn Marino   mpz_clear (v);
113*e4b17023SJohn Marino }
114*e4b17023SJohn Marino 
115*e4b17023SJohn Marino /* Set E[I] to tree X.  */
116*e4b17023SJohn Marino 
117*e4b17023SJohn Marino static inline void
ppl_set_coef_tree(ppl_Linear_Expression_t e,ppl_dimension_type i,tree x)118*e4b17023SJohn Marino ppl_set_coef_tree (ppl_Linear_Expression_t e, ppl_dimension_type i, tree x)
119*e4b17023SJohn Marino {
120*e4b17023SJohn Marino   mpz_t v;
121*e4b17023SJohn Marino   mpz_init (v);
122*e4b17023SJohn Marino   tree_int_to_gmp (x, v);
123*e4b17023SJohn Marino   ppl_set_coef_gmp (e, i, v);
124*e4b17023SJohn Marino   mpz_clear (v);
125*e4b17023SJohn Marino }
126*e4b17023SJohn Marino 
127*e4b17023SJohn Marino /* Sets RES to the min of V1 and V2.  */
128*e4b17023SJohn Marino 
129*e4b17023SJohn Marino static inline void
value_min(mpz_t res,mpz_t v1,mpz_t v2)130*e4b17023SJohn Marino value_min (mpz_t res, mpz_t v1, mpz_t v2)
131*e4b17023SJohn Marino {
132*e4b17023SJohn Marino   if (mpz_cmp (v1, v2) < 0)
133*e4b17023SJohn Marino     mpz_set (res, v1);
134*e4b17023SJohn Marino   else
135*e4b17023SJohn Marino     mpz_set (res, v2);
136*e4b17023SJohn Marino }
137*e4b17023SJohn Marino 
138*e4b17023SJohn Marino /* Sets RES to the max of V1 and V2.  */
139*e4b17023SJohn Marino 
140*e4b17023SJohn Marino static inline void
value_max(mpz_t res,mpz_t v1,mpz_t v2)141*e4b17023SJohn Marino value_max (mpz_t res, mpz_t v1, mpz_t v2)
142*e4b17023SJohn Marino {
143*e4b17023SJohn Marino   if (mpz_cmp (v1, v2) < 0)
144*e4b17023SJohn Marino     mpz_set (res, v2);
145*e4b17023SJohn Marino   else
146*e4b17023SJohn Marino     mpz_set (res, v1);
147*e4b17023SJohn Marino }
148*e4b17023SJohn Marino 
149*e4b17023SJohn Marino /* Builds a new identity map for dimension DIM.  */
150*e4b17023SJohn Marino 
151*e4b17023SJohn Marino static inline ppl_dimension_type *
ppl_new_id_map(ppl_dimension_type dim)152*e4b17023SJohn Marino ppl_new_id_map (ppl_dimension_type dim)
153*e4b17023SJohn Marino {
154*e4b17023SJohn Marino   ppl_dimension_type *map, i;
155*e4b17023SJohn Marino 
156*e4b17023SJohn Marino   map = (ppl_dimension_type *) XNEWVEC (ppl_dimension_type, dim);
157*e4b17023SJohn Marino 
158*e4b17023SJohn Marino   for (i = 0; i < dim; i++)
159*e4b17023SJohn Marino     map[i] = i;
160*e4b17023SJohn Marino 
161*e4b17023SJohn Marino   return map;
162*e4b17023SJohn Marino }
163*e4b17023SJohn Marino 
164*e4b17023SJohn Marino /* Builds an interchange of dimensions A and B in MAP.  */
165*e4b17023SJohn Marino 
166*e4b17023SJohn Marino static inline void
ppl_interchange(ppl_dimension_type * map,ppl_dimension_type a,ppl_dimension_type b)167*e4b17023SJohn Marino ppl_interchange (ppl_dimension_type *map,
168*e4b17023SJohn Marino 		 ppl_dimension_type a,
169*e4b17023SJohn Marino 		 ppl_dimension_type b)
170*e4b17023SJohn Marino {
171*e4b17023SJohn Marino   map[a] = b;
172*e4b17023SJohn Marino   map[b] = a;
173*e4b17023SJohn Marino }
174*e4b17023SJohn Marino 
175*e4b17023SJohn Marino #endif
176*e4b17023SJohn Marino 
177