8 double max_mass=-1, max_volu=-1, max_capi=-1;
9 double distance_loss_factor_per_league;
10 int max_dist=-1, min_trade_maxprofit=0;
15 #define tabdebugf printf
18 #define CTR(x) int ctr_##x;
19 #define CTRA(x,n) int ctr_##x[n];
24 static Bucket ****results[GRANUS];
25 /* results[GRANUS][start_isle_ix][finalisle][midisle]-> */
27 static pid_t debugoutpid;
29 int main(int argc, const char **argv) {
33 const char *database=0;
34 const char *concur_base=0, *concur_rhs=0;
38 debug_flags= ~( dbg_sql2 );
43 if (arg[0] != '-') break;
44 if (!strcmp(arg,"-d")) {
46 } else if (!strcmp(arg,"-C")) {
49 concur_lim= atoi(*++argv);
50 } else if (!strcmp(arg,"-g")) {
51 granus= atoi(*++argv);
52 assert(granus>=1 && granus<=GRANUS);
54 } else if (!strcmp(arg,"-DN")) {
56 } else if (!strcmp(arg,"-D1")) {
57 debug_flags= ~(dbg_sql2|dbg_lp|dbg_value2);
65 /* glpk insists on writing stuff to stdout, and it does buffering,
66 * so we route all our debug through it this too */
68 sysassert( (realstdout= dup(1)) > 2 );
69 sysassert( output= fdopen(realstdout,"w") );
72 sysassert(! pipe(pfd) );
73 sysassert( (debugoutpid= fork()) >=0 );
75 sysassert( dup2(pfd[0],0)==0 );
76 sysassert( dup2(2,1)==1 );
77 sysassert(! close(pfd[0]) );
78 sysassert(! close(pfd[1]) );
79 sysassert(! execlp("cat","cat",(char*)0) );
81 sysassert( dup2(pfd[1],1)==1 );
82 sysassert(! close(pfd[0]) );
83 sysassert(! close(pfd[1]) );
91 sysassert( !setvbuf(debug,0,_IOLBF,0) );
93 max_mass= atof(*argv++);
94 max_volu= atof(*argv++);
95 max_capi= atof(*argv++);
96 double loss_per_league= atof(*argv++);
97 distance_loss_factor_per_league= 1.0 - loss_per_league;
99 min_trade_maxprofit= atoi(*argv++);
102 for (i=0; i<concur_lim; i++) {
103 char *concfn= masprintf("%s%02d%s", concur_base, i, concur_rhs);
105 sysassert( (concfd= open(concfn, O_RDWR|O_CREAT|O_TRUNC, 0600)) >= 0);
107 memset(&fl,0,sizeof(fl));
109 r= fcntl(concfd, F_SETLK, &fl);
111 if (!r) goto concur_ok;
112 sysassert( errno == EWOULDBLOCK );
115 fprintf(output,"@@@ concurrency limit exceeded (%d)\n", concur_lim);
119 /* deliberately leak concfd */
120 fprintf(output,"concurrency slot %d\n", i);
127 for (i=0; i<narches; i++)
128 fprintf(output,"arch %d %s\n",i,archnames[i]);
129 fprintf(output,"setup complete, starting search\n");
132 if (!strcmp(arg,"specific")) {
134 while ((arg= *argv++))
137 double val= value_route(ni, ia, 0);
138 fprintf(output, "route value is %g\n", val);
139 } else if (!strcmp(arg,"search")) {
140 for (granui=0; granui<GRANUS; granui++)
141 MCALLOC(results[granui], argc);
143 max_dist= atoi(*argv++);
145 for (ap=0; ap<AP; ap++) {
146 int nhs= atoi(*argv++);
147 for (granui=0; granui<GRANUS; granui++) {
148 nhighscores[granui][ap]= nhs;
149 MCALLOC(highscores[granui][ap], nhs);
152 const char *final_isle_spec= *argv++;
155 while ((arg= argv[resultsix])) {
156 int init_isle= atoi(arg);
159 if (!strcmp(final_isle_spec,"circ")) final_isle= init_isle;
160 else if (!strcmp(final_isle_spec,"any")) final_isle= -1;
161 else final_isle= atoi(final_isle_spec);
164 Bucket ****buckets_base_io[GRANUS];
165 for (granui=0; granui<GRANUS; granui++)
166 buckets_base_io[granui]= &results[granui][resultsix];
168 search(init_isle, final_isle, buckets_base_io);
173 for (granui=0; granui<granus; granui++) {
174 fprintf(output,"\n");
175 for (i=0; i<resultsix; i++) {
176 tabdebugf("========== start #%d granui%d %s ==========\n",
178 Bucket ***buckets_resultsix= results[granui][i];
179 if (!buckets_resultsix) continue;
181 for (mid=0; mid<granusz_mid[granui]; mid++) {
182 tabdebugf("| m%-3d ",mid);
185 for (fin=0; fin<granusz_fin[granui]; fin++) {
186 Bucket **buckets_fin= buckets_resultsix[fin];
187 if (!buckets_fin) continue;
188 tabdebugf("f%-3d",fin);
189 for (mid=0; mid<granusz_mid[granui]; mid++) {
190 Bucket *result= buckets_fin[mid];
194 tabdebugf("|%5d",(int)(result->prs[A].value[A]));
196 tabdebugf("%4d",(int)(result->prs[P].value[P]));
203 for (ap=0; ap<AP; ap++) {
205 fprintf(output,"============== granui%d ap=%d ==============\n",
207 for (pos=nhighscores[granui][ap]-1; pos>=0; pos--) {
208 HighScoreEntry *hs= &highscores[granui][ap][pos];
209 Bucket *bucket= hs->bucket;
210 if (!bucket) continue;
211 OnePotentialResult *pr= &bucket->prs[ap];
212 const int *const ports= pr->ports;
214 for (nports=0; nports<MAX_ROUTELEN && ports[nports]>=0; nports++);
215 int finisle= ports[nports-1];
216 int finarch= isle2arch(finisle);
217 int midisle= ports[nports/2];
218 int midarch= route2midarch(ports,nports);
220 " @%2d %c#%2d | start%3d mid%d:%3d f%d:%3d"
221 " | %3dlg | %5d %5d %4d |",
222 pos, "ap"[ap], nhighscores[granui][ap] - pos,
223 ports[0], midarch,midisle, finarch,finisle, pr->length,
224 (int)hs->value, (int)pr->value[A], (int)pr->value[P]);
225 for (i=0; i<nports; i++) fprintf(output," %d",ports[i]);
226 fprintf(output,"\n");
230 fprintf(output,"\n");
236 #define CTR(x) fprintf(output," %-30s %10d\n",#x,ctr_##x);
237 #define CTRA(x,n) for (i=0;i<n;i++) \
238 fprintf(output," %-27s[%d] %10d\n",#x,i,ctr_##x[i]);
243 sysassert(! fclose(debug) );
244 waitpid_check_exitstatus(debugoutpid,"debug cat",1);
246 sysassert(! fclose(output) );