bfcounter.cc

   1 #include <vector>
   2 #include "bfcounter.h"
   3 #include "lattice_point.h"
   4
   5 using std::vector;
   6 using std::cerr;
   7 using std::endl;
   8
   9 static int lex_cmp(vec_ZZ& a, vec_ZZ& b)
  10 {
  11     assert(a.length() == b.length());
  12
  13     for (int j = 0; j < a.length(); ++j)
  14         if (a[j] != b[j])
  15             return a[j] < b[j] ? -1 : 1;
  16     return 0;
  17 }
  18
  19 void bf_base::add_term(bfc_term_base *t, vec_ZZ& num_orig, vec_ZZ& extra_num)
  20 {
  21     vec_ZZ num;
  22     int d = num_orig.length();
  23     num.SetLength(d-1);
  24     for (int l = 0; l < d-1; ++l)
  25         num[l] = num_orig[l+1] + extra_num[l];
  26
  27     add_term(t, num);
  28 }
  29
  30 void bf_base::add_term(bfc_term_base *t, vec_ZZ& num)
  31 {
  32     int len = t->terms.NumRows();
  33     int i, r;
  34     for (i = 0; i < len; ++i) {
  35         r = lex_cmp(t->terms[i], num);
  36         if (r >= 0)
  37             break;
  38     }
  39     if (i == len || r > 0) {
  40         t->terms.SetDims(len+1, num.length());
  41         insert_term(t, i);
  42         t->terms[i] = num;
  43     } else {
  44         // i < len && r == 0
  45         update_term(t, i);
  46     }
  47 }
  48
  49 bfc_term_base* bf_base::find_bfc_term(bfc_vec& v, int *powers, int len)
  50 {
  51     bfc_vec::iterator i;
  52     for (i = v.begin(); i != v.end(); ++i) {
  53         int j;
  54         for (j = 0; j < len; ++j)
  55             if ((*i)->powers[j] != powers[j])
  56                 break;
  57         if (j == len)
  58             return (*i);
  59         if ((*i)->powers[j] > powers[j])
  60             break;
  61     }
  62
  63     bfc_term_base* t = new_bf_term(len);
  64     v.insert(i, t);
  65     memcpy(t->powers, powers, len * sizeof(int));
  66
  67     return t;
  68 }
  69
  70 void bf_base::reduce(mat_ZZ& factors, bfc_vec& v, barvinok_options *options)
  71 {
  72     assert(v.size() > 0);
  73     unsigned nf = factors.NumRows();
  74     unsigned d = factors.NumCols();
  75
  76     if (d == lower)
  77         return base(factors, v);
  78
  79     bf_reducer bfr(factors, v, this);
  80
  81     bfr.reduce(options);
  82
  83     if (bfr.vn.size() > 0)
  84         reduce(bfr.nfactors, bfr.vn, options);
  85 }
  86
  87 int bf_base::setup_factors(const mat_ZZ& rays, mat_ZZ& factors,
  88                                     bfc_term_base* t, int s)
  89 {
  90     factors.SetDims(dim, dim);
  91
  92     int r;
  93
  94     for (r = 0; r < dim; ++r)
  95         t->powers[r] = 1;
  96
  97     for (r = 0; r < dim; ++r) {
  98         factors[r] = rays[r];
  99         int k;
 100         for (k = 0; k < dim; ++k)
 101             if (factors[r][k] != 0)
 102                 break;
 103         if (factors[r][k] < 0) {
 104             factors[r] = -factors[r];
 105             for (int i = 0; i < t->terms.NumRows(); ++i)
 106                 t->terms[i] += factors[r];
 107             s = -s;
 108         }
 109     }
 110
 111     return s;
 112 }
 113
 114 void bf_base::handle(const mat_ZZ& rays, Value *vertex, const QQ& c,
 115                      unsigned long det, barvinok_options *options)
 116 {
 117     bfc_term* t = new bfc_term(dim);
 118     vector< bfc_term_base * > v;
 119     v.push_back(t);
 120
 121     Matrix *points = Matrix_Alloc(det, dim);
 122     Matrix* Rays = zz2matrix(rays);
 123     lattice_points_fixed(vertex, vertex, Rays, Rays, points, det);
 124     Matrix_Free(Rays);
 125     matrix2zz(points, t->terms, points->NbRows, points->NbColumns);
 126     Matrix_Free(points);
 127
 128     // the elements of factors are always lexpositive
 129     mat_ZZ   factors;
 130     int s = setup_factors(rays, factors, t, 1);
 131
 132     t->c.SetLength(t->terms.NumRows());
 133
 134     for (int i = 0; i < t->c.length(); ++i) {
 135         t->c[i].n = s * c.n;
 136         t->c[i].d = c.d;
 137     }
 138
 139     reduce(factors, v, options);
 140 }
 141
 142 bfc_term_base* bfcounter_base::new_bf_term(int len)
 143 {
 144     bfc_term* t = new bfc_term(len);
 145     t->c.SetLength(0);
 146     return t;
 147 }
 148
 149 void bfcounter_base::set_factor(bfc_term_base *t, int k, int change)
 150 {
 151     bfc_term* bfct = static_cast<bfc_term *>(t);
 152     c = bfct->c[k];
 153     if (change)
 154         c.n = -c.n;
 155 }
 156
 157 void bfcounter_base::set_factor(bfc_term_base *t, int k, mpq_t &f, int change)
 158 {
 159     bfc_term* bfct = static_cast<bfc_term *>(t);
 160     value2zz(mpq_numref(f), c.n);
 161     value2zz(mpq_denref(f), c.d);
 162     c *= bfct->c[k];
 163     if (change)
 164         c.n = -c.n;
 165 }
 166
 167 void bfcounter_base::set_factor(bfc_term_base *t, int k, const QQ& c_factor,
 168                                 int change)
 169 {
 170     bfc_term* bfct = static_cast<bfc_term *>(t);
 171     c = bfct->c[k];
 172     c *= c_factor;
 173     if (change)
 174         c.n = -c.n;
 175 }
 176
 177 void bfcounter_base::insert_term(bfc_term_base *t, int i)
 178 {
 179     bfc_term* bfct = static_cast<bfc_term *>(t);
 180     int len = t->terms.NumRows()-1;     // already increased by one
 181
 182     bfct->c.SetLength(len+1);
 183     for (int j = len; j > i; --j) {
 184         bfct->c[j] = bfct->c[j-1];
 185         t->terms[j] = t->terms[j-1];
 186     }
 187     bfct->c[i] = c;
 188 }
 189
 190 void bfcounter_base::update_term(bfc_term_base *t, int i)
 191 {
 192     bfc_term* bfct = static_cast<bfc_term *>(t);
 193
 194     bfct->c[i] += c;
 195 }
 196
 197 void bf_reducer::compute_extra_num(int i)
 198 {
 199     clear(extra_num);
 200     changes = 0;
 201     no_param = 0;           // r from text
 202     only_param = 0;         // k-r-s from text
 203     total_power = 0;        // k from text
 204
 205     for (int j = 0; j < nf; ++j) {
 206         if (v[i]->powers[j] == 0)
 207             continue;
 208
 209         total_power += v[i]->powers[j];
 210         if (factors[j][0] == 0) {
 211             only_param += v[i]->powers[j];
 212             continue;
 213         }
 214
 215         if (old2new[j] == -1)
 216             no_param += v[i]->powers[j];
 217         else
 218             extra_num += -sign[j] * v[i]->powers[j] * nfactors[old2new[j]];
 219         changes += v[i]->powers[j];
 220     }
 221 }
 222
 223 void bf_reducer::update_powers(const std::vector<int>& powers)
 224 {
 225     for (int l = 0; l < nnf; ++l)
 226         npowers[l] = bpowers[l];
 227
 228     l_extra_num = extra_num;
 229     l_changes = changes;
 230
 231     for (int l = 0; l < powers.size(); ++l) {
 232         int n = powers[l];
 233         if (n == 0)
 234             continue;
 235         assert(old2new[l] != -1);
 236
 237         npowers[old2new[l]] += n;
 238         // interpretation of sign has been inverted
 239         // since we inverted the power for specialization
 240         if (sign[l] == 1) {
 241             l_extra_num += n * nfactors[old2new[l]];
 242             l_changes += n;
 243         }
 244     }
 245 }
 246
 247
 248 void bf_reducer::compute_reduced_factors()
 249 {
 250     unsigned nf = factors.NumRows();
 251     unsigned d = factors.NumCols();
 252     nnf = 0;
 253     nfactors.SetDims(nnf, d-1);
 254
 255     for (int i = 0; i < nf; ++i) {
 256         int j;
 257         int s = 1;
 258         for (j = 0; j < nnf; ++j) {
 259             int k;
 260             for (k = 1; k < d; ++k)
 261                 if (factors[i][k] != 0 || nfactors[j][k-1] != 0)
 262                     break;
 263             if (k < d && factors[i][k] == -nfactors[j][k-1])
 264                 s = -1;
 265             for (; k < d; ++k)
 266                 if (factors[i][k] != s * nfactors[j][k-1])
 267                     break;
 268             if (k == d)
 269                 break;
 270         }
 271         old2new[i] = j;
 272         if (j == nnf) {
 273             int k;
 274             for (k = 1; k < d; ++k)
 275                 if (factors[i][k] != 0)
 276                     break;
 277             if (k < d) {
 278                 if (factors[i][k] < 0)
 279                     s = -1;
 280                 nfactors.SetDims(++nnf, d-1);
 281                 for (int k = 1; k < d; ++k)
 282                     nfactors[j][k-1] = s * factors[i][k];
 283             } else
 284                 old2new[i] = -1;
 285         }
 286         sign[i] = s;
 287     }
 288     npowers = new int[nnf];
 289     bpowers = new int[nnf];
 290 }
 291
 292 void bf_reducer::reduce(barvinok_options *options)
 293 {
 294     compute_reduced_factors();
 295
 296     Value tmp;
 297     value_init(tmp);
 298     for (int i = 0; i < v.size(); ++i) {
 299         compute_extra_num(i);
 300
 301         if (no_param == 0) {
 302             vec_ZZ extra_num;
 303             extra_num.SetLength(d-1);
 304             int changes = 0;
 305             int npowers[nnf];
 306             for (int k = 0; k < nnf; ++k)
 307                 npowers[k] = 0;
 308             for (int k = 0; k < nf; ++k) {
 309                 assert(old2new[k] != -1);
 310                 npowers[old2new[k]] += v[i]->powers[k];
 311                 if (sign[k] == -1) {
 312                     extra_num += v[i]->powers[k] * nfactors[old2new[k]];
 313                     changes += v[i]->powers[k];
 314                 }
 315             }
 316
 317             bfc_term_base * t = bf->find_bfc_term(vn, npowers, nnf);
 318             for (int k = 0; k < v[i]->terms.NumRows(); ++k) {
 319                 bf->set_factor(v[i], k, changes % 2);
 320                 bf->add_term(t, v[i]->terms[k], extra_num);
 321             }
 322         } else {
 323             // powers of "constant" part
 324             for (int k = 0; k < nnf; ++k)
 325                 bpowers[k] = 0;
 326             for (int k = 0; k < nf; ++k) {
 327                 if (factors[k][0] != 0)
 328                     continue;
 329                 assert(old2new[k] != -1);
 330                 bpowers[old2new[k]] += v[i]->powers[k];
 331                 if (sign[k] == -1) {
 332                     extra_num += v[i]->powers[k] * nfactors[old2new[k]];
 333                     changes += v[i]->powers[k];
 334                 }
 335             }
 336
 337             int j;
 338             for (j = 0; j < nf; ++j)
 339                 if (old2new[j] == -1 && v[i]->powers[j] > 0)
 340                     break;
 341
 342             zz2value(factors[j][0], tmp);
 343             dpoly D(no_param, tmp, 1);
 344             for (int k = 1; k < v[i]->powers[j]; ++k) {
 345                 dpoly fact(no_param, tmp, 1);
 346                 D *= fact;
 347             }
 348             for ( ; ++j < nf; )
 349                 if (old2new[j] == -1)  {
 350                     zz2value(factors[j][0], tmp);
 351                     for (int k = 0; k < v[i]->powers[j]; ++k) {
 352                         dpoly fact(no_param, tmp, 1);
 353                         D *= fact;
 354                     }
 355                 }
 356
 357             if (no_param + only_param == total_power &&
 358                     bf->constant_vertex(d)) {
 359                 bfc_term_base * t = NULL;
 360                 vec_ZZ num;
 361                 num.SetLength(d-1);
 362                 ZZ cn;
 363                 ZZ cd;
 364                 for (int k = 0; k < v[i]->terms.NumRows(); ++k) {
 365                     zz2value(v[i]->terms[k][0], tmp);
 366                     dpoly n(no_param, tmp);
 367                     mpq_set_si(bf->tcount, 0, 1);
 368                     n.div(D, bf->tcount, 1);
 369
 370                     if (value_zero_p(mpq_numref(bf->tcount)))
 371                         continue;
 372
 373                     if (!t)
 374                          t = bf->find_bfc_term(vn, bpowers, nnf);
 375                     bf->set_factor(v[i], k, bf->tcount, changes % 2);
 376                     bf->add_term(t, v[i]->terms[k], extra_num);
 377                 }
 378             } else {
 379                 for (int j = 0; j < v[i]->terms.NumRows(); ++j) {
 380                     zz2value(v[i]->terms[j][0], tmp);
 381                     dpoly n(no_param, tmp);
 382
 383                     dpoly_r * r = 0;
 384                     if (no_param + only_param == total_power)
 385                         r = new dpoly_r(n, nf);
 386                     else
 387                         for (int k = 0; k < nf; ++k) {
 388                             if (v[i]->powers[k] == 0)
 389                                 continue;
 390                             if (factors[k][0] == 0 || old2new[k] == -1)
 391                                 continue;
 392
 393                             zz2value(factors[k][0], tmp);
 394                             dpoly pd(no_param-1, tmp, 1);
 395
 396                             for (int l = 0; l < v[i]->powers[k]; ++l) {
 397                                 int q;
 398                                 for (q = 0; q < k; ++q)
 399                                     if (old2new[q] == old2new[k] &&
 400                                         sign[q] == sign[k])
 401                                             break;
 402
 403                                 if (r == 0)
 404                                     r = new dpoly_r(n, pd, q, nf);
 405                                 else {
 406                                     dpoly_r *nr = new dpoly_r(r, pd, q, nf);
 407                                     delete r;
 408                                     r = nr;
 409                                 }
 410                             }
 411                         }
 412
 413                     dpoly_r *rc = r->div(D);
 414                     delete r;
 415                     QQ factor;
 416                     factor.d = rc->denom;
 417
 418                     if (bf->constant_vertex(d)) {
 419                         dpoly_r_term_list& final = rc->c[rc->len-1];
 420
 421                         dpoly_r_term_list::iterator k;
 422                         for (k = final.begin(); k != final.end(); ++k) {
 423                             if ((*k)->coeff == 0)
 424                                 continue;
 425
 426                             update_powers((*k)->powers);
 427
 428                             bfc_term_base * t = bf->find_bfc_term(vn, npowers, nnf);
 429                             factor.n = (*k)->coeff;
 430                             bf->set_factor(v[i], j, factor, l_changes % 2);
 431                             bf->add_term(t, v[i]->terms[j], l_extra_num);
 432                         }
 433                     } else
 434                         bf->cum(this, v[i], j, rc, options);
 435
 436                     delete rc;
 437                 }
 438             }
 439         }
 440         delete v[i];
 441     }
 442     value_clear(tmp);
 443 }