2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * SAT based dependency solver
26 #define RULES_BLOCK 63
30 solver_dep_installed(Solver *solv, Id dep)
32 /* disable for now, splitprovides don't work anyway and it breaks
35 Pool *pool = solv->pool;
40 Reldep *rd = GETRELDEP(pool, dep);
41 if (rd->flags == REL_AND)
43 if (!solver_dep_installed(solv, rd->name))
45 return solver_dep_installed(solv, rd->evr);
47 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
48 return solver_dep_installed(solv, rd->evr);
50 FOR_PROVIDES(p, pp, dep)
52 if (p == SYSTEMSOLVABLE || (solv->installed && pool->solvables[p].repo == solv->installed))
60 /* this mirrors solver_dep_fulfilled but uses map m instead of the decisionmap */
62 dep_possible(Solver *solv, Id dep, Map *m)
64 Pool *pool = solv->pool;
69 Reldep *rd = GETRELDEP(pool, dep);
70 if (rd->flags == REL_AND)
72 if (!dep_possible(solv, rd->name, m))
74 return dep_possible(solv, rd->evr, m);
76 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
77 return solver_dep_installed(solv, rd->evr);
79 FOR_PROVIDES(p, pp, dep)
87 /*-----------------------------------------------------------------*/
94 printruleelement(Solver *solv, Rule *r, Id v)
96 Pool *pool = solv->pool;
100 s = pool->solvables + -v;
101 printf(" !%s-%s.%s [%d]", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), -v);
105 s = pool->solvables + v;
106 printf(" %s-%s.%s [%d]", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), v);
115 if (solv->decisionmap[s - pool->solvables] > 0)
116 printf(" Install.level%d", solv->decisionmap[s - pool->solvables]);
117 if (solv->decisionmap[s - pool->solvables] < 0)
118 printf(" Conflict.level%d", -solv->decisionmap[s - pool->solvables]);
120 printf(" (disabled)");
130 printrule(Solver *solv, Rule *r)
135 if (r >= solv->rules && r < solv->rules + solv->nrules) /* r is a solver rule */
136 printf("Rule #%d:\n", (int)(r - solv->rules));
138 printf("Rule:\n"); /* r is any rule */
143 else if (r->d == ID_NULL)
150 v = solv->pool->whatprovidesdata[r->d + i - 1];
153 printruleelement(solv, r, v);
155 printf(" next: %d %d\n", r->n1, r->n2);
159 /*-----------------------------------------------------------------*/
165 static Pool *unifyrules_sortcmp_data;
168 * compare rules for unification sort
172 unifyrules_sortcmp(const void *ap, const void *bp)
174 Pool *pool = unifyrules_sortcmp_data;
175 Rule *a = (Rule *)ap;
176 Rule *b = (Rule *)bp;
182 return x; /* p differs */
185 if (a->d == 0 && b->d == 0)
186 return a->w2 - b->w2; /* assertion: return w2 diff */
188 if (a->d == 0) /* a is assertion, b not */
190 x = a->w2 - pool->whatprovidesdata[b->d];
194 if (b->d == 0) /* b is assertion, a not */
196 x = pool->whatprovidesdata[a->d] - b->w2;
200 /* compare whatprovidesdata */
201 ad = pool->whatprovidesdata + a->d;
202 bd = pool->whatprovidesdata + b->d;
204 if ((x = *ad++ - *bd++) != 0)
215 unifyrules(Solver *solv)
220 if (solv->nrules <= 1) /* nothing to unify */
223 if (solv->pool->verbose > 3)
224 printf ("----- unifyrules -----\n");
226 /* sort rules first */
227 unifyrules_sortcmp_data = solv->pool;
228 qsort(solv->rules + 1, solv->nrules - 1, sizeof(Rule), unifyrules_sortcmp);
235 for (i = j = 1, ir = solv->rules + 1; i < solv->nrules; i++, ir++)
237 if (jr && !unifyrules_sortcmp(ir, jr))
238 continue; /* prune! */
239 jr = solv->rules + j++; /* keep! */
244 /* reduced count from nrules to j rules */
245 if (solv->pool->verbose) printf("pruned rules from %d to %d\n", solv->nrules, j);
247 /* adapt rule buffer */
248 solv->rules = (Rule *)xrealloc(solv->rules, ((solv->nrules + RULES_BLOCK) & ~RULES_BLOCK) * sizeof(Rule));
251 if (solv->pool->verbose)
258 for (i = 1; i < solv->nrules; i++)
265 dp = solv->pool->whatprovidesdata + r->d;
270 printf(" binary: %d\n", binr);
271 printf(" normal: %d, %d literals\n", solv->nrules - 1 - binr, lits);
274 if (solv->pool->verbose > 3)
275 printf ("----- unifyrules end -----\n");
285 hashrule(Solver *solv, Id p, Id d, int n)
287 unsigned int x = (unsigned int)p;
291 return (x * 37) ^ (unsigned int)d;
292 dp = solv->pool->whatprovidesdata + d;
294 x = (x * 37) ^ (unsigned int)*dp++;
302 * p = direct literal; always < 0 for installed rpm rules
303 * d, if < 0 direct literal, if > 0 offset into whatprovides, if == 0 rule is assertion (look at p only)
306 * A requires b, b provided by B1,B2,B3 => (-A|B1|B2|B3)
308 * p < 0 : pkg id of A
309 * d > 0 : Offset in whatprovidesdata (list of providers of b)
311 * A conflicts b, b provided by B1,B2,B3 => (-A|-B1), (-A|-B2), (-A|-B3)
312 * p < 0 : pkg id of A
313 * d < 0 : Id of solvable (e.g. B1)
315 * d == 0: unary rule, assertion => (A) or (-A)
317 * Install: p > 0, d = 0 (A) user requested install
318 * Remove: p < 0, d = 0 (-A) user requested remove
319 * Requires: p < 0, d > 0 (-A|B1|B2|...) d: <list of providers for requirement of p>
320 * Updates: p > 0, d > 0 (A|B1|B2|...) d: <list of updates for solvable p>
321 * Conflicts: p < 0, d < 0 (-A|-B) either p (conflict issuer) or d (conflict provider)
322 * ? p > 0, d < 0 (A|-B)
323 * No-op ?: p = 0, d = 0 (null) (used as policy rule placeholder)
325 * always returns a rule for non-rpm rules
329 addrule(Solver *solv, Id p, Id d)
334 int n = 0; /* number of literals in rule - 1
335 0 = direct assertion (single literal)
339 /* it often happenes that requires lead to adding the same rpm rule
340 * multiple times, so we prune those duplicates right away to make
341 * the work for unifyrules a bit easier */
343 if (solv->nrules && !solv->jobrules)
345 r = solv->rules + solv->nrules - 1; /* get the last added rule */
346 if (r->p == p && r->d == d && d != 0) /* identical and not user requested */
352 /* always a binary rule */
354 return 0; /* ignore self conflict */
359 for (dp = solv->pool->whatprovidesdata + d; *dp; dp++, n++)
361 return 0; /* rule is self-fulfilling */
366 if (n == 0 && !solv->jobrules)
368 /* this is a rpm rule assertion, we do not have to allocate it */
369 /* it can be identified by a level of 1 and a zero reason */
370 /* we must not drop those rules from the decisionq when rewinding! */
373 if (solv->decisionmap[-p] > 0 || solv->decisionmap[-p] < -1)
375 if (solv->decisionmap[-p])
376 return 0; /* already got that one */
377 queue_push(&solv->decisionq, p);
378 queue_push(&solv->decisionq_why, 0);
379 solv->decisionmap[-p] = -1;
384 /* smallest literal first so we can find dups */
388 n = 1; /* re-set n, was used as temp var */
391 /* check if the last added rule is exactly the same as what we're looking for. */
392 if (r && n == 1 && !r->d && r->p == p && r->w2 == d)
395 if (r && n > 1 && r->d && r->p == p)
400 dp2 = solv->pool->whatprovidesdata + r->d;
401 for (dp = solv->pool->whatprovidesdata + d; *dp; dp++, dp2++)
412 /* check and extend rule buffer */
413 if ((solv->nrules & RULES_BLOCK) == 0)
415 solv->rules = (Rule *)xrealloc(solv->rules, (solv->nrules + (RULES_BLOCK + 1)) * sizeof(Rule));
418 r = solv->rules + solv->nrules++; /* point to rule space */
423 /* direct assertion, no watch needed */
439 r->w2 = solv->pool->whatprovidesdata[d];
444 if (solv->pool->verbose > 3)
446 printf (" Add rule: ");
454 disablerule(Solver *solv, Rule *r)
460 enablerule(Solver *solv, Rule *r)
462 if (r->d == 0 || r->w2 != r->p)
465 r->w1 = solv->pool->whatprovidesdata[r->d];
469 /**********************************************************************************/
471 /* a problem is an item on the solver's problem list. It can either be >0, in that
472 * case it is a system (upgrade) rule, or it can be <0, which makes it refer to a job
473 * consisting of multiple job rules.
477 disableproblem(Solver *solv, Id v)
485 disablerule(solv, solv->rules + v);
489 jp = solv->ruletojob.elements;
490 for (i = solv->jobrules, r = solv->rules + i; i < solv->systemrules; i++, r++, jp++)
492 disablerule(solv, r);
496 enableproblem(Solver *solv, Id v)
504 enablerule(solv, solv->rules + v);
508 jp = solv->ruletojob.elements;
509 for (i = solv->jobrules, r = solv->rules + i; i < solv->systemrules; i++, r++, jp++)
515 printproblem(Solver *solv, Id v)
522 printrule(solv, solv->rules + v);
526 printf("JOB %d\n", v);
527 jp = solv->ruletojob.elements;
528 for (i = solv->jobrules, r = solv->rules + i; i < solv->systemrules; i++, r++, jp++)
539 /**********************************************************************************/
541 /* go through system and job rules and add direct assertions
542 * to the decisionqueue. If we find a conflict, disable rules and
543 * add them to problem queue.
546 makeruledecisions(Solver *solv)
553 /* no learnt rules for now */
554 if (solv->learntrules && solv->learntrules != solv->nrules)
557 decisionstart = solv->decisionq.count;
558 /* the loop is over jobrules, system rules and weak rules */
559 for (ri = solv->jobrules, r = solv->rules + ri; ri < solv->nrules; ri++, r++)
565 if (solv->decisionmap[vv] == 0)
567 queue_push(&solv->decisionq, v);
568 queue_push(&solv->decisionq_why, r - solv->rules);
569 solv->decisionmap[vv] = v > 0 ? 1 : -1;
572 if (v > 0 && solv->decisionmap[vv] > 0)
574 if (v < 0 && solv->decisionmap[vv] < 0)
576 /* found a conflict! */
577 /* if we are weak, just disable ourself */
578 if (ri >= solv->weakrules)
580 printf("conflict, but I am weak, disabling ");
585 /* only job and system rules left */
586 for (i = 0; i < solv->decisionq.count; i++)
587 if (solv->decisionq.elements[i] == -v)
589 if (i == solv->decisionq.count)
591 if (solv->decisionq_why.elements[i] == 0)
593 /* conflict with rpm rule, need only disable our rule */
594 printf("conflict with rpm rule, disabling rule #%d\n", ri);
595 if (v < 0 && v != -SYSTEMSOLVABLE)
597 queue_push(&solv->problems, 0);
598 if (v == -SYSTEMSOLVABLE)
599 queue_push(&solv->problems, 0); /* sigh, we don't have a rule for that */
601 queue_push(&solv->problems, -v); /* sigh, we don't have a rule for that */
603 if (ri < solv->systemrules)
604 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
605 queue_push(&solv->problems, v);
606 disableproblem(solv, v);
607 queue_push(&solv->problems, 0);
610 /* conflict with another job or system rule */
611 /* remove old decision */
612 printf("conflicting system/job rules over literal %d\n", vv);
613 queue_push(&solv->problems, 0);
614 queue_push(&solv->problems, solv->decisionq_why.elements[i]);
615 /* push all of our rules asserting this literal on the problem stack */
616 for (i = solv->jobrules, rr = solv->rules + i; i < solv->nrules; i++, rr++)
618 if (!rr->w1 || rr->w2)
620 if (rr->p != v && rr->p != -v)
622 printf(" - disabling rule #%d\n", i);
624 if (i < solv->systemrules)
625 v = -(solv->ruletojob.elements[i - solv->jobrules] + 1);
626 queue_push(&solv->problems, v);
627 disableproblem(solv, v);
629 queue_push(&solv->problems, 0);
632 while (solv->decisionq.count > decisionstart)
634 v = solv->decisionq.elements[--solv->decisionq.count];
635 --solv->decisionq_why.count;
637 solv->decisionmap[vv] = 0;
639 ri = solv->jobrules - 1;
640 r = solv->rules + ri;
645 /* FIXME: bad code ahead, replace as soon as possible */
647 disableupdaterules(Solver *solv, Queue *job, int jobidx)
649 Pool *pool = solv->pool;
651 Id how, what, p, *pp;
657 installed = solv->installed;
663 how = job->elements[jobidx];
666 case SOLVER_INSTALL_SOLVABLE:
667 case SOLVER_ERASE_SOLVABLE:
668 case SOLVER_ERASE_SOLVABLE_NAME:
669 case SOLVER_ERASE_SOLVABLE_PROVIDES:
675 /* go through all enabled job rules */
676 MAPZERO(&solv->noupdate);
677 for (i = solv->jobrules; i < solv->systemrules; i++)
680 if (!r->w1) /* disabled? */
682 j = solv->ruletojob.elements[i - solv->jobrules];
686 how = job->elements[j];
687 what = job->elements[j + 1];
690 case SOLVER_INSTALL_SOLVABLE: /* install specific solvable */
691 s = pool->solvables + what;
692 FOR_PROVIDES(p, pp, s->name)
694 if (pool->solvables[p].name != s->name)
696 if (pool->solvables[p].repo == installed)
697 MAPSET(&solv->noupdate, p - installed->start);
700 case SOLVER_ERASE_SOLVABLE:
701 s = pool->solvables + what;
702 if (s->repo == installed)
703 MAPSET(&solv->noupdate, what - installed->start);
705 case SOLVER_ERASE_SOLVABLE_NAME: /* remove by capability */
706 case SOLVER_ERASE_SOLVABLE_PROVIDES:
707 FOR_PROVIDES(p, pp, what)
709 if (how == SOLVER_ERASE_SOLVABLE_NAME && pool->solvables[p].name != what)
711 if (pool->solvables[p].repo == installed)
712 MAPSET(&solv->noupdate, p - installed->start);
720 /* fixup update rule status */
721 if (solv->allowuninstall)
722 return; /* no update rules at all */
726 /* we just disabled job #jobidx. enable all update rules
727 * that aren't disabled by the remaining job rules */
728 how = job->elements[jobidx];
729 what = job->elements[jobidx + 1];
732 case SOLVER_INSTALL_SOLVABLE:
733 s = pool->solvables + what;
734 FOR_PROVIDES(p, pp, s->name)
736 if (pool->solvables[p].name != s->name)
738 if (pool->solvables[p].repo != installed)
740 if (MAPTST(&solv->noupdate, p - installed->start))
742 r = solv->rules + solv->systemrules + (p - installed->start);
748 printf("@@@ re-enabling ");
753 case SOLVER_ERASE_SOLVABLE:
754 s = pool->solvables + what;
755 if (s->repo != installed)
757 if (MAPTST(&solv->noupdate, what - installed->start))
759 r = solv->rules + solv->systemrules + (what - installed->start);
765 printf("@@@ re-enabling ");
769 case SOLVER_ERASE_SOLVABLE_NAME: /* remove by capability */
770 case SOLVER_ERASE_SOLVABLE_PROVIDES:
771 FOR_PROVIDES(p, pp, what)
773 if (how == SOLVER_ERASE_SOLVABLE_NAME && pool->solvables[p].name != what)
775 if (pool->solvables[p].repo != installed)
777 if (MAPTST(&solv->noupdate, p - installed->start))
779 r = solv->rules + solv->systemrules + (p - installed->start);
785 printf("@@@ re-enabling ");
796 for (i = 0; i < installed->nsolvables; i++)
798 r = solv->rules + solv->systemrules + i;
799 if (r->w1 && MAPTST(&solv->noupdate, i))
800 r->w1 = 0; /* was enabled, need to disable */
806 * add (install) rules for solvable
807 * for unfulfilled requirements, conflicts, obsoletes,....
808 * "unflag" a resolvable if it is not installable via "addrule(solv, -n, 0)"
812 addrpmrulesforsolvable(Solver *solv, Solvable *s, Map *m)
814 Pool *pool = solv->pool;
815 Repo *installed = solv->installed;
829 if (solv->pool->verbose > 3)
830 printf ("----- addrpmrulesforsolvable -----\n");
832 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
833 queue_push(&q, s - pool->solvables); /* push solvable Id */
839 * s: Pointer to solvable
843 if (MAPTST(m, n)) /* continue if already done */
847 s = pool->solvables + n; /* s = Solvable in question */
850 if (installed /* Installed system available */
851 && !solv->fixsystem /* NOT repair errors in rpm dependency graph */
852 && s->repo == installed) /* solvable is installed? */
854 dontfix = 1; /* dont care about broken rpm deps */
857 /*-----------------------------------------
858 * check requires of s
863 reqp = s->repo->idarraydata + s->requires;
864 while ((req = *reqp++) != 0) /* go throw all requires */
866 if (req == SOLVABLE_PREREQMARKER) /* skip the marker */
869 dp = GET_PROVIDESP(req, p); /* get providers of req; p is a dummy only */
871 if (*dp == SYSTEMSOLVABLE) /* always installed */
876 /* the strategy here is to not insist on dependencies
877 * that are already broken. so if we find one provider
878 * that was already installed, we know that the
879 * dependency was not broken before so we enforce it */
880 for (i = 0; (p = dp[i]) != 0; i++) /* for all providers */
882 if (pool->solvables[p].repo == installed)
883 break; /* provider was installed */
885 if (!p) /* previously broken dependency */
888 printf("ignoring broken requires %s of installed package %s-%s.%s\n", dep2str(pool, req), id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
895 /* nothing provides req! */
897 printf("package %s-%s.%s [%d] is not installable (%s)\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), (Id)(s - pool->solvables), dep2str(pool, req));
898 addrule(solv, -n, 0); /* mark requestor as uninstallable */
900 printf(">!> !unflag %s-%s.%s[%s]\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), repo_name(s->repo));
904 if (pool->verbose > 2)
906 printf(" %s-%s.%s requires %s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), dep2str(pool, req));
907 for (i = 0; dp[i]; i++)
908 printf(" provided by %s-%s.%s\n", id2str(pool, pool->solvables[dp[i]].name), id2str(pool, pool->solvables[dp[i]].evr), id2str(pool, pool->solvables[dp[i]].arch));
911 /* add 'requires' dependency */
912 /* rule: (-requestor|provider1|provider2|...|providerN) */
913 addrule(solv, -n, dp - pool->whatprovidesdata);
915 /* descend the dependency tree */
916 for (; *dp; dp++) /* loop through all providers */
922 } /* while, requirements of n */
924 } /* if, requirements */
927 /*-----------------------------------------
928 * check conflicts of s
933 conp = s->repo->idarraydata + s->conflicts;
934 while ((con = *conp++) != 0)
936 FOR_PROVIDES(p, pp, con)
938 /* dontfix: dont care about conflicts with already installed packs */
939 if (dontfix && pool->solvables[p].repo == installed)
941 /* rule: -n|-p: either solvable _or_ provider of conflict */
942 addrule(solv, -n, -p);
947 /*-----------------------------------------
948 * check obsoletes if not installed
950 if (!installed || pool->solvables[n].repo != installed)
951 { /* not installed */
954 obsp = s->repo->idarraydata + s->obsoletes;
955 while ((obs = *obsp++) != 0)
957 FOR_PROVIDES(p, pp, obs)
958 addrule(solv, -n, -p);
961 FOR_PROVIDES(p, pp, s->name)
963 if (s->name == pool->solvables[p].name)
964 addrule(solv, -n, -p);
968 /*-----------------------------------------
969 * add recommends to the rule list
973 recp = s->repo->idarraydata + s->recommends;
974 while ((rec = *recp++) != 0)
976 FOR_PROVIDES(p, pp, rec)
983 sugp = s->repo->idarraydata + s->suggests;
984 while ((sug = *sugp++) != 0)
986 FOR_PROVIDES(p, pp, sug)
996 addrpmrulesforweak(Solver *solv, Map *m)
998 Pool *pool = solv->pool;
1003 if (solv->pool->verbose > 3)
1004 printf ("----- addrpmrulesforweak -----\n");
1005 for (i = n = 1; n < pool->nsolvables; i++, n++)
1007 if (i == pool->nsolvables)
1011 s = pool->solvables + i;
1012 if (!pool_installable(pool, s))
1017 supp = s->repo->idarraydata + s->supplements;
1018 while ((sup = *supp++) != ID_NULL)
1019 if (dep_possible(solv, sup, m))
1022 if (!sup && s->freshens)
1024 supp = s->repo->idarraydata + s->freshens;
1025 while ((sup = *supp++) != ID_NULL)
1026 if (dep_possible(solv, sup, m))
1029 if (!sup && s->enhances)
1031 supp = s->repo->idarraydata + s->enhances;
1032 while ((sup = *supp++) != ID_NULL)
1033 if (dep_possible(solv, sup, m))
1038 addrpmrulesforsolvable(solv, s, m);
1044 addrpmrulesforupdaters(Solver *solv, Solvable *s, Map *m, int allowall)
1046 Pool *pool = solv->pool;
1051 if (solv->pool->verbose > 3)
1052 printf ("----- addrpmrulesforupdaters -----\n");
1054 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1055 policy_findupdatepackages(solv, s, &qs, allowall);
1056 if (!MAPTST(m, s - pool->solvables)) /* add rule for s if not already done */
1057 addrpmrulesforsolvable(solv, s, m);
1058 for (i = 0; i < qs.count; i++)
1059 if (!MAPTST(m, qs.elements[i]))
1060 addrpmrulesforsolvable(solv, pool->solvables + qs.elements[i], m);
1065 * add rule for update
1066 * (A|A1|A2|A3...) An = update candidates for A
1068 * s = (installed) solvable
1072 addupdaterule(Solver *solv, Solvable *s, int allowall)
1074 /* installed packages get a special upgrade allowed rule */
1075 Pool *pool = solv->pool;
1080 if (solv->pool->verbose > 3)
1081 printf ("----- addupdaterule -----\n");
1083 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1084 policy_findupdatepackages(solv, s, &qs, allowall);
1085 if (qs.count == 0) /* no updaters found */
1088 d = pool_queuetowhatprovides(pool, &qs); /* intern computed queue */
1090 addrule(solv, s - pool->solvables, d); /* allow update of s */
1094 /*-----------------------------------------------------------------*/
1101 * initial setup for all watches
1105 makewatches(Solver *solv)
1109 int nsolvables = solv->pool->nsolvables;
1111 xfree(solv->watches);
1112 /* lower half for removals, upper half for installs */
1113 solv->watches = (Id *)xcalloc(2 * nsolvables, sizeof(Id));
1115 /* do it reverse so rpm rules get triggered first */
1116 for (i = 1, r = solv->rules + solv->nrules - 1; i < solv->nrules; i++, r--)
1118 for (i = 1, r = solv->rules + 1; i < solv->nrules; i++, r++)
1121 if (!r->w1 /* rule is disabled */
1122 || !r->w2) /* rule is assertion */
1125 /* see addwatches(solv, r) */
1126 r->n1 = solv->watches[nsolvables + r->w1];
1127 solv->watches[nsolvables + r->w1] = r - solv->rules;
1129 r->n2 = solv->watches[nsolvables + r->w2];
1130 solv->watches[nsolvables + r->w2] = r - solv->rules;
1136 * add watches (for rule)
1140 addwatches(Solver *solv, Rule *r)
1142 int nsolvables = solv->pool->nsolvables;
1144 r->n1 = solv->watches[nsolvables + r->w1];
1145 solv->watches[nsolvables + r->w1] = r - solv->rules;
1147 r->n2 = solv->watches[nsolvables + r->w2];
1148 solv->watches[nsolvables + r->w2] = r - solv->rules;
1152 /*-----------------------------------------------------------------*/
1153 /* rule propagation */
1155 #define DECISIONMAP_TRUE(p) ((p) > 0 ? (decisionmap[p] > 0) : (decisionmap[-p] < 0))
1160 * propagate decision to all rules
1164 propagate(Solver *solv, int level)
1166 Pool *pool = solv->pool;
1171 Id *decisionmap = solv->decisionmap;
1172 Id *watches = solv->watches + pool->nsolvables;
1174 while (solv->propagate_index < solv->decisionq.count)
1176 /* negate because our watches trigger if literal goes FALSE */
1177 pkg = -solv->decisionq.elements[solv->propagate_index++];
1178 if (pool->verbose > 3)
1180 printf("popagate for decision %d level %d\n", -pkg, level);
1181 printruleelement(solv, 0, -pkg);
1184 for (rp = watches + pkg; *rp; rp = nrp)
1186 r = solv->rules + *rp;
1188 if (pool->verbose > 3)
1190 printf(" watch triggered ");
1204 /* if clause is TRUE, nothing to do */
1205 if (DECISIONMAP_TRUE(ow))
1210 /* not a binary clause, check if we need to move our watch */
1211 if (r->p && r->p != ow && !DECISIONMAP_TRUE(-r->p))
1214 for (dp = pool->whatprovidesdata + r->d; (p = *dp++) != 0;)
1215 if (p != ow && !DECISIONMAP_TRUE(-p))
1219 /* p is free to watch, move watch to p */
1220 if (pool->verbose > 3)
1223 printf(" -> move w%d to %s-%s.%s\n", (pkg == r->w1 ? 1 : 2), id2str(pool, pool->solvables[p].name), id2str(pool, pool->solvables[p].evr), id2str(pool, pool->solvables[p].arch));
1225 printf(" -> move w%d to !%s-%s.%s\n", (pkg == r->w1 ? 1 : 2), id2str(pool, pool->solvables[-p].name), id2str(pool, pool->solvables[-p].evr), id2str(pool, pool->solvables[-p].arch));
1239 watches[p] = r - solv->rules;
1243 /* unit clause found, set other watch to TRUE */
1244 if (DECISIONMAP_TRUE(-ow))
1245 return r; /* eek, a conflict! */
1246 if (pool->verbose > 2)
1252 decisionmap[ow] = level;
1254 decisionmap[-ow] = -level;
1255 queue_push(&solv->decisionq, ow);
1256 queue_push(&solv->decisionq_why, r - solv->rules);
1257 if (pool->verbose > 3)
1259 Solvable *s = pool->solvables + (ow > 0 ? ow : -ow);
1261 printf(" -> decided to install %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
1263 printf(" -> decided to conflict %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
1267 return 0; /* all is well */
1271 /*-----------------------------------------------------------------*/
1280 analyze(Solver *solv, int level, Rule *c, int *pr, int *dr, int *why)
1282 Pool *pool = solv->pool;
1285 Map seen; /* global? */
1289 int learnt_why = solv->learnt_pool.count;
1290 Id *decisionmap = solv->decisionmap;
1294 if (pool->verbose > 1) printf("ANALYZE at %d ----------------------\n", level);
1295 map_init(&seen, pool->nsolvables);
1296 idx = solv->decisionq.count;
1299 if (pool->verbose > 1) printrule(solv, c);
1300 queue_push(&solv->learnt_pool, c - solv->rules);
1301 dp = c->d ? pool->whatprovidesdata + c->d : 0;
1312 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1314 vv = v > 0 ? v : -v;
1315 if (MAPTST(&seen, vv))
1317 l = solv->decisionmap[vv];
1324 for (j = 0; j < solv->decisionq.count; j++)
1325 if (solv->decisionq.elements[j] == v)
1327 if (j == solv->decisionq.count)
1329 queue_push(&rulq, -(j + 1));
1331 continue; /* initial setting */
1335 num++; /* need to do this one as well */
1339 if (pool->verbose > 3)
1341 printf("PUSH %d ", v);
1342 printruleelement(solv, 0, v);
1348 if (pool->verbose > 3)
1349 printf("num = %d\n", num);
1354 v = solv->decisionq.elements[--idx];
1355 vv = v > 0 ? v : -v;
1356 if (MAPTST(&seen, vv))
1359 c = solv->rules + solv->decisionq_why.elements[idx];
1367 else if (r.count == 1 && r.elements[0] < 0)
1368 *dr = r.elements[0];
1370 *dr = pool_queuetowhatprovides(pool, &r);
1371 if (pool->verbose > 1)
1373 printf("learned rule for level %d (am %d)\n", rlevel, level);
1374 printruleelement(solv, 0, -v);
1375 for (i = 0; i < r.count; i++)
1378 printruleelement(solv, 0, v);
1382 queue_push(&solv->learnt_pool, 0);
1383 if (pool->verbose > 3)
1385 for (i = learnt_why; solv->learnt_pool.elements[i]; i++)
1387 printf("learnt_why ");
1388 printrule(solv, solv->rules + solv->learnt_pool.elements[i]);
1399 * reset the solver decisions to right after the rpm rules.
1400 * called after rules have been enabled/disabled
1404 reset_solver(Solver *solv)
1409 /* delete all learnt rules */
1410 solv->nrules = solv->learntrules;
1411 queue_empty(&solv->learnt_why);
1412 queue_empty(&solv->learnt_pool);
1414 /* redo all direct rpm rule decisions */
1415 /* we break at the first decision with a why attached, this is
1416 * either a job/system rule assertion or a propagated decision */
1417 for (i = 0; i < solv->decisionq.count; i++)
1419 v = solv->decisionq.elements[i];
1420 solv->decisionmap[v > 0 ? v : -v] = 0;
1422 for (i = 0; i < solv->decisionq_why.count; i++)
1423 if (solv->decisionq_why.elements[i])
1427 v = solv->decisionq.elements[i];
1428 solv->decisionmap[v > 0 ? v : -v] = v > 0 ? 1 : -1;
1431 if (solv->pool->verbose > 1)
1432 printf("decisions done reduced from %d to %d\n", solv->decisionq.count, i);
1434 solv->decisionq_why.count = i;
1435 solv->decisionq.count = i;
1436 solv->recommends_index = -1;
1437 solv->propagate_index = 0;
1439 /* redo all job/system decisions */
1440 makeruledecisions(solv);
1441 if (solv->pool->verbose > 1)
1442 printf("decisions after adding job and system rules: %d\n", solv->decisionq.count);
1443 /* recreate watches */
1449 * analyze_unsolvable_rule
1453 analyze_unsolvable_rule(Solver *solv, Rule *r)
1456 Id why = r - solv->rules;
1457 if (solv->pool->verbose > 1)
1459 if (why >= solv->jobrules && why < solv->systemrules)
1461 if (why >= solv->systemrules && why < solv->weakrules)
1462 printf("SYSTEM %d ", why - solv->systemrules);
1463 if (why >= solv->weakrules && why < solv->learntrules)
1465 if (solv->learntrules && why >= solv->learntrules)
1469 if (solv->learntrules && why >= solv->learntrules)
1471 for (i = solv->learnt_why.elements[why - solv->learntrules]; solv->learnt_pool.elements[i]; i++)
1472 analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i]);
1475 /* do not add rpm rules to problem */
1476 if (why < solv->jobrules)
1478 /* turn rule into problem */
1479 if (why >= solv->jobrules && why < solv->systemrules)
1480 why = -(solv->ruletojob.elements[why - solv->jobrules] + 1);
1481 /* return if problem already countains our rule */
1482 if (solv->problems.count)
1484 for (i = solv->problems.count - 1; i >= 0; i--)
1485 if (solv->problems.elements[i] == 0) /* end of last problem reached? */
1487 else if (solv->problems.elements[i] == why)
1490 queue_push(&solv->problems, why);
1495 * analyze_unsolvable
1497 * return: 1 - disabled some rules, try again
1502 analyze_unsolvable(Solver *solv, Rule *cr, int disablerules)
1504 Pool *pool = solv->pool;
1506 Map seen; /* global to speed things up? */
1509 Id *decisionmap = solv->decisionmap;
1510 int oldproblemcount;
1513 if (pool->verbose > 1)
1514 printf("ANALYZE UNSOLVABLE ----------------------\n");
1515 oldproblemcount = solv->problems.count;
1517 /* make room for conflicting rule */
1518 queue_push(&solv->problems, 0);
1519 queue_push(&solv->problems, 0);
1522 map_init(&seen, pool->nsolvables);
1523 analyze_unsolvable_rule(solv, r);
1524 dp = r->d ? pool->whatprovidesdata + r->d : 0;
1535 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1537 vv = v > 0 ? v : -v;
1538 l = solv->decisionmap[vv];
1543 idx = solv->decisionq.count;
1546 v = solv->decisionq.elements[--idx];
1547 vv = v > 0 ? v : -v;
1548 if (!MAPTST(&seen, vv))
1550 why = solv->decisionq_why.elements[idx];
1553 if (pool->verbose > 3)
1556 printruleelement(solv, 0, v);
1560 r = solv->rules + why;
1561 analyze_unsolvable_rule(solv, r);
1562 dp = r->d ? pool->whatprovidesdata + r->d : 0;
1573 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1575 vv = v > 0 ? v : -v;
1576 l = solv->decisionmap[vv];
1583 queue_push(&solv->problems, 0); /* mark end of this problem */
1586 if (solv->weakrules != solv->learntrules)
1588 for (i = oldproblemcount + 2; i < solv->problems.count - 1; i++)
1590 why = solv->problems.elements[i];
1591 if (why < solv->weakrules || why >= solv->learntrules)
1593 if (!lastweak || lastweak < why)
1599 /* disable last weak rule */
1600 solv->problems.count = oldproblemcount;
1601 r = solv->rules + lastweak;
1602 printf("disabling weak ");
1609 /* patch conflicting rule data */
1610 if (cr - solv->rules >= solv->learntrules)
1612 /* we have to store the rule internals for learnt rules
1613 * as they get freed for every solver run */
1614 solv->problems.elements[oldproblemcount] = cr->p;
1615 solv->problems.elements[oldproblemcount + 1] = cr->d;
1618 solv->problems.elements[oldproblemcount + 1] = cr - solv->rules;
1622 for (i = oldproblemcount + 2; i < solv->problems.count - 1; i++)
1623 disableproblem(solv, solv->problems.elements[i]);
1628 printf("UNSOLVABLE\n");
1633 /*-----------------------------------------------------------------*/
1634 /* Decision revert */
1638 * revert decision at level
1642 revert(Solver *solv, int level)
1645 while (solv->decisionq.count)
1647 v = solv->decisionq.elements[solv->decisionq.count - 1];
1648 vv = v > 0 ? v : -v;
1649 if (solv->decisionmap[vv] <= level && solv->decisionmap[vv] >= -level)
1651 if (solv->pool->verbose > 3)
1652 printf("reverting decision %d at %d\n", v, solv->decisionmap[vv]);
1653 solv->decisionmap[vv] = 0;
1654 solv->decisionq.count--;
1655 solv->decisionq_why.count--;
1656 solv->propagate_index = solv->decisionq.count;
1658 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] <= -level)
1660 solv->branches.count--;
1661 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= 0)
1662 solv->branches.count--;
1664 solv->recommends_index = -1;
1669 * watch2onhighest - put watch2 on literal with highest level
1673 watch2onhighest(Solver *solv, Rule *r)
1679 return; /* binary rule, both watches are set */
1680 dp = solv->pool->whatprovidesdata + r->d;
1681 while ((v = *dp++) != 0)
1683 l = solv->decisionmap[v < 0 ? -v : v];
1698 * add free decision to decision q, increase level
1699 * propagate decision, return if no conflict.
1700 * in conflict case, analyze conflict rule, add resulting
1701 * rule to learnt rule set, make decision from learnt
1702 * rule (always unit) and re-propagate.
1706 setpropagatelearn(Solver *solv, int level, Id decision, int disablerules)
1716 solv->decisionmap[decision] = level;
1718 solv->decisionmap[-decision] = -level;
1719 queue_push(&solv->decisionq, decision);
1720 queue_push(&solv->decisionq_why, 0);
1724 r = propagate(solv, level);
1728 return analyze_unsolvable(solv, r, disablerules);
1729 printf("conflict with rule #%d\n", (int)(r - solv->rules));
1730 l = analyze(solv, level, r, &p, &d, &why); /* learnt rule in p and d */
1731 if (l >= level || l <= 0)
1733 printf("reverting decisions (level %d -> %d)\n", level, l);
1735 revert(solv, level);
1736 r = addrule(solv, p, d); /* p requires d */
1739 if (solv->learnt_why.count != (r - solv->rules) - solv->learntrules)
1741 printf("%d %d\n", solv->learnt_why.count, (int)(r - solv->rules) - solv->learntrules);
1744 queue_push(&solv->learnt_why, why);
1747 /* at least 2 literals, needs watches */
1748 watch2onhighest(solv, r);
1749 addwatches(solv, r);
1751 solv->decisionmap[p > 0 ? p : -p] = p > 0 ? level : -level;
1752 queue_push(&solv->decisionq, p);
1753 queue_push(&solv->decisionq_why, r - solv->rules);
1754 if (solv->pool->verbose > 1)
1756 printf("decision: ");
1757 printruleelement(solv, 0, p);
1758 printf("new rule: ");
1767 * install best package from the queue. We add an extra package, inst, if
1768 * provided. See comment in weak install section.
1771 selectandinstall(Solver *solv, int level, Queue *dq, Id inst, int disablerules)
1773 Pool *pool = solv->pool;
1777 if (dq->count > 1 || inst)
1778 policy_filter_unwanted(solv, dq, inst, POLICY_MODE_CHOOSE);
1783 /* choose the supplemented one */
1784 for (i = 0; i < dq->count; i++)
1785 if (solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
1789 for (i = 1; i < dq->count; i++)
1790 queue_push(&solv->branches, dq->elements[i]);
1791 queue_push(&solv->branches, -level);
1795 p = dq->elements[i];
1797 if (pool->verbose > 3)
1799 Solvable *s = pool->solvables + p;
1800 printf("installing %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
1803 return setpropagatelearn(solv, level, p, disablerules);
1807 /*-----------------------------------------------------------------*/
1808 /* Main solver interface */
1813 * create solver structure
1815 * pool: all available solvables
1816 * installed: installed Solvables
1819 * Upon solving, rules are created to flag the Solvables
1820 * of the 'installed' Repo as installed.
1824 solver_create(Pool *pool, Repo *installed)
1827 solv = (Solver *)xcalloc(1, sizeof(Solver));
1829 solv->installed = installed;
1831 queue_init(&solv->ruletojob);
1832 queue_init(&solv->decisionq);
1833 queue_init(&solv->decisionq_why);
1834 queue_init(&solv->problems);
1835 queue_init(&solv->suggestions);
1836 queue_init(&solv->learnt_why);
1837 queue_init(&solv->learnt_pool);
1838 queue_init(&solv->branches);
1840 map_init(&solv->recommendsmap, pool->nsolvables);
1841 map_init(&solv->suggestsmap, pool->nsolvables);
1842 map_init(&solv->noupdate, installed ? installed->end - installed->start : 0);
1843 solv->recommends_index = 0;
1845 solv->decisionmap = (Id *)xcalloc(pool->nsolvables, sizeof(Id));
1846 solv->rules = (Rule *)xmalloc((solv->nrules + (RULES_BLOCK + 1)) * sizeof(Rule));
1847 memset(solv->rules, 0, sizeof(Rule));
1859 solver_free(Solver *solv)
1861 queue_free(&solv->ruletojob);
1862 queue_free(&solv->decisionq);
1863 queue_free(&solv->decisionq_why);
1864 queue_free(&solv->learnt_why);
1865 queue_free(&solv->learnt_pool);
1866 queue_free(&solv->problems);
1867 queue_free(&solv->suggestions);
1868 queue_free(&solv->branches);
1870 map_free(&solv->recommendsmap);
1871 map_free(&solv->suggestsmap);
1872 map_free(&solv->noupdate);
1873 xfree(solv->decisionmap);
1875 xfree(solv->watches);
1876 xfree(solv->weaksystemrules);
1877 xfree(solv->obsoletes);
1878 xfree(solv->obsoletes_data);
1883 /*-------------------------------------------------------*/
1888 * all rules have been set up, now actually run the solver
1893 run_solver(Solver *solv, int disablerules, int doweak)
1901 Pool *pool = solv->pool;
1904 if (pool->verbose > 3)
1906 printf("number of rules: %d\n", solv->nrules);
1907 for (i = 0; i < solv->nrules; i++)
1908 printrule(solv, solv->rules + i);
1911 /* all new rules are learnt after this point */
1912 solv->learntrules = solv->nrules;
1913 /* crate watches lists */
1916 if (pool->verbose) printf("initial decisions: %d\n", solv->decisionq.count);
1918 /* start SAT algorithm */
1920 systemlevel = level + 1;
1921 if (pool->verbose) printf("solving...\n");
1932 if (pool->verbose) printf("propagating (%d %d)...\n", solv->propagate_index, solv->decisionq.count);
1933 if ((r = propagate(solv, level)) != 0)
1935 if (analyze_unsolvable(solv, r, disablerules))
1943 * installed packages
1946 if (level < systemlevel && solv->installed && solv->installed->nsolvables)
1948 if (!solv->updatesystem)
1950 /* try to keep as many packages as possible */
1951 if (pool->verbose) printf("installing system packages\n");
1952 for (i = solv->installed->start, n = 0; ; i++)
1954 if (n == solv->installed->nsolvables)
1956 if (i == solv->installed->end)
1957 i = solv->installed->start;
1958 s = pool->solvables + i;
1959 if (s->repo != solv->installed)
1962 if (solv->decisionmap[i] != 0)
1964 if (pool->verbose > 3)
1965 printf("keeping %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
1967 level = setpropagatelearn(solv, level, i, disablerules);
1973 if (level <= olevel)
1977 if (solv->weaksystemrules)
1979 if (pool->verbose) printf("installing weak system packages\n");
1980 for (i = solv->installed->start; i < solv->installed->end; i++)
1982 if (pool->solvables[i].repo != solv->installed)
1984 if (solv->decisionmap[i] > 0 || (solv->decisionmap[i] < 0 && solv->weaksystemrules[i - solv->installed->start] == 0))
1986 /* noupdate is set if a job is erasing the installed solvable or installing a specific version */
1987 if (MAPTST(&solv->noupdate, i - solv->installed->start))
1990 if (solv->weaksystemrules[i - solv->installed->start])
1992 dp = pool->whatprovidesdata + solv->weaksystemrules[i - solv->installed->start];
1993 while ((p = *dp++) != 0)
1995 if (solv->decisionmap[p] > 0)
1997 if (solv->decisionmap[p] == 0)
2001 continue; /* update package already installed */
2003 if (!dq.count && solv->decisionmap[i] != 0)
2006 /* FIXME: i is handled a bit different because we do not want
2007 * to have it pruned just because it is not recommened.
2008 * we should not prune installed packages instead */
2009 level = selectandinstall(solv, level, &dq, (solv->decisionmap[i] ? 0 : i), disablerules);
2015 if (level <= olevel)
2018 if (i < solv->installed->end)
2021 systemlevel = level;
2028 if (pool->verbose) printf("deciding unresolved rules\n");
2029 for (i = 1, n = 1; ; i++, n++)
2031 if (n == solv->nrules)
2033 if (i == solv->nrules)
2035 r = solv->rules + i;
2041 /* binary or unary rule */
2042 /* need two positive undecided literals */
2043 if (r->p < 0 || r->w2 <= 0)
2045 if (solv->decisionmap[r->p] || solv->decisionmap[r->w2])
2047 queue_push(&dq, r->p);
2048 queue_push(&dq, r->w2);
2053 * all negative literals are installed
2054 * no positive literal is installed
2055 * i.e. the rule is not fulfilled and we
2056 * just need to decide on the positive literals
2060 if (solv->decisionmap[-r->p] <= 0)
2065 if (solv->decisionmap[r->p] > 0)
2067 if (solv->decisionmap[r->p] == 0)
2068 queue_push(&dq, r->p);
2070 dp = pool->whatprovidesdata + r->d;
2071 while ((p = *dp++) != 0)
2075 if (solv->decisionmap[-p] <= 0)
2080 if (solv->decisionmap[p] > 0)
2082 if (solv->decisionmap[p] == 0)
2091 /* cannot happen as this means that
2092 * the rule is unit */
2096 if (pool->verbose > 2)
2100 level = selectandinstall(solv, level, &dq, 0, disablerules);
2106 if (level < systemlevel)
2109 } /* for(), decide */
2111 if (n != solv->nrules) /* continue if level < systemlevel */
2114 if (doweak && !solv->problems.count)
2118 if (pool->verbose) printf("installing recommended packages\n");
2120 for (i = 1; i < pool->nsolvables; i++)
2122 if (solv->decisionmap[i] < 0)
2124 if (solv->decisionmap[i] > 0)
2126 Id *recp, rec, *pp, p;
2127 s = pool->solvables + i;
2128 /* installed, check for recommends */
2129 /* XXX need to special case AND ? */
2132 recp = s->repo->idarraydata + s->recommends;
2133 while ((rec = *recp++) != 0)
2136 FOR_PROVIDES(p, pp, rec)
2138 if (solv->decisionmap[p] > 0)
2143 else if (solv->decisionmap[p] == 0)
2145 queue_pushunique(&dq, p);
2153 s = pool->solvables + i;
2154 if (!s->supplements && !s->freshens)
2156 if (!pool_installable(pool, s))
2158 if (solver_is_supplementing(solv, s))
2159 queue_pushunique(&dq, i);
2165 policy_filter_unwanted(solv, &dq, 0, POLICY_MODE_RECOMMEND);
2167 s = pool->solvables + p;
2168 if (pool->verbose > 0)
2169 printf("installing recommended %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2170 level = setpropagatelearn(solv, level, p, 0);
2175 if (solv->solution_callback)
2177 solv->solution_callback(solv, solv->solution_callback_data);
2178 if (solv->branches.count)
2180 int i = solv->branches.count - 1;
2181 int l = -solv->branches.elements[i];
2183 if (solv->branches.elements[i - 1] < 0)
2185 p = solv->branches.elements[i];
2186 if (pool->verbose > 0)
2188 s = pool->solvables + p;
2189 printf("branching with %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2192 for (j = i + 1; j < solv->branches.count; j++)
2193 queue_push(&dq, solv->branches.elements[j]);
2194 solv->branches.count = i;
2196 revert(solv, level);
2198 for (j = 0; j < dq.count; j++)
2199 queue_push(&solv->branches, dq.elements[j]);
2201 level = setpropagatelearn(solv, level, p, disablerules);
2209 /* all branches done, we're finally finished */
2213 /* minimization step */
2214 if (solv->branches.count)
2216 int l = 0, lasti = -1, lastl = -1;
2218 for (i = solv->branches.count - 1; i >= 0; i--)
2220 p = solv->branches.elements[i];
2223 else if (p > 0 && solv->decisionmap[p] > l + 1)
2231 /* kill old solvable so that we do not loop */
2232 p = solv->branches.elements[lasti];
2233 solv->branches.elements[lasti] = 0;
2234 s = pool->solvables + p;
2235 if (pool->verbose > 0)
2236 printf("minimizing %d -> %d with %s-%s.%s\n", solv->decisionmap[p], l, id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2239 revert(solv, level);
2241 level = setpropagatelearn(solv, level, p, disablerules);
2258 * at this point, all rules that led to conflicts are disabled.
2259 * we re-enable all rules of a problem set but rule "sug", then
2260 * continue to disable more rules until there as again a solution.
2263 /* FIXME: think about conflicting assertions */
2266 refine_suggestion(Solver *solv, Queue *job, Id *problem, Id sug, Queue *refined)
2268 Pool *pool = solv->pool;
2277 printf("refine_suggestion start\n");
2278 for (i = 0; problem[i]; i++)
2280 if (problem[i] == sug)
2282 printproblem(solv, problem[i]);
2285 queue_init(&disabled);
2286 queue_empty(refined);
2287 queue_push(refined, sug);
2289 /* re-enable all problem rules with the exception of "sug" */
2293 for (i = 0; problem[i]; i++)
2294 if (problem[i] != sug)
2295 enableproblem(solv, problem[i]);
2298 disableupdaterules(solv, job, -(sug + 1));
2302 /* re-enable as many weak rules as possible */
2303 for (i = solv->weakrules; i < solv->learntrules; i++)
2305 r = solv->rules + i;
2307 enablerule(solv, r);
2310 queue_empty(&solv->problems);
2311 revert(solv, 1); /* XXX move to reset_solver? */
2313 run_solver(solv, 0, 0);
2314 if (!solv->problems.count)
2317 printf("no more problems!\n");
2318 if (pool->verbose > 3)
2319 printdecisions(solv);
2320 break; /* great, no more problems */
2322 disabledcnt = disabled.count;
2323 /* skip over problem rule */
2324 for (i = 2; i < solv->problems.count - 1; i++)
2326 /* ignore solutions in refined */
2327 v = solv->problems.elements[i];
2328 for (j = 0; problem[j]; j++)
2329 if (problem[j] != sug && problem[j] == v)
2333 queue_push(&disabled, v);
2335 if (disabled.count == disabledcnt)
2337 /* no solution found, this was an invalid suggestion! */
2339 printf("no solution found!\n");
2343 if (disabled.count == disabledcnt + 1)
2345 /* just one suggestion, add it to refined list */
2346 v = disabled.elements[disabledcnt];
2347 queue_push(refined, v);
2348 disableproblem(solv, v);
2350 disableupdaterules(solv, job, -(v + 1));
2354 /* more than one solution, disable all */
2355 /* do not push anything on refine list */
2356 if (pool->verbose > 1)
2358 printf("more than one solution found:\n");
2359 for (i = disabledcnt; i < disabled.count; i++)
2360 printproblem(solv, disabled.elements[i]);
2362 for (i = disabledcnt; i < disabled.count; i++)
2363 disableproblem(solv, disabled.elements[i]);
2366 /* all done, get us back into the same state as before */
2367 /* enable refined rules again */
2368 for (i = 0; i < disabled.count; i++)
2369 enableproblem(solv, disabled.elements[i]);
2370 /* disable problem rules again */
2371 for (i = 0; problem[i]; i++)
2372 disableproblem(solv, problem[i]);
2374 printf("refine_suggestion end\n");
2378 problems_to_solutions(Solver *solv, Queue *job)
2380 Pool *pool = solv->pool;
2388 if (!solv->problems.count)
2390 queue_clone(&problems, &solv->problems);
2391 queue_init(&solution);
2392 queue_init(&solutions);
2393 /* copy over problem rule */
2394 queue_push(&solutions, problems.elements[0]);
2395 queue_push(&solutions, problems.elements[1]);
2396 problem = problems.elements + 2;
2397 for (i = 2; i < problems.count; i++)
2399 Id v = problems.elements[i];
2402 /* mark end of this problem */
2403 queue_push(&solutions, 0);
2404 queue_push(&solutions, 0);
2405 if (i + 1 == problems.count)
2407 /* copy over problem rule of next problem */
2408 queue_push(&solutions, problems.elements[i + 1]);
2409 queue_push(&solutions, problems.elements[i + 2]);
2411 problem = problems.elements + i + 1;
2414 refine_suggestion(solv, job, problem, v, &solution);
2415 if (!solution.count)
2416 continue; /* this solution didn't work out */
2418 for (j = 0; j < solution.count; j++)
2420 why = solution.elements[j];
2422 printproblem(solv, why);
2426 queue_push(&solutions, 0);
2427 queue_push(&solutions, -why);
2429 else if (why >= solv->systemrules && why < solv->weakrules)
2432 p = solv->installed->start + (why - solv->systemrules);
2433 if (solv->weaksystemrules && solv->weaksystemrules[why - solv->systemrules])
2435 Id *dp = pool->whatprovidesdata + solv->weaksystemrules[why - solv->systemrules];
2438 if (*dp >= solv->installed->start && *dp < solv->installed->start + solv->installed->nsolvables)
2440 if (solv->decisionmap[*dp] > 0)
2447 queue_push(&solutions, p);
2448 queue_push(&solutions, rp);
2453 /* mark end of this solution */
2454 queue_push(&solutions, 0);
2455 queue_push(&solutions, 0);
2457 queue_free(&solution);
2458 queue_free(&problems);
2459 /* copy queue over to solutions */
2460 queue_free(&solv->problems);
2461 queue_clone(&solv->problems, &solutions);
2462 queue_free(&solutions);
2472 id2rc(Solver *solv, Id id)
2475 if (solv->rc_output != 2)
2477 evr = id2str(solv->pool, id);
2478 if (*evr < '0' || *evr > '9')
2480 while (*evr >= '0' && *evr <= '9')
2488 printdecisions(Solver *solv)
2490 Pool *pool = solv->pool;
2491 Repo *installed = solv->installed;
2492 Id p, *obsoletesmap;
2496 obsoletesmap = (Id *)xcalloc(pool->nsolvables, sizeof(Id));
2499 for (i = 0; i < solv->decisionq.count; i++)
2503 n = solv->decisionq.elements[i];
2506 if (n == SYSTEMSOLVABLE)
2508 s = pool->solvables + n;
2509 if (s->repo == installed) /* obsoletes don't count for already installed packages */
2511 FOR_PROVIDES(p, pp, s->name)
2512 if (s->name == pool->solvables[p].name)
2514 if (pool->solvables[p].repo == installed && !obsoletesmap[p])
2516 obsoletesmap[p] = n;
2521 for (i = 0; i < solv->decisionq.count; i++)
2526 n = solv->decisionq.elements[i];
2529 if (n == SYSTEMSOLVABLE)
2531 s = pool->solvables + n;
2532 if (s->repo == installed) /* obsoletes don't count for already installed packages */
2536 obsp = s->repo->idarraydata + s->obsoletes;
2537 while ((obs = *obsp++) != 0)
2538 FOR_PROVIDES(p, pp, obs)
2540 if (pool->solvables[p].repo == installed && !obsoletesmap[p])
2542 obsoletesmap[p] = n;
2549 if (solv->rc_output)
2550 printf(">!> Solution #1:\n");
2552 int installs = 0, uninstalls = 0, upgrades = 0;
2554 /* print solvables to be erased */
2558 for (i = installed->start; i < installed->end; i++)
2560 s = pool->solvables + i;
2561 if (s->repo != installed)
2563 if (solv->decisionmap[i] > 0)
2565 if (obsoletesmap[i])
2567 if (solv->rc_output == 2)
2568 printf(">!> remove %s-%s%s\n", id2str(pool, s->name), id2rc(solv, s->evr), id2str(pool, s->evr));
2569 else if (solv->rc_output)
2570 printf(">!> remove %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2572 printf("erase %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2577 /* print solvables to be installed */
2579 for (i = 0; i < solv->decisionq.count; i++)
2582 p = solv->decisionq.elements[i];
2585 if (p == SYSTEMSOLVABLE)
2587 s = pool->solvables + p;
2588 if (installed && s->repo == installed)
2591 if (!obsoletesmap[p])
2593 if (solv->rc_output)
2595 printf("install %s-%s%s", id2str(pool, s->name), id2rc(solv, s->evr), id2str(pool, s->evr));
2596 if (solv->rc_output != 2)
2597 printf(".%s", id2str(pool, s->arch));
2600 else if (!solv->rc_output)
2602 printf("update %s-%s.%s (obsoletes", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2603 for (j = installed->start; j < installed->end; j++)
2605 if (obsoletesmap[j] != p)
2607 s = pool->solvables + j;
2608 printf(" %s-%s.%s", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2615 Solvable *f, *fn = 0;
2616 for (j = installed->start; j < installed->end; j++)
2618 if (obsoletesmap[j] != p)
2620 f = pool->solvables + j;
2621 if (fn || f->name != s->name)
2623 if (solv->rc_output == 2)
2624 printf(">!> remove %s-%s%s\n", id2str(pool, f->name), id2rc(solv, f->evr), id2str(pool, f->evr));
2625 else if (solv->rc_output)
2626 printf(">!> remove %s-%s.%s\n", id2str(pool, f->name), id2str(pool, f->evr), id2str(pool, f->arch));
2634 printf(">!> install %s-%s%s", id2str(pool, s->name), id2rc(solv, s->evr), id2str(pool, s->evr));
2635 if (solv->rc_output != 2)
2636 printf(".%s", id2str(pool, s->arch));
2641 if (solv->rc_output == 2)
2642 printf(">!> upgrade %s-%s => %s-%s%s", id2str(pool, fn->name), id2str(pool, fn->evr), id2str(pool, s->name), id2rc(solv, s->evr), id2str(pool, s->evr));
2644 printf(">!> upgrade %s-%s.%s => %s-%s.%s", id2str(pool, fn->name), id2str(pool, fn->evr), id2str(pool, fn->arch), id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2648 if (solv->rc_output)
2650 Repo *repo = s->repo;
2651 if (repo && strcmp(repo_name(repo), "locales"))
2652 printf("[%s]", repo_name(repo));
2657 if (solv->rc_output)
2658 printf(">!> installs=%d, upgrades=%d, uninstalls=%d\n", installs, upgrades, uninstalls);
2660 xfree(obsoletesmap);
2662 if (solv->suggestions.count)
2664 printf("\nsuggested packages:\n");
2665 for (i = 0; i < solv->suggestions.count; i++)
2667 s = pool->solvables + solv->suggestions.elements[i];
2668 printf("- %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2674 printconflicts(Solver *solv, Solvable *s, Id pc)
2676 Pool *pool = solv->pool;
2677 Solvable *sc = pool->solvables + pc;
2678 Id p, *pp, con, *conp, obs, *obsp;
2683 conp = s->repo->idarraydata + s->conflicts;
2684 while ((con = *conp++) != 0)
2686 FOR_PROVIDES(p, pp, con)
2690 printf("packags %s-%s.%s conflicts with %s, which is provided by %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), dep2str(pool, con), id2str(pool, sc->name), id2str(pool, sc->evr), id2str(pool, sc->arch));
2695 if (s->obsoletes && (!solv->installed || s->repo != solv->installed))
2697 obsp = s->repo->idarraydata + s->obsoletes;
2698 while ((obs = *obsp++) != 0)
2700 FOR_PROVIDES(p, pp, obs)
2704 printf("packags %s-%s.%s obsolets %s, which is provided by %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), dep2str(pool, obs), id2str(pool, sc->name), id2str(pool, sc->evr), id2str(pool, sc->arch));
2713 printprobleminfo(Solver *solv, Id p, Id d, Queue *job, Id firstp, Id firstrp)
2715 Pool *pool = solv->pool;
2722 /* learnt rule, ignore for now */
2723 printf("some learnt rule...\n");
2728 /* conflict with system solvable, i.e. could not create rule */
2731 printf("got firstp\n");
2734 what = job->elements[firstrp];
2735 switch (job->elements[firstrp - 1])
2737 case SOLVER_INSTALL_SOLVABLE_NAME:
2738 printf("no solvable exists with name %s\n", dep2str(pool, what));
2740 case SOLVER_INSTALL_SOLVABLE_PROVIDES:
2741 printf("no solvable provides %s\n", dep2str(pool, what));
2744 printf("unknown job\n");
2753 /* conflict with rpm rule, package -d is not installable */
2754 s = pool->solvables + (-d);
2757 reqp = s->repo->idarraydata + s->requires;
2758 while ((req = *reqp++) != 0)
2760 if (req == SOLVABLE_PREREQMARKER)
2762 dp = GET_PROVIDESP(req, p);
2765 printf("package %s-%s.%s requires %s, but no package provides it\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), dep2str(pool, req));
2770 printf("package %s-%s.%s is not installable\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2773 if (d >= solv->jobrules)
2775 r = solv->rules + d;
2781 sp = pool->solvables + (-p);
2782 sd = pool->solvables + (-d);
2783 printf("package %s-%s.%s cannot be installed with package %s-%s.%s\n", id2str(pool, sp->name), id2str(pool, sp->evr), id2str(pool, sp->arch), id2str(pool, sd->name), id2str(pool, sd->evr), id2str(pool, sd->arch));
2786 printf("some job rule...\n");
2790 r = solv->rules + d;
2795 if (d == 0 && r->w2 < 0)
2799 sp = pool->solvables + (-p);
2800 sd = pool->solvables + (-d);
2801 if (sp->name == sd->name)
2803 printf("cannot install both %s-%s.%s and %s-%s.%s\n", id2str(pool, sp->name), id2str(pool, sp->evr), id2str(pool, sp->arch), id2str(pool, sd->name), id2str(pool, sd->evr), id2str(pool, sd->arch));
2807 printconflicts(solv, pool->solvables + (-p), -d);
2808 printconflicts(solv, pool->solvables + (-d), -p);
2813 /* find requires of p that corresponds with our rule */
2815 s = pool->solvables + (-p);
2816 reqp = s->repo->idarraydata + s->requires;
2817 while ((req = *reqp++) != 0)
2819 if (req == SOLVABLE_PREREQMARKER)
2821 dp = GET_PROVIDESP(req, p);
2824 if (*dp == r->w2 && dp[1] == 0)
2827 else if (dp - pool->whatprovidesdata == d)
2832 printf("req not found\n");
2835 printf("package %s-%s.%s requires %s, but none of its providers can be installed\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), dep2str(pool, req));
2840 printsolutions(Solver *solv, Queue *job)
2842 Pool *pool = solv->pool;
2848 printf("Encountered problems! Here are the solutions:\n\n");
2850 for (i = 0; i < solv->problems.count; )
2852 printf("Problem %d:\n", pcnt++);
2853 printf("====================================\n");
2854 p = solv->problems.elements[i++];
2855 d = solv->problems.elements[i++];
2856 printprobleminfo(solv, p, d, job, solv->problems.elements[i], solv->problems.elements[i + 1]);
2860 if (solv->problems.elements[i] == 0 && solv->problems.elements[i + 1] == 0)
2862 /* end of solutions for this problems reached */
2868 p = solv->problems.elements[i];
2869 rp = solv->problems.elements[i + 1];
2871 if (p == 0 && rp == 0)
2873 /* end of this solution reached */
2879 /* job, p is index into job queue */
2880 what = job->elements[rp];
2881 switch (job->elements[rp - 1])
2883 case SOLVER_INSTALL_SOLVABLE:
2884 s = pool->solvables + what;
2885 if (solv->installed && s->repo == solv->installed)
2886 printf("- do not keep %s-%s.%s installed\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2888 printf("- do not install %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2890 case SOLVER_ERASE_SOLVABLE:
2891 s = pool->solvables + what;
2892 if (solv->installed && s->repo == solv->installed)
2893 printf("- do not deinstall %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2895 printf("- do not forbid installation of %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
2897 case SOLVER_INSTALL_SOLVABLE_NAME:
2898 printf("- do not install %s\n", id2str(pool, what));
2900 case SOLVER_ERASE_SOLVABLE_NAME:
2901 printf("- do not deinstall %s\n", id2str(pool, what));
2903 case SOLVER_INSTALL_SOLVABLE_PROVIDES:
2904 printf("- do not install a solvable providing %s\n", dep2str(pool, what));
2906 case SOLVER_ERASE_SOLVABLE_PROVIDES:
2907 printf("- do not deinstall all solvables providing %s\n", dep2str(pool, what));
2909 case SOLVER_INSTALL_SOLVABLE_UPDATE:
2910 s = pool->solvables + what;
2911 printf("- do not install most recent version of %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool
2915 printf("- do something different\n");
2921 /* policy, replace p with rp */
2922 s = pool->solvables + p;
2923 sd = rp ? pool->solvables + rp : 0;
2927 if (!solv->allowdowngrade && evrcmp(pool, s->evr, sd->evr) > 0)
2929 printf("- allow downgrade of %s-%s.%s to %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), id2str(pool, sd->name), id2str(pool, sd->evr), id2str(pool, sd->arch));
2932 if (!solv->allowarchchange && s->name == sd->name && s->arch != sd->arch && policy_illegal_archchange(pool, s, sd))
2934 printf("- allow architecture change of %s-%s.%s to %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), id2str(pool, sd->name), id2str(pool, sd->evr), id2str(pool, sd->arch));
2937 if (!solv->allowvendorchange && s->name == sd->name && s->vendor != sd->vendor && policy_illegal_vendorchange(pool, s, sd))
2940 printf("- allow vendor change from '%s' (%s-%s.%s) to '%s' (%s-%s.%s)\n", id2str(pool, s->vendor), id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), id2str(pool, sd->vendor), id2str(pool, sd->name), id2str(pool, sd->evr), id2str(pool, sd->arch));
2942 printf("- allow vendor change from '%s' (%s-%s.%s) to no vendor (%s-%s.%s)\n", id2str(pool, s->vendor), id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), id2str(pool, sd->name), id2str(pool, sd->evr), id2str(pool, sd->arch));
2946 printf("- allow replacement of %s-%s.%s with %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), id2str(pool, sd->name), id2str(pool, sd->evr), id2str(pool, sd->arch));
2950 printf("- allow deinstallation of %s-%s.%s [%d]\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch), (Id)(s - pool->solvables));
2960 /* for each installed solvable find which packages with *different* names
2961 * obsolete the solvable.
2962 * this index is used in policy_findupdatepackages if noupdateprovide is set.
2966 create_obsolete_index(Solver *solv)
2968 Pool *pool = solv->pool;
2970 Repo *installed = solv->installed;
2971 Id p, *pp, obs, *obsp, *obsoletes, *obsoletes_data;
2974 if (!installed || !installed->nsolvables)
2976 /* create reverse obsoletes map for installed solvables */
2977 solv->obsoletes = obsoletes = xcalloc(installed->end - installed->start, sizeof(Id));
2978 for (i = 1; i < pool->nsolvables; i++)
2980 s = pool->solvables + i;
2981 if (s->repo == installed)
2985 if (!pool_installable(pool, s))
2987 obsp = s->repo->idarraydata + s->obsoletes;
2988 while ((obs = *obsp++) != 0)
2989 FOR_PROVIDES(p, pp, obs)
2991 if (pool->solvables[p].repo != installed)
2993 if (pool->solvables[p].name == s->name)
2995 obsoletes[p - installed->start]++;
2999 for (i = 0; i < installed->nsolvables; i++)
3002 n += obsoletes[i] + 1;
3005 solv->obsoletes_data = obsoletes_data = xcalloc(n + 1, sizeof(Id));
3006 if (pool->verbose) printf("obsoletes data: %d entries\n", n + 1);
3007 for (i = pool->nsolvables - 1; i > 0; i--)
3009 s = pool->solvables + i;
3012 if (!pool_installable(pool, s))
3014 obsp = s->repo->idarraydata + s->obsoletes;
3015 while ((obs = *obsp++) != 0)
3016 FOR_PROVIDES(p, pp, obs)
3018 if (pool->solvables[p].repo != installed)
3020 if (pool->solvables[p].name == s->name)
3022 p -= installed->start;
3023 if (obsoletes_data[obsoletes[p]] != i)
3024 obsoletes_data[--obsoletes[p]] = i;
3030 /*-----------------------------------------------------------------*/
3040 solve(Solver *solv, Queue *job)
3042 Pool *pool = solv->pool;
3043 Repo *installed = solv->installed;
3046 Map addedmap; /* '1' == have rule for solvable */
3047 Id how, what, p, *pp, d;
3051 /* create obsolete index if needed */
3052 if (solv->noupdateprovide)
3053 create_obsolete_index(solv);
3056 * create basic rule set of all involved packages
3057 * use addedmap bitmap to make sure we don't create rules twice
3061 map_init(&addedmap, pool->nsolvables);
3065 * always install our system solvable
3067 MAPSET(&addedmap, SYSTEMSOLVABLE);
3068 queue_push(&solv->decisionq, SYSTEMSOLVABLE);
3069 queue_push(&solv->decisionq_why, 0);
3070 solv->decisionmap[SYSTEMSOLVABLE] = 1;
3073 * create rules for all package that could be involved with the solving
3074 * so called: rpm rules
3079 oldnrules = solv->nrules;
3080 if (pool->verbose > 3)
3081 printf ("*** create rpm rules for installed solvables ***\n");
3082 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3083 if (s->repo == installed)
3084 addrpmrulesforsolvable(solv, s, &addedmap);
3086 printf("added %d rpm rules for installed solvables\n", solv->nrules - oldnrules);
3087 if (pool->verbose > 3)
3088 printf ("*** create rpm rules for updaters of installed solvables ***\n");
3089 oldnrules = solv->nrules;
3090 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3091 if (s->repo == installed)
3092 addrpmrulesforupdaters(solv, s, &addedmap, 1);
3094 printf("added %d rpm rules for updaters of installed solvables\n", solv->nrules - oldnrules);
3097 if (solv->pool->verbose > 3)
3098 printf ("*** create rpm rules for packages involved with a job ***\n");
3099 oldnrules = solv->nrules;
3100 for (i = 0; i < job->count; i += 2)
3102 how = job->elements[i];
3103 what = job->elements[i + 1];
3107 case SOLVER_INSTALL_SOLVABLE:
3108 addrpmrulesforsolvable(solv, pool->solvables + what, &addedmap);
3110 case SOLVER_INSTALL_SOLVABLE_NAME:
3111 case SOLVER_INSTALL_SOLVABLE_PROVIDES:
3112 FOR_PROVIDES(p, pp, what)
3114 /* if by name, ensure that the name matches */
3115 if (how == SOLVER_INSTALL_SOLVABLE_NAME && pool->solvables[p].name != what)
3117 addrpmrulesforsolvable(solv, pool->solvables + p, &addedmap);
3120 case SOLVER_INSTALL_SOLVABLE_UPDATE:
3121 /* dont allow downgrade */
3122 addrpmrulesforupdaters(solv, pool->solvables + what, &addedmap, 0);
3127 printf("added %d rpm rules for packages involved in a job\n", solv->nrules - oldnrules);
3129 if (solv->pool->verbose > 3)
3130 printf ("*** create rpm rules for recommended/suggested packages ***\n");
3132 oldnrules = solv->nrules;
3133 addrpmrulesforweak(solv, &addedmap);
3135 printf("added %d rpm rules because of weak dependencies\n", solv->nrules - oldnrules);
3140 int possible = 0, installable = 0;
3141 for (i = 1; i < pool->nsolvables; i++)
3143 if (pool_installable(pool, pool->solvables + i))
3145 if (MAPTST(&addedmap, i))
3148 printf("%d of %d installable solvables considered for solving\n", possible, installable);
3153 * first pass done, we now have all the rpm rules we need.
3154 * unify existing rules before going over all job rules and
3156 * at this point the system is always solvable,
3157 * as an empty system (remove all packages) is a valid solution
3160 unifyrules(solv); /* remove duplicate rpm rules */
3162 if (pool->verbose) printf("decisions so far: %d\n", solv->decisionq.count);
3165 * now add all job rules
3168 if (solv->pool->verbose > 3)
3169 printf ("*** Add JOB rules ***\n");
3171 solv->jobrules = solv->nrules;
3173 for (i = 0; i < job->count; i += 2)
3175 how = job->elements[i];
3176 what = job->elements[i + 1];
3179 case SOLVER_INSTALL_SOLVABLE: /* install specific solvable */
3180 s = pool->solvables + what;
3181 if (solv->rc_output)
3183 printf(">!> Installing %s from channel %s\n", id2str(pool, s->name), repo_name(s->repo));
3186 printf("job: install solvable %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
3187 addrule(solv, what, 0); /* install by Id */
3188 queue_push(&solv->ruletojob, i);
3190 case SOLVER_ERASE_SOLVABLE:
3191 s = pool->solvables + what;
3193 printf("job: erase solvable %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
3194 addrule(solv, -what, 0); /* remove by Id */
3195 queue_push(&solv->ruletojob, i);
3197 case SOLVER_INSTALL_SOLVABLE_NAME: /* install by capability */
3198 case SOLVER_INSTALL_SOLVABLE_PROVIDES:
3199 if (pool->verbose && how == SOLVER_INSTALL_SOLVABLE_NAME)
3200 printf("job: install name %s\n", id2str(pool, what));
3201 if (pool->verbose && how == SOLVER_INSTALL_SOLVABLE_PROVIDES)
3202 printf("job: install provides %s\n", dep2str(pool, what));
3204 FOR_PROVIDES(p, pp, what)
3206 /* if by name, ensure that the name matches */
3207 if (how == SOLVER_INSTALL_SOLVABLE_NAME && pool->solvables[p].name != what)
3213 /* no provider, make this an impossible rule */
3214 queue_push(&q, -SYSTEMSOLVABLE);
3217 p = queue_shift(&q); /* get first provider */
3219 d = 0; /* single provider ? -> make assertion */
3221 d = pool_queuetowhatprovides(pool, &q); /* get all providers */
3222 addrule(solv, p, d); /* add 'requires' rule */
3223 queue_push(&solv->ruletojob, i);
3225 case SOLVER_ERASE_SOLVABLE_NAME: /* remove by capability */
3226 case SOLVER_ERASE_SOLVABLE_PROVIDES:
3227 if (pool->verbose && how == SOLVER_ERASE_SOLVABLE_NAME)
3228 printf("job: erase name %s\n", id2str(pool, what));
3229 if (pool->verbose && how == SOLVER_ERASE_SOLVABLE_PROVIDES)
3230 printf("job: erase provides %s\n", dep2str(pool, what));
3231 FOR_PROVIDES(p, pp, what)
3233 /* if by name, ensure that the name matches */
3234 if (how == SOLVER_ERASE_SOLVABLE_NAME && pool->solvables[p].name != what)
3236 addrule(solv, -p, 0); /* add 'remove' rule */
3237 queue_push(&solv->ruletojob, i);
3240 case SOLVER_INSTALL_SOLVABLE_UPDATE: /* find update for solvable */
3241 s = pool->solvables + what;
3243 printf("job: update %s-%s.%s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
3244 addupdaterule(solv, s, 0);
3245 queue_push(&solv->ruletojob, i);
3250 if (solv->ruletojob.count != solv->nrules - solv->jobrules)
3254 * now add system rules
3258 if (solv->pool->verbose > 3)
3259 printf ("*** Add system rules ***\n");
3262 solv->systemrules = solv->nrules;
3265 * create rules for updating installed solvables
3269 if (installed && !solv->allowuninstall)
3270 { /* loop over all installed solvables */
3271 /* we create all update rules, but disable some later on depending on the job */
3272 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3273 if (s->repo == installed)
3274 addupdaterule(solv, s, 0);
3276 addupdaterule(solv, 0, 0); /* create dummy rule */
3277 /* consistency check: we added a rule for _every_ system solvable */
3278 if (solv->nrules - solv->systemrules != installed->end - installed->start)
3282 /* create special weak system rules */
3283 /* those are used later on to keep a version of the installed packages in
3285 if (installed && installed->nsolvables)
3287 solv->weaksystemrules = xcalloc(installed->end - installed->start, sizeof(Id));
3288 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3289 if (s->repo == installed)
3291 policy_findupdatepackages(solv, s, &q, 1);
3293 solv->weaksystemrules[i - installed->start] = pool_queuetowhatprovides(pool, &q);
3297 /* free unneeded memory */
3298 map_free(&addedmap);
3301 solv->weakrules = solv->nrules;
3303 /* try real hard to keep packages installed */
3306 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3307 if (s->repo == installed)
3309 /* FIXME: can't work with refine_suggestion! */
3310 /* need to always add the rule but disable it */
3311 if (MAPTST(&solv->noupdate, i - installed->start))
3313 d = solv->weaksystemrules[i - installed->start];
3314 addrule(solv, i, d);
3323 disableupdaterules(solv, job, -1);
3324 makeruledecisions(solv);
3326 if (pool->verbose) printf("problems so far: %d\n", solv->problems.count);
3328 run_solver(solv, 1, 1);
3330 /* find suggested packages */
3331 if (!solv->problems.count)
3333 Id sug, *sugp, p, *pp;
3335 /* create map of all suggests that are still open */
3336 solv->recommends_index = -1;
3337 MAPZERO(&solv->suggestsmap);
3338 for (i = 0; i < solv->decisionq.count; i++)
3340 p = solv->decisionq.elements[i];
3343 s = pool->solvables + p;
3346 sugp = s->repo->idarraydata + s->suggests;
3347 while ((sug = *sugp++) != 0)
3349 FOR_PROVIDES(p, pp, sug)
3350 if (solv->decisionmap[p] > 0)
3353 continue; /* already fulfilled */
3354 FOR_PROVIDES(p, pp, sug)
3355 MAPSET(&solv->suggestsmap, p);
3359 for (i = 1; i < pool->nsolvables; i++)
3361 if (solv->decisionmap[i] != 0)
3363 s = pool->solvables + i;
3364 if (!MAPTST(&solv->suggestsmap, i))
3368 if (!pool_installable(pool, s))
3370 if (!solver_is_enhancing(solv, s))
3373 queue_push(&solv->suggestions, i);
3375 policy_filter_unwanted(solv, &solv->suggestions, 0, POLICY_MODE_SUGGEST);
3378 if (solv->problems.count)
3379 problems_to_solutions(solv, job);