?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
evalue.c: extract evalue_split_domains_into_orthants from barvinok.cc
[barvinok.git] / barvinok.cc
blobea002021947182067c7f9d68a8e94c53d89a20fa
1 #include <assert.h>
2 #include <iostream>
3 #include <vector>
4 #include <deque>
5 #include <string>
6 #include <sstream>
7 #include <gmp.h>
8 #include <NTL/mat_ZZ.h>
9 #include <NTL/LLL.h>
10 #include <barvinok/util.h>
11 #include <barvinok/evalue.h>
12 extern "C" {
13 #include "piputil.h"
14 }
15 #include "config.h"
16 #include <barvinok/barvinok.h>
17 #include <barvinok/genfun.h>
18 #include <barvinok/options.h>
19 #include <barvinok/sample.h>
20 #include "conversion.h"
21 #include "decomposer.h"
22 #include "lattice_point.h"
23 #include "reduce_domain.h"
24 #include "genfun_constructor.h"
25 #include "remove_equalities.h"
26
27 #ifndef HAVE_PARAM_POLYHEDRON_SCALE_INTEGER
28 extern "C" void Param_Polyhedron_Scale_Integer(Param_Polyhedron *PP, Polyhedron **P,
29 Value *det, unsigned MaxRays);
30 #endif
31
32 #ifdef NTL_STD_CXX
33 using namespace NTL;
34 #endif
35 using std::cerr;
36 using std::cout;
37 using std::endl;
38 using std::vector;
39 using std::deque;
40 using std::string;
41 using std::ostringstream;
42
43 #define ALLOC(t,p) p = (t*)malloc(sizeof(*p))
44
45 class dpoly_n {
46 public:
47 Matrix *coeff;
48 ~dpoly_n() {
49 Matrix_Free(coeff);
50 }
51 dpoly_n(int d, ZZ& degree_0, ZZ& degree_1, int offset = 0) {
52 Value d0, d1;
53 value_init(d0);
54 value_init(d1);
55 zz2value(degree_0, d0);
56 zz2value(degree_1, d1);
57 coeff = Matrix_Alloc(d+1, d+1+1);
58 value_set_si(coeff->p[0][0], 1);
59 value_set_si(coeff->p[0][d+1], 1);
60 for (int i = 1; i <= d; ++i) {
61 value_multiply(coeff->p[i][0], coeff->p[i-1][0], d0);
62 Vector_Combine(coeff->p[i-1], coeff->p[i-1]+1, coeff->p[i]+1,
63 d1, d0, i);
64 value_set_si(coeff->p[i][d+1], i);
65 value_multiply(coeff->p[i][d+1], coeff->p[i][d+1], coeff->p[i-1][d+1]);
66 value_decrement(d0, d0);
67 }
68 value_clear(d0);
69 value_clear(d1);
70 }
71 void div(dpoly& d, Vector *count, ZZ& sign) {
72 int len = coeff->NbRows;
73 Matrix * c = Matrix_Alloc(coeff->NbRows, coeff->NbColumns);
74 Value tmp;
75 value_init(tmp);
76 for (int i = 0; i < len; ++i) {
77 Vector_Copy(coeff->p[i], c->p[i], len+1);
78 for (int j = 1; j <= i; ++j) {
79 zz2value(d.coeff[j], tmp);
80 value_multiply(tmp, tmp, c->p[i][len]);
81 value_oppose(tmp, tmp);
82 Vector_Combine(c->p[i], c->p[i-j], c->p[i],
83 c->p[i-j][len], tmp, len);
84 value_multiply(c->p[i][len], c->p[i][len], c->p[i-j][len]);
85 }
86 zz2value(d.coeff[0], tmp);
87 value_multiply(c->p[i][len], c->p[i][len], tmp);
88 }
89 if (sign == -1) {
90 value_set_si(tmp, -1);
91 Vector_Scale(c->p[len-1], count->p, tmp, len);
92 value_assign(count->p[len], c->p[len-1][len]);
93 } else
94 Vector_Copy(c->p[len-1], count->p, len+1);
95 Vector_Normalize(count->p, len+1);
96 value_clear(tmp);
97 Matrix_Free(c);
98 }
99 };
100
101 const int MAX_TRY=10;
102 /*
103 * Searches for a vector that is not orthogonal to any
104 * of the rays in rays.
105 */
106 static void nonorthog(mat_ZZ& rays, vec_ZZ& lambda)
107 {
108 int dim = rays.NumCols();
109 bool found = false;
110 lambda.SetLength(dim);
111 if (dim == 0)
112 return;
113
114 for (int i = 2; !found && i <= 50*dim; i+=4) {
115 for (int j = 0; j < MAX_TRY; ++j) {
116 for (int k = 0; k < dim; ++k) {
117 int r = random_int(i)+2;
118 int v = (2*(r%2)-1) * (r >> 1);
119 lambda[k] = v;
120 }
121 int k = 0;
122 for (; k < rays.NumRows(); ++k)
123 if (lambda * rays[k] == 0)
124 break;
125 if (k == rays.NumRows()) {
126 found = true;
127 break;
128 }
129 }
130 }
131 assert(found);
132 }
133
134 static void add_rays(mat_ZZ& rays, Polyhedron *i, int *r, int nvar = -1,
135 bool all = false)
136 {
137 unsigned dim = i->Dimension;
138 if (nvar == -1)
139 nvar = dim;
140 for (int k = 0; k < i->NbRays; ++k) {
141 if (!value_zero_p(i->Ray[k][dim+1]))
142 continue;
143 if (!all && nvar != dim && First_Non_Zero(i->Ray[k]+1, nvar) == -1)
144 continue;
145 values2zz(i->Ray[k]+1, rays[(*r)++], nvar);
146 }
147 }
148
149 static void mask_r(Matrix *f, int nr, Vector *lcm, int p, Vector *val, evalue *ev)
150 {
151 unsigned nparam = lcm->Size;
152
153 if (p == nparam) {
154 Vector * prod = Vector_Alloc(f->NbRows);
155 Matrix_Vector_Product(f, val->p, prod->p);
156 int isint = 1;
157 for (int i = 0; i < nr; ++i) {
158 value_modulus(prod->p[i], prod->p[i], f->p[i][nparam+1]);
159 isint &= value_zero_p(prod->p[i]);
160 }
161 value_set_si(ev->d, 1);
162 value_init(ev->x.n);
163 value_set_si(ev->x.n, isint);
164 Vector_Free(prod);
165 return;
166 }
167
168 Value tmp;
169 value_init(tmp);
170 if (value_one_p(lcm->p[p]))
171 mask_r(f, nr, lcm, p+1, val, ev);
172 else {
173 value_assign(tmp, lcm->p[p]);
174 value_set_si(ev->d, 0);
175 ev->x.p = new_enode(periodic, VALUE_TO_INT(tmp), p+1);
176 do {
177 value_decrement(tmp, tmp);
178 value_assign(val->p[p], tmp);
179 mask_r(f, nr, lcm, p+1, val, &ev->x.p->arr[VALUE_TO_INT(tmp)]);
180 } while (value_pos_p(tmp));
181 }
182 value_clear(tmp);
183 }
184
185 static void mask_fractional(Matrix *f, evalue *factor)
186 {
187 int nr = f->NbRows, nc = f->NbColumns;
188 int n;
189 bool found = false;
190 for (n = 0; n < nr && value_notzero_p(f->p[n][nc-1]); ++n)
191 if (value_notone_p(f->p[n][nc-1]) &&
192 value_notmone_p(f->p[n][nc-1]))
193 found = true;
194 if (!found)
195 return;
196
197 evalue EP;
198 nr = n;
199
200 Value m;
201 value_init(m);
202
203 evalue EV;
204 value_init(EV.d);
205 value_init(EV.x.n);
206 value_set_si(EV.x.n, 1);
207
208 for (n = 0; n < nr; ++n) {
209 value_assign(m, f->p[n][nc-1]);
210 if (value_one_p(m) || value_mone_p(m))
211 continue;
212
213 int j = normal_mod(f->p[n], nc-1, &m);
214 if (j == nc-1) {
215 free_evalue_refs(factor);
216 value_init(factor->d);
217 evalue_set_si(factor, 0, 1);
218 break;
219 }
220 vec_ZZ row;
221 values2zz(f->p[n], row, nc-1);
222 ZZ g;
223 value2zz(m, g);
224 if (j < (nc-1)-1 && row[j] > g/2) {
225 for (int k = j; k < (nc-1); ++k)
226 if (row[k] != 0)
227 row[k] = g - row[k];
228 }
229
230 value_init(EP.d);
231 value_set_si(EP.d, 0);
232 EP.x.p = new_enode(relation, 2, 0);
233 value_clear(EP.x.p->arr[1].d);
234 EP.x.p->arr[1] = *factor;
235 evalue *ev = &EP.x.p->arr[0];
236 value_set_si(ev->d, 0);
237 ev->x.p = new_enode(fractional, 3, -1);
238 evalue_set_si(&ev->x.p->arr[1], 0, 1);
239 evalue_set_si(&ev->x.p->arr[2], 1, 1);
240 evalue *E = multi_monom(row);
241 value_assign(EV.d, m);
242 emul(&EV, E);
243 value_clear(ev->x.p->arr[0].d);
244 ev->x.p->arr[0] = *E;
245 delete E;
246 *factor = EP;
247 }
248
249 value_clear(m);
250 free_evalue_refs(&EV);
251 }
252
253 /*
254 *
255 */
256 static void mask_table(Matrix *f, evalue *factor)
257 {
258 int nr = f->NbRows, nc = f->NbColumns;
259 int n;
260 bool found = false;
261 for (n = 0; n < nr && value_notzero_p(f->p[n][nc-1]); ++n)
262 if (value_notone_p(f->p[n][nc-1]) &&
263 value_notmone_p(f->p[n][nc-1]))
264 found = true;
265 if (!found)
266 return;
267
268 Value tmp;
269 value_init(tmp);
270 nr = n;
271 unsigned np = nc - 2;
272 Vector *lcm = Vector_Alloc(np);
273 Vector *val = Vector_Alloc(nc);
274 Vector_Set(val->p, 0, nc);
275 value_set_si(val->p[np], 1);
276 Vector_Set(lcm->p, 1, np);
277 for (n = 0; n < nr; ++n) {
278 if (value_one_p(f->p[n][nc-1]) ||
279 value_mone_p(f->p[n][nc-1]))
280 continue;
281 for (int j = 0; j < np; ++j)
282 if (value_notzero_p(f->p[n][j])) {
283 Gcd(f->p[n][j], f->p[n][nc-1], &tmp);
284 value_division(tmp, f->p[n][nc-1], tmp);
285 value_lcm(tmp, lcm->p[j], &lcm->p[j]);
286 }
287 }
288 evalue EP;
289 value_init(EP.d);
290 mask_r(f, nr, lcm, 0, val, &EP);
291 value_clear(tmp);
292 Vector_Free(val);
293 Vector_Free(lcm);
294 emul(&EP,factor);
295 free_evalue_refs(&EP);
296 }
297
298 static void mask(Matrix *f, evalue *factor, barvinok_options *options)
299 {
300 if (options->lookup_table)
301 mask_table(f, factor);
302 else
303 mask_fractional(f, factor);
304 }
305
306 /* This structure encodes the power of the term in a rational generating function.
307 *
308 * Either E == NULL or constant = 0
309 * If E != NULL, then the power is E
310 * If E == NULL, then the power is coeff * param[pos] + constant
311 */
312 struct term_info {
313 evalue *E;
314 ZZ constant;
315 ZZ coeff;
316 int pos;
317 };
318
319 /* Returns the power of (t+1) in the term of a rational generating function,
320 * i.e., the scalar product of the actual lattice point and lambda.
321 * The lattice point is the unique lattice point in the fundamental parallelepiped
322 * of the unimodual cone i shifted to the parametric vertex V.
323 *
324 * PD is the parameter domain, which, if != NULL, may be used to simply the
325 * resulting expression.
326 *
327 * The result is returned in term.
328 */
329 void lattice_point(Param_Vertices* V, const mat_ZZ& rays, vec_ZZ& lambda,
330 term_info* term, Polyhedron *PD, barvinok_options *options)
331 {
332 unsigned nparam = V->Vertex->NbColumns - 2;
333 unsigned dim = rays.NumCols();
334 mat_ZZ vertex;
335 vertex.SetDims(V->Vertex->NbRows, nparam+1);
336 Value lcm, tmp;
337 value_init(lcm);
338 value_init(tmp);
339 value_set_si(lcm, 1);
340 for (int j = 0; j < V->Vertex->NbRows; ++j) {
341 value_lcm(lcm, V->Vertex->p[j][nparam+1], &lcm);
342 }
343 if (value_notone_p(lcm)) {
344 Matrix * mv = Matrix_Alloc(dim, nparam+1);
345 for (int j = 0 ; j < dim; ++j) {
346 value_division(tmp, lcm, V->Vertex->p[j][nparam+1]);
347 Vector_Scale(V->Vertex->p[j], mv->p[j], tmp, nparam+1);
348 }
349
350 term->E = lattice_point(rays, lambda, mv, lcm, PD, options);
351 term->constant = 0;
352
353 Matrix_Free(mv);
354 value_clear(lcm);
355 value_clear(tmp);
356 return;
357 }
358 for (int i = 0; i < V->Vertex->NbRows; ++i) {
359 assert(value_one_p(V->Vertex->p[i][nparam+1])); // for now
360 values2zz(V->Vertex->p[i], vertex[i], nparam+1);
361 }
362
363 vec_ZZ num;
364 num = lambda * vertex;
365
366 int p = -1;
367 int nn = 0;
368 for (int j = 0; j < nparam; ++j)
369 if (num[j] != 0) {
370 ++nn;
371 p = j;
372 }
373 if (nn >= 2) {
374 term->E = multi_monom(num);
375 term->constant = 0;
376 } else {
377 term->E = NULL;
378 term->constant = num[nparam];
379 term->pos = p;
380 if (p != -1)
381 term->coeff = num[p];
382 }
383
384 value_clear(lcm);
385 value_clear(tmp);
386 }
387
388
389 struct counter : public np_base {
390 vec_ZZ lambda;
391 mat_ZZ vertex;
392 vec_ZZ den;
393 ZZ sign;
394 vec_ZZ num;
395 ZZ offset;
396 int j;
397 mpq_t count;
398
399 counter(unsigned dim) : np_base(dim) {
400 den.SetLength(dim);
401 mpq_init(count);
402 }
403
404 virtual void init(Polyhedron *P) {
405 randomvector(P, lambda, dim);
406 }
407
408 virtual void reset() {
409 mpq_set_si(count, 0, 0);
410 }
411
412 ~counter() {
413 mpq_clear(count);
414 }
415
416 virtual void handle(const mat_ZZ& rays, Value *vertex, const QQ& c,
417 unsigned long det, int *closed, barvinok_options *options);
418 virtual void get_count(Value *result) {
419 assert(value_one_p(&count[0]._mp_den));
420 value_assign(*result, &count[0]._mp_num);
421 }
422 };
423
424 void counter::handle(const mat_ZZ& rays, Value *V, const QQ& c, unsigned long det,
425 int *closed, barvinok_options *options)
426 {
427 for (int k = 0; k < dim; ++k) {
428 if (lambda * rays[k] == 0)
429 throw Orthogonal;
430 }
431
432 assert(c.d == 1);
433 assert(c.n == 1 || c.n == -1);
434 sign = c.n;
435
436 lattice_point(V, rays, vertex, det, closed);
437 num = vertex * lambda;
438 den = rays * lambda;
439 offset = 0;
440 normalize(sign, offset, den);
441
442 num[0] += offset;
443 dpoly d(dim, num[0]);
444 for (int k = 1; k < num.length(); ++k) {
445 num[k] += offset;
446 dpoly term(dim, num[k]);
447 d += term;
448 }
449 dpoly n(dim, den[0], 1);
450 for (int k = 1; k < dim; ++k) {
451 dpoly fact(dim, den[k], 1);
452 n *= fact;
453 }
454 d.div(n, count, sign);
455 }
456
457 struct bfe_term : public bfc_term_base {
458 vector<evalue *> factors;
459
460 bfe_term(int len) : bfc_term_base(len) {
461 }
462
463 ~bfe_term() {
464 for (int i = 0; i < factors.size(); ++i) {
465 if (!factors[i])
466 continue;
467 free_evalue_refs(factors[i]);
468 delete factors[i];
469 }
470 }
471 };
472
473 static void print_int_vector(int *v, int len, char *name)
474 {
475 cerr << name << endl;
476 for (int j = 0; j < len; ++j) {
477 cerr << v[j] << " ";
478 }
479 cerr << endl;
480 }
481
482 static void print_bfc_terms(mat_ZZ& factors, bfc_vec& v)
483 {
484 cerr << endl;
485 cerr << "factors" << endl;
486 cerr << factors << endl;
487 for (int i = 0; i < v.size(); ++i) {
488 cerr << "term: " << i << endl;
489 print_int_vector(v[i]->powers, factors.NumRows(), "powers");
490 cerr << "terms" << endl;
491 cerr << v[i]->terms << endl;
492 bfc_term* bfct = static_cast<bfc_term *>(v[i]);
493 cerr << bfct->c << endl;
494 }
495 }
496
497 static void print_bfe_terms(mat_ZZ& factors, bfc_vec& v)
498 {
499 cerr << endl;
500 cerr << "factors" << endl;
501 cerr << factors << endl;
502 for (int i = 0; i < v.size(); ++i) {
503 cerr << "term: " << i << endl;
504 print_int_vector(v[i]->powers, factors.NumRows(), "powers");
505 cerr << "terms" << endl;
506 cerr << v[i]->terms << endl;
507 bfe_term* bfet = static_cast<bfe_term *>(v[i]);
508 for (int j = 0; j < v[i]->terms.NumRows(); ++j) {
509 char * test[] = {"a", "b"};
510 print_evalue(stderr, bfet->factors[j], test);
511 fprintf(stderr, "\n");
512 }
513 }
514 }
515
516 struct bfcounter : public bfcounter_base {
517 mpq_t count;
518
519 bfcounter(unsigned dim) : bfcounter_base(dim) {
520 mpq_init(count);
521 lower = 1;
522 }
523 ~bfcounter() {
524 mpq_clear(count);
525 }
526 virtual void base(mat_ZZ& factors, bfc_vec& v);
527 virtual void get_count(Value *result) {
528 assert(value_one_p(&count[0]._mp_den));
529 value_assign(*result, &count[0]._mp_num);
530 }
531 };
532
533 void bfcounter::base(mat_ZZ& factors, bfc_vec& v)
534 {
535 unsigned nf = factors.NumRows();
536
537 for (int i = 0; i < v.size(); ++i) {
538 bfc_term* bfct = static_cast<bfc_term *>(v[i]);
539 int total_power = 0;
540 // factor is always positive, so we always
541 // change signs
542 for (int k = 0; k < nf; ++k)
543 total_power += v[i]->powers[k];
544
545 int j;
546 for (j = 0; j < nf; ++j)
547 if (v[i]->powers[j] > 0)
548 break;
549
550 dpoly D(total_power, factors[j][0], 1);
551 for (int k = 1; k < v[i]->powers[j]; ++k) {
552 dpoly fact(total_power, factors[j][0], 1);
553 D *= fact;
554 }
555 for ( ; ++j < nf; )
556 for (int k = 0; k < v[i]->powers[j]; ++k) {
557 dpoly fact(total_power, factors[j][0], 1);
558 D *= fact;
559 }
560
561 for (int k = 0; k < v[i]->terms.NumRows(); ++k) {
562 dpoly n(total_power, v[i]->terms[k][0]);
563 mpq_set_si(tcount, 0, 1);
564 n.div(D, tcount, one);
565 if (total_power % 2)
566 bfct->c[k].n = -bfct->c[k].n;
567 zz2value(bfct->c[k].n, tn);
568 zz2value(bfct->c[k].d, td);
569
570 mpz_mul(mpq_numref(tcount), mpq_numref(tcount), tn);
571 mpz_mul(mpq_denref(tcount), mpq_denref(tcount), td);
572 mpq_canonicalize(tcount);
573 mpq_add(count, count, tcount);
574 }
575 delete v[i];
576 }
577 }
578
579
580 /* Check whether the polyhedron is unbounded and if so,
581 * check whether it has any (and therefore an infinite number of)
582 * integer points.
583 * If one of the vertices is integer, then we are done.
584 * Otherwise, transform the polyhedron such that one of the rays
585 * is the first unit vector and cut it off at a height that ensures
586 * that if the whole polyhedron has any points, then the remaining part
587 * has integer points. In particular we add the largest coefficient
588 * of a ray to the highest vertex (rounded up).
589 */
590 static bool Polyhedron_is_infinite(Polyhedron *P, Value* result,
591 barvinok_options *options)
592 {
593 int r = 0;
594 Matrix *M, *M2;
595 Value c, tmp;
596 Value g;
597 bool first;
598 Vector *v;
599 Value offset, size;
600 Polyhedron *R;
601
602 if (P->NbBid == 0)
603 for (; r < P->NbRays; ++r)
604 if (value_zero_p(P->Ray[r][P->Dimension+1]))
605 break;
606 if (P->NbBid == 0 && r == P->NbRays)
607 return false;
608
609 if (options->count_sample_infinite) {
610 Vector *sample;
611
612 sample = Polyhedron_Sample(P, options);
613 if (!sample)
614 value_set_si(*result, 0);
615 else {
616 value_set_si(*result, -1);
617 Vector_Free(sample);
618 }
619 return true;
620 }
621
622 for (int i = 0; i < P->NbRays; ++i)
623 if (value_one_p(P->Ray[i][1+P->Dimension])) {
624 value_set_si(*result, -1);
625 return true;
626 }
627
628 value_init(g);
629 v = Vector_Alloc(P->Dimension+1);
630 Vector_Gcd(P->Ray[r]+1, P->Dimension, &g);
631 Vector_AntiScale(P->Ray[r]+1, v->p, g, P->Dimension+1);
632 M = unimodular_complete(v);
633 value_set_si(M->p[P->Dimension][P->Dimension], 1);
634 M2 = Transpose(M);
635 Matrix_Free(M);
636 P = Polyhedron_Preimage(P, M2, 0);
637 Matrix_Free(M2);
638 value_clear(g);
639 Vector_Free(v);
640
641 first = true;
642 value_init(offset);
643 value_init(size);
644 value_init(tmp);
645 value_set_si(size, 0);
646
647 for (int i = 0; i < P->NbBid; ++i) {
648 value_absolute(tmp, P->Ray[i][1]);
649 if (value_gt(tmp, size))
650 value_assign(size, tmp);
651 }
652 for (int i = P->NbBid; i < P->NbRays; ++i) {
653 if (value_zero_p(P->Ray[i][P->Dimension+1])) {
654 if (value_gt(P->Ray[i][1], size))
655 value_assign(size, P->Ray[i][1]);
656 continue;
657 }
658 mpz_cdiv_q(tmp, P->Ray[i][1], P->Ray[i][P->Dimension+1]);
659 if (first || value_gt(tmp, offset)) {
660 value_assign(offset, tmp);
661 first = false;
662 }
663 }
664 value_addto(offset, offset, size);
665 value_clear(size);
666 value_clear(tmp);
667
668 v = Vector_Alloc(P->Dimension+2);
669 value_set_si(v->p[0], 1);
670 value_set_si(v->p[1], -1);
671 value_assign(v->p[1+P->Dimension], offset);
672 R = AddConstraints(v->p, 1, P, options->MaxRays);
673 Polyhedron_Free(P);
674 P = R;
675
676 value_clear(offset);
677 Vector_Free(v);
678
679 value_init(c);
680 barvinok_count_with_options(P, &c, options);
681 Polyhedron_Free(P);
682 if (value_zero_p(c))
683 value_set_si(*result, 0);
684 else
685 value_set_si(*result, -1);
686 value_clear(c);
687
688 return true;
689 }
690
691 typedef Polyhedron * Polyhedron_p;
692
693 static void barvinok_count_f(Polyhedron *P, Value* result,
694 barvinok_options *options);
695
696 void barvinok_count_with_options(Polyhedron *P, Value* result,
697 struct barvinok_options *options)
698 {
699 unsigned dim;
700 int allocated = 0;
701 Polyhedron *Q;
702 bool infinite = false;
703
704 if (emptyQ2(P)) {
705 value_set_si(*result, 0);
706 return;
707 }
708 if (P->NbEq != 0) {
709 Q = NULL;
710 do {
711 P = remove_equalities(P);
712 P = DomainConstraintSimplify(P, options->MaxRays);
713 if (Q)
714 Polyhedron_Free(Q);
715 Q = P;
716 } while (!emptyQ(P) && P->NbEq != 0);
717 if (emptyQ(P)) {
718 Polyhedron_Free(P);
719 value_set_si(*result, 0);
720 return;
721 }
722 allocated = 1;
723 }
724 if (Polyhedron_is_infinite(P, result, options)) {
725 if (allocated)
726 Polyhedron_Free(P);
727 return;
728 }
729 if (P->Dimension == 0) {
730 /* Test whether the constraints are satisfied */
731 POL_ENSURE_VERTICES(P);
732 value_set_si(*result, !emptyQ(P));
733 if (allocated)
734 Polyhedron_Free(P);
735 return;
736 }
737 Q = Polyhedron_Factor(P, 0, options->MaxRays);
738 if (Q) {
739 if (allocated)
740 Polyhedron_Free(P);
741 P = Q;
742 allocated = 1;
743 }
744
745 barvinok_count_f(P, result, options);
746 if (value_neg_p(*result))
747 infinite = true;
748 if (Q && P->next && value_notzero_p(*result)) {
749 Value factor;
750 value_init(factor);
751
752 for (Q = P->next; Q; Q = Q->next) {
753 barvinok_count_f(Q, &factor, options);
754 if (value_neg_p(factor)) {
755 infinite = true;
756 continue;
757 } else if (Q->next && value_zero_p(factor)) {
758 value_set_si(*result, 0);
759 break;
760 }
761 value_multiply(*result, *result, factor);
762 }
763
764 value_clear(factor);
765 }
766
767 if (allocated)
768 Domain_Free(P);
769 if (infinite)
770 value_set_si(*result, -1);
771 }
772
773 void barvinok_count(Polyhedron *P, Value* result, unsigned NbMaxCons)
774 {
775 barvinok_options *options = barvinok_options_new_with_defaults();
776 options->MaxRays = NbMaxCons;
777 barvinok_count_with_options(P, result, options);
778 barvinok_options_free(options);
779 }
780
781 static void barvinok_count_f(Polyhedron *P, Value* result,
782 barvinok_options *options)
783 {
784 if (emptyQ2(P)) {
785 value_set_si(*result, 0);
786 return;
787 }
788
789 if (P->Dimension == 1)
790 return Line_Length(P, result);
791
792 int c = P->NbConstraints;
793 POL_ENSURE_FACETS(P);
794 if (c != P->NbConstraints || P->NbEq != 0)
795 return barvinok_count_with_options(P, result, options);
796
797 POL_ENSURE_VERTICES(P);
798
799 if (Polyhedron_is_infinite(P, result, options))
800 return;
801
802 np_base *cnt;
803 if (options->incremental_specialization == 2)
804 cnt = new bfcounter(P->Dimension);
805 else if (options->incremental_specialization == 1)
806 cnt = new icounter(P->Dimension);
807 else
808 cnt = new counter(P->Dimension);
809 cnt->start(P, options);
810
811 cnt->get_count(result);
812 delete cnt;
813 }
814
815 static void uni_polynom(int param, Vector *c, evalue *EP)
816 {
817 unsigned dim = c->Size-2;
818 value_init(EP->d);
819 value_set_si(EP->d,0);
820 EP->x.p = new_enode(polynomial, dim+1, param+1);
821 for (int j = 0; j <= dim; ++j)
822 evalue_set(&EP->x.p->arr[j], c->p[j], c->p[dim+1]);
823 }
824
825 static void multi_polynom(Vector *c, evalue* X, evalue *EP)
826 {
827 unsigned dim = c->Size-2;
828 evalue EC;
829
830 value_init(EC.d);
831 evalue_set(&EC, c->p[dim], c->p[dim+1]);
832
833 value_init(EP->d);
834 evalue_set(EP, c->p[dim], c->p[dim+1]);
835
836 for (int i = dim-1; i >= 0; --i) {
837 emul(X, EP);
838 value_assign(EC.x.n, c->p[i]);
839 eadd(&EC, EP);
840 }
841 free_evalue_refs(&EC);
842 }
843
844 Polyhedron *unfringe (Polyhedron *P, unsigned MaxRays)
845 {
846 int len = P->Dimension+2;
847 Polyhedron *T, *R = P;
848 Value g;
849 value_init(g);
850 Vector *row = Vector_Alloc(len);
851 value_set_si(row->p[0], 1);
852
853 R = DomainConstraintSimplify(Polyhedron_Copy(P), MaxRays);
854
855 Matrix *M = Matrix_Alloc(2, len-1);
856 value_set_si(M->p[1][len-2], 1);
857 for (int v = 0; v < P->Dimension; ++v) {
858 value_set_si(M->p[0][v], 1);
859 Polyhedron *I = Polyhedron_Image(R, M, 2+1);
860 value_set_si(M->p[0][v], 0);
861 for (int r = 0; r < I->NbConstraints; ++r) {
862 if (value_zero_p(I->Constraint[r][0]))
863 continue;
864 if (value_zero_p(I->Constraint[r][1]))
865 continue;
866 if (value_one_p(I->Constraint[r][1]))
867 continue;
868 if (value_mone_p(I->Constraint[r][1]))
869 continue;
870 value_absolute(g, I->Constraint[r][1]);
871 Vector_Set(row->p+1, 0, len-2);
872 value_division(row->p[1+v], I->Constraint[r][1], g);
873 mpz_fdiv_q(row->p[len-1], I->Constraint[r][2], g);
874 T = R;
875 R = AddConstraints(row->p, 1, R, MaxRays);
876 if (T != P)
877 Polyhedron_Free(T);
878 }
879 Polyhedron_Free(I);
880 }
881 Matrix_Free(M);
882 Vector_Free(row);
883 value_clear(g);
884 return R;
885 }
886
887 /* this procedure may have false negatives */
888 static bool Polyhedron_is_infinite_param(Polyhedron *P, unsigned nparam)
889 {
890 int r;
891 for (r = 0; r < P->NbRays; ++r) {
892 if (!value_zero_p(P->Ray[r][0]) &&
893 !value_zero_p(P->Ray[r][P->Dimension+1]))
894 continue;
895 if (First_Non_Zero(P->Ray[r]+1+P->Dimension-nparam, nparam) == -1)
896 return true;
897 }
898 return false;
899 }
900
901 /* Check whether all rays point in the positive directions
902 * for the parameters
903 */
904 static bool Polyhedron_has_positive_rays(Polyhedron *P, unsigned nparam)
905 {
906 int r;
907 for (r = 0; r < P->NbRays; ++r)
908 if (value_zero_p(P->Ray[r][P->Dimension+1])) {
909 int i;
910 for (i = P->Dimension - nparam; i < P->Dimension; ++i)
911 if (value_neg_p(P->Ray[r][i+1]))
912 return false;
913 }
914 return true;
915 }
916
917 typedef evalue * evalue_p;
918
919 struct enumerator_base {
920 unsigned dim;
921 evalue ** vE;
922 evalue mone;
923 vertex_decomposer *vpd;
924
925 enumerator_base(unsigned dim, vertex_decomposer *vpd)
926 {
927 this->dim = dim;
928 this->vpd = vpd;
929
930 vE = new evalue_p[vpd->nbV];
931 for (int j = 0; j < vpd->nbV; ++j)
932 vE[j] = 0;
933
934 value_init(mone.d);
935 evalue_set_si(&mone, -1, 1);
936 }
937
938 void decompose_at(Param_Vertices *V, int _i, barvinok_options *options) {
939 //this->pVD = pVD;
940
941 vE[_i] = new evalue;
942 value_init(vE[_i]->d);
943 evalue_set_si(vE[_i], 0, 1);
944
945 vpd->decompose_at_vertex(V, _i, options);
946 }
947
948 virtual ~enumerator_base() {
949 for (int j = 0; j < vpd->nbV; ++j)
950 if (vE[j]) {
951 free_evalue_refs(vE[j]);
952 delete vE[j];
953 }
954 delete [] vE;
955
956 free_evalue_refs(&mone);
957 }
958
959 static enumerator_base *create(Polyhedron *P, unsigned dim, unsigned nbV,
960 barvinok_options *options);
961 };
962
963 struct enumerator : public signed_cone_consumer, public vertex_decomposer,
964 public enumerator_base {
965 vec_ZZ lambda;
966 vec_ZZ den;
967 ZZ sign;
968 term_info num;
969 Vector *c;
970 mpq_t count;
971
972 enumerator(Polyhedron *P, unsigned dim, unsigned nbV) :
973 vertex_decomposer(P, nbV, *this), enumerator_base(dim, this) {
974 this->P = P;
975 this->nbV = nbV;
976 randomvector(P, lambda, dim);
977 den.SetLength(dim);
978 c = Vector_Alloc(dim+2);
979
980 mpq_init(count);
981 }
982
983 ~enumerator() {
984 mpq_clear(count);
985 Vector_Free(c);
986 }
987
988 virtual void handle(const signed_cone& sc, barvinok_options *options);
989 };
990
991 void enumerator::handle(const signed_cone& sc, barvinok_options *options)
992 {
993 assert(sc.det == 1);
994 assert(!sc.closed);
995 int r = 0;
996 assert(sc.rays.NumRows() == dim);
997 for (int k = 0; k < dim; ++k) {
998 if (lambda * sc.rays[k] == 0)
999 throw Orthogonal;
1000 }
1001
1002 sign = sc.sign;
1003
1004 lattice_point(V, sc.rays, lambda, &num, 0, options);
1005 den = sc.rays * lambda;
1006 normalize(sign, num.constant, den);
1007
1008 dpoly n(dim, den[0], 1);
1009 for (int k = 1; k < dim; ++k) {
1010 dpoly fact(dim, den[k], 1);
1011 n *= fact;
1012 }
1013 if (num.E != NULL) {
1014 ZZ one(INIT_VAL, 1);
1015 dpoly_n d(dim, num.constant, one);
1016 d.div(n, c, sign);
1017 evalue EV;
1018 multi_polynom(c, num.E, &EV);
1019 eadd(&EV , vE[vert]);
1020 free_evalue_refs(&EV);
1021 free_evalue_refs(num.E);
1022 delete num.E;
1023 } else if (num.pos != -1) {
1024 dpoly_n d(dim, num.constant, num.coeff);
1025 d.div(n, c, sign);
1026 evalue EV;
1027 uni_polynom(num.pos, c, &EV);
1028 eadd(&EV , vE[vert]);
1029 free_evalue_refs(&EV);
1030 } else {
1031 mpq_set_si(count, 0, 1);
1032 dpoly d(dim, num.constant);
1033 d.div(n, count, sign);
1034 evalue EV;
1035 value_init(EV.d);
1036 evalue_set(&EV, &count[0]._mp_num, &count[0]._mp_den);
1037 eadd(&EV , vE[vert]);
1038 free_evalue_refs(&EV);
1039 }
1040 }
1041
1042 struct ienumerator_base : enumerator_base {
1043 evalue ** E_vertex;
1044
1045 ienumerator_base(unsigned dim, vertex_decomposer *vpd) :
1046 enumerator_base(dim,vpd) {
1047 E_vertex = new evalue_p[dim];
1048 }
1049
1050 virtual ~ienumerator_base() {
1051 delete [] E_vertex;
1052 }
1053
1054 evalue *E_num(int i, int d) {
1055 return E_vertex[i + (dim-d)];
1056 }
1057 };
1058
1059 struct cumulator {
1060 evalue *factor;
1061 evalue *v;
1062 dpoly_r *r;
1063
1064 cumulator(evalue *factor, evalue *v, dpoly_r *r) :
1065 factor(factor), v(v), r(r) {}
1066
1067 void cumulate(barvinok_options *options);
1068
1069 virtual void add_term(const vector<int>& powers, evalue *f2) = 0;
1070 };
1071
1072 void cumulator::cumulate(barvinok_options *options)
1073 {
1074 evalue cum; // factor * 1 * E_num[0]/1 * (E_num[0]-1)/2 *...
1075 evalue f;
1076 evalue t; // E_num[0] - (m-1)
1077 evalue *cst;
1078 evalue mone;
1079
1080 if (options->lookup_table) {
1081 value_init(mone.d);
1082 evalue_set_si(&mone, -1, 1);
1083 }
1084
1085 value_init(cum.d);
1086 evalue_copy(&cum, factor);
1087 value_init(f.d);
1088 value_init(f.x.n);
1089 value_set_si(f.d, 1);
1090 value_set_si(f.x.n, 1);
1091 value_init(t.d);
1092 evalue_copy(&t, v);
1093
1094 if (!options->lookup_table) {
1095 for (cst = &t; value_zero_p(cst->d); ) {
1096 if (cst->x.p->type == fractional)
1097 cst = &cst->x.p->arr[1];
1098 else
1099 cst = &cst->x.p->arr[0];
1100 }
1101 }
1102
1103 for (int m = 0; m < r->len; ++m) {
1104 if (m > 0) {
1105 if (m > 1) {
1106 value_set_si(f.d, m);
1107 emul(&f, &cum);
1108 if (!options->lookup_table)
1109 value_subtract(cst->x.n, cst->x.n, cst->d);
1110 else
1111 eadd(&mone, &t);
1112 }
1113 emul(&t, &cum);
1114 }
1115 dpoly_r_term_list& current = r->c[r->len-1-m];
1116 dpoly_r_term_list::iterator j;
1117 for (j = current.begin(); j != current.end(); ++j) {
1118 if ((*j)->coeff == 0)
1119 continue;
1120 evalue *f2 = new evalue;
1121 value_init(f2->d);
1122 value_init(f2->x.n);
1123 zz2value((*j)->coeff, f2->x.n);
1124 zz2value(r->denom, f2->d);
1125 emul(&cum, f2);
1126
1127 add_term((*j)->powers, f2);
1128 }
1129 }
1130 free_evalue_refs(&f);
1131 free_evalue_refs(&t);
1132 free_evalue_refs(&cum);
1133 if (options->lookup_table)
1134 free_evalue_refs(&mone);
1135 }
1136
1137 struct E_poly_term {
1138 vector<int> powers;
1139 evalue *E;
1140 };
1141
1142 struct ie_cum : public cumulator {
1143 vector<E_poly_term *> terms;
1144
1145 ie_cum(evalue *factor, evalue *v, dpoly_r *r) : cumulator(factor, v, r) {}
1146
1147 virtual void add_term(const vector<int>& powers, evalue *f2);
1148 };
1149
1150 void ie_cum::add_term(const vector<int>& powers, evalue *f2)
1151 {
1152 int k;
1153 for (k = 0; k < terms.size(); ++k) {
1154 if (terms[k]->powers == powers) {
1155 eadd(f2, terms[k]->E);
1156 free_evalue_refs(f2);
1157 delete f2;
1158 break;
1159 }
1160 }
1161 if (k >= terms.size()) {
1162 E_poly_term *ET = new E_poly_term;
1163 ET->powers = powers;
1164 ET->E = f2;
1165 terms.push_back(ET);
1166 }
1167 }
1168
1169 struct ienumerator : public signed_cone_consumer, public vertex_decomposer,
1170 public ienumerator_base {
1171 //Polyhedron *pVD;
1172 mat_ZZ den;
1173 mat_ZZ vertex;
1174 mpq_t tcount;
1175
1176 ienumerator(Polyhedron *P, unsigned dim, unsigned nbV) :
1177 vertex_decomposer(P, nbV, *this), ienumerator_base(dim, this) {
1178 vertex.SetDims(1, dim);
1179
1180 den.SetDims(dim, dim);
1181 mpq_init(tcount);
1182 }
1183
1184 ~ienumerator() {
1185 mpq_clear(tcount);
1186 }
1187
1188 virtual void handle(const signed_cone& sc, barvinok_options *options);
1189 void reduce(evalue *factor, const mat_ZZ& num, const mat_ZZ& den_f,
1190 barvinok_options *options);
1191 };
1192
1193 void ienumerator::reduce(evalue *factor, const mat_ZZ& num, const mat_ZZ& den_f,
1194 barvinok_options *options)
1195 {
1196 unsigned len = den_f.NumRows(); // number of factors in den
1197 unsigned dim = num.NumCols();
1198 assert(num.NumRows() == 1);
1199
1200 if (dim == 0) {
1201 eadd(factor, vE[vert]);
1202 return;
1203 }
1204
1205 vec_ZZ den_s;
1206 mat_ZZ den_r;
1207 vec_ZZ num_s;
1208 mat_ZZ num_p;
1209
1210 split_one(num, num_s, num_p, den_f, den_s, den_r);
1211
1212 vec_ZZ den_p;
1213 den_p.SetLength(len);
1214
1215 ZZ one;
1216 one = 1;
1217 normalize(one, num_s, num_p, den_s, den_p, den_r);
1218 if (one != 1)
1219 emul(&mone, factor);
1220
1221 int only_param = 0;
1222 int no_param = 0;
1223 for (int k = 0; k < len; ++k) {
1224 if (den_p[k] == 0)
1225 ++no_param;
1226 else if (den_s[k] == 0)
1227 ++only_param;
1228 }
1229 if (no_param == 0) {
1230 reduce(factor, num_p, den_r, options);
1231 } else {
1232 int k, l;
1233 mat_ZZ pden;
1234 pden.SetDims(only_param, dim-1);
1235
1236 for (k = 0, l = 0; k < len; ++k)
1237 if (den_s[k] == 0)
1238 pden[l++] = den_r[k];
1239
1240 for (k = 0; k < len; ++k)
1241 if (den_p[k] == 0)
1242 break;
1243
1244 dpoly n(no_param, num_s[0]);
1245 dpoly D(no_param, den_s[k], 1);
1246 for ( ; ++k < len; )
1247 if (den_p[k] == 0) {
1248 dpoly fact(no_param, den_s[k], 1);
1249 D *= fact;
1250 }
1251
1252 dpoly_r * r = 0;
1253 // if no_param + only_param == len then all powers
1254 // below will be all zero
1255 if (no_param + only_param == len) {
1256 if (E_num(0, dim) != 0)
1257 r = new dpoly_r(n, len);
1258 else {
1259 mpq_set_si(tcount, 0, 1);
1260 one = 1;
1261 n.div(D, tcount, one);
1262
1263 if (value_notzero_p(mpq_numref(tcount))) {
1264 evalue f;
1265 value_init(f.d);
1266 value_init(f.x.n);
1267 value_assign(f.x.n, mpq_numref(tcount));
1268 value_assign(f.d, mpq_denref(tcount));
1269 emul(&f, factor);
1270 reduce(factor, num_p, pden, options);
1271 free_evalue_refs(&f);
1272 }
1273 return;
1274 }
1275 } else {
1276 for (k = 0; k < len; ++k) {
1277 if (den_s[k] == 0 || den_p[k] == 0)
1278 continue;
1279
1280 dpoly pd(no_param-1, den_s[k], 1);
1281
1282 int l;
1283 for (l = 0; l < k; ++l)
1284 if (den_r[l] == den_r[k])
1285 break;
1286
1287 if (r == 0)
1288 r = new dpoly_r(n, pd, l, len);
1289 else {
1290 dpoly_r *nr = new dpoly_r(r, pd, l, len);
1291 delete r;
1292 r = nr;
1293 }
1294 }
1295 }
1296 dpoly_r *rc = r->div(D);
1297 delete r;
1298 r = rc;
1299 if (E_num(0, dim) == 0) {
1300 int common = pden.NumRows();
1301 dpoly_r_term_list& final = r->c[r->len-1];
1302 int rows;
1303 evalue t;
1304 evalue f;
1305 value_init(f.d);
1306 value_init(f.x.n);
1307 zz2value(r->denom, f.d);
1308 dpoly_r_term_list::iterator j;
1309 for (j = final.begin(); j != final.end(); ++j) {
1310 if ((*j)->coeff == 0)
1311 continue;
1312 rows = common;
1313 for (int k = 0; k < r->dim; ++k) {
1314 int n = (*j)->powers[k];
1315 if (n == 0)
1316 continue;
1317 pden.SetDims(rows+n, pden.NumCols());
1318 for (int l = 0; l < n; ++l)
1319 pden[rows+l] = den_r[k];
1320 rows += n;
1321 }
1322 value_init(t.d);
1323 evalue_copy(&t, factor);
1324 zz2value((*j)->coeff, f.x.n);
1325 emul(&f, &t);
1326 reduce(&t, num_p, pden, options);
1327 free_evalue_refs(&t);
1328 }
1329 free_evalue_refs(&f);
1330 } else {
1331 ie_cum cum(factor, E_num(0, dim), r);
1332 cum.cumulate(options);
1333
1334 int common = pden.NumRows();
1335 int rows;
1336 for (int j = 0; j < cum.terms.size(); ++j) {
1337 rows = common;
1338 pden.SetDims(rows, pden.NumCols());
1339 for (int k = 0; k < r->dim; ++k) {
1340 int n = cum.terms[j]->powers[k];
1341 if (n == 0)
1342 continue;
1343 pden.SetDims(rows+n, pden.NumCols());
1344 for (int l = 0; l < n; ++l)
1345 pden[rows+l] = den_r[k];
1346 rows += n;
1347 }
1348 reduce(cum.terms[j]->E, num_p, pden, options);
1349 free_evalue_refs(cum.terms[j]->E);
1350 delete cum.terms[j]->E;
1351 delete cum.terms[j];
1352 }
1353 }
1354 delete r;
1355 }
1356 }
1357
1358 static int type_offset(enode *p)
1359 {
1360 return p->type == fractional ? 1 :
1361 p->type == flooring ? 1 : 0;
1362 }
1363
1364 static int edegree(evalue *e)
1365 {
1366 int d = 0;
1367 enode *p;
1368
1369 if (value_notzero_p(e->d))
1370 return 0;
1371
1372 p = e->x.p;
1373 int i = type_offset(p);
1374 if (p->size-i-1 > d)
1375 d = p->size - i - 1;
1376 for (; i < p->size; i++) {
1377 int d2 = edegree(&p->arr[i]);
1378 if (d2 > d)
1379 d = d2;
1380 }
1381 return d;
1382 }
1383
1384 void ienumerator::handle(const signed_cone& sc, barvinok_options *options)
1385 {
1386 assert(sc.det == 1);
1387 assert(!sc.closed);
1388 assert(sc.rays.NumRows() == dim);
1389
1390 lattice_point(V, sc.rays, vertex[0], E_vertex, options);
1391
1392 den = sc.rays;
1393
1394 evalue one;
1395 value_init(one.d);
1396 evalue_set_si(&one, sc.sign, 1);
1397 reduce(&one, vertex, den, options);
1398 free_evalue_refs(&one);
1399
1400 for (int i = 0; i < dim; ++i)
1401 if (E_vertex[i]) {
1402 free_evalue_refs(E_vertex[i]);
1403 delete E_vertex[i];
1404 }
1405 }
1406
1407 struct bfenumerator : public vertex_decomposer, public bf_base,
1408 public ienumerator_base {
1409 evalue *factor;
1410
1411 bfenumerator(Polyhedron *P, unsigned dim, unsigned nbV) :
1412 vertex_decomposer(P, nbV, *this),
1413 bf_base(dim), ienumerator_base(dim, this) {
1414 lower = 0;
1415 factor = NULL;
1416 }
1417
1418 ~bfenumerator() {
1419 }
1420
1421 virtual void handle(const signed_cone& sc, barvinok_options *options);
1422 virtual void base(mat_ZZ& factors, bfc_vec& v);
1423
1424 bfc_term_base* new_bf_term(int len) {
1425 bfe_term* t = new bfe_term(len);
1426 return t;
1427 }
1428
1429 virtual void set_factor(bfc_term_base *t, int k, int change) {
1430 bfe_term* bfet = static_cast<bfe_term *>(t);
1431 factor = bfet->factors[k];
1432 assert(factor != NULL);
1433 bfet->factors[k] = NULL;
1434 if (change)
1435 emul(&mone, factor);
1436 }
1437
1438 virtual void set_factor(bfc_term_base *t, int k, mpq_t &q, int change) {
1439 bfe_term* bfet = static_cast<bfe_term *>(t);
1440 factor = bfet->factors[k];
1441 assert(factor != NULL);
1442 bfet->factors[k] = NULL;
1443
1444 evalue f;
1445 value_init(f.d);
1446 value_init(f.x.n);
1447 if (change)
1448 value_oppose(f.x.n, mpq_numref(q));
1449 else
1450 value_assign(f.x.n, mpq_numref(q));
1451 value_assign(f.d, mpq_denref(q));
1452 emul(&f, factor);
1453 free_evalue_refs(&f);
1454 }
1455
1456 virtual void set_factor(bfc_term_base *t, int k, const QQ& c, int change) {
1457 bfe_term* bfet = static_cast<bfe_term *>(t);
1458
1459 factor = new evalue;
1460
1461 evalue f;
1462 value_init(f.d);
1463 value_init(f.x.n);
1464 zz2value(c.n, f.x.n);
1465 if (change)
1466 value_oppose(f.x.n, f.x.n);
1467 zz2value(c.d, f.d);
1468
1469 value_init(factor->d);
1470 evalue_copy(factor, bfet->factors[k]);
1471 emul(&f, factor);
1472 free_evalue_refs(&f);
1473 }
1474
1475 void set_factor(evalue *f, int change) {
1476 if (change)
1477 emul(&mone, f);
1478 factor = f;
1479 }
1480
1481 virtual void insert_term(bfc_term_base *t, int i) {
1482 bfe_term* bfet = static_cast<bfe_term *>(t);
1483 int len = t->terms.NumRows()-1; // already increased by one
1484
1485 bfet->factors.resize(len+1);
1486 for (int j = len; j > i; --j) {
1487 bfet->factors[j] = bfet->factors[j-1];
1488 t->terms[j] = t->terms[j-1];
1489 }
1490 bfet->factors[i] = factor;
1491 factor = NULL;
1492 }
1493
1494 virtual void update_term(bfc_term_base *t, int i) {
1495 bfe_term* bfet = static_cast<bfe_term *>(t);
1496
1497 eadd(factor, bfet->factors[i]);
1498 free_evalue_refs(factor);
1499 delete factor;
1500 }
1501
1502 virtual bool constant_vertex(int dim) { return E_num(0, dim) == 0; }
1503
1504 virtual void cum(bf_reducer *bfr, bfc_term_base *t, int k, dpoly_r *r,
1505 barvinok_options *options);
1506 };
1507
1508 enumerator_base *enumerator_base::create(Polyhedron *P, unsigned dim, unsigned nbV,
1509 barvinok_options *options)
1510 {
1511 enumerator_base *eb;
1512
1513 if (options->incremental_specialization == BV_SPECIALIZATION_BF)
1514 eb = new bfenumerator(P, dim, nbV);
1515 else if (options->incremental_specialization == BV_SPECIALIZATION_DF)
1516 eb = new ienumerator(P, dim, nbV);
1517 else
1518 eb = new enumerator(P, dim, nbV);
1519
1520 return eb;
1521 }
1522
1523 struct bfe_cum : public cumulator {
1524 bfenumerator *bfe;
1525 bfc_term_base *told;
1526 int k;
1527 bf_reducer *bfr;
1528
1529 bfe_cum(evalue *factor, evalue *v, dpoly_r *r, bf_reducer *bfr,
1530 bfc_term_base *t, int k, bfenumerator *e) :
1531 cumulator(factor, v, r), told(t), k(k),
1532 bfr(bfr), bfe(e) {
1533 }
1534
1535 virtual void add_term(const vector<int>& powers, evalue *f2);
1536 };
1537
1538 void bfe_cum::add_term(const vector<int>& powers, evalue *f2)
1539 {
1540 bfr->update_powers(powers);
1541
1542 bfc_term_base * t = bfe->find_bfc_term(bfr->vn, bfr->npowers, bfr->nnf);
1543 bfe->set_factor(f2, bfr->l_changes % 2);
1544 bfe->add_term(t, told->terms[k], bfr->l_extra_num);
1545 }
1546
1547 void bfenumerator::cum(bf_reducer *bfr, bfc_term_base *t, int k,
1548 dpoly_r *r, barvinok_options *options)
1549 {
1550 bfe_term* bfet = static_cast<bfe_term *>(t);
1551 bfe_cum cum(bfet->factors[k], E_num(0, bfr->d), r, bfr, t, k, this);
1552 cum.cumulate(options);
1553 }
1554
1555 void bfenumerator::base(mat_ZZ& factors, bfc_vec& v)
1556 {
1557 for (int i = 0; i < v.size(); ++i) {
1558 assert(v[i]->terms.NumRows() == 1);
1559 evalue *factor = static_cast<bfe_term *>(v[i])->factors[0];
1560 eadd(factor, vE[vert]);
1561 delete v[i];
1562 }
1563 }
1564
1565 void bfenumerator::handle(const signed_cone& sc, barvinok_options *options)
1566 {
1567 assert(sc.det == 1);
1568 assert(!sc.closed);
1569 assert(sc.rays.NumRows() == enumerator_base::dim);
1570
1571 bfe_term* t = new bfe_term(enumerator_base::dim);
1572 vector< bfc_term_base * > v;
1573 v.push_back(t);
1574
1575 t->factors.resize(1);
1576
1577 t->terms.SetDims(1, enumerator_base::dim);
1578 lattice_point(V, sc.rays, t->terms[0], E_vertex, options);
1579
1580 // the elements of factors are always lexpositive
1581 mat_ZZ factors;
1582 int s = setup_factors(sc.rays, factors, t, sc.sign);
1583
1584 t->factors[0] = new evalue;
1585 value_init(t->factors[0]->d);
1586 evalue_set_si(t->factors[0], s, 1);
1587 reduce(factors, v, options);
1588
1589 for (int i = 0; i < enumerator_base::dim; ++i)
1590 if (E_vertex[i]) {
1591 free_evalue_refs(E_vertex[i]);
1592 delete E_vertex[i];
1593 }
1594 }
1595
1596 #ifdef HAVE_CORRECT_VERTICES
1597 static inline Param_Polyhedron *Polyhedron2Param_SD(Polyhedron **Din,
1598 Polyhedron *Cin,int WS,Polyhedron **CEq,Matrix **CT)
1599 {
1600 if (WS & POL_NO_DUAL)
1601 WS = 0;
1602 return Polyhedron2Param_SimplifiedDomain(Din, Cin, WS, CEq, CT);
1603 }
1604 #else
1605 static Param_Polyhedron *Polyhedron2Param_SD(Polyhedron **Din,
1606 Polyhedron *Cin,int WS,Polyhedron **CEq,Matrix **CT)
1607 {
1608 static char data[] = " 1 0 0 0 0 1 -18 "
1609 " 1 0 0 -20 0 19 1 "
1610 " 1 0 1 20 0 -20 16 "
1611 " 1 0 0 0 0 -1 19 "
1612 " 1 0 -1 0 0 0 4 "
1613 " 1 4 -20 0 0 -1 23 "
1614 " 1 -4 20 0 0 1 -22 "
1615 " 1 0 1 0 20 -20 16 "
1616 " 1 0 0 0 -20 19 1 ";
1617 static int checked = 0;
1618 if (!checked) {
1619 checked = 1;
1620 char *p = data;
1621 int n, v, i;
1622 Matrix *M = Matrix_Alloc(9, 7);
1623 for (i = 0; i < 9; ++i)
1624 for (int j = 0; j < 7; ++j) {
1625 sscanf(p, "%d%n", &v, &n);
1626 p += n;
1627 value_set_si(M->p[i][j], v);
1628 }
1629 Polyhedron *P = Constraints2Polyhedron(M, 1024);
1630 Matrix_Free(M);
1631 Polyhedron *U = Universe_Polyhedron(1);
1632 Param_Polyhedron *PP = Polyhedron2Param_Domain(P, U, 1024);
1633 Polyhedron_Free(P);
1634 Polyhedron_Free(U);
1635 Param_Vertices *V;
1636 for (i = 0, V = PP->V; V; ++i, V = V->next)
1637 ;
1638 if (PP)
1639 Param_Polyhedron_Free(PP);
1640 if (i != 10) {
1641 fprintf(stderr, "WARNING: results may be incorrect\n");
1642 fprintf(stderr,
1643 "WARNING: use latest version of PolyLib to remove this warning\n");
1644 }
1645 }
1646
1647 return Polyhedron2Param_SimplifiedDomain(Din, Cin, WS, CEq, CT);
1648 }
1649 #endif
1650
1651 static evalue* barvinok_enumerate_ev_f(Polyhedron *P, Polyhedron* C,
1652 barvinok_options *options);
1653
1654 /* Destroys C */
1655 static evalue* barvinok_enumerate_cst(Polyhedron *P, Polyhedron* C,
1656 struct barvinok_options *options)
1657 {
1658 evalue *eres;
1659
1660 ALLOC(evalue, eres);
1661 value_init(eres->d);
1662 value_set_si(eres->d, 0);
1663 eres->x.p = new_enode(partition, 2, C->Dimension);
1664 EVALUE_SET_DOMAIN(eres->x.p->arr[0],
1665 DomainConstraintSimplify(C, options->MaxRays));
1666 value_set_si(eres->x.p->arr[1].d, 1);
1667 value_init(eres->x.p->arr[1].x.n);
1668 if (emptyQ(P))
1669 value_set_si(eres->x.p->arr[1].x.n, 0);
1670 else
1671 barvinok_count_with_options(P, &eres->x.p->arr[1].x.n, options);
1672
1673 return eres;
1674 }
1675
1676 evalue* barvinok_enumerate_with_options(Polyhedron *P, Polyhedron* C,
1677 struct barvinok_options *options)
1678 {
1679 //P = unfringe(P, MaxRays);
1680 Polyhedron *Corig = C;
1681 Polyhedron *CEq = NULL, *rVD, *CA;
1682 int r = 0;
1683 unsigned nparam = C->Dimension;
1684 evalue *eres;
1685
1686 evalue factor;
1687 value_init(factor.d);
1688 evalue_set_si(&factor, 1, 1);
1689
1690 CA = align_context(C, P->Dimension, options->MaxRays);
1691 P = DomainIntersection(P, CA, options->MaxRays);
1692 Polyhedron_Free(CA);
1693
1694 /* for now */
1695 POL_ENSURE_FACETS(P);
1696 POL_ENSURE_VERTICES(P);
1697 POL_ENSURE_FACETS(C);
1698 POL_ENSURE_VERTICES(C);
1699
1700 if (C->Dimension == 0 || emptyQ(P)) {
1701 constant:
1702 eres = barvinok_enumerate_cst(P, CEq ? CEq : Polyhedron_Copy(C), options);
1703 out:
1704 emul(&factor, eres);
1705 reduce_evalue(eres);
1706 free_evalue_refs(&factor);
1707 Domain_Free(P);
1708 if (C != Corig)
1709 Polyhedron_Free(C);
1710
1711 return eres;
1712 }
1713 if (Polyhedron_is_infinite_param(P, nparam))
1714 goto constant;
1715
1716 if (P->NbEq != 0) {
1717 Matrix *f;
1718 P = remove_equalities_p(P, P->Dimension-nparam, &f);
1719 mask(f, &factor, options);
1720 Matrix_Free(f);
1721 }
1722 if (P->Dimension == nparam) {
1723 CEq = P;
1724 P = Universe_Polyhedron(0);
1725 goto constant;
1726 }
1727
1728 Polyhedron *T = Polyhedron_Factor(P, nparam, options->MaxRays);
1729 if (T || (P->Dimension == nparam+1)) {
1730 Polyhedron *Q;
1731 Polyhedron *C2;
1732 for (Q = T ? T : P; Q; Q = Q->next) {
1733 Polyhedron *next = Q->next;
1734 Q->next = NULL;
1735
1736 Polyhedron *QC = Q;
1737 if (Q->Dimension != C->Dimension)
1738 QC = Polyhedron_Project(Q, nparam);
1739
1740 C2 = C;
1741 C = DomainIntersection(C, QC, options->MaxRays);
1742 if (C2 != Corig)
1743 Polyhedron_Free(C2);
1744 if (QC != Q)
1745 Polyhedron_Free(QC);
1746
1747 Q->next = next;
1748 }
1749 }
1750 if (T) {
1751 Polyhedron_Free(P);
1752 P = T;
1753 if (T->Dimension == C->Dimension) {
1754 P = T->next;
1755 T->next = NULL;
1756 Polyhedron_Free(T);
1757 }
1758 }
1759
1760 Polyhedron *next = P->next;
1761 P->next = NULL;
1762 eres = barvinok_enumerate_ev_f(P, C, options);
1763 P->next = next;
1764
1765 if (P->next) {
1766 Polyhedron *Q;
1767 evalue *f;
1768
1769 for (Q = P->next; Q; Q = Q->next) {
1770 Polyhedron *next = Q->next;
1771 Q->next = NULL;
1772
1773 f = barvinok_enumerate_ev_f(Q, C, options);
1774 emul(f, eres);
1775 free_evalue_refs(f);
1776 free(f);
1777
1778 Q->next = next;
1779 }
1780 }
1781
1782 goto out;
1783 }
1784
1785 evalue* barvinok_enumerate_ev(Polyhedron *P, Polyhedron* C, unsigned MaxRays)
1786 {
1787 evalue *E;
1788 barvinok_options *options = barvinok_options_new_with_defaults();
1789 options->MaxRays = MaxRays;
1790 E = barvinok_enumerate_with_options(P, C, options);
1791 barvinok_options_free(options);
1792 return E;
1793 }
1794
1795 /* adapted from mpolyhedron_inflate in PolyLib */
1796 static Polyhedron *Polyhedron_Inflate(Polyhedron *P, unsigned nparam,
1797 unsigned MaxRays)
1798 {
1799 Value sum;
1800 int nvar = P->Dimension - nparam;
1801 Matrix *C = Polyhedron2Constraints(P);
1802 Polyhedron *P2;
1803
1804 value_init(sum);
1805 /* subtract the sum of the negative coefficients of each inequality */
1806 for (int i = 0; i < C->NbRows; ++i) {
1807 value_set_si(sum, 0);
1808 for (int j = 0; j < nvar; ++j)
1809 if (value_neg_p(C->p[i][1+j]))
1810 value_addto(sum, sum, C->p[i][1+j]);
1811 value_subtract(C->p[i][1+P->Dimension], C->p[i][1+P->Dimension], sum);
1812 }
1813 value_clear(sum);
1814 P2 = Constraints2Polyhedron(C, MaxRays);
1815 Matrix_Free(C);
1816 return P2;
1817 }
1818
1819 /* adapted from mpolyhedron_deflate in PolyLib */
1820 static Polyhedron *Polyhedron_Deflate(Polyhedron *P, unsigned nparam,
1821 unsigned MaxRays)
1822 {
1823 Value sum;
1824 int nvar = P->Dimension - nparam;
1825 Matrix *C = Polyhedron2Constraints(P);
1826 Polyhedron *P2;
1827
1828 value_init(sum);
1829 /* subtract the sum of the positive coefficients of each inequality */
1830 for (int i = 0; i < C->NbRows; ++i) {
1831 value_set_si(sum, 0);
1832 for (int j = 0; j < nvar; ++j)
1833 if (value_pos_p(C->p[i][1+j]))
1834 value_addto(sum, sum, C->p[i][1+j]);
1835 value_subtract(C->p[i][1+P->Dimension], C->p[i][1+P->Dimension], sum);
1836 }
1837 value_clear(sum);
1838 P2 = Constraints2Polyhedron(C, MaxRays);
1839 Matrix_Free(C);
1840 return P2;
1841 }
1842
1843 static evalue* barvinok_enumerate_ev_f(Polyhedron *P, Polyhedron* C,
1844 barvinok_options *options)
1845 {
1846 unsigned nparam = C->Dimension;
1847 bool pre_approx = options->polynomial_approximation >= BV_POLAPPROX_PRE_LOWER &&
1848 options->polynomial_approximation <= BV_POLAPPROX_PRE_APPROX;
1849
1850 if (P->Dimension - nparam == 1 && !pre_approx)
1851 return ParamLine_Length(P, C, options);
1852
1853 Param_Polyhedron *PP = NULL;
1854 Polyhedron *CEq = NULL, *pVD;
1855 Matrix *CT = NULL;
1856 Param_Domain *D, *next;
1857 Param_Vertices *V;
1858 evalue *eres;
1859 Polyhedron *Porig = P;
1860 Value det;
1861 Polyhedron *T;
1862
1863 if (options->polynomial_approximation == BV_POLAPPROX_PRE_UPPER)
1864 P = Polyhedron_Inflate(P, nparam, options->MaxRays);
1865 if (options->polynomial_approximation == BV_POLAPPROX_PRE_LOWER)
1866 P = Polyhedron_Deflate(P, nparam, options->MaxRays);
1867
1868 T = P;
1869 PP = Polyhedron2Param_SD(&T, C, options->MaxRays, &CEq, &CT);
1870 if (T != P && P != Porig)
1871 Polyhedron_Free(P);
1872 P = T;
1873
1874 if (isIdentity(CT)) {
1875 Matrix_Free(CT);
1876 CT = NULL;
1877 } else {
1878 assert(CT->NbRows != CT->NbColumns);
1879 if (CT->NbRows == 1) { // no more parameters
1880 eres = barvinok_enumerate_cst(P, CEq, options);
1881 out:
1882 if (CT)
1883 Matrix_Free(CT);
1884 if (PP)
1885 Param_Polyhedron_Free(PP);
1886 if (P != Porig)
1887 Polyhedron_Free(P);
1888
1889 return eres;
1890 }
1891 nparam = CT->NbRows - 1;
1892 }
1893
1894 if (pre_approx) {
1895 value_init(det);
1896 Polyhedron *T = P;
1897 Param_Polyhedron_Scale_Integer(PP, &T, &det, options->MaxRays);
1898 if (P != Porig)
1899 Polyhedron_Free(P);
1900 P = T;
1901 }
1902
1903 unsigned dim = P->Dimension - nparam;
1904
1905 ALLOC(evalue, eres);
1906 value_init(eres->d);
1907 value_set_si(eres->d, 0);
1908
1909 int nd;
1910 for (nd = 0, D=PP->D; D; ++nd, D=D->next);
1911 struct section { Polyhedron *D; evalue E; };
1912 section *s = new section[nd];
1913 Polyhedron **fVD = new Polyhedron_p[nd];
1914
1915 enumerator_base *et = NULL;
1916 try_again:
1917 if (et)
1918 delete et;
1919
1920 et = enumerator_base::create(P, dim, PP->nbV, options);
1921
1922 for(nd = 0, D=PP->D; D; D=next) {
1923 next = D->next;
1924
1925 Polyhedron *rVD = reduce_domain(D->Domain, CT, CEq, fVD, nd, options);
1926 if (!rVD)
1927 continue;
1928
1929 pVD = CT ? DomainImage(rVD,CT,options->MaxRays) : rVD;
1930
1931 value_init(s[nd].E.d);
1932 evalue_set_si(&s[nd].E, 0, 1);
1933 s[nd].D = rVD;
1934
1935 FORALL_PVertex_in_ParamPolyhedron(V,D,PP) // _i is internal counter
1936 if (!et->vE[_i])
1937 try {
1938 et->decompose_at(V, _i, options);
1939 } catch (OrthogonalException &e) {
1940 if (rVD != pVD)
1941 Domain_Free(pVD);
1942 for (; nd >= 0; --nd) {
1943 free_evalue_refs(&s[nd].E);
1944 Domain_Free(s[nd].D);
1945 Domain_Free(fVD[nd]);
1946 }
1947 goto try_again;
1948 }
1949 eadd(et->vE[_i] , &s[nd].E);
1950 END_FORALL_PVertex_in_ParamPolyhedron;
1951 evalue_range_reduction_in_domain(&s[nd].E, pVD);
1952
1953 if (CT)
1954 addeliminatedparams_evalue(&s[nd].E, CT);
1955 ++nd;
1956 if (rVD != pVD)
1957 Domain_Free(pVD);
1958 }
1959
1960 delete et;
1961 if (nd == 0)
1962 evalue_set_si(eres, 0, 1);
1963 else {
1964 eres->x.p = new_enode(partition, 2*nd, C->Dimension);
1965 for (int j = 0; j < nd; ++j) {
1966 EVALUE_SET_DOMAIN(eres->x.p->arr[2*j], s[j].D);
1967 value_clear(eres->x.p->arr[2*j+1].d);
1968 eres->x.p->arr[2*j+1] = s[j].E;
1969 Domain_Free(fVD[j]);
1970 }
1971 }
1972 delete [] s;
1973 delete [] fVD;
1974
1975 if (pre_approx) {
1976 evalue_div(eres, det);
1977 value_clear(det);
1978 }
1979
1980 if (CEq)
1981 Polyhedron_Free(CEq);
1982 goto out;
1983 }
1984
1985 Enumeration* barvinok_enumerate(Polyhedron *P, Polyhedron* C, unsigned MaxRays)
1986 {
1987 evalue *EP = barvinok_enumerate_ev(P, C, MaxRays);
1988
1989 return partition2enumeration(EP);
1990 }
1991
1992 static void SwapColumns(Value **V, int n, int i, int j)
1993 {
1994 for (int r = 0; r < n; ++r)
1995 value_swap(V[r][i], V[r][j]);
1996 }
1997
1998 static void SwapColumns(Polyhedron *P, int i, int j)
1999 {
2000 SwapColumns(P->Constraint, P->NbConstraints, i, j);
2001 SwapColumns(P->Ray, P->NbRays, i, j);
2002 }
2003
2004 /* Construct a constraint c from constraints l and u such that if
2005 * if constraint c holds then for each value of the other variables
2006 * there is at most one value of variable pos (position pos+1 in the constraints).
2007 *
2008 * Given a lower and an upper bound
2009 * n_l v_i + <c_l,x> + c_l >= 0
2010 * -n_u v_i + <c_u,x> + c_u >= 0
2011 * the constructed constraint is
2012 *
2013 * -(n_l<c_u,x> + n_u<c_l,x>) + (-n_l c_u - n_u c_l + n_l n_u - 1)
2014 *
2015 * which is then simplified to remove the content of the non-constant coefficients
2016 *
2017 * len is the total length of the constraints.
2018 * v is a temporary variable that can be used by this procedure
2019 */
2020 static void negative_test_constraint(Value *l, Value *u, Value *c, int pos,
2021 int len, Value *v)
2022 {
2023 value_oppose(*v, u[pos+1]);
2024 Vector_Combine(l+1, u+1, c+1, *v, l[pos+1], len-1);
2025 value_multiply(*v, *v, l[pos+1]);
2026 value_subtract(c[len-1], c[len-1], *v);
2027 value_set_si(*v, -1);
2028 Vector_Scale(c+1, c+1, *v, len-1);
2029 value_decrement(c[len-1], c[len-1]);
2030 ConstraintSimplify(c, c, len, v);
2031 }
2032
2033 static bool parallel_constraints(Value *l, Value *u, Value *c, int pos,
2034 int len)
2035 {
2036 bool parallel;
2037 Value g1;
2038 Value g2;
2039 value_init(g1);
2040 value_init(g2);
2041
2042 Vector_Gcd(&l[1+pos], len, &g1);
2043 Vector_Gcd(&u[1+pos], len, &g2);
2044 Vector_Combine(l+1+pos, u+1+pos, c+1, g2, g1, len);
2045 parallel = First_Non_Zero(c+1, len) == -1;
2046
2047 value_clear(g1);
2048 value_clear(g2);
2049
2050 return parallel;
2051 }
2052
2053 static void negative_test_constraint7(Value *l, Value *u, Value *c, int pos,
2054 int exist, int len, Value *v)
2055 {
2056 Value g;
2057 value_init(g);
2058
2059 Vector_Gcd(&u[1+pos], exist, v);
2060 Vector_Gcd(&l[1+pos], exist, &g);
2061 Vector_Combine(l+1, u+1, c+1, *v, g, len-1);
2062 value_multiply(*v, *v, g);
2063 value_subtract(c[len-1], c[len-1], *v);
2064 value_set_si(*v, -1);
2065 Vector_Scale(c+1, c+1, *v, len-1);
2066 value_decrement(c[len-1], c[len-1]);
2067 ConstraintSimplify(c, c, len, v);
2068
2069 value_clear(g);
2070 }
2071
2072 /* Turns a x + b >= 0 into a x + b <= -1
2073 *
2074 * len is the total length of the constraint.
2075 * v is a temporary variable that can be used by this procedure
2076 */
2077 static void oppose_constraint(Value *c, int len, Value *v)
2078 {
2079 value_set_si(*v, -1);
2080 Vector_Scale(c+1, c+1, *v, len-1);
2081 value_decrement(c[len-1], c[len-1]);
2082 }
2083
2084 /* Split polyhedron P into two polyhedra *pos and *neg, where
2085 * existential variable i has at most one solution for each
2086 * value of the other variables in *neg.
2087 *
2088 * The splitting is performed using constraints l and u.
2089 *
2090 * nvar: number of set variables
2091 * row: temporary vector that can be used by this procedure
2092 * f: temporary value that can be used by this procedure
2093 */
2094 static bool SplitOnConstraint(Polyhedron *P, int i, int l, int u,
2095 int nvar, int MaxRays, Vector *row, Value& f,
2096 Polyhedron **pos, Polyhedron **neg)
2097 {
2098 negative_test_constraint(P->Constraint[l], P->Constraint[u],
2099 row->p, nvar+i, P->Dimension+2, &f);
2100 *neg = AddConstraints(row->p, 1, P, MaxRays);
2101
2102 /* We found an independent, but useless constraint
2103 * Maybe we should detect this earlier and not
2104 * mark the variable as INDEPENDENT
2105 */
2106 if (emptyQ((*neg))) {
2107 Polyhedron_Free(*neg);
2108 return false;
2109 }
2110
2111 oppose_constraint(row->p, P->Dimension+2, &f);
2112 *pos = AddConstraints(row->p, 1, P, MaxRays);
2113
2114 if (emptyQ((*pos))) {
2115 Polyhedron_Free(*neg);
2116 Polyhedron_Free(*pos);
2117 return false;
2118 }
2119
2120 return true;
2121 }
2122
2123 /*
2124 * unimodularly transform P such that constraint r is transformed
2125 * into a constraint that involves only a single (the first)
2126 * existential variable
2127 *
2128 */
2129 static Polyhedron *rotate_along(Polyhedron *P, int r, int nvar, int exist,
2130 unsigned MaxRays)
2131 {
2132 Value g;
2133 value_init(g);
2134
2135 Vector *row = Vector_Alloc(exist);
2136 Vector_Copy(P->Constraint[r]+1+nvar, row->p, exist);
2137 Vector_Gcd(row->p, exist, &g);
2138 if (value_notone_p(g))
2139 Vector_AntiScale(row->p, row->p, g, exist);
2140 value_clear(g);
2141
2142 Matrix *M = unimodular_complete(row);
2143 Matrix *M2 = Matrix_Alloc(P->Dimension+1, P->Dimension+1);
2144 for (r = 0; r < nvar; ++r)
2145 value_set_si(M2->p[r][r], 1);
2146 for ( ; r < nvar+exist; ++r)
2147 Vector_Copy(M->p[r-nvar], M2->p[r]+nvar, exist);
2148 for ( ; r < P->Dimension+1; ++r)
2149 value_set_si(M2->p[r][r], 1);
2150 Polyhedron *T = Polyhedron_Image(P, M2, MaxRays);
2151
2152 Matrix_Free(M2);
2153 Matrix_Free(M);
2154 Vector_Free(row);
2155
2156 return T;
2157 }
2158
2159 /* Split polyhedron P into two polyhedra *pos and *neg, where
2160 * existential variable i has at most one solution for each
2161 * value of the other variables in *neg.
2162 *
2163 * If independent is set, then the two constraints on which the
2164 * split will be performed need to be independent of the other
2165 * existential variables.
2166 *
2167 * Return true if an appropriate split could be performed.
2168 *
2169 * nvar: number of set variables
2170 * exist: number of existential variables
2171 * row: temporary vector that can be used by this procedure
2172 * f: temporary value that can be used by this procedure
2173 */
2174 static bool SplitOnVar(Polyhedron *P, int i,
2175 int nvar, int exist, int MaxRays,
2176 Vector *row, Value& f, bool independent,
2177 Polyhedron **pos, Polyhedron **neg)
2178 {
2179 int j;
2180
2181 for (int l = P->NbEq; l < P->NbConstraints; ++l) {
2182 if (value_negz_p(P->Constraint[l][nvar+i+1]))
2183 continue;
2184
2185 if (independent) {
2186 for (j = 0; j < exist; ++j)
2187 if (j != i && value_notzero_p(P->Constraint[l][nvar+j+1]))
2188 break;
2189 if (j < exist)
2190 continue;
2191 }
2192
2193 for (int u = P->NbEq; u < P->NbConstraints; ++u) {
2194 if (value_posz_p(P->Constraint[u][nvar+i+1]))
2195 continue;
2196
2197 if (independent) {
2198 for (j = 0; j < exist; ++j)
2199 if (j != i && value_notzero_p(P->Constraint[u][nvar+j+1]))
2200 break;
2201 if (j < exist)
2202 continue;
2203 }
2204
2205 if (SplitOnConstraint(P, i, l, u, nvar, MaxRays, row, f, pos, neg)) {
2206 if (independent) {
2207 if (i != 0)
2208 SwapColumns(*neg, nvar+1, nvar+1+i);
2209 }
2210 return true;
2211 }
2212 }
2213 }
2214
2215 return false;
2216 }
2217
2218 static bool double_bound_pair(Polyhedron *P, int nvar, int exist,
2219 int i, int l1, int l2,
2220 Polyhedron **pos, Polyhedron **neg)
2221 {
2222 Value f;
2223 value_init(f);
2224 Vector *row = Vector_Alloc(P->Dimension+2);
2225 value_set_si(row->p[0], 1);
2226 value_oppose(f, P->Constraint[l1][nvar+i+1]);
2227 Vector_Combine(P->Constraint[l1]+1, P->Constraint[l2]+1,
2228 row->p+1,
2229 P->Constraint[l2][nvar+i+1], f,
2230 P->Dimension+1);
2231 ConstraintSimplify(row->p, row->p, P->Dimension+2, &f);
2232 *pos = AddConstraints(row->p, 1, P, 0);
2233 value_set_si(f, -1);
2234 Vector_Scale(row->p+1, row->p+1, f, P->Dimension+1);
2235 value_decrement(row->p[P->Dimension+1], row->p[P->Dimension+1]);
2236 *neg = AddConstraints(row->p, 1, P, 0);
2237 Vector_Free(row);
2238 value_clear(f);
2239
2240 return !emptyQ((*pos)) && !emptyQ((*neg));
2241 }
2242
2243 static bool double_bound(Polyhedron *P, int nvar, int exist,
2244 Polyhedron **pos, Polyhedron **neg)
2245 {
2246 for (int i = 0; i < exist; ++i) {
2247 int l1, l2;
2248 for (l1 = P->NbEq; l1 < P->NbConstraints; ++l1) {
2249 if (value_negz_p(P->Constraint[l1][nvar+i+1]))
2250 continue;
2251 for (l2 = l1 + 1; l2 < P->NbConstraints; ++l2) {
2252 if (value_negz_p(P->Constraint[l2][nvar+i+1]))
2253 continue;
2254 if (double_bound_pair(P, nvar, exist, i, l1, l2, pos, neg))
2255 return true;
2256 }
2257 }
2258 for (l1 = P->NbEq; l1 < P->NbConstraints; ++l1) {
2259 if (value_posz_p(P->Constraint[l1][nvar+i+1]))
2260 continue;
2261 if (l1 < P->NbConstraints)
2262 for (l2 = l1 + 1; l2 < P->NbConstraints; ++l2) {
2263 if (value_posz_p(P->Constraint[l2][nvar+i+1]))
2264 continue;
2265 if (double_bound_pair(P, nvar, exist, i, l1, l2, pos, neg))
2266 return true;
2267 }
2268 }
2269 return false;
2270 }
2271 return false;
2272 }
2273
2274 enum constraint {
2275 ALL_POS = 1 << 0,
2276 ONE_NEG = 1 << 1,
2277 INDEPENDENT = 1 << 2,
2278 ROT_NEG = 1 << 3
2279 };
2280
2281 static evalue* enumerate_or(Polyhedron *D,
2282 unsigned exist, unsigned nparam, barvinok_options *options)
2283 {
2284 #ifdef DEBUG_ER
2285 fprintf(stderr, "\nER: Or\n");
2286 #endif /* DEBUG_ER */
2287
2288 Polyhedron *N = D->next;
2289 D->next = 0;
2290 evalue *EP =
2291 barvinok_enumerate_e_with_options(D, exist, nparam, options);
2292 Polyhedron_Free(D);
2293
2294 for (D = N; D; D = N) {
2295 N = D->next;
2296 D->next = 0;
2297
2298 evalue *EN =
2299 barvinok_enumerate_e_with_options(D, exist, nparam, options);
2300
2301 eor(EN, EP);
2302 free_evalue_refs(EN);
2303 free(EN);
2304 Polyhedron_Free(D);
2305 }
2306
2307 reduce_evalue(EP);
2308
2309 return EP;
2310 }
2311
2312 static evalue* enumerate_sum(Polyhedron *P,
2313 unsigned exist, unsigned nparam, barvinok_options *options)
2314 {
2315 int nvar = P->Dimension - exist - nparam;
2316 int toswap = nvar < exist ? nvar : exist;
2317 for (int i = 0; i < toswap; ++i)
2318 SwapColumns(P, 1 + i, nvar+exist - i);
2319 nparam += nvar;
2320
2321 #ifdef DEBUG_ER
2322 fprintf(stderr, "\nER: Sum\n");
2323 #endif /* DEBUG_ER */
2324
2325 evalue *EP = barvinok_enumerate_e_with_options(P, exist, nparam, options);
2326
2327 evalue_split_domains_into_orthants(EP, options->MaxRays);
2328 reduce_evalue(EP);
2329 evalue_range_reduction(EP);
2330
2331 evalue_frac2floor2(EP, 1);
2332
2333 evalue *sum = esum(EP, nvar);
2334
2335 free_evalue_refs(EP);
2336 free(EP);
2337 EP = sum;
2338
2339 evalue_range_reduction(EP);
2340
2341 return EP;
2342 }
2343
2344 static evalue* split_sure(Polyhedron *P, Polyhedron *S,
2345 unsigned exist, unsigned nparam, barvinok_options *options)
2346 {
2347 int nvar = P->Dimension - exist - nparam;
2348
2349 Matrix *M = Matrix_Alloc(exist, S->Dimension+2);
2350 for (int i = 0; i < exist; ++i)
2351 value_set_si(M->p[i][nvar+i+1], 1);
2352 Polyhedron *O = S;
2353 S = DomainAddRays(S, M, options->MaxRays);
2354 Polyhedron_Free(O);
2355 Polyhedron *F = DomainAddRays(P, M, options->MaxRays);
2356 Polyhedron *D = DomainDifference(F, S, options->MaxRays);
2357 O = D;
2358 D = Disjoint_Domain(D, 0, options->MaxRays);
2359 Polyhedron_Free(F);
2360 Domain_Free(O);
2361 Matrix_Free(M);
2362
2363 M = Matrix_Alloc(P->Dimension+1-exist, P->Dimension+1);
2364 for (int j = 0; j < nvar; ++j)
2365 value_set_si(M->p[j][j], 1);
2366 for (int j = 0; j < nparam+1; ++j)
2367 value_set_si(M->p[nvar+j][nvar+exist+j], 1);
2368 Polyhedron *T = Polyhedron_Image(S, M, options->MaxRays);
2369 evalue *EP = barvinok_enumerate_e_with_options(T, 0, nparam, options);
2370 Polyhedron_Free(S);
2371 Polyhedron_Free(T);
2372 Matrix_Free(M);
2373
2374 for (Polyhedron *Q = D; Q; Q = Q->next) {
2375 Polyhedron *N = Q->next;
2376 Q->next = 0;
2377 T = DomainIntersection(P, Q, options->MaxRays);
2378 evalue *E = barvinok_enumerate_e_with_options(T, exist, nparam, options);
2379 eadd(E, EP);
2380 free_evalue_refs(E);
2381 free(E);
2382 Polyhedron_Free(T);
2383 Q->next = N;
2384 }
2385 Domain_Free(D);
2386 return EP;
2387 }
2388
2389 static evalue* enumerate_sure(Polyhedron *P,
2390 unsigned exist, unsigned nparam, barvinok_options *options)
2391 {
2392 int i;
2393 Polyhedron *S = P;
2394 int nvar = P->Dimension - exist - nparam;
2395 Value lcm;
2396 Value f;
2397 value_init(lcm);
2398 value_init(f);
2399
2400 for (i = 0; i < exist; ++i) {
2401 Matrix *M = Matrix_Alloc(S->NbConstraints, S->Dimension+2);
2402 int c = 0;
2403 value_set_si(lcm, 1);
2404 for (int j = 0; j < S->NbConstraints; ++j) {
2405 if (value_negz_p(S->Constraint[j][1+nvar+i]))
2406 continue;
2407 if (value_one_p(S->Constraint[j][1+nvar+i]))
2408 continue;
2409 value_lcm(lcm, S->Constraint[j][1+nvar+i], &lcm);
2410 }
2411
2412 for (int j = 0; j < S->NbConstraints; ++j) {
2413 if (value_negz_p(S->Constraint[j][1+nvar+i]))
2414 continue;
2415 if (value_one_p(S->Constraint[j][1+nvar+i]))
2416 continue;
2417 value_division(f, lcm, S->Constraint[j][1+nvar+i]);
2418 Vector_Scale(S->Constraint[j], M->p[c], f, S->Dimension+2);
2419 value_subtract(M->p[c][S->Dimension+1],
2420 M->p[c][S->Dimension+1],
2421 lcm);
2422 value_increment(M->p[c][S->Dimension+1],
2423 M->p[c][S->Dimension+1]);
2424 ++c;
2425 }
2426 Polyhedron *O = S;
2427 S = AddConstraints(M->p[0], c, S, options->MaxRays);
2428 if (O != P)
2429 Polyhedron_Free(O);
2430 Matrix_Free(M);
2431 if (emptyQ(S)) {
2432 Polyhedron_Free(S);
2433 value_clear(lcm);
2434 value_clear(f);
2435 return 0;
2436 }
2437 }
2438 value_clear(lcm);
2439 value_clear(f);
2440
2441 #ifdef DEBUG_ER
2442 fprintf(stderr, "\nER: Sure\n");
2443 #endif /* DEBUG_ER */
2444
2445 return split_sure(P, S, exist, nparam, options);
2446 }
2447
2448 static evalue* enumerate_sure2(Polyhedron *P,
2449 unsigned exist, unsigned nparam, barvinok_options *options)
2450 {
2451 int nvar = P->Dimension - exist - nparam;
2452 int r;
2453 for (r = 0; r < P->NbRays; ++r)
2454 if (value_one_p(P->Ray[r][0]) &&
2455 value_one_p(P->Ray[r][P->Dimension+1]))
2456 break;
2457
2458 if (r >= P->NbRays)
2459 return 0;
2460
2461 Matrix *M = Matrix_Alloc(nvar + 1 + nparam, P->Dimension+2);
2462 for (int i = 0; i < nvar; ++i)
2463 value_set_si(M->p[i][1+i], 1);
2464 for (int i = 0; i < nparam; ++i)
2465 value_set_si(M->p[i+nvar][1+nvar+exist+i], 1);
2466 Vector_Copy(P->Ray[r]+1+nvar, M->p[nvar+nparam]+1+nvar, exist);
2467 value_set_si(M->p[nvar+nparam][0], 1);
2468 value_set_si(M->p[nvar+nparam][P->Dimension+1], 1);
2469 Polyhedron * F = Rays2Polyhedron(M, options->MaxRays);
2470 Matrix_Free(M);
2471
2472 Polyhedron *I = DomainIntersection(F, P, options->MaxRays);
2473 Polyhedron_Free(F);
2474
2475 #ifdef DEBUG_ER
2476 fprintf(stderr, "\nER: Sure2\n");
2477 #endif /* DEBUG_ER */
2478
2479 return split_sure(P, I, exist, nparam, options);
2480 }
2481
2482 static evalue* enumerate_cyclic(Polyhedron *P,
2483 unsigned exist, unsigned nparam,
2484 evalue * EP, int r, int p, unsigned MaxRays)
2485 {
2486 int nvar = P->Dimension - exist - nparam;
2487
2488 /* If EP in its fractional maps only contains references
2489 * to the remainder parameter with appropriate coefficients
2490 * then we could in principle avoid adding existentially
2491 * quantified variables to the validity domains.
2492 * We'd have to replace the remainder by m { p/m }
2493 * and multiply with an appropriate factor that is one
2494 * only in the appropriate range.
2495 * This last multiplication can be avoided if EP
2496 * has a single validity domain with no (further)
2497 * constraints on the remainder parameter
2498 */
2499
2500 Matrix *CT = Matrix_Alloc(nparam+1, nparam+3);
2501 Matrix *M = Matrix_Alloc(1, 1+nparam+3);
2502 for (int j = 0; j < nparam; ++j)
2503 if (j != p)
2504 value_set_si(CT->p[j][j], 1);
2505 value_set_si(CT->p[p][nparam+1], 1);
2506 value_set_si(CT->p[nparam][nparam+2], 1);
2507 value_set_si(M->p[0][1+p], -1);
2508 value_absolute(M->p[0][1+nparam], P->Ray[0][1+nvar+exist+p]);
2509 value_set_si(M->p[0][1+nparam+1], 1);
2510 Polyhedron *CEq = Constraints2Polyhedron(M, 1);
2511 Matrix_Free(M);
2512 addeliminatedparams_enum(EP, CT, CEq, MaxRays, nparam);
2513 Polyhedron_Free(CEq);
2514 Matrix_Free(CT);
2515
2516 return EP;
2517 }
2518
2519 static void enumerate_vd_add_ray(evalue *EP, Matrix *Rays, unsigned MaxRays)
2520 {
2521 if (value_notzero_p(EP->d))
2522 return;
2523
2524 assert(EP->x.p->type == partition);
2525 assert(EP->x.p->pos == EVALUE_DOMAIN(EP->x.p->arr[0])->Dimension);
2526 for (int i = 0; i < EP->x.p->size/2; ++i) {
2527 Polyhedron *D = EVALUE_DOMAIN(EP->x.p->arr[2*i]);
2528 Polyhedron *N = DomainAddRays(D, Rays, MaxRays);
2529 EVALUE_SET_DOMAIN(EP->x.p->arr[2*i], N);
2530 Domain_Free(D);
2531 }
2532 }
2533
2534 static evalue* enumerate_line(Polyhedron *P,
2535 unsigned exist, unsigned nparam, barvinok_options *options)
2536 {
2537 if (P->NbBid == 0)
2538 return 0;
2539
2540 #ifdef DEBUG_ER
2541 fprintf(stderr, "\nER: Line\n");
2542 #endif /* DEBUG_ER */
2543
2544 int nvar = P->Dimension - exist - nparam;
2545 int i, j;
2546 for (i = 0; i < nparam; ++i)
2547 if (value_notzero_p(P->Ray[0][1+nvar+exist+i]))
2548 break;
2549 assert(i < nparam);
2550 for (j = i+1; j < nparam; ++j)
2551 if (value_notzero_p(P->Ray[0][1+nvar+exist+i]))
2552 break;
2553 assert(j >= nparam); // for now
2554
2555 Matrix *M = Matrix_Alloc(2, P->Dimension+2);
2556 value_set_si(M->p[0][0], 1);
2557 value_set_si(M->p[0][1+nvar+exist+i], 1);
2558 value_set_si(M->p[1][0], 1);
2559 value_set_si(M->p[1][1+nvar+exist+i], -1);
2560 value_absolute(M->p[1][1+P->Dimension], P->Ray[0][1+nvar+exist+i]);
2561 value_decrement(M->p[1][1+P->Dimension], M->p[1][1+P->Dimension]);
2562 Polyhedron *S = AddConstraints(M->p[0], 2, P, options->MaxRays);
2563 evalue *EP = barvinok_enumerate_e_with_options(S, exist, nparam, options);
2564 Polyhedron_Free(S);
2565 Matrix_Free(M);
2566
2567 return enumerate_cyclic(P, exist, nparam, EP, 0, i, options->MaxRays);
2568 }
2569
2570 static int single_param_pos(Polyhedron*P, unsigned exist, unsigned nparam,
2571 int r)
2572 {
2573 int nvar = P->Dimension - exist - nparam;
2574 if (First_Non_Zero(P->Ray[r]+1, nvar) != -1)
2575 return -1;
2576 int i = First_Non_Zero(P->Ray[r]+1+nvar+exist, nparam);
2577 if (i == -1)
2578 return -1;
2579 if (First_Non_Zero(P->Ray[r]+1+nvar+exist+1, nparam-i-1) != -1)
2580 return -1;
2581 return i;
2582 }
2583
2584 static evalue* enumerate_remove_ray(Polyhedron *P, int r,
2585 unsigned exist, unsigned nparam, barvinok_options *options)
2586 {
2587 #ifdef DEBUG_ER
2588 fprintf(stderr, "\nER: RedundantRay\n");
2589 #endif /* DEBUG_ER */
2590
2591 Value one;
2592 value_init(one);
2593 value_set_si(one, 1);
2594 int len = P->NbRays-1;
2595 Matrix *M = Matrix_Alloc(2 * len, P->Dimension+2);
2596 Vector_Copy(P->Ray[0], M->p[0], r * (P->Dimension+2));
2597 Vector_Copy(P->Ray[r+1], M->p[r], (len-r) * (P->Dimension+2));
2598 for (int j = 0; j < P->NbRays; ++j) {
2599 if (j == r)
2600 continue;
2601 Vector_Combine(P->Ray[j], P->Ray[r], M->p[len+j-(j>r)],
2602 one, P->Ray[j][P->Dimension+1], P->Dimension+2);
2603 }
2604
2605 P = Rays2Polyhedron(M, options->MaxRays);
2606 Matrix_Free(M);
2607 evalue *EP = barvinok_enumerate_e_with_options(P, exist, nparam, options);
2608 Polyhedron_Free(P);
2609 value_clear(one);
2610
2611 return EP;
2612 }
2613
2614 static evalue* enumerate_redundant_ray(Polyhedron *P,
2615 unsigned exist, unsigned nparam, barvinok_options *options)
2616 {
2617 assert(P->NbBid == 0);
2618 int nvar = P->Dimension - exist - nparam;
2619 Value m;
2620 value_init(m);
2621
2622 for (int r = 0; r < P->NbRays; ++r) {
2623 if (value_notzero_p(P->Ray[r][P->Dimension+1]))
2624 continue;
2625 int i1 = single_param_pos(P, exist, nparam, r);
2626 if (i1 == -1)
2627 continue;
2628 for (int r2 = r+1; r2 < P->NbRays; ++r2) {
2629 if (value_notzero_p(P->Ray[r2][P->Dimension+1]))
2630 continue;
2631 int i2 = single_param_pos(P, exist, nparam, r2);
2632 if (i2 == -1)
2633 continue;
2634 if (i1 != i2)
2635 continue;
2636
2637 value_division(m, P->Ray[r][1+nvar+exist+i1],
2638 P->Ray[r2][1+nvar+exist+i1]);
2639 value_multiply(m, m, P->Ray[r2][1+nvar+exist+i1]);
2640 /* r2 divides r => r redundant */
2641 if (value_eq(m, P->Ray[r][1+nvar+exist+i1])) {
2642 value_clear(m);
2643 return enumerate_remove_ray(P, r, exist, nparam, options);
2644 }
2645
2646 value_division(m, P->Ray[r2][1+nvar+exist+i1],
2647 P->Ray[r][1+nvar+exist+i1]);
2648 value_multiply(m, m, P->Ray[r][1+nvar+exist+i1]);
2649 /* r divides r2 => r2 redundant */
2650 if (value_eq(m, P->Ray[r2][1+nvar+exist+i1])) {
2651 value_clear(m);
2652 return enumerate_remove_ray(P, r2, exist, nparam, options);
2653 }
2654 }
2655 }
2656 value_clear(m);
2657 return 0;
2658 }
2659
2660 static Polyhedron *upper_bound(Polyhedron *P,
2661 int pos, Value *max, Polyhedron **R)
2662 {
2663 Value v;
2664 int r;
2665 value_init(v);
2666
2667 *R = 0;
2668 Polyhedron *N;
2669 Polyhedron *B = 0;
2670 for (Polyhedron *Q = P; Q; Q = N) {
2671 N = Q->next;
2672 for (r = 0; r < P->NbRays; ++r) {
2673 if (value_zero_p(P->Ray[r][P->Dimension+1]) &&
2674 value_pos_p(P->Ray[r][1+pos]))
2675 break;
2676 }
2677 if (r < P->NbRays) {
2678 Q->next = *R;
2679 *R = Q;
2680 continue;
2681 } else {
2682 Q->next = B;
2683 B = Q;
2684 }
2685 for (r = 0; r < P->NbRays; ++r) {
2686 if (value_zero_p(P->Ray[r][P->Dimension+1]))
2687 continue;
2688 mpz_fdiv_q(v, P->Ray[r][1+pos], P->Ray[r][1+P->Dimension]);
2689 if ((!Q->next && r == 0) || value_gt(v, *max))
2690 value_assign(*max, v);
2691 }
2692 }
2693 value_clear(v);
2694 return B;
2695 }
2696
2697 static evalue* enumerate_ray(Polyhedron *P,
2698 unsigned exist, unsigned nparam, barvinok_options *options)
2699 {
2700 assert(P->NbBid == 0);
2701 int nvar = P->Dimension - exist - nparam;
2702
2703 int r;
2704 for (r = 0; r < P->NbRays; ++r)
2705 if (value_zero_p(P->Ray[r][P->Dimension+1]))
2706 break;
2707 if (r >= P->NbRays)
2708 return 0;
2709
2710 int r2;
2711 for (r2 = r+1; r2 < P->NbRays; ++r2)
2712 if (value_zero_p(P->Ray[r2][P->Dimension+1]))
2713 break;
2714 if (r2 < P->NbRays) {
2715 if (nvar > 0)
2716 return enumerate_sum(P, exist, nparam, options);
2717 }
2718
2719 #ifdef DEBUG_ER
2720 fprintf(stderr, "\nER: Ray\n");
2721 #endif /* DEBUG_ER */
2722
2723 Value m;
2724 Value one;
2725 value_init(m);
2726 value_init(one);
2727 value_set_si(one, 1);
2728 int i = single_param_pos(P, exist, nparam, r);
2729 assert(i != -1); // for now;
2730
2731 Matrix *M = Matrix_Alloc(P->NbRays, P->Dimension+2);
2732 for (int j = 0; j < P->NbRays; ++j) {
2733 Vector_Combine(P->Ray[j], P->Ray[r], M->p[j],
2734 one, P->Ray[j][P->Dimension+1], P->Dimension+2);
2735 }
2736 Polyhedron *S = Rays2Polyhedron(M, options->MaxRays);
2737 Matrix_Free(M);
2738 Polyhedron *D = DomainDifference(P, S, options->MaxRays);
2739 Polyhedron_Free(S);
2740 // Polyhedron_Print(stderr, P_VALUE_FMT, D);
2741 assert(value_pos_p(P->Ray[r][1+nvar+exist+i])); // for now
2742 Polyhedron *R;
2743 D = upper_bound(D, nvar+exist+i, &m, &R);
2744 assert(D);
2745 Domain_Free(D);
2746
2747 M = Matrix_Alloc(2, P->Dimension+2);
2748 value_set_si(M->p[0][0], 1);
2749 value_set_si(M->p[1][0], 1);
2750 value_set_si(M->p[0][1+nvar+exist+i], -1);
2751 value_set_si(M->p[1][1+nvar+exist+i], 1);
2752 value_assign(M->p[0][1+P->Dimension], m);
2753 value_oppose(M->p[1][1+P->Dimension], m);
2754 value_addto(M->p[1][1+P->Dimension], M->p[1][1+P->Dimension],
2755 P->Ray[r][1+nvar+exist+i]);
2756 value_decrement(M->p[1][1+P->Dimension], M->p[1][1+P->Dimension]);
2757 // Matrix_Print(stderr, P_VALUE_FMT, M);
2758 D = AddConstraints(M->p[0], 2, P, options->MaxRays);
2759 // Polyhedron_Print(stderr, P_VALUE_FMT, D);
2760 value_subtract(M->p[0][1+P->Dimension], M->p[0][1+P->Dimension],
2761 P->Ray[r][1+nvar+exist+i]);
2762 // Matrix_Print(stderr, P_VALUE_FMT, M);
2763 S = AddConstraints(M->p[0], 1, P, options->MaxRays);
2764 // Polyhedron_Print(stderr, P_VALUE_FMT, S);
2765 Matrix_Free(M);
2766
2767 evalue *EP = barvinok_enumerate_e_with_options(D, exist, nparam, options);
2768 Polyhedron_Free(D);
2769 value_clear(one);
2770 value_clear(m);
2771
2772 if (value_notone_p(P->Ray[r][1+nvar+exist+i]))
2773 EP = enumerate_cyclic(P, exist, nparam, EP, r, i, options->MaxRays);
2774 else {
2775 M = Matrix_Alloc(1, nparam+2);
2776 value_set_si(M->p[0][0], 1);
2777 value_set_si(M->p[0][1+i], 1);
2778 enumerate_vd_add_ray(EP, M, options->MaxRays);
2779 Matrix_Free(M);
2780 }
2781
2782 if (!emptyQ(S)) {
2783 evalue *E = barvinok_enumerate_e_with_options(S, exist, nparam, options);
2784 eadd(E, EP);
2785 free_evalue_refs(E);
2786 free(E);
2787 }
2788 Polyhedron_Free(S);
2789
2790 if (R) {
2791 assert(nvar == 0);
2792 evalue *ER = enumerate_or(R, exist, nparam, options);
2793 eor(ER, EP);
2794 free_evalue_refs(ER);
2795 free(ER);
2796 }
2797
2798 return EP;
2799 }
2800
2801 static evalue* enumerate_vd(Polyhedron **PA,
2802 unsigned exist, unsigned nparam, barvinok_options *options)
2803 {
2804 Polyhedron *P = *PA;
2805 int nvar = P->Dimension - exist - nparam;
2806 Param_Polyhedron *PP = NULL;
2807 Polyhedron *C = Universe_Polyhedron(nparam);
2808 Polyhedron *CEq;
2809 Matrix *CT;
2810 Polyhedron *PR = P;
2811 PP = Polyhedron2Param_SimplifiedDomain(&PR,C, options->MaxRays,&CEq,&CT);
2812 Polyhedron_Free(C);
2813
2814 int nd;
2815 Param_Domain *D, *last;
2816 Value c;
2817 value_init(c);
2818 for (nd = 0, D=PP->D; D; D=D->next, ++nd)
2819 ;
2820
2821 Polyhedron **VD = new Polyhedron_p[nd];
2822 Polyhedron **fVD = new Polyhedron_p[nd];
2823 for(nd = 0, D=PP->D; D; D=D->next) {
2824 Polyhedron *rVD = reduce_domain(D->Domain, CT, CEq, fVD, nd, options);
2825 if (!rVD)
2826 continue;
2827
2828 VD[nd++] = rVD;
2829 last = D;
2830 }
2831
2832 evalue *EP = 0;
2833
2834 if (nd == 0)
2835 EP = evalue_zero();
2836
2837 /* This doesn't seem to have any effect */
2838 if (nd == 1) {
2839 Polyhedron *CA = align_context(VD[0], P->Dimension, options->MaxRays);
2840 Polyhedron *O = P;
2841 P = DomainIntersection(P, CA, options->MaxRays);
2842 if (O != *PA)
2843 Polyhedron_Free(O);
2844 Polyhedron_Free(CA);
2845 if (emptyQ(P))
2846 EP = evalue_zero();
2847 }
2848
2849 if (!EP && CT->NbColumns != CT->NbRows) {
2850 Polyhedron *CEqr = DomainImage(CEq, CT, options->MaxRays);
2851 Polyhedron *CA = align_context(CEqr, PR->Dimension, options->MaxRays);
2852 Polyhedron *I = DomainIntersection(PR, CA, options->MaxRays);
2853 Polyhedron_Free(CEqr);
2854 Polyhedron_Free(CA);
2855 #ifdef DEBUG_ER
2856 fprintf(stderr, "\nER: Eliminate\n");
2857 #endif /* DEBUG_ER */
2858 nparam -= CT->NbColumns - CT->NbRows;
2859 EP = barvinok_enumerate_e_with_options(I, exist, nparam, options);
2860 nparam += CT->NbColumns - CT->NbRows;
2861 addeliminatedparams_enum(EP, CT, CEq, options->MaxRays, nparam);
2862 Polyhedron_Free(I);
2863 }
2864 if (PR != *PA)
2865 Polyhedron_Free(PR);
2866 PR = 0;
2867
2868 if (!EP && nd > 1) {
2869 #ifdef DEBUG_ER
2870 fprintf(stderr, "\nER: VD\n");
2871 #endif /* DEBUG_ER */
2872 for (int i = 0; i < nd; ++i) {
2873 Polyhedron *CA = align_context(VD[i], P->Dimension, options->MaxRays);
2874 Polyhedron *I = DomainIntersection(P, CA, options->MaxRays);
2875
2876 if (i == 0)
2877 EP = barvinok_enumerate_e_with_options(I, exist, nparam, options);
2878 else {
2879 evalue *E = barvinok_enumerate_e_with_options(I, exist, nparam,
2880 options);
2881 eadd(E, EP);
2882 free_evalue_refs(E);
2883 free(E);
2884 }
2885 Polyhedron_Free(I);
2886 Polyhedron_Free(CA);
2887 }
2888 }
2889
2890 for (int i = 0; i < nd; ++i) {
2891 Polyhedron_Free(VD[i]);
2892 Polyhedron_Free(fVD[i]);
2893 }
2894 delete [] VD;
2895 delete [] fVD;
2896 value_clear(c);
2897
2898 if (!EP && nvar == 0) {
2899 Value f;
2900 value_init(f);
2901 Param_Vertices *V, *V2;
2902 Matrix* M = Matrix_Alloc(1, P->Dimension+2);
2903
2904 FORALL_PVertex_in_ParamPolyhedron(V, last, PP) {
2905 bool found = false;
2906 FORALL_PVertex_in_ParamPolyhedron(V2, last, PP) {
2907 if (V == V2) {
2908 found = true;
2909 continue;
2910 }
2911 if (!found)
2912 continue;
2913 for (int i = 0; i < exist; ++i) {
2914 value_oppose(f, V->Vertex->p[i][nparam+1]);
2915 Vector_Combine(V->Vertex->p[i],
2916 V2->Vertex->p[i],
2917 M->p[0] + 1 + nvar + exist,
2918 V2->Vertex->p[i][nparam+1],
2919 f,
2920 nparam+1);
2921 int j;
2922 for (j = 0; j < nparam; ++j)
2923 if (value_notzero_p(M->p[0][1+nvar+exist+j]))
2924 break;
2925 if (j >= nparam)
2926 continue;
2927 ConstraintSimplify(M->p[0], M->p[0],
2928 P->Dimension+2, &f);
2929 value_set_si(M->p[0][0], 0);
2930 Polyhedron *para = AddConstraints(M->p[0], 1, P,
2931 options->MaxRays);
2932 if (emptyQ(para)) {
2933 Polyhedron_Free(para);
2934 continue;
2935 }
2936 Polyhedron *pos, *neg;
2937 value_set_si(M->p[0][0], 1);
2938 value_decrement(M->p[0][P->Dimension+1],
2939 M->p[0][P->Dimension+1]);
2940 neg = AddConstraints(M->p[0], 1, P, options->MaxRays);
2941 value_set_si(f, -1);
2942 Vector_Scale(M->p[0]+1, M->p[0]+1, f,
2943 P->Dimension+1);
2944 value_decrement(M->p[0][P->Dimension+1],
2945 M->p[0][P->Dimension+1]);
2946 value_decrement(M->p[0][P->Dimension+1],
2947 M->p[0][P->Dimension+1]);
2948 pos = AddConstraints(M->p[0], 1, P, options->MaxRays);
2949 if (emptyQ(neg) && emptyQ(pos)) {
2950 Polyhedron_Free(para);
2951 Polyhedron_Free(pos);
2952 Polyhedron_Free(neg);
2953 continue;
2954 }
2955 #ifdef DEBUG_ER
2956 fprintf(stderr, "\nER: Order\n");
2957 #endif /* DEBUG_ER */
2958 EP = barvinok_enumerate_e_with_options(para, exist, nparam,
2959 options);
2960 evalue *E;
2961 if (!emptyQ(pos)) {
2962 E = barvinok_enumerate_e_with_options(pos, exist, nparam,
2963 options);
2964 eadd(E, EP);
2965 free_evalue_refs(E);
2966 free(E);
2967 }
2968 if (!emptyQ(neg)) {
2969 E = barvinok_enumerate_e_with_options(neg, exist, nparam,
2970 options);
2971 eadd(E, EP);
2972 free_evalue_refs(E);
2973 free(E);
2974 }
2975 Polyhedron_Free(para);
2976 Polyhedron_Free(pos);
2977 Polyhedron_Free(neg);
2978 break;
2979 }
2980 if (EP)
2981 break;
2982 } END_FORALL_PVertex_in_ParamPolyhedron;
2983 if (EP)
2984 break;
2985 } END_FORALL_PVertex_in_ParamPolyhedron;
2986
2987 if (!EP) {
2988 /* Search for vertex coordinate to split on */
2989 /* First look for one independent of the parameters */
2990 FORALL_PVertex_in_ParamPolyhedron(V, last, PP) {
2991 for (int i = 0; i < exist; ++i) {
2992 int j;
2993 for (j = 0; j < nparam; ++j)
2994 if (value_notzero_p(V->Vertex->p[i][j]))
2995 break;
2996 if (j < nparam)
2997 continue;
2998 value_set_si(M->p[0][0], 1);
2999 Vector_Set(M->p[0]+1, 0, nvar+exist);
3000 Vector_Copy(V->Vertex->p[i],
3001 M->p[0] + 1 + nvar + exist, nparam+1);
3002 value_oppose(M->p[0][1+nvar+i],
3003 V->Vertex->p[i][nparam+1]);
3004
3005 Polyhedron *pos, *neg;
3006 value_set_si(M->p[0][0], 1);
3007 value_decrement(M->p[0][P->Dimension+1],
3008 M->p[0][P->Dimension+1]);
3009 neg = AddConstraints(M->p[0], 1, P, options->MaxRays);
3010 value_set_si(f, -1);
3011 Vector_Scale(M->p[0]+1, M->p[0]+1, f,
3012 P->Dimension+1);
3013 value_decrement(M->p[0][P->Dimension+1],
3014 M->p[0][P->Dimension+1]);
3015 value_decrement(M->p[0][P->Dimension+1],
3016 M->p[0][P->Dimension+1]);
3017 pos = AddConstraints(M->p[0], 1, P, options->MaxRays);
3018 if (emptyQ(neg) || emptyQ(pos)) {
3019 Polyhedron_Free(pos);
3020 Polyhedron_Free(neg);
3021 continue;
3022 }
3023 Polyhedron_Free(pos);
3024 value_increment(M->p[0][P->Dimension+1],
3025 M->p[0][P->Dimension+1]);
3026 pos = AddConstraints(M->p[0], 1, P, options->MaxRays);
3027 #ifdef DEBUG_ER
3028 fprintf(stderr, "\nER: Vertex\n");
3029 #endif /* DEBUG_ER */
3030 pos->next = neg;
3031 EP = enumerate_or(pos, exist, nparam, options);
3032 break;
3033 }
3034 if (EP)
3035 break;
3036 } END_FORALL_PVertex_in_ParamPolyhedron;
3037 }
3038
3039 if (!EP) {
3040 /* Search for vertex coordinate to split on */
3041 /* Now look for one that depends on the parameters */
3042 FORALL_PVertex_in_ParamPolyhedron(V, last, PP) {
3043 for (int i = 0; i < exist; ++i) {
3044 value_set_si(M->p[0][0], 1);
3045 Vector_Set(M->p[0]+1, 0, nvar+exist);
3046 Vector_Copy(V->Vertex->p[i],
3047 M->p[0] + 1 + nvar + exist, nparam+1);
3048 value_oppose(M->p[0][1+nvar+i],
3049 V->Vertex->p[i][nparam+1]);
3050
3051 Polyhedron *pos, *neg;
3052 value_set_si(M->p[0][0], 1);
3053 value_decrement(M->p[0][P->Dimension+1],
3054 M->p[0][P->Dimension+1]);
3055 neg = AddConstraints(M->p[0], 1, P, options->MaxRays);
3056 value_set_si(f, -1);
3057 Vector_Scale(M->p[0]+1, M->p[0]+1, f,
3058 P->Dimension+1);
3059 value_decrement(M->p[0][P->Dimension+1],
3060 M->p[0][P->Dimension+1]);
3061 value_decrement(M->p[0][P->Dimension+1],
3062 M->p[0][P->Dimension+1]);
3063 pos = AddConstraints(M->p[0], 1, P, options->MaxRays);
3064 if (emptyQ(neg) || emptyQ(pos)) {
3065 Polyhedron_Free(pos);
3066 Polyhedron_Free(neg);
3067 continue;
3068 }
3069 Polyhedron_Free(pos);
3070 value_increment(M->p[0][P->Dimension+1],
3071 M->p[0][P->Dimension+1]);
3072 pos = AddConstraints(M->p[0], 1, P, options->MaxRays);
3073 #ifdef DEBUG_ER
3074 fprintf(stderr, "\nER: ParamVertex\n");
3075 #endif /* DEBUG_ER */
3076 pos->next = neg;
3077 EP = enumerate_or(pos, exist, nparam, options);
3078 break;
3079 }
3080 if (EP)
3081 break;
3082 } END_FORALL_PVertex_in_ParamPolyhedron;
3083 }
3084
3085 Matrix_Free(M);
3086 value_clear(f);
3087 }
3088
3089 if (CEq)
3090 Polyhedron_Free(CEq);
3091 if (CT)
3092 Matrix_Free(CT);
3093 if (PP)
3094 Param_Polyhedron_Free(PP);
3095 *PA = P;
3096
3097 return EP;
3098 }
3099
3100 evalue* barvinok_enumerate_pip(Polyhedron *P, unsigned exist, unsigned nparam,
3101 unsigned MaxRays)
3102 {
3103 evalue *E;
3104 barvinok_options *options = barvinok_options_new_with_defaults();
3105 options->MaxRays = MaxRays;
3106 E = barvinok_enumerate_pip_with_options(P, exist, nparam, options);
3107 barvinok_options_free(options);
3108 return E;
3109 }
3110
3111 #ifndef HAVE_PIPLIB
3112 evalue *barvinok_enumerate_pip_with_options(Polyhedron *P,
3113 unsigned exist, unsigned nparam, struct barvinok_options *options)
3114 {
3115 return 0;
3116 }
3117 #else
3118 evalue *barvinok_enumerate_pip_with_options(Polyhedron *P,
3119 unsigned exist, unsigned nparam, struct barvinok_options *options)
3120 {
3121 int nvar = P->Dimension - exist - nparam;
3122 evalue *EP = evalue_zero();
3123 Polyhedron *Q, *N;
3124
3125 #ifdef DEBUG_ER
3126 fprintf(stderr, "\nER: PIP\n");
3127 #endif /* DEBUG_ER */
3128
3129 Polyhedron *D = pip_projectout(P, nvar, exist, nparam);
3130 for (Q = D; Q; Q = N) {
3131 N = Q->next;
3132 Q->next = 0;
3133 evalue *E;
3134 exist = Q->Dimension - nvar - nparam;
3135 E = barvinok_enumerate_e_with_options(Q, exist, nparam, options);
3136 Polyhedron_Free(Q);
3137 eadd(E, EP);
3138 free_evalue_refs(E);
3139 free(E);
3140 }
3141
3142 return EP;
3143 }
3144 #endif
3145
3146
3147 static bool is_single(Value *row, int pos, int len)
3148 {
3149 return First_Non_Zero(row, pos) == -1 &&
3150 First_Non_Zero(row+pos+1, len-pos-1) == -1;
3151 }
3152
3153 static evalue* barvinok_enumerate_e_r(Polyhedron *P,
3154 unsigned exist, unsigned nparam, barvinok_options *options);
3155
3156 #ifdef DEBUG_ER
3157 static int er_level = 0;
3158
3159 evalue* barvinok_enumerate_e_with_options(Polyhedron *P,
3160 unsigned exist, unsigned nparam, barvinok_options *options)
3161 {
3162 fprintf(stderr, "\nER: level %i\n", er_level);
3163
3164 Polyhedron_PrintConstraints(stderr, P_VALUE_FMT, P);
3165 fprintf(stderr, "\nE %d\nP %d\n", exist, nparam);
3166 ++er_level;
3167 P = DomainConstraintSimplify(Polyhedron_Copy(P), options->MaxRays);
3168 evalue *EP = barvinok_enumerate_e_r(P, exist, nparam, options);
3169 Polyhedron_Free(P);
3170 --er_level;
3171 return EP;
3172 }
3173 #else
3174 evalue* barvinok_enumerate_e_with_options(Polyhedron *P,
3175 unsigned exist, unsigned nparam, barvinok_options *options)
3176 {
3177 P = DomainConstraintSimplify(Polyhedron_Copy(P), options->MaxRays);
3178 evalue *EP = barvinok_enumerate_e_r(P, exist, nparam, options);
3179 Polyhedron_Free(P);
3180 return EP;
3181 }
3182 #endif
3183
3184 evalue* barvinok_enumerate_e(Polyhedron *P, unsigned exist, unsigned nparam,
3185 unsigned MaxRays)
3186 {
3187 evalue *E;
3188 barvinok_options *options = barvinok_options_new_with_defaults();
3189 options->MaxRays = MaxRays;
3190 E = barvinok_enumerate_e_with_options(P, exist, nparam, options);
3191 barvinok_options_free(options);
3192 return E;
3193 }
3194
3195 static evalue* barvinok_enumerate_e_r(Polyhedron *P,
3196 unsigned exist, unsigned nparam, barvinok_options *options)
3197 {
3198 if (exist == 0) {
3199 Polyhedron *U = Universe_Polyhedron(nparam);
3200 evalue *EP = barvinok_enumerate_with_options(P, U, options);
3201 //char *param_name[] = {"P", "Q", "R", "S", "T" };
3202 //print_evalue(stdout, EP, param_name);
3203 Polyhedron_Free(U);
3204 return EP;
3205 }
3206
3207 int nvar = P->Dimension - exist - nparam;
3208 int len = P->Dimension + 2;
3209
3210 /* for now */
3211 POL_ENSURE_FACETS(P);
3212 POL_ENSURE_VERTICES(P);
3213
3214 if (emptyQ(P))
3215 return evalue_zero();
3216
3217 if (nvar == 0 && nparam == 0) {
3218 evalue *EP = evalue_zero();
3219 barvinok_count_with_options(P, &EP->x.n, options);
3220 if (value_pos_p(EP->x.n))
3221 value_set_si(EP->x.n, 1);
3222 return EP;
3223 }
3224
3225 int r;
3226 for (r = 0; r < P->NbRays; ++r)
3227 if (value_zero_p(P->Ray[r][0]) ||
3228 value_zero_p(P->Ray[r][P->Dimension+1])) {
3229 int i;
3230 for (i = 0; i < nvar; ++i)
3231 if (value_notzero_p(P->Ray[r][i+1]))
3232 break;
3233 if (i >= nvar)
3234 continue;
3235 for (i = nvar + exist; i < nvar + exist + nparam; ++i)
3236 if (value_notzero_p(P->Ray[r][i+1]))
3237 break;
3238 if (i >= nvar + exist + nparam)
3239 break;
3240 }
3241 if (r < P->NbRays) {
3242 evalue *EP = evalue_zero();
3243 value_set_si(EP->x.n, -1);
3244 return EP;
3245 }
3246
3247 int first;
3248 for (r = 0; r < P->NbEq; ++r)
3249 if ((first = First_Non_Zero(P->Constraint[r]+1+nvar, exist)) != -1)
3250 break;
3251 if (r < P->NbEq) {
3252 if (First_Non_Zero(P->Constraint[r]+1+nvar+first+1,
3253 exist-first-1) != -1) {
3254 Polyhedron *T = rotate_along(P, r, nvar, exist, options->MaxRays);
3255 #ifdef DEBUG_ER
3256 fprintf(stderr, "\nER: Equality\n");
3257 #endif /* DEBUG_ER */
3258 evalue *EP = barvinok_enumerate_e_with_options(T, exist-1, nparam,
3259 options);
3260 Polyhedron_Free(T);
3261 return EP;
3262 } else {
3263 #ifdef DEBUG_ER
3264 fprintf(stderr, "\nER: Fixed\n");
3265 #endif /* DEBUG_ER */
3266 if (first == 0)
3267 return barvinok_enumerate_e_with_options(P, exist-1, nparam,
3268 options);
3269 else {
3270 Polyhedron *T = Polyhedron_Copy(P);
3271 SwapColumns(T, nvar+1, nvar+1+first);
3272 evalue *EP = barvinok_enumerate_e_with_options(T, exist-1, nparam,
3273 options);
3274 Polyhedron_Free(T);
3275 return EP;
3276 }
3277 }
3278 }
3279
3280 Vector *row = Vector_Alloc(len);
3281 value_set_si(row->p[0], 1);
3282
3283 Value f;
3284 value_init(f);
3285
3286 enum constraint* info = new constraint[exist];
3287 for (int i = 0; i < exist; ++i) {
3288 info[i] = ALL_POS;
3289 for (int l = P->NbEq; l < P->NbConstraints; ++l) {
3290 if (value_negz_p(P->Constraint[l][nvar+i+1]))
3291 continue;
3292 bool l_parallel = is_single(P->Constraint[l]+nvar+1, i, exist);
3293 for (int u = P->NbEq; u < P->NbConstraints; ++u) {
3294 if (value_posz_p(P->Constraint[u][nvar+i+1]))
3295 continue;
3296 bool lu_parallel = l_parallel ||
3297 is_single(P->Constraint[u]+nvar+1, i, exist);
3298 value_oppose(f, P->Constraint[u][nvar+i+1]);
3299 Vector_Combine(P->Constraint[l]+1, P->Constraint[u]+1, row->p+1,
3300 f, P->Constraint[l][nvar+i+1], len-1);
3301 if (!(info[i] & INDEPENDENT)) {
3302 int j;
3303 for (j = 0; j < exist; ++j)
3304 if (j != i && value_notzero_p(row->p[nvar+j+1]))
3305 break;
3306 if (j == exist) {
3307 //printf("independent: i: %d, l: %d, u: %d\n", i, l, u);
3308 info[i] = (constraint)(info[i] | INDEPENDENT);
3309 }
3310 }
3311 if (info[i] & ALL_POS) {
3312 value_addto(row->p[len-1], row->p[len-1],
3313 P->Constraint[l][nvar+i+1]);
3314 value_addto(row->p[len-1], row->p[len-1], f);
3315 value_multiply(f, f, P->Constraint[l][nvar+i+1]);
3316 value_subtract(row->p[len-1], row->p[len-1], f);
3317 value_decrement(row->p[len-1], row->p[len-1]);
3318 ConstraintSimplify(row->p, row->p, len, &f);
3319 value_set_si(f, -1);
3320 Vector_Scale(row->p+1, row->p+1, f, len-1);
3321 value_decrement(row->p[len-1], row->p[len-1]);
3322 Polyhedron *T = AddConstraints(row->p, 1, P, options->MaxRays);
3323 if (!emptyQ(T)) {
3324 //printf("not all_pos: i: %d, l: %d, u: %d\n", i, l, u);
3325 info[i] = (constraint)(info[i] ^ ALL_POS);
3326 }
3327 //puts("pos remainder");
3328 //Polyhedron_Print(stdout, P_VALUE_FMT, T);
3329 Polyhedron_Free(T);
3330 }
3331 if (!(info[i] & ONE_NEG)) {
3332 if (lu_parallel) {
3333 negative_test_constraint(P->Constraint[l],
3334 P->Constraint[u],
3335 row->p, nvar+i, len, &f);
3336 oppose_constraint(row->p, len, &f);
3337 Polyhedron *T = AddConstraints(row->p, 1, P,
3338 options->MaxRays);
3339 if (emptyQ(T)) {
3340 //printf("one_neg i: %d, l: %d, u: %d\n", i, l, u);
3341 info[i] = (constraint)(info[i] | ONE_NEG);
3342 }
3343 //puts("neg remainder");
3344 //Polyhedron_Print(stdout, P_VALUE_FMT, T);
3345 Polyhedron_Free(T);
3346 } else if (!(info[i] & ROT_NEG)) {
3347 if (parallel_constraints(P->Constraint[l],
3348 P->Constraint[u],
3349 row->p, nvar, exist)) {
3350 negative_test_constraint7(P->Constraint[l],
3351 P->Constraint[u],
3352 row->p, nvar, exist,
3353 len, &f);
3354 oppose_constraint(row->p, len, &f);
3355 Polyhedron *T = AddConstraints(row->p, 1, P,
3356 options->MaxRays);
3357 if (emptyQ(T)) {
3358 // printf("rot_neg i: %d, l: %d, u: %d\n", i, l, u);
3359 info[i] = (constraint)(info[i] | ROT_NEG);
3360 r = l;
3361 }
3362 //puts("neg remainder");
3363 //Polyhedron_Print(stdout, P_VALUE_FMT, T);
3364 Polyhedron_Free(T);
3365 }
3366 }
3367 }
3368 if (!(info[i] & ALL_POS) && (info[i] & (ONE_NEG | ROT_NEG)))
3369 goto next;
3370 }
3371 }
3372 if (info[i] & ALL_POS)
3373 break;
3374 next:
3375 ;
3376 }
3377
3378 /*
3379 for (int i = 0; i < exist; ++i)
3380 printf("%i: %i\n", i, info[i]);
3381 */
3382 for (int i = 0; i < exist; ++i)
3383 if (info[i] & ALL_POS) {
3384 #ifdef DEBUG_ER
3385 fprintf(stderr, "\nER: Positive\n");
3386 #endif /* DEBUG_ER */
3387 // Eliminate
3388 // Maybe we should chew off some of the fat here
3389 Matrix *M = Matrix_Alloc(P->Dimension, P->Dimension+1);
3390 for (int j = 0; j < P->Dimension; ++j)
3391 value_set_si(M->p[j][j + (j >= i+nvar)], 1);
3392 Polyhedron *T = Polyhedron_Image(P, M, options->MaxRays);
3393 Matrix_Free(M);
3394 evalue *EP = barvinok_enumerate_e_with_options(T, exist-1, nparam,
3395 options);
3396 Polyhedron_Free(T);
3397 value_clear(f);
3398 Vector_Free(row);
3399 delete [] info;
3400 return EP;
3401 }
3402 for (int i = 0; i < exist; ++i)
3403 if (info[i] & ONE_NEG) {
3404 #ifdef DEBUG_ER
3405 fprintf(stderr, "\nER: Negative\n");
3406 #endif /* DEBUG_ER */
3407 Vector_Free(row);
3408 value_clear(f);
3409 delete [] info;
3410 if (i == 0)
3411 return barvinok_enumerate_e_with_options(P, exist-1, nparam,
3412 options);
3413 else {
3414 Polyhedron *T = Polyhedron_Copy(P);
3415 SwapColumns(T, nvar+1, nvar+1+i);
3416 evalue *EP = barvinok_enumerate_e_with_options(T, exist-1, nparam,
3417 options);
3418 Polyhedron_Free(T);
3419 return EP;
3420 }
3421 }
3422 for (int i = 0; i < exist; ++i)
3423 if (info[i] & ROT_NEG) {
3424 #ifdef DEBUG_ER
3425 fprintf(stderr, "\nER: Rotate\n");
3426 #endif /* DEBUG_ER */
3427 Vector_Free(row);
3428 value_clear(f);
3429 delete [] info;
3430 Polyhedron *T = rotate_along(P, r, nvar, exist, options->MaxRays);
3431 evalue *EP = barvinok_enumerate_e_with_options(T, exist-1, nparam,
3432 options);
3433 Polyhedron_Free(T);
3434 return EP;
3435 }
3436 for (int i = 0; i < exist; ++i)
3437 if (info[i] & INDEPENDENT) {
3438 Polyhedron *pos, *neg;
3439
3440 /* Find constraint again and split off negative part */
3441
3442 if (SplitOnVar(P, i, nvar, exist, options->MaxRays,
3443 row, f, true, &pos, &neg)) {
3444 #ifdef DEBUG_ER
3445 fprintf(stderr, "\nER: Split\n");
3446 #endif /* DEBUG_ER */
3447
3448 evalue *EP =
3449 barvinok_enumerate_e_with_options(neg, exist-1, nparam, options);
3450 evalue *E =
3451 barvinok_enumerate_e_with_options(pos, exist, nparam, options);
3452 eadd(E, EP);
3453 free_evalue_refs(E);
3454 free(E);
3455 Polyhedron_Free(neg);
3456 Polyhedron_Free(pos);
3457 value_clear(f);
3458 Vector_Free(row);
3459 delete [] info;
3460 return EP;
3461 }
3462 }
3463 delete [] info;
3464
3465 Polyhedron *O = P;
3466 Polyhedron *F;
3467
3468 evalue *EP;
3469
3470 EP = enumerate_line(P, exist, nparam, options);
3471 if (EP)
3472 goto out;
3473
3474 EP = barvinok_enumerate_pip_with_options(P, exist, nparam, options);
3475 if (EP)
3476 goto out;
3477
3478 EP = enumerate_redundant_ray(P, exist, nparam, options);
3479 if (EP)
3480 goto out;
3481
3482 EP = enumerate_sure(P, exist, nparam, options);
3483 if (EP)
3484 goto out;
3485
3486 EP = enumerate_ray(P, exist, nparam, options);
3487 if (EP)
3488 goto out;
3489
3490 EP = enumerate_sure2(P, exist, nparam, options);
3491 if (EP)
3492 goto out;
3493
3494 F = unfringe(P, options->MaxRays);
3495 if (!PolyhedronIncludes(F, P)) {
3496 #ifdef DEBUG_ER
3497 fprintf(stderr, "\nER: Fringed\n");
3498 #endif /* DEBUG_ER */
3499 EP = barvinok_enumerate_e_with_options(F, exist, nparam, options);
3500 Polyhedron_Free(F);
3501 goto out;
3502 }
3503 Polyhedron_Free(F);
3504
3505 if (nparam)
3506 EP = enumerate_vd(&P, exist, nparam, options);
3507 if (EP)
3508 goto out2;
3509
3510 if (nvar != 0) {
3511 EP = enumerate_sum(P, exist, nparam, options);
3512 goto out2;
3513 }
3514
3515 assert(nvar == 0);
3516
3517 int i;
3518 Polyhedron *pos, *neg;
3519 for (i = 0; i < exist; ++i)
3520 if (SplitOnVar(P, i, nvar, exist, options->MaxRays,
3521 row, f, false, &pos, &neg))
3522 break;
3523
3524 assert (i < exist);
3525
3526 pos->next = neg;
3527 EP = enumerate_or(pos, exist, nparam, options);
3528
3529 out2:
3530 if (O != P)
3531 Polyhedron_Free(P);
3532
3533 out:
3534 value_clear(f);
3535 Vector_Free(row);
3536 return EP;
3537 }
3538
3539 /*
3540 * remove equalities that require a "compression" of the parameters
3541 */
3542 static Polyhedron *remove_more_equalities(Polyhedron *P, unsigned nparam,
3543 Matrix **CP, unsigned MaxRays)
3544 {
3545 Polyhedron *Q = P;
3546 remove_all_equalities(&P, NULL, CP, NULL, nparam, MaxRays);
3547 if (P != Q)
3548 Polyhedron_Free(Q);
3549 return P;
3550 }
3551
3552 /* frees P */
3553 static gen_fun *series(Polyhedron *P, unsigned nparam, barvinok_options *options)
3554 {
3555 Matrix *CP = NULL;
3556 gen_fun *gf;
3557
3558 if (emptyQ2(P)) {
3559 Polyhedron_Free(P);
3560 return new gen_fun;
3561 }
3562
3563 assert(!Polyhedron_is_infinite_param(P, nparam));
3564 assert(P->NbBid == 0);
3565 assert(Polyhedron_has_revlex_positive_rays(P, nparam));
3566 if (P->NbEq != 0)
3567 P = remove_more_equalities(P, nparam, &CP, options->MaxRays);
3568 assert(P->NbEq == 0);
3569 if (CP)
3570 nparam = CP->NbColumns-1;
3571
3572 if (nparam == 0) {
3573 Value c;
3574 value_init(c);
3575 barvinok_count_with_options(P, &c, options);
3576 gf = new gen_fun(c);
3577 value_clear(c);
3578 } else {
3579 gf_base *red;
3580 red = gf_base::create(Polyhedron_Project(P, nparam),
3581 P->Dimension, nparam, options);
3582 POL_ENSURE_VERTICES(P);
3583 red->start_gf(P, options);
3584 gf = red->gf;
3585 delete red;
3586 }
3587 if (CP) {
3588 gf->substitute(CP);
3589 Matrix_Free(CP);
3590 }
3591 Polyhedron_Free(P);
3592 return gf;
3593 }
3594
3595 gen_fun * barvinok_series_with_options(Polyhedron *P, Polyhedron* C,
3596 barvinok_options *options)
3597 {
3598 Polyhedron *CA;
3599 unsigned nparam = C->Dimension;
3600 gen_fun *gf;
3601
3602 CA = align_context(C, P->Dimension, options->MaxRays);
3603 P = DomainIntersection(P, CA, options->MaxRays);
3604 Polyhedron_Free(CA);
3605
3606 gf = series(P, nparam, options);
3607
3608 return gf;
3609 }
3610
3611 gen_fun * barvinok_series(Polyhedron *P, Polyhedron* C, unsigned MaxRays)
3612 {
3613 gen_fun *gf;
3614 barvinok_options *options = barvinok_options_new_with_defaults();
3615 options->MaxRays = MaxRays;
3616 gf = barvinok_series_with_options(P, C, options);
3617 barvinok_options_free(options);
3618 return gf;
3619 }
3620
3621 static Polyhedron *skew_into_positive_orthant(Polyhedron *D, unsigned nparam,
3622 unsigned MaxRays)
3623 {
3624 Matrix *M = NULL;
3625 Value tmp;
3626 value_init(tmp);
3627 for (Polyhedron *P = D; P; P = P->next) {
3628 POL_ENSURE_VERTICES(P);
3629 assert(!Polyhedron_is_infinite_param(P, nparam));
3630 assert(P->NbBid == 0);
3631 assert(Polyhedron_has_positive_rays(P, nparam));
3632
3633 for (int r = 0; r < P->NbRays; ++r) {
3634 if (value_notzero_p(P->Ray[r][P->Dimension+1]))
3635 continue;
3636 for (int i = 0; i < nparam; ++i) {
3637 int j;
3638 if (value_posz_p(P->Ray[r][i+1]))
3639 continue;
3640 if (!M) {
3641 M = Matrix_Alloc(D->Dimension+1, D->Dimension+1);
3642 for (int i = 0; i < D->Dimension+1; ++i)
3643 value_set_si(M->p[i][i], 1);
3644 } else {
3645 Inner_Product(P->Ray[r]+1, M->p[i], D->Dimension+1, &tmp);
3646 if (value_posz_p(tmp))
3647 continue;
3648 }
3649 for (j = P->Dimension - nparam; j < P->Dimension; ++j)
3650 if (value_pos_p(P->Ray[r][j+1]))
3651 break;
3652 assert(j < P->Dimension);
3653 value_pdivision(tmp, P->Ray[r][j+1], P->Ray[r][i+1]);
3654 value_subtract(M->p[i][j], M->p[i][j], tmp);
3655 }
3656 }
3657 }
3658 value_clear(tmp);
3659 if (M) {
3660 D = DomainImage(D, M, MaxRays);
3661 Matrix_Free(M);
3662 }
3663 return D;
3664 }
3665
3666 gen_fun* barvinok_enumerate_union_series_with_options(Polyhedron *D, Polyhedron* C,
3667 barvinok_options *options)
3668 {
3669 Polyhedron *conv, *D2;
3670 Polyhedron *CA;
3671 gen_fun *gf = NULL, *gf2;
3672 unsigned nparam = C->Dimension;
3673 ZZ one, mone;
3674 one = 1;
3675 mone = -1;
3676
3677 CA = align_context(C, D->Dimension, options->MaxRays);
3678 D = DomainIntersection(D, CA, options->MaxRays);
3679 Polyhedron_Free(CA);
3680
3681 D2 = skew_into_positive_orthant(D, nparam, options->MaxRays);
3682 for (Polyhedron *P = D2; P; P = P->next) {
3683 assert(P->Dimension == D2->Dimension);
3684 gen_fun *P_gf;
3685
3686 P_gf = series(Polyhedron_Copy(P), nparam, options);
3687 if (!gf)
3688 gf = P_gf;
3689 else {
3690 gf->add_union(P_gf, options);
3691 delete P_gf;
3692 }
3693 }
3694 /* we actually only need the convex union of the parameter space
3695 * but the reducer classes currently expect a polyhedron in
3696 * the combined space
3697 */
3698 Polyhedron_Free(gf->context);
3699 gf->context = DomainConvex(D2, options->MaxRays);
3700
3701 gf2 = gf->summate(D2->Dimension - nparam, options);
3702
3703 delete gf;
3704 if (D != D2)
3705 Domain_Free(D2);
3706 Domain_Free(D);
3707 return gf2;
3708 }
3709
3710 gen_fun* barvinok_enumerate_union_series(Polyhedron *D, Polyhedron* C,
3711 unsigned MaxRays)
3712 {
3713 gen_fun *gf;
3714 barvinok_options *options = barvinok_options_new_with_defaults();
3715 options->MaxRays = MaxRays;
3716 gf = barvinok_enumerate_union_series_with_options(D, C, options);
3717 barvinok_options_free(options);
3718 return gf;
3719 }
3720
3721 evalue* barvinok_enumerate_union(Polyhedron *D, Polyhedron* C, unsigned MaxRays)
3722 {
3723 evalue *EP;
3724 gen_fun *gf = barvinok_enumerate_union_series(D, C, MaxRays);
3725 EP = *gf;
3726 delete gf;
3727 return EP;
3728 }
lattice point enumeration library