yarrg/rssearch.c

   1 /**/
   2
   3 #include "rscommon.h"
   4
   5 DEBUG_DEFINE_DEBUGF(search);
   6 DEBUG_DEFINE_SOME_DEBUGF(filter,fildebugf);
   7
   8 typedef struct Neighbour {
   9   struct Neighbour *next;
  10   int islandid;
  11   int dist;
  12 } Neighbour;
  13
  14 static Neighbour **neighbours; /* neighbours[islandid]->islandid etc. */
  15 static sqlite3_stmt *ss_neigh;
  16
  17 static int ports[MAX_ROUTELEN];
  18 static int final_isle;
  19
  20 static Neighbour *get_neighbours(int isle) {
  21   Neighbour **np= &neighbours[isle];
  22   Neighbour *head= *np;
  23   if (head) return head;
  24
  25   SQL_BIND(ss_neigh, 1, isle);
  26   while (SQL_STEP(ss_neigh)) {
  27     Neighbour *add;
  28     NEW(add);
  29     add->islandid= sqlite3_column_int(ss_neigh, 0);
  30     add->dist= sqlite3_column_int(ss_neigh, 1);
  31     add->next= head;
  32     head= add;
  33   }
  34   SQL_MUST( sqlite3_reset(ss_neigh) );
  35
  36   *np= head;
  37   return head;
  38 }
  39
  40
  41 static Bucket ***buckets_base[GRANUS];
  42
  43
  44 static double process_route(int nports, int totaldist,
  45                             double overestimate_excepting_tail) {
  46   int i, ap;
  47   int leagues_divisor= totaldist + nports;
  48
  49   ctr_routes_considered++;
  50
  51   int wrong_final= final_isle && ports[nports-1] != final_isle;
  52
  53   debugf("========== ROUTE");
  54   for (i=0; i<nports; i++)
  55     debugf(" %d",ports[i]);
  56   debugf("\n");
  57
  58   double guess[AP]={0,0};
  59   if (nports>=2) {
  60     int pair[2], i;
  61     pair[1]= ports[nports-1];
  62     guess[A]= overestimate_excepting_tail;
  63
  64     for (i=0; i<nports; i++) {
  65       pair[0]= ports[i];
  66       IslandPair *ip= ipair_get_maybe(pair[0], pair[1]);
  67       if (!ip) continue;
  68       if (ip->route_tail_value < 0) {
  69         ctr_subroute_tails_valued++;
  70         ip->route_tail_value= value_route(2, pair, pair[0]!=pair[1]);
  71       }
  72       guess[A] += ip->route_tail_value;
  73     }
  74     guess[P]= guess[A] / leagues_divisor;
  75
  76     if (wrong_final) {
  77       ctr_routes_wrongfinalelim++;
  78       debugf(" WFELIM\n");
  79       return guess[A];
  80     }
  81
  82     if (guess[A] <= highscores[granus-1][A][0].value &&
  83         guess[P] <= highscores[granus-1][P][0].value) {
  84       ctr_routes_quickelim++;
  85       debugf(" QELIM %f %f\n", guess[A], guess[P]);
  86       return guess[A];
  87     }
  88   }
  89
  90   int finisle= ports[nports-1];
  91   int finarch= isle2arch(finisle);
  92
  93   int midisle= ports[nports/2];
  94   int midarch= route2midarch(ports,nports);
  95
  96   Bucket *buckets[GRANUS];
  97   int granui;
  98   for (granui=0; granui<granus; granui++) {
  99     Bucket **buckets_fin;
 100     int mid, fin;
 101     switch (granui) {
 102     case 0: fin=finarch; mid=midarch; break;
 103     case 1: fin=finisle; mid=midarch; break;
 104     case 2: fin=finisle; mid=midisle; break;
 105     default: abort();
 106     }
 107     buckets_fin= ONDEMAND(buckets_base[granui][fin], granusz_mid[granui]);
 108     buckets[granui]= ONDEMAND(buckets_fin[mid], 1);
 109   }
 110
 111   if (nports>=2) {
 112     if (guess[A] <= buckets[0]->prs[A].value[A] &&
 113         guess[P] <= buckets[0]->prs[P].value[P]) {
 114       ctr_routes_bucketelim++;
 115       debugf(" ELIM %f %f\n", guess[A], guess[P]);
 116       return guess[A];
 117     }
 118     debugf(" COMPUTE %f %f\n", guess[A], guess[P]);
 119   }
 120
 121   ctr_routes_valued++;
 122
 123   double value[AP];
 124   value[A]= value_route(nports, ports, 0);
 125   value[P]= value[A] / leagues_divisor;
 126
 127   if (wrong_final) {
 128     ctr_routes_wrongfinal++;
 129     return value[0];
 130   }
 131
 132   for (granui=granus-1; granui>=0; granui--) {
 133     Bucket *bucket= buckets[granui];
 134
 135     if (value[A] <= bucket->prs[A].value[A] &&
 136         value[P] <= bucket->prs[P].value[P])
 137       continue;
 138
 139     debugf(" SOMEHOW %d BEST\n",granui);
 140
 141     fildebugf("granu %d f%d:%3d mid%d:%3d ",granui,
 142               finarch,finisle,midarch,midisle);
 143
 144     for (ap=0; ap<AP; ap++) {
 145       HighScoreEntry *scores= highscores[granui][ap];
 146       int nscores= nhighscores[granui][ap];
 147
 148       fildebugf("ap=%d %15f", ap, value[ap]);
 149       if (value[ap] < bucket->prs[ap].value[ap]) {
 150         debugf("      ");
 151       } else {
 152         int pos;
 153         ctr_newbests_granu[granui*AP+ap]++;
 154         memcpy(bucket->prs[ap].value, value, sizeof(value));
 155         memcpy(bucket->prs[ap].ports, ports, sizeof(*ports) * nports);
 156         if (nports < MAX_ROUTELEN-1) bucket->prs[ap].ports[nports]= -1;
 157         fildebugf("** ");
 158         for (pos=0; pos < nscores; pos++)
 159           if (scores[pos].bucket == bucket) goto found;
 160         /* not found */
 161         pos= -1;
 162       found:
 163         for (;;) {
 164           pos++;
 165           if (pos >= nscores-1) break; /* new top */
 166           if (scores[pos].value >= value[ap]) break; /* found spot */
 167           if (pos>0)
 168             scores[pos-1]= scores[pos];
 169         }
 170         pos--;
 171         if (pos>0) {
 172           scores[pos].value= value[ap];
 173           scores[pos].bucket= bucket;
 174           if (granui < granus-1 &&
 175               highscores[granui][A][0].bucket &&
 176               highscores[granui][P][0].bucket) {
 177             /* both absolute and perleague are full at this granularity,
 178              * so we don't care about anything more granular */
 179             fildebugf("\n                STOP-GRANU            ");
 180             granus= granui+1;
 181           }
 182         }
 183         fildebugf("@%2d/%2d ", pos, nscores);
 184       } /* new best */
 185     } /* ap */
 186   } /* granui */
 187
 188   fildebugf(" route");
 189
 190   for (i=0; i<nports; i++)
 191     fildebugf(" %d",ports[i]);
 192   fildebugf("\n");
 193
 194   return value[0];
 195 }
 196
 197 static void recurse(int last_isle,
 198                     int nports /* excluding last_isle */,
 199                     int totaldist /* including last_isle */,
 200                     double last_estimate) {
 201   ports[nports++]= last_isle;
 202   double estimate= process_route(nports, totaldist, last_estimate);
 203   if (nports >= MAX_ROUTELEN) return;
 204
 205   Neighbour *add;
 206   for (add= get_neighbours(last_isle); add; add=add->next) {
 207     int newdist= totaldist + add->dist;
 208     if (newdist > max_dist) continue;
 209
 210     recurse(add->islandid, nports, newdist, estimate);
 211   }
 212 }
 213
 214 void search(int start_isle, int final_isle_spec,
 215             Bucket ****buckets_base_io[GRANUS]) {
 216   int granui;
 217   for (granui=0; granui<GRANUS; granui++)
 218     buckets_base[granui]=
 219       ONDEMAND(*buckets_base_io[granui], granusz_fin[granui]);
 220
 221   final_isle= final_isle_spec <= 0 ? 0 : final_isle_spec;
 222   recurse(start_isle,0,0,1e6);
 223 }
 224
 225 int nhighscores[GRANUS][AP];
 226 HighScoreEntry *highscores[GRANUS][AP];
 227 int granus=GRANUS, granusz_fin[GRANUS], granusz_mid[GRANUS];
 228
 229 int narches;
 230 char **archnames;
 231 int *islandid2arch;
 232
 233 void setup_search(void) {
 234   MCALLOC(neighbours, islandtablesz);
 235
 236   SQL_PREPARE(ss_neigh,
 237               "SELECT biid, dist FROM routes WHERE aiid=?");
 238
 239   int max_narches=
 240     sql_single_int(" SELECT count(*) FROM (\n"
 241                    "  SELECT DISTINCT archipelago\n"
 242                    "   FROM islands\n"
 243                    "  )");
 244   MCALLOC(archnames, max_narches);
 245   MCALLOC_INITEACH(islandid2arch, islandtablesz, *this=-1);
 246
 247   sqlite3_stmt *archs;
 248   SQL_PREPARE(archs,
 249               " SELECT islandid, archipelago\n"
 250               "  FROM islands\n"
 251               "  ORDER BY archipelago");
 252   while (SQL_STEP(archs)) {
 253     int isle= sqlite3_column_int(archs,0);
 254     const char *archname= (const char*)sqlite3_column_text(archs,1);
 255     int arch;
 256     for (arch=0; arch<narches; arch++)
 257       if (!strcmp(archnames[arch], archname)) goto found;
 258     assert(narches < max_narches);
 259     arch= narches++;
 260     archnames[arch]= masprintf("%s",archname);
 261   found:
 262     islandid2arch[isle]= arch;
 263   }
 264   sqlite3_finalize(archs);
 265
 266   granusz_fin[0]=                granusz_mid[0]= narches;
 267   granusz_fin[1]= islandtablesz; granusz_mid[1]= narches;
 268   granusz_fin[2]=                granusz_mid[2]= islandtablesz;
 269 }