?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
memory leak
[barvinok.git] / barvinok.cc
blobedc116d51e5ceb1c4a69a35cf12cc963ffee713e
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 <util.h>
11 extern "C" {
12 #include <polylib/polylibgmp.h>
13 #include "ev_operations.h"
14 }
15 #include "config.h"
16 #include <barvinok.h>
17
18 #ifdef NTL_STD_CXX
19 using namespace NTL;
20 #endif
21 using std::cout;
22 using std::endl;
23 using std::vector;
24 using std::deque;
25 using std::string;
26 using std::ostringstream;
27
28 #define ALLOC(p) (((long *) (p))[0])
29 #define SIZE(p) (((long *) (p))[1])
30 #define DATA(p) ((mp_limb_t *) (((long *) (p)) + 2))
31
32 static void value2zz(Value v, ZZ& z)
33 {
34 int sa = v[0]._mp_size;
35 int abs_sa = sa < 0 ? -sa : sa;
36
37 _ntl_gsetlength(&z.rep, abs_sa);
38 mp_limb_t * adata = DATA(z.rep);
39 for (int i = 0; i < abs_sa; ++i)
40 adata[i] = v[0]._mp_d[i];
41 SIZE(z.rep) = sa;
42 }
43
44 static void zz2value(ZZ& z, Value& v)
45 {
46 if (!z.rep) {
47 value_set_si(v, 0);
48 return;
49 }
50
51 int sa = SIZE(z.rep);
52 int abs_sa = sa < 0 ? -sa : sa;
53
54 mp_limb_t * adata = DATA(z.rep);
55 mpz_realloc2(v, __GMP_BITS_PER_MP_LIMB * abs_sa);
56 for (int i = 0; i < abs_sa; ++i)
57 v[0]._mp_d[i] = adata[i];
58 v[0]._mp_size = sa;
59 }
60
61 #undef ALLOC
62 #define ALLOC(p) p = (typeof(p))malloc(sizeof(*p))
63
64 /*
65 * We just ignore the last column and row
66 * If the final element is not equal to one
67 * then the result will actually be a multiple of the input
68 */
69 static void matrix2zz(Matrix *M, mat_ZZ& m, unsigned nr, unsigned nc)
70 {
71 m.SetDims(nr, nc);
72
73 for (int i = 0; i < nr; ++i) {
74 // assert(value_one_p(M->p[i][M->NbColumns - 1]));
75 for (int j = 0; j < nc; ++j) {
76 value2zz(M->p[i][j], m[i][j]);
77 }
78 }
79 }
80
81 static void values2zz(Value *p, vec_ZZ& v, int len)
82 {
83 v.SetLength(len);
84
85 for (int i = 0; i < len; ++i) {
86 value2zz(p[i], v[i]);
87 }
88 }
89
90 /*
91 */
92 static void zz2values(vec_ZZ& v, Value *p)
93 {
94 for (int i = 0; i < v.length(); ++i)
95 zz2value(v[i], p[i]);
96 }
97
98 static void rays(mat_ZZ& r, Polyhedron *C)
99 {
100 unsigned dim = C->NbRays - 1; /* don't count zero vertex */
101 assert(C->NbRays - 1 == C->Dimension);
102 r.SetDims(dim, dim);
103 ZZ tmp;
104
105 int i, c;
106 for (i = 0, c = 0; i < dim; ++i)
107 if (value_zero_p(C->Ray[i][dim+1])) {
108 for (int j = 0; j < dim; ++j) {
109 value2zz(C->Ray[i][j+1], tmp);
110 r[j][c] = tmp;
111 }
112 ++c;
113 }
114 }
115
116 static Matrix * rays(Polyhedron *C)
117 {
118 unsigned dim = C->NbRays - 1; /* don't count zero vertex */
119 assert(C->NbRays - 1 == C->Dimension);
120
121 Matrix *M = Matrix_Alloc(dim+1, dim+1);
122 assert(M);
123
124 int i, c;
125 for (i = 0, c = 0; i <= dim && c < dim; ++i)
126 if (value_zero_p(C->Ray[i][dim+1])) {
127 Vector_Copy(C->Ray[i] + 1, M->p[c], dim);
128 value_set_si(M->p[c++][dim], 0);
129 }
130 assert(c == dim);
131 value_set_si(M->p[dim][dim], 1);
132
133 return M;
134 }
135
136 static Matrix * rays2(Polyhedron *C)
137 {
138 unsigned dim = C->NbRays - 1; /* don't count zero vertex */
139 assert(C->NbRays - 1 == C->Dimension);
140
141 Matrix *M = Matrix_Alloc(dim, dim);
142 assert(M);
143
144 int i, c;
145 for (i = 0, c = 0; i <= dim && c < dim; ++i)
146 if (value_zero_p(C->Ray[i][dim+1]))
147 Vector_Copy(C->Ray[i] + 1, M->p[c++], dim);
148 assert(c == dim);
149
150 return M;
151 }
152
153 /*
154 * Returns the largest absolute value in the vector
155 */
156 static ZZ max(vec_ZZ& v)
157 {
158 ZZ max = abs(v[0]);
159 for (int i = 1; i < v.length(); ++i)
160 if (abs(v[i]) > max)
161 max = abs(v[i]);
162 return max;
163 }
164
165 class cone {
166 public:
167 cone(Matrix *M) {
168 Cone = 0;
169 Rays = Matrix_Copy(M);
170 set_det();
171 }
172 cone(Polyhedron *C) {
173 Cone = Polyhedron_Copy(C);
174 Rays = rays(C);
175 set_det();
176 }
177 void set_det() {
178 mat_ZZ A;
179 matrix2zz(Rays, A, Rays->NbRows - 1, Rays->NbColumns - 1);
180 det = determinant(A);
181 Value v;
182 value_init(v);
183 zz2value(det, v);
184 value_clear(v);
185 }
186
187 Vector* short_vector(vec_ZZ& lambda) {
188 Matrix *M = Matrix_Copy(Rays);
189 Matrix *inv = Matrix_Alloc(M->NbRows, M->NbColumns);
190 int ok = Matrix_Inverse(M, inv);
191 assert(ok);
192 Matrix_Free(M);
193
194 ZZ det2;
195 mat_ZZ B;
196 mat_ZZ U;
197 matrix2zz(inv, B, inv->NbRows - 1, inv->NbColumns - 1);
198 long r = LLL(det2, B, U);
199
200 ZZ min = max(B[0]);
201 int index = 0;
202 for (int i = 1; i < B.NumRows(); ++i) {
203 ZZ tmp = max(B[i]);
204 if (tmp < min) {
205 min = tmp;
206 index = i;
207 }
208 }
209
210 Matrix_Free(inv);
211
212 lambda = B[index];
213
214 Vector *z = Vector_Alloc(U[index].length()+1);
215 assert(z);
216 zz2values(U[index], z->p);
217 value_set_si(z->p[U[index].length()], 0);
218
219 Value tmp;
220 value_init(tmp);
221 Polyhedron *C = poly();
222 int i;
223 for (i = 0; i < C->NbConstraints; ++i) {
224 Inner_Product(z->p, C->Constraint[i]+1, z->Size-1, &tmp);
225 if (value_pos_p(tmp))
226 break;
227 }
228 if (i == C->NbConstraints) {
229 value_set_si(tmp, -1);
230 Vector_Scale(z->p, z->p, tmp, z->Size-1);
231 }
232 value_clear(tmp);
233 return z;
234 }
235
236 ~cone() {
237 Polyhedron_Free(Cone);
238 Matrix_Free(Rays);
239 }
240
241 Polyhedron *poly() {
242 if (!Cone) {
243 Matrix *M = Matrix_Alloc(Rays->NbRows+1, Rays->NbColumns+1);
244 for (int i = 0; i < Rays->NbRows; ++i) {
245 Vector_Copy(Rays->p[i], M->p[i]+1, Rays->NbColumns);
246 value_set_si(M->p[i][0], 1);
247 }
248 Vector_Set(M->p[Rays->NbRows]+1, 0, Rays->NbColumns-1);
249 value_set_si(M->p[Rays->NbRows][0], 1);
250 value_set_si(M->p[Rays->NbRows][Rays->NbColumns], 1);
251 Cone = Rays2Polyhedron(M, M->NbRows+1);
252 assert(Cone->NbConstraints == Cone->NbRays);
253 Matrix_Free(M);
254 }
255 return Cone;
256 }
257
258 ZZ det;
259 Polyhedron *Cone;
260 Matrix *Rays;
261 };
262
263 class dpoly {
264 public:
265 vec_ZZ coeff;
266 dpoly(int d, ZZ& degree, int offset = 0) {
267 coeff.SetLength(d+1);
268
269 int min = d + offset;
270 if (degree < ZZ(INIT_VAL, min))
271 min = to_int(degree);
272
273 ZZ c = ZZ(INIT_VAL, 1);
274 if (!offset)
275 coeff[0] = c;
276 for (int i = 1; i <= min; ++i) {
277 c *= (degree -i + 1);
278 c /= i;
279 coeff[i-offset] = c;
280 }
281 }
282 void operator *= (dpoly& f) {
283 assert(coeff.length() == f.coeff.length());
284 vec_ZZ old = coeff;
285 coeff = f.coeff[0] * coeff;
286 for (int i = 1; i < coeff.length(); ++i)
287 for (int j = 0; i+j < coeff.length(); ++j)
288 coeff[i+j] += f.coeff[i] * old[j];
289 }
290 void div(dpoly& d, mpq_t count, ZZ& sign) {
291 int len = coeff.length();
292 Value tmp;
293 value_init(tmp);
294 mpq_t* c = new mpq_t[coeff.length()];
295 mpq_t qtmp;
296 mpq_init(qtmp);
297 for (int i = 0; i < len; ++i) {
298 mpq_init(c[i]);
299 zz2value(coeff[i], tmp);
300 mpq_set_z(c[i], tmp);
301
302 for (int j = 1; j <= i; ++j) {
303 zz2value(d.coeff[j], tmp);
304 mpq_set_z(qtmp, tmp);
305 mpq_mul(qtmp, qtmp, c[i-j]);
306 mpq_sub(c[i], c[i], qtmp);
307 }
308
309 zz2value(d.coeff[0], tmp);
310 mpq_set_z(qtmp, tmp);
311 mpq_div(c[i], c[i], qtmp);
312 }
313 if (sign == -1)
314 mpq_sub(count, count, c[len-1]);
315 else
316 mpq_add(count, count, c[len-1]);
317
318 value_clear(tmp);
319 mpq_clear(qtmp);
320 for (int i = 0; i < len; ++i)
321 mpq_clear(c[i]);
322 delete [] c;
323 }
324 };
325
326 class dpoly_n {
327 public:
328 Matrix *coeff;
329 ~dpoly_n() {
330 Matrix_Free(coeff);
331 }
332 dpoly_n(int d, ZZ& degree_0, ZZ& degree_1, int offset = 0) {
333 Value d0, d1;
334 value_init(d0);
335 value_init(d1);
336 zz2value(degree_0, d0);
337 zz2value(degree_1, d1);
338 coeff = Matrix_Alloc(d+1, d+1+1);
339 value_set_si(coeff->p[0][0], 1);
340 value_set_si(coeff->p[0][d+1], 1);
341 for (int i = 1; i <= d; ++i) {
342 value_multiply(coeff->p[i][0], coeff->p[i-1][0], d0);
343 Vector_Combine(coeff->p[i-1], coeff->p[i-1]+1, coeff->p[i]+1,
344 d1, d0, i);
345 value_set_si(coeff->p[i][d+1], i);
346 value_multiply(coeff->p[i][d+1], coeff->p[i][d+1], coeff->p[i-1][d+1]);
347 value_decrement(d0, d0);
348 }
349 value_clear(d0);
350 value_clear(d1);
351 }
352 void div(dpoly& d, Vector *count, ZZ& sign) {
353 int len = coeff->NbRows;
354 Matrix * c = Matrix_Alloc(coeff->NbRows, coeff->NbColumns);
355 Value tmp;
356 value_init(tmp);
357 for (int i = 0; i < len; ++i) {
358 Vector_Copy(coeff->p[i], c->p[i], len+1);
359 for (int j = 1; j <= i; ++j) {
360 zz2value(d.coeff[j], tmp);
361 value_multiply(tmp, tmp, c->p[i][len]);
362 value_oppose(tmp, tmp);
363 Vector_Combine(c->p[i], c->p[i-j], c->p[i],
364 c->p[i-j][len], tmp, len);
365 value_multiply(c->p[i][len], c->p[i][len], c->p[i-j][len]);
366 }
367 zz2value(d.coeff[0], tmp);
368 value_multiply(c->p[i][len], c->p[i][len], tmp);
369 }
370 if (sign == -1) {
371 value_set_si(tmp, -1);
372 Vector_Scale(c->p[len-1], count->p, tmp, len);
373 value_assign(count->p[len], c->p[len-1][len]);
374 } else
375 Vector_Copy(c->p[len-1], count->p, len+1);
376 Vector_Normalize(count->p, len+1);
377 value_clear(tmp);
378 Matrix_Free(c);
379 }
380 };
381
382 /*
383 * Barvinok's Decomposition of a simplicial cone
384 *
385 * Returns two lists of polyhedra
386 */
387 void barvinok_decompose(Polyhedron *C, Polyhedron **ppos, Polyhedron **pneg)
388 {
389 Polyhedron *pos = *ppos, *neg = *pneg;
390 vector<cone *> nonuni;
391 cone * c = new cone(C);
392 ZZ det = c->det;
393 int s = sign(det);
394 assert(det != 0);
395 if (abs(det) > 1) {
396 nonuni.push_back(c);
397 } else {
398 Polyhedron *p = Polyhedron_Copy(c->Cone);
399 p->next = pos;
400 pos = p;
401 delete c;
402 }
403 vec_ZZ lambda;
404 while (!nonuni.empty()) {
405 c = nonuni.back();
406 nonuni.pop_back();
407 Vector* v = c->short_vector(lambda);
408 for (int i = 0; i < c->Rays->NbRows - 1; ++i) {
409 if (lambda[i] == 0)
410 continue;
411 Matrix* M = Matrix_Copy(c->Rays);
412 Vector_Copy(v->p, M->p[i], v->Size);
413 cone * pc = new cone(M);
414 assert (pc->det != 0);
415 if (abs(pc->det) > 1) {
416 assert(abs(pc->det) < abs(c->det));
417 nonuni.push_back(pc);
418 } else {
419 Polyhedron *p = pc->poly();
420 pc->Cone = 0;
421 if (sign(pc->det) == s) {
422 p->next = pos;
423 pos = p;
424 } else {
425 p->next = neg;
426 neg = p;
427 }
428 delete pc;
429 }
430 Matrix_Free(M);
431 }
432 Vector_Free(v);
433 delete c;
434 }
435 *ppos = pos;
436 *pneg = neg;
437 }
438
439 /*
440 * Returns a single list of npos "positive" cones followed by nneg
441 * "negative" cones.
442 * The input cone is freed
443 */
444 void decompose(Polyhedron *cone, Polyhedron **parts, int *npos, int *nneg, unsigned MaxRays)
445 {
446 Polyhedron_Polarize(cone);
447 if (cone->NbRays - 1 != cone->Dimension) {
448 Polyhedron *tmp = cone;
449 cone = triangularize_cone(cone, MaxRays);
450 Polyhedron_Free(tmp);
451 }
452 Polyhedron *polpos = NULL, *polneg = NULL;
453 *npos = 0; *nneg = 0;
454 for (Polyhedron *Polar = cone; Polar; Polar = Polar->next)
455 barvinok_decompose(Polar, &polpos, &polneg);
456
457 Polyhedron *last;
458 for (Polyhedron *i = polpos; i; i = i->next) {
459 Polyhedron_Polarize(i);
460 ++*npos;
461 last = i;
462 }
463 for (Polyhedron *i = polneg; i; i = i->next) {
464 Polyhedron_Polarize(i);
465 ++*nneg;
466 }
467 if (last) {
468 last->next = polneg;
469 *parts = polpos;
470 } else
471 *parts = polneg;
472 Domain_Free(cone);
473 }
474
475 const int MAX_TRY=10;
476 /*
477 * Searches for a vector that is not othogonal to any
478 * of the rays in rays.
479 */
480 static void nonorthog(mat_ZZ& rays, vec_ZZ& lambda)
481 {
482 int dim = rays.NumCols();
483 bool found = false;
484 lambda.SetLength(dim);
485 for (int i = 2; !found && i <= 50*dim; i+=4) {
486 for (int j = 0; j < MAX_TRY; ++j) {
487 for (int k = 0; k < dim; ++k) {
488 int r = random_int(i)+2;
489 int v = (2*(r%2)-1) * (r >> 1);
490 lambda[k] = v;
491 }
492 int k = 0;
493 for (; k < rays.NumRows(); ++k)
494 if (lambda * rays[k] == 0)
495 break;
496 if (k == rays.NumRows()) {
497 found = true;
498 break;
499 }
500 }
501 }
502 assert(found);
503 }
504
505 static void add_rays(mat_ZZ& rays, Polyhedron *i, int *r)
506 {
507 unsigned dim = i->Dimension;
508 for (int k = 0; k < i->NbRays; ++k) {
509 if (!value_zero_p(i->Ray[k][dim+1]))
510 continue;
511 values2zz(i->Ray[k]+1, rays[(*r)++], dim);
512 }
513 }
514
515 void lattice_point(Value* values, Polyhedron *i, vec_ZZ& lambda, ZZ& num)
516 {
517 vec_ZZ vertex;
518 unsigned dim = i->Dimension;
519 if(!value_one_p(values[dim])) {
520 Matrix* Rays = rays(i);
521 Matrix *inv = Matrix_Alloc(Rays->NbRows, Rays->NbColumns);
522 int ok = Matrix_Inverse(Rays, inv);
523 assert(ok);
524 Matrix_Free(Rays);
525 Rays = rays(i);
526 Vector *lambda = Vector_Alloc(dim+1);
527 Vector_Matrix_Product(values, inv, lambda->p);
528 Matrix_Free(inv);
529 for (int j = 0; j < dim; ++j)
530 mpz_cdiv_q(lambda->p[j], lambda->p[j], lambda->p[dim]);
531 value_set_si(lambda->p[dim], 1);
532 Vector *A = Vector_Alloc(dim+1);
533 Vector_Matrix_Product(lambda->p, Rays, A->p);
534 Vector_Free(lambda);
535 Matrix_Free(Rays);
536 values2zz(A->p, vertex, dim);
537 Vector_Free(A);
538 } else
539 values2zz(values, vertex, dim);
540
541 num = vertex * lambda;
542 }
543
544 static evalue *term(int param, ZZ& c, Value *den = NULL)
545 {
546 evalue *EP = new evalue();
547 value_init(EP->d);
548 value_set_si(EP->d,0);
549 EP->x.p = new_enode(polynomial, 2, param + 1);
550 evalue_set_si(&EP->x.p->arr[0], 0, 1);
551 value_init(EP->x.p->arr[1].x.n);
552 if (den == NULL)
553 value_set_si(EP->x.p->arr[1].d, 1);
554 else
555 value_assign(EP->x.p->arr[1].d, *den);
556 zz2value(c, EP->x.p->arr[1].x.n);
557 return EP;
558 }
559
560 static void vertex_period(
561 Polyhedron *i, vec_ZZ& lambda, Matrix *T,
562 Value lcm, int p, Vector *val,
563 evalue *E, evalue* ev,
564 ZZ& offset)
565 {
566 unsigned nparam = T->NbRows - 1;
567 unsigned dim = i->Dimension;
568 Value tmp;
569 ZZ nump;
570
571 if (p == nparam) {
572 ZZ num, l;
573 Vector * values = Vector_Alloc(dim + 1);
574 Vector_Matrix_Product(val->p, T, values->p);
575 value_assign(values->p[dim], lcm);
576 lattice_point(values->p, i, lambda, num);
577 value2zz(lcm, l);
578 num *= l;
579 num += offset;
580 value_init(ev->x.n);
581 zz2value(num, ev->x.n);
582 value_assign(ev->d, lcm);
583 Vector_Free(values);
584 return;
585 }
586
587 value_init(tmp);
588 vec_ZZ vertex;
589 values2zz(T->p[p], vertex, dim);
590 nump = vertex * lambda;
591 if (First_Non_Zero(val->p, p) == -1) {
592 value_assign(tmp, lcm);
593 evalue *ET = term(p, nump, &tmp);
594 eadd(ET, E);
595 free_evalue_refs(ET);
596 delete ET;
597 }
598
599 value_assign(tmp, lcm);
600 if (First_Non_Zero(T->p[p], dim) != -1)
601 Vector_Gcd(T->p[p], dim, &tmp);
602 Gcd(tmp, lcm, &tmp);
603 if (value_lt(tmp, lcm)) {
604 ZZ count;
605
606 value_division(tmp, lcm, tmp);
607 value_set_si(ev->d, 0);
608 ev->x.p = new_enode(periodic, VALUE_TO_INT(tmp), p+1);
609 value2zz(tmp, count);
610 do {
611 value_decrement(tmp, tmp);
612 --count;
613 ZZ new_offset = offset - count * nump;
614 value_assign(val->p[p], tmp);
615 vertex_period(i, lambda, T, lcm, p+1, val, E,
616 &ev->x.p->arr[VALUE_TO_INT(tmp)], new_offset);
617 } while (value_pos_p(tmp));
618 } else
619 vertex_period(i, lambda, T, lcm, p+1, val, E, ev, offset);
620 value_clear(tmp);
621 }
622
623 static void mask_r(Matrix *f, int nr, Vector *lcm, int p, Vector *val, evalue *ev)
624 {
625 unsigned nparam = lcm->Size;
626
627 if (p == nparam) {
628 Vector * prod = Vector_Alloc(f->NbRows);
629 Matrix_Vector_Product(f, val->p, prod->p);
630 int isint = 1;
631 for (int i = 0; i < nr; ++i) {
632 value_modulus(prod->p[i], prod->p[i], f->p[i][nparam+1]);
633 isint &= value_zero_p(prod->p[i]);
634 }
635 value_set_si(ev->d, 1);
636 value_init(ev->x.n);
637 value_set_si(ev->x.n, isint);
638 Vector_Free(prod);
639 return;
640 }
641
642 Value tmp;
643 value_init(tmp);
644 if (value_one_p(lcm->p[p]))
645 mask_r(f, nr, lcm, p+1, val, ev);
646 else {
647 value_assign(tmp, lcm->p[p]);
648 value_set_si(ev->d, 0);
649 ev->x.p = new_enode(periodic, VALUE_TO_INT(tmp), p+1);
650 do {
651 value_decrement(tmp, tmp);
652 value_assign(val->p[p], tmp);
653 mask_r(f, nr, lcm, p+1, val, &ev->x.p->arr[VALUE_TO_INT(tmp)]);
654 } while (value_pos_p(tmp));
655 }
656 value_clear(tmp);
657 }
658
659 static evalue *multi_monom(vec_ZZ& p)
660 {
661 evalue *X = new evalue();
662 value_init(X->d);
663 value_init(X->x.n);
664 unsigned nparam = p.length()-1;
665 zz2value(p[nparam], X->x.n);
666 value_set_si(X->d, 1);
667 for (int i = 0; i < nparam; ++i) {
668 if (p[i] == 0)
669 continue;
670 evalue *T = term(i, p[i]);
671 eadd(T, X);
672 free_evalue_refs(T);
673 delete T;
674 }
675 return X;
676 }
677
678 /*
679 * Check whether mapping polyhedron P on the affine combination
680 * num yields a range that has a fixed quotient on integer
681 * division by d
682 * If zero is true, then we are only interested in the quotient
683 * for the cases where the remainder is zero.
684 * Returns NULL if false and a newly allocated value if true.
685 */
686 static Value *fixed_quotient(Polyhedron *P, vec_ZZ& num, Value d, bool zero)
687 {
688 Value* ret = NULL;
689 int len = num.length();
690 Matrix *T = Matrix_Alloc(2, len);
691 zz2values(num, T->p[0]);
692 value_set_si(T->p[1][len-1], 1);
693 Polyhedron *I = Polyhedron_Image(P, T, P->NbConstraints);
694 Matrix_Free(T);
695
696 int i;
697 for (i = 0; i < I->NbRays; ++i)
698 if (value_zero_p(I->Ray[i][2])) {
699 Polyhedron_Free(I);
700 return NULL;
701 }
702
703 Value min, max;
704 value_init(min);
705 value_init(max);
706 int bounded = line_minmax(I, &min, &max);
707 assert(bounded);
708
709 if (zero)
710 mpz_cdiv_q(min, min, d);
711 else
712 mpz_fdiv_q(min, min, d);
713 mpz_fdiv_q(max, max, d);
714
715 if (value_eq(min, max)) {
716 ALLOC(ret);
717 value_init(*ret);
718 value_assign(*ret, min);
719 }
720 value_clear(min);
721 value_clear(max);
722 return ret;
723 }
724
725 /*
726 * Normalize linear expression coef modulo m
727 * Removes common factor and reduces coefficients
728 * Returns index of first non-zero coefficient or len
729 */
730 static int normal_mod(Value *coef, int len, Value *m)
731 {
732 Value gcd;
733 value_init(gcd);
734
735 Vector_Gcd(coef, len, &gcd);
736 Gcd(gcd, *m, &gcd);
737 Vector_AntiScale(coef, coef, gcd, len);
738
739 value_division(*m, *m, gcd);
740 value_clear(gcd);
741
742 if (value_one_p(*m))
743 return len;
744
745 int j;
746 for (j = 0; j < len; ++j)
747 mpz_fdiv_r(coef[j], coef[j], *m);
748 for (j = 0; j < len; ++j)
749 if (value_notzero_p(coef[j]))
750 break;
751
752 return j;
753 }
754
755 #ifdef USE_MODULO
756 static void mask(Matrix *f, evalue *factor)
757 {
758 int nr = f->NbRows, nc = f->NbColumns;
759 int n;
760 bool found = false;
761 for (n = 0; n < nr && value_notzero_p(f->p[n][nc-1]); ++n)
762 if (value_notone_p(f->p[n][nc-1]) &&
763 value_notmone_p(f->p[n][nc-1]))
764 found = true;
765 if (!found)
766 return;
767
768 evalue EP;
769 nr = n;
770
771 Value m;
772 value_init(m);
773
774 evalue EV;
775 value_init(EV.d);
776 value_init(EV.x.n);
777 value_set_si(EV.x.n, 1);
778
779 for (n = 0; n < nr; ++n) {
780 value_assign(m, f->p[n][nc-1]);
781 if (value_one_p(m) || value_mone_p(m))
782 continue;
783
784 int j = normal_mod(f->p[n], nc-1, &m);
785 if (j == nc-1) {
786 free_evalue_refs(factor);
787 value_init(factor->d);
788 evalue_set_si(factor, 0, 1);
789 break;
790 }
791 vec_ZZ row;
792 values2zz(f->p[n], row, nc-1);
793 ZZ g;
794 value2zz(m, g);
795 if (j < (nc-1)-1 && row[j] > g/2) {
796 for (int k = j; k < (nc-1); ++k)
797 if (row[k] != 0)
798 row[k] = g - row[k];
799 }
800
801 value_init(EP.d);
802 value_set_si(EP.d, 0);
803 EP.x.p = new_enode(relation, 2, 0);
804 value_clear(EP.x.p->arr[1].d);
805 EP.x.p->arr[1] = *factor;
806 evalue *ev = &EP.x.p->arr[0];
807 value_set_si(ev->d, 0);
808 ev->x.p = new_enode(fractional, 3, -1);
809 evalue_set_si(&ev->x.p->arr[1], 0, 1);
810 evalue_set_si(&ev->x.p->arr[2], 1, 1);
811 evalue *E = multi_monom(row);
812 value_assign(EV.d, m);
813 emul(&EV, E);
814 value_clear(ev->x.p->arr[0].d);
815 ev->x.p->arr[0] = *E;
816 delete E;
817 *factor = EP;
818 }
819
820 value_clear(m);
821 free_evalue_refs(&EV);
822 }
823 #else
824 /*
825 *
826 */
827 static void mask(Matrix *f, evalue *factor)
828 {
829 int nr = f->NbRows, nc = f->NbColumns;
830 int n;
831 bool found = false;
832 for (n = 0; n < nr && value_notzero_p(f->p[n][nc-1]); ++n)
833 if (value_notone_p(f->p[n][nc-1]) &&
834 value_notmone_p(f->p[n][nc-1]))
835 found = true;
836 if (!found)
837 return;
838
839 Value tmp;
840 value_init(tmp);
841 nr = n;
842 unsigned np = nc - 2;
843 Vector *lcm = Vector_Alloc(np);
844 Vector *val = Vector_Alloc(nc);
845 Vector_Set(val->p, 0, nc);
846 value_set_si(val->p[np], 1);
847 Vector_Set(lcm->p, 1, np);
848 for (n = 0; n < nr; ++n) {
849 if (value_one_p(f->p[n][nc-1]) ||
850 value_mone_p(f->p[n][nc-1]))
851 continue;
852 for (int j = 0; j < np; ++j)
853 if (value_notzero_p(f->p[n][j])) {
854 Gcd(f->p[n][j], f->p[n][nc-1], &tmp);
855 value_division(tmp, f->p[n][nc-1], tmp);
856 value_lcm(tmp, lcm->p[j], &lcm->p[j]);
857 }
858 }
859 evalue EP;
860 value_init(EP.d);
861 mask_r(f, nr, lcm, 0, val, &EP);
862 value_clear(tmp);
863 Vector_Free(val);
864 Vector_Free(lcm);
865 emul(&EP,factor);
866 free_evalue_refs(&EP);
867 }
868 #endif
869
870 struct term_info {
871 evalue *E;
872 ZZ constant;
873 ZZ coeff;
874 int pos;
875 };
876
877 static bool mod_needed(Polyhedron *PD, vec_ZZ& num, Value d, evalue *E)
878 {
879 Value *q = fixed_quotient(PD, num, d, false);
880
881 if (!q)
882 return true;
883
884 value_oppose(*q, *q);
885 evalue EV;
886 value_init(EV.d);
887 value_set_si(EV.d, 1);
888 value_init(EV.x.n);
889 value_multiply(EV.x.n, *q, d);
890 eadd(&EV, E);
891 free_evalue_refs(&EV);
892 value_clear(*q);
893 free(q);
894 return false;
895 }
896
897 static void ceil_mod(Value *coef, int len, Value d, ZZ& f, evalue *EP, Polyhedron *PD)
898 {
899 Value m;
900 value_init(m);
901 value_set_si(m, -1);
902
903 Vector_Scale(coef, coef, m, len);
904
905 value_assign(m, d);
906 int j = normal_mod(coef, len, &m);
907
908 if (j == len) {
909 value_clear(m);
910 return;
911 }
912
913 vec_ZZ num;
914 values2zz(coef, num, len);
915
916 ZZ g;
917 value2zz(m, g);
918
919 evalue tmp;
920 value_init(tmp.d);
921 evalue_set_si(&tmp, 0, 1);
922
923 int p = j;
924 if (g % 2 == 0)
925 while (j < len-1 && (num[j] == g/2 || num[j] == 0))
926 ++j;
927 if ((j < len-1 && num[j] > g/2) || (j == len-1 && num[j] >= (g+1)/2)) {
928 for (int k = j; k < len-1; ++k)
929 if (num[k] != 0)
930 num[k] = g - num[k];
931 num[len-1] = g - 1 - num[len-1];
932 value_assign(tmp.d, m);
933 ZZ t = f*(g-1);
934 zz2value(t, tmp.x.n);
935 eadd(&tmp, EP);
936 f = -f;
937 }
938
939 if (p >= len-1) {
940 ZZ t = num[len-1] * f;
941 zz2value(t, tmp.x.n);
942 value_assign(tmp.d, m);
943 eadd(&tmp, EP);
944 } else {
945 evalue *E = multi_monom(num);
946 evalue EV;
947 value_init(EV.d);
948
949 if (PD && !mod_needed(PD, num, m, E)) {
950 value_init(EV.x.n);
951 zz2value(f, EV.x.n);
952 value_assign(EV.d, m);
953 emul(&EV, E);
954 eadd(E, EP);
955 } else {
956 value_init(EV.x.n);
957 value_set_si(EV.x.n, 1);
958 value_assign(EV.d, m);
959 emul(&EV, E);
960 value_clear(EV.x.n);
961 value_set_si(EV.d, 0);
962 EV.x.p = new_enode(fractional, 3, -1);
963 evalue_copy(&EV.x.p->arr[0], E);
964 evalue_set_si(&EV.x.p->arr[1], 0, 1);
965 value_init(EV.x.p->arr[2].x.n);
966 zz2value(f, EV.x.p->arr[2].x.n);
967 value_set_si(EV.x.p->arr[2].d, 1);
968
969 eadd(&EV, EP);
970 }
971
972 free_evalue_refs(&EV);
973 free_evalue_refs(E);
974 delete E;
975 }
976
977 free_evalue_refs(&tmp);
978
979 out:
980 value_clear(m);
981 }
982
983 evalue* bv_ceil3(Value *coef, int len, Value d, Polyhedron *P)
984 {
985 Vector *val = Vector_Alloc(len);
986
987 Value t;
988 value_init(t);
989 value_set_si(t, -1);
990 Vector_Scale(coef, val->p, t, len);
991 value_absolute(t, d);
992
993 vec_ZZ num;
994 values2zz(val->p, num, len);
995 evalue *EP = multi_monom(num);
996
997 evalue tmp;
998 value_init(tmp.d);
999 value_init(tmp.x.n);
1000 value_set_si(tmp.x.n, 1);
1001 value_assign(tmp.d, t);
1002
1003 emul(&tmp, EP);
1004
1005 ZZ one;
1006 one = 1;
1007 ceil_mod(val->p, len, t, one, EP, P);
1008 value_clear(t);
1009
1010 /* copy EP to malloc'ed evalue */
1011 evalue *E;
1012 ALLOC(E);
1013 *E = *EP;
1014 delete EP;
1015
1016 free_evalue_refs(&tmp);
1017 Vector_Free(val);
1018
1019 return E;
1020 }
1021
1022 #ifdef USE_MODULO
1023 evalue* lattice_point(
1024 Polyhedron *i, vec_ZZ& lambda, Matrix *W, Value lcm, Polyhedron *PD)
1025 {
1026 unsigned nparam = W->NbColumns - 1;
1027
1028 Matrix* Rays = rays2(i);
1029 Matrix *T = Transpose(Rays);
1030 Matrix *T2 = Matrix_Copy(T);
1031 Matrix *inv = Matrix_Alloc(T2->NbRows, T2->NbColumns);
1032 int ok = Matrix_Inverse(T2, inv);
1033 assert(ok);
1034 Matrix_Free(Rays);
1035 Matrix_Free(T2);
1036 mat_ZZ vertex;
1037 matrix2zz(W, vertex, W->NbRows, W->NbColumns);
1038
1039 vec_ZZ num;
1040 num = lambda * vertex;
1041
1042 evalue *EP = multi_monom(num);
1043
1044 evalue tmp;
1045 value_init(tmp.d);
1046 value_init(tmp.x.n);
1047 value_set_si(tmp.x.n, 1);
1048 value_assign(tmp.d, lcm);
1049
1050 emul(&tmp, EP);
1051
1052 Matrix *L = Matrix_Alloc(inv->NbRows, W->NbColumns);
1053 Matrix_Product(inv, W, L);
1054
1055 mat_ZZ RT;
1056 matrix2zz(T, RT, T->NbRows, T->NbColumns);
1057 Matrix_Free(T);
1058
1059 vec_ZZ p = lambda * RT;
1060
1061 for (int i = 0; i < L->NbRows; ++i) {
1062 ceil_mod(L->p[i], nparam+1, lcm, p[i], EP, PD);
1063 }
1064
1065 Matrix_Free(L);
1066
1067 Matrix_Free(inv);
1068 free_evalue_refs(&tmp);
1069 return EP;
1070 }
1071 #else
1072 evalue* lattice_point(
1073 Polyhedron *i, vec_ZZ& lambda, Matrix *W, Value lcm, Polyhedron *PD)
1074 {
1075 Matrix *T = Transpose(W);
1076 unsigned nparam = T->NbRows - 1;
1077
1078 evalue *EP = new evalue();
1079 value_init(EP->d);
1080 evalue_set_si(EP, 0, 1);
1081
1082 evalue ev;
1083 Vector *val = Vector_Alloc(nparam+1);
1084 value_set_si(val->p[nparam], 1);
1085 ZZ offset(INIT_VAL, 0);
1086 value_init(ev.d);
1087 vertex_period(i, lambda, T, lcm, 0, val, EP, &ev, offset);
1088 Vector_Free(val);
1089 eadd(&ev, EP);
1090 free_evalue_refs(&ev);
1091
1092 Matrix_Free(T);
1093
1094 reduce_evalue(EP);
1095
1096 return EP;
1097 }
1098 #endif
1099
1100 void lattice_point(
1101 Param_Vertices* V, Polyhedron *i, vec_ZZ& lambda, term_info* term,
1102 Polyhedron *PD)
1103 {
1104 unsigned nparam = V->Vertex->NbColumns - 2;
1105 unsigned dim = i->Dimension;
1106 mat_ZZ vertex;
1107 vertex.SetDims(V->Vertex->NbRows, nparam+1);
1108 Value lcm, tmp;
1109 value_init(lcm);
1110 value_init(tmp);
1111 value_set_si(lcm, 1);
1112 for (int j = 0; j < V->Vertex->NbRows; ++j) {
1113 value_lcm(lcm, V->Vertex->p[j][nparam+1], &lcm);
1114 }
1115 if (value_notone_p(lcm)) {
1116 Matrix * mv = Matrix_Alloc(dim, nparam+1);
1117 for (int j = 0 ; j < dim; ++j) {
1118 value_division(tmp, lcm, V->Vertex->p[j][nparam+1]);
1119 Vector_Scale(V->Vertex->p[j], mv->p[j], tmp, nparam+1);
1120 }
1121
1122 term->E = lattice_point(i, lambda, mv, lcm, PD);
1123 term->constant = 0;
1124
1125 Matrix_Free(mv);
1126 value_clear(lcm);
1127 value_clear(tmp);
1128 return;
1129 }
1130 for (int i = 0; i < V->Vertex->NbRows; ++i) {
1131 assert(value_one_p(V->Vertex->p[i][nparam+1])); // for now
1132 values2zz(V->Vertex->p[i], vertex[i], nparam+1);
1133 }
1134
1135 vec_ZZ num;
1136 num = lambda * vertex;
1137
1138 int p = -1;
1139 int nn = 0;
1140 for (int j = 0; j < nparam; ++j)
1141 if (num[j] != 0) {
1142 ++nn;
1143 p = j;
1144 }
1145 if (nn >= 2) {
1146 term->E = multi_monom(num);
1147 term->constant = 0;
1148 } else {
1149 term->E = NULL;
1150 term->constant = num[nparam];
1151 term->pos = p;
1152 if (p != -1)
1153 term->coeff = num[p];
1154 }
1155
1156 value_clear(lcm);
1157 value_clear(tmp);
1158 }
1159
1160 void normalize(Polyhedron *i, vec_ZZ& lambda, ZZ& sign, ZZ& num, vec_ZZ& den)
1161 {
1162 unsigned dim = i->Dimension;
1163
1164 int r = 0;
1165 mat_ZZ rays;
1166 rays.SetDims(dim, dim);
1167 add_rays(rays, i, &r);
1168 den = rays * lambda;
1169 int change = 0;
1170
1171 for (int j = 0; j < den.length(); ++j) {
1172 if (den[j] > 0)
1173 change ^= 1;
1174 else {
1175 den[j] = abs(den[j]);
1176 num += den[j];
1177 }
1178 }
1179 if (change)
1180 sign = -sign;
1181 }
1182
1183 void barvinok_count(Polyhedron *P, Value* result, unsigned NbMaxCons)
1184 {
1185 Polyhedron ** vcone;
1186 vec_ZZ sign;
1187 int ncone = 0;
1188 sign.SetLength(ncone);
1189 unsigned dim;
1190 int allocated = 0;
1191 Value factor;
1192 Polyhedron *Q;
1193 int r = 0;
1194
1195 if (emptyQ(P)) {
1196 value_set_si(*result, 0);
1197 return;
1198 }
1199 if (P->NbBid == 0)
1200 for (; r < P->NbRays; ++r)
1201 if (value_zero_p(P->Ray[r][P->Dimension+1]))
1202 break;
1203 if (P->NbBid !=0 || r < P->NbRays) {
1204 value_set_si(*result, -1);
1205 return;
1206 }
1207 if (P->NbEq != 0) {
1208 P = remove_equalities(P);
1209 if (emptyQ(P)) {
1210 Polyhedron_Free(P);
1211 value_set_si(*result, 0);
1212 return;
1213 }
1214 allocated = 1;
1215 }
1216 value_init(factor);
1217 value_set_si(factor, 1);
1218 Q = Polyhedron_Reduce(P, &factor);
1219 if (Q) {
1220 if (allocated)
1221 Polyhedron_Free(P);
1222 P = Q;
1223 allocated = 1;
1224 }
1225 if (P->Dimension == 0) {
1226 value_assign(*result, factor);
1227 if (allocated)
1228 Polyhedron_Free(P);
1229 value_clear(factor);
1230 return;
1231 }
1232
1233 dim = P->Dimension;
1234 vcone = new (Polyhedron *)[P->NbRays];
1235
1236 for (int j = 0; j < P->NbRays; ++j) {
1237 int npos, nneg;
1238 Polyhedron *C = supporting_cone(P, j);
1239 decompose(C, &vcone[j], &npos, &nneg, NbMaxCons);
1240 ncone += npos + nneg;
1241 sign.SetLength(ncone);
1242 for (int k = 0; k < npos; ++k)
1243 sign[ncone-nneg-k-1] = 1;
1244 for (int k = 0; k < nneg; ++k)
1245 sign[ncone-k-1] = -1;
1246 }
1247
1248 mat_ZZ rays;
1249 rays.SetDims(ncone * dim, dim);
1250 r = 0;
1251 for (int j = 0; j < P->NbRays; ++j) {
1252 for (Polyhedron *i = vcone[j]; i; i = i->next) {
1253 assert(i->NbRays-1 == dim);
1254 add_rays(rays, i, &r);
1255 }
1256 }
1257 vec_ZZ lambda;
1258 nonorthog(rays, lambda);
1259
1260 vec_ZZ num;
1261 mat_ZZ den;
1262 num.SetLength(ncone);
1263 den.SetDims(ncone,dim);
1264
1265 int f = 0;
1266 for (int j = 0; j < P->NbRays; ++j) {
1267 for (Polyhedron *i = vcone[j]; i; i = i->next) {
1268 lattice_point(P->Ray[j]+1, i, lambda, num[f]);
1269 normalize(i, lambda, sign[f], num[f], den[f]);
1270 ++f;
1271 }
1272 }
1273 ZZ min = num[0];
1274 for (int j = 1; j < num.length(); ++j)
1275 if (num[j] < min)
1276 min = num[j];
1277 for (int j = 0; j < num.length(); ++j)
1278 num[j] -= min;
1279
1280 f = 0;
1281 mpq_t count;
1282 mpq_init(count);
1283 for (int j = 0; j < P->NbRays; ++j) {
1284 for (Polyhedron *i = vcone[j]; i; i = i->next) {
1285 dpoly d(dim, num[f]);
1286 dpoly n(dim, den[f][0], 1);
1287 for (int k = 1; k < dim; ++k) {
1288 dpoly fact(dim, den[f][k], 1);
1289 n *= fact;
1290 }
1291 d.div(n, count, sign[f]);
1292 ++f;
1293 }
1294 }
1295 assert(value_one_p(&count[0]._mp_den));
1296 value_multiply(*result, &count[0]._mp_num, factor);
1297 mpq_clear(count);
1298
1299 for (int j = 0; j < P->NbRays; ++j)
1300 Domain_Free(vcone[j]);
1301
1302 delete [] vcone;
1303
1304 if (allocated)
1305 Polyhedron_Free(P);
1306 value_clear(factor);
1307 }
1308
1309 static void uni_polynom(int param, Vector *c, evalue *EP)
1310 {
1311 unsigned dim = c->Size-2;
1312 value_init(EP->d);
1313 value_set_si(EP->d,0);
1314 EP->x.p = new_enode(polynomial, dim+1, param+1);
1315 for (int j = 0; j <= dim; ++j)
1316 evalue_set(&EP->x.p->arr[j], c->p[j], c->p[dim+1]);
1317 }
1318
1319 static void multi_polynom(Vector *c, evalue* X, evalue *EP)
1320 {
1321 unsigned dim = c->Size-2;
1322 evalue EC;
1323
1324 value_init(EC.d);
1325 evalue_set(&EC, c->p[dim], c->p[dim+1]);
1326
1327 value_init(EP->d);
1328 evalue_set(EP, c->p[dim], c->p[dim+1]);
1329
1330 for (int i = dim-1; i >= 0; --i) {
1331 emul(X, EP);
1332 value_assign(EC.x.n, c->p[i]);
1333 eadd(&EC, EP);
1334 }
1335 free_evalue_refs(&EC);
1336 }
1337
1338 Polyhedron *unfringe (Polyhedron *P, unsigned MaxRays)
1339 {
1340 int len = P->Dimension+2;
1341 Polyhedron *T, *R = P;
1342 Value g;
1343 value_init(g);
1344 Vector *row = Vector_Alloc(len);
1345 value_set_si(row->p[0], 1);
1346
1347 R = DomainConstraintSimplify(Polyhedron_Copy(P), MaxRays);
1348
1349 Matrix *M = Matrix_Alloc(2, len-1);
1350 value_set_si(M->p[1][len-2], 1);
1351 for (int v = 0; v < P->Dimension; ++v) {
1352 value_set_si(M->p[0][v], 1);
1353 Polyhedron *I = Polyhedron_Image(P, M, 2+1);
1354 value_set_si(M->p[0][v], 0);
1355 for (int r = 0; r < I->NbConstraints; ++r) {
1356 if (value_zero_p(I->Constraint[r][0]))
1357 continue;
1358 if (value_zero_p(I->Constraint[r][1]))
1359 continue;
1360 if (value_one_p(I->Constraint[r][1]))
1361 continue;
1362 if (value_mone_p(I->Constraint[r][1]))
1363 continue;
1364 value_absolute(g, I->Constraint[r][1]);
1365 Vector_Set(row->p+1, 0, len-2);
1366 value_division(row->p[1+v], I->Constraint[r][1], g);
1367 mpz_fdiv_q(row->p[len-1], I->Constraint[r][2], g);
1368 T = R;
1369 R = AddConstraints(row->p, 1, R, MaxRays);
1370 if (T != P)
1371 Polyhedron_Free(T);
1372 }
1373 Polyhedron_Free(I);
1374 }
1375 Matrix_Free(M);
1376 value_clear(g);
1377 return R;
1378 }
1379
1380 static Polyhedron *reduce_domain(Polyhedron *D, Matrix *CT, Polyhedron *CEq,
1381 Polyhedron **fVD, int nd, unsigned MaxRays)
1382 {
1383 assert(CEq);
1384
1385 Polyhedron *Dt;
1386 Dt = CT ? DomainPreimage(D, CT, MaxRays) : D;
1387 Polyhedron *rVD = DomainIntersection(Dt, CEq, MaxRays);
1388
1389 /* if rVD is empty or too small in geometric dimension */
1390 if(!rVD || emptyQ(rVD) ||
1391 (rVD->Dimension-rVD->NbEq < Dt->Dimension-Dt->NbEq-CEq->NbEq)) {
1392 if(rVD)
1393 Domain_Free(rVD);
1394 if (CT)
1395 Domain_Free(Dt);
1396 return 0; /* empty validity domain */
1397 }
1398
1399 if (CT)
1400 Domain_Free(Dt);
1401
1402 fVD[nd] = Domain_Copy(rVD);
1403 for (int i = 0 ; i < nd; ++i) {
1404 Polyhedron *I = DomainIntersection(fVD[nd], fVD[i], MaxRays);
1405 if (emptyQ(I)) {
1406 Domain_Free(I);
1407 continue;
1408 }
1409 Polyhedron *F = DomainSimplify(I, fVD[nd], MaxRays);
1410 if (F->NbEq == 1) {
1411 Polyhedron *T = rVD;
1412 rVD = DomainDifference(rVD, F, MaxRays);
1413 Domain_Free(T);
1414 }
1415 Domain_Free(F);
1416 Domain_Free(I);
1417 }
1418
1419 rVD = DomainConstraintSimplify(rVD, MaxRays);
1420 if (emptyQ(rVD)) {
1421 Domain_Free(rVD);
1422 return 0;
1423 }
1424
1425 Value c;
1426 value_init(c);
1427 barvinok_count(rVD, &c, MaxRays);
1428 if (value_zero_p(c)) {
1429 Domain_Free(rVD);
1430 rVD = 0;
1431 }
1432 value_clear(c);
1433
1434 return rVD;
1435 }
1436
1437 evalue* barvinok_enumerate_ev(Polyhedron *P, Polyhedron* C, unsigned MaxRays)
1438 {
1439 //P = unfringe(P, MaxRays);
1440 Polyhedron *CEq = NULL, *rVD, *pVD, *CA;
1441 Matrix *CT = NULL;
1442 Param_Polyhedron *PP = NULL;
1443 Param_Domain *D, *next;
1444 Param_Vertices *V;
1445 int r = 0;
1446 unsigned nparam = C->Dimension;
1447 evalue *eres;
1448 ALLOC(eres);
1449 value_init(eres->d);
1450 value_set_si(eres->d, 0);
1451
1452 evalue factor;
1453 value_init(factor.d);
1454 evalue_set_si(&factor, 1, 1);
1455
1456 CA = align_context(C, P->Dimension, MaxRays);
1457 P = DomainIntersection(P, CA, MaxRays);
1458 Polyhedron_Free(CA);
1459
1460 if (C->Dimension == 0 || emptyQ(P)) {
1461 constant:
1462 eres->x.p = new_enode(partition, 2, -1);
1463 EVALUE_SET_DOMAIN(eres->x.p->arr[0],
1464 DomainConstraintSimplify(CEq ? CEq : Polyhedron_Copy(C), MaxRays));
1465 value_set_si(eres->x.p->arr[1].d, 1);
1466 value_init(eres->x.p->arr[1].x.n);
1467 if (emptyQ(P))
1468 value_set_si(eres->x.p->arr[1].x.n, 0);
1469 else
1470 barvinok_count(P, &eres->x.p->arr[1].x.n, MaxRays);
1471 out:
1472 emul(&factor, eres);
1473 reduce_evalue(eres);
1474 free_evalue_refs(&factor);
1475 Polyhedron_Free(P);
1476 if (CT)
1477 Matrix_Free(CT);
1478 if (PP)
1479 Param_Polyhedron_Free(PP);
1480
1481 return eres;
1482 }
1483 for (r = 0; r < P->NbRays; ++r)
1484 if (value_zero_p(P->Ray[r][0]) ||
1485 value_zero_p(P->Ray[r][P->Dimension+1])) {
1486 int i;
1487 for (i = P->Dimension - nparam; i < P->Dimension; ++i)
1488 if (value_notzero_p(P->Ray[r][i+1]))
1489 break;
1490 if (i >= P->Dimension)
1491 break;
1492 }
1493 if (r < P->NbRays)
1494 goto constant;
1495
1496 if (P->NbEq != 0) {
1497 Matrix *f;
1498 P = remove_equalities_p(P, P->Dimension-nparam, &f);
1499 mask(f, &factor);
1500 Matrix_Free(f);
1501 }
1502 if (P->Dimension == nparam) {
1503 CEq = P;
1504 P = Universe_Polyhedron(0);
1505 goto constant;
1506 }
1507
1508 Polyhedron *Q = ParamPolyhedron_Reduce(P, P->Dimension-nparam, &factor);
1509 if (Q) {
1510 Polyhedron_Free(P);
1511 if (Q->Dimension == nparam) {
1512 CEq = Q;
1513 P = Universe_Polyhedron(0);
1514 goto constant;
1515 }
1516 P = Q;
1517 }
1518 Polyhedron *oldP = P;
1519 PP = Polyhedron2Param_SimplifiedDomain(&P,C,MaxRays,&CEq,&CT);
1520 if (P != oldP)
1521 Polyhedron_Free(oldP);
1522
1523 if (isIdentity(CT)) {
1524 Matrix_Free(CT);
1525 CT = NULL;
1526 } else {
1527 assert(CT->NbRows != CT->NbColumns);
1528 if (CT->NbRows == 1) // no more parameters
1529 goto constant;
1530 nparam = CT->NbRows - 1;
1531 }
1532
1533 unsigned dim = P->Dimension - nparam;
1534 Polyhedron ** vcone = new (Polyhedron *)[PP->nbV];
1535 int * npos = new int[PP->nbV];
1536 int * nneg = new int[PP->nbV];
1537 vec_ZZ sign;
1538
1539 int i;
1540 for (i = 0, V = PP->V; V; ++i, V = V->next) {
1541 Polyhedron *C = supporting_cone_p(P, V);
1542 decompose(C, &vcone[i], &npos[i], &nneg[i], MaxRays);
1543 }
1544
1545 Vector *c = Vector_Alloc(dim+2);
1546
1547 int nd;
1548 for (nd = 0, D=PP->D; D; ++nd, D=D->next);
1549 struct section { Polyhedron *D; evalue E; };
1550 section *s = new section[nd];
1551 Polyhedron **fVD = new (Polyhedron*)[nd];
1552
1553 for(nd = 0, D=PP->D; D; D=next) {
1554 next = D->next;
1555
1556 Polyhedron *rVD = reduce_domain(D->Domain, CT, CEq,
1557 fVD, nd, MaxRays);
1558 if (!rVD)
1559 continue;
1560
1561 pVD = CT ? DomainImage(rVD,CT,MaxRays) : rVD;
1562
1563 int ncone = 0;
1564 sign.SetLength(ncone);
1565 FORALL_PVertex_in_ParamPolyhedron(V,D,PP) // _i is internal counter
1566 ncone += npos[_i] + nneg[_i];
1567 sign.SetLength(ncone);
1568 for (int k = 0; k < npos[_i]; ++k)
1569 sign[ncone-nneg[_i]-k-1] = 1;
1570 for (int k = 0; k < nneg[_i]; ++k)
1571 sign[ncone-k-1] = -1;
1572 END_FORALL_PVertex_in_ParamPolyhedron;
1573
1574 mat_ZZ rays;
1575 rays.SetDims(ncone * dim, dim);
1576 r = 0;
1577 FORALL_PVertex_in_ParamPolyhedron(V,D,PP) // _i is internal counter
1578 for (Polyhedron *i = vcone[_i]; i; i = i->next) {
1579 assert(i->NbRays-1 == dim);
1580 add_rays(rays, i, &r);
1581 }
1582 END_FORALL_PVertex_in_ParamPolyhedron;
1583 vec_ZZ lambda;
1584 nonorthog(rays, lambda);
1585
1586 mat_ZZ den;
1587 den.SetDims(ncone,dim);
1588 term_info *num = new term_info[ncone];
1589
1590 int f = 0;
1591 FORALL_PVertex_in_ParamPolyhedron(V,D,PP)
1592 for (Polyhedron *i = vcone[_i]; i; i = i->next) {
1593 lattice_point(V, i, lambda, &num[f], pVD);
1594 normalize(i, lambda, sign[f], num[f].constant, den[f]);
1595 ++f;
1596 }
1597 END_FORALL_PVertex_in_ParamPolyhedron;
1598 ZZ min = num[0].constant;
1599 for (int j = 1; j < ncone; ++j)
1600 if (num[j].constant < min)
1601 min = num[j].constant;
1602 for (int j = 0; j < ncone; ++j)
1603 num[j].constant -= min;
1604 f = 0;
1605 value_init(s[nd].E.d);
1606 evalue_set_si(&s[nd].E, 0, 1);
1607 mpq_t count;
1608 mpq_init(count);
1609 FORALL_PVertex_in_ParamPolyhedron(V,D,PP)
1610 for (Polyhedron *i = vcone[_i]; i; i = i->next) {
1611 dpoly n(dim, den[f][0], 1);
1612 for (int k = 1; k < dim; ++k) {
1613 dpoly fact(dim, den[f][k], 1);
1614 n *= fact;
1615 }
1616 if (num[f].E != NULL) {
1617 ZZ one(INIT_VAL, 1);
1618 dpoly_n d(dim, num[f].constant, one);
1619 d.div(n, c, sign[f]);
1620 evalue EV;
1621 multi_polynom(c, num[f].E, &EV);
1622 eadd(&EV , &s[nd].E);
1623 free_evalue_refs(&EV);
1624 free_evalue_refs(num[f].E);
1625 delete num[f].E;
1626 } else if (num[f].pos != -1) {
1627 dpoly_n d(dim, num[f].constant, num[f].coeff);
1628 d.div(n, c, sign[f]);
1629 evalue EV;
1630 uni_polynom(num[f].pos, c, &EV);
1631 eadd(&EV , &s[nd].E);
1632 free_evalue_refs(&EV);
1633 } else {
1634 mpq_set_si(count, 0, 1);
1635 dpoly d(dim, num[f].constant);
1636 d.div(n, count, sign[f]);
1637 evalue EV;
1638 value_init(EV.d);
1639 evalue_set(&EV, &count[0]._mp_num, &count[0]._mp_den);
1640 eadd(&EV , &s[nd].E);
1641 free_evalue_refs(&EV);
1642 }
1643 ++f;
1644 }
1645 END_FORALL_PVertex_in_ParamPolyhedron;
1646
1647 mpq_clear(count);
1648 delete [] num;
1649
1650 if (CT)
1651 addeliminatedparams_evalue(&s[nd].E, CT);
1652 s[nd].D = rVD;
1653 ++nd;
1654 if (rVD != pVD)
1655 Domain_Free(pVD);
1656 }
1657
1658 if (nd == 0)
1659 evalue_set_si(eres, 0, 1);
1660 else {
1661 eres->x.p = new_enode(partition, 2*nd, -1);
1662 for (int j = 0; j < nd; ++j) {
1663 EVALUE_SET_DOMAIN(eres->x.p->arr[2*j], s[j].D);
1664 value_clear(eres->x.p->arr[2*j+1].d);
1665 eres->x.p->arr[2*j+1] = s[j].E;
1666 Domain_Free(fVD[j]);
1667 }
1668 }
1669 delete [] s;
1670 delete [] fVD;
1671
1672 Vector_Free(c);
1673
1674 for (int j = 0; j < PP->nbV; ++j)
1675 Domain_Free(vcone[j]);
1676 delete [] vcone;
1677 delete [] npos;
1678 delete [] nneg;
1679
1680 if (CEq)
1681 Polyhedron_Free(CEq);
1682
1683 goto out;
1684 }
1685
1686 Enumeration* barvinok_enumerate(Polyhedron *P, Polyhedron* C, unsigned MaxRays)
1687 {
1688 evalue *EP = barvinok_enumerate_ev(P, C, MaxRays);
1689
1690 return partition2enumeration(EP);
1691 }
1692
1693 static void SwapColumns(Value **V, int n, int i, int j)
1694 {
1695 for (int r = 0; r < n; ++r)
1696 value_swap(V[r][i], V[r][j]);
1697 }
1698
1699 static void SwapColumns(Polyhedron *P, int i, int j)
1700 {
1701 SwapColumns(P->Constraint, P->NbConstraints, i, j);
1702 SwapColumns(P->Ray, P->NbRays, i, j);
1703 }
1704
1705 static bool SplitOnConstraint(Polyhedron *P, int i, int l, int u,
1706 int nvar, int len, int exist, int MaxRays,
1707 Vector *row, Value& f, bool independent,
1708 Polyhedron **pos, Polyhedron **neg)
1709 {
1710 value_oppose(f, P->Constraint[u][nvar+i+1]);
1711 Vector_Combine(P->Constraint[l]+1, P->Constraint[u]+1,
1712 row->p+1,
1713 f, P->Constraint[l][nvar+i+1], len-1);
1714
1715 //printf("l: %d, u: %d\n", l, u);
1716 value_multiply(f, f, P->Constraint[l][nvar+i+1]);
1717 value_substract(row->p[len-1], row->p[len-1], f);
1718 value_set_si(f, -1);
1719 Vector_Scale(row->p+1, row->p+1, f, len-1);
1720 value_decrement(row->p[len-1], row->p[len-1]);
1721 Vector_Gcd(row->p+1, len - 2, &f);
1722 if (value_notone_p(f)) {
1723 Vector_AntiScale(row->p+1, row->p+1, f, len-2);
1724 mpz_fdiv_q(row->p[len-1], row->p[len-1], f);
1725 }
1726 *neg = AddConstraints(row->p, 1, P, MaxRays);
1727
1728 /* We found an independent, but useless constraint
1729 * Maybe we should detect this earlier and not
1730 * mark the variable as INDEPENDENT
1731 */
1732 if (emptyQ((*neg))) {
1733 Polyhedron_Free(*neg);
1734 return false;
1735 }
1736
1737 value_set_si(f, -1);
1738 Vector_Scale(row->p+1, row->p+1, f, len-1);
1739 value_decrement(row->p[len-1], row->p[len-1]);
1740 *pos = AddConstraints(row->p, 1, P, MaxRays);
1741
1742 if (emptyQ((*pos))) {
1743 Polyhedron_Free(*neg);
1744 Polyhedron_Free(*pos);
1745 return false;
1746 }
1747
1748 return true;
1749 }
1750
1751 /*
1752 * unimodularly transform P such that constraint r is transformed
1753 * into a constraint that involves only a single (the first)
1754 * existential variable
1755 *
1756 */
1757 static Polyhedron *rotate_along(Polyhedron *P, int r, int nvar, int exist,
1758 unsigned MaxRays)
1759 {
1760 Value g;
1761 value_init(g);
1762
1763 Vector *row = Vector_Alloc(exist);
1764 Vector_Copy(P->Constraint[r]+1+nvar, row->p, exist);
1765 Vector_Gcd(row->p, exist, &g);
1766 if (value_notone_p(g))
1767 Vector_AntiScale(row->p, row->p, g, exist);
1768 value_clear(g);
1769
1770 Matrix *M = unimodular_complete(row);
1771 Matrix *M2 = Matrix_Alloc(P->Dimension+1, P->Dimension+1);
1772 for (r = 0; r < nvar; ++r)
1773 value_set_si(M2->p[r][r], 1);
1774 for ( ; r < nvar+exist; ++r)
1775 Vector_Copy(M->p[r-nvar], M2->p[r]+nvar, exist);
1776 for ( ; r < P->Dimension+1; ++r)
1777 value_set_si(M2->p[r][r], 1);
1778 Polyhedron *T = Polyhedron_Image(P, M2, MaxRays);
1779
1780 Matrix_Free(M2);
1781 Matrix_Free(M);
1782 Vector_Free(row);
1783
1784 return T;
1785 }
1786
1787 static bool SplitOnVar(Polyhedron *P, int i,
1788 int nvar, int len, int exist, int MaxRays,
1789 Vector *row, Value& f, bool independent,
1790 Polyhedron **pos, Polyhedron **neg)
1791 {
1792 int j;
1793
1794 for (int l = P->NbEq; l < P->NbConstraints; ++l) {
1795 if (value_negz_p(P->Constraint[l][nvar+i+1]))
1796 continue;
1797
1798 if (independent) {
1799 for (j = 0; j < exist; ++j)
1800 if (j != i && value_notzero_p(P->Constraint[l][nvar+j+1]))
1801 break;
1802 if (j < exist)
1803 continue;
1804 }
1805
1806 for (int u = P->NbEq; u < P->NbConstraints; ++u) {
1807 if (value_posz_p(P->Constraint[u][nvar+i+1]))
1808 continue;
1809
1810 if (independent) {
1811 for (j = 0; j < exist; ++j)
1812 if (j != i && value_notzero_p(P->Constraint[u][nvar+j+1]))
1813 break;
1814 if (j < exist)
1815 continue;
1816 }
1817
1818 if (SplitOnConstraint(P, i, l, u,
1819 nvar, len, exist, MaxRays,
1820 row, f, independent,
1821 pos, neg)) {
1822 if (independent) {
1823 if (i != 0)
1824 SwapColumns(*neg, nvar+1, nvar+1+i);
1825 }
1826 return true;
1827 }
1828 }
1829 }
1830
1831 return false;
1832 }
1833
1834 static bool double_bound_pair(Polyhedron *P, int nvar, int exist,
1835 int i, int l1, int l2,
1836 Polyhedron **pos, Polyhedron **neg)
1837 {
1838 Value f;
1839 value_init(f);
1840 Vector *row = Vector_Alloc(P->Dimension+2);
1841 value_set_si(row->p[0], 1);
1842 value_oppose(f, P->Constraint[l1][nvar+i+1]);
1843 Vector_Combine(P->Constraint[l1]+1, P->Constraint[l2]+1,
1844 row->p+1,
1845 P->Constraint[l2][nvar+i+1], f,
1846 P->Dimension+1);
1847 ConstraintSimplify(row->p, row->p, P->Dimension+2, &f);
1848 *pos = AddConstraints(row->p, 1, P, 0);
1849 value_set_si(f, -1);
1850 Vector_Scale(row->p+1, row->p+1, f, P->Dimension+1);
1851 value_decrement(row->p[P->Dimension+1], row->p[P->Dimension+1]);
1852 *neg = AddConstraints(row->p, 1, P, 0);
1853 Vector_Free(row);
1854 value_clear(f);
1855
1856 return !emptyQ((*pos)) && !emptyQ((*neg));
1857 }
1858
1859 static bool double_bound(Polyhedron *P, int nvar, int exist,
1860 Polyhedron **pos, Polyhedron **neg)
1861 {
1862 for (int i = 0; i < exist; ++i) {
1863 int l1, l2;
1864 for (l1 = P->NbEq; l1 < P->NbConstraints; ++l1) {
1865 if (value_negz_p(P->Constraint[l1][nvar+i+1]))
1866 continue;
1867 for (l2 = l1 + 1; l2 < P->NbConstraints; ++l2) {
1868 if (value_negz_p(P->Constraint[l2][nvar+i+1]))
1869 continue;
1870 if (double_bound_pair(P, nvar, exist, i, l1, l2, pos, neg))
1871 return true;
1872 }
1873 }
1874 for (l1 = P->NbEq; l1 < P->NbConstraints; ++l1) {
1875 if (value_posz_p(P->Constraint[l1][nvar+i+1]))
1876 continue;
1877 if (l1 < P->NbConstraints)
1878 for (l2 = l1 + 1; l2 < P->NbConstraints; ++l2) {
1879 if (value_posz_p(P->Constraint[l2][nvar+i+1]))
1880 continue;
1881 if (double_bound_pair(P, nvar, exist, i, l1, l2, pos, neg))
1882 return true;
1883 }
1884 }
1885 return false;
1886 }
1887 return false;
1888 }
1889
1890 enum constraint {
1891 ALL_POS = 1 << 0,
1892 ONE_NEG = 1 << 1,
1893 INDEPENDENT = 1 << 2,
1894 };
1895
1896 static evalue* enumerate_or(Polyhedron *pos, Polyhedron *neg,
1897 unsigned exist, unsigned nparam, unsigned MaxRays)
1898 {
1899 #ifdef DEBUG_ER
1900 fprintf(stderr, "\nER: Or\n");
1901 #endif /* DEBUG_ER */
1902
1903 evalue *EN =
1904 barvinok_enumerate_e(neg, exist, nparam, MaxRays);
1905 evalue *EP =
1906 barvinok_enumerate_e(pos, exist, nparam, MaxRays);
1907 evalue E;
1908 value_init(E.d);
1909 evalue_copy(&E, EP);
1910 eadd(EN, &E);
1911 emul(EN, EP);
1912 free_evalue_refs(EN);
1913 value_init(EN->d);
1914 evalue_set_si(EN, -1, 1);
1915 emul(EN, EP);
1916 eadd(&E, EP);
1917
1918 free_evalue_refs(EN);
1919 free(EN);
1920 free_evalue_refs(&E);
1921 Polyhedron_Free(neg);
1922 Polyhedron_Free(pos);
1923
1924 reduce_evalue(EP);
1925
1926 return EP;
1927 }
1928
1929 static evalue* enumerate_sum(Polyhedron *P,
1930 unsigned exist, unsigned nparam, unsigned MaxRays)
1931 {
1932 int nvar = P->Dimension - exist - nparam;
1933 int toswap = nvar < exist ? nvar : exist;
1934 for (int i = 0; i < toswap; ++i)
1935 SwapColumns(P, 1 + i, nvar+exist - i);
1936 nparam += nvar;
1937
1938 #ifdef DEBUG_ER
1939 fprintf(stderr, "\nER: Sum\n");
1940 #endif /* DEBUG_ER */
1941
1942 evalue *EP = barvinok_enumerate_e(P, exist, nparam, MaxRays);
1943
1944 for (int i = 0; i < /* nvar */ nparam; ++i) {
1945 Matrix *C = Matrix_Alloc(1, 1 + nparam + 1);
1946 value_set_si(C->p[0][0], 1);
1947 evalue split;
1948 value_init(split.d);
1949 value_set_si(split.d, 0);
1950 split.x.p = new_enode(partition, 4, -1);
1951 value_set_si(C->p[0][1+i], 1);
1952 Matrix *C2 = Matrix_Copy(C);
1953 EVALUE_SET_DOMAIN(split.x.p->arr[0],
1954 Constraints2Polyhedron(C2, MaxRays));
1955 Matrix_Free(C2);
1956 evalue_set_si(&split.x.p->arr[1], 1, 1);
1957 value_set_si(C->p[0][1+i], -1);
1958 value_set_si(C->p[0][1+nparam], -1);
1959 EVALUE_SET_DOMAIN(split.x.p->arr[2],
1960 Constraints2Polyhedron(C, MaxRays));
1961 evalue_set_si(&split.x.p->arr[3], 1, 1);
1962 emul(&split, EP);
1963 free_evalue_refs(&split);
1964 Matrix_Free(C);
1965 }
1966 reduce_evalue(EP);
1967 evalue_range_reduction(EP);
1968
1969 evalue_frac2floor(EP);
1970
1971 evalue *sum = esum(EP, nvar);
1972
1973 free_evalue_refs(EP);
1974 free(EP);
1975 EP = sum;
1976
1977 evalue_range_reduction(EP);
1978
1979 return EP;
1980 }
1981
1982 static evalue* split_sure(Polyhedron *P, Polyhedron *S,
1983 unsigned exist, unsigned nparam, unsigned MaxRays)
1984 {
1985 int nvar = P->Dimension - exist - nparam;
1986
1987 Matrix *M = Matrix_Alloc(exist, S->Dimension+2);
1988 for (int i = 0; i < exist; ++i)
1989 value_set_si(M->p[i][nvar+i+1], 1);
1990 Polyhedron *O = S;
1991 S = DomainAddRays(S, M, MaxRays);
1992 Polyhedron_Free(O);
1993 Polyhedron *F = DomainAddRays(P, M, MaxRays);
1994 Polyhedron *D = DomainDifference(F, S, MaxRays);
1995 O = D;
1996 D = Disjoint_Domain(D, 0, MaxRays);
1997 Polyhedron_Free(F);
1998 Domain_Free(O);
1999 Matrix_Free(M);
2000
2001 M = Matrix_Alloc(P->Dimension+1-exist, P->Dimension+1);
2002 for (int j = 0; j < nvar; ++j)
2003 value_set_si(M->p[j][j], 1);
2004 for (int j = 0; j < nparam+1; ++j)
2005 value_set_si(M->p[nvar+j][nvar+exist+j], 1);
2006 Polyhedron *T = Polyhedron_Image(S, M, MaxRays);
2007 evalue *EP = barvinok_enumerate_e(T, 0, nparam, MaxRays);
2008 Polyhedron_Free(S);
2009 Polyhedron_Free(T);
2010 Matrix_Free(M);
2011
2012 for (Polyhedron *Q = D; Q; Q = Q->next) {
2013 Polyhedron *N = Q->next;
2014 Q->next = 0;
2015 T = DomainIntersection(P, Q, MaxRays);
2016 evalue *E = barvinok_enumerate_e(T, exist, nparam, MaxRays);
2017 eadd(E, EP);
2018 free_evalue_refs(E);
2019 free(E);
2020 Polyhedron_Free(T);
2021 Q->next = N;
2022 }
2023 Domain_Free(D);
2024 return EP;
2025 }
2026
2027 static evalue* enumerate_sure(Polyhedron *P,
2028 unsigned exist, unsigned nparam, unsigned MaxRays)
2029 {
2030 int i;
2031 Polyhedron *S = P;
2032 int nvar = P->Dimension - exist - nparam;
2033
2034 for (i = 0; i < exist; ++i) {
2035 Matrix *M = Matrix_Alloc(S->NbConstraints, S->Dimension+2);
2036 int c = 0;
2037 for (int j = 0; j < S->NbConstraints; ++j) {
2038 if (value_negz_p(S->Constraint[j][1+nvar+i]))
2039 continue;
2040 if (value_one_p(S->Constraint[j][1+nvar+i]))
2041 continue;
2042 Vector_Copy(S->Constraint[j], M->p[c], S->Dimension+2);
2043 value_substract(M->p[c][S->Dimension+1],
2044 M->p[c][S->Dimension+1],
2045 S->Constraint[j][1+nvar+i]);
2046 value_increment(M->p[c][S->Dimension+1],
2047 M->p[c][S->Dimension+1]);
2048 ++c;
2049 }
2050 Polyhedron *O = S;
2051 S = AddConstraints(M->p[0], c, S, MaxRays);
2052 if (O != P)
2053 Polyhedron_Free(O);
2054 Matrix_Free(M);
2055 if (emptyQ(S)) {
2056 Polyhedron_Free(S);
2057 return 0;
2058 }
2059 }
2060
2061 #ifdef DEBUG_ER
2062 fprintf(stderr, "\nER: Sure\n");
2063 #endif /* DEBUG_ER */
2064
2065 return split_sure(P, S, exist, nparam, MaxRays);
2066 }
2067
2068 static evalue* enumerate_sure2(Polyhedron *P,
2069 unsigned exist, unsigned nparam, unsigned MaxRays)
2070 {
2071 int nvar = P->Dimension - exist - nparam;
2072 int r;
2073 for (r = 0; r < P->NbRays; ++r)
2074 if (value_one_p(P->Ray[r][0]) &&
2075 value_one_p(P->Ray[r][P->Dimension+1]))
2076 break;
2077
2078 if (r >= P->NbRays)
2079 return 0;
2080
2081 Matrix *M = Matrix_Alloc(nvar + 1 + nparam, P->Dimension+2);
2082 for (int i = 0; i < nvar; ++i)
2083 value_set_si(M->p[i][1+i], 1);
2084 for (int i = 0; i < nparam; ++i)
2085 value_set_si(M->p[i+nvar][1+nvar+exist+i], 1);
2086 Vector_Copy(P->Ray[r]+1+nvar, M->p[nvar+nparam]+1+nvar, exist);
2087 value_set_si(M->p[nvar+nparam][0], 1);
2088 value_set_si(M->p[nvar+nparam][P->Dimension+1], 1);
2089 Polyhedron * F = Rays2Polyhedron(M, MaxRays);
2090 Matrix_Free(M);
2091
2092 Polyhedron *I = DomainIntersection(F, P, MaxRays);
2093 Polyhedron_Free(F);
2094
2095 #ifdef DEBUG_ER
2096 fprintf(stderr, "\nER: Sure2\n");
2097 #endif /* DEBUG_ER */
2098
2099 return split_sure(P, I, exist, nparam, MaxRays);
2100 }
2101
2102 static evalue* new_zero_ep()
2103 {
2104 evalue *EP;
2105 ALLOC(EP);
2106 value_init(EP->d);
2107 evalue_set_si(EP, 0, 1);
2108 return EP;
2109 }
2110
2111 static evalue* enumerate_vd(Polyhedron **PA,
2112 unsigned exist, unsigned nparam, unsigned MaxRays)
2113 {
2114 Polyhedron *P = *PA;
2115 int nvar = P->Dimension - exist - nparam;
2116 Param_Polyhedron *PP = NULL;
2117 Polyhedron *C = Universe_Polyhedron(nparam);
2118 Polyhedron *CEq;
2119 Matrix *CT;
2120 Polyhedron *PR = P;
2121 PP = Polyhedron2Param_SimplifiedDomain(&PR,C,MaxRays,&CEq,&CT);
2122 Polyhedron_Free(C);
2123
2124 int nd;
2125 Param_Domain *D, *last;
2126 Value c;
2127 value_init(c);
2128 for (nd = 0, D=PP->D; D; D=D->next, ++nd)
2129 ;
2130
2131 Polyhedron **VD = new (Polyhedron*)[nd];
2132 Polyhedron **fVD = new (Polyhedron*)[nd];
2133 for(nd = 0, D=PP->D; D; D=D->next) {
2134 Polyhedron *rVD = reduce_domain(D->Domain, CT, CEq,
2135 fVD, nd, MaxRays);
2136 if (!rVD)
2137 continue;
2138
2139 VD[nd++] = rVD;
2140 last = D;
2141 }
2142
2143 evalue *EP = 0;
2144
2145 if (nd == 0)
2146 EP = new_zero_ep();
2147
2148 /* This doesn't seem to have any effect */
2149 if (nd == 1) {
2150 Polyhedron *CA = align_context(VD[0], P->Dimension, MaxRays);
2151 Polyhedron *O = P;
2152 P = DomainIntersection(P, CA, MaxRays);
2153 if (O != *PA)
2154 Polyhedron_Free(O);
2155 Polyhedron_Free(CA);
2156 if (emptyQ(P))
2157 EP = new_zero_ep();
2158 }
2159
2160 if (!EP && CT->NbColumns != CT->NbRows) {
2161 Polyhedron *CEqr = DomainImage(CEq, CT, MaxRays);
2162 Polyhedron *CA = align_context(CEqr, PR->Dimension, MaxRays);
2163 Polyhedron *I = DomainIntersection(PR, CA, MaxRays);
2164 Polyhedron_Free(CEqr);
2165 Polyhedron_Free(CA);
2166 #ifdef DEBUG_ER
2167 fprintf(stderr, "\nER: Eliminate\n");
2168 #endif /* DEBUG_ER */
2169 nparam -= CT->NbColumns - CT->NbRows;
2170 EP = barvinok_enumerate_e(I, exist, nparam, MaxRays);
2171 addeliminatedparams_enum(EP, CT, CEq, MaxRays);
2172 Polyhedron_Free(I);
2173 }
2174 PR = 0;
2175
2176 if (!EP && nd > 1) {
2177 #ifdef DEBUG_ER
2178 fprintf(stderr, "\nER: VD\n");
2179 #endif /* DEBUG_ER */
2180 for (int i = 0; i < nd; ++i) {
2181 Polyhedron *CA = align_context(VD[i], P->Dimension, MaxRays);
2182 Polyhedron *I = DomainIntersection(P, CA, MaxRays);
2183
2184 if (i == 0)
2185 EP = barvinok_enumerate_e(I, exist, nparam, MaxRays);
2186 else {
2187 evalue *E = barvinok_enumerate_e(I, exist, nparam, MaxRays);
2188 eadd(E, EP);
2189 free_evalue_refs(E);
2190 free(E);
2191 }
2192 Polyhedron_Free(I);
2193 Polyhedron_Free(CA);
2194 }
2195 }
2196
2197 for (int i = 0; i < nd; ++i) {
2198 Polyhedron_Free(VD[i]);
2199 Polyhedron_Free(fVD[i]);
2200 }
2201 delete [] VD;
2202 delete [] fVD;
2203 value_clear(c);
2204
2205 if (!EP && nvar == 0) {
2206 Value f;
2207 value_init(f);
2208 Param_Vertices *V, *V2;
2209 Matrix* M = Matrix_Alloc(1, P->Dimension+2);
2210
2211 FORALL_PVertex_in_ParamPolyhedron(V, last, PP) {
2212 bool found = false;
2213 FORALL_PVertex_in_ParamPolyhedron(V2, last, PP) {
2214 if (V == V2) {
2215 found = true;
2216 continue;
2217 }
2218 if (!found)
2219 continue;
2220 for (int i = 0; i < exist; ++i) {
2221 value_oppose(f, V->Vertex->p[i][nparam+1]);
2222 Vector_Combine(V->Vertex->p[i],
2223 V2->Vertex->p[i],
2224 M->p[0] + 1 + nvar + exist,
2225 V2->Vertex->p[i][nparam+1],
2226 f,
2227 nparam+1);
2228 int j;
2229 for (j = 0; j < nparam; ++j)
2230 if (value_notzero_p(M->p[0][1+nvar+exist+j]))
2231 break;
2232 if (j >= nparam)
2233 continue;
2234 ConstraintSimplify(M->p[0], M->p[0],
2235 P->Dimension+2, &f);
2236 value_set_si(M->p[0][0], 0);
2237 Polyhedron *para = AddConstraints(M->p[0], 1, P,
2238 MaxRays);
2239 if (emptyQ(para)) {
2240 Polyhedron_Free(para);
2241 continue;
2242 }
2243 Polyhedron *pos, *neg;
2244 value_set_si(M->p[0][0], 1);
2245 value_decrement(M->p[0][P->Dimension+1],
2246 M->p[0][P->Dimension+1]);
2247 neg = AddConstraints(M->p[0], 1, P, MaxRays);
2248 value_set_si(f, -1);
2249 Vector_Scale(M->p[0]+1, M->p[0]+1, f,
2250 P->Dimension+1);
2251 value_decrement(M->p[0][P->Dimension+1],
2252 M->p[0][P->Dimension+1]);
2253 value_decrement(M->p[0][P->Dimension+1],
2254 M->p[0][P->Dimension+1]);
2255 pos = AddConstraints(M->p[0], 1, P, MaxRays);
2256 if (emptyQ(neg) && emptyQ(pos)) {
2257 Polyhedron_Free(para);
2258 Polyhedron_Free(pos);
2259 Polyhedron_Free(neg);
2260 continue;
2261 }
2262 #ifdef DEBUG_ER
2263 fprintf(stderr, "\nER: Order\n");
2264 #endif /* DEBUG_ER */
2265 EP = barvinok_enumerate_e(para, exist, nparam, MaxRays);
2266 evalue *E;
2267 if (!emptyQ(pos)) {
2268 E = barvinok_enumerate_e(pos, exist, nparam, MaxRays);
2269 eadd(E, EP);
2270 free_evalue_refs(E);
2271 free(E);
2272 }
2273 if (!emptyQ(neg)) {
2274 E = barvinok_enumerate_e(neg, exist, nparam, MaxRays);
2275 eadd(E, EP);
2276 free_evalue_refs(E);
2277 free(E);
2278 }
2279 break;
2280 }
2281 if (EP)
2282 break;
2283 } END_FORALL_PVertex_in_ParamPolyhedron;
2284 if (EP)
2285 break;
2286 } END_FORALL_PVertex_in_ParamPolyhedron;
2287
2288 if (!EP) {
2289 /* Search for vertex coordinate to split on */
2290 /* First look for one independent of the parameters */
2291 FORALL_PVertex_in_ParamPolyhedron(V, last, PP) {
2292 for (int i = 0; i < exist; ++i) {
2293 int j;
2294 for (j = 0; j < nparam; ++j)
2295 if (value_notzero_p(V->Vertex->p[i][j]))
2296 break;
2297 if (j < nparam)
2298 continue;
2299 value_set_si(M->p[0][0], 1);
2300 Vector_Set(M->p[0]+1, 0, nvar+exist);
2301 Vector_Copy(V->Vertex->p[i],
2302 M->p[0] + 1 + nvar + exist, nparam+1);
2303 value_oppose(M->p[0][1+nvar+i],
2304 V->Vertex->p[i][nparam+1]);
2305
2306 Polyhedron *pos, *neg;
2307 value_set_si(M->p[0][0], 1);
2308 value_decrement(M->p[0][P->Dimension+1],
2309 M->p[0][P->Dimension+1]);
2310 neg = AddConstraints(M->p[0], 1, P, MaxRays);
2311 value_set_si(f, -1);
2312 Vector_Scale(M->p[0]+1, M->p[0]+1, f,
2313 P->Dimension+1);
2314 value_decrement(M->p[0][P->Dimension+1],
2315 M->p[0][P->Dimension+1]);
2316 value_decrement(M->p[0][P->Dimension+1],
2317 M->p[0][P->Dimension+1]);
2318 pos = AddConstraints(M->p[0], 1, P, MaxRays);
2319 if (emptyQ(neg) || emptyQ(pos)) {
2320 Polyhedron_Free(pos);
2321 Polyhedron_Free(neg);
2322 continue;
2323 }
2324 Polyhedron_Free(pos);
2325 value_increment(M->p[0][P->Dimension+1],
2326 M->p[0][P->Dimension+1]);
2327 pos = AddConstraints(M->p[0], 1, P, MaxRays);
2328 #ifdef DEBUG_ER
2329 fprintf(stderr, "\nER: Vertex\n");
2330 #endif /* DEBUG_ER */
2331 EP = enumerate_or(pos, neg, exist, nparam, MaxRays);
2332 break;
2333 }
2334 if (EP)
2335 break;
2336 } END_FORALL_PVertex_in_ParamPolyhedron;
2337 }
2338
2339 if (!EP) {
2340 /* Search for vertex coordinate to split on */
2341 /* Now look for one that depends on the parameters */
2342 FORALL_PVertex_in_ParamPolyhedron(V, last, PP) {
2343 for (int i = 0; i < exist; ++i) {
2344 value_set_si(M->p[0][0], 1);
2345 Vector_Set(M->p[0]+1, 0, nvar+exist);
2346 Vector_Copy(V->Vertex->p[i],
2347 M->p[0] + 1 + nvar + exist, nparam+1);
2348 value_oppose(M->p[0][1+nvar+i],
2349 V->Vertex->p[i][nparam+1]);
2350
2351 Polyhedron *pos, *neg;
2352 value_set_si(M->p[0][0], 1);
2353 value_decrement(M->p[0][P->Dimension+1],
2354 M->p[0][P->Dimension+1]);
2355 neg = AddConstraints(M->p[0], 1, P, MaxRays);
2356 value_set_si(f, -1);
2357 Vector_Scale(M->p[0]+1, M->p[0]+1, f,
2358 P->Dimension+1);
2359 value_decrement(M->p[0][P->Dimension+1],
2360 M->p[0][P->Dimension+1]);
2361 value_decrement(M->p[0][P->Dimension+1],
2362 M->p[0][P->Dimension+1]);
2363 pos = AddConstraints(M->p[0], 1, P, MaxRays);
2364 if (emptyQ(neg) || emptyQ(pos)) {
2365 Polyhedron_Free(pos);
2366 Polyhedron_Free(neg);
2367 continue;
2368 }
2369 Polyhedron_Free(pos);
2370 value_increment(M->p[0][P->Dimension+1],
2371 M->p[0][P->Dimension+1]);
2372 pos = AddConstraints(M->p[0], 1, P, MaxRays);
2373 #ifdef DEBUG_ER
2374 fprintf(stderr, "\nER: ParamVertex\n");
2375 #endif /* DEBUG_ER */
2376 EP = enumerate_or(pos, neg, exist, nparam, MaxRays);
2377 break;
2378 }
2379 if (EP)
2380 break;
2381 } END_FORALL_PVertex_in_ParamPolyhedron;
2382 }
2383
2384 Matrix_Free(M);
2385 value_clear(f);
2386 }
2387
2388 if (CEq)
2389 Polyhedron_Free(CEq);
2390 if (CT)
2391 Matrix_Free(CT);
2392 if (PP)
2393 Param_Polyhedron_Free(PP);
2394 *PA = P;
2395
2396 return EP;
2397 }
2398
2399 static evalue* barvinok_enumerate_e_r(Polyhedron *P,
2400 unsigned exist, unsigned nparam, unsigned MaxRays);
2401
2402 #ifdef DEBUG_ER
2403 static int er_level = 0;
2404
2405 evalue* barvinok_enumerate_e(Polyhedron *P,
2406 unsigned exist, unsigned nparam, unsigned MaxRays)
2407 {
2408 fprintf(stderr, "\nER: level %i\n", er_level);
2409 int nvar = P->Dimension - exist - nparam;
2410 fprintf(stderr, "%d %d %d\n", nvar, exist, nparam);
2411
2412 Polyhedron_Print(stderr, P_VALUE_FMT, P);
2413 ++er_level;
2414 P = DomainConstraintSimplify(Polyhedron_Copy(P), MaxRays);
2415 evalue *EP = barvinok_enumerate_e_r(P, exist, nparam, MaxRays);
2416 Polyhedron_Free(P);
2417 --er_level;
2418 return EP;
2419 }
2420 #else
2421 evalue* barvinok_enumerate_e(Polyhedron *P,
2422 unsigned exist, unsigned nparam, unsigned MaxRays)
2423 {
2424 P = DomainConstraintSimplify(Polyhedron_Copy(P), MaxRays);
2425 evalue *EP = barvinok_enumerate_e_r(P, exist, nparam, MaxRays);
2426 Polyhedron_Free(P);
2427 return EP;
2428 }
2429 #endif
2430
2431 static evalue* barvinok_enumerate_e_r(Polyhedron *P,
2432 unsigned exist, unsigned nparam, unsigned MaxRays)
2433 {
2434 if (exist == 0) {
2435 Polyhedron *U = Universe_Polyhedron(nparam);
2436 evalue *EP = barvinok_enumerate_ev(P, U, MaxRays);
2437 //char *param_name[] = {"P", "Q", "R", "S", "T" };
2438 //print_evalue(stdout, EP, param_name);
2439 Polyhedron_Free(U);
2440 return EP;
2441 }
2442
2443 int nvar = P->Dimension - exist - nparam;
2444 int len = P->Dimension + 2;
2445
2446 if (emptyQ(P))
2447 return new_zero_ep();
2448
2449 if (nvar == 0 && nparam == 0) {
2450 evalue *EP = new_zero_ep();
2451 barvinok_count(P, &EP->x.n, MaxRays);
2452 if (value_pos_p(EP->x.n))
2453 value_set_si(EP->x.n, 1);
2454 return EP;
2455 }
2456
2457 int r;
2458 for (r = 0; r < P->NbRays; ++r)
2459 if (value_zero_p(P->Ray[r][0]) ||
2460 value_zero_p(P->Ray[r][P->Dimension+1])) {
2461 int i;
2462 for (i = 0; i < nvar; ++i)
2463 if (value_notzero_p(P->Ray[r][i+1]))
2464 break;
2465 if (i >= nvar)
2466 continue;
2467 for (i = nvar; i < nvar + exist; ++i)
2468 if (value_notzero_p(P->Ray[r][i+1]))
2469 break;
2470 if (i >= nvar + exist)
2471 break;
2472 }
2473 if (r < P->NbRays) {
2474 evalue *EP = new_zero_ep();
2475 value_set_si(EP->x.n, -1);
2476 return EP;
2477 }
2478
2479 int first;
2480 for (r = 0; r < P->NbEq; ++r)
2481 if ((first = First_Non_Zero(P->Constraint[r]+1+nvar, exist)) != -1)
2482 break;
2483 if (r < P->NbEq) {
2484 if (First_Non_Zero(P->Constraint[r]+1+nvar+first+1,
2485 exist-first-1) != -1) {
2486 Polyhedron *T = rotate_along(P, r, nvar, exist, MaxRays);
2487 #ifdef DEBUG_ER
2488 fprintf(stderr, "\nER: Equality\n");
2489 #endif /* DEBUG_ER */
2490 evalue *EP = barvinok_enumerate_e(T, exist-1, nparam, MaxRays);
2491 Polyhedron_Free(T);
2492 return EP;
2493 } else {
2494 #ifdef DEBUG_ER
2495 fprintf(stderr, "\nER: Fixed\n");
2496 #endif /* DEBUG_ER */
2497 if (first == 0)
2498 return barvinok_enumerate_e(P, exist-1, nparam, MaxRays);
2499 else {
2500 Polyhedron *T = Polyhedron_Copy(P);
2501 SwapColumns(T, nvar+1, nvar+1+first);
2502 evalue *EP = barvinok_enumerate_e(T, exist-1, nparam, MaxRays);
2503 Polyhedron_Free(T);
2504 return EP;
2505 }
2506 }
2507 }
2508
2509 Vector *row = Vector_Alloc(len);
2510 value_set_si(row->p[0], 1);
2511
2512 Value f;
2513 value_init(f);
2514
2515 enum constraint info[exist];
2516 for (int i = 0; i < exist; ++i) {
2517 info[i] = ALL_POS;
2518 for (int l = P->NbEq; l < P->NbConstraints; ++l) {
2519 if (value_negz_p(P->Constraint[l][nvar+i+1]))
2520 continue;
2521 for (int u = P->NbEq; u < P->NbConstraints; ++u) {
2522 if (value_posz_p(P->Constraint[u][nvar+i+1]))
2523 continue;
2524 value_oppose(f, P->Constraint[u][nvar+i+1]);
2525 Vector_Combine(P->Constraint[l]+1, P->Constraint[u]+1, row->p+1,
2526 f, P->Constraint[l][nvar+i+1], len-1);
2527 if (!(info[i] & INDEPENDENT)) {
2528 int j;
2529 for (j = 0; j < exist; ++j)
2530 if (j != i && value_notzero_p(row->p[nvar+j+1]))
2531 break;
2532 if (j == exist) {
2533 //printf("independent: i: %d, l: %d, u: %d\n", i, l, u);
2534 info[i] = (constraint)(info[i] | INDEPENDENT);
2535 }
2536 }
2537 if (info[i] & ALL_POS) {
2538 value_addto(row->p[len-1], row->p[len-1],
2539 P->Constraint[l][nvar+i+1]);
2540 value_addto(row->p[len-1], row->p[len-1], f);
2541 value_multiply(f, f, P->Constraint[l][nvar+i+1]);
2542 value_substract(row->p[len-1], row->p[len-1], f);
2543 value_decrement(row->p[len-1], row->p[len-1]);
2544 Vector_Gcd(row->p+1, len - 2, &f);
2545 if (value_notone_p(f)) {
2546 Vector_AntiScale(row->p+1, row->p+1, f, len-2);
2547 mpz_fdiv_q(row->p[len-1], row->p[len-1], f);
2548 }
2549 value_set_si(f, -1);
2550 Vector_Scale(row->p+1, row->p+1, f, len-1);
2551 value_decrement(row->p[len-1], row->p[len-1]);
2552 Polyhedron *T = AddConstraints(row->p, 1, P, MaxRays);
2553 if (!emptyQ(T)) {
2554 //printf("not all_pos: i: %d, l: %d, u: %d\n", i, l, u);
2555 info[i] = (constraint)(info[i] ^ ALL_POS);
2556 }
2557 //puts("pos remainder");
2558 //Polyhedron_Print(stdout, P_VALUE_FMT, T);
2559 Polyhedron_Free(T);
2560 }
2561 if (!(info[i] & ONE_NEG)) {
2562 int j;
2563 for (j = 0; j < exist; ++j)
2564 if (j != i &&
2565 value_notzero_p(P->Constraint[l][nvar+j+1]))
2566 break;
2567 if (j != exist)
2568 for (j = 0; j < exist; ++j)
2569 if (j != i &&
2570 value_notzero_p(P->Constraint[u][nvar+j+1]))
2571 break;
2572 if (j == exist) {
2573 /* recalculate constant */
2574 /* We actually recalculate the whole row for
2575 * now, because it may have already been scaled
2576 */
2577 value_oppose(f, P->Constraint[u][nvar+i+1]);
2578 Vector_Combine(P->Constraint[l]+1, P->Constraint[u]+1,
2579 row->p+1,
2580 f, P->Constraint[l][nvar+i+1], len-1);
2581 /*
2582 Vector_Combine(P->Constraint[l]+len-1,
2583 P->Constraint[u]+len-1, row->p+len-1,
2584 f, P->Constraint[l][nvar+i+1], 1);
2585 */
2586 value_multiply(f, f, P->Constraint[l][nvar+i+1]);
2587 value_substract(row->p[len-1], row->p[len-1], f);
2588 value_set_si(f, -1);
2589 Vector_Scale(row->p+1, row->p+1, f, len-1);
2590 value_decrement(row->p[len-1], row->p[len-1]);
2591 Vector_Gcd(row->p+1, len - 2, &f);
2592 if (value_notone_p(f)) {
2593 Vector_AntiScale(row->p+1, row->p+1, f, len-2);
2594 mpz_fdiv_q(row->p[len-1], row->p[len-1], f);
2595 }
2596 value_set_si(f, -1);
2597 Vector_Scale(row->p+1, row->p+1, f, len-1);
2598 value_decrement(row->p[len-1], row->p[len-1]);
2599 //puts("row");
2600 //Vector_Print(stdout, P_VALUE_FMT, row);
2601 Polyhedron *T = AddConstraints(row->p, 1, P, MaxRays);
2602 if (emptyQ(T)) {
2603 //printf("one_neg i: %d, l: %d, u: %d\n", i, l, u);
2604 info[i] = (constraint)(info[i] | ONE_NEG);
2605 }
2606 //puts("neg remainder");
2607 //Polyhedron_Print(stdout, P_VALUE_FMT, T);
2608 Polyhedron_Free(T);
2609 }
2610 }
2611 if (!(info[i] & ALL_POS) && (info[i] & ONE_NEG))
2612 goto next;
2613 }
2614 }
2615 if (info[i] & ALL_POS)
2616 break;
2617 next:
2618 ;
2619 }
2620
2621 /*
2622 for (int i = 0; i < exist; ++i)
2623 printf("%i: %i\n", i, info[i]);
2624 */
2625 for (int i = 0; i < exist; ++i)
2626 if (info[i] & ALL_POS) {
2627 #ifdef DEBUG_ER
2628 fprintf(stderr, "\nER: Positive\n");
2629 #endif /* DEBUG_ER */
2630 // Eliminate
2631 // Maybe we should chew off some of the fat here
2632 Matrix *M = Matrix_Alloc(P->Dimension, P->Dimension+1);
2633 for (int j = 0; j < P->Dimension; ++j)
2634 value_set_si(M->p[j][j + (j >= i+nvar)], 1);
2635 Polyhedron *T = Polyhedron_Image(P, M, MaxRays);
2636 Matrix_Free(M);
2637 evalue *EP = barvinok_enumerate_e(T, exist-1, nparam, MaxRays);
2638 Polyhedron_Free(T);
2639 value_clear(f);
2640 Vector_Free(row);
2641 return EP;
2642 }
2643 for (int i = 0; i < exist; ++i)
2644 if (info[i] & ONE_NEG) {
2645 #ifdef DEBUG_ER
2646 fprintf(stderr, "\nER: Negative\n");
2647 #endif /* DEBUG_ER */
2648 Vector_Free(row);
2649 value_clear(f);
2650 if (i == 0)
2651 return barvinok_enumerate_e(P, exist-1, nparam, MaxRays);
2652 else {
2653 Polyhedron *T = Polyhedron_Copy(P);
2654 SwapColumns(T, nvar+1, nvar+1+i);
2655 evalue *EP = barvinok_enumerate_e(T, exist-1, nparam, MaxRays);
2656 Polyhedron_Free(T);
2657 return EP;
2658 }
2659 }
2660 for (int i = 0; i < exist; ++i)
2661 if (info[i] & INDEPENDENT) {
2662 Polyhedron *pos, *neg;
2663
2664 /* Find constraint again and split off negative part */
2665
2666 if (SplitOnVar(P, i, nvar, len, exist, MaxRays,
2667 row, f, true, &pos, &neg)) {
2668 #ifdef DEBUG_ER
2669 fprintf(stderr, "\nER: Split\n");
2670 #endif /* DEBUG_ER */
2671
2672 evalue *EP =
2673 barvinok_enumerate_e(neg, exist-1, nparam, MaxRays);
2674 evalue *E =
2675 barvinok_enumerate_e(pos, exist, nparam, MaxRays);
2676 eadd(E, EP);
2677 free_evalue_refs(E);
2678 free(E);
2679 Polyhedron_Free(neg);
2680 Polyhedron_Free(pos);
2681 value_clear(f);
2682 Vector_Free(row);
2683 return EP;
2684 }
2685 }
2686
2687 evalue *EP;
2688 EP = enumerate_sure(P, exist, nparam, MaxRays);
2689 if (EP)
2690 return EP;
2691
2692 EP = enumerate_sure2(P, exist, nparam, MaxRays);
2693 if (EP)
2694 return EP;
2695
2696 Polyhedron *F = unfringe(P, MaxRays);
2697 if (!PolyhedronIncludes(F, P)) {
2698 #ifdef DEBUG_ER
2699 fprintf(stderr, "\nER: Fringed\n");
2700 #endif /* DEBUG_ER */
2701 EP = barvinok_enumerate_e(F, exist, nparam, MaxRays);
2702 Polyhedron_Free(F);
2703 return EP;
2704 }
2705 Polyhedron_Free(F);
2706
2707 Polyhedron *O = P;
2708 if (nparam)
2709 EP = enumerate_vd(&P, exist, nparam, MaxRays);
2710 if (EP) {
2711 if (O != P)
2712 Polyhedron_Free(P);
2713 return EP;
2714 }
2715
2716 if (nvar != 0) {
2717 EP = enumerate_sum(P, exist, nparam, MaxRays);
2718 if (O != P)
2719 Polyhedron_Free(P);
2720 return EP;
2721 }
2722
2723 assert(nvar == 0);
2724
2725 int i;
2726 Polyhedron *pos, *neg;
2727 for (i = 0; i < exist; ++i)
2728 if (SplitOnVar(P, i, nvar, len, exist, MaxRays,
2729 row, f, false, &pos, &neg))
2730 break;
2731
2732 assert (i < exist);
2733
2734 EP = enumerate_or(pos, neg, exist, nparam, MaxRays);
2735 value_clear(f);
2736 Vector_Free(row);
2737
2738 if (O != P)
2739 Polyhedron_Free(P);
2740
2741 return EP;
2742 }
lattice point enumeration library