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 sat_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];
300 * remove entries from plist that are obsoleted by other entries
301 * with different name.
302 * plist should be sorted in some way.
305 prune_obsoleted(Pool *pool, Queue *plist)
310 /* FIXME maybe also check provides depending on noupdateprovide? */
311 /* FIXME do not prune cycles */
312 for (i = 0; i < plist->count; i++)
314 Id p, pp, obs, *obsp;
315 s = pool->solvables + plist->elements[i];
318 obsp = s->repo->idarraydata + s->obsoletes;
319 while ((obs = *obsp++) != 0)
321 FOR_PROVIDES(p, pp, obs)
323 Solvable *ps = pool->solvables + p;
324 if (ps->name == s->name)
326 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
328 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
330 /* hmm, expensive. should use hash if plist is big */
331 for (j = 0; j < plist->count; j++)
335 if (plist->elements[j] == p)
336 plist->elements[j] = 0;
341 /* delete zeroed out queue entries */
342 for (i = j = 0; i < plist->count; i++)
343 if (plist->elements[i])
344 plist->elements[j++] = plist->elements[i];
349 * prune_to_best_version
351 * sort list of packages (given through plist) by name and evr
352 * return result through plist
355 prune_to_best_version(Pool *pool, Queue *plist)
360 if (plist->count < 2) /* no need to prune for a single entry */
362 POOL_DEBUG(SAT_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
364 /* sort by name first, prefer installed */
365 sat_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
367 /* now find best 'per name' */
369 for (i = j = 0; i < plist->count; i++)
371 s = pool->solvables + plist->elements[i];
373 POOL_DEBUG(SAT_DEBUG_POLICY, "- %s[%s]\n",
374 pool_solvable2str(pool, s),
375 (pool->installed && s->repo == pool->installed) ? "installed" : "not installed");
377 if (!best) /* if no best yet, the current is best */
383 /* name switch: finish group, re-init */
384 if (best->name != s->name) /* new name */
386 plist->elements[j++] = best - pool->solvables; /* move old best to front */
387 best = s; /* take current as new best */
391 if (best->evr != s->evr) /* compare evr */
393 if (pool_evrcmp(pool, best->evr, s->evr, EVRCMP_COMPARE) < 0)
397 plist->elements[j++] = best - pool->solvables; /* finish last group */
400 /* we reduced the list to one package per name, now look at
401 * package obsoletes */
402 if (plist->count > 1)
403 prune_obsoleted(pool, plist);
407 /* legacy, do not use anymore!
408 * (rates arch higher than version, but thats a policy)
412 prune_best_arch_name_version(const Solver *solv, Pool *pool, Queue *plist)
414 if (solv && solv->bestSolvableCb)
415 { /* The application is responsible for */
416 return solv->bestSolvableCb(solv->pool, plist);
419 if (plist->count > 1)
420 prune_to_best_arch(pool, plist);
421 if (plist->count > 1)
422 prune_to_best_version(pool, plist);
425 /* installed packages involed in a dup operation can only be kept
426 * if they are identical to a non-installed one */
428 prune_installed_dup_packages(Solver *solv, Queue *plist)
430 Pool *pool = solv->pool;
433 for (i = j = 0; i < plist->count; i++)
435 Id p = plist->elements[i];
436 Solvable *s = pool->solvables + p;
437 if (s->repo == pool->installed && (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))))
439 for (k = 0; k < plist->count; k++)
441 Solvable *s2 = pool->solvables + plist->elements[k];
442 if (s2->repo != pool->installed && solvable_identical(s, s2))
445 if (k == plist->count)
446 continue; /* no identical package found, ignore installed package */
448 plist->elements[j++] = p;
455 * POLICY_MODE_CHOOSE: default, do all pruning steps
456 * POLICY_MODE_RECOMMEND: leave out prune_to_recommended
457 * POLICY_MODE_SUGGEST: leave out prune_to_recommended, do prio pruning just per name
460 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
462 Pool *pool = solv->pool;
463 if (plist->count > 1)
465 if (mode != POLICY_MODE_SUGGEST)
466 prune_to_highest_prio(pool, plist);
468 prune_to_highest_prio_per_name(pool, plist);
469 /* installed dup packages need special treatment as prio pruning
470 * does not prune installed packages */
471 if (plist->count > 1 && pool->installed && (solv->dupmap_all || solv->dupinvolvedmap.size))
472 prune_installed_dup_packages(solv, plist);
474 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
475 prune_to_recommended(solv, plist);
476 prune_best_arch_name_version(solv, pool, plist);
480 /* check if there is an illegal architecture change if
481 * installed solvable s1 is replaced by s2 */
483 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
485 Pool *pool = solv->pool;
486 Id a1 = s1->arch, a2 = s2->arch;
488 if (solv && solv->archCheckCb)
489 { /* The application is responsible for */
490 return solv->archCheckCb(solv->pool, s1, s2);
493 /* we allow changes to/from noarch */
494 #ifndef DEBIAN_SEMANTICS
495 if (a1 == a2 || a1 == ARCH_NOARCH || a2 == ARCH_NOARCH)
498 if (a1 == a2 || a1 == ARCH_ALL || a2 == ARCH_ALL)
503 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
504 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
505 if (((a1 ^ a2) & 0xffff0000) != 0)
510 /* check if there is an illegal vendor change if
511 * installed solvable s1 is replaced by s2 */
513 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
515 Pool *pool = solv->pool;
517 Id vendormask1, vendormask2;
519 if (solv->vendorCheckCb)
520 { /* The application is responsible for */
521 return solv->vendorCheckCb(pool, s1, s2);
523 /* treat a missing vendor as empty string */
524 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
525 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
528 vendormask1 = pool_vendor2mask(pool, v1);
530 return 1; /* can't match */
531 vendormask2 = pool_vendor2mask(pool, v2);
532 if ((vendormask1 & vendormask2) != 0)
534 return 1; /* no class matches */
537 /* check if it is illegal to replace installed
538 * package "is" with package "s" (which must obsolete "is")
541 policy_is_illegal(Solver *solv, Solvable *is, Solvable *s, int ignore)
543 Pool *pool = solv->pool;
545 if (!(ignore & POLICY_ILLEGAL_DOWNGRADE) && !solv->allowdowngrade)
547 if (is->name == s->name && pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE) > 0)
548 ret |= POLICY_ILLEGAL_DOWNGRADE;
550 if (!(ignore & POLICY_ILLEGAL_ARCHCHANGE) && !solv->allowarchchange)
552 if (is->arch != s->arch && policy_illegal_archchange(solv, is, s))
553 ret |= POLICY_ILLEGAL_ARCHCHANGE;
555 if (!(ignore & POLICY_ILLEGAL_VENDORCHANGE) && !solv->allowvendorchange)
557 if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, is, s))
558 ret |= POLICY_ILLEGAL_VENDORCHANGE;
563 /*-------------------------------------------------------------------
565 * create reverse obsoletes map for installed solvables
567 * For each installed solvable find which packages with *different* names
568 * obsolete the solvable.
569 * This index is used in policy_findupdatepackages() below.
572 policy_create_obsolete_index(Solver *solv)
574 Pool *pool = solv->pool;
576 Repo *installed = solv->installed;
577 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
580 if (!installed || installed->start == installed->end)
582 cnt = installed->end - installed->start;
583 solv->obsoletes = obsoletes = sat_calloc(cnt, sizeof(Id));
584 for (i = 1; i < pool->nsolvables; i++)
586 s = pool->solvables + i;
589 if (!pool_installable(pool, s))
591 obsp = s->repo->idarraydata + s->obsoletes;
592 while ((obs = *obsp++) != 0)
594 FOR_PROVIDES(p, pp, obs)
596 Solvable *ps = pool->solvables + p;;
597 if (ps->repo != installed)
599 if (ps->name == s->name)
601 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
603 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
605 obsoletes[p - installed->start]++;
610 for (i = 0; i < cnt; i++)
613 n += obsoletes[i] + 1;
616 solv->obsoletes_data = obsoletes_data = sat_calloc(n + 1, sizeof(Id));
617 POOL_DEBUG(SAT_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
618 for (i = pool->nsolvables - 1; i > 0; i--)
620 s = pool->solvables + i;
623 if (!pool_installable(pool, s))
625 obsp = s->repo->idarraydata + s->obsoletes;
626 while ((obs = *obsp++) != 0)
628 FOR_PROVIDES(p, pp, obs)
630 Solvable *ps = pool->solvables + p;;
631 if (ps->repo != installed)
633 if (ps->name == s->name)
635 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
637 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
639 if (obsoletes_data[obsoletes[p - installed->start]] != i)
640 obsoletes_data[--obsoletes[p - installed->start]] = i;
648 * find update candidates
650 * s: installed solvable to be updated
651 * qs: [out] queue to hold Ids of candidates
652 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
656 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
658 /* installed packages get a special upgrade allowed rule */
659 Pool *pool = solv->pool;
660 Id p, pp, n, p2, pp2;
667 if (solv && solv->updateCandidateCb)
668 { /* The application is responsible for */
669 return solv->updateCandidateCb(solv->pool, s, qs);
672 n = s - pool->solvables;
675 * look for updates for s
677 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
679 if (p == n) /* skip itself */
682 ps = pool->solvables + p;
683 if (s->name == ps->name) /* name match */
685 if (!allow_all && !solv->allowdowngrade && pool_evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
688 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
690 obsp = ps->repo->idarraydata + ps->obsoletes;
691 while ((obs = *obsp++) != 0) /* for all obsoletes */
693 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
695 Solvable *ps2 = pool->solvables + p2;
696 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps2, obs))
698 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps2))
700 if (p2 == n) /* match ! */
706 if (!obs) /* continue if no match */
708 /* here we have 'p' with a matching provides/obsoletes combination
709 * thus flagging p as a valid update candidate for s
715 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
717 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
721 /* if we have found some valid candidates and noupdateprovide is not set, we're
722 done. otherwise we fallback to all obsoletes */
723 if (!solv->noupdateprovide && haveprovobs)
725 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
728 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
730 ps = pool->solvables + p;
731 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
733 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))