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_arch
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];
110 * prune to recommended/suggested packages.
111 * does not prune installed packages (they are also somewhat recommended).
115 prune_to_recommended(Solver *solv, Queue *plist)
117 Pool *pool = solv->pool;
120 Id p, pp, rec, *recp, sug, *sugp;
125 for (i = 0; i < plist->count; i++)
127 p = plist->elements[i];
128 s = pool->solvables + p;
129 if (pool->installed && s->repo == pool->installed)
133 if (plist->count - ninst < 2)
136 /* update our recommendsmap/suggestsmap */
137 if (solv->recommends_index < 0)
139 MAPZERO(&solv->recommendsmap);
140 MAPZERO(&solv->suggestsmap);
141 solv->recommends_index = 0;
143 while (solv->recommends_index < solv->decisionq.count)
145 p = solv->decisionq.elements[solv->recommends_index++];
148 s = pool->solvables + p;
151 recp = s->repo->idarraydata + s->recommends;
152 while ((rec = *recp++) != 0)
153 FOR_PROVIDES(p, pp, rec)
154 MAPSET(&solv->recommendsmap, p);
158 sugp = s->repo->idarraydata + s->suggests;
159 while ((sug = *sugp++) != 0)
160 FOR_PROVIDES(p, pp, sug)
161 MAPSET(&solv->suggestsmap, p);
165 /* prune to recommended/supplemented */
167 for (i = j = 0; i < plist->count; i++)
169 p = plist->elements[i];
170 s = pool->solvables + p;
171 if (pool->installed && s->repo == pool->installed)
175 plist->elements[j++] = p;
178 if (!MAPTST(&solv->recommendsmap, p))
179 if (!solver_is_supplementing(solv, s))
183 for (k = 0; j < ninst; k++)
185 s = pool->solvables + plist->elements[k];
186 if (pool->installed && s->repo == pool->installed)
187 plist->elements[j++] = plist->elements[k];
190 plist->elements[j++] = p;
195 /* anything left to prune? */
196 if (plist->count - ninst < 2)
199 /* prune to suggested/enhanced*/
201 for (i = j = 0; i < plist->count; i++)
203 p = plist->elements[i];
204 s = pool->solvables + p;
205 if (pool->installed && s->repo == pool->installed)
209 plist->elements[j++] = p;
212 if (!MAPTST(&solv->suggestsmap, p))
213 if (!solver_is_enhancing(solv, s))
217 for (k = 0; j < ninst; k++)
219 s = pool->solvables + plist->elements[k];
220 if (pool->installed && s->repo == pool->installed)
221 plist->elements[j++] = plist->elements[k];
224 plist->elements[j++] = p;
231 prune_to_best_arch(const Pool *pool, Queue *plist)
237 if (!pool->id2arch || plist->count < 2)
240 for (i = 0; i < plist->count; i++)
242 s = pool->solvables + plist->elements[i];
244 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
245 if (a && a != 1 && (!bestscore || a < bestscore))
248 for (i = j = 0; i < plist->count; i++)
250 s = pool->solvables + plist->elements[i];
252 if (a > pool->lastarch)
254 a = pool->id2arch[a];
255 /* a == 1 -> noarch */
256 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
258 plist->elements[j++] = plist->elements[i];
265 * prune_to_best_version
267 * sort list of packages (given through plist) by name and evr
268 * return result through plist
271 prune_to_best_version(Pool *pool, Queue *plist)
277 if (plist->count < 2) /* no need to prune for a single entry */
279 POOL_DEBUG(SAT_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
281 /* sort by name first, prefer installed */
282 sat_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
284 /* delete obsoleted. hmm, looks expensive! */
285 /* FIXME maybe also check provides depending on noupdateprovide? */
286 /* FIXME do not prune cycles */
287 for (i = 0; i < plist->count; i++)
289 Id p, pp, obs, *obsp;
290 s = pool->solvables + plist->elements[i];
293 obsp = s->repo->idarraydata + s->obsoletes;
294 while ((obs = *obsp++) != 0)
296 FOR_PROVIDES(p, pp, obs)
298 Solvable *ps = pool->solvables + p;
299 if (ps->name == s->name)
301 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
303 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
305 for (j = 0; j < plist->count; j++)
309 if (plist->elements[j] == p)
310 plist->elements[j] = 0;
315 /* delete zeroed out queue entries */
316 for (i = j = 0; i < plist->count; i++)
317 if (plist->elements[i])
318 plist->elements[j++] = plist->elements[i];
321 /* now find best 'per name' */
323 for (i = j = 0; i < plist->count; i++)
325 s = pool->solvables + plist->elements[i];
327 POOL_DEBUG(SAT_DEBUG_POLICY, "- %s[%s]\n",
328 solvable2str(pool, s),
329 (pool->installed && s->repo == pool->installed) ? "installed" : "not installed");
331 if (!best) /* if no best yet, the current is best */
333 best = plist->elements[i];
337 /* name switch: re-init */
338 if (pool->solvables[best].name != s->name) /* new name */
340 plist->elements[j++] = best; /* move old best to front */
341 best = plist->elements[i]; /* take current as new best */
345 if (pool->solvables[best].evr != s->evr) /* compare evr */
347 if (evrcmp(pool, pool->solvables[best].evr, s->evr, EVRCMP_COMPARE) < 0)
348 best = plist->elements[i];
353 best = plist->elements[0];
355 plist->elements[j++] = best;
360 /* legacy, do not use anymore!
361 * (rates arch higher than version, but thats a policy)
365 prune_best_arch_name_version(const Solver *solv, Pool *pool, Queue *plist)
367 if (solv && solv->bestSolvableCb)
368 { /* The application is responsible for */
369 return solv->bestSolvableCb(solv->pool, plist);
372 if (plist->count > 1)
373 prune_to_best_arch(pool, plist);
374 if (plist->count > 1)
375 prune_to_best_version(pool, plist);
380 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
382 Pool *pool = solv->pool;
383 if (plist->count > 1 && mode != POLICY_MODE_SUGGEST)
385 prune_to_highest_prio(pool, plist);
386 /* installed packages involed in a dup operation can only be kept
387 * if they are identical to a non-installed one */
388 if (plist->count > 1 && pool->installed && (solv->dupmap_all || solv->dupinvolvedmap.size))
391 for (i = j = 0; i < plist->count; i++)
393 Id p = plist->elements[i];
394 Solvable *s = pool->solvables + p;
395 if (s->repo == pool->installed && (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))))
397 for (k = 0; k < plist->count; k++)
399 Solvable *s2 = pool->solvables + plist->elements[k];
400 if (s2->repo != pool->installed && solvable_identical(s, s2))
403 if (k == plist->count)
404 continue; /* no identical package found, ignore installed package */
406 plist->elements[j++] = p;
412 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
413 prune_to_recommended(solv, plist);
414 prune_best_arch_name_version(solv, pool, plist);
419 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
421 Pool *pool = solv->pool;
422 Id a1 = s1->arch, a2 = s2->arch;
424 if (solv && solv->archCheckCb)
425 { /* The application is responsible for */
426 return solv->archCheckCb(solv->pool, s1, s2);
429 /* we allow changes to/from noarch */
430 #ifndef DEBIAN_SEMANTICS
431 if (a1 == a2 || a1 == ARCH_NOARCH || a2 == ARCH_NOARCH)
434 if (a1 == a2 || a1 == ARCH_ALL || a2 == ARCH_ALL)
439 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
440 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
441 if (((a1 ^ a2) & 0xffff0000) != 0)
447 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
449 Pool *pool = solv->pool;
451 Id vendormask1, vendormask2;
453 if (solv->vendorCheckCb)
454 { /* The application is responsible for */
455 return solv->vendorCheckCb(pool, s1, s2);
457 /* treat a missing vendor as empty string */
458 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
459 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
462 vendormask1 = pool_vendor2mask(pool, v1);
464 return 1; /* can't match */
465 vendormask2 = pool_vendor2mask(pool, v2);
466 if ((vendormask1 & vendormask2) != 0)
468 return 1; /* no class matches */
471 /* check if it is illegal to replace installed
472 * package "is" with package "s" (which must obsolete "is")
475 policy_is_illegal(Solver *solv, Solvable *is, Solvable *s, int ignore)
477 Pool *pool = solv->pool;
479 if (!(ignore & POLICY_ILLEGAL_DOWNGRADE) && !solv->allowdowngrade)
481 if (is->name == s->name && evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE) > 0)
482 ret |= POLICY_ILLEGAL_DOWNGRADE;
484 if (!(ignore & POLICY_ILLEGAL_ARCHCHANGE) && !solv->allowarchchange)
486 if (is->arch != s->arch && policy_illegal_archchange(solv, s, is))
487 ret |= POLICY_ILLEGAL_ARCHCHANGE;
489 if (!(ignore & POLICY_ILLEGAL_VENDORCHANGE) && !solv->allowvendorchange)
491 if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, s, is))
492 ret |= POLICY_ILLEGAL_VENDORCHANGE;
497 /*-------------------------------------------------------------------
499 * create reverse obsoletes map for installed solvables
501 * For each installed solvable find which packages with *different* names
502 * obsolete the solvable.
503 * This index is used in policy_findupdatepackages() below.
506 policy_create_obsolete_index(Solver *solv)
508 Pool *pool = solv->pool;
510 Repo *installed = solv->installed;
511 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
514 if (!installed || installed->start == installed->end)
516 cnt = installed->end - installed->start;
517 solv->obsoletes = obsoletes = sat_calloc(cnt, sizeof(Id));
518 for (i = 1; i < pool->nsolvables; i++)
520 s = pool->solvables + i;
523 if (!pool_installable(pool, s))
525 obsp = s->repo->idarraydata + s->obsoletes;
526 while ((obs = *obsp++) != 0)
528 FOR_PROVIDES(p, pp, obs)
530 Solvable *ps = pool->solvables + p;;
531 if (ps->repo != installed)
533 if (ps->name == s->name)
535 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
537 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
539 obsoletes[p - installed->start]++;
544 for (i = 0; i < cnt; i++)
547 n += obsoletes[i] + 1;
550 solv->obsoletes_data = obsoletes_data = sat_calloc(n + 1, sizeof(Id));
551 POOL_DEBUG(SAT_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
552 for (i = pool->nsolvables - 1; i > 0; i--)
554 s = pool->solvables + i;
557 if (!pool_installable(pool, s))
559 obsp = s->repo->idarraydata + s->obsoletes;
560 while ((obs = *obsp++) != 0)
562 FOR_PROVIDES(p, pp, obs)
564 Solvable *ps = pool->solvables + p;;
565 if (ps->repo != installed)
567 if (ps->name == s->name)
569 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
571 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
573 if (obsoletes_data[obsoletes[p - installed->start]] != i)
574 obsoletes_data[--obsoletes[p - installed->start]] = i;
582 * find update candidates
584 * s: solvable to be updated
585 * qs: [out] queue to hold Ids of candidates
586 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
590 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
592 /* installed packages get a special upgrade allowed rule */
593 Pool *pool = solv->pool;
594 Id p, pp, n, p2, pp2;
601 if (solv && solv->updateCandidateCb)
602 { /* The application is responsible for */
603 return solv->updateCandidateCb(solv->pool, s, qs);
610 n = s - pool->solvables;
613 * look for updates for s
615 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
617 if (p == n) /* skip itself */
620 ps = pool->solvables + p;
621 if (s->name == ps->name) /* name match */
623 if (!allow_all && !solv->allowdowngrade && evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
626 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
628 obsp = ps->repo->idarraydata + ps->obsoletes;
629 while ((obs = *obsp++) != 0) /* for all obsoletes */
631 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
633 Solvable *ps2 = pool->solvables + p2;
634 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps2, obs))
636 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps2))
638 if (p2 == n) /* match ! */
644 if (!obs) /* continue if no match */
646 /* here we have 'p' with a matching provides/obsoletes combination
647 * thus flagging p as a valid update candidate for s
653 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
655 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
659 /* if we have found some valid candidates and noupdateprovide is not set, we're
660 done. otherwise we fallback to all obsoletes */
661 if (!solv->noupdateprovide && haveprovobs)
663 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
666 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
668 ps = pool->solvables + p;
669 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
671 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))