basis_reduction.c

   1 #include <assert.h>
   2 #include <isl_set_polylib.h>
   3 #include <barvinok/basis_reduction.h>
   4 #include <barvinok/options.h>
   5 #include "config.h"
   6
   7 #ifndef HAVE_LIBGLPK
   8 Matrix *glpk_Polyhedron_Reduced_Basis(Polyhedron *P,
   9                                      struct barvinok_options *options)
  10 {
  11     assert(0);
  12 }
  13 #endif
  14
  15 #ifndef HAVE_LIBCDDGMP
  16 Matrix *cdd_Polyhedron_Reduced_Basis(Polyhedron *P,
  17                                      struct barvinok_options *options)
  18 {
  19     assert(0);
  20 }
  21 #endif
  22
  23 #ifndef HAVE_PIPLIB
  24 Matrix *pip_Polyhedron_Reduced_Basis(Polyhedron *P,
  25                                      struct barvinok_options *options)
  26 {
  27     assert(0);
  28 }
  29 Matrix *pip_dual_Polyhedron_Reduced_Basis(Polyhedron *P,
  30                                      struct barvinok_options *options)
  31 {
  32     assert(0);
  33 }
  34 #endif
  35
  36 Matrix *isl_Polyhedron_Reduced_Basis(Polyhedron *P,
  37                                      struct barvinok_options *options)
  38 {
  39         int i, j;
  40         isl_int v;
  41         isl_ctx *ctx;
  42         isl_dim *dim;
  43         int nvar = P->Dimension;
  44         isl_basic_set *bset;
  45         isl_mat *basis;
  46         Matrix *M;
  47         int isl_gbr_only_first = options->isl->gbr_only_first;
  48
  49         options->isl->gbr_only_first = options->gbr_only_first;
  50         ctx = isl_ctx_alloc_with_options(barvinok_options_arg, options);
  51         assert(ctx);
  52
  53         dim = isl_dim_set_alloc(ctx, 0, nvar);
  54         bset = isl_basic_set_new_from_polylib(P, dim);
  55
  56         basis = isl_basic_set_reduced_basis(bset);
  57         isl_basic_set_free(bset);
  58
  59         M = Matrix_Alloc(nvar, nvar);
  60
  61         isl_int_init(v);
  62         for (i = 0; i < nvar; ++i)
  63                 for (j = 0; j < nvar; ++j) {
  64                         isl_mat_get_element(basis, 1 + i, 1 + j, &v);
  65                         isl_int_get_gmp(v, M->p[i][j]);
  66                 }
  67         isl_int_clear(v);
  68
  69         isl_mat_free(basis);
  70
  71         isl_ctx_free(ctx);
  72
  73         options->isl->gbr_only_first = isl_gbr_only_first;
  74
  75         return M;
  76 }
  77
  78 Matrix *Polyhedron_Reduced_Basis(Polyhedron *P, struct barvinok_options *options)
  79 {
  80     if (options->gbr_lp_solver == BV_GBR_GLPK)
  81         return glpk_Polyhedron_Reduced_Basis(P, options);
  82     else if (options->gbr_lp_solver == BV_GBR_CDD)
  83         return cdd_Polyhedron_Reduced_Basis(P, options);
  84     else if (options->gbr_lp_solver == BV_GBR_PIP)
  85         return pip_Polyhedron_Reduced_Basis(P, options);
  86     else if (options->gbr_lp_solver == BV_GBR_PIP_DUAL)
  87         return pip_dual_Polyhedron_Reduced_Basis(P, options);
  88     else if (options->gbr_lp_solver == BV_GBR_ISL)
  89         return isl_Polyhedron_Reduced_Basis(P, options);
  90     else
  91         assert(0);
  92 }