9 #include "solverdebug.h"
12 static struct resultflags2str {
15 } resultflags2str[] = {
16 { TESTCASE_RESULT_TRANSACTION, "transaction" },
17 { TESTCASE_RESULT_PROBLEMS, "problems" },
18 { TESTCASE_RESULT_ORPHANED, "orphaned" },
19 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
20 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
27 fprintf(ex ? stderr : stdout, "Usage: testsolv <testcase>\n");
32 main(int argc, char **argv)
47 while ((c = getopt(argc, argv, "vrhl:")) >= 0)
70 for (; optind < argc; optind++)
73 pool_setdebuglevel(pool, debuglevel);
75 fp = fopen(argv[optind], "r");
86 solv = testcase_read(pool, fp, argv[optind], &job, &result, &resultflags);
93 if (!multijob && !feof(fp))
97 printf("test %d:\n", multijob++);
101 selection_make(pool, &job, list, SELECTION_NAME|SELECTION_PROVIDES|SELECTION_FILELIST|SELECTION_CANON|SELECTION_DOTARCH|SELECTION_REL|SELECTION_GLOB|SELECTION_FLAT);
103 printf("No match\n");
109 selection_solvables(pool, &job, &q);
110 for (i = 0; i < q.count; i++)
111 printf(" - %s\n", testcase_solvid2str(pool, q.elements[i]));
115 else if (result || writeresult)
117 char *myresult, *resultdiff;
118 solver_solve(solv, &job);
120 resultflags = TESTCASE_RESULT_TRANSACTION | TESTCASE_RESULT_PROBLEMS;
121 myresult = testcase_solverresult(solv, resultflags);
133 for (i = 0; resultflags2str[i].str; i++)
134 if ((resultflags & resultflags2str[i].flag) != 0)
136 printf(p, resultflags2str[i].str);
139 printf(" <inline>\n");
143 const char *p2 = strchr(p, '\n');
144 p2 = p2 ? p2 + 1 : p + strlen(p);
145 printf("#>%.*s", (int)(p2 - p), p);
150 printf("%s", myresult);
155 resultdiff = testcase_resultdiff(result, myresult);
158 printf("Results differ:\n%s", resultdiff);
160 solv_free(resultdiff);
168 if (solver_solve(solv, &job))
170 int problem, solution, pcnt, scnt;
171 pcnt = solver_problem_count(solv);
172 printf("Found %d problems:\n", pcnt);
173 for (problem = 1; problem <= pcnt; problem++)
175 printf("Problem %d:\n", problem);
176 solver_printprobleminfo(solv, problem);
178 scnt = solver_solution_count(solv, problem);
179 for (solution = 1; solution <= scnt; solution++)
181 printf("Solution %d:\n", solution);
182 solver_printsolution(solv, problem, solution);
189 Transaction *trans = solver_create_transaction(solv);
190 printf("Transaction summary:\n\n");
191 transaction_print(trans);
192 transaction_free(trans);