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))
280 for (i = j = 0; i < plist->count; i++)
282 s = pool->solvables + plist->elements[i];
284 if (a > pool->lastarch)
286 a = pool->id2arch[a];
287 /* a == 1 -> noarch */
288 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
290 plist->elements[j++] = plist->elements[i];
297 * prune_to_best_version
299 * sort list of packages (given through plist) by name and evr
300 * return result through plist
303 prune_to_best_version(Pool *pool, Queue *plist)
308 if (plist->count < 2) /* no need to prune for a single entry */
310 POOL_DEBUG(SAT_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
312 /* sort by name first, prefer installed */
313 sat_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
315 /* delete obsoleted. hmm, looks expensive! */
316 /* FIXME maybe also check provides depending on noupdateprovide? */
317 /* FIXME do not prune cycles */
318 for (i = 0; i < plist->count; i++)
320 Id p, pp, obs, *obsp;
321 s = pool->solvables + plist->elements[i];
324 obsp = s->repo->idarraydata + s->obsoletes;
325 while ((obs = *obsp++) != 0)
327 FOR_PROVIDES(p, pp, obs)
329 Solvable *ps = pool->solvables + p;
330 if (ps->name == s->name)
332 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
334 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
336 for (j = 0; j < plist->count; j++)
340 if (plist->elements[j] == p)
341 plist->elements[j] = 0;
346 /* delete zeroed out queue entries */
347 for (i = j = 0; i < plist->count; i++)
348 if (plist->elements[i])
349 plist->elements[j++] = plist->elements[i];
352 if (plist->count < 2)
355 /* now find best 'per name' */
357 for (i = j = 0; i < plist->count; i++)
359 s = pool->solvables + plist->elements[i];
361 POOL_DEBUG(SAT_DEBUG_POLICY, "- %s[%s]\n",
362 solvable2str(pool, s),
363 (pool->installed && s->repo == pool->installed) ? "installed" : "not installed");
365 if (!best) /* if no best yet, the current is best */
371 /* name switch: finish group, re-init */
372 if (best->name != s->name) /* new name */
374 plist->elements[j++] = best - pool->solvables; /* move old best to front */
375 best = s; /* take current as new best */
379 if (best->evr != s->evr) /* compare evr */
381 if (evrcmp(pool, best->evr, s->evr, EVRCMP_COMPARE) < 0)
385 plist->elements[j++] = best - pool->solvables; /* finish last group */
390 /* legacy, do not use anymore!
391 * (rates arch higher than version, but thats a policy)
395 prune_best_arch_name_version(const Solver *solv, Pool *pool, Queue *plist)
397 if (solv && solv->bestSolvableCb)
398 { /* The application is responsible for */
399 return solv->bestSolvableCb(solv->pool, plist);
402 if (plist->count > 1)
403 prune_to_best_arch(pool, plist);
404 if (plist->count > 1)
405 prune_to_best_version(pool, plist);
408 /* installed packages involed in a dup operation can only be kept
409 * if they are identical to a non-installed one */
411 prune_installed_dup_packages(Solver *solv, Queue *plist)
413 Pool *pool = solv->pool;
416 for (i = j = 0; i < plist->count; i++)
418 Id p = plist->elements[i];
419 Solvable *s = pool->solvables + p;
420 if (s->repo == pool->installed && (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))))
422 for (k = 0; k < plist->count; k++)
424 Solvable *s2 = pool->solvables + plist->elements[k];
425 if (s2->repo != pool->installed && solvable_identical(s, s2))
428 if (k == plist->count)
429 continue; /* no identical package found, ignore installed package */
431 plist->elements[j++] = p;
438 * POLICY_MODE_CHOOSE: default, do all pruning steps
439 * POLICY_MODE_RECOMMEND: leave out prune_to_recommended
440 * POLICY_MODE_SUGGEST: leave out prune_to_recommended, do prio pruning just per name
443 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
445 Pool *pool = solv->pool;
446 if (plist->count > 1)
448 if (mode != POLICY_MODE_SUGGEST)
449 prune_to_highest_prio(pool, plist);
451 prune_to_highest_prio_per_name(pool, plist);
452 /* installed dup packages need special treatment as prio pruning
453 * does not prune installed packages */
454 if (plist->count > 1 && pool->installed && (solv->dupmap_all || solv->dupinvolvedmap.size))
455 prune_installed_dup_packages(solv, plist);
457 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
458 prune_to_recommended(solv, plist);
459 prune_best_arch_name_version(solv, pool, plist);
464 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
466 Pool *pool = solv->pool;
467 Id a1 = s1->arch, a2 = s2->arch;
469 if (solv && solv->archCheckCb)
470 { /* The application is responsible for */
471 return solv->archCheckCb(solv->pool, s1, s2);
474 /* we allow changes to/from noarch */
475 #ifndef DEBIAN_SEMANTICS
476 if (a1 == a2 || a1 == ARCH_NOARCH || a2 == ARCH_NOARCH)
479 if (a1 == a2 || a1 == ARCH_ALL || a2 == ARCH_ALL)
484 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
485 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
486 if (((a1 ^ a2) & 0xffff0000) != 0)
492 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
494 Pool *pool = solv->pool;
496 Id vendormask1, vendormask2;
498 if (solv->vendorCheckCb)
499 { /* The application is responsible for */
500 return solv->vendorCheckCb(pool, s1, s2);
502 /* treat a missing vendor as empty string */
503 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
504 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
507 vendormask1 = pool_vendor2mask(pool, v1);
509 return 1; /* can't match */
510 vendormask2 = pool_vendor2mask(pool, v2);
511 if ((vendormask1 & vendormask2) != 0)
513 return 1; /* no class matches */
516 /* check if it is illegal to replace installed
517 * package "is" with package "s" (which must obsolete "is")
520 policy_is_illegal(Solver *solv, Solvable *is, Solvable *s, int ignore)
522 Pool *pool = solv->pool;
524 if (!(ignore & POLICY_ILLEGAL_DOWNGRADE) && !solv->allowdowngrade)
526 if (is->name == s->name && evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE) > 0)
527 ret |= POLICY_ILLEGAL_DOWNGRADE;
529 if (!(ignore & POLICY_ILLEGAL_ARCHCHANGE) && !solv->allowarchchange)
531 if (is->arch != s->arch && policy_illegal_archchange(solv, s, is))
532 ret |= POLICY_ILLEGAL_ARCHCHANGE;
534 if (!(ignore & POLICY_ILLEGAL_VENDORCHANGE) && !solv->allowvendorchange)
536 if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, s, is))
537 ret |= POLICY_ILLEGAL_VENDORCHANGE;
542 /*-------------------------------------------------------------------
544 * create reverse obsoletes map for installed solvables
546 * For each installed solvable find which packages with *different* names
547 * obsolete the solvable.
548 * This index is used in policy_findupdatepackages() below.
551 policy_create_obsolete_index(Solver *solv)
553 Pool *pool = solv->pool;
555 Repo *installed = solv->installed;
556 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
559 if (!installed || installed->start == installed->end)
561 cnt = installed->end - installed->start;
562 solv->obsoletes = obsoletes = sat_calloc(cnt, sizeof(Id));
563 for (i = 1; i < pool->nsolvables; i++)
565 s = pool->solvables + i;
568 if (!pool_installable(pool, s))
570 obsp = s->repo->idarraydata + s->obsoletes;
571 while ((obs = *obsp++) != 0)
573 FOR_PROVIDES(p, pp, obs)
575 Solvable *ps = pool->solvables + p;;
576 if (ps->repo != installed)
578 if (ps->name == s->name)
580 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
582 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
584 obsoletes[p - installed->start]++;
589 for (i = 0; i < cnt; i++)
592 n += obsoletes[i] + 1;
595 solv->obsoletes_data = obsoletes_data = sat_calloc(n + 1, sizeof(Id));
596 POOL_DEBUG(SAT_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
597 for (i = pool->nsolvables - 1; i > 0; i--)
599 s = pool->solvables + i;
602 if (!pool_installable(pool, s))
604 obsp = s->repo->idarraydata + s->obsoletes;
605 while ((obs = *obsp++) != 0)
607 FOR_PROVIDES(p, pp, obs)
609 Solvable *ps = pool->solvables + p;;
610 if (ps->repo != installed)
612 if (ps->name == s->name)
614 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
616 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
618 if (obsoletes_data[obsoletes[p - installed->start]] != i)
619 obsoletes_data[--obsoletes[p - installed->start]] = i;
627 * find update candidates
629 * s: solvable to be updated
630 * qs: [out] queue to hold Ids of candidates
631 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
635 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
637 /* installed packages get a special upgrade allowed rule */
638 Pool *pool = solv->pool;
639 Id p, pp, n, p2, pp2;
646 if (solv && solv->updateCandidateCb)
647 { /* The application is responsible for */
648 return solv->updateCandidateCb(solv->pool, s, qs);
655 n = s - pool->solvables;
658 * look for updates for s
660 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
662 if (p == n) /* skip itself */
665 ps = pool->solvables + p;
666 if (s->name == ps->name) /* name match */
668 if (!allow_all && !solv->allowdowngrade && evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
671 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
673 obsp = ps->repo->idarraydata + ps->obsoletes;
674 while ((obs = *obsp++) != 0) /* for all obsoletes */
676 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
678 Solvable *ps2 = pool->solvables + p2;
679 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps2, obs))
681 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps2))
683 if (p2 == n) /* match ! */
689 if (!obs) /* continue if no match */
691 /* here we have 'p' with a matching provides/obsoletes combination
692 * thus flagging p as a valid update candidate for s
698 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
700 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
704 /* if we have found some valid candidates and noupdateprovide is not set, we're
705 done. otherwise we fallback to all obsoletes */
706 if (!solv->noupdateprovide && haveprovobs)
708 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
711 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
713 ps = pool->solvables + p;
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))