conversion.cc

   1 #include <assert.h>
   2 #include <gmp.h>
   3 #include <NTL/mat_ZZ.h>
   4 #include <barvinok/util.h>
   5 #include "conversion.h"
   6
   7 #define SIZE(p) (((long *) (p))[1])
   8 #define DATA(p) ((mp_limb_t *) (((long *) (p)) + 2))
   9
  10 void value2zz(Value v, ZZ& z)
  11 {
  12     int sa = v[0]._mp_size;
  13     int abs_sa = sa < 0 ? -sa : sa;
  14
  15     _ntl_gsetlength(&z.rep, abs_sa);
  16     mp_limb_t * adata = DATA(z.rep);
  17     for (int i = 0; i < abs_sa; ++i)
  18         adata[i] = v[0]._mp_d[i];
  19     SIZE(z.rep) = sa;
  20 }
  21
  22 void zz2value(const ZZ& z, Value& v)
  23 {
  24     if (!z.rep) {
  25         value_set_si(v, 0);
  26         return;
  27     }
  28
  29     int sa = SIZE(z.rep);
  30     int abs_sa = sa < 0 ? -sa : sa;
  31
  32     mp_limb_t * adata = DATA(z.rep);
  33     _mpz_realloc(v, abs_sa);
  34     for (int i = 0; i < abs_sa; ++i)
  35         v[0]._mp_d[i] = adata[i];
  36     v[0]._mp_size = sa;
  37 }
  38
  39 void values2zz(Value *p, vec_ZZ& v, int len)
  40 {
  41     v.SetLength(len);
  42
  43     for (int i = 0; i < len; ++i) {
  44         value2zz(p[i], v[i]);
  45     }
  46 }
  47
  48 /*
  49  */
  50 void zz2values(const vec_ZZ& v, Value *p)
  51 {
  52     for (int i = 0; i < v.length(); ++i)
  53         zz2value(v[i], p[i]);
  54 }
  55
  56 /*
  57  * We just ignore the last column and row
  58  * If the final element is not equal to one
  59  * then the result will actually be a multiple of the input
  60  */
  61 void matrix2zz(Matrix *M, mat_ZZ& m, unsigned nr, unsigned nc)
  62 {
  63     m.SetDims(nr, nc);
  64
  65     for (int i = 0; i < nr; ++i) {
  66 //      assert(value_one_p(M->p[i][M->NbColumns - 1]));
  67         for (int j = 0; j < nc; ++j) {
  68             value2zz(M->p[i][j], m[i][j]);
  69         }
  70     }
  71 }
  72
  73 Matrix *rays(Polyhedron *C)
  74 {
  75     unsigned dim = C->NbRays - 1; /* don't count zero vertex */
  76     assert(C->NbRays - 1 == C->Dimension);
  77
  78     Matrix *M = Matrix_Alloc(dim+1, dim+1);
  79     assert(M);
  80
  81     int i, c;
  82     for (i = 0, c = 0; i <= dim && c < dim; ++i)
  83         if (value_zero_p(C->Ray[i][dim+1])) {
  84             Vector_Copy(C->Ray[i] + 1, M->p[c], dim);
  85             value_set_si(M->p[c++][dim], 0);
  86         }
  87     assert(c == dim);
  88     value_set_si(M->p[dim][dim], 1);
  89
  90     return M;
  91 }
  92
  93 Matrix *rays2(Polyhedron *C)
  94 {
  95     unsigned dim = C->NbRays - 1; /* don't count zero vertex */
  96     assert(C->NbRays - 1 == C->Dimension);
  97
  98     Matrix *M = Matrix_Alloc(dim, dim);
  99     assert(M);
 100
 101     int i, c;
 102     for (i = 0, c = 0; i <= dim && c < dim; ++i)
 103         if (value_zero_p(C->Ray[i][dim+1]))
 104             Vector_Copy(C->Ray[i] + 1, M->p[c++], dim);
 105     assert(c == dim);
 106
 107     return M;
 108 }
 109
 110 void randomvector(Polyhedron *P, vec_ZZ& lambda, int nvar)
 111 {
 112     Value tmp;
 113     int max = 10 * 16;
 114     unsigned int dim = P->Dimension;
 115     value_init(tmp);
 116
 117     for (int i = 0; i < P->NbRays; ++i) {
 118         for (int j = 1; j <= dim; ++j) {
 119             value_absolute(tmp, P->Ray[i][j]);
 120             int t = VALUE_TO_LONG(tmp) * 16;
 121             if (t > max)
 122                 max = t;
 123         }
 124     }
 125     for (int i = 0; i < P->NbConstraints; ++i) {
 126         for (int j = 1; j <= dim; ++j) {
 127             value_absolute(tmp, P->Constraint[i][j]);
 128             int t = VALUE_TO_LONG(tmp) * 16;
 129             if (t > max)
 130                 max = t;
 131         }
 132     }
 133     value_clear(tmp);
 134
 135     lambda.SetLength(nvar);
 136     for (int k = 0; k < nvar; ++k) {
 137         int r = random_int(max*dim)+2;
 138         int v = (2*(r%2)-1) * (max/2*dim + (r >> 1));
 139         lambda[k] = v;
 140     }
 141 }