void problem_ruleinfos_iterate( Problem *problem, int (*callback)(Ruleinfo *ri, void *user_data), void *user_data ) { #if SATSOLVER_VERSION > 1600 Queue rules; Id rule; queue_init(&rules); solver_findallproblemrules(problem->solver, problem->id, &rules); while ((rule = queue_shift(&rules))) { Ruleinfo *ri = ruleinfo_new( problem->solver, rule, problem->request ); if (callback( ri, user_data )) break; } #endif return; }
int main(int argc, char **argv) { Pool *pool; Queue job; Queue solq; Solver *solv; char *result = 0; int resultflags = 0; int debuglevel = 0; int writeresult = 0; int multijob = 0; int rescallback = 0; int c; int ex = 0; const char *list = 0; FILE *fp; const char *p; queue_init(&solq); while ((c = getopt(argc, argv, "vmrhl:s:")) >= 0) { switch (c) { case 'v': debuglevel++; break; case 'r': writeresult++; break; case 'm': rescallback = 1; break; case 'h': usage(0); break; case 'l': list = optarg; break; case 's': if ((p = strchr(optarg, ':'))) queue_push2(&solq, atoi(optarg), atoi(p + 1)); else queue_push2(&solq, 1, atoi(optarg)); break; default: usage(1); break; } } if (optind == argc) usage(1); for (; optind < argc; optind++) { pool = pool_create(); pool_setdebuglevel(pool, debuglevel); fp = fopen(argv[optind], "r"); if (!fp) { perror(argv[optind]); exit(0); } while (!feof(fp)) { queue_init(&job); result = 0; resultflags = 0; solv = testcase_read(pool, fp, argv[optind], &job, &result, &resultflags); if (!solv) { pool_free(pool); exit(1); } if (!multijob && !feof(fp)) multijob = 1; if (multijob) printf("test %d:\n", multijob++); if (list) { queue_empty(&job); selection_make(pool, &job, list, SELECTION_NAME|SELECTION_PROVIDES|SELECTION_FILELIST|SELECTION_CANON|SELECTION_DOTARCH|SELECTION_REL|SELECTION_GLOB|SELECTION_FLAT); if (!job.elements) printf("No match\n"); else { Queue q; int i; queue_init(&q); selection_solvables(pool, &job, &q); for (i = 0; i < q.count; i++) printf(" - %s\n", testcase_solvid2str(pool, q.elements[i])); queue_free(&q); } } else if (result || writeresult) { char *myresult, *resultdiff; struct reportsolutiondata reportsolutiondata; memset(&reportsolutiondata, 0, sizeof(reportsolutiondata)); if (rescallback) { solv->solution_callback = reportsolutioncb; solv->solution_callback_data = &reportsolutiondata; } solver_solve(solv, &job); solv->solution_callback = 0; solv->solution_callback_data = 0; if (!resultflags) resultflags = TESTCASE_RESULT_TRANSACTION | TESTCASE_RESULT_PROBLEMS; myresult = testcase_solverresult(solv, resultflags); if (rescallback && reportsolutiondata.result) { reportsolutiondata.result = solv_dupjoin(reportsolutiondata.result, myresult, 0); solv_free(myresult); myresult = reportsolutiondata.result; } if (writeresult) { if (*myresult) { if (writeresult > 1) { const char *p; int i; printf("result "); p = "%s"; for (i = 0; resultflags2str[i].str; i++) if ((resultflags & resultflags2str[i].flag) != 0) { printf(p, resultflags2str[i].str); p = ",%s"; } printf(" <inline>\n"); p = myresult; while (*p) { const char *p2 = strchr(p, '\n'); p2 = p2 ? p2 + 1 : p + strlen(p); printf("#>%.*s", (int)(p2 - p), p); p = p2; } } else printf("%s", myresult); } } else { resultdiff = testcase_resultdiff(result, myresult); if (resultdiff) { printf("Results differ:\n%s", resultdiff); ex = 1; solv_free(resultdiff); } } solv_free(result); solv_free(myresult); } else { int pcnt = solver_solve(solv, &job); if (pcnt && solq.count) { int i, taken = 0; for (i = 0; i < solq.count; i += 2) { if (solq.elements[i] > 0 && solq.elements[i] <= pcnt) if (solq.elements[i + 1] > 0 && solq.elements[i + 1] <= solver_solution_count(solv, solq.elements[i])) { printf("problem %d: taking solution %d\n", solq.elements[i], solq.elements[i + 1]); solver_take_solution(solv, solq.elements[i], solq.elements[i + 1], &job); taken = 1; } } if (taken) pcnt = solver_solve(solv, &job); } if (pcnt) { int problem, solution, scnt; printf("Found %d problems:\n", pcnt); for (problem = 1; problem <= pcnt; problem++) { printf("Problem %d:\n", problem); #if 1 solver_printprobleminfo(solv, problem); #else { Queue pq; int j; queue_init(&pq); solver_findallproblemrules(solv, problem, &pq); for (j = 0; j < pq.count; j++) solver_printproblemruleinfo(solv, pq.elements[j]); queue_free(&pq); } #endif printf("\n"); scnt = solver_solution_count(solv, problem); for (solution = 1; solution <= scnt; solution++) { printf("Solution %d:\n", solution); solver_printsolution(solv, problem, solution); printf("\n"); } } } else { Transaction *trans = solver_create_transaction(solv); printf("Transaction summary:\n\n"); transaction_print(trans); transaction_free(trans); } } queue_free(&job); solver_free(solv); } pool_free(pool); fclose(fp); } queue_free(&solq); exit(ex); }