/* Gimple Represented as Polyhedra.
|
/* Gimple Represented as Polyhedra.
|
Copyright (C) 2009, 2010 Free Software Foundation, Inc.
|
Copyright (C) 2009, 2010 Free Software Foundation, Inc.
|
Contributed by Sebastian Pop <sebastian.pop@amd.com>
|
Contributed by Sebastian Pop <sebastian.pop@amd.com>
|
and Tobias Grosser <grosser@fim.uni-passau.de>
|
and Tobias Grosser <grosser@fim.uni-passau.de>
|
|
|
This file is part of GCC.
|
This file is part of GCC.
|
|
|
GCC is free software; you can redistribute it and/or modify
|
GCC is free software; you can redistribute it and/or modify
|
it under the terms of the GNU General Public License as published by
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 3, or (at your option)
|
the Free Software Foundation; either version 3, or (at your option)
|
any later version.
|
any later version.
|
|
|
GCC is distributed in the hope that it will be useful,
|
GCC is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with GCC; see the file COPYING3. If not see
|
along with GCC; see the file COPYING3. If not see
|
<http://www.gnu.org/licenses/>. */
|
<http://www.gnu.org/licenses/>. */
|
|
|
#include "config.h"
|
#include "config.h"
|
#include "system.h"
|
#include "system.h"
|
#include "coretypes.h"
|
#include "coretypes.h"
|
#include "tm.h"
|
#include "tm.h"
|
#include "ggc.h"
|
#include "ggc.h"
|
|
|
#ifdef HAVE_cloog
|
#ifdef HAVE_cloog
|
#include "ppl_c.h"
|
#include "ppl_c.h"
|
#include "cloog/cloog.h"
|
#include "cloog/cloog.h"
|
#include "graphite-ppl.h"
|
#include "graphite-ppl.h"
|
|
|
/* Translates row ROW of the CloogMatrix MATRIX to a PPL Constraint. */
|
/* Translates row ROW of the CloogMatrix MATRIX to a PPL Constraint. */
|
|
|
static ppl_Constraint_t
|
static ppl_Constraint_t
|
cloog_matrix_to_ppl_constraint (CloogMatrix *matrix, int row)
|
cloog_matrix_to_ppl_constraint (CloogMatrix *matrix, int row)
|
{
|
{
|
int j;
|
int j;
|
ppl_Constraint_t cstr;
|
ppl_Constraint_t cstr;
|
ppl_Coefficient_t coef;
|
ppl_Coefficient_t coef;
|
ppl_Linear_Expression_t expr;
|
ppl_Linear_Expression_t expr;
|
ppl_dimension_type dim = matrix->NbColumns - 2;
|
ppl_dimension_type dim = matrix->NbColumns - 2;
|
|
|
ppl_new_Coefficient (&coef);
|
ppl_new_Coefficient (&coef);
|
ppl_new_Linear_Expression_with_dimension (&expr, dim);
|
ppl_new_Linear_Expression_with_dimension (&expr, dim);
|
|
|
for (j = 1; j < matrix->NbColumns - 1; j++)
|
for (j = 1; j < matrix->NbColumns - 1; j++)
|
{
|
{
|
ppl_assign_Coefficient_from_mpz_t (coef, matrix->p[row][j]);
|
ppl_assign_Coefficient_from_mpz_t (coef, matrix->p[row][j]);
|
ppl_Linear_Expression_add_to_coefficient (expr, j - 1, coef);
|
ppl_Linear_Expression_add_to_coefficient (expr, j - 1, coef);
|
}
|
}
|
|
|
ppl_assign_Coefficient_from_mpz_t (coef,
|
ppl_assign_Coefficient_from_mpz_t (coef,
|
matrix->p[row][matrix->NbColumns - 1]);
|
matrix->p[row][matrix->NbColumns - 1]);
|
ppl_Linear_Expression_add_to_inhomogeneous (expr, coef);
|
ppl_Linear_Expression_add_to_inhomogeneous (expr, coef);
|
ppl_delete_Coefficient (coef);
|
ppl_delete_Coefficient (coef);
|
|
|
if (value_zero_p (matrix->p[row][0]))
|
if (value_zero_p (matrix->p[row][0]))
|
ppl_new_Constraint (&cstr, expr, PPL_CONSTRAINT_TYPE_EQUAL);
|
ppl_new_Constraint (&cstr, expr, PPL_CONSTRAINT_TYPE_EQUAL);
|
else
|
else
|
ppl_new_Constraint (&cstr, expr, PPL_CONSTRAINT_TYPE_GREATER_OR_EQUAL);
|
ppl_new_Constraint (&cstr, expr, PPL_CONSTRAINT_TYPE_GREATER_OR_EQUAL);
|
|
|
ppl_delete_Linear_Expression (expr);
|
ppl_delete_Linear_Expression (expr);
|
return cstr;
|
return cstr;
|
}
|
}
|
|
|
/* Creates a PPL constraint system from MATRIX. */
|
/* Creates a PPL constraint system from MATRIX. */
|
|
|
static void
|
static void
|
new_Constraint_System_from_Cloog_Matrix (ppl_Constraint_System_t *pcs,
|
new_Constraint_System_from_Cloog_Matrix (ppl_Constraint_System_t *pcs,
|
CloogMatrix *matrix)
|
CloogMatrix *matrix)
|
{
|
{
|
int i;
|
int i;
|
|
|
ppl_new_Constraint_System (pcs);
|
ppl_new_Constraint_System (pcs);
|
|
|
for (i = 0; i < matrix->NbRows; i++)
|
for (i = 0; i < matrix->NbRows; i++)
|
{
|
{
|
ppl_Constraint_t c = cloog_matrix_to_ppl_constraint (matrix, i);
|
ppl_Constraint_t c = cloog_matrix_to_ppl_constraint (matrix, i);
|
ppl_Constraint_System_insert_Constraint (*pcs, c);
|
ppl_Constraint_System_insert_Constraint (*pcs, c);
|
ppl_delete_Constraint (c);
|
ppl_delete_Constraint (c);
|
}
|
}
|
}
|
}
|
|
|
/* Creates a PPL Polyhedron from MATRIX. */
|
/* Creates a PPL Polyhedron from MATRIX. */
|
|
|
void
|
void
|
new_C_Polyhedron_from_Cloog_Matrix (ppl_Polyhedron_t *ph,
|
new_C_Polyhedron_from_Cloog_Matrix (ppl_Polyhedron_t *ph,
|
CloogMatrix *matrix)
|
CloogMatrix *matrix)
|
{
|
{
|
ppl_Constraint_System_t cs;
|
ppl_Constraint_System_t cs;
|
new_Constraint_System_from_Cloog_Matrix (&cs, matrix);
|
new_Constraint_System_from_Cloog_Matrix (&cs, matrix);
|
ppl_new_C_Polyhedron_recycle_Constraint_System (ph, cs);
|
ppl_new_C_Polyhedron_recycle_Constraint_System (ph, cs);
|
}
|
}
|
|
|
/* Counts the number of constraints in PCS. */
|
/* Counts the number of constraints in PCS. */
|
|
|
static int
|
static int
|
ppl_Constrain_System_number_of_constraints (ppl_const_Constraint_System_t pcs)
|
ppl_Constrain_System_number_of_constraints (ppl_const_Constraint_System_t pcs)
|
{
|
{
|
ppl_Constraint_System_const_iterator_t cit, end;
|
ppl_Constraint_System_const_iterator_t cit, end;
|
int num = 0;
|
int num = 0;
|
|
|
ppl_new_Constraint_System_const_iterator (&cit);
|
ppl_new_Constraint_System_const_iterator (&cit);
|
ppl_new_Constraint_System_const_iterator (&end);
|
ppl_new_Constraint_System_const_iterator (&end);
|
|
|
for (ppl_Constraint_System_begin (pcs, cit),
|
for (ppl_Constraint_System_begin (pcs, cit),
|
ppl_Constraint_System_end (pcs, end);
|
ppl_Constraint_System_end (pcs, end);
|
!ppl_Constraint_System_const_iterator_equal_test (cit, end);
|
!ppl_Constraint_System_const_iterator_equal_test (cit, end);
|
ppl_Constraint_System_const_iterator_increment (cit))
|
ppl_Constraint_System_const_iterator_increment (cit))
|
num++;
|
num++;
|
|
|
ppl_delete_Constraint_System_const_iterator (cit);
|
ppl_delete_Constraint_System_const_iterator (cit);
|
ppl_delete_Constraint_System_const_iterator (end);
|
ppl_delete_Constraint_System_const_iterator (end);
|
return num;
|
return num;
|
}
|
}
|
|
|
static void
|
static void
|
oppose_constraint (CloogMatrix *m, int row)
|
oppose_constraint (CloogMatrix *m, int row)
|
{
|
{
|
int k;
|
int k;
|
|
|
/* Do not oppose the first column: it is the eq/ineq one. */
|
/* Do not oppose the first column: it is the eq/ineq one. */
|
for (k = 1; k < m->NbColumns; k++)
|
for (k = 1; k < m->NbColumns; k++)
|
value_oppose (m->p[row][k], m->p[row][k]);
|
value_oppose (m->p[row][k], m->p[row][k]);
|
}
|
}
|
|
|
/* Inserts constraint CSTR at row ROW of matrix M. */
|
/* Inserts constraint CSTR at row ROW of matrix M. */
|
|
|
void
|
void
|
insert_constraint_into_matrix (CloogMatrix *m, int row,
|
insert_constraint_into_matrix (CloogMatrix *m, int row,
|
ppl_const_Constraint_t cstr)
|
ppl_const_Constraint_t cstr)
|
{
|
{
|
ppl_Coefficient_t c;
|
ppl_Coefficient_t c;
|
ppl_dimension_type i, dim, nb_cols = m->NbColumns;
|
ppl_dimension_type i, dim, nb_cols = m->NbColumns;
|
|
|
ppl_Constraint_space_dimension (cstr, &dim);
|
ppl_Constraint_space_dimension (cstr, &dim);
|
ppl_new_Coefficient (&c);
|
ppl_new_Coefficient (&c);
|
|
|
for (i = 0; i < dim; i++)
|
for (i = 0; i < dim; i++)
|
{
|
{
|
ppl_Constraint_coefficient (cstr, i, c);
|
ppl_Constraint_coefficient (cstr, i, c);
|
ppl_Coefficient_to_mpz_t (c, m->p[row][i + 1]);
|
ppl_Coefficient_to_mpz_t (c, m->p[row][i + 1]);
|
}
|
}
|
|
|
for (i = dim; i < nb_cols - 1; i++)
|
for (i = dim; i < nb_cols - 1; i++)
|
value_set_si (m->p[row][i + 1], 0);
|
value_set_si (m->p[row][i + 1], 0);
|
|
|
ppl_Constraint_inhomogeneous_term (cstr, c);
|
ppl_Constraint_inhomogeneous_term (cstr, c);
|
ppl_Coefficient_to_mpz_t (c, m->p[row][nb_cols - 1]);
|
ppl_Coefficient_to_mpz_t (c, m->p[row][nb_cols - 1]);
|
value_set_si (m->p[row][0], 1);
|
value_set_si (m->p[row][0], 1);
|
|
|
switch (ppl_Constraint_type (cstr))
|
switch (ppl_Constraint_type (cstr))
|
{
|
{
|
case PPL_CONSTRAINT_TYPE_LESS_THAN:
|
case PPL_CONSTRAINT_TYPE_LESS_THAN:
|
oppose_constraint (m, row);
|
oppose_constraint (m, row);
|
case PPL_CONSTRAINT_TYPE_GREATER_THAN:
|
case PPL_CONSTRAINT_TYPE_GREATER_THAN:
|
value_sub_int (m->p[row][nb_cols - 1],
|
value_sub_int (m->p[row][nb_cols - 1],
|
m->p[row][nb_cols - 1], 1);
|
m->p[row][nb_cols - 1], 1);
|
break;
|
break;
|
|
|
case PPL_CONSTRAINT_TYPE_LESS_OR_EQUAL:
|
case PPL_CONSTRAINT_TYPE_LESS_OR_EQUAL:
|
oppose_constraint (m, row);
|
oppose_constraint (m, row);
|
case PPL_CONSTRAINT_TYPE_GREATER_OR_EQUAL:
|
case PPL_CONSTRAINT_TYPE_GREATER_OR_EQUAL:
|
break;
|
break;
|
|
|
case PPL_CONSTRAINT_TYPE_EQUAL:
|
case PPL_CONSTRAINT_TYPE_EQUAL:
|
value_set_si (m->p[row][0], 0);
|
value_set_si (m->p[row][0], 0);
|
break;
|
break;
|
|
|
default:
|
default:
|
/* Not yet implemented. */
|
/* Not yet implemented. */
|
gcc_unreachable();
|
gcc_unreachable();
|
}
|
}
|
|
|
ppl_delete_Coefficient (c);
|
ppl_delete_Coefficient (c);
|
}
|
}
|
|
|
/* Creates a CloogMatrix from constraint system PCS. */
|
/* Creates a CloogMatrix from constraint system PCS. */
|
|
|
static CloogMatrix *
|
static CloogMatrix *
|
new_Cloog_Matrix_from_ppl_Constraint_System (ppl_const_Constraint_System_t pcs)
|
new_Cloog_Matrix_from_ppl_Constraint_System (ppl_const_Constraint_System_t pcs)
|
{
|
{
|
CloogMatrix *matrix;
|
CloogMatrix *matrix;
|
ppl_Constraint_System_const_iterator_t cit, end;
|
ppl_Constraint_System_const_iterator_t cit, end;
|
ppl_dimension_type dim;
|
ppl_dimension_type dim;
|
int rows;
|
int rows;
|
int row = 0;
|
int row = 0;
|
|
|
rows = ppl_Constrain_System_number_of_constraints (pcs);
|
rows = ppl_Constrain_System_number_of_constraints (pcs);
|
ppl_Constraint_System_space_dimension (pcs, &dim);
|
ppl_Constraint_System_space_dimension (pcs, &dim);
|
matrix = cloog_matrix_alloc (rows, dim + 2);
|
matrix = cloog_matrix_alloc (rows, dim + 2);
|
ppl_new_Constraint_System_const_iterator (&cit);
|
ppl_new_Constraint_System_const_iterator (&cit);
|
ppl_new_Constraint_System_const_iterator (&end);
|
ppl_new_Constraint_System_const_iterator (&end);
|
|
|
for (ppl_Constraint_System_begin (pcs, cit),
|
for (ppl_Constraint_System_begin (pcs, cit),
|
ppl_Constraint_System_end (pcs, end);
|
ppl_Constraint_System_end (pcs, end);
|
!ppl_Constraint_System_const_iterator_equal_test (cit, end);
|
!ppl_Constraint_System_const_iterator_equal_test (cit, end);
|
ppl_Constraint_System_const_iterator_increment (cit))
|
ppl_Constraint_System_const_iterator_increment (cit))
|
{
|
{
|
ppl_const_Constraint_t c;
|
ppl_const_Constraint_t c;
|
ppl_Constraint_System_const_iterator_dereference (cit, &c);
|
ppl_Constraint_System_const_iterator_dereference (cit, &c);
|
insert_constraint_into_matrix (matrix, row, c);
|
insert_constraint_into_matrix (matrix, row, c);
|
row++;
|
row++;
|
}
|
}
|
|
|
ppl_delete_Constraint_System_const_iterator (cit);
|
ppl_delete_Constraint_System_const_iterator (cit);
|
ppl_delete_Constraint_System_const_iterator (end);
|
ppl_delete_Constraint_System_const_iterator (end);
|
|
|
return matrix;
|
return matrix;
|
}
|
}
|
|
|
/* Creates a CloogMatrix from polyhedron PH. */
|
/* Creates a CloogMatrix from polyhedron PH. */
|
|
|
CloogMatrix *
|
CloogMatrix *
|
new_Cloog_Matrix_from_ppl_Polyhedron (ppl_const_Polyhedron_t ph)
|
new_Cloog_Matrix_from_ppl_Polyhedron (ppl_const_Polyhedron_t ph)
|
{
|
{
|
ppl_const_Constraint_System_t pcs;
|
ppl_const_Constraint_System_t pcs;
|
CloogMatrix *res;
|
CloogMatrix *res;
|
|
|
ppl_Polyhedron_get_constraints (ph, &pcs);
|
ppl_Polyhedron_get_constraints (ph, &pcs);
|
res = new_Cloog_Matrix_from_ppl_Constraint_System (pcs);
|
res = new_Cloog_Matrix_from_ppl_Constraint_System (pcs);
|
|
|
return res;
|
return res;
|
}
|
}
|
|
|
/* Creates a CloogDomain from polyhedron PH. */
|
/* Creates a CloogDomain from polyhedron PH. */
|
|
|
CloogDomain *
|
CloogDomain *
|
new_Cloog_Domain_from_ppl_Polyhedron (ppl_const_Polyhedron_t ph)
|
new_Cloog_Domain_from_ppl_Polyhedron (ppl_const_Polyhedron_t ph)
|
{
|
{
|
CloogMatrix *mat = new_Cloog_Matrix_from_ppl_Polyhedron (ph);
|
CloogMatrix *mat = new_Cloog_Matrix_from_ppl_Polyhedron (ph);
|
CloogDomain *res = cloog_domain_matrix2domain (mat);
|
CloogDomain *res = cloog_domain_matrix2domain (mat);
|
cloog_matrix_free (mat);
|
cloog_matrix_free (mat);
|
return res;
|
return res;
|
}
|
}
|
|
|
/* Creates a CloogDomain from a pointset powerset PS. */
|
/* Creates a CloogDomain from a pointset powerset PS. */
|
|
|
CloogDomain *
|
CloogDomain *
|
new_Cloog_Domain_from_ppl_Pointset_Powerset (
|
new_Cloog_Domain_from_ppl_Pointset_Powerset (
|
ppl_Pointset_Powerset_C_Polyhedron_t ps)
|
ppl_Pointset_Powerset_C_Polyhedron_t ps)
|
{
|
{
|
CloogDomain *res = NULL;
|
CloogDomain *res = NULL;
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_t it, end;
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_t it, end;
|
|
|
ppl_new_Pointset_Powerset_C_Polyhedron_iterator (&it);
|
ppl_new_Pointset_Powerset_C_Polyhedron_iterator (&it);
|
ppl_new_Pointset_Powerset_C_Polyhedron_iterator (&end);
|
ppl_new_Pointset_Powerset_C_Polyhedron_iterator (&end);
|
|
|
for (ppl_Pointset_Powerset_C_Polyhedron_iterator_begin (ps, it),
|
for (ppl_Pointset_Powerset_C_Polyhedron_iterator_begin (ps, it),
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_end (ps, end);
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_end (ps, end);
|
!ppl_Pointset_Powerset_C_Polyhedron_iterator_equal_test (it, end);
|
!ppl_Pointset_Powerset_C_Polyhedron_iterator_equal_test (it, end);
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_increment (it))
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_increment (it))
|
{
|
{
|
ppl_const_Polyhedron_t ph;
|
ppl_const_Polyhedron_t ph;
|
CloogDomain *tmp;
|
CloogDomain *tmp;
|
|
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_dereference (it, &ph);
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_dereference (it, &ph);
|
tmp = new_Cloog_Domain_from_ppl_Polyhedron (ph);
|
tmp = new_Cloog_Domain_from_ppl_Polyhedron (ph);
|
|
|
if (res == NULL)
|
if (res == NULL)
|
res = tmp;
|
res = tmp;
|
else
|
else
|
res = cloog_domain_union (res, tmp);
|
res = cloog_domain_union (res, tmp);
|
}
|
}
|
|
|
ppl_delete_Pointset_Powerset_C_Polyhedron_iterator (it);
|
ppl_delete_Pointset_Powerset_C_Polyhedron_iterator (it);
|
ppl_delete_Pointset_Powerset_C_Polyhedron_iterator (end);
|
ppl_delete_Pointset_Powerset_C_Polyhedron_iterator (end);
|
|
|
gcc_assert (res != NULL);
|
gcc_assert (res != NULL);
|
|
|
return res;
|
return res;
|
}
|
}
|
|
|
/* Set the inhomogeneous term of E to X. */
|
/* Set the inhomogeneous term of E to X. */
|
|
|
void
|
void
|
ppl_set_inhomogeneous_gmp (ppl_Linear_Expression_t e, Value x)
|
ppl_set_inhomogeneous_gmp (ppl_Linear_Expression_t e, Value x)
|
{
|
{
|
Value v0, v1;
|
Value v0, v1;
|
ppl_Coefficient_t c;
|
ppl_Coefficient_t c;
|
|
|
value_init (v0);
|
value_init (v0);
|
value_init (v1);
|
value_init (v1);
|
ppl_new_Coefficient (&c);
|
ppl_new_Coefficient (&c);
|
|
|
ppl_Linear_Expression_inhomogeneous_term (e, c);
|
ppl_Linear_Expression_inhomogeneous_term (e, c);
|
ppl_Coefficient_to_mpz_t (c, v1);
|
ppl_Coefficient_to_mpz_t (c, v1);
|
value_oppose (v1, v1);
|
value_oppose (v1, v1);
|
value_assign (v0, x);
|
value_assign (v0, x);
|
value_addto (v0, v0, v1);
|
value_addto (v0, v0, v1);
|
ppl_assign_Coefficient_from_mpz_t (c, v0);
|
ppl_assign_Coefficient_from_mpz_t (c, v0);
|
ppl_Linear_Expression_add_to_inhomogeneous (e, c);
|
ppl_Linear_Expression_add_to_inhomogeneous (e, c);
|
|
|
value_clear (v0);
|
value_clear (v0);
|
value_clear (v1);
|
value_clear (v1);
|
ppl_delete_Coefficient (c);
|
ppl_delete_Coefficient (c);
|
}
|
}
|
|
|
/* Set E[I] to X. */
|
/* Set E[I] to X. */
|
|
|
void
|
void
|
ppl_set_coef_gmp (ppl_Linear_Expression_t e, ppl_dimension_type i, Value x)
|
ppl_set_coef_gmp (ppl_Linear_Expression_t e, ppl_dimension_type i, Value x)
|
{
|
{
|
Value v0, v1;
|
Value v0, v1;
|
ppl_Coefficient_t c;
|
ppl_Coefficient_t c;
|
|
|
value_init (v0);
|
value_init (v0);
|
value_init (v1);
|
value_init (v1);
|
ppl_new_Coefficient (&c);
|
ppl_new_Coefficient (&c);
|
|
|
ppl_Linear_Expression_coefficient (e, i, c);
|
ppl_Linear_Expression_coefficient (e, i, c);
|
ppl_Coefficient_to_mpz_t (c, v1);
|
ppl_Coefficient_to_mpz_t (c, v1);
|
value_oppose (v1, v1);
|
value_oppose (v1, v1);
|
value_assign (v0, x);
|
value_assign (v0, x);
|
value_addto (v0, v0, v1);
|
value_addto (v0, v0, v1);
|
ppl_assign_Coefficient_from_mpz_t (c, v0);
|
ppl_assign_Coefficient_from_mpz_t (c, v0);
|
ppl_Linear_Expression_add_to_coefficient (e, i, c);
|
ppl_Linear_Expression_add_to_coefficient (e, i, c);
|
|
|
value_clear (v0);
|
value_clear (v0);
|
value_clear (v1);
|
value_clear (v1);
|
ppl_delete_Coefficient (c);
|
ppl_delete_Coefficient (c);
|
}
|
}
|
|
|
/* Insert after X NB_NEW_DIMS empty dimensions into PH.
|
/* Insert after X NB_NEW_DIMS empty dimensions into PH.
|
|
|
With x = 3 and nb_new_dims = 4
|
With x = 3 and nb_new_dims = 4
|
|
|
| d0 d1 d2 d3 d4
|
| d0 d1 d2 d3 d4
|
|
|
is transformed to
|
is transformed to
|
|
|
| d0 d1 d2 x0 x1 x2 x3 d3 d4
|
| d0 d1 d2 x0 x1 x2 x3 d3 d4
|
|
|
| map = {0, 1, 2, 7, 8, 3, 4, 5, 6}
|
| map = {0, 1, 2, 7, 8, 3, 4, 5, 6}
|
*/
|
*/
|
|
|
void
|
void
|
ppl_insert_dimensions_pointset (ppl_Pointset_Powerset_C_Polyhedron_t ph, int x,
|
ppl_insert_dimensions_pointset (ppl_Pointset_Powerset_C_Polyhedron_t ph, int x,
|
int nb_new_dims)
|
int nb_new_dims)
|
{
|
{
|
ppl_dimension_type i, dim;
|
ppl_dimension_type i, dim;
|
ppl_dimension_type *map;
|
ppl_dimension_type *map;
|
ppl_dimension_type x_ppl, nb_new_dims_ppl;
|
ppl_dimension_type x_ppl, nb_new_dims_ppl;
|
|
|
x_ppl = (ppl_dimension_type) x;
|
x_ppl = (ppl_dimension_type) x;
|
nb_new_dims_ppl = (ppl_dimension_type) nb_new_dims;
|
nb_new_dims_ppl = (ppl_dimension_type) nb_new_dims;
|
|
|
ppl_Pointset_Powerset_C_Polyhedron_space_dimension (ph, &dim);
|
ppl_Pointset_Powerset_C_Polyhedron_space_dimension (ph, &dim);
|
ppl_Pointset_Powerset_C_Polyhedron_add_space_dimensions_and_embed (ph, nb_new_dims);
|
ppl_Pointset_Powerset_C_Polyhedron_add_space_dimensions_and_embed (ph, nb_new_dims);
|
|
|
map = (ppl_dimension_type *) XNEWVEC (ppl_dimension_type, dim + nb_new_dims);
|
map = (ppl_dimension_type *) XNEWVEC (ppl_dimension_type, dim + nb_new_dims);
|
|
|
for (i = 0; i < x_ppl; i++)
|
for (i = 0; i < x_ppl; i++)
|
map[i] = i;
|
map[i] = i;
|
|
|
for (i = x_ppl; i < x_ppl + nb_new_dims_ppl; i++)
|
for (i = x_ppl; i < x_ppl + nb_new_dims_ppl; i++)
|
map[dim + i - x_ppl] = i;
|
map[dim + i - x_ppl] = i;
|
|
|
for (i = x_ppl + nb_new_dims_ppl; i < dim + nb_new_dims_ppl; i++)
|
for (i = x_ppl + nb_new_dims_ppl; i < dim + nb_new_dims_ppl; i++)
|
map[i - nb_new_dims_ppl] = i;
|
map[i - nb_new_dims_ppl] = i;
|
|
|
ppl_Pointset_Powerset_C_Polyhedron_map_space_dimensions (ph, map, dim + nb_new_dims);
|
ppl_Pointset_Powerset_C_Polyhedron_map_space_dimensions (ph, map, dim + nb_new_dims);
|
free (map);
|
free (map);
|
}
|
}
|
|
|
/* Insert after X NB_NEW_DIMS empty dimensions into PH.
|
/* Insert after X NB_NEW_DIMS empty dimensions into PH.
|
|
|
With x = 3 and nb_new_dims = 4
|
With x = 3 and nb_new_dims = 4
|
|
|
| d0 d1 d2 d3 d4
|
| d0 d1 d2 d3 d4
|
|
|
is transformed to
|
is transformed to
|
|
|
| d0 d1 d2 x0 x1 x2 x3 d3 d4
|
| d0 d1 d2 x0 x1 x2 x3 d3 d4
|
|
|
| map = {0, 1, 2, 7, 8, 3, 4, 5, 6}
|
| map = {0, 1, 2, 7, 8, 3, 4, 5, 6}
|
*/
|
*/
|
|
|
void
|
void
|
ppl_insert_dimensions (ppl_Polyhedron_t ph, int x,
|
ppl_insert_dimensions (ppl_Polyhedron_t ph, int x,
|
int nb_new_dims)
|
int nb_new_dims)
|
{
|
{
|
ppl_dimension_type i, dim;
|
ppl_dimension_type i, dim;
|
ppl_dimension_type *map;
|
ppl_dimension_type *map;
|
ppl_dimension_type x_ppl, nb_new_dims_ppl;
|
ppl_dimension_type x_ppl, nb_new_dims_ppl;
|
|
|
x_ppl = (ppl_dimension_type) x;
|
x_ppl = (ppl_dimension_type) x;
|
nb_new_dims_ppl = (ppl_dimension_type) nb_new_dims;
|
nb_new_dims_ppl = (ppl_dimension_type) nb_new_dims;
|
|
|
ppl_Polyhedron_space_dimension (ph, &dim);
|
ppl_Polyhedron_space_dimension (ph, &dim);
|
ppl_Polyhedron_add_space_dimensions_and_embed (ph, nb_new_dims);
|
ppl_Polyhedron_add_space_dimensions_and_embed (ph, nb_new_dims);
|
|
|
map = (ppl_dimension_type *) XNEWVEC (ppl_dimension_type, dim + nb_new_dims);
|
map = (ppl_dimension_type *) XNEWVEC (ppl_dimension_type, dim + nb_new_dims);
|
|
|
for (i = 0; i < x_ppl; i++)
|
for (i = 0; i < x_ppl; i++)
|
map[i] = i;
|
map[i] = i;
|
|
|
for (i = x_ppl; i < x_ppl + nb_new_dims_ppl; i++)
|
for (i = x_ppl; i < x_ppl + nb_new_dims_ppl; i++)
|
map[dim + i - x_ppl] = i;
|
map[dim + i - x_ppl] = i;
|
|
|
for (i = x_ppl + nb_new_dims_ppl; i < dim + nb_new_dims_ppl; i++)
|
for (i = x_ppl + nb_new_dims_ppl; i < dim + nb_new_dims_ppl; i++)
|
map[i - nb_new_dims_ppl] = i;
|
map[i - nb_new_dims_ppl] = i;
|
|
|
ppl_Polyhedron_map_space_dimensions (ph, map, dim + nb_new_dims);
|
ppl_Polyhedron_map_space_dimensions (ph, map, dim + nb_new_dims);
|
free (map);
|
free (map);
|
}
|
}
|
|
|
/* Based on the original polyhedron PH, returns a new polyhedron with
|
/* Based on the original polyhedron PH, returns a new polyhedron with
|
an extra dimension placed at position LOOP + 1 that slices the
|
an extra dimension placed at position LOOP + 1 that slices the
|
dimension LOOP into strips of size STRIDE. */
|
dimension LOOP into strips of size STRIDE. */
|
|
|
ppl_Polyhedron_t
|
ppl_Polyhedron_t
|
ppl_strip_loop (ppl_Polyhedron_t ph, ppl_dimension_type loop, int stride)
|
ppl_strip_loop (ppl_Polyhedron_t ph, ppl_dimension_type loop, int stride)
|
{
|
{
|
ppl_const_Constraint_System_t pcs;
|
ppl_const_Constraint_System_t pcs;
|
ppl_Constraint_System_const_iterator_t cit, end;
|
ppl_Constraint_System_const_iterator_t cit, end;
|
ppl_const_Constraint_t cstr;
|
ppl_const_Constraint_t cstr;
|
ppl_Linear_Expression_t expr;
|
ppl_Linear_Expression_t expr;
|
int v;
|
int v;
|
ppl_dimension_type dim;
|
ppl_dimension_type dim;
|
ppl_Polyhedron_t res;
|
ppl_Polyhedron_t res;
|
ppl_Coefficient_t c;
|
ppl_Coefficient_t c;
|
Value val;
|
Value val;
|
|
|
value_init (val);
|
value_init (val);
|
ppl_new_Coefficient (&c);
|
ppl_new_Coefficient (&c);
|
|
|
ppl_Polyhedron_space_dimension (ph, &dim);
|
ppl_Polyhedron_space_dimension (ph, &dim);
|
ppl_Polyhedron_get_constraints (ph, &pcs);
|
ppl_Polyhedron_get_constraints (ph, &pcs);
|
|
|
/* Start from a copy of the constraints. */
|
/* Start from a copy of the constraints. */
|
ppl_new_C_Polyhedron_from_space_dimension (&res, dim + 1, 0);
|
ppl_new_C_Polyhedron_from_space_dimension (&res, dim + 1, 0);
|
ppl_Polyhedron_add_constraints (res, pcs);
|
ppl_Polyhedron_add_constraints (res, pcs);
|
|
|
/* Add an empty dimension for the strip loop. */
|
/* Add an empty dimension for the strip loop. */
|
ppl_insert_dimensions (res, loop, 1);
|
ppl_insert_dimensions (res, loop, 1);
|
|
|
/* Identify the constraints that define the lower and upper bounds
|
/* Identify the constraints that define the lower and upper bounds
|
of the strip-mined loop, and add them to the strip loop. */
|
of the strip-mined loop, and add them to the strip loop. */
|
{
|
{
|
ppl_Polyhedron_t tmp;
|
ppl_Polyhedron_t tmp;
|
|
|
ppl_new_C_Polyhedron_from_space_dimension (&tmp, dim + 1, 0);
|
ppl_new_C_Polyhedron_from_space_dimension (&tmp, dim + 1, 0);
|
ppl_new_Constraint_System_const_iterator (&cit);
|
ppl_new_Constraint_System_const_iterator (&cit);
|
ppl_new_Constraint_System_const_iterator (&end);
|
ppl_new_Constraint_System_const_iterator (&end);
|
|
|
for (ppl_Constraint_System_begin (pcs, cit),
|
for (ppl_Constraint_System_begin (pcs, cit),
|
ppl_Constraint_System_end (pcs, end);
|
ppl_Constraint_System_end (pcs, end);
|
!ppl_Constraint_System_const_iterator_equal_test (cit, end);
|
!ppl_Constraint_System_const_iterator_equal_test (cit, end);
|
ppl_Constraint_System_const_iterator_increment (cit))
|
ppl_Constraint_System_const_iterator_increment (cit))
|
{
|
{
|
ppl_Constraint_System_const_iterator_dereference (cit, &cstr);
|
ppl_Constraint_System_const_iterator_dereference (cit, &cstr);
|
ppl_new_Linear_Expression_from_Constraint (&expr, cstr);
|
ppl_new_Linear_Expression_from_Constraint (&expr, cstr);
|
ppl_Linear_Expression_coefficient (expr, loop, c);
|
ppl_Linear_Expression_coefficient (expr, loop, c);
|
ppl_delete_Linear_Expression (expr);
|
ppl_delete_Linear_Expression (expr);
|
ppl_Coefficient_to_mpz_t (c, val);
|
ppl_Coefficient_to_mpz_t (c, val);
|
v = value_get_si (val);
|
v = value_get_si (val);
|
|
|
if (0 < v || v < 0)
|
if (0 < v || v < 0)
|
ppl_Polyhedron_add_constraint (tmp, cstr);
|
ppl_Polyhedron_add_constraint (tmp, cstr);
|
}
|
}
|
ppl_delete_Constraint_System_const_iterator (cit);
|
ppl_delete_Constraint_System_const_iterator (cit);
|
ppl_delete_Constraint_System_const_iterator (end);
|
ppl_delete_Constraint_System_const_iterator (end);
|
|
|
ppl_insert_dimensions (tmp, loop + 1, 1);
|
ppl_insert_dimensions (tmp, loop + 1, 1);
|
ppl_Polyhedron_get_constraints (tmp, &pcs);
|
ppl_Polyhedron_get_constraints (tmp, &pcs);
|
ppl_Polyhedron_add_constraints (res, pcs);
|
ppl_Polyhedron_add_constraints (res, pcs);
|
ppl_delete_Polyhedron (tmp);
|
ppl_delete_Polyhedron (tmp);
|
}
|
}
|
|
|
/* Lower bound of a tile starts at "stride * outer_iv". */
|
/* Lower bound of a tile starts at "stride * outer_iv". */
|
{
|
{
|
ppl_Constraint_t new_cstr;
|
ppl_Constraint_t new_cstr;
|
ppl_new_Linear_Expression_with_dimension (&expr, dim + 1);
|
ppl_new_Linear_Expression_with_dimension (&expr, dim + 1);
|
|
|
ppl_set_coef (expr, loop + 1, 1);
|
ppl_set_coef (expr, loop + 1, 1);
|
ppl_set_coef (expr, loop, -1 * stride);
|
ppl_set_coef (expr, loop, -1 * stride);
|
|
|
ppl_new_Constraint (&new_cstr, expr, PPL_CONSTRAINT_TYPE_GREATER_OR_EQUAL);
|
ppl_new_Constraint (&new_cstr, expr, PPL_CONSTRAINT_TYPE_GREATER_OR_EQUAL);
|
ppl_delete_Linear_Expression (expr);
|
ppl_delete_Linear_Expression (expr);
|
ppl_Polyhedron_add_constraint (res, new_cstr);
|
ppl_Polyhedron_add_constraint (res, new_cstr);
|
ppl_delete_Constraint (new_cstr);
|
ppl_delete_Constraint (new_cstr);
|
}
|
}
|
|
|
/* Upper bound of a tile stops at "stride * outer_iv + stride - 1",
|
/* Upper bound of a tile stops at "stride * outer_iv + stride - 1",
|
or at the old upper bound that is not modified. */
|
or at the old upper bound that is not modified. */
|
{
|
{
|
ppl_Constraint_t new_cstr;
|
ppl_Constraint_t new_cstr;
|
ppl_new_Linear_Expression_with_dimension (&expr, dim + 1);
|
ppl_new_Linear_Expression_with_dimension (&expr, dim + 1);
|
|
|
ppl_set_coef (expr, loop + 1, -1);
|
ppl_set_coef (expr, loop + 1, -1);
|
ppl_set_coef (expr, loop, stride);
|
ppl_set_coef (expr, loop, stride);
|
ppl_set_inhomogeneous (expr, stride - 1);
|
ppl_set_inhomogeneous (expr, stride - 1);
|
|
|
ppl_new_Constraint (&new_cstr, expr, PPL_CONSTRAINT_TYPE_GREATER_OR_EQUAL);
|
ppl_new_Constraint (&new_cstr, expr, PPL_CONSTRAINT_TYPE_GREATER_OR_EQUAL);
|
ppl_delete_Linear_Expression (expr);
|
ppl_delete_Linear_Expression (expr);
|
ppl_Polyhedron_add_constraint (res, new_cstr);
|
ppl_Polyhedron_add_constraint (res, new_cstr);
|
ppl_delete_Constraint (new_cstr);
|
ppl_delete_Constraint (new_cstr);
|
}
|
}
|
|
|
value_clear (val);
|
value_clear (val);
|
ppl_delete_Coefficient (c);
|
ppl_delete_Coefficient (c);
|
return res;
|
return res;
|
}
|
}
|
|
|
/* Lexicographically compares two linear expressions A and B and
|
/* Lexicographically compares two linear expressions A and B and
|
returns negative when A < B, 0 when A == B and positive when A > B. */
|
returns negative when A < B, 0 when A == B and positive when A > B. */
|
|
|
int
|
int
|
ppl_lexico_compare_linear_expressions (ppl_Linear_Expression_t a,
|
ppl_lexico_compare_linear_expressions (ppl_Linear_Expression_t a,
|
ppl_Linear_Expression_t b)
|
ppl_Linear_Expression_t b)
|
{
|
{
|
ppl_dimension_type min_length, length1, length2;
|
ppl_dimension_type min_length, length1, length2;
|
ppl_dimension_type i;
|
ppl_dimension_type i;
|
ppl_Coefficient_t c;
|
ppl_Coefficient_t c;
|
int res;
|
int res;
|
Value va, vb;
|
Value va, vb;
|
|
|
ppl_Linear_Expression_space_dimension (a, &length1);
|
ppl_Linear_Expression_space_dimension (a, &length1);
|
ppl_Linear_Expression_space_dimension (b, &length2);
|
ppl_Linear_Expression_space_dimension (b, &length2);
|
ppl_new_Coefficient (&c);
|
ppl_new_Coefficient (&c);
|
value_init (va);
|
value_init (va);
|
value_init (vb);
|
value_init (vb);
|
|
|
if (length1 < length2)
|
if (length1 < length2)
|
min_length = length1;
|
min_length = length1;
|
else
|
else
|
min_length = length2;
|
min_length = length2;
|
|
|
for (i = 0; i < min_length; i++)
|
for (i = 0; i < min_length; i++)
|
{
|
{
|
ppl_Linear_Expression_coefficient (a, i, c);
|
ppl_Linear_Expression_coefficient (a, i, c);
|
ppl_Coefficient_to_mpz_t (c, va);
|
ppl_Coefficient_to_mpz_t (c, va);
|
ppl_Linear_Expression_coefficient (b, i, c);
|
ppl_Linear_Expression_coefficient (b, i, c);
|
ppl_Coefficient_to_mpz_t (c, vb);
|
ppl_Coefficient_to_mpz_t (c, vb);
|
res = value_compare (va, vb);
|
res = value_compare (va, vb);
|
|
|
if (res == 0)
|
if (res == 0)
|
continue;
|
continue;
|
|
|
value_clear (va);
|
value_clear (va);
|
value_clear (vb);
|
value_clear (vb);
|
ppl_delete_Coefficient (c);
|
ppl_delete_Coefficient (c);
|
return res;
|
return res;
|
}
|
}
|
|
|
value_clear (va);
|
value_clear (va);
|
value_clear (vb);
|
value_clear (vb);
|
ppl_delete_Coefficient (c);
|
ppl_delete_Coefficient (c);
|
return length1 - length2;
|
return length1 - length2;
|
}
|
}
|
|
|
/* Print to FILE the polyhedron PH under its PolyLib matrix form. */
|
/* Print to FILE the polyhedron PH under its PolyLib matrix form. */
|
|
|
void
|
void
|
ppl_print_polyhedron_matrix (FILE *file, ppl_const_Polyhedron_t ph)
|
ppl_print_polyhedron_matrix (FILE *file, ppl_const_Polyhedron_t ph)
|
{
|
{
|
CloogMatrix *mat = new_Cloog_Matrix_from_ppl_Polyhedron (ph);
|
CloogMatrix *mat = new_Cloog_Matrix_from_ppl_Polyhedron (ph);
|
cloog_matrix_print (file, mat);
|
cloog_matrix_print (file, mat);
|
cloog_matrix_free (mat);
|
cloog_matrix_free (mat);
|
}
|
}
|
|
|
/* Print to FILE the linear expression LE. */
|
/* Print to FILE the linear expression LE. */
|
|
|
void
|
void
|
ppl_print_linear_expr (FILE *file, ppl_Linear_Expression_t le)
|
ppl_print_linear_expr (FILE *file, ppl_Linear_Expression_t le)
|
{
|
{
|
ppl_Constraint_t c;
|
ppl_Constraint_t c;
|
ppl_Polyhedron_t pol;
|
ppl_Polyhedron_t pol;
|
ppl_dimension_type dim;
|
ppl_dimension_type dim;
|
|
|
ppl_Linear_Expression_space_dimension (le, &dim);
|
ppl_Linear_Expression_space_dimension (le, &dim);
|
ppl_new_C_Polyhedron_from_space_dimension (&pol, dim, 0);
|
ppl_new_C_Polyhedron_from_space_dimension (&pol, dim, 0);
|
ppl_new_Constraint (&c, le, PPL_CONSTRAINT_TYPE_EQUAL);
|
ppl_new_Constraint (&c, le, PPL_CONSTRAINT_TYPE_EQUAL);
|
ppl_Polyhedron_add_constraint (pol, c);
|
ppl_Polyhedron_add_constraint (pol, c);
|
ppl_print_polyhedron_matrix (file, pol);
|
ppl_print_polyhedron_matrix (file, pol);
|
}
|
}
|
|
|
/* Print to STDERR the linear expression LE. */
|
/* Print to STDERR the linear expression LE. */
|
|
|
void
|
void
|
debug_ppl_linear_expr (ppl_Linear_Expression_t le)
|
debug_ppl_linear_expr (ppl_Linear_Expression_t le)
|
{
|
{
|
ppl_print_linear_expr (stderr, le);
|
ppl_print_linear_expr (stderr, le);
|
}
|
}
|
|
|
/* Print to FILE the powerset PS in its PolyLib matrix form. */
|
/* Print to FILE the powerset PS in its PolyLib matrix form. */
|
|
|
void
|
void
|
ppl_print_powerset_matrix (FILE *file,
|
ppl_print_powerset_matrix (FILE *file,
|
ppl_Pointset_Powerset_C_Polyhedron_t ps)
|
ppl_Pointset_Powerset_C_Polyhedron_t ps)
|
{
|
{
|
size_t nb_disjuncts;
|
size_t nb_disjuncts;
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_t it, end;
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_t it, end;
|
|
|
ppl_new_Pointset_Powerset_C_Polyhedron_iterator (&it);
|
ppl_new_Pointset_Powerset_C_Polyhedron_iterator (&it);
|
ppl_new_Pointset_Powerset_C_Polyhedron_iterator (&end);
|
ppl_new_Pointset_Powerset_C_Polyhedron_iterator (&end);
|
|
|
ppl_Pointset_Powerset_C_Polyhedron_size (ps, &nb_disjuncts);
|
ppl_Pointset_Powerset_C_Polyhedron_size (ps, &nb_disjuncts);
|
fprintf (file, "%d\n", (int) nb_disjuncts);
|
fprintf (file, "%d\n", (int) nb_disjuncts);
|
|
|
for (ppl_Pointset_Powerset_C_Polyhedron_iterator_begin (ps, it),
|
for (ppl_Pointset_Powerset_C_Polyhedron_iterator_begin (ps, it),
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_end (ps, end);
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_end (ps, end);
|
!ppl_Pointset_Powerset_C_Polyhedron_iterator_equal_test (it, end);
|
!ppl_Pointset_Powerset_C_Polyhedron_iterator_equal_test (it, end);
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_increment (it))
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_increment (it))
|
{
|
{
|
ppl_const_Polyhedron_t ph;
|
ppl_const_Polyhedron_t ph;
|
|
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_dereference (it, &ph);
|
ppl_Pointset_Powerset_C_Polyhedron_iterator_dereference (it, &ph);
|
ppl_print_polyhedron_matrix (file, ph);
|
ppl_print_polyhedron_matrix (file, ph);
|
}
|
}
|
|
|
ppl_delete_Pointset_Powerset_C_Polyhedron_iterator (it);
|
ppl_delete_Pointset_Powerset_C_Polyhedron_iterator (it);
|
ppl_delete_Pointset_Powerset_C_Polyhedron_iterator (end);
|
ppl_delete_Pointset_Powerset_C_Polyhedron_iterator (end);
|
}
|
}
|
|
|
/* Print to STDERR the polyhedron PH under its PolyLib matrix form. */
|
/* Print to STDERR the polyhedron PH under its PolyLib matrix form. */
|
|
|
void
|
void
|
debug_ppl_polyhedron_matrix (ppl_Polyhedron_t ph)
|
debug_ppl_polyhedron_matrix (ppl_Polyhedron_t ph)
|
{
|
{
|
ppl_print_polyhedron_matrix (stderr, ph);
|
ppl_print_polyhedron_matrix (stderr, ph);
|
}
|
}
|
|
|
/* Print to STDERR the powerset PS in its PolyLib matrix form. */
|
/* Print to STDERR the powerset PS in its PolyLib matrix form. */
|
|
|
void
|
void
|
debug_ppl_powerset_matrix (ppl_Pointset_Powerset_C_Polyhedron_t ps)
|
debug_ppl_powerset_matrix (ppl_Pointset_Powerset_C_Polyhedron_t ps)
|
{
|
{
|
ppl_print_powerset_matrix (stderr, ps);
|
ppl_print_powerset_matrix (stderr, ps);
|
}
|
}
|
|
|
/* Read from FILE a polyhedron under PolyLib matrix form and return a
|
/* Read from FILE a polyhedron under PolyLib matrix form and return a
|
PPL polyhedron object. */
|
PPL polyhedron object. */
|
|
|
void
|
void
|
ppl_read_polyhedron_matrix (ppl_Polyhedron_t *ph, FILE *file)
|
ppl_read_polyhedron_matrix (ppl_Polyhedron_t *ph, FILE *file)
|
{
|
{
|
CloogMatrix *mat = cloog_matrix_read (file);
|
CloogMatrix *mat = cloog_matrix_read (file);
|
new_C_Polyhedron_from_Cloog_Matrix (ph, mat);
|
new_C_Polyhedron_from_Cloog_Matrix (ph, mat);
|
cloog_matrix_free (mat);
|
cloog_matrix_free (mat);
|
}
|
}
|
|
|
/* Return in RES the maximum of the linear expression LE on the
|
/* Return in RES the maximum of the linear expression LE on the
|
pointset powerset of polyhedra PS. */
|
pointset powerset of polyhedra PS. */
|
|
|
void
|
void
|
ppl_max_for_le_pointset (ppl_Pointset_Powerset_C_Polyhedron_t ps,
|
ppl_max_for_le_pointset (ppl_Pointset_Powerset_C_Polyhedron_t ps,
|
ppl_Linear_Expression_t le, Value res)
|
ppl_Linear_Expression_t le, Value res)
|
{
|
{
|
ppl_Coefficient_t num, denom;
|
ppl_Coefficient_t num, denom;
|
Value dv, nv;
|
Value dv, nv;
|
int maximum, err;
|
int maximum, err;
|
|
|
value_init (nv);
|
value_init (nv);
|
value_init (dv);
|
value_init (dv);
|
ppl_new_Coefficient (&num);
|
ppl_new_Coefficient (&num);
|
ppl_new_Coefficient (&denom);
|
ppl_new_Coefficient (&denom);
|
err = ppl_Pointset_Powerset_C_Polyhedron_maximize (ps, le, num, denom, &maximum);
|
err = ppl_Pointset_Powerset_C_Polyhedron_maximize (ps, le, num, denom, &maximum);
|
|
|
if (err > 0)
|
if (err > 0)
|
{
|
{
|
ppl_Coefficient_to_mpz_t (num, nv);
|
ppl_Coefficient_to_mpz_t (num, nv);
|
ppl_Coefficient_to_mpz_t (denom, dv);
|
ppl_Coefficient_to_mpz_t (denom, dv);
|
gcc_assert (value_notzero_p (dv));
|
gcc_assert (value_notzero_p (dv));
|
value_division (res, nv, dv);
|
value_division (res, nv, dv);
|
}
|
}
|
|
|
value_clear (nv);
|
value_clear (nv);
|
value_clear (dv);
|
value_clear (dv);
|
ppl_delete_Coefficient (num);
|
ppl_delete_Coefficient (num);
|
ppl_delete_Coefficient (denom);
|
ppl_delete_Coefficient (denom);
|
}
|
}
|
|
|
/* Return in RES the maximum of the linear expression LE on the
|
/* Return in RES the maximum of the linear expression LE on the
|
polyhedron POL. */
|
polyhedron POL. */
|
|
|
void
|
void
|
ppl_min_for_le_pointset (ppl_Pointset_Powerset_C_Polyhedron_t ps,
|
ppl_min_for_le_pointset (ppl_Pointset_Powerset_C_Polyhedron_t ps,
|
ppl_Linear_Expression_t le, Value res)
|
ppl_Linear_Expression_t le, Value res)
|
{
|
{
|
ppl_Coefficient_t num, denom;
|
ppl_Coefficient_t num, denom;
|
Value dv, nv;
|
Value dv, nv;
|
int minimum, err;
|
int minimum, err;
|
|
|
value_init (nv);
|
value_init (nv);
|
value_init (dv);
|
value_init (dv);
|
ppl_new_Coefficient (&num);
|
ppl_new_Coefficient (&num);
|
ppl_new_Coefficient (&denom);
|
ppl_new_Coefficient (&denom);
|
err = ppl_Pointset_Powerset_C_Polyhedron_minimize (ps, le, num, denom, &minimum);
|
err = ppl_Pointset_Powerset_C_Polyhedron_minimize (ps, le, num, denom, &minimum);
|
|
|
if (err > 0)
|
if (err > 0)
|
{
|
{
|
ppl_Coefficient_to_mpz_t (num, nv);
|
ppl_Coefficient_to_mpz_t (num, nv);
|
ppl_Coefficient_to_mpz_t (denom, dv);
|
ppl_Coefficient_to_mpz_t (denom, dv);
|
gcc_assert (value_notzero_p (dv));
|
gcc_assert (value_notzero_p (dv));
|
value_division (res, nv, dv);
|
value_division (res, nv, dv);
|
}
|
}
|
|
|
value_clear (nv);
|
value_clear (nv);
|
value_clear (dv);
|
value_clear (dv);
|
ppl_delete_Coefficient (num);
|
ppl_delete_Coefficient (num);
|
ppl_delete_Coefficient (denom);
|
ppl_delete_Coefficient (denom);
|
}
|
}
|
|
|
/* Builds a constraint in dimension DIM relating dimensions POS1 to
|
/* Builds a constraint in dimension DIM relating dimensions POS1 to
|
POS2 as "POS1 - POS2 + C CSTR_TYPE 0" */
|
POS2 as "POS1 - POS2 + C CSTR_TYPE 0" */
|
|
|
ppl_Constraint_t
|
ppl_Constraint_t
|
ppl_build_relation (int dim, int pos1, int pos2, int c,
|
ppl_build_relation (int dim, int pos1, int pos2, int c,
|
enum ppl_enum_Constraint_Type cstr_type)
|
enum ppl_enum_Constraint_Type cstr_type)
|
{
|
{
|
ppl_Linear_Expression_t expr;
|
ppl_Linear_Expression_t expr;
|
ppl_Constraint_t cstr;
|
ppl_Constraint_t cstr;
|
ppl_Coefficient_t coef;
|
ppl_Coefficient_t coef;
|
Value v, v_op, v_c;
|
Value v, v_op, v_c;
|
|
|
value_init (v);
|
value_init (v);
|
value_init (v_op);
|
value_init (v_op);
|
value_init (v_c);
|
value_init (v_c);
|
|
|
value_set_si (v, 1);
|
value_set_si (v, 1);
|
value_set_si (v_op, -1);
|
value_set_si (v_op, -1);
|
value_set_si (v_c, c);
|
value_set_si (v_c, c);
|
|
|
ppl_new_Coefficient (&coef);
|
ppl_new_Coefficient (&coef);
|
ppl_new_Linear_Expression_with_dimension (&expr, dim);
|
ppl_new_Linear_Expression_with_dimension (&expr, dim);
|
|
|
ppl_assign_Coefficient_from_mpz_t (coef, v);
|
ppl_assign_Coefficient_from_mpz_t (coef, v);
|
ppl_Linear_Expression_add_to_coefficient (expr, pos1, coef);
|
ppl_Linear_Expression_add_to_coefficient (expr, pos1, coef);
|
ppl_assign_Coefficient_from_mpz_t (coef, v_op);
|
ppl_assign_Coefficient_from_mpz_t (coef, v_op);
|
ppl_Linear_Expression_add_to_coefficient (expr, pos2, coef);
|
ppl_Linear_Expression_add_to_coefficient (expr, pos2, coef);
|
ppl_assign_Coefficient_from_mpz_t (coef, v_c);
|
ppl_assign_Coefficient_from_mpz_t (coef, v_c);
|
ppl_Linear_Expression_add_to_inhomogeneous (expr, coef);
|
ppl_Linear_Expression_add_to_inhomogeneous (expr, coef);
|
|
|
ppl_new_Constraint (&cstr, expr, cstr_type);
|
ppl_new_Constraint (&cstr, expr, cstr_type);
|
|
|
ppl_delete_Linear_Expression (expr);
|
ppl_delete_Linear_Expression (expr);
|
ppl_delete_Coefficient (coef);
|
ppl_delete_Coefficient (coef);
|
value_clear (v);
|
value_clear (v);
|
value_clear (v_op);
|
value_clear (v_op);
|
value_clear (v_c);
|
value_clear (v_c);
|
|
|
return cstr;
|
return cstr;
|
}
|
}
|
|
|
#endif
|
#endif
|
|
|
