?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
ex_convert.cc: extract ex2evalue from range.cc
[barvinok.git] / util.c
blobb1cd2287461c4c2f53fdc674317606ca6794c420
1 #include <stdlib.h>
2 #include <assert.h>
3 #include <barvinok/util.h>
4 #include <barvinok/options.h>
5 #include <polylib/ranking.h>
6 #include "config.h"
7 #include "lattice_point.h"
8
9 #define ALLOC(type) (type*)malloc(sizeof(type))
10 #define ALLOCN(type,n) (type*)malloc((n) * sizeof(type))
11
12 #ifdef __GNUC__
13 #define NALLOC(p,n) p = (typeof(p))malloc((n) * sizeof(*p))
14 #else
15 #define NALLOC(p,n) p = (void *)malloc((n) * sizeof(*p))
16 #endif
17
18 void manual_count(Polyhedron *P, Value* result)
19 {
20 Polyhedron *U = Universe_Polyhedron(0);
21 Enumeration *en = Polyhedron_Enumerate(P,U,1024,NULL);
22 Value *v = compute_poly(en,NULL);
23 value_assign(*result, *v);
24 value_clear(*v);
25 free(v);
26 Enumeration_Free(en);
27 Polyhedron_Free(U);
28 }
29
30 #include <barvinok/evalue.h>
31 #include <barvinok/util.h>
32 #include <barvinok/barvinok.h>
33
34 /* Return random value between 0 and max-1 inclusive
35 */
36 int random_int(int max) {
37 return (int) (((double)(max))*rand()/(RAND_MAX+1.0));
38 }
39
40 Polyhedron *Polyhedron_Read(unsigned MaxRays)
41 {
42 int vertices = 0;
43 unsigned NbRows, NbColumns;
44 Matrix *M;
45 Polyhedron *P;
46 char s[128];
47
48 while (fgets(s, sizeof(s), stdin)) {
49 if (*s == '#')
50 continue;
51 if (strncasecmp(s, "vertices", sizeof("vertices")-1) == 0)
52 vertices = 1;
53 if (sscanf(s, "%u %u", &NbRows, &NbColumns) == 2)
54 break;
55 }
56 if (feof(stdin))
57 return NULL;
58 M = Matrix_Alloc(NbRows,NbColumns);
59 Matrix_Read_Input(M);
60 if (vertices)
61 P = Rays2Polyhedron(M, MaxRays);
62 else
63 P = Constraints2Polyhedron(M, MaxRays);
64 Matrix_Free(M);
65 return P;
66 }
67
68 /* Inplace polarization
69 */
70 void Polyhedron_Polarize(Polyhedron *P)
71 {
72 unsigned NbRows = P->NbConstraints + P->NbRays;
73 int i;
74 Value **q;
75
76 q = (Value **)malloc(NbRows * sizeof(Value *));
77 assert(q);
78 for (i = 0; i < P->NbRays; ++i)
79 q[i] = P->Ray[i];
80 for (; i < NbRows; ++i)
81 q[i] = P->Constraint[i-P->NbRays];
82 P->NbConstraints = NbRows - P->NbConstraints;
83 P->NbRays = NbRows - P->NbRays;
84 free(P->Constraint);
85 P->Constraint = q;
86 P->Ray = q + P->NbConstraints;
87 }
88
89 /*
90 * Rather general polar
91 * We can optimize it significantly if we assume that
92 * P includes zero
93 *
94 * Also, we calculate the polar as defined in Schrijver
95 * The opposite should probably work as well and would
96 * eliminate the need for multiplying by -1
97 */
98 Polyhedron* Polyhedron_Polar(Polyhedron *P, unsigned NbMaxRays)
99 {
100 int i;
101 Value mone;
102 unsigned dim = P->Dimension + 2;
103 Matrix *M = Matrix_Alloc(P->NbRays, dim);
104
105 assert(M);
106 value_init(mone);
107 value_set_si(mone, -1);
108 for (i = 0; i < P->NbRays; ++i) {
109 Vector_Scale(P->Ray[i], M->p[i], mone, dim);
110 value_multiply(M->p[i][0], M->p[i][0], mone);
111 value_multiply(M->p[i][dim-1], M->p[i][dim-1], mone);
112 }
113 P = Constraints2Polyhedron(M, NbMaxRays);
114 assert(P);
115 Matrix_Free(M);
116 value_clear(mone);
117 return P;
118 }
119
120 /*
121 * Returns the supporting cone of P at the vertex with index v
122 */
123 Polyhedron* supporting_cone(Polyhedron *P, int v)
124 {
125 Matrix *M;
126 Value tmp;
127 int i, n, j;
128 unsigned char *supporting = (unsigned char *)malloc(P->NbConstraints);
129 unsigned dim = P->Dimension + 2;
130
131 assert(v >=0 && v < P->NbRays);
132 assert(value_pos_p(P->Ray[v][dim-1]));
133 assert(supporting);
134
135 value_init(tmp);
136 for (i = 0, n = 0; i < P->NbConstraints; ++i) {
137 Inner_Product(P->Constraint[i] + 1, P->Ray[v] + 1, dim - 1, &tmp);
138 if ((supporting[i] = value_zero_p(tmp)))
139 ++n;
140 }
141 assert(n >= dim - 2);
142 value_clear(tmp);
143 M = Matrix_Alloc(n, dim);
144 assert(M);
145 for (i = 0, j = 0; i < P->NbConstraints; ++i)
146 if (supporting[i]) {
147 value_set_si(M->p[j][dim-1], 0);
148 Vector_Copy(P->Constraint[i], M->p[j++], dim-1);
149 }
150 free(supporting);
151 P = Constraints2Polyhedron(M, P->NbRays+1);
152 assert(P);
153 Matrix_Free(M);
154 return P;
155 }
156
157 #define INT_BITS (sizeof(unsigned) * 8)
158
159 unsigned *supporting_constraints(Matrix *Constraints, Param_Vertices *v, int *n)
160 {
161 Value lcm, tmp, tmp2;
162 unsigned dim = Constraints->NbColumns;
163 unsigned nparam = v->Vertex->NbColumns - 2;
164 unsigned nvar = dim - nparam - 2;
165 int len = (Constraints->NbRows+INT_BITS-1)/INT_BITS;
166 unsigned *supporting = (unsigned *)calloc(len, sizeof(unsigned));
167 int i, j;
168 Vector *row;
169 int ix;
170 unsigned bx;
171
172 assert(supporting);
173 row = Vector_Alloc(nparam+1);
174 assert(row);
175 value_init(lcm);
176 value_init(tmp);
177 value_init(tmp2);
178 value_set_si(lcm, 1);
179 for (i = 0, *n = 0, ix = 0, bx = MSB; i < Constraints->NbRows; ++i) {
180 Vector_Set(row->p, 0, nparam+1);
181 for (j = 0 ; j < nvar; ++j) {
182 value_set_si(tmp, 1);
183 value_assign(tmp2, Constraints->p[i][j+1]);
184 if (value_ne(lcm, v->Vertex->p[j][nparam+1])) {
185 value_assign(tmp, lcm);
186 value_lcm(lcm, lcm, v->Vertex->p[j][nparam+1]);
187 value_division(tmp, lcm, tmp);
188 value_multiply(tmp2, tmp2, lcm);
189 value_division(tmp2, tmp2, v->Vertex->p[j][nparam+1]);
190 }
191 Vector_Combine(row->p, v->Vertex->p[j], row->p,
192 tmp, tmp2, nparam+1);
193 }
194 value_set_si(tmp, 1);
195 Vector_Combine(row->p, Constraints->p[i]+1+nvar, row->p, tmp, lcm, nparam+1);
196 for (j = 0; j < nparam+1; ++j)
197 if (value_notzero_p(row->p[j]))
198 break;
199 if (j == nparam + 1) {
200 supporting[ix] |= bx;
201 ++*n;
202 }
203 NEXT(ix, bx);
204 }
205 assert(*n >= nvar);
206 value_clear(tmp);
207 value_clear(tmp2);
208 value_clear(lcm);
209 Vector_Free(row);
210
211 return supporting;
212 }
213
214 Polyhedron* supporting_cone_p(Polyhedron *P, Param_Vertices *v)
215 {
216 Matrix *M;
217 unsigned dim = P->Dimension + 2;
218 unsigned nparam = v->Vertex->NbColumns - 2;
219 unsigned nvar = dim - nparam - 2;
220 int i, n, j;
221 int ix;
222 unsigned bx;
223 unsigned *supporting;
224 Matrix View;
225
226 Polyhedron_Matrix_View(P, &View, P->NbConstraints);
227 supporting = supporting_constraints(&View, v, &n);
228 M = Matrix_Alloc(n, nvar+2);
229 assert(M);
230 for (i = 0, j = 0, ix = 0, bx = MSB; i < P->NbConstraints; ++i) {
231 if (supporting[ix] & bx) {
232 value_set_si(M->p[j][nvar+1], 0);
233 Vector_Copy(P->Constraint[i], M->p[j++], nvar+1);
234 }
235 NEXT(ix, bx);
236 }
237 free(supporting);
238 P = Constraints2Polyhedron(M, P->NbRays+1);
239 assert(P);
240 Matrix_Free(M);
241 return P;
242 }
243
244 Polyhedron* triangulate_cone(Polyhedron *P, unsigned NbMaxCons)
245 {
246 struct barvinok_options *options = barvinok_options_new_with_defaults();
247 options->MaxRays = NbMaxCons;
248 P = triangulate_cone_with_options(P, options);
249 barvinok_options_free(options);
250 return P;
251 }
252
253 Polyhedron* triangulate_cone_with_options(Polyhedron *P,
254 struct barvinok_options *options)
255 {
256 const static int MAX_TRY=10;
257 int i, j, r, n, t;
258 Value tmp;
259 unsigned dim = P->Dimension;
260 Matrix *M = Matrix_Alloc(P->NbRays+1, dim+3);
261 Matrix *M2, *M3;
262 Polyhedron *L, *R, *T;
263 assert(P->NbEq == 0);
264
265 L = NULL;
266 R = NULL;
267 value_init(tmp);
268
269 Vector_Set(M->p[0]+1, 0, dim+1);
270 value_set_si(M->p[0][0], 1);
271 value_set_si(M->p[0][dim+2], 1);
272 Vector_Set(M->p[P->NbRays]+1, 0, dim+2);
273 value_set_si(M->p[P->NbRays][0], 1);
274 value_set_si(M->p[P->NbRays][dim+1], 1);
275
276 for (i = 0, r = 1; i < P->NbRays; ++i) {
277 if (value_notzero_p(P->Ray[i][dim+1]))
278 continue;
279 Vector_Copy(P->Ray[i], M->p[r], dim+1);
280 value_set_si(M->p[r][dim+2], 0);
281 ++r;
282 }
283
284 M2 = Matrix_Alloc(dim+1, dim+2);
285
286 t = 0;
287 if (options->try_Delaunay_triangulation) {
288 /* Delaunay triangulation */
289 for (r = 1; r < P->NbRays; ++r) {
290 Inner_Product(M->p[r]+1, M->p[r]+1, dim, &tmp);
291 value_assign(M->p[r][dim+1], tmp);
292 }
293 M3 = Matrix_Copy(M);
294 L = Rays2Polyhedron(M3, options->MaxRays);
295 Matrix_Free(M3);
296 ++t;
297 } else {
298 try_again:
299 /* Usually R should still be 0 */
300 Domain_Free(R);
301 Polyhedron_Free(L);
302 for (r = 1; r < P->NbRays; ++r) {
303 value_set_si(M->p[r][dim+1], random_int((t+1)*dim*P->NbRays)+1);
304 }
305 M3 = Matrix_Copy(M);
306 L = Rays2Polyhedron(M3, options->MaxRays);
307 Matrix_Free(M3);
308 ++t;
309 }
310 assert(t <= MAX_TRY);
311
312 R = NULL;
313 n = 0;
314
315 POL_ENSURE_FACETS(L);
316 for (i = 0; i < L->NbConstraints; ++i) {
317 /* Ignore perpendicular facets, i.e., facets with 0 z-coordinate */
318 if (value_negz_p(L->Constraint[i][dim+1]))
319 continue;
320 if (value_notzero_p(L->Constraint[i][dim+2]))
321 continue;
322 for (j = 1, r = 1; j < M->NbRows; ++j) {
323 Inner_Product(M->p[j]+1, L->Constraint[i]+1, dim+1, &tmp);
324 if (value_notzero_p(tmp))
325 continue;
326 if (r > dim)
327 goto try_again;
328 Vector_Copy(M->p[j]+1, M2->p[r]+1, dim);
329 value_set_si(M2->p[r][0], 1);
330 value_set_si(M2->p[r][dim+1], 0);
331 ++r;
332 }
333 assert(r == dim+1);
334 Vector_Set(M2->p[0]+1, 0, dim);
335 value_set_si(M2->p[0][0], 1);
336 value_set_si(M2->p[0][dim+1], 1);
337 T = Rays2Polyhedron(M2, P->NbConstraints+1);
338 T->next = R;
339 R = T;
340 ++n;
341 }
342 Matrix_Free(M2);
343
344 Polyhedron_Free(L);
345 value_clear(tmp);
346 Matrix_Free(M);
347
348 return R;
349 }
350
351 void check_triangulization(Polyhedron *P, Polyhedron *T)
352 {
353 Polyhedron *C, *D, *E, *F, *G, *U;
354 for (C = T; C; C = C->next) {
355 if (C == T)
356 U = C;
357 else
358 U = DomainConvex(DomainUnion(U, C, 100), 100);
359 for (D = C->next; D; D = D->next) {
360 F = C->next;
361 G = D->next;
362 C->next = NULL;
363 D->next = NULL;
364 E = DomainIntersection(C, D, 600);
365 assert(E->NbRays == 0 || E->NbEq >= 1);
366 Polyhedron_Free(E);
367 C->next = F;
368 D->next = G;
369 }
370 }
371 assert(PolyhedronIncludes(U, P));
372 assert(PolyhedronIncludes(P, U));
373 }
374
375 /* Computes x, y and g such that g = gcd(a,b) and a*x+b*y = g */
376 void Extended_Euclid(Value a, Value b, Value *x, Value *y, Value *g)
377 {
378 Value c, d, e, f, tmp;
379
380 value_init(c);
381 value_init(d);
382 value_init(e);
383 value_init(f);
384 value_init(tmp);
385 value_absolute(c, a);
386 value_absolute(d, b);
387 value_set_si(e, 1);
388 value_set_si(f, 0);
389 while(value_pos_p(d)) {
390 value_division(tmp, c, d);
391 value_multiply(tmp, tmp, f);
392 value_subtract(e, e, tmp);
393 value_division(tmp, c, d);
394 value_multiply(tmp, tmp, d);
395 value_subtract(c, c, tmp);
396 value_swap(c, d);
397 value_swap(e, f);
398 }
399 value_assign(*g, c);
400 if (value_zero_p(a))
401 value_set_si(*x, 0);
402 else if (value_pos_p(a))
403 value_assign(*x, e);
404 else value_oppose(*x, e);
405 if (value_zero_p(b))
406 value_set_si(*y, 0);
407 else {
408 value_multiply(tmp, a, *x);
409 value_subtract(tmp, c, tmp);
410 value_division(*y, tmp, b);
411 }
412 value_clear(c);
413 value_clear(d);
414 value_clear(e);
415 value_clear(f);
416 value_clear(tmp);
417 }
418
419 static int unimodular_complete_1(Matrix *m)
420 {
421 Value g, b, c, old, tmp;
422 unsigned i, j;
423 int ok;
424
425 value_init(b);
426 value_init(c);
427 value_init(g);
428 value_init(old);
429 value_init(tmp);
430 value_assign(g, m->p[0][0]);
431 for (i = 1; value_zero_p(g) && i < m->NbColumns; ++i) {
432 for (j = 0; j < m->NbColumns; ++j) {
433 if (j == i-1)
434 value_set_si(m->p[i][j], 1);
435 else
436 value_set_si(m->p[i][j], 0);
437 }
438 value_assign(g, m->p[0][i]);
439 }
440 for (; i < m->NbColumns; ++i) {
441 value_assign(old, g);
442 Extended_Euclid(old, m->p[0][i], &c, &b, &g);
443 value_oppose(b, b);
444 for (j = 0; j < m->NbColumns; ++j) {
445 if (j < i) {
446 value_multiply(tmp, m->p[0][j], b);
447 value_division(m->p[i][j], tmp, old);
448 } else if (j == i)
449 value_assign(m->p[i][j], c);
450 else
451 value_set_si(m->p[i][j], 0);
452 }
453 }
454 ok = value_one_p(g);
455 value_clear(b);
456 value_clear(c);
457 value_clear(g);
458 value_clear(old);
459 value_clear(tmp);
460 return ok;
461 }
462
463 int unimodular_complete(Matrix *M, int row)
464 {
465 int r;
466 int ok = 1;
467 Matrix *H, *Q, *U;
468
469 if (row == 1)
470 return unimodular_complete_1(M);
471
472 left_hermite(M, &H, &Q, &U);
473 Matrix_Free(U);
474 for (r = 0; ok && r < row; ++r)
475 if (value_notone_p(H->p[r][r]))
476 ok = 0;
477 Matrix_Free(H);
478 for (r = row; r < M->NbRows; ++r)
479 Vector_Copy(Q->p[r], M->p[r], M->NbColumns);
480 Matrix_Free(Q);
481 return ok;
482 }
483
484 /*
485 * left_hermite may leave positive entries below the main diagonal in H.
486 * This function postprocesses the output of left_hermite to make
487 * the non-zero entries below the main diagonal negative.
488 */
489 void neg_left_hermite(Matrix *A, Matrix **H_p, Matrix **Q_p, Matrix **U_p)
490 {
491 int row, col, i, j;
492 Matrix *H, *U, *Q;
493
494 left_hermite(A, &H, &Q, &U);
495 *H_p = H;
496 *Q_p = Q;
497 *U_p = U;
498
499 for (row = 0, col = 0; col < H->NbColumns; ++col, ++row) {
500 while (value_zero_p(H->p[row][col]))
501 ++row;
502 for (i = 0; i < col; ++i) {
503 if (value_negz_p(H->p[row][i]))
504 continue;
505
506 /* subtract column col from column i in H and U */
507 for (j = 0; j < H->NbRows; ++j)
508 value_subtract(H->p[j][i], H->p[j][i], H->p[j][col]);
509 for (j = 0; j < U->NbRows; ++j)
510 value_subtract(U->p[j][i], U->p[j][i], U->p[j][col]);
511
512 /* add row i to row col in Q */
513 for (j = 0; j < Q->NbColumns; ++j)
514 value_addto(Q->p[col][j], Q->p[col][j], Q->p[i][j]);
515 }
516 }
517 }
518
519 /*
520 * Returns a full-dimensional polyhedron with the same number
521 * of integer points as P
522 */
523 Polyhedron *remove_equalities(Polyhedron *P, unsigned MaxRays)
524 {
525 Polyhedron *Q = Polyhedron_Copy(P);
526 unsigned dim = P->Dimension;
527 Matrix *m1, *m2;
528 int i;
529
530 if (Q->NbEq == 0)
531 return Q;
532
533 Q = DomainConstraintSimplify(Q, MaxRays);
534 if (emptyQ2(Q))
535 return Q;
536
537 m1 = Matrix_Alloc(dim, dim);
538 for (i = 0; i < Q->NbEq; ++i)
539 Vector_Copy(Q->Constraint[i]+1, m1->p[i], dim);
540
541 /* m1 may not be unimodular, but we won't be throwing anything away */
542 unimodular_complete(m1, Q->NbEq);
543
544 m2 = Matrix_Alloc(dim+1-Q->NbEq, dim+1);
545 for (i = Q->NbEq; i < dim; ++i)
546 Vector_Copy(m1->p[i], m2->p[i-Q->NbEq], dim);
547 value_set_si(m2->p[dim-Q->NbEq][dim], 1);
548 Matrix_Free(m1);
549
550 P = Polyhedron_Image(Q, m2, MaxRays);
551 Matrix_Free(m2);
552 Polyhedron_Free(Q);
553
554 return P;
555 }
556
557 /*
558 * Returns a full-dimensional polyhedron with the same number
559 * of integer points as P
560 * nvar specifies the number of variables
561 * The remaining dimensions are assumed to be parameters
562 * Destroys P
563 * factor is NbEq x (nparam+2) matrix, containing stride constraints
564 * on the parameters; column nparam is the constant;
565 * column nparam+1 is the stride
566 *
567 * if factor is NULL, only remove equalities that don't affect
568 * the number of points
569 */
570 Polyhedron *remove_equalities_p(Polyhedron *P, unsigned nvar, Matrix **factor,
571 unsigned MaxRays)
572 {
573 Value g;
574 Polyhedron *Q;
575 unsigned dim = P->Dimension;
576 Matrix *m1, *m2, *f;
577 int i, j;
578
579 if (P->NbEq == 0)
580 return P;
581
582 m1 = Matrix_Alloc(nvar, nvar);
583 P = DomainConstraintSimplify(P, MaxRays);
584 if (factor) {
585 f = Matrix_Alloc(P->NbEq, dim-nvar+2);
586 *factor = f;
587 }
588 value_init(g);
589 for (i = 0, j = 0; i < P->NbEq; ++i) {
590 if (First_Non_Zero(P->Constraint[i]+1, nvar) == -1)
591 continue;
592
593 Vector_Gcd(P->Constraint[i]+1, nvar, &g);
594 if (!factor && value_notone_p(g))
595 continue;
596
597 if (factor) {
598 Vector_Copy(P->Constraint[i]+1+nvar, f->p[j], dim-nvar+1);
599 value_assign(f->p[j][dim-nvar+1], g);
600 }
601
602 Vector_Copy(P->Constraint[i]+1, m1->p[j], nvar);
603
604 ++j;
605 }
606 value_clear(g);
607
608 unimodular_complete(m1, j);
609
610 m2 = Matrix_Alloc(dim+1-j, dim+1);
611 for (i = 0; i < nvar-j ; ++i)
612 Vector_Copy(m1->p[i+j], m2->p[i], nvar);
613 Matrix_Free(m1);
614 for (i = nvar-j; i <= dim-j; ++i)
615 value_set_si(m2->p[i][i+j], 1);
616
617 Q = Polyhedron_Image(P, m2, MaxRays);
618 Matrix_Free(m2);
619 Polyhedron_Free(P);
620
621 return Q;
622 }
623
624 void Line_Length(Polyhedron *P, Value *len)
625 {
626 Value tmp, pos, neg;
627 int p = 0, n = 0;
628 int i;
629
630 assert(P->Dimension == 1);
631
632 value_init(tmp);
633 value_init(pos);
634 value_init(neg);
635
636 for (i = 0; i < P->NbConstraints; ++i) {
637 value_oppose(tmp, P->Constraint[i][2]);
638 if (value_pos_p(P->Constraint[i][1])) {
639 mpz_cdiv_q(tmp, tmp, P->Constraint[i][1]);
640 if (!p || value_gt(tmp, pos))
641 value_assign(pos, tmp);
642 p = 1;
643 } else if (value_neg_p(P->Constraint[i][1])) {
644 mpz_fdiv_q(tmp, tmp, P->Constraint[i][1]);
645 if (!n || value_lt(tmp, neg))
646 value_assign(neg, tmp);
647 n = 1;
648 }
649 if (n && p) {
650 value_subtract(tmp, neg, pos);
651 value_increment(*len, tmp);
652 } else
653 value_set_si(*len, -1);
654 }
655
656 value_clear(tmp);
657 value_clear(pos);
658 value_clear(neg);
659 }
660
661 /*
662 * Factors the polyhedron P into polyhedra Q_i such that
663 * the number of integer points in P is equal to the product
664 * of the number of integer points in the individual Q_i
665 *
666 * If no factors can be found, NULL is returned.
667 * Otherwise, a linked list of the factors is returned.
668 *
669 * If there are factors and if T is not NULL, then a matrix will be
670 * returned through T expressing the old variables in terms of the
671 * new variables as they appear in the sequence of factors.
672 *
673 * The algorithm works by first computing the Hermite normal form
674 * and then grouping columns linked by one or more constraints together,
675 * where a constraints "links" two or more columns if the constraint
676 * has nonzero coefficients in the columns.
677 */
678 Polyhedron* Polyhedron_Factor(Polyhedron *P, unsigned nparam, Matrix **T,
679 unsigned NbMaxRays)
680 {
681 int i, j, k;
682 Matrix *M, *H, *Q, *U;
683 int *pos; /* for each column: row position of pivot */
684 int *group; /* group to which a column belongs */
685 int *cnt; /* number of columns in the group */
686 int *rowgroup; /* group to which a constraint belongs */
687 int nvar = P->Dimension - nparam;
688 Polyhedron *F = NULL;
689
690 if (nvar <= 1)
691 return NULL;
692
693 NALLOC(pos, nvar);
694 NALLOC(group, nvar);
695 NALLOC(cnt, nvar);
696 NALLOC(rowgroup, P->NbConstraints);
697
698 M = Matrix_Alloc(P->NbConstraints, nvar);
699 for (i = 0; i < P->NbConstraints; ++i)
700 Vector_Copy(P->Constraint[i]+1, M->p[i], nvar);
701 left_hermite(M, &H, &Q, &U);
702 Matrix_Free(M);
703 Matrix_Free(Q);
704
705 for (i = 0; i < P->NbConstraints; ++i)
706 rowgroup[i] = -1;
707 for (i = 0, j = 0; i < H->NbColumns; ++i) {
708 for ( ; j < H->NbRows; ++j)
709 if (value_notzero_p(H->p[j][i]))
710 break;
711 assert (j < H->NbRows);
712 pos[i] = j;
713 }
714 for (i = 0; i < nvar; ++i) {
715 group[i] = i;
716 cnt[i] = 1;
717 }
718 for (i = 0; i < H->NbColumns && cnt[0] < nvar; ++i) {
719 if (rowgroup[pos[i]] == -1)
720 rowgroup[pos[i]] = i;
721 for (j = pos[i]+1; j < H->NbRows; ++j) {
722 if (value_zero_p(H->p[j][i]))
723 continue;
724 if (rowgroup[j] != -1)
725 continue;
726 rowgroup[j] = group[i];
727 for (k = i+1; k < H->NbColumns && j >= pos[k]; ++k) {
728 int g = group[k];
729 while (cnt[g] == 0)
730 g = group[g];
731 group[k] = g;
732 if (group[k] != group[i] && value_notzero_p(H->p[j][k])) {
733 assert(cnt[group[k]] != 0);
734 assert(cnt[group[i]] != 0);
735 if (group[i] < group[k]) {
736 cnt[group[i]] += cnt[group[k]];
737 cnt[group[k]] = 0;
738 group[k] = group[i];
739 } else {
740 cnt[group[k]] += cnt[group[i]];
741 cnt[group[i]] = 0;
742 group[i] = group[k];
743 }
744 }
745 }
746 }
747 }
748
749 if (cnt[0] != nvar) {
750 /* Extract out pure context constraints separately */
751 Polyhedron **next = &F;
752 int tot_d = 0;
753 if (T)
754 *T = Matrix_Alloc(nvar, nvar);
755 for (i = nparam ? -1 : 0; i < nvar; ++i) {
756 int d;
757
758 if (i == -1) {
759 for (j = 0, k = 0; j < P->NbConstraints; ++j)
760 if (rowgroup[j] == -1) {
761 if (First_Non_Zero(P->Constraint[j]+1+nvar,
762 nparam) == -1)
763 rowgroup[j] = -2;
764 else
765 ++k;
766 }
767 if (k == 0)
768 continue;
769 d = 0;
770 } else {
771 if (cnt[i] == 0)
772 continue;
773 d = cnt[i];
774 for (j = 0, k = 0; j < P->NbConstraints; ++j)
775 if (rowgroup[j] >= 0 && group[rowgroup[j]] == i) {
776 rowgroup[j] = i;
777 ++k;
778 }
779 }
780
781 if (T)
782 for (j = 0; j < nvar; ++j) {
783 int l, m;
784 for (l = 0, m = 0; m < d; ++l) {
785 if (group[l] != i)
786 continue;
787 value_assign((*T)->p[j][tot_d+m++], U->p[j][l]);
788 }
789 }
790
791 M = Matrix_Alloc(k, d+nparam+2);
792 for (j = 0, k = 0; j < P->NbConstraints; ++j) {
793 int l, m;
794 if (rowgroup[j] != i)
795 continue;
796 value_assign(M->p[k][0], P->Constraint[j][0]);
797 for (l = 0, m = 0; m < d; ++l) {
798 if (group[l] != i)
799 continue;
800 value_assign(M->p[k][1+m++], H->p[j][l]);
801 }
802 Vector_Copy(P->Constraint[j]+1+nvar, M->p[k]+1+m, nparam+1);
803 ++k;
804 }
805 *next = Constraints2Polyhedron(M, NbMaxRays);
806 next = &(*next)->next;
807 Matrix_Free(M);
808 tot_d += d;
809 }
810 }
811 Matrix_Free(U);
812 Matrix_Free(H);
813 free(pos);
814 free(group);
815 free(cnt);
816 free(rowgroup);
817 return F;
818 }
819
820 /* Computes the intersection of the contexts of a list of factors */
821 Polyhedron *Factor_Context(Polyhedron *F, unsigned nparam, unsigned MaxRays)
822 {
823 Polyhedron *Q;
824 Polyhedron *C = NULL;
825
826 for (Q = F; Q; Q = Q->next) {
827 Polyhedron *QC = Q;
828 Polyhedron *next = Q->next;
829 Q->next = NULL;
830
831 if (Q->Dimension != nparam)
832 QC = Polyhedron_Project(Q, nparam);
833
834 if (!C)
835 C = Q == QC ? Polyhedron_Copy(QC) : QC;
836 else {
837 Polyhedron *C2 = C;
838 C = DomainIntersection(C, QC, MaxRays);
839 Polyhedron_Free(C2);
840 if (QC != Q)
841 Polyhedron_Free(QC);
842 }
843 Q->next = next;
844 }
845 return C;
846 }
847
848 /*
849 * Project on final dim dimensions
850 */
851 Polyhedron* Polyhedron_Project(Polyhedron *P, int dim)
852 {
853 int i;
854 int remove = P->Dimension - dim;
855 Matrix *T;
856 Polyhedron *I;
857
858 if (P->Dimension == dim)
859 return Polyhedron_Copy(P);
860
861 T = Matrix_Alloc(dim+1, P->Dimension+1);
862 for (i = 0; i < dim+1; ++i)
863 value_set_si(T->p[i][i+remove], 1);
864 I = Polyhedron_Image(P, T, P->NbConstraints);
865 Matrix_Free(T);
866 return I;
867 }
868
869 /* Constructs a new constraint that ensures that
870 * the first constraint is (strictly) smaller than
871 * the second.
872 */
873 static void smaller_constraint(Value *a, Value *b, Value *c, int pos, int shift,
874 int len, int strict, Value *tmp)
875 {
876 value_oppose(*tmp, b[pos+1]);
877 value_set_si(c[0], 1);
878 Vector_Combine(a+1+shift, b+1+shift, c+1, *tmp, a[pos+1], len-shift-1);
879 if (strict)
880 value_decrement(c[len-shift-1], c[len-shift-1]);
881 ConstraintSimplify(c, c, len-shift, tmp);
882 }
883
884
885 /* For each pair of lower and upper bounds on the first variable,
886 * calls fn with the set of constraints on the remaining variables
887 * where these bounds are active, i.e., (stricly) larger/smaller than
888 * the other lower/upper bounds, the lower and upper bound and the
889 * call back data.
890 *
891 * If the first variable is equal to an affine combination of the
892 * other variables then fn is called with both lower and upper
893 * pointing to the corresponding equality.
894 *
895 * If there is no lower (or upper) bound, then NULL is passed
896 * as the corresponding bound.
897 */
898 void for_each_lower_upper_bound(Polyhedron *P,
899 for_each_lower_upper_bound_init init,
900 for_each_lower_upper_bound_fn fn,
901 void *cb_data)
902 {
903 unsigned dim = P->Dimension;
904 Matrix *M;
905 int *pos;
906 int i, j, p, n, z;
907 int k, l, k2, l2, q;
908 Value g;
909
910 if (value_zero_p(P->Constraint[0][0]) &&
911 value_notzero_p(P->Constraint[0][1])) {
912 M = Matrix_Alloc(P->NbConstraints-1, dim-1+2);
913 for (i = 1; i < P->NbConstraints; ++i) {
914 value_assign(M->p[i-1][0], P->Constraint[i][0]);
915 Vector_Copy(P->Constraint[i]+2, M->p[i-1]+1, dim);
916 }
917 if (init)
918 init(1, cb_data);
919 fn(M, P->Constraint[0], P->Constraint[0], cb_data);
920 Matrix_Free(M);
921 return;
922 }
923
924 value_init(g);
925 pos = ALLOCN(int, P->NbConstraints);
926
927 for (i = 0, z = 0; i < P->NbConstraints; ++i)
928 if (value_zero_p(P->Constraint[i][1]))
929 pos[P->NbConstraints-1 - z++] = i;
930 /* put those with positive coefficients first; number: p */
931 for (i = 0, p = 0, n = P->NbConstraints-z-1; i < P->NbConstraints; ++i)
932 if (value_pos_p(P->Constraint[i][1]))
933 pos[p++] = i;
934 else if (value_neg_p(P->Constraint[i][1]))
935 pos[n--] = i;
936 n = P->NbConstraints-z-p;
937
938 if (init)
939 init(p*n, cb_data);
940
941 M = Matrix_Alloc((p ? p-1 : 0) + (n ? n-1 : 0) + z + 1, dim-1+2);
942 for (i = 0; i < z; ++i) {
943 value_assign(M->p[i][0], P->Constraint[pos[P->NbConstraints-1 - i]][0]);
944 Vector_Copy(P->Constraint[pos[P->NbConstraints-1 - i]]+2,
945 M->p[i]+1, dim);
946 }
947 for (k = p ? 0 : -1; k < p; ++k) {
948 for (k2 = 0; k2 < p; ++k2) {
949 if (k2 == k)
950 continue;
951 q = 1 + z + k2 - (k2 > k);
952 smaller_constraint(
953 P->Constraint[pos[k]],
954 P->Constraint[pos[k2]],
955 M->p[q], 0, 1, dim+2, k2 > k, &g);
956 }
957 for (l = n ? p : p-1; l < p+n; ++l) {
958 Value *lower;
959 Value *upper;
960 for (l2 = p; l2 < p+n; ++l2) {
961 if (l2 == l)
962 continue;
963 q = 1 + z + l2-1 - (l2 > l);
964 smaller_constraint(
965 P->Constraint[pos[l2]],
966 P->Constraint[pos[l]],
967 M->p[q], 0, 1, dim+2, l2 > l, &g);
968 }
969 if (p && n)
970 smaller_constraint(P->Constraint[pos[k]],
971 P->Constraint[pos[l]],
972 M->p[z], 0, 1, dim+2, 0, &g);
973 lower = p ? P->Constraint[pos[k]] : NULL;
974 upper = n ? P->Constraint[pos[l]] : NULL;
975 fn(M, lower, upper, cb_data);
976 }
977 }
978 Matrix_Free(M);
979
980 free(pos);
981 value_clear(g);
982 }
983
984 struct section { Polyhedron * D; evalue E; };
985
986 struct PLL_data {
987 int nd;
988 unsigned MaxRays;
989 Polyhedron *C;
990 evalue mone;
991 struct section *s;
992 };
993
994 static void PLL_init(unsigned n, void *cb_data)
995 {
996 struct PLL_data *data = (struct PLL_data *)cb_data;
997
998 data->s = ALLOCN(struct section, n);
999 }
1000
1001 /* Computes ceil(-coef/abs(d)) */
1002 static evalue* bv_ceil3(Value *coef, int len, Value d, Polyhedron *P)
1003 {
1004 Value t;
1005 evalue *EP, *f;
1006 Vector *val = Vector_Alloc(len);
1007
1008 value_init(t);
1009 Vector_Oppose(coef, val->p, len);
1010 value_absolute(t, d);
1011
1012 EP = ceiling(val->p, t, len-1, P);
1013
1014 value_clear(t);
1015 Vector_Free(val);
1016
1017 return EP;
1018 }
1019
1020 static void PLL_cb(Matrix *M, Value *lower, Value *upper, void *cb_data)
1021 {
1022 struct PLL_data *data = (struct PLL_data *)cb_data;
1023 unsigned dim = M->NbColumns-1;
1024 Matrix *M2;
1025 Polyhedron *T;
1026 evalue *L, *U;
1027
1028 assert(lower);
1029 assert(upper);
1030
1031 M2 = Matrix_Copy(M);
1032 T = Constraints2Polyhedron(M2, data->MaxRays);
1033 Matrix_Free(M2);
1034 data->s[data->nd].D = DomainIntersection(T, data->C, data->MaxRays);
1035 Domain_Free(T);
1036
1037 POL_ENSURE_VERTICES(data->s[data->nd].D);
1038 if (emptyQ(data->s[data->nd].D)) {
1039 Polyhedron_Free(data->s[data->nd].D);
1040 return;
1041 }
1042 L = bv_ceil3(lower+1+1, dim-1+1, lower[0+1], data->s[data->nd].D);
1043 U = bv_ceil3(upper+1+1, dim-1+1, upper[0+1], data->s[data->nd].D);
1044 eadd(L, U);
1045 eadd(&data->mone, U);
1046 emul(&data->mone, U);
1047 data->s[data->nd].E = *U;
1048 evalue_free(L);
1049 free(U);
1050 ++data->nd;
1051 }
1052
1053 static evalue *ParamLine_Length_mod(Polyhedron *P, Polyhedron *C, unsigned MaxRays)
1054 {
1055 unsigned dim = P->Dimension;
1056 unsigned nvar = dim - C->Dimension;
1057 struct PLL_data data;
1058 evalue *F;
1059 int k;
1060
1061 assert(nvar == 1);
1062
1063 value_init(data.mone.d);
1064 evalue_set_si(&data.mone, -1, 1);
1065
1066 data.nd = 0;
1067 data.MaxRays = MaxRays;
1068 data.C = C;
1069 for_each_lower_upper_bound(P, PLL_init, PLL_cb, &data);
1070
1071 F = ALLOC(evalue);
1072 value_init(F->d);
1073 value_set_si(F->d, 0);
1074 F->x.p = new_enode(partition, 2*data.nd, dim-nvar);
1075 for (k = 0; k < data.nd; ++k) {
1076 EVALUE_SET_DOMAIN(F->x.p->arr[2*k], data.s[k].D);
1077 value_clear(F->x.p->arr[2*k+1].d);
1078 F->x.p->arr[2*k+1] = data.s[k].E;
1079 }
1080 free(data.s);
1081
1082 free_evalue_refs(&data.mone);
1083
1084 return F;
1085 }
1086
1087 evalue* ParamLine_Length(Polyhedron *P, Polyhedron *C,
1088 struct barvinok_options *options)
1089 {
1090 evalue* tmp;
1091 tmp = ParamLine_Length_mod(P, C, options->MaxRays);
1092 if (options->lookup_table) {
1093 evalue_mod2table(tmp, C->Dimension);
1094 reduce_evalue(tmp);
1095 }
1096 return tmp;
1097 }
1098
1099 Bool isIdentity(Matrix *M)
1100 {
1101 unsigned i, j;
1102 if (M->NbRows != M->NbColumns)
1103 return False;
1104
1105 for (i = 0;i < M->NbRows; i ++)
1106 for (j = 0; j < M->NbColumns; j ++)
1107 if (i == j) {
1108 if(value_notone_p(M->p[i][j]))
1109 return False;
1110 } else {
1111 if(value_notzero_p(M->p[i][j]))
1112 return False;
1113 }
1114 return True;
1115 }
1116
1117 void Param_Polyhedron_Print(FILE* DST, Param_Polyhedron *PP, char **param_names)
1118 {
1119 Param_Domain *P;
1120 Param_Vertices *V;
1121
1122 for(P=PP->D;P;P=P->next) {
1123
1124 /* prints current val. dom. */
1125 fprintf(DST, "---------------------------------------\n");
1126 fprintf(DST, "Domain :\n");
1127 Print_Domain(DST, P->Domain, param_names);
1128
1129 /* scan the vertices */
1130 fprintf(DST, "Vertices :\n");
1131 FORALL_PVertex_in_ParamPolyhedron(V,P,PP) {
1132
1133 /* prints each vertex */
1134 Print_Vertex(DST, V->Vertex, param_names);
1135 fprintf(DST, "\n");
1136 }
1137 END_FORALL_PVertex_in_ParamPolyhedron;
1138 }
1139 }
1140
1141 void Enumeration_Print(FILE *Dst, Enumeration *en, const char * const *params)
1142 {
1143 for (; en; en = en->next) {
1144 Print_Domain(Dst, en->ValidityDomain, params);
1145 print_evalue(Dst, &en->EP, params);
1146 }
1147 }
1148
1149 void Enumeration_Free(Enumeration *en)
1150 {
1151 Enumeration *ee;
1152
1153 while( en )
1154 {
1155 free_evalue_refs( &(en->EP) );
1156 Domain_Free( en->ValidityDomain );
1157 ee = en ->next;
1158 free( en );
1159 en = ee;
1160 }
1161 }
1162
1163 void Enumeration_mod2table(Enumeration *en, unsigned nparam)
1164 {
1165 for (; en; en = en->next) {
1166 evalue_mod2table(&en->EP, nparam);
1167 reduce_evalue(&en->EP);
1168 }
1169 }
1170
1171 size_t Enumeration_size(Enumeration *en)
1172 {
1173 size_t s = 0;
1174
1175 for (; en; en = en->next) {
1176 s += domain_size(en->ValidityDomain);
1177 s += evalue_size(&en->EP);
1178 }
1179 return s;
1180 }
1181
1182 void Free_ParamNames(char **params, int m)
1183 {
1184 while (--m >= 0)
1185 free(params[m]);
1186 free(params);
1187 }
1188
1189 /* Check whether every set in D2 is included in some set of D1 */
1190 int DomainIncludes(Polyhedron *D1, Polyhedron *D2)
1191 {
1192 for ( ; D2; D2 = D2->next) {
1193 Polyhedron *P1;
1194 for (P1 = D1; P1; P1 = P1->next)
1195 if (PolyhedronIncludes(P1, D2))
1196 break;
1197 if (!P1)
1198 return 0;
1199 }
1200 return 1;
1201 }
1202
1203 int line_minmax(Polyhedron *I, Value *min, Value *max)
1204 {
1205 int i;
1206
1207 if (I->NbEq >= 1) {
1208 value_oppose(I->Constraint[0][2], I->Constraint[0][2]);
1209 /* There should never be a remainder here */
1210 if (value_pos_p(I->Constraint[0][1]))
1211 mpz_fdiv_q(*min, I->Constraint[0][2], I->Constraint[0][1]);
1212 else
1213 mpz_fdiv_q(*min, I->Constraint[0][2], I->Constraint[0][1]);
1214 value_assign(*max, *min);
1215 } else for (i = 0; i < I->NbConstraints; ++i) {
1216 if (value_zero_p(I->Constraint[i][1])) {
1217 Polyhedron_Free(I);
1218 return 0;
1219 }
1220
1221 value_oppose(I->Constraint[i][2], I->Constraint[i][2]);
1222 if (value_pos_p(I->Constraint[i][1]))
1223 mpz_cdiv_q(*min, I->Constraint[i][2], I->Constraint[i][1]);
1224 else
1225 mpz_fdiv_q(*max, I->Constraint[i][2], I->Constraint[i][1]);
1226 }
1227 Polyhedron_Free(I);
1228 return 1;
1229 }
1230
1231 /**
1232
1233 PROCEDURES TO COMPUTE ENUMERATION. recursive procedure, recurse for
1234 each imbriquation
1235
1236 @param pos index position of current loop index (1..hdim-1)
1237 @param P loop domain
1238 @param context context values for fixed indices
1239 @param exist number of existential variables
1240 @return the number of integer points in this
1241 polyhedron
1242
1243 */
1244 void count_points_e (int pos, Polyhedron *P, int exist, int nparam,
1245 Value *context, Value *res)
1246 {
1247 Value LB, UB, k, c;
1248
1249 if (emptyQ(P)) {
1250 value_set_si(*res, 0);
1251 return;
1252 }
1253
1254 if (!exist) {
1255 count_points(pos, P, context, res);
1256 return;
1257 }
1258
1259 value_init(LB); value_init(UB); value_init(k);
1260 value_set_si(LB,0);
1261 value_set_si(UB,0);
1262
1263 if (lower_upper_bounds(pos,P,context,&LB,&UB) !=0) {
1264 /* Problem if UB or LB is INFINITY */
1265 value_clear(LB); value_clear(UB); value_clear(k);
1266 if (pos > P->Dimension - nparam - exist)
1267 value_set_si(*res, 1);
1268 else
1269 value_set_si(*res, -1);
1270 return;
1271 }
1272
1273 #ifdef EDEBUG1
1274 if (!P->next) {
1275 int i;
1276 for (value_assign(k,LB); value_le(k,UB); value_increment(k,k)) {
1277 fprintf(stderr, "(");
1278 for (i=1; i<pos; i++) {
1279 value_print(stderr,P_VALUE_FMT,context[i]);
1280 fprintf(stderr,",");
1281 }
1282 value_print(stderr,P_VALUE_FMT,k);
1283 fprintf(stderr,")\n");
1284 }
1285 }
1286 #endif
1287
1288 value_set_si(context[pos],0);
1289 if (value_lt(UB,LB)) {
1290 value_clear(LB); value_clear(UB); value_clear(k);
1291 value_set_si(*res, 0);
1292 return;
1293 }
1294 if (!P->next) {
1295 if (exist)
1296 value_set_si(*res, 1);
1297 else {
1298 value_subtract(k,UB,LB);
1299 value_add_int(k,k,1);
1300 value_assign(*res, k);
1301 }
1302 value_clear(LB); value_clear(UB); value_clear(k);
1303 return;
1304 }
1305
1306 /*-----------------------------------------------------------------*/
1307 /* Optimization idea */
1308 /* If inner loops are not a function of k (the current index) */
1309 /* i.e. if P->Constraint[i][pos]==0 for all P following this and */
1310 /* for all i, */
1311 /* Then CNT = (UB-LB+1)*count_points(pos+1, P->next, context) */
1312 /* (skip the for loop) */
1313 /*-----------------------------------------------------------------*/
1314
1315 value_init(c);
1316 value_set_si(*res, 0);
1317 for (value_assign(k,LB);value_le(k,UB);value_increment(k,k)) {
1318 /* Insert k in context */
1319 value_assign(context[pos],k);
1320 count_points_e(pos+1, P->next, exist, nparam, context, &c);
1321 if(value_notmone_p(c))
1322 value_addto(*res, *res, c);
1323 else {
1324 value_set_si(*res, -1);
1325 break;
1326 }
1327 if (pos > P->Dimension - nparam - exist &&
1328 value_pos_p(*res))
1329 break;
1330 }
1331 value_clear(c);
1332
1333 #ifdef EDEBUG11
1334 fprintf(stderr,"%d\n",CNT);
1335 #endif
1336
1337 /* Reset context */
1338 value_set_si(context[pos],0);
1339 value_clear(LB); value_clear(UB); value_clear(k);
1340 return;
1341 } /* count_points_e */
1342
1343 int DomainContains(Polyhedron *P, Value *list_args, int len,
1344 unsigned MaxRays, int set)
1345 {
1346 int i;
1347 Value m;
1348
1349 if (P->Dimension == len)
1350 return in_domain(P, list_args);
1351
1352 assert(set); // assume list_args is large enough
1353 assert((P->Dimension - len) % 2 == 0);
1354 value_init(m);
1355 for (i = 0; i < P->Dimension - len; i += 2) {
1356 int j, k;
1357 for (j = 0 ; j < P->NbEq; ++j)
1358 if (value_notzero_p(P->Constraint[j][1+len+i]))
1359 break;
1360 assert(j < P->NbEq);
1361 value_absolute(m, P->Constraint[j][1+len+i]);
1362 k = First_Non_Zero(P->Constraint[j]+1, len);
1363 assert(k != -1);
1364 assert(First_Non_Zero(P->Constraint[j]+1+k+1, len - k - 1) == -1);
1365 mpz_fdiv_q(list_args[len+i], list_args[k], m);
1366 mpz_fdiv_r(list_args[len+i+1], list_args[k], m);
1367 }
1368 value_clear(m);
1369
1370 return in_domain(P, list_args);
1371 }
1372
1373 Polyhedron *DomainConcat(Polyhedron *head, Polyhedron *tail)
1374 {
1375 Polyhedron *S;
1376 if (!head)
1377 return tail;
1378 for (S = head; S->next; S = S->next)
1379 ;
1380 S->next = tail;
1381 return head;
1382 }
1383
1384 evalue *barvinok_lexsmaller_ev(Polyhedron *P, Polyhedron *D, unsigned dim,
1385 Polyhedron *C, unsigned MaxRays)
1386 {
1387 evalue *ranking;
1388 Polyhedron *RC, *RD, *Q;
1389 unsigned nparam = dim + C->Dimension;
1390 unsigned exist;
1391 Polyhedron *CA;
1392
1393 RC = LexSmaller(P, D, dim, C, MaxRays);
1394 RD = RC->next;
1395 RC->next = NULL;
1396
1397 exist = RD->Dimension - nparam - dim;
1398 CA = align_context(RC, RD->Dimension, MaxRays);
1399 Q = DomainIntersection(RD, CA, MaxRays);
1400 Polyhedron_Free(CA);
1401 Domain_Free(RD);
1402 Polyhedron_Free(RC);
1403 RD = Q;
1404
1405 for (Q = RD; Q; Q = Q->next) {
1406 evalue *t;
1407 Polyhedron *next = Q->next;
1408 Q->next = 0;
1409
1410 t = barvinok_enumerate_e(Q, exist, nparam, MaxRays);
1411
1412 if (Q == RD)
1413 ranking = t;
1414 else {
1415 eadd(t, ranking);
1416 evalue_free(t);
1417 }
1418
1419 Q->next = next;
1420 }
1421
1422 Domain_Free(RD);
1423
1424 return ranking;
1425 }
1426
1427 Enumeration *barvinok_lexsmaller(Polyhedron *P, Polyhedron *D, unsigned dim,
1428 Polyhedron *C, unsigned MaxRays)
1429 {
1430 evalue *EP = barvinok_lexsmaller_ev(P, D, dim, C, MaxRays);
1431
1432 return partition2enumeration(EP);
1433 }
1434
1435 /* "align" matrix to have nrows by inserting
1436 * the necessary number of rows and an equal number of columns in front
1437 */
1438 Matrix *align_matrix(Matrix *M, int nrows)
1439 {
1440 int i;
1441 int newrows = nrows - M->NbRows;
1442 Matrix *M2 = Matrix_Alloc(nrows, newrows + M->NbColumns);
1443 for (i = 0; i < newrows; ++i)
1444 value_set_si(M2->p[i][i], 1);
1445 for (i = 0; i < M->NbRows; ++i)
1446 Vector_Copy(M->p[i], M2->p[newrows+i]+newrows, M->NbColumns);
1447 return M2;
1448 }
1449
1450 static void print_varlist(FILE *out, int n, char **names)
1451 {
1452 int i;
1453 fprintf(out, "[");
1454 for (i = 0; i < n; ++i) {
1455 if (i)
1456 fprintf(out, ",");
1457 fprintf(out, "%s", names[i]);
1458 }
1459 fprintf(out, "]");
1460 }
1461
1462 static void print_term(FILE *out, Value v, int pos, int dim, int nparam,
1463 char **iter_names, char **param_names, int *first)
1464 {
1465 if (value_zero_p(v)) {
1466 if (first && *first && pos >= dim + nparam)
1467 fprintf(out, "0");
1468 return;
1469 }
1470
1471 if (first) {
1472 if (!*first && value_pos_p(v))
1473 fprintf(out, "+");
1474 *first = 0;
1475 }
1476 if (pos < dim + nparam) {
1477 if (value_mone_p(v))
1478 fprintf(out, "-");
1479 else if (!value_one_p(v))
1480 value_print(out, VALUE_FMT, v);
1481 if (pos < dim)
1482 fprintf(out, "%s", iter_names[pos]);
1483 else
1484 fprintf(out, "%s", param_names[pos-dim]);
1485 } else
1486 value_print(out, VALUE_FMT, v);
1487 }
1488
1489 char **util_generate_names(int n, const char *prefix)
1490 {
1491 int i;
1492 int len = (prefix ? strlen(prefix) : 0) + 10;
1493 char **names = ALLOCN(char*, n);
1494 if (!names) {
1495 fprintf(stderr, "ERROR: memory overflow.\n");
1496 exit(1);
1497 }
1498 for (i = 0; i < n; ++i) {
1499 names[i] = ALLOCN(char, len);
1500 if (!names[i]) {
1501 fprintf(stderr, "ERROR: memory overflow.\n");
1502 exit(1);
1503 }
1504 if (!prefix)
1505 snprintf(names[i], len, "%d", i);
1506 else
1507 snprintf(names[i], len, "%s%d", prefix, i);
1508 }
1509
1510 return names;
1511 }
1512
1513 void util_free_names(int n, char **names)
1514 {
1515 int i;
1516 for (i = 0; i < n; ++i)
1517 free(names[i]);
1518 free(names);
1519 }
1520
1521 void Polyhedron_pprint(FILE *out, Polyhedron *P, int dim, int nparam,
1522 char **iter_names, char **param_names)
1523 {
1524 int i, j;
1525 Value tmp;
1526
1527 assert(dim + nparam == P->Dimension);
1528
1529 value_init(tmp);
1530
1531 fprintf(out, "{ ");
1532 if (nparam) {
1533 print_varlist(out, nparam, param_names);
1534 fprintf(out, " -> ");
1535 }
1536 print_varlist(out, dim, iter_names);
1537 fprintf(out, " : ");
1538
1539 if (emptyQ2(P))
1540 fprintf(out, "FALSE");
1541 else for (i = 0; i < P->NbConstraints; ++i) {
1542 int first = 1;
1543 int v = First_Non_Zero(P->Constraint[i]+1, P->Dimension);
1544 if (v == -1 && value_pos_p(P->Constraint[i][0]))
1545 continue;
1546 if (i)
1547 fprintf(out, " && ");
1548 if (v == -1 && value_notzero_p(P->Constraint[i][1+P->Dimension]))
1549 fprintf(out, "FALSE");
1550 else if (value_pos_p(P->Constraint[i][v+1])) {
1551 print_term(out, P->Constraint[i][v+1], v, dim, nparam,
1552 iter_names, param_names, NULL);
1553 if (value_zero_p(P->Constraint[i][0]))
1554 fprintf(out, " = ");
1555 else
1556 fprintf(out, " >= ");
1557 for (j = v+1; j <= dim+nparam; ++j) {
1558 value_oppose(tmp, P->Constraint[i][1+j]);
1559 print_term(out, tmp, j, dim, nparam,
1560 iter_names, param_names, &first);
1561 }
1562 } else {
1563 value_oppose(tmp, P->Constraint[i][1+v]);
1564 print_term(out, tmp, v, dim, nparam,
1565 iter_names, param_names, NULL);
1566 fprintf(out, " <= ");
1567 for (j = v+1; j <= dim+nparam; ++j)
1568 print_term(out, P->Constraint[i][1+j], j, dim, nparam,
1569 iter_names, param_names, &first);
1570 }
1571 }
1572
1573 fprintf(out, " }\n");
1574
1575 value_clear(tmp);
1576 }
1577
1578 /* Construct a cone over P with P placed at x_d = 1, with
1579 * x_d the coordinate of an extra dimension
1580 *
1581 * It's probably a mistake to depend so much on the internal
1582 * representation. We should probably simply compute the
1583 * vertices/facets first.
1584 */
1585 Polyhedron *Cone_over_Polyhedron(Polyhedron *P)
1586 {
1587 unsigned NbConstraints = 0;
1588 unsigned NbRays = 0;
1589 Polyhedron *C;
1590 int i;
1591
1592 if (POL_HAS(P, POL_INEQUALITIES))
1593 NbConstraints = P->NbConstraints + 1;
1594 if (POL_HAS(P, POL_POINTS))
1595 NbRays = P->NbRays + 1;
1596
1597 C = Polyhedron_Alloc(P->Dimension+1, NbConstraints, NbRays);
1598 if (POL_HAS(P, POL_INEQUALITIES)) {
1599 C->NbEq = P->NbEq;
1600 for (i = 0; i < P->NbConstraints; ++i)
1601 Vector_Copy(P->Constraint[i], C->Constraint[i], P->Dimension+2);
1602 /* n >= 0 */
1603 value_set_si(C->Constraint[P->NbConstraints][0], 1);
1604 value_set_si(C->Constraint[P->NbConstraints][1+P->Dimension], 1);
1605 }
1606 if (POL_HAS(P, POL_POINTS)) {
1607 C->NbBid = P->NbBid;
1608 for (i = 0; i < P->NbRays; ++i)
1609 Vector_Copy(P->Ray[i], C->Ray[i], P->Dimension+2);
1610 /* vertex 0 */
1611 value_set_si(C->Ray[P->NbRays][0], 1);
1612 value_set_si(C->Ray[P->NbRays][1+C->Dimension], 1);
1613 }
1614 POL_SET(C, POL_VALID);
1615 if (POL_HAS(P, POL_INEQUALITIES))
1616 POL_SET(C, POL_INEQUALITIES);
1617 if (POL_HAS(P, POL_POINTS))
1618 POL_SET(C, POL_POINTS);
1619 if (POL_HAS(P, POL_VERTICES))
1620 POL_SET(C, POL_VERTICES);
1621 return C;
1622 }
1623
1624 /* Returns a (dim+nparam+1)x((dim-n)+nparam+1) matrix
1625 * mapping the transformed subspace back to the original space.
1626 * n is the number of equalities involving the variables
1627 * (i.e., not purely the parameters).
1628 * The remaining n coordinates in the transformed space would
1629 * have constant (parametric) values and are therefore not
1630 * included in the variables of the new space.
1631 */
1632 Matrix *compress_variables(Matrix *Equalities, unsigned nparam)
1633 {
1634 unsigned dim = (Equalities->NbColumns-2) - nparam;
1635 Matrix *M, *H, *Q, *U, *C, *ratH, *invH, *Ul, *T1, *T2, *T;
1636 Value mone;
1637 int n, i, j;
1638 int ok;
1639
1640 for (n = 0; n < Equalities->NbRows; ++n)
1641 if (First_Non_Zero(Equalities->p[n]+1, dim) == -1)
1642 break;
1643 if (n == 0)
1644 return Identity(dim+nparam+1);
1645 value_init(mone);
1646 value_set_si(mone, -1);
1647 M = Matrix_Alloc(n, dim);
1648 C = Matrix_Alloc(n+1, nparam+1);
1649 for (i = 0; i < n; ++i) {
1650 Vector_Copy(Equalities->p[i]+1, M->p[i], dim);
1651 Vector_Scale(Equalities->p[i]+1+dim, C->p[i], mone, nparam+1);
1652 }
1653 value_set_si(C->p[n][nparam], 1);
1654 left_hermite(M, &H, &Q, &U);
1655 Matrix_Free(M);
1656 Matrix_Free(Q);
1657 value_clear(mone);
1658
1659 ratH = Matrix_Alloc(n+1, n+1);
1660 invH = Matrix_Alloc(n+1, n+1);
1661 for (i = 0; i < n; ++i)
1662 Vector_Copy(H->p[i], ratH->p[i], n);
1663 value_set_si(ratH->p[n][n], 1);
1664 ok = Matrix_Inverse(ratH, invH);
1665 assert(ok);
1666 Matrix_Free(H);
1667 Matrix_Free(ratH);
1668 T1 = Matrix_Alloc(n+1, nparam+1);
1669 Matrix_Product(invH, C, T1);
1670 Matrix_Free(C);
1671 Matrix_Free(invH);
1672 if (value_notone_p(T1->p[n][nparam])) {
1673 for (i = 0; i < n; ++i) {
1674 if (!mpz_divisible_p(T1->p[i][nparam], T1->p[n][nparam])) {
1675 Matrix_Free(T1);
1676 Matrix_Free(U);
1677 return NULL;
1678 }
1679 /* compress_params should have taken care of this */
1680 for (j = 0; j < nparam; ++j)
1681 assert(mpz_divisible_p(T1->p[i][j], T1->p[n][nparam]));
1682 Vector_AntiScale(T1->p[i], T1->p[i], T1->p[n][nparam], nparam+1);
1683 }
1684 value_set_si(T1->p[n][nparam], 1);
1685 }
1686 Ul = Matrix_Alloc(dim+1, n+1);
1687 for (i = 0; i < dim; ++i)
1688 Vector_Copy(U->p[i], Ul->p[i], n);
1689 value_set_si(Ul->p[dim][n], 1);
1690 T2 = Matrix_Alloc(dim+1, nparam+1);
1691 Matrix_Product(Ul, T1, T2);
1692 Matrix_Free(Ul);
1693 Matrix_Free(T1);
1694
1695 T = Matrix_Alloc(dim+nparam+1, (dim-n)+nparam+1);
1696 for (i = 0; i < dim; ++i) {
1697 Vector_Copy(U->p[i]+n, T->p[i], dim-n);
1698 Vector_Copy(T2->p[i], T->p[i]+dim-n, nparam+1);
1699 }
1700 for (i = 0; i < nparam+1; ++i)
1701 value_set_si(T->p[dim+i][(dim-n)+i], 1);
1702 assert(value_one_p(T2->p[dim][nparam]));
1703 Matrix_Free(U);
1704 Matrix_Free(T2);
1705
1706 return T;
1707 }
1708
1709 /* Computes the left inverse of an affine embedding M and, if Eq is not NULL,
1710 * the equalities that define the affine subspace onto which M maps
1711 * its argument.
1712 */
1713 Matrix *left_inverse(Matrix *M, Matrix **Eq)
1714 {
1715 int i, ok;
1716 Matrix *L, *H, *Q, *U, *ratH, *invH, *Ut, *inv;
1717 Vector *t;
1718
1719 if (M->NbColumns == 1) {
1720 inv = Matrix_Alloc(1, M->NbRows);
1721 value_set_si(inv->p[0][M->NbRows-1], 1);
1722 if (Eq) {
1723 *Eq = Matrix_Alloc(M->NbRows-1, 1+(M->NbRows-1)+1);
1724 for (i = 0; i < M->NbRows-1; ++i) {
1725 value_oppose((*Eq)->p[i][1+i], M->p[M->NbRows-1][0]);
1726 value_assign((*Eq)->p[i][1+(M->NbRows-1)], M->p[i][0]);
1727 }
1728 }
1729 return inv;
1730 }
1731 if (Eq)
1732 *Eq = NULL;
1733 L = Matrix_Alloc(M->NbRows-1, M->NbColumns-1);
1734 for (i = 0; i < L->NbRows; ++i)
1735 Vector_Copy(M->p[i], L->p[i], L->NbColumns);
1736 right_hermite(L, &H, &U, &Q);
1737 Matrix_Free(L);
1738 Matrix_Free(Q);
1739 t = Vector_Alloc(U->NbColumns);
1740 for (i = 0; i < U->NbColumns; ++i)
1741 value_oppose(t->p[i], M->p[i][M->NbColumns-1]);
1742 if (Eq) {
1743 *Eq = Matrix_Alloc(H->NbRows - H->NbColumns, 2 + U->NbColumns);
1744 for (i = 0; i < H->NbRows - H->NbColumns; ++i) {
1745 Vector_Copy(U->p[H->NbColumns+i], (*Eq)->p[i]+1, U->NbColumns);
1746 Inner_Product(U->p[H->NbColumns+i], t->p, U->NbColumns,
1747 (*Eq)->p[i]+1+U->NbColumns);
1748 }
1749 }
1750 ratH = Matrix_Alloc(H->NbColumns+1, H->NbColumns+1);
1751 invH = Matrix_Alloc(H->NbColumns+1, H->NbColumns+1);
1752 for (i = 0; i < H->NbColumns; ++i)
1753 Vector_Copy(H->p[i], ratH->p[i], H->NbColumns);
1754 value_set_si(ratH->p[ratH->NbRows-1][ratH->NbColumns-1], 1);
1755 Matrix_Free(H);
1756 ok = Matrix_Inverse(ratH, invH);
1757 assert(ok);
1758 Matrix_Free(ratH);
1759 Ut = Matrix_Alloc(invH->NbRows, U->NbColumns+1);
1760 for (i = 0; i < Ut->NbRows-1; ++i) {
1761 Vector_Copy(U->p[i], Ut->p[i], U->NbColumns);
1762 Inner_Product(U->p[i], t->p, U->NbColumns, &Ut->p[i][Ut->NbColumns-1]);
1763 }
1764 Matrix_Free(U);
1765 Vector_Free(t);
1766 value_set_si(Ut->p[Ut->NbRows-1][Ut->NbColumns-1], 1);
1767 inv = Matrix_Alloc(invH->NbRows, Ut->NbColumns);
1768 Matrix_Product(invH, Ut, inv);
1769 Matrix_Free(Ut);
1770 Matrix_Free(invH);
1771 return inv;
1772 }
1773
1774 /* Check whether all rays are revlex positive in the parameters
1775 */
1776 int Polyhedron_has_revlex_positive_rays(Polyhedron *P, unsigned nparam)
1777 {
1778 int r;
1779 for (r = 0; r < P->NbRays; ++r) {
1780 int i;
1781 if (value_notzero_p(P->Ray[r][P->Dimension+1]))
1782 continue;
1783 for (i = P->Dimension-1; i >= P->Dimension-nparam; --i) {
1784 if (value_neg_p(P->Ray[r][i+1]))
1785 return 0;
1786 if (value_pos_p(P->Ray[r][i+1]))
1787 break;
1788 }
1789 /* A ray independent of the parameters */
1790 if (i < P->Dimension-nparam)
1791 return 0;
1792 }
1793 return 1;
1794 }
1795
1796 static Polyhedron *Recession_Cone(Polyhedron *P, unsigned nparam, unsigned MaxRays)
1797 {
1798 int i;
1799 unsigned nvar = P->Dimension - nparam;
1800 Matrix *M = Matrix_Alloc(P->NbConstraints, 1 + nvar + 1);
1801 Polyhedron *R;
1802 for (i = 0; i < P->NbConstraints; ++i)
1803 Vector_Copy(P->Constraint[i], M->p[i], 1+nvar);
1804 R = Constraints2Polyhedron(M, MaxRays);
1805 Matrix_Free(M);
1806 return R;
1807 }
1808
1809 int Polyhedron_is_unbounded(Polyhedron *P, unsigned nparam, unsigned MaxRays)
1810 {
1811 int i;
1812 int is_unbounded;
1813 Polyhedron *R = Recession_Cone(P, nparam, MaxRays);
1814 POL_ENSURE_VERTICES(R);
1815 if (R->NbBid == 0)
1816 for (i = 0; i < R->NbRays; ++i)
1817 if (value_zero_p(R->Ray[i][1+R->Dimension]))
1818 break;
1819 is_unbounded = R->NbBid > 0 || i < R->NbRays;
1820 Polyhedron_Free(R);
1821 return is_unbounded;
1822 }
1823
1824 static void SwapColumns(Value **V, int n, int i, int j)
1825 {
1826 int r;
1827
1828 for (r = 0; r < n; ++r)
1829 value_swap(V[r][i], V[r][j]);
1830 }
1831
1832 void Polyhedron_ExchangeColumns(Polyhedron *P, int Column1, int Column2)
1833 {
1834 SwapColumns(P->Constraint, P->NbConstraints, Column1, Column2);
1835 SwapColumns(P->Ray, P->NbRays, Column1, Column2);
1836 if (P->NbEq) {
1837 Matrix M;
1838 Polyhedron_Matrix_View(P, &M, P->NbConstraints);
1839 Gauss(&M, P->NbEq, P->Dimension+1);
1840 }
1841 }
1842
1843 /* perform transposition inline; assumes M is a square matrix */
1844 void Matrix_Transposition(Matrix *M)
1845 {
1846 int i, j;
1847
1848 assert(M->NbRows == M->NbColumns);
1849 for (i = 0; i < M->NbRows; ++i)
1850 for (j = i+1; j < M->NbColumns; ++j)
1851 value_swap(M->p[i][j], M->p[j][i]);
1852 }
1853
1854 /* Matrix "view" of first rows rows */
1855 void Polyhedron_Matrix_View(Polyhedron *P, Matrix *M, unsigned rows)
1856 {
1857 M->NbRows = rows;
1858 M->NbColumns = P->Dimension+2;
1859 M->p_Init = P->p_Init;
1860 M->p = P->Constraint;
1861 }
lattice point enumeration library