gcc/graphite-ppl.h

   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>.
   5
   6 This file is part of GCC.
   7
   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)
  11 any later version.
  12
  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.
  17
  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
  23
  24 #include "double-int.h"
  25 #include "tree.h"
  26
  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);
  36
  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_print_linear_expr (FILE *, ppl_Linear_Expression_t);
  42 void debug_ppl_linear_expr (ppl_Linear_Expression_t);
  43 void ppl_read_polyhedron_matrix (ppl_Polyhedron_t *, FILE *);
  44 void ppl_insert_dimensions (ppl_Polyhedron_t, int, int);
  45 void ppl_insert_dimensions_pointset (ppl_Pointset_Powerset_C_Polyhedron_t, int,
  46                                      int);
  47 void ppl_set_inhomogeneous_gmp (ppl_Linear_Expression_t, Value);
  48 void ppl_set_coef_gmp (ppl_Linear_Expression_t, ppl_dimension_type, Value);
  49 void ppl_max_for_le_pointset (ppl_Pointset_Powerset_C_Polyhedron_t,
  50                               ppl_Linear_Expression_t, Value);
  51 void ppl_min_for_le_polyhedron (ppl_Polyhedron_t, ppl_Linear_Expression_t,
  52                                 Value);
  53
  54 /* Assigns to RES the value of the INTEGER_CST T.  */
  55
  56 static inline void
  57 tree_int_to_gmp (tree t, Value res)
  58 {
  59   double_int di = tree_to_double_int (t);
  60   mpz_set_double_int (res, di, TYPE_UNSIGNED (TREE_TYPE (t)));
  61 }
  62
  63 /* Converts a GMP constant VAL to a tree and returns it.  */
  64
  65 static inline tree
  66 gmp_cst_to_tree (tree type, Value val)
  67 {
  68   tree t = type ? type : integer_type_node;
  69   Value tmp;
  70   double_int di;
  71
  72   value_init (tmp);
  73   value_assign (tmp, val);
  74   di = mpz_get_double_int (t, tmp, true);
  75   value_clear (tmp);
  76
  77   return double_int_to_tree (t, di);
  78 }
  79
  80 /* Set the inhomogeneous term of E to the integer X.  */
  81
  82 static inline void
  83 ppl_set_inhomogeneous (ppl_Linear_Expression_t e, int x)
  84 {
  85   Value v;
  86   value_init (v);
  87   value_set_si (v, x);
  88   ppl_set_inhomogeneous_gmp (e, v);
  89   value_clear (v);
  90 }
  91
  92 /* Set the inhomogeneous term of E to the tree X.  */
  93
  94 static inline void
  95 ppl_set_inhomogeneous_tree (ppl_Linear_Expression_t e, tree x)
  96 {
  97   Value v;
  98   value_init (v);
  99   tree_int_to_gmp (x, v);
 100   ppl_set_inhomogeneous_gmp (e, v);
 101   value_clear (v);
 102 }
 103
 104 /* Set E[I] to integer X.  */
 105
 106 static inline void
 107 ppl_set_coef (ppl_Linear_Expression_t e, ppl_dimension_type i, int x)
 108 {
 109   Value v;
 110   value_init (v);
 111   value_set_si (v, x);
 112   ppl_set_coef_gmp (e, i, v);
 113   value_clear (v);
 114 }
 115
 116 /* Set E[I] to tree X.  */
 117
 118 static inline void
 119 ppl_set_coef_tree (ppl_Linear_Expression_t e, ppl_dimension_type i, tree x)
 120 {
 121   Value v;
 122   value_init (v);
 123   tree_int_to_gmp (x, v);
 124   ppl_set_coef_gmp (e, i, v);
 125   value_clear (v);
 126 }
 127
 128 /* Sets RES to the max of V1 and V2.  */
 129
 130 static inline void
 131 value_max (Value res, Value v1, Value v2)
 132 {
 133   if (value_compare (v1, v2) < 0)
 134     value_assign (res, v2);
 135   value_assign (res, v1);
 136 }
 137
 138 /* Builds a new identity map for dimension DIM.  */
 139
 140 static inline ppl_dimension_type *
 141 ppl_new_id_map (ppl_dimension_type dim)
 142 {
 143   ppl_dimension_type *map, i;
 144
 145   map = (ppl_dimension_type *) XNEWVEC (ppl_dimension_type, dim);
 146
 147   for (i = 0; i < dim; i++)
 148     map[i] = i;
 149
 150   return map;
 151 }
 152
 153 /* Builds an interchange of dimensions A and B in MAP.  */
 154
 155 static inline void
 156 ppl_interchange (ppl_dimension_type *map,
 157                  ppl_dimension_type a,
 158                  ppl_dimension_type b)
 159 {
 160   map[a] = b;
 161   map[b] = a;
 162 }
 163
 164 #endif
 165