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
21 #include "poolvendor.h"
25 /*-----------------------------------------------------------------*/
28 * prep for prune_best_version
33 prune_to_best_version_sortcmp(const void *ap, const void *bp, void *dp)
41 sa = pool->solvables + a;
42 sb = pool->solvables + b;
43 r = sa->name - sb->name;
47 /* different names. We use real strcmp here so that the result
48 * is not depending on some random solvable order */
49 na = id2str(pool, sa->name);
50 nb = id2str(pool, sb->name);
51 return strcmp(na, nb);
53 /* the same name, bring installed solvables to the front */
56 if (sa->repo == pool->installed)
58 if (sb->repo != pool->installed)
61 else if (sb->repo == pool->installed)
64 /* sort by repository sub-prio (installed repo handled above) */
65 r = (sb->repo ? sb->repo->subpriority : 0) - (sa->repo ? sa->repo->subpriority : 0);
68 /* no idea about the order, sort by id */
74 * prune to repository with highest priority.
75 * does not prune installed solvables.
79 prune_to_highest_prio(Pool *pool, Queue *plist)
83 int bestprio = 0, bestprioset = 0;
85 /* prune to highest priority */
86 for (i = 0; i < plist->count; i++) /* find highest prio in queue */
88 s = pool->solvables + plist->elements[i];
89 if (pool->installed && s->repo == pool->installed)
91 if (!bestprioset || s->repo->priority > bestprio)
93 bestprio = s->repo->priority;
99 for (i = j = 0; i < plist->count; i++) /* remove all with lower prio */
101 s = pool->solvables + plist->elements[i];
102 if (s->repo->priority == bestprio || (pool->installed && s->repo == pool->installed))
103 plist->elements[j++] = plist->elements[i];
109 prune_to_highest_prio_per_name(Pool *pool, Queue *plist)
116 sat_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
117 queue_push(&pq, plist->elements[0]);
118 name = pool->solvables[pq.elements[0]].name;
119 for (i = 1, j = 0; i < plist->count; i++)
121 if (pool->solvables[plist->elements[i]].name != name)
124 prune_to_highest_prio(pool, &pq);
125 for (k = 0; k < pq.count; k++)
126 plist->elements[j++] = pq.elements[k];
128 queue_push(&pq, plist->elements[i]);
129 name = pool->solvables[pq.elements[0]].name;
133 prune_to_highest_prio(pool, &pq);
134 for (k = 0; k < pq.count; k++)
135 plist->elements[j++] = pq.elements[k];
142 * prune to recommended/suggested packages.
143 * does not prune installed packages (they are also somewhat recommended).
147 prune_to_recommended(Solver *solv, Queue *plist)
149 Pool *pool = solv->pool;
152 Id p, pp, rec, *recp, sug, *sugp;
157 for (i = 0; i < plist->count; i++)
159 p = plist->elements[i];
160 s = pool->solvables + p;
161 if (pool->installed && s->repo == pool->installed)
165 if (plist->count - ninst < 2)
168 /* update our recommendsmap/suggestsmap */
169 if (solv->recommends_index < 0)
171 MAPZERO(&solv->recommendsmap);
172 MAPZERO(&solv->suggestsmap);
173 solv->recommends_index = 0;
175 while (solv->recommends_index < solv->decisionq.count)
177 p = solv->decisionq.elements[solv->recommends_index++];
180 s = pool->solvables + p;
183 recp = s->repo->idarraydata + s->recommends;
184 while ((rec = *recp++) != 0)
185 FOR_PROVIDES(p, pp, rec)
186 MAPSET(&solv->recommendsmap, p);
190 sugp = s->repo->idarraydata + s->suggests;
191 while ((sug = *sugp++) != 0)
192 FOR_PROVIDES(p, pp, sug)
193 MAPSET(&solv->suggestsmap, p);
197 /* prune to recommended/supplemented */
199 for (i = j = 0; i < plist->count; i++)
201 p = plist->elements[i];
202 s = pool->solvables + p;
203 if (pool->installed && s->repo == pool->installed)
207 plist->elements[j++] = p;
210 if (!MAPTST(&solv->recommendsmap, p))
211 if (!solver_is_supplementing(solv, s))
215 for (k = 0; j < ninst; k++)
217 s = pool->solvables + plist->elements[k];
218 if (pool->installed && s->repo == pool->installed)
219 plist->elements[j++] = plist->elements[k];
222 plist->elements[j++] = p;
227 /* anything left to prune? */
228 if (plist->count - ninst < 2)
231 /* prune to suggested/enhanced*/
233 for (i = j = 0; i < plist->count; i++)
235 p = plist->elements[i];
236 s = pool->solvables + p;
237 if (pool->installed && s->repo == pool->installed)
241 plist->elements[j++] = p;
244 if (!MAPTST(&solv->suggestsmap, p))
245 if (!solver_is_enhancing(solv, s))
249 for (k = 0; j < ninst; k++)
251 s = pool->solvables + plist->elements[k];
252 if (pool->installed && s->repo == pool->installed)
253 plist->elements[j++] = plist->elements[k];
256 plist->elements[j++] = p;
263 prune_to_best_arch(const Pool *pool, Queue *plist)
269 if (!pool->id2arch || plist->count < 2)
272 for (i = 0; i < plist->count; i++)
274 s = pool->solvables + plist->elements[i];
276 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
277 if (a && a != 1 && (!bestscore || a < bestscore))
282 for (i = j = 0; i < plist->count; i++)
284 s = pool->solvables + plist->elements[i];
286 if (a > pool->lastarch)
288 a = pool->id2arch[a];
289 /* a == 1 -> noarch */
290 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
292 plist->elements[j++] = plist->elements[i];
299 * remove entries from plist that are obsoleted by other entries
300 * with different name.
301 * plist should be sorted in some way.
304 prune_obsoleted(Pool *pool, Queue *plist)
309 /* FIXME maybe also check provides depending on noupdateprovide? */
310 /* FIXME do not prune cycles */
311 for (i = 0; i < plist->count; i++)
313 Id p, pp, obs, *obsp;
314 s = pool->solvables + plist->elements[i];
317 obsp = s->repo->idarraydata + s->obsoletes;
318 while ((obs = *obsp++) != 0)
320 FOR_PROVIDES(p, pp, obs)
322 Solvable *ps = pool->solvables + p;
323 if (ps->name == s->name)
325 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
327 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
329 /* hmm, expensive. should use hash if plist is big */
330 for (j = 0; j < plist->count; j++)
334 if (plist->elements[j] == p)
335 plist->elements[j] = 0;
340 /* delete zeroed out queue entries */
341 for (i = j = 0; i < plist->count; i++)
342 if (plist->elements[i])
343 plist->elements[j++] = plist->elements[i];
348 * prune_to_best_version
350 * sort list of packages (given through plist) by name and evr
351 * return result through plist
354 prune_to_best_version(Pool *pool, Queue *plist)
359 if (plist->count < 2) /* no need to prune for a single entry */
361 POOL_DEBUG(SAT_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
363 /* sort by name first, prefer installed */
364 sat_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
366 /* now find best 'per name' */
368 for (i = j = 0; i < plist->count; i++)
370 s = pool->solvables + plist->elements[i];
372 POOL_DEBUG(SAT_DEBUG_POLICY, "- %s[%s]\n",
373 solvable2str(pool, s),
374 (pool->installed && s->repo == pool->installed) ? "installed" : "not installed");
376 if (!best) /* if no best yet, the current is best */
382 /* name switch: finish group, re-init */
383 if (best->name != s->name) /* new name */
385 plist->elements[j++] = best - pool->solvables; /* move old best to front */
386 best = s; /* take current as new best */
390 if (best->evr != s->evr) /* compare evr */
392 if (evrcmp(pool, best->evr, s->evr, EVRCMP_COMPARE) < 0)
396 plist->elements[j++] = best - pool->solvables; /* finish last group */
399 /* we reduced the list to one package per name, now look at
400 * package obsoletes */
401 if (plist->count > 1)
402 prune_obsoleted(pool, plist);
406 /* legacy, do not use anymore!
407 * (rates arch higher than version, but thats a policy)
411 prune_best_arch_name_version(const Solver *solv, Pool *pool, Queue *plist)
413 if (solv && solv->bestSolvableCb)
414 { /* The application is responsible for */
415 return solv->bestSolvableCb(solv->pool, plist);
418 if (plist->count > 1)
419 prune_to_best_arch(pool, plist);
420 if (plist->count > 1)
421 prune_to_best_version(pool, plist);
424 /* installed packages involed in a dup operation can only be kept
425 * if they are identical to a non-installed one */
427 prune_installed_dup_packages(Solver *solv, Queue *plist)
429 Pool *pool = solv->pool;
432 for (i = j = 0; i < plist->count; i++)
434 Id p = plist->elements[i];
435 Solvable *s = pool->solvables + p;
436 if (s->repo == pool->installed && (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))))
438 for (k = 0; k < plist->count; k++)
440 Solvable *s2 = pool->solvables + plist->elements[k];
441 if (s2->repo != pool->installed && solvable_identical(s, s2))
444 if (k == plist->count)
445 continue; /* no identical package found, ignore installed package */
447 plist->elements[j++] = p;
454 * POLICY_MODE_CHOOSE: default, do all pruning steps
455 * POLICY_MODE_RECOMMEND: leave out prune_to_recommended
456 * POLICY_MODE_SUGGEST: leave out prune_to_recommended, do prio pruning just per name
459 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
461 Pool *pool = solv->pool;
462 if (plist->count > 1)
464 if (mode != POLICY_MODE_SUGGEST)
465 prune_to_highest_prio(pool, plist);
467 prune_to_highest_prio_per_name(pool, plist);
468 /* installed dup packages need special treatment as prio pruning
469 * does not prune installed packages */
470 if (plist->count > 1 && pool->installed && (solv->dupmap_all || solv->dupinvolvedmap.size))
471 prune_installed_dup_packages(solv, plist);
473 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
474 prune_to_recommended(solv, plist);
475 prune_best_arch_name_version(solv, pool, plist);
479 /* check if there is an illegal architecture change if
480 * installed solvable s1 is replaced by s2 */
482 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
484 Pool *pool = solv->pool;
485 Id a1 = s1->arch, a2 = s2->arch;
487 if (solv && solv->archCheckCb)
488 { /* The application is responsible for */
489 return solv->archCheckCb(solv->pool, s1, s2);
492 /* we allow changes to/from noarch */
493 #ifndef DEBIAN_SEMANTICS
494 if (a1 == a2 || a1 == ARCH_NOARCH || a2 == ARCH_NOARCH)
497 if (a1 == a2 || a1 == ARCH_ALL || a2 == ARCH_ALL)
502 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
503 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
504 if (((a1 ^ a2) & 0xffff0000) != 0)
509 /* check if there is an illegal vendor change if
510 * installed solvable s1 is replaced by s2 */
512 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
514 Pool *pool = solv->pool;
516 Id vendormask1, vendormask2;
518 if (solv->vendorCheckCb)
519 { /* The application is responsible for */
520 return solv->vendorCheckCb(pool, s1, s2);
522 /* treat a missing vendor as empty string */
523 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
524 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
527 vendormask1 = pool_vendor2mask(pool, v1);
529 return 1; /* can't match */
530 vendormask2 = pool_vendor2mask(pool, v2);
531 if ((vendormask1 & vendormask2) != 0)
533 return 1; /* no class matches */
536 /* check if it is illegal to replace installed
537 * package "is" with package "s" (which must obsolete "is")
540 policy_is_illegal(Solver *solv, Solvable *is, Solvable *s, int ignore)
542 Pool *pool = solv->pool;
544 if (!(ignore & POLICY_ILLEGAL_DOWNGRADE) && !solv->allowdowngrade)
546 if (is->name == s->name && evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE) > 0)
547 ret |= POLICY_ILLEGAL_DOWNGRADE;
549 if (!(ignore & POLICY_ILLEGAL_ARCHCHANGE) && !solv->allowarchchange)
551 if (is->arch != s->arch && policy_illegal_archchange(solv, is, s))
552 ret |= POLICY_ILLEGAL_ARCHCHANGE;
554 if (!(ignore & POLICY_ILLEGAL_VENDORCHANGE) && !solv->allowvendorchange)
556 if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, is, s))
557 ret |= POLICY_ILLEGAL_VENDORCHANGE;
562 /*-------------------------------------------------------------------
564 * create reverse obsoletes map for installed solvables
566 * For each installed solvable find which packages with *different* names
567 * obsolete the solvable.
568 * This index is used in policy_findupdatepackages() below.
571 policy_create_obsolete_index(Solver *solv)
573 Pool *pool = solv->pool;
575 Repo *installed = solv->installed;
576 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
579 if (!installed || installed->start == installed->end)
581 cnt = installed->end - installed->start;
582 solv->obsoletes = obsoletes = sat_calloc(cnt, sizeof(Id));
583 for (i = 1; i < pool->nsolvables; i++)
585 s = pool->solvables + i;
588 if (!pool_installable(pool, s))
590 obsp = s->repo->idarraydata + s->obsoletes;
591 while ((obs = *obsp++) != 0)
593 FOR_PROVIDES(p, pp, obs)
595 Solvable *ps = pool->solvables + p;;
596 if (ps->repo != installed)
598 if (ps->name == s->name)
600 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
602 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
604 obsoletes[p - installed->start]++;
609 for (i = 0; i < cnt; i++)
612 n += obsoletes[i] + 1;
615 solv->obsoletes_data = obsoletes_data = sat_calloc(n + 1, sizeof(Id));
616 POOL_DEBUG(SAT_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
617 for (i = pool->nsolvables - 1; i > 0; i--)
619 s = pool->solvables + i;
622 if (!pool_installable(pool, s))
624 obsp = s->repo->idarraydata + s->obsoletes;
625 while ((obs = *obsp++) != 0)
627 FOR_PROVIDES(p, pp, obs)
629 Solvable *ps = pool->solvables + p;;
630 if (ps->repo != installed)
632 if (ps->name == s->name)
634 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
636 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
638 if (obsoletes_data[obsoletes[p - installed->start]] != i)
639 obsoletes_data[--obsoletes[p - installed->start]] = i;
647 * find update candidates
649 * s: installed solvable to be updated
650 * qs: [out] queue to hold Ids of candidates
651 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
655 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
657 /* installed packages get a special upgrade allowed rule */
658 Pool *pool = solv->pool;
659 Id p, pp, n, p2, pp2;
666 if (solv && solv->updateCandidateCb)
667 { /* The application is responsible for */
668 return solv->updateCandidateCb(solv->pool, s, qs);
671 n = s - pool->solvables;
674 * look for updates for s
676 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
678 if (p == n) /* skip itself */
681 ps = pool->solvables + p;
682 if (s->name == ps->name) /* name match */
684 if (!allow_all && !solv->allowdowngrade && evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
687 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
689 obsp = ps->repo->idarraydata + ps->obsoletes;
690 while ((obs = *obsp++) != 0) /* for all obsoletes */
692 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
694 Solvable *ps2 = pool->solvables + p2;
695 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps2, obs))
697 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps2))
699 if (p2 == n) /* match ! */
705 if (!obs) /* continue if no match */
707 /* here we have 'p' with a matching provides/obsoletes combination
708 * thus flagging p as a valid update candidate for s
714 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
716 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
720 /* if we have found some valid candidates and noupdateprovide is not set, we're
721 done. otherwise we fallback to all obsoletes */
722 if (!solv->noupdateprovide && haveprovobs)
724 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
727 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
729 ps = pool->solvables + p;
730 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
732 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))