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 /* the same name, bring installed solvables to the front */
57 if (sa->repo == pool->installed)
59 if (sb->repo != pool->installed)
62 else if (sb->repo == pool->installed)
65 /* sort by repository sub-prio (installed repo handled above) */
66 r = (sb->repo ? sb->repo->subpriority : 0) - (sa->repo ? sa->repo->subpriority : 0);
69 /* no idea about the order, sort by id */
75 * prune to repository with highest priority.
76 * does not prune installed solvables.
80 prune_to_highest_prio(Pool *pool, Queue *plist)
84 int bestprio = 0, bestprioset = 0;
86 /* prune to highest priority */
87 for (i = 0; i < plist->count; i++) /* find highest prio in queue */
89 s = pool->solvables + plist->elements[i];
90 if (pool->installed && s->repo == pool->installed)
92 if (!bestprioset || s->repo->priority > bestprio)
94 bestprio = s->repo->priority;
100 for (i = j = 0; i < plist->count; i++) /* remove all with lower prio */
102 s = pool->solvables + plist->elements[i];
103 if (s->repo->priority == bestprio || (pool->installed && s->repo == pool->installed))
104 plist->elements[j++] = plist->elements[i];
110 prune_to_highest_prio_per_name(Pool *pool, Queue *plist)
117 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
118 queue_push(&pq, plist->elements[0]);
119 name = pool->solvables[pq.elements[0]].name;
120 for (i = 1, j = 0; i < plist->count; i++)
122 if (pool->solvables[plist->elements[i]].name != name)
125 prune_to_highest_prio(pool, &pq);
126 for (k = 0; k < pq.count; k++)
127 plist->elements[j++] = pq.elements[k];
129 queue_push(&pq, plist->elements[i]);
130 name = pool->solvables[pq.elements[0]].name;
134 prune_to_highest_prio(pool, &pq);
135 for (k = 0; k < pq.count; k++)
136 plist->elements[j++] = pq.elements[k];
143 * prune to recommended/suggested packages.
144 * does not prune installed packages (they are also somewhat recommended).
148 prune_to_recommended(Solver *solv, Queue *plist)
150 Pool *pool = solv->pool;
153 Id p, pp, rec, *recp, sug, *sugp;
158 for (i = 0; i < plist->count; i++)
160 p = plist->elements[i];
161 s = pool->solvables + p;
162 if (pool->installed && s->repo == pool->installed)
166 if (plist->count - ninst < 2)
169 /* update our recommendsmap/suggestsmap */
170 if (solv->recommends_index < 0)
172 MAPZERO(&solv->recommendsmap);
173 MAPZERO(&solv->suggestsmap);
174 solv->recommends_index = 0;
176 while (solv->recommends_index < solv->decisionq.count)
178 p = solv->decisionq.elements[solv->recommends_index++];
181 s = pool->solvables + p;
184 recp = s->repo->idarraydata + s->recommends;
185 while ((rec = *recp++) != 0)
186 FOR_PROVIDES(p, pp, rec)
187 MAPSET(&solv->recommendsmap, p);
191 sugp = s->repo->idarraydata + s->suggests;
192 while ((sug = *sugp++) != 0)
193 FOR_PROVIDES(p, pp, sug)
194 MAPSET(&solv->suggestsmap, p);
198 /* prune to recommended/supplemented */
200 for (i = j = 0; i < plist->count; i++)
202 p = plist->elements[i];
203 s = pool->solvables + p;
204 if (pool->installed && s->repo == pool->installed)
208 plist->elements[j++] = p;
211 if (!MAPTST(&solv->recommendsmap, p))
212 if (!solver_is_supplementing(solv, s))
216 for (k = 0; j < ninst; k++)
218 s = pool->solvables + plist->elements[k];
219 if (pool->installed && s->repo == pool->installed)
220 plist->elements[j++] = plist->elements[k];
223 plist->elements[j++] = p;
228 /* anything left to prune? */
229 if (plist->count - ninst < 2)
232 /* prune to suggested/enhanced*/
234 for (i = j = 0; i < plist->count; i++)
236 p = plist->elements[i];
237 s = pool->solvables + p;
238 if (pool->installed && s->repo == pool->installed)
242 plist->elements[j++] = p;
245 if (!MAPTST(&solv->suggestsmap, p))
246 if (!solver_is_enhancing(solv, s))
250 for (k = 0; j < ninst; k++)
252 s = pool->solvables + plist->elements[k];
253 if (pool->installed && s->repo == pool->installed)
254 plist->elements[j++] = plist->elements[k];
257 plist->elements[j++] = p;
264 prune_to_best_arch(const Pool *pool, Queue *plist)
270 if (!pool->id2arch || plist->count < 2)
273 for (i = 0; i < plist->count; i++)
275 s = pool->solvables + plist->elements[i];
277 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
278 if (a && a != 1 && (!bestscore || a < bestscore))
283 for (i = j = 0; i < plist->count; i++)
285 s = pool->solvables + plist->elements[i];
287 if (a > pool->lastarch)
289 a = pool->id2arch[a];
290 /* a == 1 -> noarch */
291 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
293 plist->elements[j++] = plist->elements[i];
310 /* This is Tarjan's SCC algorithm, slightly modified */
312 trj_visit(struct trj_data *trj, Id node)
315 Pool *pool = trj->pool;
316 Queue *plist = trj->plist;
317 Id myidx, stackstart;
320 Id p, pp, obs, *obsp;
322 low[node] = myidx = trj->idx++;
323 trj->stack[(stackstart = trj->nstack++)] = node;
325 s = pool->solvables + plist->elements[node];
328 obsp = s->repo->idarraydata + s->obsoletes;
329 while ((obs = *obsp++) != 0)
331 FOR_PROVIDES(p, pp, obs)
333 Solvable *ps = pool->solvables + p;
334 if (ps->name == s->name)
336 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
338 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
340 /* hmm, expensive. should use hash if plist is big */
341 for (i = 0; i < plist->count; i++)
343 if (node != i && plist->elements[i] == p)
360 if (l < trj->firstidx)
363 /* this means we have reached an old SCC found earlier.
364 * delete it as we obsolete it */
367 if (low[trj->stack[k]] == l)
368 low[trj->stack[k]] = -1;
373 else if (l < low[node])
380 if (low[node] == myidx) /* found a SCC? */
382 /* we're only interested in SCCs that contain the first node,
383 * as all others are "obsoleted" */
384 if (myidx != trj->firstidx)
386 for (i = stackstart; i < trj->nstack; i++)
387 low[trj->stack[i]] = myidx;
388 trj->nstack = stackstart; /* empty stack */
393 * remove entries from plist that are obsoleted by other entries
394 * with different name.
397 prune_obsoleted(Pool *pool, Queue *plist)
399 Id data_buf[2 * 16], *data;
404 if (plist->count <= 16)
406 memset(data_buf, 0, sizeof(data_buf));
410 data = solv_calloc(plist->count, 2 * sizeof(Id));
415 trj.stack = data + plist->count - 1; /* -1 so we can index with idx (which starts with 1) */
416 for (i = 0; i < plist->count; i++)
420 s = pool->solvables + plist->elements[i];
423 trj.firstidx = trj.nstack = trj.idx;
428 Id myidx = trj.idx++;
430 trj.stack[myidx] = i;
433 for (i = j = 0; i < plist->count; i++)
435 plist->elements[j++] = plist->elements[i];
437 if (data != data_buf)
441 /* this is prune_obsoleted special-cased for two elements */
443 prune_obsoleted_2(Pool *pool, Queue *plist)
447 Id p, pp, obs, *obsp;
451 for (i = 0; i < 2; i++)
453 s = pool->solvables + plist->elements[i];
454 other = plist->elements[1 - i];
457 obsp = s->repo->idarraydata + s->obsoletes;
458 while ((obs = *obsp++) != 0)
460 FOR_PROVIDES(p, pp, obs)
465 ps = pool->solvables + p;
466 if (ps->name == s->name)
468 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
470 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
480 if (obmap == 0 || obmap == 3)
483 plist->elements[0] = plist->elements[1];
488 * bring those elements to the front of the queue that
489 * have a installed solvable with the same name
492 move_installed_to_front(Pool *pool, Queue *plist)
498 for (i = j = 0; i < plist->count; i++)
500 s = pool->solvables + plist->elements[i];
501 if (s->repo != pool->installed)
503 FOR_PROVIDES(p, pp, s->name)
505 Solvable *ps = pool->solvables + p;
506 if (s->name == ps->name && ps->repo == pool->installed)
513 if (s->repo == pool->installed)
517 p = plist->elements[i];
519 plist->elements[i] = plist->elements[j];
521 memmove(plist->elements + j + 1, plist->elements + j, (i - j) * sizeof(Id));
522 plist->elements[j] = p;
530 * prune_to_best_version
532 * sort list of packages (given through plist) by name and evr
533 * return result through plist
536 prune_to_best_version(Pool *pool, Queue *plist)
541 if (plist->count < 2) /* no need to prune for a single entry */
543 POOL_DEBUG(SOLV_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
545 /* sort by name first, prefer installed */
546 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
548 /* now find best 'per name' */
550 for (i = j = 0; i < plist->count; i++)
552 s = pool->solvables + plist->elements[i];
554 POOL_DEBUG(SOLV_DEBUG_POLICY, "- %s[%s]\n",
555 pool_solvable2str(pool, s),
556 (pool->installed && s->repo == pool->installed) ? "installed" : "not installed");
558 if (!best) /* if no best yet, the current is best */
564 /* name switch: finish group, re-init */
565 if (best->name != s->name) /* new name */
567 plist->elements[j++] = best - pool->solvables; /* move old best to front */
568 best = s; /* take current as new best */
572 if (best->evr != s->evr) /* compare evr */
574 if (pool_evrcmp(pool, best->evr, s->evr, EVRCMP_COMPARE) < 0)
578 plist->elements[j++] = best - pool->solvables; /* finish last group */
581 /* we reduced the list to one package per name, now look at
582 * package obsoletes */
583 if (plist->count > 1)
585 if (plist->count == 2)
586 prune_obsoleted_2(pool, plist);
588 prune_obsoleted(pool, plist);
590 if (plist->count > 1 && pool->installed)
591 move_installed_to_front(pool, plist);
595 /* legacy, do not use anymore!
596 * (rates arch higher than version, but thats a policy)
600 prune_best_arch_name_version(const Solver *solv, Pool *pool, Queue *plist)
602 if (solv && solv->bestSolvableCb)
603 { /* The application is responsible for */
604 return solv->bestSolvableCb(solv->pool, plist);
607 if (plist->count > 1)
608 prune_to_best_arch(pool, plist);
609 if (plist->count > 1)
610 prune_to_best_version(pool, plist);
613 /* installed packages involed in a dup operation can only be kept
614 * if they are identical to a non-installed one */
616 prune_installed_dup_packages(Solver *solv, Queue *plist)
618 Pool *pool = solv->pool;
621 for (i = j = 0; i < plist->count; i++)
623 Id p = plist->elements[i];
624 Solvable *s = pool->solvables + p;
625 if (s->repo == pool->installed && (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))))
627 for (k = 0; k < plist->count; k++)
629 Solvable *s2 = pool->solvables + plist->elements[k];
630 if (s2->repo != pool->installed && solvable_identical(s, s2))
633 if (k == plist->count)
634 continue; /* no identical package found, ignore installed package */
636 plist->elements[j++] = p;
643 * POLICY_MODE_CHOOSE: default, do all pruning steps
644 * POLICY_MODE_RECOMMEND: leave out prune_to_recommended
645 * POLICY_MODE_SUGGEST: leave out prune_to_recommended, do prio pruning just per name
648 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
650 Pool *pool = solv->pool;
651 if (plist->count > 1)
653 if (mode != POLICY_MODE_SUGGEST)
654 prune_to_highest_prio(pool, plist);
656 prune_to_highest_prio_per_name(pool, plist);
657 /* installed dup packages need special treatment as prio pruning
658 * does not prune installed packages */
659 if (plist->count > 1 && pool->installed && (solv->dupmap_all || solv->dupinvolvedmap.size))
660 prune_installed_dup_packages(solv, plist);
662 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
663 prune_to_recommended(solv, plist);
664 prune_best_arch_name_version(solv, pool, plist);
668 /* check if there is an illegal architecture change if
669 * installed solvable s1 is replaced by s2 */
671 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
673 Pool *pool = solv->pool;
674 Id a1 = s1->arch, a2 = s2->arch;
676 if (solv && solv->archCheckCb)
677 { /* The application is responsible for */
678 return solv->archCheckCb(solv->pool, s1, s2);
681 /* we allow changes to/from noarch */
682 #ifndef DEBIAN_SEMANTICS
683 if (a1 == a2 || a1 == ARCH_NOARCH || a2 == ARCH_NOARCH)
686 if (a1 == a2 || a1 == ARCH_ALL || a2 == ARCH_ALL)
691 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
692 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
693 if (((a1 ^ a2) & 0xffff0000) != 0)
698 /* check if there is an illegal vendor change if
699 * installed solvable s1 is replaced by s2 */
701 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
703 Pool *pool = solv->pool;
705 Id vendormask1, vendormask2;
707 if (solv->vendorCheckCb)
708 { /* The application is responsible for */
709 return solv->vendorCheckCb(pool, s1, s2);
711 /* treat a missing vendor as empty string */
712 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
713 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
716 vendormask1 = pool_vendor2mask(pool, v1);
718 return 1; /* can't match */
719 vendormask2 = pool_vendor2mask(pool, v2);
720 if ((vendormask1 & vendormask2) != 0)
722 return 1; /* no class matches */
725 /* check if it is illegal to replace installed
726 * package "is" with package "s" (which must obsolete "is")
729 policy_is_illegal(Solver *solv, Solvable *is, Solvable *s, int ignore)
731 Pool *pool = solv->pool;
733 if (!(ignore & POLICY_ILLEGAL_DOWNGRADE) && !solv->allowdowngrade)
735 if (is->name == s->name && pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE) > 0)
736 ret |= POLICY_ILLEGAL_DOWNGRADE;
738 if (!(ignore & POLICY_ILLEGAL_ARCHCHANGE) && !solv->allowarchchange)
740 if (is->arch != s->arch && policy_illegal_archchange(solv, is, s))
741 ret |= POLICY_ILLEGAL_ARCHCHANGE;
743 if (!(ignore & POLICY_ILLEGAL_VENDORCHANGE) && !solv->allowvendorchange)
745 if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, is, s))
746 ret |= POLICY_ILLEGAL_VENDORCHANGE;
751 /*-------------------------------------------------------------------
753 * create reverse obsoletes map for installed solvables
755 * For each installed solvable find which packages with *different* names
756 * obsolete the solvable.
757 * This index is used in policy_findupdatepackages() below.
760 policy_create_obsolete_index(Solver *solv)
762 Pool *pool = solv->pool;
764 Repo *installed = solv->installed;
765 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
768 if (!installed || installed->start == installed->end)
770 cnt = installed->end - installed->start;
771 solv->obsoletes = obsoletes = solv_calloc(cnt, sizeof(Id));
772 for (i = 1; i < pool->nsolvables; i++)
774 s = pool->solvables + i;
777 if (!pool_installable(pool, s))
779 obsp = s->repo->idarraydata + s->obsoletes;
780 while ((obs = *obsp++) != 0)
782 FOR_PROVIDES(p, pp, obs)
784 Solvable *ps = pool->solvables + p;;
785 if (ps->repo != installed)
787 if (ps->name == s->name)
789 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
791 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
793 obsoletes[p - installed->start]++;
798 for (i = 0; i < cnt; i++)
801 n += obsoletes[i] + 1;
804 solv->obsoletes_data = obsoletes_data = solv_calloc(n + 1, sizeof(Id));
805 POOL_DEBUG(SOLV_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
806 for (i = pool->nsolvables - 1; i > 0; i--)
808 s = pool->solvables + i;
811 if (!pool_installable(pool, s))
813 obsp = s->repo->idarraydata + s->obsoletes;
814 while ((obs = *obsp++) != 0)
816 FOR_PROVIDES(p, pp, obs)
818 Solvable *ps = pool->solvables + p;;
819 if (ps->repo != installed)
821 if (ps->name == s->name)
823 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
825 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
827 if (obsoletes_data[obsoletes[p - installed->start]] != i)
828 obsoletes_data[--obsoletes[p - installed->start]] = i;
836 * find update candidates
838 * s: installed solvable to be updated
839 * qs: [out] queue to hold Ids of candidates
840 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
844 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
846 /* installed packages get a special upgrade allowed rule */
847 Pool *pool = solv->pool;
848 Id p, pp, n, p2, pp2;
855 if (solv && solv->updateCandidateCb)
856 { /* The application is responsible for */
857 return solv->updateCandidateCb(solv->pool, s, qs);
860 n = s - pool->solvables;
863 * look for updates for s
865 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
867 if (p == n) /* skip itself */
870 ps = pool->solvables + p;
871 if (s->name == ps->name) /* name match */
873 if (!allow_all && !solv->allowdowngrade && pool_evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
876 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
878 obsp = ps->repo->idarraydata + ps->obsoletes;
879 while ((obs = *obsp++) != 0) /* for all obsoletes */
881 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
883 Solvable *ps2 = pool->solvables + p2;
884 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps2, obs))
886 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps2))
888 if (p2 == n) /* match ! */
894 if (!obs) /* continue if no match */
896 /* here we have 'p' with a matching provides/obsoletes combination
897 * thus flagging p as a valid update candidate for s
903 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
905 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
909 /* if we have found some valid candidates and noupdateprovide is not set, we're
910 done. otherwise we fallback to all obsoletes */
911 if (!solv->noupdateprovide && haveprovobs)
913 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
916 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
918 ps = pool->solvables + p;
919 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
921 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))