8 #include <NTL/mat_ZZ.h>
12 #include <polylib/polylibgmp.h>
13 #include "ev_operations.h"
27 using std::ostringstream
;
29 #define ALLOC(p) (((long *) (p))[0])
30 #define SIZE(p) (((long *) (p))[1])
31 #define DATA(p) ((mp_limb_t *) (((long *) (p)) + 2))
33 static void value2zz(Value v
, ZZ
& z
)
35 int sa
= v
[0]._mp_size
;
36 int abs_sa
= sa
< 0 ? -sa
: sa
;
38 _ntl_gsetlength(&z
.rep
, abs_sa
);
39 mp_limb_t
* adata
= DATA(z
.rep
);
40 for (int i
= 0; i
< abs_sa
; ++i
)
41 adata
[i
] = v
[0]._mp_d
[i
];
45 static void zz2value(ZZ
& z
, Value
& v
)
53 int abs_sa
= sa
< 0 ? -sa
: sa
;
55 mp_limb_t
* adata
= DATA(z
.rep
);
56 _mpz_realloc(v
, abs_sa
);
57 for (int i
= 0; i
< abs_sa
; ++i
)
58 v
[0]._mp_d
[i
] = adata
[i
];
63 #define ALLOC(p) p = (typeof(p))malloc(sizeof(*p))
66 * We just ignore the last column and row
67 * If the final element is not equal to one
68 * then the result will actually be a multiple of the input
70 static void matrix2zz(Matrix
*M
, mat_ZZ
& m
, unsigned nr
, unsigned nc
)
74 for (int i
= 0; i
< nr
; ++i
) {
75 // assert(value_one_p(M->p[i][M->NbColumns - 1]));
76 for (int j
= 0; j
< nc
; ++j
) {
77 value2zz(M
->p
[i
][j
], m
[i
][j
]);
82 static void values2zz(Value
*p
, vec_ZZ
& v
, int len
)
86 for (int i
= 0; i
< len
; ++i
) {
93 static void zz2values(vec_ZZ
& v
, Value
*p
)
95 for (int i
= 0; i
< v
.length(); ++i
)
99 static void rays(mat_ZZ
& r
, Polyhedron
*C
)
101 unsigned dim
= C
->NbRays
- 1; /* don't count zero vertex */
102 assert(C
->NbRays
- 1 == C
->Dimension
);
107 for (i
= 0, c
= 0; i
< dim
; ++i
)
108 if (value_zero_p(C
->Ray
[i
][dim
+1])) {
109 for (int j
= 0; j
< dim
; ++j
) {
110 value2zz(C
->Ray
[i
][j
+1], tmp
);
117 static Matrix
* rays(Polyhedron
*C
)
119 unsigned dim
= C
->NbRays
- 1; /* don't count zero vertex */
120 assert(C
->NbRays
- 1 == C
->Dimension
);
122 Matrix
*M
= Matrix_Alloc(dim
+1, dim
+1);
126 for (i
= 0, c
= 0; i
<= dim
&& c
< dim
; ++i
)
127 if (value_zero_p(C
->Ray
[i
][dim
+1])) {
128 Vector_Copy(C
->Ray
[i
] + 1, M
->p
[c
], dim
);
129 value_set_si(M
->p
[c
++][dim
], 0);
132 value_set_si(M
->p
[dim
][dim
], 1);
137 static Matrix
* rays2(Polyhedron
*C
)
139 unsigned dim
= C
->NbRays
- 1; /* don't count zero vertex */
140 assert(C
->NbRays
- 1 == C
->Dimension
);
142 Matrix
*M
= Matrix_Alloc(dim
, dim
);
146 for (i
= 0, c
= 0; i
<= dim
&& c
< dim
; ++i
)
147 if (value_zero_p(C
->Ray
[i
][dim
+1]))
148 Vector_Copy(C
->Ray
[i
] + 1, M
->p
[c
++], dim
);
155 * Returns the largest absolute value in the vector
157 static ZZ
max(vec_ZZ
& v
)
160 for (int i
= 1; i
< v
.length(); ++i
)
170 Rays
= Matrix_Copy(M
);
173 cone(Polyhedron
*C
) {
174 Cone
= Polyhedron_Copy(C
);
180 matrix2zz(Rays
, A
, Rays
->NbRows
- 1, Rays
->NbColumns
- 1);
181 det
= determinant(A
);
188 Vector
* short_vector(vec_ZZ
& lambda
) {
189 Matrix
*M
= Matrix_Copy(Rays
);
190 Matrix
*inv
= Matrix_Alloc(M
->NbRows
, M
->NbColumns
);
191 int ok
= Matrix_Inverse(M
, inv
);
198 matrix2zz(inv
, B
, inv
->NbRows
- 1, inv
->NbColumns
- 1);
199 long r
= LLL(det2
, B
, U
);
203 for (int i
= 1; i
< B
.NumRows(); ++i
) {
215 Vector
*z
= Vector_Alloc(U
[index
].length()+1);
217 zz2values(U
[index
], z
->p
);
218 value_set_si(z
->p
[U
[index
].length()], 0);
222 Polyhedron
*C
= poly();
224 for (i
= 0; i
< C
->NbConstraints
; ++i
) {
225 Inner_Product(z
->p
, C
->Constraint
[i
]+1, z
->Size
-1, &tmp
);
226 if (value_pos_p(tmp
))
229 if (i
== C
->NbConstraints
) {
230 value_set_si(tmp
, -1);
231 Vector_Scale(z
->p
, z
->p
, tmp
, z
->Size
-1);
238 Polyhedron_Free(Cone
);
244 Matrix
*M
= Matrix_Alloc(Rays
->NbRows
+1, Rays
->NbColumns
+1);
245 for (int i
= 0; i
< Rays
->NbRows
; ++i
) {
246 Vector_Copy(Rays
->p
[i
], M
->p
[i
]+1, Rays
->NbColumns
);
247 value_set_si(M
->p
[i
][0], 1);
249 Vector_Set(M
->p
[Rays
->NbRows
]+1, 0, Rays
->NbColumns
-1);
250 value_set_si(M
->p
[Rays
->NbRows
][0], 1);
251 value_set_si(M
->p
[Rays
->NbRows
][Rays
->NbColumns
], 1);
252 Cone
= Rays2Polyhedron(M
, M
->NbRows
+1);
253 assert(Cone
->NbConstraints
== Cone
->NbRays
);
267 dpoly(int d
, ZZ
& degree
, int offset
= 0) {
268 coeff
.SetLength(d
+1);
270 int min
= d
+ offset
;
271 if (degree
< ZZ(INIT_VAL
, min
))
272 min
= to_int(degree
);
274 ZZ c
= ZZ(INIT_VAL
, 1);
277 for (int i
= 1; i
<= min
; ++i
) {
278 c
*= (degree
-i
+ 1);
283 void operator *= (dpoly
& f
) {
284 assert(coeff
.length() == f
.coeff
.length());
286 coeff
= f
.coeff
[0] * coeff
;
287 for (int i
= 1; i
< coeff
.length(); ++i
)
288 for (int j
= 0; i
+j
< coeff
.length(); ++j
)
289 coeff
[i
+j
] += f
.coeff
[i
] * old
[j
];
291 void div(dpoly
& d
, mpq_t count
, ZZ
& sign
) {
292 int len
= coeff
.length();
295 mpq_t
* c
= new mpq_t
[coeff
.length()];
298 for (int i
= 0; i
< len
; ++i
) {
300 zz2value(coeff
[i
], tmp
);
301 mpq_set_z(c
[i
], tmp
);
303 for (int j
= 1; j
<= i
; ++j
) {
304 zz2value(d
.coeff
[j
], tmp
);
305 mpq_set_z(qtmp
, tmp
);
306 mpq_mul(qtmp
, qtmp
, c
[i
-j
]);
307 mpq_sub(c
[i
], c
[i
], qtmp
);
310 zz2value(d
.coeff
[0], tmp
);
311 mpq_set_z(qtmp
, tmp
);
312 mpq_div(c
[i
], c
[i
], qtmp
);
315 mpq_sub(count
, count
, c
[len
-1]);
317 mpq_add(count
, count
, c
[len
-1]);
321 for (int i
= 0; i
< len
; ++i
)
333 dpoly_n(int d
, ZZ
& degree_0
, ZZ
& degree_1
, int offset
= 0) {
337 zz2value(degree_0
, d0
);
338 zz2value(degree_1
, d1
);
339 coeff
= Matrix_Alloc(d
+1, d
+1+1);
340 value_set_si(coeff
->p
[0][0], 1);
341 value_set_si(coeff
->p
[0][d
+1], 1);
342 for (int i
= 1; i
<= d
; ++i
) {
343 value_multiply(coeff
->p
[i
][0], coeff
->p
[i
-1][0], d0
);
344 Vector_Combine(coeff
->p
[i
-1], coeff
->p
[i
-1]+1, coeff
->p
[i
]+1,
346 value_set_si(coeff
->p
[i
][d
+1], i
);
347 value_multiply(coeff
->p
[i
][d
+1], coeff
->p
[i
][d
+1], coeff
->p
[i
-1][d
+1]);
348 value_decrement(d0
, d0
);
353 void div(dpoly
& d
, Vector
*count
, ZZ
& sign
) {
354 int len
= coeff
->NbRows
;
355 Matrix
* c
= Matrix_Alloc(coeff
->NbRows
, coeff
->NbColumns
);
358 for (int i
= 0; i
< len
; ++i
) {
359 Vector_Copy(coeff
->p
[i
], c
->p
[i
], len
+1);
360 for (int j
= 1; j
<= i
; ++j
) {
361 zz2value(d
.coeff
[j
], tmp
);
362 value_multiply(tmp
, tmp
, c
->p
[i
][len
]);
363 value_oppose(tmp
, tmp
);
364 Vector_Combine(c
->p
[i
], c
->p
[i
-j
], c
->p
[i
],
365 c
->p
[i
-j
][len
], tmp
, len
);
366 value_multiply(c
->p
[i
][len
], c
->p
[i
][len
], c
->p
[i
-j
][len
]);
368 zz2value(d
.coeff
[0], tmp
);
369 value_multiply(c
->p
[i
][len
], c
->p
[i
][len
], tmp
);
372 value_set_si(tmp
, -1);
373 Vector_Scale(c
->p
[len
-1], count
->p
, tmp
, len
);
374 value_assign(count
->p
[len
], c
->p
[len
-1][len
]);
376 Vector_Copy(c
->p
[len
-1], count
->p
, len
+1);
377 Vector_Normalize(count
->p
, len
+1);
384 * Barvinok's Decomposition of a simplicial cone
386 * Returns two lists of polyhedra
388 void barvinok_decompose(Polyhedron
*C
, Polyhedron
**ppos
, Polyhedron
**pneg
)
390 Polyhedron
*pos
= *ppos
, *neg
= *pneg
;
391 vector
<cone
*> nonuni
;
392 cone
* c
= new cone(C
);
399 Polyhedron
*p
= Polyhedron_Copy(c
->Cone
);
405 while (!nonuni
.empty()) {
408 Vector
* v
= c
->short_vector(lambda
);
409 for (int i
= 0; i
< c
->Rays
->NbRows
- 1; ++i
) {
412 Matrix
* M
= Matrix_Copy(c
->Rays
);
413 Vector_Copy(v
->p
, M
->p
[i
], v
->Size
);
414 cone
* pc
= new cone(M
);
415 assert (pc
->det
!= 0);
416 if (abs(pc
->det
) > 1) {
417 assert(abs(pc
->det
) < abs(c
->det
));
418 nonuni
.push_back(pc
);
420 Polyhedron
*p
= pc
->poly();
422 if (sign(pc
->det
) == s
) {
441 * Returns a single list of npos "positive" cones followed by nneg
443 * The input cone is freed
445 void decompose(Polyhedron
*cone
, Polyhedron
**parts
, int *npos
, int *nneg
, unsigned MaxRays
)
447 Polyhedron_Polarize(cone
);
448 if (cone
->NbRays
- 1 != cone
->Dimension
) {
449 Polyhedron
*tmp
= cone
;
450 cone
= triangularize_cone(cone
, MaxRays
);
451 Polyhedron_Free(tmp
);
453 Polyhedron
*polpos
= NULL
, *polneg
= NULL
;
454 *npos
= 0; *nneg
= 0;
455 for (Polyhedron
*Polar
= cone
; Polar
; Polar
= Polar
->next
)
456 barvinok_decompose(Polar
, &polpos
, &polneg
);
459 for (Polyhedron
*i
= polpos
; i
; i
= i
->next
) {
460 Polyhedron_Polarize(i
);
464 for (Polyhedron
*i
= polneg
; i
; i
= i
->next
) {
465 Polyhedron_Polarize(i
);
476 const int MAX_TRY
=10;
478 * Searches for a vector that is not othogonal to any
479 * of the rays in rays.
481 static void nonorthog(mat_ZZ
& rays
, vec_ZZ
& lambda
)
483 int dim
= rays
.NumCols();
485 lambda
.SetLength(dim
);
486 for (int i
= 2; !found
&& i
<= 50*dim
; i
+=4) {
487 for (int j
= 0; j
< MAX_TRY
; ++j
) {
488 for (int k
= 0; k
< dim
; ++k
) {
489 int r
= random_int(i
)+2;
490 int v
= (2*(r
%2)-1) * (r
>> 1);
494 for (; k
< rays
.NumRows(); ++k
)
495 if (lambda
* rays
[k
] == 0)
497 if (k
== rays
.NumRows()) {
506 static void add_rays(mat_ZZ
& rays
, Polyhedron
*i
, int *r
)
508 unsigned dim
= i
->Dimension
;
509 for (int k
= 0; k
< i
->NbRays
; ++k
) {
510 if (!value_zero_p(i
->Ray
[k
][dim
+1]))
512 values2zz(i
->Ray
[k
]+1, rays
[(*r
)++], dim
);
516 void lattice_point(Value
* values
, Polyhedron
*i
, vec_ZZ
& lambda
, ZZ
& num
)
519 unsigned dim
= i
->Dimension
;
520 if(!value_one_p(values
[dim
])) {
521 Matrix
* Rays
= rays(i
);
522 Matrix
*inv
= Matrix_Alloc(Rays
->NbRows
, Rays
->NbColumns
);
523 int ok
= Matrix_Inverse(Rays
, inv
);
527 Vector
*lambda
= Vector_Alloc(dim
+1);
528 Vector_Matrix_Product(values
, inv
, lambda
->p
);
530 for (int j
= 0; j
< dim
; ++j
)
531 mpz_cdiv_q(lambda
->p
[j
], lambda
->p
[j
], lambda
->p
[dim
]);
532 value_set_si(lambda
->p
[dim
], 1);
533 Vector
*A
= Vector_Alloc(dim
+1);
534 Vector_Matrix_Product(lambda
->p
, Rays
, A
->p
);
537 values2zz(A
->p
, vertex
, dim
);
540 values2zz(values
, vertex
, dim
);
542 num
= vertex
* lambda
;
545 static evalue
*term(int param
, ZZ
& c
, Value
*den
= NULL
)
547 evalue
*EP
= new evalue();
549 value_set_si(EP
->d
,0);
550 EP
->x
.p
= new_enode(polynomial
, 2, param
+ 1);
551 evalue_set_si(&EP
->x
.p
->arr
[0], 0, 1);
552 value_init(EP
->x
.p
->arr
[1].x
.n
);
554 value_set_si(EP
->x
.p
->arr
[1].d
, 1);
556 value_assign(EP
->x
.p
->arr
[1].d
, *den
);
557 zz2value(c
, EP
->x
.p
->arr
[1].x
.n
);
561 static void vertex_period(
562 Polyhedron
*i
, vec_ZZ
& lambda
, Matrix
*T
,
563 Value lcm
, int p
, Vector
*val
,
564 evalue
*E
, evalue
* ev
,
567 unsigned nparam
= T
->NbRows
- 1;
568 unsigned dim
= i
->Dimension
;
574 Vector
* values
= Vector_Alloc(dim
+ 1);
575 Vector_Matrix_Product(val
->p
, T
, values
->p
);
576 value_assign(values
->p
[dim
], lcm
);
577 lattice_point(values
->p
, i
, lambda
, num
);
582 zz2value(num
, ev
->x
.n
);
583 value_assign(ev
->d
, lcm
);
590 values2zz(T
->p
[p
], vertex
, dim
);
591 nump
= vertex
* lambda
;
592 if (First_Non_Zero(val
->p
, p
) == -1) {
593 value_assign(tmp
, lcm
);
594 evalue
*ET
= term(p
, nump
, &tmp
);
596 free_evalue_refs(ET
);
600 value_assign(tmp
, lcm
);
601 if (First_Non_Zero(T
->p
[p
], dim
) != -1)
602 Vector_Gcd(T
->p
[p
], dim
, &tmp
);
604 if (value_lt(tmp
, lcm
)) {
607 value_division(tmp
, lcm
, tmp
);
608 value_set_si(ev
->d
, 0);
609 ev
->x
.p
= new_enode(periodic
, VALUE_TO_INT(tmp
), p
+1);
610 value2zz(tmp
, count
);
612 value_decrement(tmp
, tmp
);
614 ZZ new_offset
= offset
- count
* nump
;
615 value_assign(val
->p
[p
], tmp
);
616 vertex_period(i
, lambda
, T
, lcm
, p
+1, val
, E
,
617 &ev
->x
.p
->arr
[VALUE_TO_INT(tmp
)], new_offset
);
618 } while (value_pos_p(tmp
));
620 vertex_period(i
, lambda
, T
, lcm
, p
+1, val
, E
, ev
, offset
);
624 static void mask_r(Matrix
*f
, int nr
, Vector
*lcm
, int p
, Vector
*val
, evalue
*ev
)
626 unsigned nparam
= lcm
->Size
;
629 Vector
* prod
= Vector_Alloc(f
->NbRows
);
630 Matrix_Vector_Product(f
, val
->p
, prod
->p
);
632 for (int i
= 0; i
< nr
; ++i
) {
633 value_modulus(prod
->p
[i
], prod
->p
[i
], f
->p
[i
][nparam
+1]);
634 isint
&= value_zero_p(prod
->p
[i
]);
636 value_set_si(ev
->d
, 1);
638 value_set_si(ev
->x
.n
, isint
);
645 if (value_one_p(lcm
->p
[p
]))
646 mask_r(f
, nr
, lcm
, p
+1, val
, ev
);
648 value_assign(tmp
, lcm
->p
[p
]);
649 value_set_si(ev
->d
, 0);
650 ev
->x
.p
= new_enode(periodic
, VALUE_TO_INT(tmp
), p
+1);
652 value_decrement(tmp
, tmp
);
653 value_assign(val
->p
[p
], tmp
);
654 mask_r(f
, nr
, lcm
, p
+1, val
, &ev
->x
.p
->arr
[VALUE_TO_INT(tmp
)]);
655 } while (value_pos_p(tmp
));
660 static evalue
*multi_monom(vec_ZZ
& p
)
662 evalue
*X
= new evalue();
665 unsigned nparam
= p
.length()-1;
666 zz2value(p
[nparam
], X
->x
.n
);
667 value_set_si(X
->d
, 1);
668 for (int i
= 0; i
< nparam
; ++i
) {
671 evalue
*T
= term(i
, p
[i
]);
680 * Check whether mapping polyhedron P on the affine combination
681 * num yields a range that has a fixed quotient on integer
683 * If zero is true, then we are only interested in the quotient
684 * for the cases where the remainder is zero.
685 * Returns NULL if false and a newly allocated value if true.
687 static Value
*fixed_quotient(Polyhedron
*P
, vec_ZZ
& num
, Value d
, bool zero
)
690 int len
= num
.length();
691 Matrix
*T
= Matrix_Alloc(2, len
);
692 zz2values(num
, T
->p
[0]);
693 value_set_si(T
->p
[1][len
-1], 1);
694 Polyhedron
*I
= Polyhedron_Image(P
, T
, P
->NbConstraints
);
698 for (i
= 0; i
< I
->NbRays
; ++i
)
699 if (value_zero_p(I
->Ray
[i
][2])) {
707 int bounded
= line_minmax(I
, &min
, &max
);
711 mpz_cdiv_q(min
, min
, d
);
713 mpz_fdiv_q(min
, min
, d
);
714 mpz_fdiv_q(max
, max
, d
);
716 if (value_eq(min
, max
)) {
719 value_assign(*ret
, min
);
727 * Normalize linear expression coef modulo m
728 * Removes common factor and reduces coefficients
729 * Returns index of first non-zero coefficient or len
731 static int normal_mod(Value
*coef
, int len
, Value
*m
)
736 Vector_Gcd(coef
, len
, &gcd
);
738 Vector_AntiScale(coef
, coef
, gcd
, len
);
740 value_division(*m
, *m
, gcd
);
747 for (j
= 0; j
< len
; ++j
)
748 mpz_fdiv_r(coef
[j
], coef
[j
], *m
);
749 for (j
= 0; j
< len
; ++j
)
750 if (value_notzero_p(coef
[j
]))
757 static void mask(Matrix
*f
, evalue
*factor
)
759 int nr
= f
->NbRows
, nc
= f
->NbColumns
;
762 for (n
= 0; n
< nr
&& value_notzero_p(f
->p
[n
][nc
-1]); ++n
)
763 if (value_notone_p(f
->p
[n
][nc
-1]) &&
764 value_notmone_p(f
->p
[n
][nc
-1]))
778 value_set_si(EV
.x
.n
, 1);
780 for (n
= 0; n
< nr
; ++n
) {
781 value_assign(m
, f
->p
[n
][nc
-1]);
782 if (value_one_p(m
) || value_mone_p(m
))
785 int j
= normal_mod(f
->p
[n
], nc
-1, &m
);
787 free_evalue_refs(factor
);
788 value_init(factor
->d
);
789 evalue_set_si(factor
, 0, 1);
793 values2zz(f
->p
[n
], row
, nc
-1);
796 if (j
< (nc
-1)-1 && row
[j
] > g
/2) {
797 for (int k
= j
; k
< (nc
-1); ++k
)
803 value_set_si(EP
.d
, 0);
804 EP
.x
.p
= new_enode(relation
, 2, 0);
805 value_clear(EP
.x
.p
->arr
[1].d
);
806 EP
.x
.p
->arr
[1] = *factor
;
807 evalue
*ev
= &EP
.x
.p
->arr
[0];
808 value_set_si(ev
->d
, 0);
809 ev
->x
.p
= new_enode(fractional
, 3, -1);
810 evalue_set_si(&ev
->x
.p
->arr
[1], 0, 1);
811 evalue_set_si(&ev
->x
.p
->arr
[2], 1, 1);
812 evalue
*E
= multi_monom(row
);
813 value_assign(EV
.d
, m
);
815 value_clear(ev
->x
.p
->arr
[0].d
);
816 ev
->x
.p
->arr
[0] = *E
;
822 free_evalue_refs(&EV
);
828 static void mask(Matrix
*f
, evalue
*factor
)
830 int nr
= f
->NbRows
, nc
= f
->NbColumns
;
833 for (n
= 0; n
< nr
&& value_notzero_p(f
->p
[n
][nc
-1]); ++n
)
834 if (value_notone_p(f
->p
[n
][nc
-1]) &&
835 value_notmone_p(f
->p
[n
][nc
-1]))
843 unsigned np
= nc
- 2;
844 Vector
*lcm
= Vector_Alloc(np
);
845 Vector
*val
= Vector_Alloc(nc
);
846 Vector_Set(val
->p
, 0, nc
);
847 value_set_si(val
->p
[np
], 1);
848 Vector_Set(lcm
->p
, 1, np
);
849 for (n
= 0; n
< nr
; ++n
) {
850 if (value_one_p(f
->p
[n
][nc
-1]) ||
851 value_mone_p(f
->p
[n
][nc
-1]))
853 for (int j
= 0; j
< np
; ++j
)
854 if (value_notzero_p(f
->p
[n
][j
])) {
855 Gcd(f
->p
[n
][j
], f
->p
[n
][nc
-1], &tmp
);
856 value_division(tmp
, f
->p
[n
][nc
-1], tmp
);
857 value_lcm(tmp
, lcm
->p
[j
], &lcm
->p
[j
]);
862 mask_r(f
, nr
, lcm
, 0, val
, &EP
);
867 free_evalue_refs(&EP
);
878 static bool mod_needed(Polyhedron
*PD
, vec_ZZ
& num
, Value d
, evalue
*E
)
880 Value
*q
= fixed_quotient(PD
, num
, d
, false);
885 value_oppose(*q
, *q
);
888 value_set_si(EV
.d
, 1);
890 value_multiply(EV
.x
.n
, *q
, d
);
892 free_evalue_refs(&EV
);
898 static void ceil_mod(Value
*coef
, int len
, Value d
, ZZ
& f
, evalue
*EP
, Polyhedron
*PD
)
904 Vector_Scale(coef
, coef
, m
, len
);
907 int j
= normal_mod(coef
, len
, &m
);
915 values2zz(coef
, num
, len
);
922 evalue_set_si(&tmp
, 0, 1);
926 while (j
< len
-1 && (num
[j
] == g
/2 || num
[j
] == 0))
928 if ((j
< len
-1 && num
[j
] > g
/2) || (j
== len
-1 && num
[j
] >= (g
+1)/2)) {
929 for (int k
= j
; k
< len
-1; ++k
)
932 num
[len
-1] = g
- 1 - num
[len
-1];
933 value_assign(tmp
.d
, m
);
935 zz2value(t
, tmp
.x
.n
);
941 ZZ t
= num
[len
-1] * f
;
942 zz2value(t
, tmp
.x
.n
);
943 value_assign(tmp
.d
, m
);
946 evalue
*E
= multi_monom(num
);
950 if (PD
&& !mod_needed(PD
, num
, m
, E
)) {
953 value_assign(EV
.d
, m
);
958 value_set_si(EV
.x
.n
, 1);
959 value_assign(EV
.d
, m
);
962 value_set_si(EV
.d
, 0);
963 EV
.x
.p
= new_enode(fractional
, 3, -1);
964 evalue_copy(&EV
.x
.p
->arr
[0], E
);
965 evalue_set_si(&EV
.x
.p
->arr
[1], 0, 1);
966 value_init(EV
.x
.p
->arr
[2].x
.n
);
967 zz2value(f
, EV
.x
.p
->arr
[2].x
.n
);
968 value_set_si(EV
.x
.p
->arr
[2].d
, 1);
973 free_evalue_refs(&EV
);
978 free_evalue_refs(&tmp
);
984 evalue
* bv_ceil3(Value
*coef
, int len
, Value d
, Polyhedron
*P
)
986 Vector
*val
= Vector_Alloc(len
);
991 Vector_Scale(coef
, val
->p
, t
, len
);
992 value_absolute(t
, d
);
995 values2zz(val
->p
, num
, len
);
996 evalue
*EP
= multi_monom(num
);
1000 value_init(tmp
.x
.n
);
1001 value_set_si(tmp
.x
.n
, 1);
1002 value_assign(tmp
.d
, t
);
1008 ceil_mod(val
->p
, len
, t
, one
, EP
, P
);
1011 /* copy EP to malloc'ed evalue */
1017 free_evalue_refs(&tmp
);
1024 evalue
* lattice_point(
1025 Polyhedron
*i
, vec_ZZ
& lambda
, Matrix
*W
, Value lcm
, Polyhedron
*PD
)
1027 unsigned nparam
= W
->NbColumns
- 1;
1029 Matrix
* Rays
= rays2(i
);
1030 Matrix
*T
= Transpose(Rays
);
1031 Matrix
*T2
= Matrix_Copy(T
);
1032 Matrix
*inv
= Matrix_Alloc(T2
->NbRows
, T2
->NbColumns
);
1033 int ok
= Matrix_Inverse(T2
, inv
);
1038 matrix2zz(W
, vertex
, W
->NbRows
, W
->NbColumns
);
1041 num
= lambda
* vertex
;
1043 evalue
*EP
= multi_monom(num
);
1047 value_init(tmp
.x
.n
);
1048 value_set_si(tmp
.x
.n
, 1);
1049 value_assign(tmp
.d
, lcm
);
1053 Matrix
*L
= Matrix_Alloc(inv
->NbRows
, W
->NbColumns
);
1054 Matrix_Product(inv
, W
, L
);
1057 matrix2zz(T
, RT
, T
->NbRows
, T
->NbColumns
);
1060 vec_ZZ p
= lambda
* RT
;
1062 for (int i
= 0; i
< L
->NbRows
; ++i
) {
1063 ceil_mod(L
->p
[i
], nparam
+1, lcm
, p
[i
], EP
, PD
);
1069 free_evalue_refs(&tmp
);
1073 evalue
* lattice_point(
1074 Polyhedron
*i
, vec_ZZ
& lambda
, Matrix
*W
, Value lcm
, Polyhedron
*PD
)
1076 Matrix
*T
= Transpose(W
);
1077 unsigned nparam
= T
->NbRows
- 1;
1079 evalue
*EP
= new evalue();
1081 evalue_set_si(EP
, 0, 1);
1084 Vector
*val
= Vector_Alloc(nparam
+1);
1085 value_set_si(val
->p
[nparam
], 1);
1086 ZZ
offset(INIT_VAL
, 0);
1088 vertex_period(i
, lambda
, T
, lcm
, 0, val
, EP
, &ev
, offset
);
1091 free_evalue_refs(&ev
);
1102 Param_Vertices
* V
, Polyhedron
*i
, vec_ZZ
& lambda
, term_info
* term
,
1105 unsigned nparam
= V
->Vertex
->NbColumns
- 2;
1106 unsigned dim
= i
->Dimension
;
1108 vertex
.SetDims(V
->Vertex
->NbRows
, nparam
+1);
1112 value_set_si(lcm
, 1);
1113 for (int j
= 0; j
< V
->Vertex
->NbRows
; ++j
) {
1114 value_lcm(lcm
, V
->Vertex
->p
[j
][nparam
+1], &lcm
);
1116 if (value_notone_p(lcm
)) {
1117 Matrix
* mv
= Matrix_Alloc(dim
, nparam
+1);
1118 for (int j
= 0 ; j
< dim
; ++j
) {
1119 value_division(tmp
, lcm
, V
->Vertex
->p
[j
][nparam
+1]);
1120 Vector_Scale(V
->Vertex
->p
[j
], mv
->p
[j
], tmp
, nparam
+1);
1123 term
->E
= lattice_point(i
, lambda
, mv
, lcm
, PD
);
1131 for (int i
= 0; i
< V
->Vertex
->NbRows
; ++i
) {
1132 assert(value_one_p(V
->Vertex
->p
[i
][nparam
+1])); // for now
1133 values2zz(V
->Vertex
->p
[i
], vertex
[i
], nparam
+1);
1137 num
= lambda
* vertex
;
1141 for (int j
= 0; j
< nparam
; ++j
)
1147 term
->E
= multi_monom(num
);
1151 term
->constant
= num
[nparam
];
1154 term
->coeff
= num
[p
];
1161 void normalize(Polyhedron
*i
, vec_ZZ
& lambda
, ZZ
& sign
, ZZ
& num
, vec_ZZ
& den
)
1163 unsigned dim
= i
->Dimension
;
1167 rays
.SetDims(dim
, dim
);
1168 add_rays(rays
, i
, &r
);
1169 den
= rays
* lambda
;
1172 for (int j
= 0; j
< den
.length(); ++j
) {
1176 den
[j
] = abs(den
[j
]);
1184 void barvinok_count(Polyhedron
*P
, Value
* result
, unsigned NbMaxCons
)
1186 Polyhedron
** vcone
;
1189 sign
.SetLength(ncone
);
1197 value_set_si(*result
, 0);
1201 for (; r
< P
->NbRays
; ++r
)
1202 if (value_zero_p(P
->Ray
[r
][P
->Dimension
+1]))
1204 if (P
->NbBid
!=0 || r
< P
->NbRays
) {
1205 value_set_si(*result
, -1);
1209 P
= remove_equalities(P
);
1212 value_set_si(*result
, 0);
1218 value_set_si(factor
, 1);
1219 Q
= Polyhedron_Reduce(P
, &factor
);
1226 if (P
->Dimension
== 0) {
1227 value_assign(*result
, factor
);
1230 value_clear(factor
);
1235 vcone
= new (Polyhedron
*)[P
->NbRays
];
1237 for (int j
= 0; j
< P
->NbRays
; ++j
) {
1239 Polyhedron
*C
= supporting_cone(P
, j
);
1240 decompose(C
, &vcone
[j
], &npos
, &nneg
, NbMaxCons
);
1241 ncone
+= npos
+ nneg
;
1242 sign
.SetLength(ncone
);
1243 for (int k
= 0; k
< npos
; ++k
)
1244 sign
[ncone
-nneg
-k
-1] = 1;
1245 for (int k
= 0; k
< nneg
; ++k
)
1246 sign
[ncone
-k
-1] = -1;
1250 rays
.SetDims(ncone
* dim
, dim
);
1252 for (int j
= 0; j
< P
->NbRays
; ++j
) {
1253 for (Polyhedron
*i
= vcone
[j
]; i
; i
= i
->next
) {
1254 assert(i
->NbRays
-1 == dim
);
1255 add_rays(rays
, i
, &r
);
1259 nonorthog(rays
, lambda
);
1263 num
.SetLength(ncone
);
1264 den
.SetDims(ncone
,dim
);
1267 for (int j
= 0; j
< P
->NbRays
; ++j
) {
1268 for (Polyhedron
*i
= vcone
[j
]; i
; i
= i
->next
) {
1269 lattice_point(P
->Ray
[j
]+1, i
, lambda
, num
[f
]);
1270 normalize(i
, lambda
, sign
[f
], num
[f
], den
[f
]);
1275 for (int j
= 1; j
< num
.length(); ++j
)
1278 for (int j
= 0; j
< num
.length(); ++j
)
1284 for (int j
= 0; j
< P
->NbRays
; ++j
) {
1285 for (Polyhedron
*i
= vcone
[j
]; i
; i
= i
->next
) {
1286 dpoly
d(dim
, num
[f
]);
1287 dpoly
n(dim
, den
[f
][0], 1);
1288 for (int k
= 1; k
< dim
; ++k
) {
1289 dpoly
fact(dim
, den
[f
][k
], 1);
1292 d
.div(n
, count
, sign
[f
]);
1296 assert(value_one_p(&count
[0]._mp_den
));
1297 value_multiply(*result
, &count
[0]._mp_num
, factor
);
1300 for (int j
= 0; j
< P
->NbRays
; ++j
)
1301 Domain_Free(vcone
[j
]);
1307 value_clear(factor
);
1310 static void uni_polynom(int param
, Vector
*c
, evalue
*EP
)
1312 unsigned dim
= c
->Size
-2;
1314 value_set_si(EP
->d
,0);
1315 EP
->x
.p
= new_enode(polynomial
, dim
+1, param
+1);
1316 for (int j
= 0; j
<= dim
; ++j
)
1317 evalue_set(&EP
->x
.p
->arr
[j
], c
->p
[j
], c
->p
[dim
+1]);
1320 static void multi_polynom(Vector
*c
, evalue
* X
, evalue
*EP
)
1322 unsigned dim
= c
->Size
-2;
1326 evalue_set(&EC
, c
->p
[dim
], c
->p
[dim
+1]);
1329 evalue_set(EP
, c
->p
[dim
], c
->p
[dim
+1]);
1331 for (int i
= dim
-1; i
>= 0; --i
) {
1333 value_assign(EC
.x
.n
, c
->p
[i
]);
1336 free_evalue_refs(&EC
);
1339 Polyhedron
*unfringe (Polyhedron
*P
, unsigned MaxRays
)
1341 int len
= P
->Dimension
+2;
1342 Polyhedron
*T
, *R
= P
;
1345 Vector
*row
= Vector_Alloc(len
);
1346 value_set_si(row
->p
[0], 1);
1348 R
= DomainConstraintSimplify(Polyhedron_Copy(P
), MaxRays
);
1350 Matrix
*M
= Matrix_Alloc(2, len
-1);
1351 value_set_si(M
->p
[1][len
-2], 1);
1352 for (int v
= 0; v
< P
->Dimension
; ++v
) {
1353 value_set_si(M
->p
[0][v
], 1);
1354 Polyhedron
*I
= Polyhedron_Image(P
, M
, 2+1);
1355 value_set_si(M
->p
[0][v
], 0);
1356 for (int r
= 0; r
< I
->NbConstraints
; ++r
) {
1357 if (value_zero_p(I
->Constraint
[r
][0]))
1359 if (value_zero_p(I
->Constraint
[r
][1]))
1361 if (value_one_p(I
->Constraint
[r
][1]))
1363 if (value_mone_p(I
->Constraint
[r
][1]))
1365 value_absolute(g
, I
->Constraint
[r
][1]);
1366 Vector_Set(row
->p
+1, 0, len
-2);
1367 value_division(row
->p
[1+v
], I
->Constraint
[r
][1], g
);
1368 mpz_fdiv_q(row
->p
[len
-1], I
->Constraint
[r
][2], g
);
1370 R
= AddConstraints(row
->p
, 1, R
, MaxRays
);
1382 static Polyhedron
*reduce_domain(Polyhedron
*D
, Matrix
*CT
, Polyhedron
*CEq
,
1383 Polyhedron
**fVD
, int nd
, unsigned MaxRays
)
1388 Dt
= CT
? DomainPreimage(D
, CT
, MaxRays
) : D
;
1389 Polyhedron
*rVD
= DomainIntersection(Dt
, CEq
, MaxRays
);
1391 /* if rVD is empty or too small in geometric dimension */
1392 if(!rVD
|| emptyQ(rVD
) ||
1393 (rVD
->Dimension
-rVD
->NbEq
< Dt
->Dimension
-Dt
->NbEq
-CEq
->NbEq
)) {
1398 return 0; /* empty validity domain */
1404 fVD
[nd
] = Domain_Copy(rVD
);
1405 for (int i
= 0 ; i
< nd
; ++i
) {
1406 Polyhedron
*I
= DomainIntersection(fVD
[nd
], fVD
[i
], MaxRays
);
1411 Polyhedron
*F
= DomainSimplify(I
, fVD
[nd
], MaxRays
);
1413 Polyhedron
*T
= rVD
;
1414 rVD
= DomainDifference(rVD
, F
, MaxRays
);
1421 rVD
= DomainConstraintSimplify(rVD
, MaxRays
);
1423 Domain_Free(fVD
[nd
]);
1430 barvinok_count(rVD
, &c
, MaxRays
);
1431 if (value_zero_p(c
)) {
1440 evalue
* barvinok_enumerate_ev(Polyhedron
*P
, Polyhedron
* C
, unsigned MaxRays
)
1442 //P = unfringe(P, MaxRays);
1443 Polyhedron
*CEq
= NULL
, *rVD
, *pVD
, *CA
;
1445 Param_Polyhedron
*PP
= NULL
;
1446 Param_Domain
*D
, *next
;
1449 unsigned nparam
= C
->Dimension
;
1452 value_init(eres
->d
);
1453 value_set_si(eres
->d
, 0);
1456 value_init(factor
.d
);
1457 evalue_set_si(&factor
, 1, 1);
1459 CA
= align_context(C
, P
->Dimension
, MaxRays
);
1460 P
= DomainIntersection(P
, CA
, MaxRays
);
1461 Polyhedron_Free(CA
);
1463 if (C
->Dimension
== 0 || emptyQ(P
)) {
1465 eres
->x
.p
= new_enode(partition
, 2, C
->Dimension
);
1466 EVALUE_SET_DOMAIN(eres
->x
.p
->arr
[0],
1467 DomainConstraintSimplify(CEq
? CEq
: Polyhedron_Copy(C
), MaxRays
));
1468 value_set_si(eres
->x
.p
->arr
[1].d
, 1);
1469 value_init(eres
->x
.p
->arr
[1].x
.n
);
1471 value_set_si(eres
->x
.p
->arr
[1].x
.n
, 0);
1473 barvinok_count(P
, &eres
->x
.p
->arr
[1].x
.n
, MaxRays
);
1475 emul(&factor
, eres
);
1476 reduce_evalue(eres
);
1477 free_evalue_refs(&factor
);
1482 Param_Polyhedron_Free(PP
);
1486 for (r
= 0; r
< P
->NbRays
; ++r
)
1487 if (value_zero_p(P
->Ray
[r
][0]) ||
1488 value_zero_p(P
->Ray
[r
][P
->Dimension
+1])) {
1490 for (i
= P
->Dimension
- nparam
; i
< P
->Dimension
; ++i
)
1491 if (value_notzero_p(P
->Ray
[r
][i
+1]))
1493 if (i
>= P
->Dimension
)
1501 P
= remove_equalities_p(P
, P
->Dimension
-nparam
, &f
);
1505 if (P
->Dimension
== nparam
) {
1507 P
= Universe_Polyhedron(0);
1511 Polyhedron
*Q
= ParamPolyhedron_Reduce(P
, P
->Dimension
-nparam
, &factor
);
1514 if (Q
->Dimension
== nparam
) {
1516 P
= Universe_Polyhedron(0);
1521 Polyhedron
*oldP
= P
;
1522 PP
= Polyhedron2Param_SimplifiedDomain(&P
,C
,MaxRays
,&CEq
,&CT
);
1524 Polyhedron_Free(oldP
);
1526 if (isIdentity(CT
)) {
1530 assert(CT
->NbRows
!= CT
->NbColumns
);
1531 if (CT
->NbRows
== 1) // no more parameters
1533 nparam
= CT
->NbRows
- 1;
1536 unsigned dim
= P
->Dimension
- nparam
;
1537 Polyhedron
** vcone
= new (Polyhedron
*)[PP
->nbV
];
1538 int * npos
= new int[PP
->nbV
];
1539 int * nneg
= new int[PP
->nbV
];
1543 for (i
= 0, V
= PP
->V
; V
; ++i
, V
= V
->next
) {
1544 Polyhedron
*C
= supporting_cone_p(P
, V
);
1545 decompose(C
, &vcone
[i
], &npos
[i
], &nneg
[i
], MaxRays
);
1548 Vector
*c
= Vector_Alloc(dim
+2);
1551 for (nd
= 0, D
=PP
->D
; D
; ++nd
, D
=D
->next
);
1552 struct section
{ Polyhedron
*D
; evalue E
; };
1553 section
*s
= new section
[nd
];
1554 Polyhedron
**fVD
= new (Polyhedron
*)[nd
];
1556 for(nd
= 0, D
=PP
->D
; D
; D
=next
) {
1559 Polyhedron
*rVD
= reduce_domain(D
->Domain
, CT
, CEq
,
1564 pVD
= CT
? DomainImage(rVD
,CT
,MaxRays
) : rVD
;
1567 sign
.SetLength(ncone
);
1568 FORALL_PVertex_in_ParamPolyhedron(V
,D
,PP
) // _i is internal counter
1569 ncone
+= npos
[_i
] + nneg
[_i
];
1570 sign
.SetLength(ncone
);
1571 for (int k
= 0; k
< npos
[_i
]; ++k
)
1572 sign
[ncone
-nneg
[_i
]-k
-1] = 1;
1573 for (int k
= 0; k
< nneg
[_i
]; ++k
)
1574 sign
[ncone
-k
-1] = -1;
1575 END_FORALL_PVertex_in_ParamPolyhedron
;
1578 rays
.SetDims(ncone
* dim
, dim
);
1580 FORALL_PVertex_in_ParamPolyhedron(V
,D
,PP
) // _i is internal counter
1581 for (Polyhedron
*i
= vcone
[_i
]; i
; i
= i
->next
) {
1582 assert(i
->NbRays
-1 == dim
);
1583 add_rays(rays
, i
, &r
);
1585 END_FORALL_PVertex_in_ParamPolyhedron
;
1587 nonorthog(rays
, lambda
);
1590 den
.SetDims(ncone
,dim
);
1591 term_info
*num
= new term_info
[ncone
];
1594 FORALL_PVertex_in_ParamPolyhedron(V
,D
,PP
)
1595 for (Polyhedron
*i
= vcone
[_i
]; i
; i
= i
->next
) {
1596 lattice_point(V
, i
, lambda
, &num
[f
], pVD
);
1597 normalize(i
, lambda
, sign
[f
], num
[f
].constant
, den
[f
]);
1600 END_FORALL_PVertex_in_ParamPolyhedron
;
1601 ZZ min
= num
[0].constant
;
1602 for (int j
= 1; j
< ncone
; ++j
)
1603 if (num
[j
].constant
< min
)
1604 min
= num
[j
].constant
;
1605 for (int j
= 0; j
< ncone
; ++j
)
1606 num
[j
].constant
-= min
;
1608 value_init(s
[nd
].E
.d
);
1609 evalue_set_si(&s
[nd
].E
, 0, 1);
1612 FORALL_PVertex_in_ParamPolyhedron(V
,D
,PP
)
1613 for (Polyhedron
*i
= vcone
[_i
]; i
; i
= i
->next
) {
1614 dpoly
n(dim
, den
[f
][0], 1);
1615 for (int k
= 1; k
< dim
; ++k
) {
1616 dpoly
fact(dim
, den
[f
][k
], 1);
1619 if (num
[f
].E
!= NULL
) {
1620 ZZ
one(INIT_VAL
, 1);
1621 dpoly_n
d(dim
, num
[f
].constant
, one
);
1622 d
.div(n
, c
, sign
[f
]);
1624 multi_polynom(c
, num
[f
].E
, &EV
);
1625 eadd(&EV
, &s
[nd
].E
);
1626 free_evalue_refs(&EV
);
1627 free_evalue_refs(num
[f
].E
);
1629 } else if (num
[f
].pos
!= -1) {
1630 dpoly_n
d(dim
, num
[f
].constant
, num
[f
].coeff
);
1631 d
.div(n
, c
, sign
[f
]);
1633 uni_polynom(num
[f
].pos
, c
, &EV
);
1634 eadd(&EV
, &s
[nd
].E
);
1635 free_evalue_refs(&EV
);
1637 mpq_set_si(count
, 0, 1);
1638 dpoly
d(dim
, num
[f
].constant
);
1639 d
.div(n
, count
, sign
[f
]);
1642 evalue_set(&EV
, &count
[0]._mp_num
, &count
[0]._mp_den
);
1643 eadd(&EV
, &s
[nd
].E
);
1644 free_evalue_refs(&EV
);
1648 END_FORALL_PVertex_in_ParamPolyhedron
;
1654 addeliminatedparams_evalue(&s
[nd
].E
, CT
);
1662 evalue_set_si(eres
, 0, 1);
1664 eres
->x
.p
= new_enode(partition
, 2*nd
, C
->Dimension
);
1665 for (int j
= 0; j
< nd
; ++j
) {
1666 EVALUE_SET_DOMAIN(eres
->x
.p
->arr
[2*j
], s
[j
].D
);
1667 value_clear(eres
->x
.p
->arr
[2*j
+1].d
);
1668 eres
->x
.p
->arr
[2*j
+1] = s
[j
].E
;
1669 Domain_Free(fVD
[j
]);
1677 for (int j
= 0; j
< PP
->nbV
; ++j
)
1678 Domain_Free(vcone
[j
]);
1684 Polyhedron_Free(CEq
);
1689 Enumeration
* barvinok_enumerate(Polyhedron
*P
, Polyhedron
* C
, unsigned MaxRays
)
1691 evalue
*EP
= barvinok_enumerate_ev(P
, C
, MaxRays
);
1693 return partition2enumeration(EP
);
1696 static void SwapColumns(Value
**V
, int n
, int i
, int j
)
1698 for (int r
= 0; r
< n
; ++r
)
1699 value_swap(V
[r
][i
], V
[r
][j
]);
1702 static void SwapColumns(Polyhedron
*P
, int i
, int j
)
1704 SwapColumns(P
->Constraint
, P
->NbConstraints
, i
, j
);
1705 SwapColumns(P
->Ray
, P
->NbRays
, i
, j
);
1708 static void negative_test_constraint(Value
*l
, Value
*u
, Value
*c
, int pos
,
1711 value_oppose(*v
, u
[pos
+1]);
1712 Vector_Combine(l
+1, u
+1, c
+1, *v
, l
[pos
+1], len
-1);
1713 value_multiply(*v
, *v
, l
[pos
+1]);
1714 value_substract(c
[len
-1], c
[len
-1], *v
);
1715 value_set_si(*v
, -1);
1716 Vector_Scale(c
+1, c
+1, *v
, len
-1);
1717 value_decrement(c
[len
-1], c
[len
-1]);
1718 ConstraintSimplify(c
, c
, len
, v
);
1721 static void oppose_constraint(Value
*c
, int len
, Value
*v
)
1723 value_set_si(*v
, -1);
1724 Vector_Scale(c
+1, c
+1, *v
, len
-1);
1725 value_decrement(c
[len
-1], c
[len
-1]);
1728 static bool SplitOnConstraint(Polyhedron
*P
, int i
, int l
, int u
,
1729 int nvar
, int len
, int exist
, int MaxRays
,
1730 Vector
*row
, Value
& f
, bool independent
,
1731 Polyhedron
**pos
, Polyhedron
**neg
)
1733 negative_test_constraint(P
->Constraint
[l
], P
->Constraint
[u
],
1734 row
->p
, nvar
+i
, len
, &f
);
1735 *neg
= AddConstraints(row
->p
, 1, P
, MaxRays
);
1737 /* We found an independent, but useless constraint
1738 * Maybe we should detect this earlier and not
1739 * mark the variable as INDEPENDENT
1741 if (emptyQ((*neg
))) {
1742 Polyhedron_Free(*neg
);
1746 oppose_constraint(row
->p
, len
, &f
);
1747 *pos
= AddConstraints(row
->p
, 1, P
, MaxRays
);
1749 if (emptyQ((*pos
))) {
1750 Polyhedron_Free(*neg
);
1751 Polyhedron_Free(*pos
);
1759 * unimodularly transform P such that constraint r is transformed
1760 * into a constraint that involves only a single (the first)
1761 * existential variable
1764 static Polyhedron
*rotate_along(Polyhedron
*P
, int r
, int nvar
, int exist
,
1770 Vector
*row
= Vector_Alloc(exist
);
1771 Vector_Copy(P
->Constraint
[r
]+1+nvar
, row
->p
, exist
);
1772 Vector_Gcd(row
->p
, exist
, &g
);
1773 if (value_notone_p(g
))
1774 Vector_AntiScale(row
->p
, row
->p
, g
, exist
);
1777 Matrix
*M
= unimodular_complete(row
);
1778 Matrix
*M2
= Matrix_Alloc(P
->Dimension
+1, P
->Dimension
+1);
1779 for (r
= 0; r
< nvar
; ++r
)
1780 value_set_si(M2
->p
[r
][r
], 1);
1781 for ( ; r
< nvar
+exist
; ++r
)
1782 Vector_Copy(M
->p
[r
-nvar
], M2
->p
[r
]+nvar
, exist
);
1783 for ( ; r
< P
->Dimension
+1; ++r
)
1784 value_set_si(M2
->p
[r
][r
], 1);
1785 Polyhedron
*T
= Polyhedron_Image(P
, M2
, MaxRays
);
1794 static bool SplitOnVar(Polyhedron
*P
, int i
,
1795 int nvar
, int len
, int exist
, int MaxRays
,
1796 Vector
*row
, Value
& f
, bool independent
,
1797 Polyhedron
**pos
, Polyhedron
**neg
)
1801 for (int l
= P
->NbEq
; l
< P
->NbConstraints
; ++l
) {
1802 if (value_negz_p(P
->Constraint
[l
][nvar
+i
+1]))
1806 for (j
= 0; j
< exist
; ++j
)
1807 if (j
!= i
&& value_notzero_p(P
->Constraint
[l
][nvar
+j
+1]))
1813 for (int u
= P
->NbEq
; u
< P
->NbConstraints
; ++u
) {
1814 if (value_posz_p(P
->Constraint
[u
][nvar
+i
+1]))
1818 for (j
= 0; j
< exist
; ++j
)
1819 if (j
!= i
&& value_notzero_p(P
->Constraint
[u
][nvar
+j
+1]))
1825 if (SplitOnConstraint(P
, i
, l
, u
,
1826 nvar
, len
, exist
, MaxRays
,
1827 row
, f
, independent
,
1831 SwapColumns(*neg
, nvar
+1, nvar
+1+i
);
1841 static bool double_bound_pair(Polyhedron
*P
, int nvar
, int exist
,
1842 int i
, int l1
, int l2
,
1843 Polyhedron
**pos
, Polyhedron
**neg
)
1847 Vector
*row
= Vector_Alloc(P
->Dimension
+2);
1848 value_set_si(row
->p
[0], 1);
1849 value_oppose(f
, P
->Constraint
[l1
][nvar
+i
+1]);
1850 Vector_Combine(P
->Constraint
[l1
]+1, P
->Constraint
[l2
]+1,
1852 P
->Constraint
[l2
][nvar
+i
+1], f
,
1854 ConstraintSimplify(row
->p
, row
->p
, P
->Dimension
+2, &f
);
1855 *pos
= AddConstraints(row
->p
, 1, P
, 0);
1856 value_set_si(f
, -1);
1857 Vector_Scale(row
->p
+1, row
->p
+1, f
, P
->Dimension
+1);
1858 value_decrement(row
->p
[P
->Dimension
+1], row
->p
[P
->Dimension
+1]);
1859 *neg
= AddConstraints(row
->p
, 1, P
, 0);
1863 return !emptyQ((*pos
)) && !emptyQ((*neg
));
1866 static bool double_bound(Polyhedron
*P
, int nvar
, int exist
,
1867 Polyhedron
**pos
, Polyhedron
**neg
)
1869 for (int i
= 0; i
< exist
; ++i
) {
1871 for (l1
= P
->NbEq
; l1
< P
->NbConstraints
; ++l1
) {
1872 if (value_negz_p(P
->Constraint
[l1
][nvar
+i
+1]))
1874 for (l2
= l1
+ 1; l2
< P
->NbConstraints
; ++l2
) {
1875 if (value_negz_p(P
->Constraint
[l2
][nvar
+i
+1]))
1877 if (double_bound_pair(P
, nvar
, exist
, i
, l1
, l2
, pos
, neg
))
1881 for (l1
= P
->NbEq
; l1
< P
->NbConstraints
; ++l1
) {
1882 if (value_posz_p(P
->Constraint
[l1
][nvar
+i
+1]))
1884 if (l1
< P
->NbConstraints
)
1885 for (l2
= l1
+ 1; l2
< P
->NbConstraints
; ++l2
) {
1886 if (value_posz_p(P
->Constraint
[l2
][nvar
+i
+1]))
1888 if (double_bound_pair(P
, nvar
, exist
, i
, l1
, l2
, pos
, neg
))
1900 INDEPENDENT
= 1 << 2,
1903 static evalue
* enumerate_or(Polyhedron
*D
,
1904 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
1907 fprintf(stderr
, "\nER: Or\n");
1908 #endif /* DEBUG_ER */
1910 Polyhedron
*N
= D
->next
;
1913 barvinok_enumerate_e(D
, exist
, nparam
, MaxRays
);
1916 for (D
= N
; D
; D
= N
) {
1921 barvinok_enumerate_e(D
, exist
, nparam
, MaxRays
);
1924 free_evalue_refs(EN
);
1934 static evalue
* enumerate_sum(Polyhedron
*P
,
1935 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
1937 int nvar
= P
->Dimension
- exist
- nparam
;
1938 int toswap
= nvar
< exist
? nvar
: exist
;
1939 for (int i
= 0; i
< toswap
; ++i
)
1940 SwapColumns(P
, 1 + i
, nvar
+exist
- i
);
1944 fprintf(stderr
, "\nER: Sum\n");
1945 #endif /* DEBUG_ER */
1947 evalue
*EP
= barvinok_enumerate_e(P
, exist
, nparam
, MaxRays
);
1949 for (int i
= 0; i
< /* nvar */ nparam
; ++i
) {
1950 Matrix
*C
= Matrix_Alloc(1, 1 + nparam
+ 1);
1951 value_set_si(C
->p
[0][0], 1);
1953 value_init(split
.d
);
1954 value_set_si(split
.d
, 0);
1955 split
.x
.p
= new_enode(partition
, 4, nparam
);
1956 value_set_si(C
->p
[0][1+i
], 1);
1957 Matrix
*C2
= Matrix_Copy(C
);
1958 EVALUE_SET_DOMAIN(split
.x
.p
->arr
[0],
1959 Constraints2Polyhedron(C2
, MaxRays
));
1961 evalue_set_si(&split
.x
.p
->arr
[1], 1, 1);
1962 value_set_si(C
->p
[0][1+i
], -1);
1963 value_set_si(C
->p
[0][1+nparam
], -1);
1964 EVALUE_SET_DOMAIN(split
.x
.p
->arr
[2],
1965 Constraints2Polyhedron(C
, MaxRays
));
1966 evalue_set_si(&split
.x
.p
->arr
[3], 1, 1);
1968 free_evalue_refs(&split
);
1972 evalue_range_reduction(EP
);
1974 evalue_frac2floor(EP
);
1976 evalue
*sum
= esum(EP
, nvar
);
1978 free_evalue_refs(EP
);
1982 evalue_range_reduction(EP
);
1987 static evalue
* split_sure(Polyhedron
*P
, Polyhedron
*S
,
1988 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
1990 int nvar
= P
->Dimension
- exist
- nparam
;
1992 Matrix
*M
= Matrix_Alloc(exist
, S
->Dimension
+2);
1993 for (int i
= 0; i
< exist
; ++i
)
1994 value_set_si(M
->p
[i
][nvar
+i
+1], 1);
1996 S
= DomainAddRays(S
, M
, MaxRays
);
1998 Polyhedron
*F
= DomainAddRays(P
, M
, MaxRays
);
1999 Polyhedron
*D
= DomainDifference(F
, S
, MaxRays
);
2001 D
= Disjoint_Domain(D
, 0, MaxRays
);
2006 M
= Matrix_Alloc(P
->Dimension
+1-exist
, P
->Dimension
+1);
2007 for (int j
= 0; j
< nvar
; ++j
)
2008 value_set_si(M
->p
[j
][j
], 1);
2009 for (int j
= 0; j
< nparam
+1; ++j
)
2010 value_set_si(M
->p
[nvar
+j
][nvar
+exist
+j
], 1);
2011 Polyhedron
*T
= Polyhedron_Image(S
, M
, MaxRays
);
2012 evalue
*EP
= barvinok_enumerate_e(T
, 0, nparam
, MaxRays
);
2017 for (Polyhedron
*Q
= D
; Q
; Q
= Q
->next
) {
2018 Polyhedron
*N
= Q
->next
;
2020 T
= DomainIntersection(P
, Q
, MaxRays
);
2021 evalue
*E
= barvinok_enumerate_e(T
, exist
, nparam
, MaxRays
);
2023 free_evalue_refs(E
);
2032 static evalue
* enumerate_sure(Polyhedron
*P
,
2033 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
2037 int nvar
= P
->Dimension
- exist
- nparam
;
2043 for (i
= 0; i
< exist
; ++i
) {
2044 Matrix
*M
= Matrix_Alloc(S
->NbConstraints
, S
->Dimension
+2);
2046 value_set_si(lcm
, 1);
2047 for (int j
= 0; j
< S
->NbConstraints
; ++j
) {
2048 if (value_negz_p(S
->Constraint
[j
][1+nvar
+i
]))
2050 if (value_one_p(S
->Constraint
[j
][1+nvar
+i
]))
2052 value_lcm(lcm
, S
->Constraint
[j
][1+nvar
+i
], &lcm
);
2055 for (int j
= 0; j
< S
->NbConstraints
; ++j
) {
2056 if (value_negz_p(S
->Constraint
[j
][1+nvar
+i
]))
2058 if (value_one_p(S
->Constraint
[j
][1+nvar
+i
]))
2060 value_division(f
, lcm
, S
->Constraint
[j
][1+nvar
+i
]);
2061 Vector_Scale(S
->Constraint
[j
], M
->p
[c
], f
, S
->Dimension
+2);
2062 value_substract(M
->p
[c
][S
->Dimension
+1],
2063 M
->p
[c
][S
->Dimension
+1],
2065 value_increment(M
->p
[c
][S
->Dimension
+1],
2066 M
->p
[c
][S
->Dimension
+1]);
2070 S
= AddConstraints(M
->p
[0], c
, S
, MaxRays
);
2085 fprintf(stderr
, "\nER: Sure\n");
2086 #endif /* DEBUG_ER */
2088 return split_sure(P
, S
, exist
, nparam
, MaxRays
);
2091 static evalue
* enumerate_sure2(Polyhedron
*P
,
2092 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
2094 int nvar
= P
->Dimension
- exist
- nparam
;
2096 for (r
= 0; r
< P
->NbRays
; ++r
)
2097 if (value_one_p(P
->Ray
[r
][0]) &&
2098 value_one_p(P
->Ray
[r
][P
->Dimension
+1]))
2104 Matrix
*M
= Matrix_Alloc(nvar
+ 1 + nparam
, P
->Dimension
+2);
2105 for (int i
= 0; i
< nvar
; ++i
)
2106 value_set_si(M
->p
[i
][1+i
], 1);
2107 for (int i
= 0; i
< nparam
; ++i
)
2108 value_set_si(M
->p
[i
+nvar
][1+nvar
+exist
+i
], 1);
2109 Vector_Copy(P
->Ray
[r
]+1+nvar
, M
->p
[nvar
+nparam
]+1+nvar
, exist
);
2110 value_set_si(M
->p
[nvar
+nparam
][0], 1);
2111 value_set_si(M
->p
[nvar
+nparam
][P
->Dimension
+1], 1);
2112 Polyhedron
* F
= Rays2Polyhedron(M
, MaxRays
);
2115 Polyhedron
*I
= DomainIntersection(F
, P
, MaxRays
);
2119 fprintf(stderr
, "\nER: Sure2\n");
2120 #endif /* DEBUG_ER */
2122 return split_sure(P
, I
, exist
, nparam
, MaxRays
);
2125 static evalue
* enumerate_cyclic(Polyhedron
*P
,
2126 unsigned exist
, unsigned nparam
,
2127 evalue
* EP
, int r
, int p
, unsigned MaxRays
)
2129 int nvar
= P
->Dimension
- exist
- nparam
;
2131 /* If EP in its fractional maps only contains references
2132 * to the remainder parameter with appropriate coefficients
2133 * then we could in principle avoid adding existentially
2134 * quantified variables to the validity domains.
2135 * We'd have to replace the remainder by m { p/m }
2136 * and multiply with an appropriate factor that is one
2137 * only in the appropriate range.
2138 * This last multiplication can be avoided if EP
2139 * has a single validity domain with no (further)
2140 * constraints on the remainder parameter
2143 Matrix
*CT
= Matrix_Alloc(nparam
+1, nparam
+3);
2144 Matrix
*M
= Matrix_Alloc(1, 1+nparam
+3);
2145 for (int j
= 0; j
< nparam
; ++j
)
2147 value_set_si(CT
->p
[j
][j
], 1);
2148 value_set_si(CT
->p
[p
][nparam
+1], 1);
2149 value_set_si(CT
->p
[nparam
][nparam
+2], 1);
2150 value_set_si(M
->p
[0][1+p
], -1);
2151 value_absolute(M
->p
[0][1+nparam
], P
->Ray
[0][1+nvar
+exist
+p
]);
2152 value_set_si(M
->p
[0][1+nparam
+1], 1);
2153 Polyhedron
*CEq
= Constraints2Polyhedron(M
, 1);
2155 addeliminatedparams_enum(EP
, CT
, CEq
, MaxRays
, nparam
);
2156 Polyhedron_Free(CEq
);
2162 static void enumerate_vd_add_ray(evalue
*EP
, Matrix
*Rays
, unsigned MaxRays
)
2164 if (value_notzero_p(EP
->d
))
2167 assert(EP
->x
.p
->type
== partition
);
2168 assert(EP
->x
.p
->pos
== EVALUE_DOMAIN(EP
->x
.p
->arr
[0])->Dimension
);
2169 for (int i
= 0; i
< EP
->x
.p
->size
/2; ++i
) {
2170 Polyhedron
*D
= EVALUE_DOMAIN(EP
->x
.p
->arr
[2*i
]);
2171 Polyhedron
*N
= DomainAddRays(D
, Rays
, MaxRays
);
2172 EVALUE_SET_DOMAIN(EP
->x
.p
->arr
[2*i
], N
);
2177 static evalue
* enumerate_line(Polyhedron
*P
,
2178 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
2184 fprintf(stderr
, "\nER: Line\n");
2185 #endif /* DEBUG_ER */
2187 int nvar
= P
->Dimension
- exist
- nparam
;
2189 for (i
= 0; i
< nparam
; ++i
)
2190 if (value_notzero_p(P
->Ray
[0][1+nvar
+exist
+i
]))
2193 for (j
= i
+1; j
< nparam
; ++j
)
2194 if (value_notzero_p(P
->Ray
[0][1+nvar
+exist
+i
]))
2196 assert(j
>= nparam
); // for now
2198 Matrix
*M
= Matrix_Alloc(2, P
->Dimension
+2);
2199 value_set_si(M
->p
[0][0], 1);
2200 value_set_si(M
->p
[0][1+nvar
+exist
+i
], 1);
2201 value_set_si(M
->p
[1][0], 1);
2202 value_set_si(M
->p
[1][1+nvar
+exist
+i
], -1);
2203 value_absolute(M
->p
[1][1+P
->Dimension
], P
->Ray
[0][1+nvar
+exist
+i
]);
2204 value_decrement(M
->p
[1][1+P
->Dimension
], M
->p
[1][1+P
->Dimension
]);
2205 Polyhedron
*S
= AddConstraints(M
->p
[0], 2, P
, MaxRays
);
2206 evalue
*EP
= barvinok_enumerate_e(S
, exist
, nparam
, MaxRays
);
2210 return enumerate_cyclic(P
, exist
, nparam
, EP
, 0, i
, MaxRays
);
2213 static int single_param_pos(Polyhedron
*P
, unsigned exist
, unsigned nparam
,
2216 int nvar
= P
->Dimension
- exist
- nparam
;
2217 if (First_Non_Zero(P
->Ray
[r
]+1, nvar
) != -1)
2219 int i
= First_Non_Zero(P
->Ray
[r
]+1+nvar
+exist
, nparam
);
2222 if (First_Non_Zero(P
->Ray
[r
]+1+nvar
+exist
+1, nparam
-i
-1) != -1)
2227 static evalue
* enumerate_remove_ray(Polyhedron
*P
, int r
,
2228 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
2231 fprintf(stderr
, "\nER: RedundantRay\n");
2232 #endif /* DEBUG_ER */
2236 value_set_si(one
, 1);
2237 int len
= P
->NbRays
-1;
2238 Matrix
*M
= Matrix_Alloc(2 * len
, P
->Dimension
+2);
2239 Vector_Copy(P
->Ray
[0], M
->p
[0], r
* (P
->Dimension
+2));
2240 Vector_Copy(P
->Ray
[r
+1], M
->p
[r
], (len
-r
) * (P
->Dimension
+2));
2241 for (int j
= 0; j
< P
->NbRays
; ++j
) {
2244 Vector_Combine(P
->Ray
[j
], P
->Ray
[r
], M
->p
[len
+j
-(j
>r
)],
2245 one
, P
->Ray
[j
][P
->Dimension
+1], P
->Dimension
+2);
2248 P
= Rays2Polyhedron(M
, MaxRays
);
2250 evalue
*EP
= barvinok_enumerate_e(P
, exist
, nparam
, MaxRays
);
2257 static evalue
* enumerate_redundant_ray(Polyhedron
*P
,
2258 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
2260 assert(P
->NbBid
== 0);
2261 int nvar
= P
->Dimension
- exist
- nparam
;
2265 for (int r
= 0; r
< P
->NbRays
; ++r
) {
2266 if (value_notzero_p(P
->Ray
[r
][P
->Dimension
+1]))
2268 int i1
= single_param_pos(P
, exist
, nparam
, r
);
2271 for (int r2
= r
+1; r2
< P
->NbRays
; ++r2
) {
2272 if (value_notzero_p(P
->Ray
[r2
][P
->Dimension
+1]))
2274 int i2
= single_param_pos(P
, exist
, nparam
, r2
);
2280 value_division(m
, P
->Ray
[r
][1+nvar
+exist
+i1
],
2281 P
->Ray
[r2
][1+nvar
+exist
+i1
]);
2282 value_multiply(m
, m
, P
->Ray
[r2
][1+nvar
+exist
+i1
]);
2283 /* r2 divides r => r redundant */
2284 if (value_eq(m
, P
->Ray
[r
][1+nvar
+exist
+i1
])) {
2286 return enumerate_remove_ray(P
, r
, exist
, nparam
, MaxRays
);
2289 value_division(m
, P
->Ray
[r2
][1+nvar
+exist
+i1
],
2290 P
->Ray
[r
][1+nvar
+exist
+i1
]);
2291 value_multiply(m
, m
, P
->Ray
[r
][1+nvar
+exist
+i1
]);
2292 /* r divides r2 => r2 redundant */
2293 if (value_eq(m
, P
->Ray
[r2
][1+nvar
+exist
+i1
])) {
2295 return enumerate_remove_ray(P
, r2
, exist
, nparam
, MaxRays
);
2303 static Polyhedron
*upper_bound(Polyhedron
*P
,
2304 int pos
, Value
*max
, Polyhedron
**R
)
2313 for (Polyhedron
*Q
= P
; Q
; Q
= N
) {
2315 for (r
= 0; r
< P
->NbRays
; ++r
) {
2316 if (value_zero_p(P
->Ray
[r
][P
->Dimension
+1]) &&
2317 value_pos_p(P
->Ray
[r
][1+pos
]))
2320 if (r
< P
->NbRays
) {
2328 for (r
= 0; r
< P
->NbRays
; ++r
) {
2329 if (value_zero_p(P
->Ray
[r
][P
->Dimension
+1]))
2331 mpz_fdiv_q(v
, P
->Ray
[r
][1+pos
], P
->Ray
[r
][1+P
->Dimension
]);
2332 if ((!Q
->next
&& r
== 0) || value_gt(v
, *max
))
2333 value_assign(*max
, v
);
2340 static evalue
* enumerate_ray(Polyhedron
*P
,
2341 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
2343 assert(P
->NbBid
== 0);
2344 int nvar
= P
->Dimension
- exist
- nparam
;
2347 for (r
= 0; r
< P
->NbRays
; ++r
)
2348 if (value_zero_p(P
->Ray
[r
][P
->Dimension
+1]))
2354 for (r2
= r
+1; r2
< P
->NbRays
; ++r2
)
2355 if (value_zero_p(P
->Ray
[r2
][P
->Dimension
+1]))
2357 if (r2
< P
->NbRays
) {
2359 return enumerate_sum(P
, exist
, nparam
, MaxRays
);
2363 fprintf(stderr
, "\nER: Ray\n");
2364 #endif /* DEBUG_ER */
2370 value_set_si(one
, 1);
2371 int i
= single_param_pos(P
, exist
, nparam
, r
);
2372 assert(i
!= -1); // for now;
2374 Matrix
*M
= Matrix_Alloc(P
->NbRays
, P
->Dimension
+2);
2375 for (int j
= 0; j
< P
->NbRays
; ++j
) {
2376 Vector_Combine(P
->Ray
[j
], P
->Ray
[r
], M
->p
[j
],
2377 one
, P
->Ray
[j
][P
->Dimension
+1], P
->Dimension
+2);
2379 Polyhedron
*S
= Rays2Polyhedron(M
, MaxRays
);
2381 Polyhedron
*D
= DomainDifference(P
, S
, MaxRays
);
2383 // Polyhedron_Print(stderr, P_VALUE_FMT, D);
2384 assert(value_pos_p(P
->Ray
[r
][1+nvar
+exist
+i
])); // for now
2386 D
= upper_bound(D
, nvar
+exist
+i
, &m
, &R
);
2390 M
= Matrix_Alloc(2, P
->Dimension
+2);
2391 value_set_si(M
->p
[0][0], 1);
2392 value_set_si(M
->p
[1][0], 1);
2393 value_set_si(M
->p
[0][1+nvar
+exist
+i
], -1);
2394 value_set_si(M
->p
[1][1+nvar
+exist
+i
], 1);
2395 value_assign(M
->p
[0][1+P
->Dimension
], m
);
2396 value_oppose(M
->p
[1][1+P
->Dimension
], m
);
2397 value_addto(M
->p
[1][1+P
->Dimension
], M
->p
[1][1+P
->Dimension
],
2398 P
->Ray
[r
][1+nvar
+exist
+i
]);
2399 value_decrement(M
->p
[1][1+P
->Dimension
], M
->p
[1][1+P
->Dimension
]);
2400 // Matrix_Print(stderr, P_VALUE_FMT, M);
2401 D
= AddConstraints(M
->p
[0], 2, P
, MaxRays
);
2402 // Polyhedron_Print(stderr, P_VALUE_FMT, D);
2403 value_substract(M
->p
[0][1+P
->Dimension
], M
->p
[0][1+P
->Dimension
],
2404 P
->Ray
[r
][1+nvar
+exist
+i
]);
2405 // Matrix_Print(stderr, P_VALUE_FMT, M);
2406 S
= AddConstraints(M
->p
[0], 1, P
, MaxRays
);
2407 // Polyhedron_Print(stderr, P_VALUE_FMT, S);
2410 evalue
*EP
= barvinok_enumerate_e(D
, exist
, nparam
, MaxRays
);
2415 if (value_notone_p(P
->Ray
[r
][1+nvar
+exist
+i
]))
2416 EP
= enumerate_cyclic(P
, exist
, nparam
, EP
, r
, i
, MaxRays
);
2418 M
= Matrix_Alloc(1, nparam
+2);
2419 value_set_si(M
->p
[0][0], 1);
2420 value_set_si(M
->p
[0][1+i
], 1);
2421 enumerate_vd_add_ray(EP
, M
, MaxRays
);
2426 evalue
*E
= barvinok_enumerate_e(S
, exist
, nparam
, MaxRays
);
2428 free_evalue_refs(E
);
2435 evalue
*ER
= enumerate_or(R
, exist
, nparam
, MaxRays
);
2437 free_evalue_refs(ER
);
2444 static evalue
* new_zero_ep()
2449 evalue_set_si(EP
, 0, 1);
2453 static evalue
* enumerate_vd(Polyhedron
**PA
,
2454 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
2456 Polyhedron
*P
= *PA
;
2457 int nvar
= P
->Dimension
- exist
- nparam
;
2458 Param_Polyhedron
*PP
= NULL
;
2459 Polyhedron
*C
= Universe_Polyhedron(nparam
);
2463 PP
= Polyhedron2Param_SimplifiedDomain(&PR
,C
,MaxRays
,&CEq
,&CT
);
2467 Param_Domain
*D
, *last
;
2470 for (nd
= 0, D
=PP
->D
; D
; D
=D
->next
, ++nd
)
2473 Polyhedron
**VD
= new (Polyhedron
*)[nd
];
2474 Polyhedron
**fVD
= new (Polyhedron
*)[nd
];
2475 for(nd
= 0, D
=PP
->D
; D
; D
=D
->next
) {
2476 Polyhedron
*rVD
= reduce_domain(D
->Domain
, CT
, CEq
,
2490 /* This doesn't seem to have any effect */
2492 Polyhedron
*CA
= align_context(VD
[0], P
->Dimension
, MaxRays
);
2494 P
= DomainIntersection(P
, CA
, MaxRays
);
2497 Polyhedron_Free(CA
);
2502 if (!EP
&& CT
->NbColumns
!= CT
->NbRows
) {
2503 Polyhedron
*CEqr
= DomainImage(CEq
, CT
, MaxRays
);
2504 Polyhedron
*CA
= align_context(CEqr
, PR
->Dimension
, MaxRays
);
2505 Polyhedron
*I
= DomainIntersection(PR
, CA
, MaxRays
);
2506 Polyhedron_Free(CEqr
);
2507 Polyhedron_Free(CA
);
2509 fprintf(stderr
, "\nER: Eliminate\n");
2510 #endif /* DEBUG_ER */
2511 nparam
-= CT
->NbColumns
- CT
->NbRows
;
2512 EP
= barvinok_enumerate_e(I
, exist
, nparam
, MaxRays
);
2513 nparam
+= CT
->NbColumns
- CT
->NbRows
;
2514 addeliminatedparams_enum(EP
, CT
, CEq
, MaxRays
, nparam
);
2518 Polyhedron_Free(PR
);
2521 if (!EP
&& nd
> 1) {
2523 fprintf(stderr
, "\nER: VD\n");
2524 #endif /* DEBUG_ER */
2525 for (int i
= 0; i
< nd
; ++i
) {
2526 Polyhedron
*CA
= align_context(VD
[i
], P
->Dimension
, MaxRays
);
2527 Polyhedron
*I
= DomainIntersection(P
, CA
, MaxRays
);
2530 EP
= barvinok_enumerate_e(I
, exist
, nparam
, MaxRays
);
2532 evalue
*E
= barvinok_enumerate_e(I
, exist
, nparam
, MaxRays
);
2534 free_evalue_refs(E
);
2538 Polyhedron_Free(CA
);
2542 for (int i
= 0; i
< nd
; ++i
) {
2543 Polyhedron_Free(VD
[i
]);
2544 Polyhedron_Free(fVD
[i
]);
2550 if (!EP
&& nvar
== 0) {
2553 Param_Vertices
*V
, *V2
;
2554 Matrix
* M
= Matrix_Alloc(1, P
->Dimension
+2);
2556 FORALL_PVertex_in_ParamPolyhedron(V
, last
, PP
) {
2558 FORALL_PVertex_in_ParamPolyhedron(V2
, last
, PP
) {
2565 for (int i
= 0; i
< exist
; ++i
) {
2566 value_oppose(f
, V
->Vertex
->p
[i
][nparam
+1]);
2567 Vector_Combine(V
->Vertex
->p
[i
],
2569 M
->p
[0] + 1 + nvar
+ exist
,
2570 V2
->Vertex
->p
[i
][nparam
+1],
2574 for (j
= 0; j
< nparam
; ++j
)
2575 if (value_notzero_p(M
->p
[0][1+nvar
+exist
+j
]))
2579 ConstraintSimplify(M
->p
[0], M
->p
[0],
2580 P
->Dimension
+2, &f
);
2581 value_set_si(M
->p
[0][0], 0);
2582 Polyhedron
*para
= AddConstraints(M
->p
[0], 1, P
,
2585 Polyhedron_Free(para
);
2588 Polyhedron
*pos
, *neg
;
2589 value_set_si(M
->p
[0][0], 1);
2590 value_decrement(M
->p
[0][P
->Dimension
+1],
2591 M
->p
[0][P
->Dimension
+1]);
2592 neg
= AddConstraints(M
->p
[0], 1, P
, MaxRays
);
2593 value_set_si(f
, -1);
2594 Vector_Scale(M
->p
[0]+1, M
->p
[0]+1, f
,
2596 value_decrement(M
->p
[0][P
->Dimension
+1],
2597 M
->p
[0][P
->Dimension
+1]);
2598 value_decrement(M
->p
[0][P
->Dimension
+1],
2599 M
->p
[0][P
->Dimension
+1]);
2600 pos
= AddConstraints(M
->p
[0], 1, P
, MaxRays
);
2601 if (emptyQ(neg
) && emptyQ(pos
)) {
2602 Polyhedron_Free(para
);
2603 Polyhedron_Free(pos
);
2604 Polyhedron_Free(neg
);
2608 fprintf(stderr
, "\nER: Order\n");
2609 #endif /* DEBUG_ER */
2610 EP
= barvinok_enumerate_e(para
, exist
, nparam
, MaxRays
);
2613 E
= barvinok_enumerate_e(pos
, exist
, nparam
, MaxRays
);
2615 free_evalue_refs(E
);
2619 E
= barvinok_enumerate_e(neg
, exist
, nparam
, MaxRays
);
2621 free_evalue_refs(E
);
2624 Polyhedron_Free(para
);
2625 Polyhedron_Free(pos
);
2626 Polyhedron_Free(neg
);
2631 } END_FORALL_PVertex_in_ParamPolyhedron
;
2634 } END_FORALL_PVertex_in_ParamPolyhedron
;
2637 /* Search for vertex coordinate to split on */
2638 /* First look for one independent of the parameters */
2639 FORALL_PVertex_in_ParamPolyhedron(V
, last
, PP
) {
2640 for (int i
= 0; i
< exist
; ++i
) {
2642 for (j
= 0; j
< nparam
; ++j
)
2643 if (value_notzero_p(V
->Vertex
->p
[i
][j
]))
2647 value_set_si(M
->p
[0][0], 1);
2648 Vector_Set(M
->p
[0]+1, 0, nvar
+exist
);
2649 Vector_Copy(V
->Vertex
->p
[i
],
2650 M
->p
[0] + 1 + nvar
+ exist
, nparam
+1);
2651 value_oppose(M
->p
[0][1+nvar
+i
],
2652 V
->Vertex
->p
[i
][nparam
+1]);
2654 Polyhedron
*pos
, *neg
;
2655 value_set_si(M
->p
[0][0], 1);
2656 value_decrement(M
->p
[0][P
->Dimension
+1],
2657 M
->p
[0][P
->Dimension
+1]);
2658 neg
= AddConstraints(M
->p
[0], 1, P
, MaxRays
);
2659 value_set_si(f
, -1);
2660 Vector_Scale(M
->p
[0]+1, M
->p
[0]+1, f
,
2662 value_decrement(M
->p
[0][P
->Dimension
+1],
2663 M
->p
[0][P
->Dimension
+1]);
2664 value_decrement(M
->p
[0][P
->Dimension
+1],
2665 M
->p
[0][P
->Dimension
+1]);
2666 pos
= AddConstraints(M
->p
[0], 1, P
, MaxRays
);
2667 if (emptyQ(neg
) || emptyQ(pos
)) {
2668 Polyhedron_Free(pos
);
2669 Polyhedron_Free(neg
);
2672 Polyhedron_Free(pos
);
2673 value_increment(M
->p
[0][P
->Dimension
+1],
2674 M
->p
[0][P
->Dimension
+1]);
2675 pos
= AddConstraints(M
->p
[0], 1, P
, MaxRays
);
2677 fprintf(stderr
, "\nER: Vertex\n");
2678 #endif /* DEBUG_ER */
2680 EP
= enumerate_or(pos
, exist
, nparam
, MaxRays
);
2685 } END_FORALL_PVertex_in_ParamPolyhedron
;
2689 /* Search for vertex coordinate to split on */
2690 /* Now look for one that depends on the parameters */
2691 FORALL_PVertex_in_ParamPolyhedron(V
, last
, PP
) {
2692 for (int i
= 0; i
< exist
; ++i
) {
2693 value_set_si(M
->p
[0][0], 1);
2694 Vector_Set(M
->p
[0]+1, 0, nvar
+exist
);
2695 Vector_Copy(V
->Vertex
->p
[i
],
2696 M
->p
[0] + 1 + nvar
+ exist
, nparam
+1);
2697 value_oppose(M
->p
[0][1+nvar
+i
],
2698 V
->Vertex
->p
[i
][nparam
+1]);
2700 Polyhedron
*pos
, *neg
;
2701 value_set_si(M
->p
[0][0], 1);
2702 value_decrement(M
->p
[0][P
->Dimension
+1],
2703 M
->p
[0][P
->Dimension
+1]);
2704 neg
= AddConstraints(M
->p
[0], 1, P
, MaxRays
);
2705 value_set_si(f
, -1);
2706 Vector_Scale(M
->p
[0]+1, M
->p
[0]+1, f
,
2708 value_decrement(M
->p
[0][P
->Dimension
+1],
2709 M
->p
[0][P
->Dimension
+1]);
2710 value_decrement(M
->p
[0][P
->Dimension
+1],
2711 M
->p
[0][P
->Dimension
+1]);
2712 pos
= AddConstraints(M
->p
[0], 1, P
, MaxRays
);
2713 if (emptyQ(neg
) || emptyQ(pos
)) {
2714 Polyhedron_Free(pos
);
2715 Polyhedron_Free(neg
);
2718 Polyhedron_Free(pos
);
2719 value_increment(M
->p
[0][P
->Dimension
+1],
2720 M
->p
[0][P
->Dimension
+1]);
2721 pos
= AddConstraints(M
->p
[0], 1, P
, MaxRays
);
2723 fprintf(stderr
, "\nER: ParamVertex\n");
2724 #endif /* DEBUG_ER */
2726 EP
= enumerate_or(pos
, exist
, nparam
, MaxRays
);
2731 } END_FORALL_PVertex_in_ParamPolyhedron
;
2739 Polyhedron_Free(CEq
);
2743 Param_Polyhedron_Free(PP
);
2750 static evalue
*enumerate_pip(Polyhedron
*P
,
2751 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
2756 static evalue
*enumerate_pip(Polyhedron
*P
,
2757 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
2759 int nvar
= P
->Dimension
- exist
- nparam
;
2760 evalue
*EP
= new_zero_ep();
2761 Polyhedron
*Q
, *N
, *T
= 0;
2764 fprintf(stderr
, "\nER: PIP\n");
2765 #endif /* DEBUG_ER */
2767 for (int i
= 0; i
< P
->Dimension
; ++i
) {
2770 for (int j
= 0; j
< P
->NbRays
; ++j
) {
2771 if (value_pos_p(P
->Ray
[j
][1+i
]))
2773 else if (value_neg_p(P
->Ray
[j
][1+i
]))
2776 assert(!(pos
&& neg
)); // for now
2779 T
= Polyhedron_Copy(P
);
2780 for (int j
= 0; j
< T
->NbRays
; ++j
)
2781 value_oppose(T
->Ray
[j
][1+i
], T
->Ray
[j
][1+i
]);
2782 for (int j
= 0; j
< T
->NbConstraints
; ++j
)
2783 value_oppose(T
->Constraint
[j
][1+i
], T
->Constraint
[j
][1+i
]);
2787 Polyhedron
*D
= pip_lexmin(T
? T
: P
, exist
, nparam
);
2788 for (Q
= D
; Q
; Q
= N
) {
2792 exist
= Q
->Dimension
- nvar
- nparam
;
2793 E
= barvinok_enumerate_e(Q
, exist
, nparam
, MaxRays
);
2796 free_evalue_refs(E
);
2808 static bool is_single(Value
*row
, int pos
, int len
)
2810 return First_Non_Zero(row
, pos
) == -1 &&
2811 First_Non_Zero(row
+pos
+1, len
-pos
-1) == -1;
2814 static evalue
* barvinok_enumerate_e_r(Polyhedron
*P
,
2815 unsigned exist
, unsigned nparam
, unsigned MaxRays
);
2818 static int er_level
= 0;
2820 evalue
* barvinok_enumerate_e(Polyhedron
*P
,
2821 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
2823 fprintf(stderr
, "\nER: level %i\n", er_level
);
2824 int nvar
= P
->Dimension
- exist
- nparam
;
2825 fprintf(stderr
, "%d %d %d\n", nvar
, exist
, nparam
);
2827 Polyhedron_Print(stderr
, P_VALUE_FMT
, P
);
2829 P
= DomainConstraintSimplify(Polyhedron_Copy(P
), MaxRays
);
2830 evalue
*EP
= barvinok_enumerate_e_r(P
, exist
, nparam
, MaxRays
);
2836 evalue
* barvinok_enumerate_e(Polyhedron
*P
,
2837 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
2839 P
= DomainConstraintSimplify(Polyhedron_Copy(P
), MaxRays
);
2840 evalue
*EP
= barvinok_enumerate_e_r(P
, exist
, nparam
, MaxRays
);
2846 static evalue
* barvinok_enumerate_e_r(Polyhedron
*P
,
2847 unsigned exist
, unsigned nparam
, unsigned MaxRays
)
2850 Polyhedron
*U
= Universe_Polyhedron(nparam
);
2851 evalue
*EP
= barvinok_enumerate_ev(P
, U
, MaxRays
);
2852 //char *param_name[] = {"P", "Q", "R", "S", "T" };
2853 //print_evalue(stdout, EP, param_name);
2858 int nvar
= P
->Dimension
- exist
- nparam
;
2859 int len
= P
->Dimension
+ 2;
2862 return new_zero_ep();
2864 if (nvar
== 0 && nparam
== 0) {
2865 evalue
*EP
= new_zero_ep();
2866 barvinok_count(P
, &EP
->x
.n
, MaxRays
);
2867 if (value_pos_p(EP
->x
.n
))
2868 value_set_si(EP
->x
.n
, 1);
2873 for (r
= 0; r
< P
->NbRays
; ++r
)
2874 if (value_zero_p(P
->Ray
[r
][0]) ||
2875 value_zero_p(P
->Ray
[r
][P
->Dimension
+1])) {
2877 for (i
= 0; i
< nvar
; ++i
)
2878 if (value_notzero_p(P
->Ray
[r
][i
+1]))
2882 for (i
= nvar
+ exist
; i
< nvar
+ exist
+ nparam
; ++i
)
2883 if (value_notzero_p(P
->Ray
[r
][i
+1]))
2885 if (i
>= nvar
+ exist
+ nparam
)
2888 if (r
< P
->NbRays
) {
2889 evalue
*EP
= new_zero_ep();
2890 value_set_si(EP
->x
.n
, -1);
2895 for (r
= 0; r
< P
->NbEq
; ++r
)
2896 if ((first
= First_Non_Zero(P
->Constraint
[r
]+1+nvar
, exist
)) != -1)
2899 if (First_Non_Zero(P
->Constraint
[r
]+1+nvar
+first
+1,
2900 exist
-first
-1) != -1) {
2901 Polyhedron
*T
= rotate_along(P
, r
, nvar
, exist
, MaxRays
);
2903 fprintf(stderr
, "\nER: Equality\n");
2904 #endif /* DEBUG_ER */
2905 evalue
*EP
= barvinok_enumerate_e(T
, exist
-1, nparam
, MaxRays
);
2910 fprintf(stderr
, "\nER: Fixed\n");
2911 #endif /* DEBUG_ER */
2913 return barvinok_enumerate_e(P
, exist
-1, nparam
, MaxRays
);
2915 Polyhedron
*T
= Polyhedron_Copy(P
);
2916 SwapColumns(T
, nvar
+1, nvar
+1+first
);
2917 evalue
*EP
= barvinok_enumerate_e(T
, exist
-1, nparam
, MaxRays
);
2924 Vector
*row
= Vector_Alloc(len
);
2925 value_set_si(row
->p
[0], 1);
2930 enum constraint info
[exist
];
2931 for (int i
= 0; i
< exist
; ++i
) {
2933 for (int l
= P
->NbEq
; l
< P
->NbConstraints
; ++l
) {
2934 if (value_negz_p(P
->Constraint
[l
][nvar
+i
+1]))
2936 bool l_parallel
= is_single(P
->Constraint
[l
]+nvar
+1, i
, exist
);
2937 for (int u
= P
->NbEq
; u
< P
->NbConstraints
; ++u
) {
2938 if (value_posz_p(P
->Constraint
[u
][nvar
+i
+1]))
2940 bool lu_parallel
= l_parallel
||
2941 is_single(P
->Constraint
[u
]+nvar
+1, i
, exist
);
2942 value_oppose(f
, P
->Constraint
[u
][nvar
+i
+1]);
2943 Vector_Combine(P
->Constraint
[l
]+1, P
->Constraint
[u
]+1, row
->p
+1,
2944 f
, P
->Constraint
[l
][nvar
+i
+1], len
-1);
2945 if (!(info
[i
] & INDEPENDENT
)) {
2947 for (j
= 0; j
< exist
; ++j
)
2948 if (j
!= i
&& value_notzero_p(row
->p
[nvar
+j
+1]))
2951 //printf("independent: i: %d, l: %d, u: %d\n", i, l, u);
2952 info
[i
] = (constraint
)(info
[i
] | INDEPENDENT
);
2955 if (info
[i
] & ALL_POS
) {
2956 value_addto(row
->p
[len
-1], row
->p
[len
-1],
2957 P
->Constraint
[l
][nvar
+i
+1]);
2958 value_addto(row
->p
[len
-1], row
->p
[len
-1], f
);
2959 value_multiply(f
, f
, P
->Constraint
[l
][nvar
+i
+1]);
2960 value_substract(row
->p
[len
-1], row
->p
[len
-1], f
);
2961 value_decrement(row
->p
[len
-1], row
->p
[len
-1]);
2962 ConstraintSimplify(row
->p
, row
->p
, len
, &f
);
2963 value_set_si(f
, -1);
2964 Vector_Scale(row
->p
+1, row
->p
+1, f
, len
-1);
2965 value_decrement(row
->p
[len
-1], row
->p
[len
-1]);
2966 Polyhedron
*T
= AddConstraints(row
->p
, 1, P
, MaxRays
);
2968 //printf("not all_pos: i: %d, l: %d, u: %d\n", i, l, u);
2969 info
[i
] = (constraint
)(info
[i
] ^ ALL_POS
);
2971 //puts("pos remainder");
2972 //Polyhedron_Print(stdout, P_VALUE_FMT, T);
2975 if (!(info
[i
] & ONE_NEG
)) {
2977 negative_test_constraint(P
->Constraint
[l
],
2979 row
->p
, nvar
+i
, len
, &f
);
2980 oppose_constraint(row
->p
, len
, &f
);
2981 Polyhedron
*T
= AddConstraints(row
->p
, 1, P
, MaxRays
);
2983 //printf("one_neg i: %d, l: %d, u: %d\n", i, l, u);
2984 info
[i
] = (constraint
)(info
[i
] | ONE_NEG
);
2986 //puts("neg remainder");
2987 //Polyhedron_Print(stdout, P_VALUE_FMT, T);
2991 if (!(info
[i
] & ALL_POS
) && (info
[i
] & ONE_NEG
))
2995 if (info
[i
] & ALL_POS
)
3002 for (int i = 0; i < exist; ++i)
3003 printf("%i: %i\n", i, info[i]);
3005 for (int i
= 0; i
< exist
; ++i
)
3006 if (info
[i
] & ALL_POS
) {
3008 fprintf(stderr
, "\nER: Positive\n");
3009 #endif /* DEBUG_ER */
3011 // Maybe we should chew off some of the fat here
3012 Matrix
*M
= Matrix_Alloc(P
->Dimension
, P
->Dimension
+1);
3013 for (int j
= 0; j
< P
->Dimension
; ++j
)
3014 value_set_si(M
->p
[j
][j
+ (j
>= i
+nvar
)], 1);
3015 Polyhedron
*T
= Polyhedron_Image(P
, M
, MaxRays
);
3017 evalue
*EP
= barvinok_enumerate_e(T
, exist
-1, nparam
, MaxRays
);
3023 for (int i
= 0; i
< exist
; ++i
)
3024 if (info
[i
] & ONE_NEG
) {
3026 fprintf(stderr
, "\nER: Negative\n");
3027 #endif /* DEBUG_ER */
3031 return barvinok_enumerate_e(P
, exist
-1, nparam
, MaxRays
);
3033 Polyhedron
*T
= Polyhedron_Copy(P
);
3034 SwapColumns(T
, nvar
+1, nvar
+1+i
);
3035 evalue
*EP
= barvinok_enumerate_e(T
, exist
-1, nparam
, MaxRays
);
3040 for (int i
= 0; i
< exist
; ++i
)
3041 if (info
[i
] & INDEPENDENT
) {
3042 Polyhedron
*pos
, *neg
;
3044 /* Find constraint again and split off negative part */
3046 if (SplitOnVar(P
, i
, nvar
, len
, exist
, MaxRays
,
3047 row
, f
, true, &pos
, &neg
)) {
3049 fprintf(stderr
, "\nER: Split\n");
3050 #endif /* DEBUG_ER */
3053 barvinok_enumerate_e(neg
, exist
-1, nparam
, MaxRays
);
3055 barvinok_enumerate_e(pos
, exist
, nparam
, MaxRays
);
3057 free_evalue_refs(E
);
3059 Polyhedron_Free(neg
);
3060 Polyhedron_Free(pos
);
3072 EP
= enumerate_line(P
, exist
, nparam
, MaxRays
);
3076 EP
= enumerate_pip(P
, exist
, nparam
, MaxRays
);
3080 EP
= enumerate_redundant_ray(P
, exist
, nparam
, MaxRays
);
3084 EP
= enumerate_sure(P
, exist
, nparam
, MaxRays
);
3088 EP
= enumerate_ray(P
, exist
, nparam
, MaxRays
);
3092 EP
= enumerate_sure2(P
, exist
, nparam
, MaxRays
);
3096 F
= unfringe(P
, MaxRays
);
3097 if (!PolyhedronIncludes(F
, P
)) {
3099 fprintf(stderr
, "\nER: Fringed\n");
3100 #endif /* DEBUG_ER */
3101 EP
= barvinok_enumerate_e(F
, exist
, nparam
, MaxRays
);
3108 EP
= enumerate_vd(&P
, exist
, nparam
, MaxRays
);
3113 EP
= enumerate_sum(P
, exist
, nparam
, MaxRays
);
3120 Polyhedron
*pos
, *neg
;
3121 for (i
= 0; i
< exist
; ++i
)
3122 if (SplitOnVar(P
, i
, nvar
, len
, exist
, MaxRays
,
3123 row
, f
, false, &pos
, &neg
))
3129 EP
= enumerate_or(pos
, exist
, nparam
, MaxRays
);