cannam@167: /* addition-chain optimizer */
cannam@167: #include <stdio.h>
cannam@167: #include <stdlib.h>
cannam@167: #include <unistd.h>
cannam@167: 
cannam@167: static int verbose;
cannam@167: static int mulcost = 18;
cannam@167: static int ldcost = 2;
cannam@167: static int sqcost = 10;
cannam@167: static int reflcost = 8;
cannam@167: #define INFTY 100000
cannam@167: 
cannam@167: static int *answer;
cannam@167: static int best_so_far;
cannam@167: 
cannam@167: static void print_answer(int n, int t)
cannam@167: {
cannam@167:      int i;
cannam@167:      printf("| (%d, %d) -> [", n, t);
cannam@167:      for (i = 0; i < t; ++i)
cannam@167: 	  printf("%d;", answer[i]);
cannam@167:      printf("] (* %d *)\n", best_so_far);
cannam@167: }
cannam@167: 
cannam@167: #define DO(i, j, k, cst)			\
cannam@167: if (k < n) {					\
cannam@167:      int c = A[i] + A[j] + cst;			\
cannam@167:      if (c < A[k]) {				\
cannam@167: 	  A[k] = c;				\
cannam@167: 	  changed = 1;				\
cannam@167:      }						\
cannam@167: }
cannam@167: 
cannam@167: #define DO3(i, j, l, k, cst)			\
cannam@167: if (k < n) {					\
cannam@167:      int c = A[i] + A[j] + A[l] + cst;		\
cannam@167:      if (c < A[k]) {				\
cannam@167: 	  A[k] = c;				\
cannam@167: 	  changed = 1;				\
cannam@167:      }						\
cannam@167: }
cannam@167: 
cannam@167: static int optimize(int n, int *A)
cannam@167: {
cannam@167:      int i, j, k, changed, cst, cstmax;
cannam@167: 
cannam@167:      do {
cannam@167: 	  changed = 0;
cannam@167: 	  for (i = 0; i < n; ++i) {
cannam@167: 	       k = i + i;
cannam@167: 	       DO(i, i, k, sqcost);
cannam@167: 	  }
cannam@167: 
cannam@167: 	  for (i = 0; i < n; ++i) {
cannam@167: 	       for (j = 0; j <= i; ++j) {
cannam@167: 		    k = i + j;
cannam@167: 		    DO(i, j, k, mulcost);
cannam@167: 		    k = i - j;
cannam@167: 		    DO(i, j, k, mulcost);
cannam@167: 
cannam@167: 		    k = i + j;
cannam@167: 		    DO3(i, j, i - j, k, reflcost);
cannam@167: 	       }
cannam@167: 	  }
cannam@167: 
cannam@167:      } while (changed);
cannam@167: 
cannam@167:      cst = cstmax = 0;
cannam@167:      for (i = 0; i < n; ++i) {
cannam@167: 	  cst += A[i];
cannam@167: 	  if (A[i] > cstmax) cstmax = A[i];
cannam@167:      }
cannam@167: /*     return cstmax; */
cannam@167:      return cst;
cannam@167: }
cannam@167: 
cannam@167: static void search(int n, int t, int *A, int *B, int depth)
cannam@167: {
cannam@167:      if (depth == 0) {
cannam@167: 	  int i, tc;
cannam@167: 	  for (i = 0; i < n; ++i)
cannam@167: 	       A[i] = INFTY;
cannam@167: 	  A[0] = 0;		/* always free */
cannam@167: 	  for (i = 1; i <= t; ++i)
cannam@167: 	       A[B[-i]] = ldcost;
cannam@167: 
cannam@167: 	  tc = optimize(n, A);
cannam@167: 	  if (tc < best_so_far) {
cannam@167: 	       best_so_far = tc;
cannam@167: 	       for (i = 1; i <= t; ++i)
cannam@167: 		    answer[t - i] = B[-i];
cannam@167: 	       if (verbose)
cannam@167: 		    print_answer(n, t);
cannam@167: 	  }
cannam@167:      } else {
cannam@167: 	  for (B[0] = B[-1] + 1; B[0] < n; ++B[0])
cannam@167: 	       search(n, t, A, B + 1, depth - 1);
cannam@167:      }
cannam@167: }
cannam@167: 
cannam@167: static void doit(int n, int t)
cannam@167: {
cannam@167:      int *A;
cannam@167:      int *B;
cannam@167: 
cannam@167:      A = malloc(n * sizeof(int));
cannam@167:      B = malloc((t + 1) * sizeof(int));
cannam@167:      answer = malloc(t * sizeof(int));
cannam@167: 
cannam@167:      B[0] = 0;
cannam@167:      best_so_far = INFTY;
cannam@167:      search(n, t, A, B + 1, t);
cannam@167: 
cannam@167:      print_answer(n, t);
cannam@167: 
cannam@167:      free(A); free(B); free(answer);
cannam@167: }
cannam@167: 
cannam@167: int main(int argc, char *argv[])
cannam@167: {
cannam@167:      int n = 32;
cannam@167:      int t = 3;
cannam@167:      int all;
cannam@167:      int ch;
cannam@167: 
cannam@167:      verbose = 0;
cannam@167:      all = 0;
cannam@167:      while ((ch = getopt(argc, argv, "n:t:m:l:r:s:va")) != -1) {
cannam@167: 	  switch (ch) {
cannam@167: 	  case 'n':
cannam@167: 	       n = atoi(optarg);
cannam@167: 	       break;
cannam@167: 	  case 't':
cannam@167: 	       t = atoi(optarg);
cannam@167: 	       break;
cannam@167: 	  case 'm':
cannam@167: 	       mulcost = atoi(optarg);
cannam@167: 	       break;
cannam@167: 	  case 'l':
cannam@167: 	       ldcost = atoi(optarg);
cannam@167: 	       break;
cannam@167: 	  case 's':
cannam@167: 	       sqcost = atoi(optarg);
cannam@167: 	       break;
cannam@167: 	  case 'r':
cannam@167: 	       reflcost = atoi(optarg);
cannam@167: 	       break;
cannam@167: 	  case 'v':
cannam@167: 	       ++verbose;
cannam@167: 	       break;
cannam@167: 	  case 'a':
cannam@167: 	       ++all;
cannam@167: 	       break;
cannam@167: 	  case '?':
cannam@167: 	       fprintf(stderr, "use the source\n");
cannam@167: 	       exit(1);
cannam@167: 	  }
cannam@167:      }
cannam@167: 
cannam@167:      if (all) {
cannam@167: 	  for (n = 4; n <= 64; n *= 2) {
cannam@167: 	       int n1 = n - 1; if (n1 > 7) n1 = 7;
cannam@167: 	       for (t = 1; t <= n1; ++t)
cannam@167: 		    doit(n, t);
cannam@167: 	  }
cannam@167:      } else {
cannam@167: 	  doit(n, t);
cannam@167:      }
cannam@167: 
cannam@167:      return 0;
cannam@167: }