test.c

   1 #include <assert.h>
   2 #include <stdio.h>
   3 #include <string.h>
   4 #include <unistd.h>
   5 #include <barvinok/util.h>
   6 #include <barvinok/barvinok.h>
   7 #include "argp.h"
   8 #include "progname.h"
   9 #include "config.h"
  10
  11 #ifdef HAVE_SYS_TIMES_H
  12
  13 #include <sys/times.h>
  14
  15 static void time_diff(struct tms *before, struct tms *after)
  16 {
  17     long ticks = sysconf(_SC_CLK_TCK);
  18     printf("User: %g; Sys: %g\n",
  19             (0.0 + after->tms_utime - before->tms_utime) / ticks,
  20             (0.0 + after->tms_stime - before->tms_stime) / ticks);
  21 }
  22
  23 #else
  24
  25 struct tms {};
  26 static void times(struct tms* time)
  27 {
  28 }
  29 static void time_diff(struct tms *before, struct tms *after)
  30 {
  31 }
  32
  33 #endif
  34
  35 int main(int argc, char **argv)
  36 {
  37     int i, nbPol, nbVec, nbMat, func, j;
  38     Polyhedron *A, *B, *C, *D, *E, *F, *G;
  39     char s[128];
  40     struct barvinok_options *options = barvinok_options_new_with_defaults();
  41
  42     set_program_name(argv[0]);
  43     argp_parse(&barvinok_argp, argc, argv, 0, 0, options);
  44
  45     nbPol = nbVec = nbMat = 0;
  46     fgets(s, 128, stdin);
  47     while ((*s=='#') ||
  48             ((sscanf(s, "D %d", &nbPol) < 1) &&
  49              (sscanf(s, "V %d", &nbVec) < 1) &&
  50              (sscanf(s, "M %d", &nbMat) < 1)))
  51         fgets(s, 128, stdin);
  52
  53     for (i = 0; i < nbPol; ++i) {
  54         Matrix *M = Matrix_Read();
  55         A = Constraints2Polyhedron(M, options->MaxRays);
  56         Matrix_Free(M);
  57         fgets(s, 128, stdin);
  58         while ((*s=='#') || (sscanf(s, "F %d", &func)<1))
  59             fgets(s, 128, stdin);
  60
  61         switch(func) {
  62         case 0: {
  63             Value cb, ck;
  64             value_init(cb);
  65             value_init(ck);
  66             fgets(s, 128, stdin);
  67             /* workaround for apparent bug in older gmps */
  68             *strchr(s, '\n') = '\0';
  69             while ((*s=='#') || (value_read(ck, s) != 0)) {
  70                 fgets(s, 128, stdin);
  71                 /* workaround for apparent bug in older gmps */
  72                 *strchr(s, '\n') = '\0';
  73             }
  74             barvinok_count_with_options(A, &cb, options);
  75             if (value_ne(cb, ck))
  76                 return -1;
  77             value_clear(cb);
  78             value_clear(ck);
  79             break;
  80         }
  81         case 1:
  82             Polyhedron_Print(stdout, P_VALUE_FMT, A);
  83             B = Polyhedron_Polar(A, options->MaxRays);
  84             Polyhedron_Print(stdout, P_VALUE_FMT, B);
  85             C = Polyhedron_Polar(B, options->MaxRays);
  86             Polyhedron_Print(stdout, P_VALUE_FMT, C);
  87             Polyhedron_Free(C);
  88             Polyhedron_Free(B);
  89             break;
  90         case 2:
  91             Polyhedron_Print(stdout, P_VALUE_FMT, A);
  92             for (j = 0; j < A->NbRays; ++j) {
  93                 B = supporting_cone(A, j);
  94                 Polyhedron_Print(stdout, P_VALUE_FMT, B);
  95                 Polyhedron_Free(B);
  96             }
  97             break;
  98         case 3:
  99             Polyhedron_Print(stdout, P_VALUE_FMT, A);
 100             C = B = NULL;
 101             barvinok_decompose(A,&B,&C);
 102             puts("Pos:");
 103             Polyhedron_Print(stdout, P_VALUE_FMT, B);
 104             puts("Neg:");
 105             Polyhedron_Print(stdout, P_VALUE_FMT, C);
 106             Domain_Free(B);
 107             Domain_Free(C);
 108             break;
 109         case 4: {
 110             Value cm, cb;
 111             struct tms tms_before, tms_between, tms_after;
 112             value_init(cm);
 113             value_init(cb);
 114             Polyhedron_Print(stdout, P_VALUE_FMT, A);
 115             times(&tms_before);
 116             manual_count(A, &cm);
 117             times(&tms_between);
 118             barvinok_count(A, &cb, 100);
 119             times(&tms_after);
 120             printf("manual: ");
 121             value_print(stdout, P_VALUE_FMT, cm);
 122             puts("");
 123             time_diff(&tms_before, &tms_between);
 124             printf("Barvinok: ");
 125             value_print(stdout, P_VALUE_FMT, cb);
 126             puts("");
 127             time_diff(&tms_between, &tms_after);
 128             value_clear(cm);
 129             value_clear(cb);
 130             break;
 131         }
 132         case 5:
 133             Polyhedron_Print(stdout, P_VALUE_FMT, A);
 134             B = triangulate_cone(A, 100);
 135             Polyhedron_Print(stdout, P_VALUE_FMT, B);
 136             check_triangulization(A, B);
 137             Domain_Free(B);
 138             break;
 139         case 6:
 140             Polyhedron_Print(stdout, P_VALUE_FMT, A);
 141             B = remove_equalities(A);
 142             Polyhedron_Print(stdout, P_VALUE_FMT, B);
 143             Polyhedron_Free(B);
 144             break;
 145         case 8: {
 146             evalue *EP;
 147             Matrix *M = Matrix_Read();
 148             char **param_name;
 149             C = Constraints2Polyhedron(M, options->MaxRays);
 150             Matrix_Free(M);
 151             Polyhedron_Print(stdout, P_VALUE_FMT, A);
 152             Polyhedron_Print(stdout, P_VALUE_FMT, C);
 153             EP = barvinok_enumerate_with_options(A, C, options);
 154             param_name = Read_ParamNames(stdin, C->Dimension);
 155             print_evalue(stdout, EP, param_name);
 156             free_evalue_refs(EP);
 157             free(EP);
 158             Polyhedron_Free(C);
 159         }
 160         case 9:
 161             Polyhedron_Print(stdout, P_VALUE_FMT, A);
 162             Polyhedron_Polarize(A);
 163             C = B = NULL;
 164             barvinok_decompose(A,&B,&C);
 165             for (D = B; D; D = D->next)
 166                 Polyhedron_Polarize(D);
 167             for (D = C; D; D = D->next)
 168                 Polyhedron_Polarize(D);
 169             puts("Pos:");
 170             Polyhedron_Print(stdout, P_VALUE_FMT, B);
 171             puts("Neg:");
 172             Polyhedron_Print(stdout, P_VALUE_FMT, C);
 173             Domain_Free(B);
 174             Domain_Free(C);
 175             break;
 176         }
 177         Polyhedron_Free(A);
 178     }
 179     for (i = 0; i < nbVec; ++i) {
 180         Vector *V = Vector_Read();
 181         Matrix *M = unimodular_complete(V);
 182         Matrix_Print(stdout, P_VALUE_FMT, M);
 183         Matrix_Free(M);
 184         Vector_Free(V);
 185     }
 186     for (i = 0; i < nbMat; ++i) {
 187         Matrix *U, *V, *S;
 188         Matrix *M = Matrix_Read();
 189         Smith(M, &U, &V, &S);
 190         Matrix_Print(stdout, P_VALUE_FMT, U);
 191         Matrix_Print(stdout, P_VALUE_FMT, V);
 192         Matrix_Print(stdout, P_VALUE_FMT, S);
 193         Matrix_Free(M);
 194         Matrix_Free(U);
 195         Matrix_Free(V);
 196         Matrix_Free(S);
 197     }
 198
 199     barvinok_options_free(options);
 200     return 0;
 201 }