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