2 * Copyright (c) 2007-2009, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * SAT based dependency solver
26 #include "solverdebug.h"
28 #define RULES_BLOCK 63
30 static void addrpmruleinfo(Solver *solv, Id p, Id d, int type, Id dep);
32 /*-------------------------------------------------------------------
33 * Check if dependency is possible
35 * mirrors solver_dep_fulfilled but uses map m instead of the decisionmap
39 dep_possible(Solver *solv, Id dep, Map *m)
41 Pool *pool = solv->pool;
46 Reldep *rd = GETRELDEP(pool, dep);
47 if (rd->flags == REL_AND)
49 if (!dep_possible(solv, rd->name, m))
51 return dep_possible(solv, rd->evr, m);
53 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
54 return solver_splitprovides(solv, rd->evr);
55 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
56 return solver_dep_installed(solv, rd->evr);
58 FOR_PROVIDES(p, pp, dep)
66 /********************************************************************
70 * - unify rules, remove duplicates
73 /*-------------------------------------------------------------------
75 * compare rules for unification sort
80 unifyrules_sortcmp(const void *ap, const void *bp, void *dp)
90 return x; /* p differs */
93 if (a->d == 0 && b->d == 0)
94 return a->w2 - b->w2; /* assertion: return w2 diff */
96 if (a->d == 0) /* a is assertion, b not */
98 x = a->w2 - pool->whatprovidesdata[b->d];
102 if (b->d == 0) /* b is assertion, a not */
104 x = pool->whatprovidesdata[a->d] - b->w2;
108 /* compare whatprovidesdata */
109 ad = pool->whatprovidesdata + a->d;
110 bd = pool->whatprovidesdata + b->d;
112 if ((x = *ad++ - *bd++) != 0)
118 solver_samerule(Solver *solv, Rule *r1, Rule *r2)
120 return unifyrules_sortcmp(r1, r2, solv->pool);
124 /*-------------------------------------------------------------------
127 * go over all rules and remove duplicates
131 solver_unifyrules(Solver *solv)
133 Pool *pool = solv->pool;
137 if (solv->nrules <= 1) /* nothing to unify */
140 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- unifyrules -----\n");
142 /* sort rules first */
143 sat_sort(solv->rules + 1, solv->nrules - 1, sizeof(Rule), unifyrules_sortcmp, solv->pool);
150 for (i = j = 1, ir = solv->rules + i; i < solv->nrules; i++, ir++)
152 if (jr && !unifyrules_sortcmp(ir, jr, pool))
153 continue; /* prune! */
154 jr = solv->rules + j++; /* keep! */
159 /* reduced count from nrules to j rules */
160 POOL_DEBUG(SAT_DEBUG_STATS, "pruned rules from %d to %d\n", solv->nrules, j);
162 /* adapt rule buffer */
164 solv->rules = sat_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
167 * debug: log rule statistics
169 IF_POOLDEBUG (SAT_DEBUG_STATS)
176 for (i = 1; i < solv->nrules; i++)
183 dp = solv->pool->whatprovidesdata + r->d;
188 POOL_DEBUG(SAT_DEBUG_STATS, " binary: %d\n", binr);
189 POOL_DEBUG(SAT_DEBUG_STATS, " normal: %d, %d literals\n", solv->nrules - 1 - binr, lits);
191 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- unifyrules end -----\n");
201 hashrule(Solver *solv, Id p, Id d, int n)
203 unsigned int x = (unsigned int)p;
207 return (x * 37) ^ (unsigned int)d;
208 dp = solv->pool->whatprovidesdata + d;
210 x = (x * 37) ^ (unsigned int)*dp++;
216 /*-------------------------------------------------------------------
222 * p = direct literal; always < 0 for installed rpm rules
223 * d, if < 0 direct literal, if > 0 offset into whatprovides, if == 0 rule is assertion (look at p only)
226 * A requires b, b provided by B1,B2,B3 => (-A|B1|B2|B3)
228 * p < 0 : pkg id of A
229 * d > 0 : Offset in whatprovidesdata (list of providers of b)
231 * A conflicts b, b provided by B1,B2,B3 => (-A|-B1), (-A|-B2), (-A|-B3)
232 * p < 0 : pkg id of A
233 * d < 0 : Id of solvable (e.g. B1)
235 * d == 0: unary rule, assertion => (A) or (-A)
237 * Install: p > 0, d = 0 (A) user requested install
238 * Remove: p < 0, d = 0 (-A) user requested remove (also: uninstallable)
239 * Requires: p < 0, d > 0 (-A|B1|B2|...) d: <list of providers for requirement of p>
240 * Updates: p > 0, d > 0 (A|B1|B2|...) d: <list of updates for solvable p>
241 * Conflicts: p < 0, d < 0 (-A|-B) either p (conflict issuer) or d (conflict provider) (binary rule)
242 * also used for obsoletes
243 * ?: p > 0, d < 0 (A|-B)
244 * No-op ?: p = 0, d = 0 (null) (used as policy rule placeholder)
248 * Direct assertion (no watch needed)( if d <0 ) --> d = 0, w1 = p, w2 = 0
249 * Binary rule: p = first literal, d = 0, w2 = second literal, w1 = p
250 * every other : w1 = p, w2 = whatprovidesdata[d];
251 * Disabled rule: w1 = 0
253 * always returns a rule for non-rpm rules
257 solver_addrule(Solver *solv, Id p, Id d)
259 Pool *pool = solv->pool;
263 int n = 0; /* number of literals in rule - 1
264 0 = direct assertion (single literal)
269 /* it often happenes that requires lead to adding the same rpm rule
270 * multiple times, so we prune those duplicates right away to make
271 * the work for unifyrules a bit easier */
273 if (solv->nrules /* we already have rules */
274 && !solv->rpmrules_end) /* but are not done with rpm rules */
276 r = solv->rules + solv->nrules - 1; /* get the last added rule */
277 if (r->p == p && r->d == d && d != 0) /* identical and not user requested */
282 * compute number of literals (n) in rule
287 /* always a binary rule */
289 return 0; /* ignore self conflict */
294 for (dp = pool->whatprovidesdata + d; *dp; dp++, n++)
296 return 0; /* rule is self-fulfilling */
298 if (n == 1) /* have single provider */
299 d = dp[-1]; /* take single literal */
302 if (n == 1 && p > d && !solv->rpmrules_end)
304 /* smallest literal first so we can find dups */
305 n = p; p = d; d = n; /* p <-> d */
306 n = 1; /* re-set n, was used as temp var */
310 * check for duplicate
313 /* check if the last added rule (r) is exactly the same as what we're looking for. */
314 if (r && n == 1 && !r->d && r->p == p && r->w2 == d)
315 return r; /* binary rule */
317 /* have n-ary rule with same first literal, check other literals */
318 if (r && n > 1 && r->d && r->p == p)
320 /* Rule where d is an offset in whatprovidesdata */
324 dp2 = pool->whatprovidesdata + r->d;
325 for (dp = pool->whatprovidesdata + d; *dp; dp++, dp2++)
336 /* extend rule buffer */
337 solv->rules = sat_extend(solv->rules, solv->nrules, 1, sizeof(Rule), RULES_BLOCK);
338 r = solv->rules + solv->nrules++; /* point to rule space */
347 /* direct assertion, no watch needed */
363 r->w2 = pool->whatprovidesdata[d];
368 IF_POOLDEBUG (SAT_DEBUG_RULE_CREATION)
370 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, " Add rule: ");
371 solver_printrule(solv, SAT_DEBUG_RULE_CREATION, r);
378 /******************************************************************************
380 *** rpm rule part: create rules representing the package dependencies
385 * special multiversion patch conflict handling:
386 * a patch conflict is also satisfied, if some other
387 * version with the same name/arch that doesn't conflict
388 * get's installed. The generated rule is thus:
389 * -patch|-cpack|opack1|opack2|...
392 makemultiversionconflict(Solver *solv, Id n, Id con)
394 Pool *pool = solv->pool;
399 sn = pool->solvables + n;
400 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
402 FOR_PROVIDES(p, pp, sn->name)
404 s = pool->solvables + p;
405 if (s->name != sn->name || s->arch != sn->arch)
407 if (!MAPTST(&solv->noobsoletes, p))
409 if (pool_match_nevr(pool, pool->solvables + p, con))
411 /* here we have a multiversion solvable that doesn't conflict */
412 /* thus we're not in conflict if it is installed */
416 return -n; /* no other package found, generate normal conflict */
417 return pool_queuetowhatprovides(pool, &q);
421 addrpmrule(Solver *solv, Id p, Id d, int type, Id dep)
423 if (!solv->ruleinfoq)
424 solver_addrule(solv, p, d);
426 addrpmruleinfo(solv, p, d, type, dep);
429 /*-------------------------------------------------------------------
431 * add (install) rules for solvable
433 * s: Solvable for which to add rules
434 * m: m[s] = 1 for solvables which have rules, prevent rule duplication
436 * Algorithm: 'visit all nodes of a graph'. The graph nodes are
437 * solvables, the edges their dependencies.
438 * Starting from an installed solvable, this will create all rules
439 * representing the graph created by the solvables dependencies.
441 * for unfulfilled requirements, conflicts, obsoletes,....
442 * add a negative assertion for solvables that are not installable
444 * It will also create rules for all solvables referenced by 's'
445 * i.e. descend to all providers of requirements of 's'
450 solver_addrpmrulesforsolvable(Solver *solv, Solvable *s, Map *m)
452 Pool *pool = solv->pool;
453 Repo *installed = solv->installed;
455 /* 'work' queue. keeps Ids of solvables we still have to work on.
456 And buffer for it. */
461 /* if to add rules for broken deps ('rpm -V' functionality)
465 /* Id var and pointer for each dependency
466 * (not used in parallel)
473 Id p, pp; /* whatprovides loops */
474 Id *dp; /* ptr to 'whatprovides' */
475 Id n; /* Id for current solvable 's' */
477 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforsolvable -----\n");
479 queue_init_buffer(&workq, workqbuf, sizeof(workqbuf)/sizeof(*workqbuf));
480 queue_push(&workq, s - pool->solvables); /* push solvable Id to work queue */
482 /* loop until there's no more work left */
487 * s: Pointer to solvable
490 n = queue_shift(&workq); /* 'pop' next solvable to work on from queue */
493 if (MAPTST(m, n)) /* continue if already visited */
495 MAPSET(m, n); /* mark as visited */
498 s = pool->solvables + n; /* s = Solvable in question */
501 if (installed /* Installed system available */
502 && !solv->fixsystem /* NOT repair errors in rpm dependency graph */
503 && s->repo == installed /* solvable is installed */
504 && (!solv->fixmap.size || !MAPTST(&solv->fixmap, n - installed->start)))
506 dontfix = 1; /* dont care about broken rpm deps */
510 && s->arch != ARCH_SRC
511 && s->arch != ARCH_NOSRC
512 && !pool_installable(pool, s))
514 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, "package %s [%d] is not installable\n", solvable2str(pool, s), (Id)(s - pool->solvables));
515 addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOT_INSTALLABLE, 0);
518 /* yet another SUSE hack, sigh */
519 if (pool->nscallback && !strncmp("product:", id2str(pool, s->name), 8))
521 Id buddy = pool->nscallback(pool, pool->nscallbackdata, NAMESPACE_PRODUCTBUDDY, n);
522 if (buddy > 0 && buddy != SYSTEMSOLVABLE && buddy != n && buddy < pool->nsolvables)
524 addrpmrule(solv, n, -buddy, SOLVER_RULE_RPM_PACKAGE_REQUIRES, solvable_selfprovidedep(pool->solvables + n));
525 addrpmrule(solv, buddy, -n, SOLVER_RULE_RPM_PACKAGE_REQUIRES, solvable_selfprovidedep(pool->solvables + buddy));
526 if (m && !MAPTST(m, buddy))
527 queue_push(&workq, buddy);
531 /*-----------------------------------------
532 * check requires of s
537 reqp = s->repo->idarraydata + s->requires;
538 while ((req = *reqp++) != 0) /* go through all requires */
540 if (req == SOLVABLE_PREREQMARKER) /* skip the marker */
543 /* find list of solvables providing 'req' */
544 dp = pool_whatprovides_ptr(pool, req);
546 if (*dp == SYSTEMSOLVABLE) /* always installed */
551 /* the strategy here is to not insist on dependencies
552 * that are already broken. so if we find one provider
553 * that was already installed, we know that the
554 * dependency was not broken before so we enforce it */
556 /* check if any of the providers for 'req' is installed */
557 for (i = 0; (p = dp[i]) != 0; i++)
559 if (pool->solvables[p].repo == installed)
560 break; /* provider was installed */
562 /* didn't find an installed provider: previously broken dependency */
565 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, "ignoring broken requires %s of installed package %s\n", dep2str(pool, req), solvable2str(pool, s));
572 /* nothing provides req! */
573 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", solvable2str(pool, s), (Id)(s - pool->solvables), dep2str(pool, req));
574 addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP, req);
578 IF_POOLDEBUG (SAT_DEBUG_RULE_CREATION)
580 POOL_DEBUG(SAT_DEBUG_RULE_CREATION," %s requires %s\n", solvable2str(pool, s), dep2str(pool, req));
581 for (i = 0; dp[i]; i++)
582 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, " provided by %s\n", solvid2str(pool, dp[i]));
585 /* add 'requires' dependency */
586 /* rule: (-requestor|provider1|provider2|...|providerN) */
587 addrpmrule(solv, -n, dp - pool->whatprovidesdata, SOLVER_RULE_RPM_PACKAGE_REQUIRES, req);
589 /* descend the dependency tree
590 push all non-visited providers on the work queue */
596 queue_push(&workq, *dp);
600 } /* while, requirements of n */
602 } /* if, requirements */
604 /* that's all we check for src packages */
605 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
608 /*-----------------------------------------
609 * check conflicts of s
616 /* we treat conflicts in patches a bit differen:
618 * - multiversion handling
619 * XXX: we should really handle this different, looking
620 * at the name is a bad hack
622 if (!strncmp("patch:", id2str(pool, s->name), 6))
624 conp = s->repo->idarraydata + s->conflicts;
625 /* foreach conflicts of 's' */
626 while ((con = *conp++) != 0)
628 /* foreach providers of a conflict of 's' */
629 FOR_PROVIDES(p, pp, con)
631 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, con))
633 /* dontfix: dont care about conflicts with already installed packs */
634 if (dontfix && pool->solvables[p].repo == installed)
636 /* p == n: self conflict */
637 if (p == n && !pool->allowselfconflicts)
641 Reldep *rd = GETRELDEP(pool, con);
642 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
645 p = 0; /* make it a negative assertion, aka 'uninstallable' */
647 if (p && ispatch && solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p) && ISRELDEP(con))
649 /* our patch conflicts with a noobsoletes (aka multiversion) package */
650 p = -makemultiversionconflict(solv, p, con);
652 /* rule: -n|-p: either solvable _or_ provider of conflict */
653 addrpmrule(solv, -n, -p, p ? SOLVER_RULE_RPM_PACKAGE_CONFLICT : SOLVER_RULE_RPM_SELF_CONFLICT, con);
658 /*-----------------------------------------
659 * check obsoletes if not installed
660 * (only installation will trigger the obsoletes in rpm)
662 if (!installed || pool->solvables[n].repo != installed)
663 { /* not installed */
664 int noobs = solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n);
665 if (s->obsoletes && !noobs)
667 obsp = s->repo->idarraydata + s->obsoletes;
668 /* foreach obsoletes */
669 while ((obs = *obsp++) != 0)
671 /* foreach provider of an obsoletes of 's' */
672 FOR_PROVIDES(p, pp, obs)
674 Solvable *ps = pool->solvables + p;
675 if (!pool->obsoleteusesprovides /* obsoletes are matched names, not provides */
676 && !pool_match_nevr(pool, ps, obs))
678 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
680 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_PACKAGE_OBSOLETES, obs);
684 FOR_PROVIDES(p, pp, s->name)
686 Solvable *ps = pool->solvables + p;
687 /* we still obsolete packages with same nevra, like rpm does */
688 /* (actually, rpm mixes those packages. yuck...) */
689 if (noobs && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
691 if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
693 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
695 if (s->name == ps->name)
696 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_SAME_NAME, 0);
698 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_IMPLICIT_OBSOLETES, s->name);
702 /*-----------------------------------------
703 * add recommends to the work queue
705 if (s->recommends && m)
707 recp = s->repo->idarraydata + s->recommends;
708 while ((rec = *recp++) != 0)
710 FOR_PROVIDES(p, pp, rec)
712 queue_push(&workq, p);
715 if (s->suggests && m)
717 sugp = s->repo->idarraydata + s->suggests;
718 while ((sug = *sugp++) != 0)
720 FOR_PROVIDES(p, pp, sug)
722 queue_push(&workq, p);
727 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforsolvable end -----\n");
731 /*-------------------------------------------------------------------
733 * Add package rules for weak rules
735 * m: visited solvables
739 solver_addrpmrulesforweak(Solver *solv, Map *m)
741 Pool *pool = solv->pool;
746 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforweak -----\n");
747 /* foreach solvable in pool */
748 for (i = n = 1; n < pool->nsolvables; i++, n++)
750 if (i == pool->nsolvables) /* wrap i */
752 if (MAPTST(m, i)) /* been there */
755 s = pool->solvables + i;
756 if (!pool_installable(pool, s)) /* only look at installable ones */
762 /* find possible supplements */
763 supp = s->repo->idarraydata + s->supplements;
764 while ((sup = *supp++) != ID_NULL)
765 if (dep_possible(solv, sup, m))
769 /* if nothing found, check for enhances */
770 if (!sup && s->enhances)
772 supp = s->repo->idarraydata + s->enhances;
773 while ((sup = *supp++) != ID_NULL)
774 if (dep_possible(solv, sup, m))
777 /* if nothing found, goto next solvables */
780 solver_addrpmrulesforsolvable(solv, s, m);
781 n = 0; /* check all solvables again */
783 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforweak end -----\n");
787 /*-------------------------------------------------------------------
789 * add package rules for possible updates
792 * m: map of already visited solvables
793 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
797 solver_addrpmrulesforupdaters(Solver *solv, Solvable *s, Map *m, int allow_all)
799 Pool *pool = solv->pool;
801 /* queue and buffer for it */
805 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforupdaters -----\n");
807 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
808 /* find update candidates for 's' */
809 policy_findupdatepackages(solv, s, &qs, allow_all);
810 /* add rule for 's' if not already done */
811 if (!MAPTST(m, s - pool->solvables))
812 solver_addrpmrulesforsolvable(solv, s, m);
813 /* foreach update candidate, add rule if not already done */
814 for (i = 0; i < qs.count; i++)
815 if (!MAPTST(m, qs.elements[i]))
816 solver_addrpmrulesforsolvable(solv, pool->solvables + qs.elements[i], m);
819 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforupdaters -----\n");
823 /***********************************************************************
825 *** Update/Feature rule part
827 *** Those rules make sure an installed package isn't silently deleted
832 finddistupgradepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
834 Pool *pool = solv->pool;
837 policy_findupdatepackages(solv, s, qs, allow_all);
841 return 0; /* orphaned, don't create feature rule */
842 /* check if this is an orphaned package */
843 policy_findupdatepackages(solv, s, qs, 1);
845 return 0; /* orphaned, don't create update rule */
847 return -SYSTEMSOLVABLE; /* supported but not installable */
850 return s - pool->solvables;
851 /* check if it is ok to keep the installed package */
852 for (i = 0; i < qs->count; i++)
854 Solvable *ns = pool->solvables + qs->elements[i];
855 if (s->evr == ns->evr && solvable_identical(s, ns))
856 return s - pool->solvables;
858 /* nope, it must be some other package */
859 return -SYSTEMSOLVABLE;
862 /* add packages from the dup repositories to the update candidates
863 * this isn't needed for the global dup mode as all packages are
864 * from dup repos in that case */
866 addduppackages(Solver *solv, Solvable *s, Queue *qs)
871 int oldnoupdateprovide = solv->noupdateprovide;
873 queue_init_buffer(&dupqs, dupqsbuf, sizeof(dupqsbuf)/sizeof(*dupqsbuf));
874 solv->noupdateprovide = 1;
875 policy_findupdatepackages(solv, s, &dupqs, 2);
876 solv->noupdateprovide = oldnoupdateprovide;
877 for (i = 0; i < dupqs.count; i++)
879 p = dupqs.elements[i];
880 if (MAPTST(&solv->dupmap, p))
881 queue_pushunique(qs, p);
886 /*-------------------------------------------------------------------
888 * add rule for update
889 * (A|A1|A2|A3...) An = update candidates for A
891 * s = (installed) solvable
895 solver_addupdaterule(Solver *solv, Solvable *s, int allow_all)
897 /* installed packages get a special upgrade allowed rule */
898 Pool *pool = solv->pool;
903 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addupdaterule -----\n");
904 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
905 p = s - pool->solvables;
906 /* find update candidates for 's' */
907 if (solv->distupgrade)
908 p = finddistupgradepackages(solv, s, &qs, allow_all);
910 policy_findupdatepackages(solv, s, &qs, allow_all);
911 if (!allow_all && !solv->distupgrade && solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
912 addduppackages(solv, s, &qs);
914 if (!allow_all && qs.count && solv->noobsoletes.size)
918 d = pool_queuetowhatprovides(pool, &qs);
919 /* filter out all noobsoletes packages as they don't update */
920 for (i = j = 0; i < qs.count; i++)
922 if (MAPTST(&solv->noobsoletes, qs.elements[i]))
924 /* it's ok if they have same nevra */
925 Solvable *ps = pool->solvables + qs.elements[i];
926 if (ps->name != s->name || ps->evr != s->evr || ps->arch != s->arch)
929 qs.elements[j++] = qs.elements[i];
931 if (j == 0 && p == -SYSTEMSOLVABLE && solv->distupgrade)
933 queue_push(&solv->orphaned, s - pool->solvables); /* treat as orphaned */
938 if (d && solv->updatesystem && solv->installed && s->repo == solv->installed)
940 if (!solv->multiversionupdaters)
941 solv->multiversionupdaters = sat_calloc(solv->installed->end - solv->installed->start, sizeof(Id));
942 solv->multiversionupdaters[s - pool->solvables - solv->installed->start] = d;
947 if (qs.count && p == -SYSTEMSOLVABLE)
948 p = queue_shift(&qs);
949 d = qs.count ? pool_queuetowhatprovides(pool, &qs) : 0;
951 solver_addrule(solv, p, d); /* allow update of s */
952 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addupdaterule end -----\n");
956 disableupdaterule(Solver *solv, Id p)
960 MAPSET(&solv->noupdate, p - solv->installed->start);
961 r = solv->rules + solv->updaterules + (p - solv->installed->start);
962 if (r->p && r->d >= 0)
963 solver_disablerule(solv, r);
964 r = solv->rules + solv->featurerules + (p - solv->installed->start);
965 if (r->p && r->d >= 0)
966 solver_disablerule(solv, r);
970 reenableupdaterule(Solver *solv, Id p)
972 Pool *pool = solv->pool;
975 MAPCLR(&solv->noupdate, p - solv->installed->start);
976 r = solv->rules + solv->updaterules + (p - solv->installed->start);
981 solver_enablerule(solv, r);
982 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
984 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
985 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
989 r = solv->rules + solv->featurerules + (p - solv->installed->start);
990 if (r->p && r->d < 0)
992 solver_enablerule(solv, r);
993 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
995 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
996 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
1002 /***********************************************************************
1004 *** Infarch rule part
1006 *** Infarch rules make sure the solver uses the best architecture of
1007 *** a package if multiple archetectures are available
1012 solver_addinfarchrules(Solver *solv, Map *addedmap)
1014 Pool *pool = solv->pool;
1016 Id p, pp, a, aa, bestarch;
1017 Solvable *s, *ps, *bests;
1018 Queue badq, allowedarchs;
1021 queue_init(&allowedarchs);
1022 solv->infarchrules = solv->nrules;
1023 for (i = 1; i < pool->nsolvables; i++)
1025 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1027 s = pool->solvables + i;
1031 queue_empty(&allowedarchs);
1032 FOR_PROVIDES(p, pp, s->name)
1034 ps = pool->solvables + p;
1035 if (ps->name != s->name || !MAPTST(addedmap, p))
1042 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1043 if (a != 1 && pool->installed && ps->repo == pool->installed)
1045 if (!solv->distupgrade)
1046 queue_pushunique(&allowedarchs, ps->arch); /* also ok to keep this architecture */
1047 continue; /* ignore installed solvables when calculating the best arch */
1049 if (a && a != 1 && (!bestarch || a < bestarch))
1057 /* speed up common case where installed package already has best arch */
1058 if (allowedarchs.count == 1 && bests && allowedarchs.elements[0] == bests->arch)
1059 allowedarchs.count--; /* installed arch is best */
1061 FOR_PROVIDES(p, pp, s->name)
1063 ps = pool->solvables + p;
1064 if (ps->name != s->name || !MAPTST(addedmap, p))
1067 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1068 if (a != 1 && bestarch && ((a ^ bestarch) & 0xffff0000) != 0)
1070 for (j = 0; j < allowedarchs.count; j++)
1072 aa = allowedarchs.elements[j];
1075 aa = (aa <= pool->lastarch) ? pool->id2arch[aa] : 0;
1076 if (aa && ((a ^ aa) & 0xffff0000) == 0)
1077 break; /* compatible */
1079 if (j == allowedarchs.count)
1080 queue_push(&badq, p);
1085 /* block all solvables in the badq! */
1086 for (j = 0; j < badq.count; j++)
1088 p = badq.elements[j];
1089 solver_addrule(solv, -p, 0);
1093 queue_free(&allowedarchs);
1094 solv->infarchrules_end = solv->nrules;
1098 disableinfarchrule(Solver *solv, Id name)
1100 Pool *pool = solv->pool;
1103 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1105 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1106 solver_disablerule(solv, r);
1111 reenableinfarchrule(Solver *solv, Id name)
1113 Pool *pool = solv->pool;
1116 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1118 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1120 solver_enablerule(solv, r);
1121 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
1123 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1124 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
1131 /***********************************************************************
1135 *** Dup rules make sure a package is selected from the specified dup
1136 *** repositories if an update candidate is included in one of them.
1141 solver_createdupmaps(Solver *solv)
1143 Queue *job = &solv->job;
1144 Pool *pool = solv->pool;
1146 Id how, what, p, pi, pp, obs, *obsp;
1150 map_init(&solv->dupmap, pool->nsolvables);
1151 map_init(&solv->dupinvolvedmap, pool->nsolvables);
1152 for (i = 0; i < job->count; i += 2)
1154 how = job->elements[i];
1155 what = job->elements[i + 1];
1156 switch (how & SOLVER_JOBMASK)
1158 case SOLVER_DISTUPGRADE:
1159 if (what <= 0 || what > pool->nrepos)
1161 repo = pool_id2repo(pool, what);
1162 FOR_REPO_SOLVABLES(repo, p, s)
1164 MAPSET(&solv->dupmap, p);
1165 FOR_PROVIDES(pi, pp, s->name)
1167 ps = pool->solvables + pi;
1168 if (ps->name != s->name)
1170 MAPSET(&solv->dupinvolvedmap, pi);
1174 /* FIXME: check obsoletes/provides combination */
1175 obsp = s->repo->idarraydata + s->obsoletes;
1176 while ((obs = *obsp++) != 0)
1178 FOR_PROVIDES(pi, pp, obs)
1180 Solvable *pis = pool->solvables + pi;
1181 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pis, obs))
1183 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, pis))
1185 MAPSET(&solv->dupinvolvedmap, pi);
1195 MAPCLR(&solv->dupinvolvedmap, SYSTEMSOLVABLE);
1199 solver_freedupmaps(Solver *solv)
1201 map_free(&solv->dupmap);
1202 map_free(&solv->dupinvolvedmap);
1206 solver_addduprules(Solver *solv, Map *addedmap)
1208 Pool *pool = solv->pool;
1213 solv->duprules = solv->nrules;
1214 for (i = 1; i < pool->nsolvables; i++)
1216 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1218 s = pool->solvables + i;
1220 FOR_PROVIDES(p, pp, s->name)
1222 ps = pool->solvables + p;
1223 if (ps->name != s->name || !MAPTST(addedmap, p))
1229 if (!MAPTST(&solv->dupinvolvedmap, p))
1231 if (solv->installed && ps->repo == solv->installed)
1233 if (!solv->updatemap.size)
1234 map_grow(&solv->updatemap, solv->installed->end - solv->installed->start);
1235 MAPSET(&solv->updatemap, p - solv->installed->start);
1236 if (!MAPTST(&solv->dupmap, p))
1239 /* is installed identical to a good one? */
1240 FOR_PROVIDES(ip, ipp, s->name)
1242 Solvable *is = pool->solvables + ip;
1243 if (!MAPTST(&solv->dupmap, ip))
1245 if (is->evr == s->evr && solvable_identical(s, is))
1249 solver_addrule(solv, -p, 0); /* no match, sorry */
1252 else if (!MAPTST(&solv->dupmap, p))
1253 solver_addrule(solv, -p, 0);
1256 solv->duprules_end = solv->nrules;
1261 disableduprule(Solver *solv, Id name)
1263 Pool *pool = solv->pool;
1266 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1268 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1269 solver_disablerule(solv, r);
1274 reenableduprule(Solver *solv, Id name)
1276 Pool *pool = solv->pool;
1279 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1281 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1283 solver_enablerule(solv, r);
1284 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
1286 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1287 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
1294 /***********************************************************************
1296 *** Policy rule disabling/reenabling
1298 *** Disable all policy rules that conflict with our jobs. If a job
1299 *** gets disabled later on, reenable the involved policy rules again.
1303 #define DISABLE_UPDATE 1
1304 #define DISABLE_INFARCH 2
1305 #define DISABLE_DUP 3
1308 jobtodisablelist(Solver *solv, Id how, Id what, Queue *q)
1310 Pool *pool = solv->pool;
1316 installed = solv->installed;
1317 select = how & SOLVER_SELECTMASK;
1318 switch (how & SOLVER_JOBMASK)
1320 case SOLVER_INSTALL:
1321 if ((select == SOLVER_SOLVABLE_NAME || select == SOLVER_SOLVABLE_PROVIDES) && solv->infarchrules != solv->infarchrules_end && ISRELDEP(what))
1323 Reldep *rd = GETRELDEP(pool, what);
1324 if (rd->flags == REL_ARCH)
1326 int qcnt = q->count;
1327 FOR_JOB_SELECT(p, pp, select, what)
1329 s = pool->solvables + p;
1331 for (i = qcnt; i < q->count; i += 2)
1332 if (q->elements[i + 1] == s->name)
1336 queue_push(q, DISABLE_INFARCH);
1337 queue_push(q, s->name);
1341 if (select != SOLVER_SOLVABLE)
1343 s = pool->solvables + what;
1344 if (solv->infarchrules != solv->infarchrules_end)
1346 queue_push(q, DISABLE_INFARCH);
1347 queue_push(q, s->name);
1349 if (solv->duprules != solv->duprules_end)
1351 queue_push(q, DISABLE_DUP);
1352 queue_push(q, s->name);
1356 if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, what))
1358 if (s->repo == installed)
1360 queue_push(q, DISABLE_UPDATE);
1361 queue_push(q, what);
1367 obsp = s->repo->idarraydata + s->obsoletes;
1368 while ((obs = *obsp++) != 0)
1369 FOR_PROVIDES(p, pp, obs)
1371 Solvable *ps = pool->solvables + p;
1372 if (ps->repo != installed)
1374 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1376 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1378 queue_push(q, DISABLE_UPDATE);
1382 FOR_PROVIDES(p, pp, s->name)
1384 Solvable *ps = pool->solvables + p;
1385 if (ps->repo != installed)
1387 if (!pool->implicitobsoleteusesprovides && ps->name != s->name)
1389 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1391 queue_push(q, DISABLE_UPDATE);
1398 FOR_JOB_SELECT(p, pp, select, what)
1399 if (pool->solvables[p].repo == installed)
1401 queue_push(q, DISABLE_UPDATE);
1410 /* disable all policy rules that are in conflict with our job list */
1412 solver_disablepolicyrules(Solver *solv)
1414 Queue *job = &solv->job;
1421 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1423 for (i = solv->jobrules; i < solv->jobrules_end; i++)
1425 r = solv->rules + i;
1426 if (r->d < 0) /* disabled? */
1428 j = solv->ruletojob.elements[i - solv->jobrules];
1432 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1434 MAPZERO(&solv->noupdate);
1435 for (i = 0; i < allq.count; i += 2)
1437 Id type = allq.elements[i], arg = allq.elements[i + 1];
1440 case DISABLE_UPDATE:
1441 disableupdaterule(solv, arg);
1443 case DISABLE_INFARCH:
1444 disableinfarchrule(solv, arg);
1447 disableduprule(solv, arg);
1456 /* we just disabled job #jobidx, now reenable all policy rules that were
1457 * disabled because of this job */
1459 solver_reenablepolicyrules(Solver *solv, int jobidx)
1461 Queue *job = &solv->job;
1466 Id qbuf[32], allqbuf[128];
1468 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
1469 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1470 jobtodisablelist(solv, job->elements[jobidx], job->elements[jobidx + 1], &q);
1473 for (i = solv->jobrules; i < solv->jobrules_end; i++)
1475 r = solv->rules + i;
1476 if (r->d < 0) /* disabled? */
1478 j = solv->ruletojob.elements[i - solv->jobrules];
1482 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1484 for (j = 0; j < q.count; j += 2)
1486 Id type = q.elements[j], arg = q.elements[j + 1];
1487 for (i = 0; i < allq.count; i += 2)
1488 if (allq.elements[i] == type && allq.elements[i + 1] == arg)
1491 continue; /* still disabled */
1494 case DISABLE_UPDATE:
1495 reenableupdaterule(solv, arg);
1497 case DISABLE_INFARCH:
1498 reenableinfarchrule(solv, arg);
1501 reenableduprule(solv, arg);
1510 /***********************************************************************
1512 *** Rule info part, tell the user what the rule is about.
1517 addrpmruleinfo(Solver *solv, Id p, Id d, int type, Id dep)
1519 Pool *pool = solv->pool;
1523 /* check if this creates the rule we're searching for */
1524 r = solv->rules + solv->ruleinfoq->elements[0];
1526 od = r->d < 0 ? -r->d - 1 : r->d;
1531 if (p < 0 && d > 0 && (!pool->whatprovidesdata[d] || !pool->whatprovidesdata[d + 1]))
1533 w2 = pool->whatprovidesdata[d];
1537 if (p > 0 && d < 0) /* this hack is used for buddy deps */
1549 Id *dp = pool->whatprovidesdata + d;
1550 Id *odp = pool->whatprovidesdata + od;
1552 if (*dp++ != *odp++)
1558 /* handle multiversion conflict rules */
1559 if (p < 0 && pool->whatprovidesdata[d] < 0)
1561 w2 = pool->whatprovidesdata[d];
1562 /* XXX: free memory */
1572 if (w2 != op || p != ow2)
1577 if (p != op || w2 != ow2)
1581 /* yep, rule matches. record info */
1582 queue_push(solv->ruleinfoq, type);
1583 if (type == SOLVER_RULE_RPM_SAME_NAME)
1585 /* we normalize same name order */
1586 queue_push(solv->ruleinfoq, op < 0 ? -op : 0);
1587 queue_push(solv->ruleinfoq, ow2 < 0 ? -ow2 : 0);
1591 queue_push(solv->ruleinfoq, p < 0 ? -p : 0);
1592 queue_push(solv->ruleinfoq, w2 < 0 ? -w2 : 0);
1594 queue_push(solv->ruleinfoq, dep);
1598 solver_allruleinfos_cmp(const void *ap, const void *bp, void *dp)
1600 const Id *a = ap, *b = bp;
1619 solver_allruleinfos(Solver *solv, Id rid, Queue *rq)
1621 Pool *pool = solv->pool;
1622 Rule *r = solv->rules + rid;
1626 if (rid <= 0 || rid >= solv->rpmrules_end)
1628 Id type, from, to, dep;
1629 type = solver_ruleinfo(solv, rid, &from, &to, &dep);
1630 queue_push(rq, type);
1631 queue_push(rq, from);
1633 queue_push(rq, dep);
1638 queue_push(rq, rid);
1639 solv->ruleinfoq = rq;
1640 solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
1641 /* also try reverse direction for conflicts */
1642 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
1643 solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
1644 solv->ruleinfoq = 0;
1646 /* now sort & unify em */
1649 sat_sort(rq->elements, rq->count / 4, 4 * sizeof(Id), solver_allruleinfos_cmp, 0);
1650 /* throw out identical entries */
1651 for (i = j = 0; i < rq->count; i += 4)
1655 if (rq->elements[i] == rq->elements[j - 4] &&
1656 rq->elements[i + 1] == rq->elements[j - 3] &&
1657 rq->elements[i + 2] == rq->elements[j - 2] &&
1658 rq->elements[i + 3] == rq->elements[j - 1])
1661 rq->elements[j++] = rq->elements[i];
1662 rq->elements[j++] = rq->elements[i + 1];
1663 rq->elements[j++] = rq->elements[i + 2];
1664 rq->elements[j++] = rq->elements[i + 3];
1671 solver_ruleinfo(Solver *solv, Id rid, Id *fromp, Id *top, Id *depp)
1673 Pool *pool = solv->pool;
1674 Rule *r = solv->rules + rid;
1675 SolverRuleinfo type = SOLVER_RULE_UNKNOWN;
1683 if (rid > 0 && rid < solv->rpmrules_end)
1689 return SOLVER_RULE_RPM;
1693 queue_push(&rq, rid);
1694 solv->ruleinfoq = &rq;
1695 solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
1696 /* also try reverse direction for conflicts */
1697 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
1698 solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
1699 solv->ruleinfoq = 0;
1700 type = SOLVER_RULE_RPM;
1701 for (i = 1; i < rq.count; i += 4)
1704 qt = rq.elements[i];
1705 qp = rq.elements[i + 1];
1706 qo = rq.elements[i + 2];
1707 qd = rq.elements[i + 3];
1708 if (type == SOLVER_RULE_RPM || type > qt)
1722 if (rid >= solv->jobrules && rid < solv->jobrules_end)
1724 Id jidx = solv->ruletojob.elements[rid - solv->jobrules];
1728 *top = solv->job.elements[jidx];
1730 *depp = solv->job.elements[jidx + 1];
1731 if ((r->d == 0 || r->d == -1) && r->w2 == 0 && r->p == -SYSTEMSOLVABLE && (solv->job.elements[jidx] & SOLVER_SELECTMASK) != SOLVER_SOLVABLE_ONE_OF)
1732 return SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
1733 return SOLVER_RULE_JOB;
1735 if (rid >= solv->updaterules && rid < solv->updaterules_end)
1738 *fromp = solv->installed->start + (rid - solv->updaterules);
1739 return SOLVER_RULE_UPDATE;
1741 if (rid >= solv->featurerules && rid < solv->featurerules_end)
1744 *fromp = solv->installed->start + (rid - solv->featurerules);
1745 return SOLVER_RULE_FEATURE;
1747 if (rid >= solv->duprules && rid < solv->duprules_end)
1752 *depp = pool->solvables[-r->p].name;
1753 return SOLVER_RULE_DISTUPGRADE;
1755 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
1760 *depp = pool->solvables[-r->p].name;
1761 return SOLVER_RULE_INFARCH;
1763 if (rid >= solv->choicerules && rid < solv->choicerules_end)
1765 return SOLVER_RULE_CHOICE;
1767 if (rid >= solv->learntrules)
1769 return SOLVER_RULE_LEARNT;
1771 return SOLVER_RULE_UNKNOWN;
1775 addchoicerules(Solver *solv)
1777 Pool *pool = solv->pool;
1781 int i, j, rid, havechoice;
1786 solv->choicerules = solv->nrules;
1787 if (!pool->installed)
1789 solv->choicerules_end = solv->nrules;
1792 solv->choicerules_ref = sat_calloc(solv->rpmrules_end, sizeof(Id));
1795 map_init(&m, pool->nsolvables);
1796 for (rid = 1; rid < solv->rpmrules_end ; rid++)
1798 r = solv->rules + rid;
1799 if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 < 0))
1800 continue; /* only look at requires rules */
1801 // solver_printrule(solv, SAT_DEBUG_RESULT, r);
1805 FOR_RULELITERALS(p, pp, r)
1809 s = pool->solvables + p;
1812 if (s->repo == pool->installed)
1817 /* check if this package is "blocked" by a installed package */
1819 FOR_PROVIDES(p2, pp2, s->name)
1821 s2 = pool->solvables + p2;
1822 if (s2->repo != pool->installed)
1824 if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
1826 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
1832 /* found installed package */
1833 if (!solv->allowarchchange && s->arch != s2->arch && policy_illegal_archchange(solv, s, s2))
1835 if (!solv->allowvendorchange && s->vendor != s2->vendor && policy_illegal_vendorchange(solv, s, s2))
1837 queue_push(&qi, p2);
1843 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1845 while ((obs = *obsp++) != 0)
1847 FOR_PROVIDES(p2, pp2, obs)
1849 s2 = pool->solvables + p2;
1850 if (s2->repo != pool->installed)
1852 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
1854 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
1864 if (!solv->allowarchchange && s->arch != s2->arch && policy_illegal_archchange(solv, s, s2))
1866 if (!solv->allowvendorchange && s->vendor != s2->vendor && policy_illegal_vendorchange(solv, s, s2))
1868 queue_push(&qi, p2);
1873 /* this package is independent if the installed ones */
1876 if (!havechoice || !q.count)
1877 continue; /* no choice */
1879 /* now check the update rules of the installed package.
1880 * if all packages of the update rules are contained in
1881 * the dependency rules, there's no need to set up the choice rule */
1883 FOR_RULELITERALS(p, pp, r)
1886 for (i = 0; i < qi.count; i++)
1888 if (!qi.elements[i])
1890 Rule *ur = solv->rules + solv->updaterules + (qi.elements[i] - pool->installed->start);
1892 ur = solv->rules + solv->featurerules + (qi.elements[i] - pool->installed->start);
1895 FOR_RULELITERALS(p, pp, ur)
1900 for (j = i + 1; j < qi.count; j++)
1901 if (qi.elements[i] == qi.elements[j])
1907 printf("skipping choice ");
1908 solver_printrule(solv, SAT_DEBUG_RESULT, solv->rules + rid);
1912 d = q.count ? pool_queuetowhatprovides(pool, &q) : 0;
1913 solver_addrule(solv, r->p, d);
1914 queue_push(&solv->weakruleq, solv->nrules - 1);
1915 solv->choicerules_ref[solv->nrules - 1 - solv->choicerules] = rid;
1918 solver_printrule(solv, SAT_DEBUG_RESULT, solv->rules + rid);
1919 printf("WEAK CHOICE ");
1920 solver_printrule(solv, SAT_DEBUG_RESULT, solv->rules + solv->nrules - 1);
1926 solv->choicerules_end = solv->nrules;
1929 /* called when a choice rule is disabled by analyze_unsolvable. We also
1930 * have to disable all other choice rules so that the best packages get
1934 disablechoicerules(Solver *solv, Rule *r)
1937 Pool *pool = solv->pool;
1941 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
1942 map_init(&m, pool->nsolvables);
1943 FOR_RULELITERALS(p, pp, or)
1946 FOR_RULELITERALS(p, pp, r)
1949 for (rid = solv->choicerules; rid < solv->choicerules_end; rid++)
1951 r = solv->rules + rid;
1954 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
1955 FOR_RULELITERALS(p, pp, or)
1956 if (p > 0 && MAPTST(&m, p))
1959 solver_disablerule(solv, r);