2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
9 * Generic policy interface for SAT solver
19 #include "solver_private.h"
22 #include "poolvendor.h"
26 /*-----------------------------------------------------------------*/
29 * prep for prune_best_version
34 prune_to_best_version_sortcmp(const void *ap, const void *bp, void *dp)
42 sa = pool->solvables + a;
43 sb = pool->solvables + b;
44 r = sa->name - sb->name;
48 /* different names. We use real strcmp here so that the result
49 * is not depending on some random solvable order */
50 na = pool_id2str(pool, sa->name);
51 nb = pool_id2str(pool, sb->name);
52 return strcmp(na, nb);
54 if (sa->arch != sb->arch)
57 aa = (sa->arch <= pool->lastarch) ? pool->id2arch[sa->arch] : 0;
58 ab = (sb->arch <= pool->lastarch) ? pool->id2arch[sb->arch] : 0;
59 if (aa != ab && aa > 1 && ab > 1)
60 return aa - ab; /* lowest score first */
63 /* the same name, bring installed solvables to the front */
66 if (sa->repo == pool->installed)
68 if (sb->repo != pool->installed)
71 else if (sb->repo == pool->installed)
74 /* sort by repository sub-prio (installed repo handled above) */
75 r = (sb->repo ? sb->repo->subpriority : 0) - (sa->repo ? sa->repo->subpriority : 0);
78 /* no idea about the order, sort by id */
84 * prune to repository with highest priority.
85 * does not prune installed solvables.
89 prune_to_highest_prio(Pool *pool, Queue *plist)
93 int bestprio = 0, bestprioset = 0;
95 /* prune to highest priority */
96 for (i = 0; i < plist->count; i++) /* find highest prio in queue */
98 s = pool->solvables + plist->elements[i];
99 if (pool->installed && s->repo == pool->installed)
101 if (!bestprioset || s->repo->priority > bestprio)
103 bestprio = s->repo->priority;
109 for (i = j = 0; i < plist->count; i++) /* remove all with lower prio */
111 s = pool->solvables + plist->elements[i];
112 if (s->repo->priority == bestprio || (pool->installed && s->repo == pool->installed))
113 plist->elements[j++] = plist->elements[i];
119 prune_to_highest_prio_per_name(Pool *pool, Queue *plist)
126 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
127 queue_push(&pq, plist->elements[0]);
128 name = pool->solvables[pq.elements[0]].name;
129 for (i = 1, j = 0; i < plist->count; i++)
131 if (pool->solvables[plist->elements[i]].name != name)
134 prune_to_highest_prio(pool, &pq);
135 for (k = 0; k < pq.count; k++)
136 plist->elements[j++] = pq.elements[k];
138 queue_push(&pq, plist->elements[i]);
139 name = pool->solvables[pq.elements[0]].name;
143 prune_to_highest_prio(pool, &pq);
144 for (k = 0; k < pq.count; k++)
145 plist->elements[j++] = pq.elements[k];
152 * prune to recommended/suggested packages.
153 * does not prune installed packages (they are also somewhat recommended).
157 prune_to_recommended(Solver *solv, Queue *plist)
159 Pool *pool = solv->pool;
162 Id p, pp, rec, *recp, sug, *sugp;
167 for (i = 0; i < plist->count; i++)
169 p = plist->elements[i];
170 s = pool->solvables + p;
171 if (pool->installed && s->repo == pool->installed)
175 if (plist->count - ninst < 2)
178 /* update our recommendsmap/suggestsmap */
179 if (solv->recommends_index < 0)
181 MAPZERO(&solv->recommendsmap);
182 MAPZERO(&solv->suggestsmap);
183 solv->recommends_index = 0;
185 while (solv->recommends_index < solv->decisionq.count)
187 p = solv->decisionq.elements[solv->recommends_index++];
190 s = pool->solvables + p;
193 recp = s->repo->idarraydata + s->recommends;
194 while ((rec = *recp++) != 0)
195 FOR_PROVIDES(p, pp, rec)
196 MAPSET(&solv->recommendsmap, p);
200 sugp = s->repo->idarraydata + s->suggests;
201 while ((sug = *sugp++) != 0)
202 FOR_PROVIDES(p, pp, sug)
203 MAPSET(&solv->suggestsmap, p);
207 /* prune to recommended/supplemented */
209 for (i = j = 0; i < plist->count; i++)
211 p = plist->elements[i];
212 s = pool->solvables + p;
213 if (pool->installed && s->repo == pool->installed)
217 plist->elements[j++] = p;
220 if (!MAPTST(&solv->recommendsmap, p))
221 if (!solver_is_supplementing(solv, s))
225 for (k = 0; j < ninst; k++)
227 s = pool->solvables + plist->elements[k];
228 if (pool->installed && s->repo == pool->installed)
229 plist->elements[j++] = plist->elements[k];
232 plist->elements[j++] = p;
237 /* anything left to prune? */
238 if (plist->count - ninst < 2)
241 /* prune to suggested/enhanced */
243 for (i = j = 0; i < plist->count; i++)
245 p = plist->elements[i];
246 s = pool->solvables + p;
247 if (pool->installed && s->repo == pool->installed)
251 plist->elements[j++] = p;
254 if (!MAPTST(&solv->suggestsmap, p))
255 if (!solver_is_enhancing(solv, s))
259 for (k = 0; j < ninst; k++)
261 s = pool->solvables + plist->elements[k];
262 if (pool->installed && s->repo == pool->installed)
263 plist->elements[j++] = plist->elements[k];
266 plist->elements[j++] = p;
273 prune_to_best_arch(const Pool *pool, Queue *plist)
279 if (!pool->id2arch || plist->count < 2)
282 for (i = 0; i < plist->count; i++)
284 s = pool->solvables + plist->elements[i];
286 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
287 if (a && a != 1 && (!bestscore || a < bestscore))
292 for (i = j = 0; i < plist->count; i++)
294 s = pool->solvables + plist->elements[i];
296 if (a > pool->lastarch)
298 a = pool->id2arch[a];
299 /* a == 1 -> noarch */
300 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
302 plist->elements[j++] = plist->elements[i];
319 /* This is Tarjan's SCC algorithm, slightly modified */
321 trj_visit(struct trj_data *trj, Id node)
324 Pool *pool = trj->pool;
325 Queue *plist = trj->plist;
326 Id myidx, stackstart;
329 Id p, pp, obs, *obsp;
331 low[node] = myidx = trj->idx++;
332 trj->stack[(stackstart = trj->nstack++)] = node;
334 s = pool->solvables + plist->elements[node];
337 obsp = s->repo->idarraydata + s->obsoletes;
338 while ((obs = *obsp++) != 0)
340 FOR_PROVIDES(p, pp, obs)
342 Solvable *ps = pool->solvables + p;
343 if (ps->name == s->name)
345 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
347 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
349 /* hmm, expensive. should use hash if plist is big */
350 for (i = 0; i < plist->count; i++)
352 if (node != i && plist->elements[i] == p)
369 if (l < trj->firstidx)
372 /* this means we have reached an old SCC found earlier.
373 * delete it as we obsolete it */
376 if (low[trj->stack[k]] == l)
377 low[trj->stack[k]] = -1;
382 else if (l < low[node])
389 if (low[node] == myidx) /* found a SCC? */
391 /* we're only interested in SCCs that contain the first node,
392 * as all others are "obsoleted" */
393 if (myidx != trj->firstidx)
395 for (i = stackstart; i < trj->nstack; i++)
396 low[trj->stack[i]] = myidx;
397 trj->nstack = stackstart; /* empty stack */
402 * remove entries from plist that are obsoleted by other entries
403 * with different name.
406 prune_obsoleted(Pool *pool, Queue *plist)
408 Id data_buf[2 * 16], *data;
413 if (plist->count <= 16)
415 memset(data_buf, 0, sizeof(data_buf));
419 data = solv_calloc(plist->count, 2 * sizeof(Id));
424 trj.stack = data + plist->count - 1; /* -1 so we can index with idx (which starts with 1) */
425 for (i = 0; i < plist->count; i++)
429 s = pool->solvables + plist->elements[i];
432 trj.firstidx = trj.nstack = trj.idx;
437 Id myidx = trj.idx++;
439 trj.stack[myidx] = i;
442 for (i = j = 0; i < plist->count; i++)
444 plist->elements[j++] = plist->elements[i];
446 if (data != data_buf)
450 /* this is prune_obsoleted special-cased for two elements */
452 prune_obsoleted_2(Pool *pool, Queue *plist)
456 Id p, pp, obs, *obsp;
460 for (i = 0; i < 2; i++)
462 s = pool->solvables + plist->elements[i];
463 other = plist->elements[1 - i];
466 obsp = s->repo->idarraydata + s->obsoletes;
467 while ((obs = *obsp++) != 0)
469 FOR_PROVIDES(p, pp, obs)
474 ps = pool->solvables + p;
475 if (ps->name == s->name)
477 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
479 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
489 if (obmap == 0 || obmap == 3)
492 plist->elements[0] = plist->elements[1];
497 * bring those elements to the front of the queue that
498 * have a installed solvable with the same name
501 move_installed_to_front(Pool *pool, Queue *plist)
507 for (i = j = 0; i < plist->count; i++)
509 s = pool->solvables + plist->elements[i];
510 if (s->repo != pool->installed)
512 FOR_PROVIDES(p, pp, s->name)
514 Solvable *ps = pool->solvables + p;
515 if (s->name == ps->name && ps->repo == pool->installed)
522 if (s->repo == pool->installed)
526 p = plist->elements[i];
528 plist->elements[i] = plist->elements[j];
530 memmove(plist->elements + j + 1, plist->elements + j, (i - j) * sizeof(Id));
531 plist->elements[j] = p;
533 else if (j + 2 == plist->count)
534 break; /* no need to check last element if all prev ones are installed */
541 * prune_to_best_version
543 * sort list of packages (given through plist) by name and evr
544 * return result through plist
547 prune_to_best_version(Pool *pool, Queue *plist)
552 if (plist->count < 2) /* no need to prune for a single entry */
554 POOL_DEBUG(SOLV_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
556 /* sort by name first, prefer installed */
557 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
559 /* now find best 'per name' */
561 for (i = j = 0; i < plist->count; i++)
563 s = pool->solvables + plist->elements[i];
565 POOL_DEBUG(SOLV_DEBUG_POLICY, "- %s[%s]\n",
566 pool_solvable2str(pool, s),
567 (pool->installed && s->repo == pool->installed) ? "installed" : "not installed");
569 if (!best) /* if no best yet, the current is best */
575 /* name switch: finish group, re-init */
576 if (best->name != s->name) /* new name */
578 plist->elements[j++] = best - pool->solvables; /* move old best to front */
579 best = s; /* take current as new best */
583 if (best->evr != s->evr) /* compare evr */
585 if (pool_evrcmp(pool, best->evr, s->evr, EVRCMP_COMPARE) < 0)
589 plist->elements[j++] = best - pool->solvables; /* finish last group */
592 /* we reduced the list to one package per name, now look at
593 * package obsoletes */
594 if (plist->count > 1)
596 if (plist->count == 2)
597 prune_obsoleted_2(pool, plist);
599 prune_obsoleted(pool, plist);
601 if (plist->count > 1 && pool->installed)
602 move_installed_to_front(pool, plist);
606 /* legacy, do not use anymore!
607 * (rates arch higher than version, but thats a policy)
611 prune_best_arch_name_version(const Solver *solv, Pool *pool, Queue *plist)
613 if (plist->count > 1)
614 prune_to_best_arch(pool, plist);
615 if (plist->count > 1)
616 prune_to_best_version(pool, plist);
619 /* installed packages involed in a dup operation can only be kept
620 * if they are identical to a non-installed one */
622 prune_installed_dup_packages(Solver *solv, Queue *plist)
624 Pool *pool = solv->pool;
627 for (i = j = 0; i < plist->count; i++)
629 Id p = plist->elements[i];
630 Solvable *s = pool->solvables + p;
631 if (s->repo == pool->installed && (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))))
633 for (k = 0; k < plist->count; k++)
635 Solvable *s2 = pool->solvables + plist->elements[k];
636 if (s2->repo != pool->installed && solvable_identical(s, s2))
639 if (k == plist->count)
640 continue; /* no identical package found, ignore installed package */
642 plist->elements[j++] = p;
649 * POLICY_MODE_CHOOSE: default, do all pruning steps
650 * POLICY_MODE_RECOMMEND: leave out prune_to_recommended
651 * POLICY_MODE_SUGGEST: leave out prune_to_recommended, do prio pruning just per name
654 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
656 Pool *pool = solv->pool;
657 if (plist->count > 1)
659 if (mode != POLICY_MODE_SUGGEST)
660 prune_to_highest_prio(pool, plist);
662 prune_to_highest_prio_per_name(pool, plist);
663 /* installed dup packages need special treatment as prio pruning
664 * does not prune installed packages */
665 if (plist->count > 1 && pool->installed && (solv->dupmap_all || solv->dupinvolvedmap.size))
666 prune_installed_dup_packages(solv, plist);
668 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
669 prune_to_recommended(solv, plist);
670 prune_best_arch_name_version(solv, pool, plist);
674 /* check if there is an illegal architecture change if
675 * installed solvable s1 is replaced by s2 */
677 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
679 Pool *pool = solv->pool;
680 Id a1 = s1->arch, a2 = s2->arch;
682 /* we allow changes to/from noarch */
683 if (a1 == a2 || a1 == pool->noarchid || a2 == pool->noarchid)
687 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
688 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
689 if (((a1 ^ a2) & 0xffff0000) != 0)
694 /* check if there is an illegal vendor change if
695 * installed solvable s1 is replaced by s2 */
697 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
699 Pool *pool = solv->pool;
701 Id vendormask1, vendormask2;
703 if (pool->custom_vendorcheck)
704 return pool->custom_vendorcheck(pool, s1, s2);
706 /* treat a missing vendor as empty string */
707 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
708 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
711 vendormask1 = pool_vendor2mask(pool, v1);
713 return 1; /* can't match */
714 vendormask2 = pool_vendor2mask(pool, v2);
715 if ((vendormask1 & vendormask2) != 0)
717 return 1; /* no class matches */
720 /* check if it is illegal to replace installed
721 * package "is" with package "s" (which must obsolete "is")
724 policy_is_illegal(Solver *solv, Solvable *is, Solvable *s, int ignore)
726 Pool *pool = solv->pool;
728 int duppkg = solv->dupmap_all ? 1 : 0;
729 if (!(ignore & POLICY_ILLEGAL_DOWNGRADE) && !(duppkg ? solv->dup_allowdowngrade : solv->allowdowngrade))
731 if (is->name == s->name && pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE) > 0)
732 ret |= POLICY_ILLEGAL_DOWNGRADE;
734 if (!(ignore & POLICY_ILLEGAL_ARCHCHANGE) && !(duppkg ? solv->dup_allowarchchange : solv->allowarchchange))
736 if (is->arch != s->arch && policy_illegal_archchange(solv, is, s))
737 ret |= POLICY_ILLEGAL_ARCHCHANGE;
739 if (!(ignore & POLICY_ILLEGAL_VENDORCHANGE) && !(duppkg ? solv->dup_allowvendorchange : solv->allowvendorchange))
741 if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, is, s))
742 ret |= POLICY_ILLEGAL_VENDORCHANGE;
744 if (!(ignore & POLICY_ILLEGAL_NAMECHANGE) && !(duppkg ? solv->dup_allownamechange : solv->allownamechange))
746 if (is->name != s->name)
747 ret |= POLICY_ILLEGAL_NAMECHANGE;
752 /*-------------------------------------------------------------------
754 * create reverse obsoletes map for installed solvables
756 * For each installed solvable find which packages with *different* names
757 * obsolete the solvable.
758 * This index is used in policy_findupdatepackages() below.
761 policy_create_obsolete_index(Solver *solv)
763 Pool *pool = solv->pool;
765 Repo *installed = solv->installed;
766 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
769 solv->obsoletes = solv_free(solv->obsoletes);
770 solv->obsoletes_data = solv_free(solv->obsoletes_data);
771 if (!installed || installed->start == installed->end)
773 cnt = installed->end - installed->start;
774 solv->obsoletes = obsoletes = solv_calloc(cnt, sizeof(Id));
775 for (i = 1; i < pool->nsolvables; i++)
777 s = pool->solvables + i;
780 if (!pool_installable(pool, s))
782 obsp = s->repo->idarraydata + s->obsoletes;
783 while ((obs = *obsp++) != 0)
785 FOR_PROVIDES(p, pp, obs)
787 Solvable *ps = pool->solvables + p;;
788 if (ps->repo != installed)
790 if (ps->name == s->name)
792 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
794 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
796 obsoletes[p - installed->start]++;
801 for (i = 0; i < cnt; i++)
804 n += obsoletes[i] + 1;
807 solv->obsoletes_data = obsoletes_data = solv_calloc(n + 1, sizeof(Id));
808 POOL_DEBUG(SOLV_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
809 for (i = pool->nsolvables - 1; i > 0; i--)
811 s = pool->solvables + i;
814 if (!pool_installable(pool, s))
816 obsp = s->repo->idarraydata + s->obsoletes;
817 while ((obs = *obsp++) != 0)
819 FOR_PROVIDES(p, pp, obs)
821 Solvable *ps = pool->solvables + p;;
822 if (ps->repo != installed)
824 if (ps->name == s->name)
826 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
828 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
830 if (obsoletes_data[obsoletes[p - installed->start]] != i)
831 obsoletes_data[--obsoletes[p - installed->start]] = i;
839 * find update candidates
841 * s: installed solvable to be updated
842 * qs: [out] queue to hold Ids of candidates
843 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
848 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
850 /* installed packages get a special upgrade allowed rule */
851 Pool *pool = solv->pool;
852 Id p, pp, n, p2, pp2;
856 int allowdowngrade = allow_all ? 1 : solv->allowdowngrade;
857 int allownamechange = allow_all ? 1 : solv->allownamechange;
858 int allowarchchange = allow_all ? 1 : solv->allowarchchange;
859 int allowvendorchange = allow_all ? 1 : solv->allowvendorchange;
862 allowdowngrade = solv->dup_allowdowngrade;
863 allownamechange = solv->dup_allownamechange;
864 allowarchchange = solv->dup_allowarchchange;
865 allowvendorchange = solv->dup_allowvendorchange;
870 n = s - pool->solvables;
873 * look for updates for s
875 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
877 if (p == n) /* skip itself */
880 ps = pool->solvables + p;
881 if (s->name == ps->name) /* name match */
883 /* XXX: check implicitobsoleteusescolors? */
884 if (!allowdowngrade && pool_evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
887 else if (!allownamechange)
889 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
891 obsp = ps->repo->idarraydata + ps->obsoletes;
892 while ((obs = *obsp++) != 0) /* for all obsoletes */
894 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
896 Solvable *ps2 = pool->solvables + p2;
897 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps2, obs))
899 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps2))
901 if (p2 == n) /* match ! */
907 if (!obs) /* continue if no match */
909 /* here we have 'p' with a matching provides/obsoletes combination
910 * thus flagging p as a valid update candidate for s
916 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
918 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
922 if (!allownamechange)
924 /* if we have found some valid candidates and noupdateprovide is not set, we're
925 done. otherwise we fallback to all obsoletes */
926 if (!solv->noupdateprovide && haveprovobs)
928 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
931 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
933 ps = pool->solvables + p;
934 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
936 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
944 policy_illegal2str(Solver *solv, int illegal, Solvable *s, Solvable *rs)
946 Pool *pool = solv->pool;
948 if (illegal == POLICY_ILLEGAL_DOWNGRADE)
950 str = pool_tmpjoin(pool, "downgrade of ", pool_solvable2str(pool, s), 0);
951 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
953 if (illegal == POLICY_ILLEGAL_NAMECHANGE)
955 str = pool_tmpjoin(pool, "name change of ", pool_solvable2str(pool, s), 0);
956 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
958 if (illegal == POLICY_ILLEGAL_ARCHCHANGE)
960 str = pool_tmpjoin(pool, "architecture change of ", pool_solvable2str(pool, s), 0);
961 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
963 if (illegal == POLICY_ILLEGAL_VENDORCHANGE)
965 str = pool_tmpjoin(pool, "vendor change from '", pool_id2str(pool, s->vendor), "' (");
968 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to '");
969 str = pool_tmpappend(pool, str, pool_id2str(pool, rs->vendor), "' (");
972 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to no vendor (");
973 return pool_tmpappend(pool, str, pool_solvable2str(pool, rs), ")");
975 return "unknown illegal change";