applications/verif_ehrhart.c

   1 /*************************************************/
   2 /*     verif_ehrhart.c                           */
   3 /* program to compare effective number of points */
   4 /* in a polytope with the corresponding          */
   5 /* evaluation of the Ehrhart polynomial.         */
   6 /* Parameters vary in range -RANGE to RANGE      */
   7 /* (define below) by default.                    */
   8 /* Can be overridden by specifying               */
   9 /* -r<RANGE>, or -m<min> and -M<max>             */
  10 /*                                               */
  11 /* written by Vincent Loechner (c) 2000.         */
  12 /*  loechner@icps.u-strasbg.fr                   */
  13 /*************************************************/
  14 /*
  15     This file is part of PolyLib.
  16
  17     PolyLib is free software: you can redistribute it and/or modify
  18     it under the terms of the GNU General Public License as published by
  19     the Free Software Foundation, either version 3 of the License, or
  20     (at your option) any later version.
  21
  22     PolyLib is distributed in the hope that it will be useful,
  23     but WITHOUT ANY WARRANTY; without even the implied warranty of
  24     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  25     GNU General Public License for more details.
  26
  27     You should have received a copy of the GNU General Public License
  28     along with PolyLib.  If not, see <http://www.gnu.org/licenses/>.
  29 */
  30
  31
  32 #include <stdio.h>
  33 #include <string.h>
  34 #include <stdlib.h>
  35
  36 #include <polylib/polylib.h>
  37 #define MAXRAYS 1024
  38
  39 /* define this to print all the results */
  40 /* else, only a progress bar is printed */
  41 /* #define PRINT_ALL_RESULTS     */
  42 /* define this to continue the test after first error found */
  43 /* #define DONT_BREAK_ON_ERROR */
  44
  45 /* RANGE : normal range for evalutations (-RANGE -> RANGE) */
  46 #define RANGE 50
  47
  48 /* SRANGE : small range for evalutations */
  49 #define SRANGE 15
  50
  51 /* if dimension >= BIDDIM, use SRANGE */
  52 #define BIGDIM 5
  53
  54 /* VSRANGE : very small range for evalutations */
  55 #define VSRANGE 5
  56
  57 /* if dimension >= VBIDDIM, use VSRANGE */
  58 #define VBIGDIM 8
  59
  60 Value min, max;
  61
  62 #ifdef DONT_BREAK_ON_ERROR
  63 #define PRINT_ALL_RESULTS
  64 #endif
  65
  66 #ifndef PRINT_ALL_RESULTS
  67 int st;
  68 #endif
  69
  70 /****************************************************/
  71 /* function check_poly :                            */
  72 /* scans the parameter space from min to max (all   */
  73 /* directions). Computes the number of points in    */
  74 /* the polytope using both methods, and compare them*/
  75 /* returns 1 on success                             */
  76 /****************************************************/
  77
  78 int check_poly(Polyhedron *S,Polyhedron *C,Enumeration *en,
  79                int nparam,int pos,Value *z) {
  80
  81   int cc,k;
  82   Value c,tmp,*ctmp;
  83
  84   value_init(c); value_init(tmp);
  85
  86   if(pos == nparam) {
  87
  88     /* Computes the ehrhart polynomial */
  89     value_assign(c,*(ctmp=compute_poly(en,&z[S->Dimension-nparam+1])));
  90     free(ctmp);
  91     /* if c=0 we may be out of context. */
  92     /* scanning is useless in this case*/
  93     if(!in_domain(C,&z[S->Dimension-nparam+1])) {
  94
  95       /* ok */ ;
  96     }
  97     else {
  98
  99 #ifdef PRINT_ALL_RESULTS
 100       printf("EP( ");
 101       value_print(stdout,VALUE_FMT,z[S->Dimension-nparam+1]);
 102       for(k=S->Dimension-nparam+2;k<=S->Dimension;++k) {
 103         printf(", ");
 104         value_print(stdout,VALUE_FMT,z[k]);
 105       }
 106       printf(" ) = ");
 107       value_print(stdout,VALUE_FMT,c);
 108       printf(" ");
 109 #endif
 110
 111       /* Count manually the number of points */
 112       count_points(1,S,z,&tmp);
 113 #ifdef PRINT_ALL_RESULTS
 114         printf(", count = ");
 115         value_print(stdout, P_VALUE_FMT, tmp);
 116         printf(". ");
 117 #endif
 118
 119       if(value_ne(tmp,c)) {
 120         printf("\n");
 121         fflush(stdout);
 122         fprintf(stderr,"Error !\n");
 123         fprintf(stderr,"EP( ");
 124         value_print(stderr,VALUE_FMT,z[S->Dimension-nparam+1]);
 125         for(k=S->Dimension-nparam+2;k<=S->Dimension;++k) {
 126           fprintf(stderr,", ");
 127           value_print(stderr,VALUE_FMT,z[k]);
 128         }
 129         fprintf(stderr," ) should be ");
 130         value_print(stderr,VALUE_FMT,tmp);
 131         fprintf(stderr,", while EP eval gives ");
 132         value_print(stderr,VALUE_FMT,c);
 133         fprintf(stderr,".\n");
 134 #ifndef DONT_BREAK_ON_ERROR
 135         value_clear(c); value_clear(tmp);
 136         return(0);
 137 #endif
 138       }
 139
 140 #ifdef PRINT_ALL_RESULTS
 141       else
 142         printf("OK.\n");
 143 #endif
 144     }
 145   }
 146   else
 147     for(value_assign(tmp,min); value_le(tmp,max); value_increment(tmp,tmp)) {
 148
 149 #ifndef PRINT_ALL_RESULTS
 150       k = VALUE_TO_INT(tmp);
 151       if(!pos && !(k%st)) {
 152         printf("o");
 153         fflush(stdout);
 154       }
 155 #endif
 156
 157       value_assign(z[pos+S->Dimension-nparam+1],tmp);
 158       if(!check_poly(S,C,en,nparam,pos+1,z)) {
 159         value_clear(c); value_clear(tmp);
 160         return(0);
 161       }
 162     }
 163   value_clear(c); value_clear(tmp);
 164   return(1);
 165 } /* check_poly */
 166
 167 int main(int argc,char *argv[]) {
 168
 169   Matrix *C1, *P1;
 170   Polyhedron *C, *P, *S;
 171   Polyhedron *CC, *PP;
 172   Enumeration *en;
 173   Value *p, tmp;
 174   int i,j;
 175   int m,M;
 176
 177 /******* Read the input *********/
 178   P1 = Matrix_Read();
 179   C1 = Matrix_Read();
 180
 181   if(C1->NbColumns < 2) {
 182     fprintf(stderr,"Not enough parameters !\n");
 183     exit(0);
 184   }
 185
 186   P = Constraints2Polyhedron(P1,MAXRAYS);
 187   C = Constraints2Polyhedron(C1,MAXRAYS);
 188   Matrix_Free(C1);
 189   Matrix_Free(P1);
 190
 191   /******* Read the options: initialize min and max ********/
 192   if(P->Dimension >= VBIGDIM)
 193     M = VSRANGE;
 194   else if(P->Dimension >= BIGDIM)
 195     M = SRANGE;
 196   else
 197     M = RANGE;
 198   m = -M;
 199   if(argc != 1 ) {
 200     for(i=1;i<argc;i++) {
 201       if(!strncmp(argv[i],"-m",2)) {
 202
 203         /* min specified */
 204         m = atoi(&argv[i][2]);
 205       }
 206       else if(!strncmp(argv[i],"-M",2)) {
 207
 208         /* max specified */
 209         M = atoi(&argv[i][2]);
 210       }
 211       else if(!strncmp(argv[i], "-r", 2)) {
 212
 213         /* range specified */
 214         M = atoi(&argv[i][2]);
 215         m = -M;
 216       }
 217       else {
 218         fprintf(stderr,"Unknown option: %s\n",argv[i]);
 219         fprintf(stderr,"Usage: %s [-m<>][-M<>][-r<>]\n",argv[0]);
 220         return(-1);
 221       }
 222     }
 223   }
 224   if(m > M) {
 225     fprintf(stderr,"Nothing to do: min > max !\n");
 226     return(0);
 227   }
 228   value_init(min);
 229   value_init(max);
 230   value_set_si(min,m);
 231   value_set_si(max,M);
 232   value_init(tmp);
 233
 234   /******* Compute true context *******/
 235   CC = align_context(C,P->Dimension,MAXRAYS);
 236   PP = DomainIntersection(P,CC,MAXRAYS);
 237   Domain_Free(CC);
 238   C1 = Matrix_Alloc(C->Dimension+1,P->Dimension+1);
 239
 240   for(i=0;i<C1->NbRows;i++)
 241     for(j=0;j<C1->NbColumns;j++)
 242       if(i==j-P->Dimension+C->Dimension)
 243         value_set_si(C1->p[i][j],1);
 244       else
 245         value_set_si(C1->p[i][j],0);
 246   CC = Polyhedron_Image(PP,C1,MAXRAYS);
 247   Domain_Free(C);
 248   C = CC;
 249
 250   /******* Compute EP *********/
 251   en = Polyhedron_Enumerate(P,C,MAXRAYS,NULL);
 252
 253   /******* Initializations for check *********/
 254   p = (Value *)malloc(sizeof(Value) * (P->Dimension+2));
 255   for(i=0;i<=P->Dimension;i++) {
 256     value_init(p[i]);
 257     value_set_si(p[i],0);
 258   }
 259   value_init(p[i]);
 260   value_set_si(p[i],1);
 261
 262   /* S = scanning list of polyhedra */
 263   S = Polyhedron_Scan(P,C,MAXRAYS);
 264
 265 #ifndef PRINT_ALL_RESULTS
 266   if(C->Dimension > 0) {
 267     value_subtract(tmp,max,min);
 268     if (VALUE_TO_INT(tmp) > 80)
 269       st = 1+(VALUE_TO_INT(tmp))/80;
 270     else
 271       st=1;
 272     for(i=VALUE_TO_INT(min);i<=VALUE_TO_INT(max);i+=st)
 273       printf(".");
 274     printf( "\r" );
 275     fflush(stdout);
 276   }
 277 #endif
 278
 279   /******* CHECK NOW *********/
 280   if(S && !check_poly(S,C,en,C->Dimension,0,p)) {
 281     fprintf(stderr,"Check failed !\n");
 282     for(i=0;i<=(P->Dimension+1);i++)
 283       value_clear(p[i]);
 284     value_clear(tmp);
 285     return(-1);
 286   }
 287
 288 #ifndef PRINT_ALL_RESULTS
 289   printf( "\n" );
 290 #endif
 291
 292   for(i=0;i<=(P->Dimension+1);i++)
 293     value_clear(p[i]);
 294   value_clear(tmp);
 295   return(0);
 296 } /* main */
 297
 298
 299
 300