5 * Copyright (c) 2009, Novell Inc.
7 * This program is licensed under the BSD license, read LICENSE.BSD
8 * for further information
21 #include "repo_solv.h"
22 #ifdef ENABLE_SUSEREPO
23 #include "repo_susetags.h"
26 #include "repo_updateinfoxml.h"
27 #include "repo_rpmmd.h"
30 #include "solverdebug.h"
32 #include "solv_xfopen.h"
35 showproblems(Solver *solv, Solvable *s, Queue *cand, Queue *badguys)
37 Pool *pool = solv->pool;
45 printf("can't install %s:\n", pool_solvable2str(pool, s));
46 while ((problem = solver_next_problem(solv, problem)) != 0)
48 solver_findallproblemrules(solv, problem, &rids);
49 for (jj = 0; jj < rids.count; jj++)
51 Id probr = rids.elements[jj];
55 solver_allruleinfos(solv, probr, &rinfo);
56 for (k = 0; k < rinfo.count; k += 4)
58 Id dep, source, target;
59 source = rinfo.elements[k + 1];
60 target = rinfo.elements[k + 2];
61 dep = rinfo.elements[k + 3];
62 switch (rinfo.elements[k])
64 case SOLVER_RULE_DISTUPGRADE:
66 case SOLVER_RULE_INFARCH:
67 printf(" %s has inferior architecture\n", pool_solvid2str(pool, source));
69 case SOLVER_RULE_UPDATE:
70 printf(" update rule for %s\n", pool_solvid2str(pool, source));
72 queue_pushunique(badguys, source);
75 /* only drop update problem packages from cand so that we see all problems of this patch */
76 for (l = 0; l < cand->count; l++)
77 if (cand->elements[l] == source || cand->elements[l] == -source)
83 for (l = 0; l < cand->count; l++)
84 if (cand->elements[l] < 0)
85 cand->elements[l] = -cand->elements[l];
88 for (l = 0; l < cand->count; l++)
89 if (cand->elements[l] == source)
91 cand->elements[l] = -source;
95 case SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM:
96 case SOLVER_RULE_JOB_UNKNOWN_PACKAGE:
97 case SOLVER_RULE_JOB_UNSUPPORTED:
100 printf(" some dependency problem\n");
102 case SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP:
103 printf(" nothing provides requested %s\n", pool_dep2str(pool, dep));
105 case SOLVER_RULE_RPM_NOT_INSTALLABLE:
106 printf(" package %s is not installable\n", pool_solvid2str(pool, source));
108 case SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP:
109 printf(" nothing provides %s needed by %s\n", pool_dep2str(pool, dep), pool_solvid2str(pool, source));
112 Reldep *rd = GETRELDEP(pool, dep);
113 if (!ISRELDEP(rd->name))
116 FOR_PROVIDES(rp, rpp, rd->name)
117 printf(" (we have %s)\n", pool_solvid2str(pool, rp));
121 case SOLVER_RULE_RPM_SAME_NAME:
122 printf(" cannot install both %s and %s\n", pool_solvid2str(pool, source), pool_solvid2str(pool, target));
124 case SOLVER_RULE_RPM_PACKAGE_CONFLICT:
125 printf(" package %s conflicts with %s provided by %s\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep), pool_solvid2str(pool, target));
127 case SOLVER_RULE_RPM_PACKAGE_OBSOLETES:
128 printf(" package %s obsoletes %s provided by %s\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep), pool_solvid2str(pool, target));
130 case SOLVER_RULE_RPM_PACKAGE_REQUIRES:
131 printf(" package %s requires %s, but none of the providers can be installed\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep));
133 case SOLVER_RULE_RPM_SELF_CONFLICT:
134 printf(" package %s conflicts with %s provided by itself\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep));
145 toinst(Solver *solv, Repo *repo, Repo *instrepo)
147 Pool *pool = solv->pool;
153 solver_get_decisionqueue(solv, &q);
154 for (k = 0; k < q.count; k++)
157 if (p < 0 || p == SYSTEMSOLVABLE)
160 /* printf(" toinstall %s\n", pool_solvid2str(pool, p));*/
162 pool->solvables[p].repo = instrepo;
168 dump_instrepo(Repo *instrepo, Pool *pool)
173 printf("instrepo..\n");
174 FOR_REPO_SOLVABLES(instrepo, p, s)
175 printf(" %s\n", pool_solvable2str(pool, s));
180 frominst(Solver *solv, Repo *repo, Repo *instrepo)
182 Pool *pool = solv->pool;
185 for (k = 1; k < pool->nsolvables; k++)
186 if (pool->solvables[k].repo == instrepo)
187 pool->solvables[k].repo = repo;
194 printf("%s: <arch> <patchnameprefix> [--install-available] [repos] [--updaterepos] [repos]...\n"
195 "\t --install-available: installation repository is available during update\n"
196 "\t repos: repository ending in\n"
197 "\t\tpackages, packages.gz, primary.xml.gz, updateinfo.xml.gz or .solv\n",
207 int install_available;
212 #define SHOW_PATCH(c) if (!(c)->shown++) printf("%s:\n", pool_solvable2str(pool, s));
213 #define PERF_DEBUGGING 0
218 test_all_old_patches_included(context_t *c, Id pid)
222 Solvable *s = pool->solvables + pid;
223 /* Test 1: are all old patches included */
224 FOR_PROVIDES(p, pp, s->name)
226 Solvable *s2 = pool->solvables + p;
231 if (pool_evrcmp(pool, s->evr, s2->evr, EVRCMP_COMPARE) <= 0)
233 conp2 = s2->repo->idarraydata + s2->conflicts;
234 while ((con2 = *conp2++) != 0)
239 rd2 = GETRELDEP(pool, con2);
240 conp = s->repo->idarraydata + s->conflicts;
241 while ((con = *conp++) != 0)
245 rd = GETRELDEP(pool, con);
246 if (rd->name == rd2->name)
252 printf(" %s contained %s\n", pool_solvable2str(pool, s2), pool_dep2str(pool, rd2->name));
256 if (pool_evrcmp(pool, rd->evr, rd2->evr, EVRCMP_COMPARE) < 0)
259 printf(" %s required newer version %s-%s of %s-%s\n",
260 pool_solvable2str(pool, s2), pool_dep2str(pool, rd2->name), pool_dep2str(pool, rd2->evr),
261 pool_dep2str(pool, rd->name), pool_dep2str(pool, rd->evr));
270 test_all_packages_installable(context_t *c, Id pid)
276 unsigned int now, solver_runs;
278 Solvable *s = pool->solvables + pid;
282 now = solv_timems(0);
285 conp = s->repo->idarraydata + s->conflicts;
286 while ((con = *conp++) != 0)
288 FOR_PROVIDES(p, pp, con)
291 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_WEAK);
294 /* also set up some minimal system */
295 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE_PROVIDES|SOLVER_WEAK);
296 queue_push(&job, pool_str2id(pool, "rpm", 1));
297 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE_PROVIDES|SOLVER_WEAK);
298 queue_push(&job, pool_str2id(pool, "aaa_base", 1));
300 solv = solver_create(pool);
301 /* solver_set_flag(solv, SOLVER_FLAG_IGNORE_RECOMMENDED, 1); */
303 if (solver_solve(solv, &job))
306 printf("error installing original package\n");
307 showproblems(solv, s, 0, 0);
309 toinst(solv, c->repo, c->instrepo);
313 dump_instrepo(instrepo, pool);
316 if (!c->install_available)
319 for (i = 1; i < c->updatestart; i++)
321 if (pool->solvables[i].repo != c->repo || i == pid)
323 queue_push(&job, SOLVER_ERASE|SOLVER_SOLVABLE);
327 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE);
328 queue_push(&job, pid);
329 solv = solver_create(pool);
330 /* solver_set_flag(solv, SOLVER_FLAG_IGNORE_RECOMMENDED, 1); */
332 if (solver_solve(solv, &job))
335 showproblems(solv, s, 0, 0);
337 frominst(solv, c->repo, c->instrepo);
343 printf(" test_all_packages_installable took %d ms in %d runs\n", solv_timems(now), solver_runs);
347 test_can_upgrade_all_packages(context_t *c, Id pid)
356 unsigned int now, solver_runs;
357 Solvable *s = pool->solvables + pid;
361 queue_init(&badguys);
363 now = solv_timems(0);
366 /* Test 3: can we upgrade all packages? */
367 for (p = 1; p < pool->nsolvables; p++)
369 Solvable *s = pool->solvables + p;
372 if (strchr(pool_id2str(pool, s->name), ':'))
373 continue; /* only packages, please */
374 if (!pool_installable(pool, s))
376 queue_push(&cand, p);
380 solv = solver_create(pool);
382 for (i = 0; i < badguys.count; i++)
384 queue_push(&job, SOLVER_ERASE|SOLVER_SOLVABLE|SOLVER_WEAK);
385 queue_push(&job, badguys.elements[i]);
387 conp = s->repo->idarraydata + s->conflicts;
388 while ((con = *conp++) != 0)
390 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE_PROVIDES|SOLVER_WEAK);
391 queue_push(&job, con);
393 for (i = 0; i < cand.count; i++)
395 p = cand.elements[i];
396 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_WEAK);
400 solver_solve(solv, &job);
402 solver_printdecisions(solv);
404 /* put packages into installed repo and prune them from cand */
405 toinst(solv, c->repo, c->instrepo);
406 for (i = 0; i < cand.count; i++)
408 p = cand.elements[i];
409 if (p > 0 && solver_get_decisionlevel(solv, p) > 0)
410 cand.elements[i] = -p; /* drop candidate */
414 /* now the interesting part: test patch */
416 if (!c->install_available)
418 for (i = 1; i < c->updatestart; i++)
420 if (pool->solvables[i].repo != c->repo || i == pid)
422 queue_push(&job, SOLVER_ERASE|SOLVER_SOLVABLE);
426 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE);
427 queue_push(&job, pid);
428 solv = solver_create(pool);
429 solver_set_flag(solv, SOLVER_FLAG_IGNORE_RECOMMENDED, 1);
431 if (solver_solve(solv, &job))
434 showproblems(solv, s, &cand, &badguys);
436 frominst(solv, c->repo, c->instrepo);
438 /* now drop all negative elements from cand */
439 for (i = j = 0; i < cand.count; i++)
441 if (cand.elements[i] < 0)
443 cand.elements[j++] = cand.elements[i];
446 break; /* no progress */
450 printf(" test_can_upgrade_all_packages took %d ms in %d runs\n", solv_timems(now), solver_runs);
454 test_no_ga_package_fulfills_dependency(context_t *c, Id pid)
457 Solvable *s = pool->solvables + pid;
459 /* Test 4: no GA package fulfills patch dependency */
460 conp = s->repo->idarraydata + s->conflicts;
461 while ((con = *conp++) != 0)
468 rd = GETRELDEP(pool, con);
469 FOR_PROVIDES(rp, rpp, rd->name)
471 Solvable *s2 = pool_id2solvable(pool, rp);
472 if (rp < c->updatestart
473 && pool_evrcmp(pool, rd->evr, s2->evr, EVRCMP_COMPARE) < 0
474 && pool_match_nevr_rel(pool, s2, rd->name)
478 printf(" conflict %s < %s satisfied by non-updated package %s\n",
479 pool_dep2str(pool, rd->name), pool_dep2str(pool, rd->evr), pool_solvable2str(pool, s2));
487 main(int argc, char **argv)
489 char *arch, *mypatch;
497 static const char* langs[] = {"en"};
499 c.install_available = 0;
507 pool = pool_create();
508 pool_setarch(pool, arch);
509 pool_set_languages(pool, langs, 1);
512 pool_setdebuglevel(pool, 2);
517 c.repo = repo_create(pool, 0);
518 c.instrepo = repo_create(pool, 0);
519 for (i = 3; i < argc; i++)
521 if (!strcmp(argv[i], "--updaterepos"))
523 c.updatestart = pool->nsolvables;
527 if (!strcmp(argv[i], "--install-available"))
529 c.install_available = 1;
534 if (!strcmp(argv[i], "-"))
536 else if ((fp = solv_xfopen(argv[i], 0)) == 0)
545 #ifdef ENABLE_SUSEREPO
546 else if (l >= 8 && !strcmp(argv[i] + l - 8, "packages"))
548 r = repo_add_susetags(c.repo, fp, 0, 0, 0);
550 else if (l >= 11 && !strcmp(argv[i] + l - 11, "packages.gz"))
552 r = repo_add_susetags(c.repo, fp, 0, 0, 0);
556 else if (l >= 14 && !strcmp(argv[i] + l - 14, "primary.xml.gz"))
558 r = repo_add_rpmmd(c.repo, fp, 0, 0);
560 else if (l >= 17 && !strcmp(argv[i] + l - 17, "updateinfo.xml.gz"))
562 r = repo_add_updateinfoxml(c.repo, fp, 0);
566 r = repo_add_solv(c.repo, fp, 0);
569 fprintf(stderr, "could not add repo %s: %s\n", argv[i], pool_errstr(pool));
576 pool_addfileprovides(pool);
578 /* bad hack ahead: clone repo */
579 c.instrepo->idarraydata = c.repo->idarraydata;
580 c.instrepo->idarraysize = c.repo->idarraysize;
581 c.instrepo->start = c.repo->start;
582 c.instrepo->end = c.repo->end;
583 c.instrepo->nsolvables = c.repo->nsolvables; /* sic! */
584 pool_set_installed(pool, c.instrepo);
585 pool_createwhatprovides(pool);
587 for (pid = 1; pid < pool->nsolvables; pid++)
591 s = pool->solvables + pid;
594 if (!pool_installable(pool, s))
596 pname = pool_id2str(pool, s->name);
597 if (strncmp(pname, "patch:", 6) != 0)
602 if (strncmp(mypatch, pname + 6, strlen(pname + 6)) != 0)
604 if (strcmp(mypatch, pname + 6) != 0)
606 l = strlen(pname + 6);
607 if (mypatch[l] != '-')
609 if (strcmp(mypatch + l + 1, pool_id2str(pool, s->evr)) != 0)
615 FOR_PROVIDES(p, pp, s->name)
617 Solvable *s2 = pool->solvables + p;
618 if (pool_evrcmp(pool, s->evr, s2->evr, EVRCMP_COMPARE) < 0)
622 /* printf("found a newer one for %s\n", pname+6); */
623 continue; /* found a newer one */
631 printf("testing patch %s-%s\n", pname + 6, pool_id2str(pool, s->evr));
634 test_all_old_patches_included(&c, pid);
635 test_all_packages_installable(&c, pid);
636 test_can_upgrade_all_packages(&c, pid);
637 test_no_ga_package_fulfills_dependency(&c, pid);