routesearch: abandon higher granuarities when tables become full

[ypp-sc-tools.db-test.git] / yarrg / rsmain.c

diff --git a/yarrg/rsmain.c b/yarrg/rsmain.c
index ea032600798aec91a87728442ed70e13c1bc974c..976aa5a29e4d3a1ed81c44945dcb102a3950b293 100644 (file)
--- a/yarrg/rsmain.c
+++ b/yarrg/rsmain.c
@@ -12,7 +12,7 @@ int max_dist= -1;
 FILE *debug_file;
 FILE *output;
 
-DEBUG_DEFINE_SOME_DEBUGF(tableau,tabdebugf);
+#define tabdebugf printf
 
 
 #define CTR(x)    int ctr_##x;
@@ -21,14 +21,15 @@ DEBUG_DEFINE_SOME_DEBUGF(tableau,tabdebugf);
 #undef CTR
 #undef CTRA
 
-static PotentialResult ****results;
-  /* results[start_isle_ix][finalisle][midisle]-> */
+static PotentialResult ****results[GRANUS];
+  /* results[GRANUS][start_isle_ix][finalisle][midisle]-> */
 
 static pid_t debugoutpid;
 
 int main(int argc, const char **argv) {
   const char *arg;
   int i, ap;
+  int granui;
 
 #ifndef debug_flags
   debug_flags= ~( dbg_sql2 );
@@ -101,12 +102,17 @@ int main(int argc, const char **argv) {
     double val= value_route(ni, ia, 0);
     fprintf(output, "route value is %g\n", val);
   } else if (!strcmp(arg,"search")) {
-    MCALLOC(results, argc);
+    for (granui=0; granui<GRANUS; granui++)
+      MCALLOC(results[granui], argc);
 
     max_dist= atoi(*argv++);
+
     for (ap=0; ap<AP; ap++) {
-      nhighscores[ap]= atoi(*argv++);
-      MCALLOC(highscores[ap], nhighscores[ap]);
+      int nhs= atoi(*argv++);
+      for (granui=0; granui<GRANUS; granui++) {
+       nhighscores[granui][ap]= nhs;
+       MCALLOC(highscores[granui][ap], nhs);
+      }
     }
     const char *final_isle_spec= *argv++;
 
@@ -120,60 +126,70 @@ int main(int argc, const char **argv) {
       else final_isle= atoi(final_isle_spec);
       assert(final_isle);
 
-      search(init_isle, final_isle, &results[resultsix]);
+      PotentialResult ****buckets_base_io[GRANUS];
+      for (granui=0; granui<GRANUS; granui++)
+       buckets_base_io[granui]= &results[granui][resultsix];
+       
+      search(init_isle, final_isle, buckets_base_io);
       resultsix++;
     }
 
-    int midarch, finarch;
-    for (i=0; i<resultsix; i++) {
-      tabdebugf("============== start #%d %s [PARTIAL] ==============\n",
-               i, argv[i]);
-      PotentialResult ***strat_resultsix= results[i];
-      if (!strat_resultsix) continue;
-      tabdebugf("  ");
-      for (midarch=0; midarch<narches; midarch++) {
-       tabdebugf("|   mid %d  ",midarch);
-      }
-      tabdebugf("\n");
-      for (finarch=0; finarch<narches; finarch++) {
-       PotentialResult **strat_finarch= strat_resultsix[finarch];
-       if (!strat_finarch) continue;
-       tabdebugf("f%d",finarch);
-       for (midarch=0; midarch<narches; midarch++) {
-         PotentialResult *result= strat_finarch[midarch];
-         if (!result) {
-           tabdebugf("|          ");
-         } else {
-           tabdebugf("|%5d",(int)(result->value[A]));
-           tabdebugf(" ");
-           tabdebugf("%4d",(int)(result->value[P]));
-         }
+    int mid, fin;
+    for (granui=0; granui<granus; granui++) {
+      fprintf(output,"\n");
+      for (i=0; i<resultsix; i++) {
+       tabdebugf("========== start #%d granui%d %s [PARTIAL] ==========\n",
+                 i, granui, argv[i]);
+       PotentialResult ***buckets_resultsix= results[granui][i];
+       if (!buckets_resultsix) continue;
+       tabdebugf("    ");
+       for (mid=0; mid<granusz_mid[granui]; mid++) {
+         tabdebugf("|   m%-3d   ",mid);
        }
        tabdebugf("\n");
-      }
-    }
-
-    for (ap=0; ap<AP; ap++) {
-      int pos;
-      fprintf(output,"\n================== ap=%d ==================\n", ap);
-      for (pos=0; pos<nhighscores[ap]; pos++) {
-       HighScoreEntry *hs= &highscores[ap][pos];
-       PotentialResult *pr= hs->pr;
-       if (!pr) continue;
-       const int *const ports= pr->ports[ap];
-       int nports;
-       for (nports=0; nports<MAX_ROUTELEN && ports[nports]>=0; nports++);
-       int finisle= ports[nports-1]; int finarch= isle2arch(finisle);
-       int midarch= route2midarch(ports,nports);
-       fprintf(output,
-               " @%2d #%2d | start%3d mid%d f%d:%3d | %5d %5d %4d |",     \
-               pos, nhighscores[ap] - 1 - pos,
-               ports[0], midarch, finarch,finisle,                   \
-               (int)hs->value, (int)pr->value[A], (int)pr->value[P]);
-       for (i=0; i<nports; i++) fprintf(output," %d",ports[i]);
-       fprintf(output,"\n");
-      }
-    }
+       for (fin=0; fin<granusz_fin[granui]; fin++) {
+         PotentialResult **buckets_fin= buckets_resultsix[fin];
+         if (!buckets_fin) continue;
+         tabdebugf("f%-3d",fin);
+         for (mid=0; mid<granusz_mid[granui]; mid++) {
+           PotentialResult *result= buckets_fin[mid];
+           if (!result) {
+             tabdebugf("|          ");
+           } else {
+             tabdebugf("|%5d",(int)(result->value[A]));
+             tabdebugf(" ");
+             tabdebugf("%4d",(int)(result->value[P]));
+           }
+         }
+         tabdebugf("\n");
+       }
+      } /* i */
+
+      for (ap=0; ap<AP; ap++) {
+       int pos;
+       fprintf(output,"============== granui%d ap=%d ==============\n",
+               granui, ap);
+       for (pos=0; pos<nhighscores[granui][ap]; pos++) {
+         HighScoreEntry *hs= &highscores[granui][ap][pos];
+         PotentialResult *pr= hs->pr;
+         if (!pr) continue;
+         const int *const ports= pr->ports[ap];
+         int nports;
+         for (nports=0; nports<MAX_ROUTELEN && ports[nports]>=0; nports++);
+         int finisle= ports[nports-1];
+         int finarch= isle2arch(finisle);
+         int midisle= ports[nports/2];
+         int midarch= route2midarch(ports,nports);
+         fprintf(output,
+                 " @%2d #%2d | start%3d mid%d:%3d f%d:%3d | %5d %5d %4d |",
+                 pos, nhighscores[granui][ap] - 1 - pos,
+                 ports[0], midarch,midisle, finarch,finisle,
+                 (int)hs->value, (int)pr->value[A], (int)pr->value[P]);
+         for (i=0; i<nports; i++) fprintf(output," %d",ports[i]);
+         fprintf(output,"\n");
+       } /* pos */
+      } /* ap */
+    } /* granui */
     fprintf(output,"\n");
 
   } else {