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 static Solver *prune_to_best_version_sortcmp_data;
27 /*-----------------------------------------------------------------*/
30 * prep for prune_best_version_arch
35 prune_to_best_version_sortcmp(const void *ap, const void *bp)
37 Solver *solv = prune_to_best_version_sortcmp_data;
38 Pool *pool = solv->pool;
44 sa = pool->solvables + a;
45 sb = pool->solvables + b;
46 r = sa->name - sb->name;
50 /* different names. We use real strcmp here so that the result
51 * is not depending on some random solvable order */
52 na = id2str(pool, sa->name);
53 nb = id2str(pool, sb->name);
54 return strcmp(na, nb);
56 /* the same name, bring installed solvables to the front */
59 if (sa->repo == solv->installed)
61 if (sb->repo != solv->installed)
64 else if (sb->repo == solv->installed)
67 /* sort by repository sub-prio (installed repo handled above) */
68 r = (sb->repo ? sb->repo->subpriority : 0) - (sa->repo ? sa->repo->subpriority : 0);
71 /* no idea about the order, sort by id */
77 * prune to repository with highest priority.
78 * does not prune installed solvables.
82 prune_to_highest_prio(Pool *pool, Queue *plist)
86 int bestprio = 0, bestprioset = 0;
88 /* prune to highest priority */
89 for (i = 0; i < plist->count; i++) /* find highest prio in queue */
91 s = pool->solvables + plist->elements[i];
92 if (pool->installed && s->repo == pool->installed)
94 if (!bestprioset || s->repo->priority > bestprio)
96 bestprio = s->repo->priority;
102 for (i = j = 0; i < plist->count; i++) /* remove all with lower prio */
104 s = pool->solvables + plist->elements[i];
105 if (s->repo->priority == bestprio || (pool->installed && s->repo == pool->installed))
106 plist->elements[j++] = plist->elements[i];
113 * prune to recommended/suggested packages.
114 * does not prune installed packages (they are also somewhat recommended).
118 prune_to_recommended(Solver *solv, Queue *plist)
120 Pool *pool = solv->pool;
123 Id p, pp, rec, *recp, sug, *sugp;
128 for (i = 0; i < plist->count; i++)
130 p = plist->elements[i];
131 s = pool->solvables + p;
132 if (pool->installed && s->repo == pool->installed)
136 if (plist->count - ninst < 2)
139 /* update our recommendsmap/suggestsmap */
140 if (solv->recommends_index < 0)
142 MAPZERO(&solv->recommendsmap);
143 MAPZERO(&solv->suggestsmap);
144 solv->recommends_index = 0;
146 while (solv->recommends_index < solv->decisionq.count)
148 p = solv->decisionq.elements[solv->recommends_index++];
151 s = pool->solvables + p;
154 recp = s->repo->idarraydata + s->recommends;
155 while ((rec = *recp++) != 0)
156 FOR_PROVIDES(p, pp, rec)
157 MAPSET(&solv->recommendsmap, p);
161 sugp = s->repo->idarraydata + s->suggests;
162 while ((sug = *sugp++) != 0)
163 FOR_PROVIDES(p, pp, sug)
164 MAPSET(&solv->suggestsmap, p);
168 /* prune to recommended/supplemented */
170 for (i = j = 0; i < plist->count; i++)
172 p = plist->elements[i];
173 s = pool->solvables + p;
174 if (pool->installed && s->repo == pool->installed)
178 plist->elements[j++] = p;
181 if (!MAPTST(&solv->recommendsmap, p))
182 if (!solver_is_supplementing(solv, s))
186 for (k = 0; j < ninst; k++)
188 s = pool->solvables + plist->elements[k];
189 if (pool->installed && s->repo == pool->installed)
190 plist->elements[j++] = plist->elements[k];
193 plist->elements[j++] = p;
198 /* anything left to prune? */
199 if (plist->count - ninst < 2)
202 /* prune to suggested/enhanced*/
204 for (i = j = 0; i < plist->count; i++)
206 p = plist->elements[i];
207 s = pool->solvables + p;
208 if (pool->installed && s->repo == pool->installed)
212 plist->elements[j++] = p;
215 if (!MAPTST(&solv->suggestsmap, p))
216 if (!solver_is_enhancing(solv, s))
220 for (k = 0; j < ninst; k++)
222 s = pool->solvables + plist->elements[k];
223 if (pool->installed && s->repo == pool->installed)
224 plist->elements[j++] = plist->elements[k];
227 plist->elements[j++] = p;
234 prune_to_best_arch(Pool *pool, Queue *plist)
240 if (!pool->id2arch || plist->count < 2)
243 for (i = 0; i < plist->count; i++)
245 s = pool->solvables + plist->elements[i];
247 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
248 if (a && a != 1 && (!bestscore || a < bestscore))
251 for (i = j = 0; i < plist->count; i++)
253 s = pool->solvables + plist->elements[i];
255 if (a > pool->lastarch)
257 a = pool->id2arch[a];
258 /* a == 1 -> noarch */
259 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
261 plist->elements[j++] = plist->elements[i];
268 * prune_to_best_version
270 * sort list of packages (given through plist) by name and evr
271 * return result through plist
274 prune_to_best_version(Solver *solv, Queue *plist)
276 Pool *pool = solv->pool;
281 if (plist->count < 2) /* no need to prune for a single entry */
283 POOL_DEBUG(SAT_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
285 prune_to_best_version_sortcmp_data = solv;
286 /* sort by name first, prefer installed */
287 qsort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp);
289 /* delete obsoleted. hmm, looks expensive! */
290 /* FIXME maybe also check provides depending on noupdateprovide? */
291 /* FIXME do not prune cycles */
292 for (i = 0; i < plist->count; i++)
294 Id p, pp, obs, *obsp;
295 s = pool->solvables + plist->elements[i];
298 obsp = s->repo->idarraydata + s->obsoletes;
299 while ((obs = *obsp++) != 0)
301 FOR_PROVIDES(p, pp, obs)
303 if (pool->solvables[p].name == s->name)
305 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
307 for (j = 0; j < plist->count; j++)
311 if (plist->elements[j] == p)
312 plist->elements[j] = 0;
317 /* delete zeroed out queue entries */
318 for (i = j = 0; i < plist->count; i++)
319 if (plist->elements[i])
320 plist->elements[j++] = plist->elements[i];
323 /* now find best 'per name' */
325 for (i = j = 0; i < plist->count; i++)
327 s = pool->solvables + plist->elements[i];
329 POOL_DEBUG(SAT_DEBUG_POLICY, "- %s[%s]\n",
330 solvable2str(pool, s),
331 (solv->installed && s->repo == solv->installed) ? "installed" : "not installed");
333 if (!best) /* if no best yet, the current is best */
335 best = plist->elements[i];
339 /* name switch: re-init */
340 if (pool->solvables[best].name != s->name) /* new name */
342 plist->elements[j++] = best; /* move old best to front */
343 best = plist->elements[i]; /* take current as new best */
347 if (pool->solvables[best].evr != s->evr) /* compare evr */
349 if (evrcmp(pool, pool->solvables[best].evr, s->evr, EVRCMP_COMPARE) < 0)
350 best = plist->elements[i];
355 best = plist->elements[0];
357 plist->elements[j++] = best;
362 /* legacy, do not use anymore!
363 * (rates arch higher than version, but thats a policy)
367 prune_best_arch_name_version(Solver *solv, Pool *pool, Queue *plist)
369 if (solv && solv->bestSolvableCb)
370 { /* The application is responsible for */
371 return solv->bestSolvableCb(solv->pool, plist);
374 if (plist->count > 1)
375 prune_to_best_arch(pool, plist);
376 if (plist->count > 1)
377 prune_to_best_version(solv, plist);
382 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
384 Pool *pool = solv->pool;
385 if (plist->count > 1 && mode != POLICY_MODE_SUGGEST)
386 prune_to_highest_prio(pool, plist);
387 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
388 prune_to_recommended(solv, plist);
389 prune_best_arch_name_version(solv, pool, plist);
394 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
396 Pool *pool = solv->pool;
397 Id a1 = s1->arch, a2 = s2->arch;
399 if (solv && solv->archCheckCb)
400 { /* The application is responsible for */
401 return solv->archCheckCb(solv->pool, s1, s2);
404 /* we allow changes to/from noarch */
405 if (a1 == a2 || a1 == ARCH_NOARCH || a2 == ARCH_NOARCH)
409 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
410 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
411 if (((a1 ^ a2) & 0xffff0000) != 0)
417 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
419 Pool *pool = solv->pool;
420 Id vendormask1, vendormask2;
422 if (solv && solv->vendorCheckCb)
423 { /* The application is responsible for */
424 return solv->vendorCheckCb(solv->pool, s1, s2);
427 if (s1->vendor == s2->vendor)
429 vendormask1 = pool_vendor2mask(pool, s1->vendor);
432 vendormask2 = pool_vendor2mask(pool, s2->vendor);
433 if ((vendormask1 & vendormask2) != 0)
440 * find update candidates
442 * s: solvable to be updated
443 * qs: [out] queue to hold Ids of candidates
444 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
448 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
450 /* installed packages get a special upgrade allowed rule */
451 Pool *pool = solv->pool;
452 Id p, pp, n, p2, pp2;
458 if (solv && solv->updateCandidateCb)
459 { /* The application is responsible for */
460 return solv->updateCandidateCb(solv->pool, s, qs);
467 n = s - pool->solvables;
470 * look for updates for s
472 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
474 if (p == n) /* skip itself */
477 ps = pool->solvables + p;
478 if (s->name == ps->name) /* name match */
480 if (!allow_all && !solv->allowdowngrade && evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
483 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
485 obsp = ps->repo->idarraydata + ps->obsoletes;
486 while ((obs = *obsp++) != 0) /* for all obsoletes */
488 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
490 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
492 if (p2 == n) /* match ! */
498 if (!obs) /* continue if no match */
500 /* here we have 'p' with a matching provides/obsoletes combination
501 * thus flagging p as a valid update candidate for s
506 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
508 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
512 /* if we have found some valid candidates and noupdateprovide is not set, we're
513 done. otherwise we fallback to all obsoletes */
514 if (!solv->noupdateprovide && qs->count)
516 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
519 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
521 ps = pool->solvables + p;
522 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
524 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))