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 /* bring patterns to the front */
55 /* XXX: no longer needed? */
56 if (!strncmp(na, "pattern:", 8))
58 if (strncmp(nb, "pattern:", 8))
61 else if (!strncmp(nb, "pattern:", 8))
63 if (strncmp(na, "pattern:", 8))
66 return strcmp(na, nb);
68 /* the same name, bring installed solvables to the front */
71 if (sa->repo == solv->installed)
73 if (sb->repo != solv->installed)
76 else if (sb->repo == solv->installed)
79 /* sort by repository sub-prio (installed repo handled above) */
80 r = (sb->repo ? sb->repo->subpriority : 0) - (sa->repo ? sa->repo->subpriority : 0);
83 /* no idea about the order, sort by id */
89 * prune to repository with highest priority.
90 * does not prune installed solvables.
94 prune_to_highest_prio(Pool *pool, Queue *plist)
98 int bestprio = 0, bestprioset = 0;
100 /* prune to highest priority */
101 for (i = 0; i < plist->count; i++) /* find highest prio in queue */
103 s = pool->solvables + plist->elements[i];
104 if (pool->installed && s->repo == pool->installed)
106 if (!bestprioset || s->repo->priority > bestprio)
108 bestprio = s->repo->priority;
114 for (i = j = 0; i < plist->count; i++) /* remove all with lower prio */
116 s = pool->solvables + plist->elements[i];
117 if (s->repo->priority == bestprio || (pool->installed && s->repo == pool->installed))
118 plist->elements[j++] = plist->elements[i];
125 * prune to recommended/suggested packages.
126 * does not prune installed packages (they are also somewhat recommended).
130 prune_to_recommended(Solver *solv, Queue *plist)
132 Pool *pool = solv->pool;
135 Id p, pp, rec, *recp, sug, *sugp;
140 for (i = 0; i < plist->count; i++)
142 p = plist->elements[i];
143 s = pool->solvables + p;
144 if (pool->installed && s->repo == pool->installed)
148 if (plist->count - ninst < 2)
151 /* update our recommendsmap/suggestsmap */
152 if (solv->recommends_index < 0)
154 MAPZERO(&solv->recommendsmap);
155 MAPZERO(&solv->suggestsmap);
156 solv->recommends_index = 0;
158 while (solv->recommends_index < solv->decisionq.count)
160 p = solv->decisionq.elements[solv->recommends_index++];
163 s = pool->solvables + p;
166 recp = s->repo->idarraydata + s->recommends;
167 while ((rec = *recp++) != 0)
168 FOR_PROVIDES(p, pp, rec)
169 MAPSET(&solv->recommendsmap, p);
173 sugp = s->repo->idarraydata + s->suggests;
174 while ((sug = *sugp++) != 0)
175 FOR_PROVIDES(p, pp, sug)
176 MAPSET(&solv->suggestsmap, p);
180 /* prune to recommended/supplemented */
182 for (i = j = 0; i < plist->count; i++)
184 p = plist->elements[i];
185 s = pool->solvables + p;
186 if (pool->installed && s->repo == pool->installed)
190 plist->elements[j++] = p;
193 if (!MAPTST(&solv->recommendsmap, p))
194 if (!solver_is_supplementing(solv, s))
198 for (k = 0; j < ninst; k++)
200 s = pool->solvables + plist->elements[k];
201 if (pool->installed && s->repo == pool->installed)
202 plist->elements[j++] = plist->elements[k];
205 plist->elements[j++] = p;
210 /* anything left to prune? */
211 if (plist->count - ninst < 2)
214 /* prune to suggested/enhanced*/
216 for (i = j = 0; i < plist->count; i++)
218 p = plist->elements[i];
219 s = pool->solvables + p;
220 if (pool->installed && s->repo == pool->installed)
224 plist->elements[j++] = p;
227 if (!MAPTST(&solv->suggestsmap, p))
228 if (!solver_is_enhancing(solv, s))
232 for (k = 0; j < ninst; k++)
234 s = pool->solvables + plist->elements[k];
235 if (pool->installed && s->repo == pool->installed)
236 plist->elements[j++] = plist->elements[k];
239 plist->elements[j++] = p;
246 prune_to_best_arch(Pool *pool, Queue *plist)
252 if (!pool->id2arch || plist->count < 2)
255 for (i = 0; i < plist->count; i++)
257 s = pool->solvables + plist->elements[i];
259 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
260 if (a && a != 1 && (!bestscore || a < bestscore))
263 for (i = j = 0; i < plist->count; i++)
265 s = pool->solvables + plist->elements[i];
267 if (a > pool->lastarch)
269 a = pool->id2arch[a];
270 /* a == 1 -> noarch */
271 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
273 plist->elements[j++] = plist->elements[i];
280 * prune_to_best_version
282 * sort list of packages (given through plist) by name and evr
283 * return result through plist
286 prune_to_best_version(Solver *solv, Queue *plist)
288 Pool *pool = solv->pool;
293 if (plist->count < 2) /* no need to prune for a single entry */
295 POOL_DEBUG(SAT_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
297 prune_to_best_version_sortcmp_data = solv;
298 /* sort by name first, prefer installed */
299 qsort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp);
301 /* delete obsoleted. hmm, looks expensive! */
302 /* FIXME maybe also check provides depending on noupdateprovide? */
303 /* FIXME do not prune cycles */
304 for (i = 0; i < plist->count; i++)
306 Id p, pp, obs, *obsp;
307 s = pool->solvables + plist->elements[i];
310 obsp = s->repo->idarraydata + s->obsoletes;
311 while ((obs = *obsp++) != 0)
313 FOR_PROVIDES(p, pp, obs)
315 if (pool->solvables[p].name == s->name)
317 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
319 for (j = 0; j < plist->count; j++)
323 if (plist->elements[j] == p)
324 plist->elements[j] = 0;
329 /* delete zeroed out queue entries */
330 for (i = j = 0; i < plist->count; i++)
331 if (plist->elements[i])
332 plist->elements[j++] = plist->elements[i];
335 /* now find best 'per name' */
337 for (i = j = 0; i < plist->count; i++)
339 s = pool->solvables + plist->elements[i];
341 POOL_DEBUG(SAT_DEBUG_POLICY, "- %s[%s]\n",
342 solvable2str(pool, s),
343 (solv->installed && s->repo == solv->installed) ? "installed" : "not installed");
345 if (!best) /* if no best yet, the current is best */
347 best = plist->elements[i];
351 /* name switch: re-init */
352 if (pool->solvables[best].name != s->name) /* new name */
354 plist->elements[j++] = best; /* move old best to front */
355 best = plist->elements[i]; /* take current as new best */
359 if (pool->solvables[best].evr != s->evr) /* compare evr */
361 if (evrcmp(pool, pool->solvables[best].evr, s->evr, EVRCMP_COMPARE) < 0)
362 best = plist->elements[i];
367 best = plist->elements[0];
369 plist->elements[j++] = best;
374 /* legacy, do not use anymore!
375 * (rates arch higher than version, but thats a policy)
379 prune_best_arch_name_version(Solver *solv, Pool *pool, Queue *plist)
381 if (solv && solv->bestSolvableCb)
382 { /* The application is responsible for */
383 return solv->bestSolvableCb(solv->pool, plist);
386 if (plist->count > 1)
387 prune_to_best_arch(pool, plist);
388 if (plist->count > 1)
389 prune_to_best_version(solv, plist);
394 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
396 Pool *pool = solv->pool;
397 if (plist->count > 1 && mode != POLICY_MODE_SUGGEST)
398 prune_to_highest_prio(pool, plist);
399 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
400 prune_to_recommended(solv, plist);
401 prune_best_arch_name_version(solv, pool, plist);
406 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
408 Pool *pool = solv->pool;
409 Id a1 = s1->arch, a2 = s2->arch;
411 if (solv && solv->archCheckCb)
412 { /* The application is responsible for */
413 return solv->archCheckCb(solv->pool, s1, s2);
416 /* we allow changes to/from noarch */
417 if (a1 == a2 || a1 == ARCH_NOARCH || a2 == ARCH_NOARCH)
421 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
422 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
423 if (((a1 ^ a2) & 0xffff0000) != 0)
429 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
431 Pool *pool = solv->pool;
432 Id vendormask1, vendormask2;
434 if (solv && solv->vendorCheckCb)
435 { /* The application is responsible for */
436 return solv->vendorCheckCb(solv->pool, s1, s2);
439 if (s1->vendor == s2->vendor)
441 vendormask1 = pool_vendor2mask(pool, s1->vendor);
444 vendormask2 = pool_vendor2mask(pool, s2->vendor);
445 if ((vendormask1 & vendormask2) == 0)
452 * find update candidates
454 * s: solvable to be updated
455 * qs: [out] queue to hold Ids of candidates
456 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
460 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
462 /* installed packages get a special upgrade allowed rule */
463 Pool *pool = solv->pool;
464 Id p, pp, n, p2, pp2;
470 if (solv && solv->updateCandidateCb)
471 { /* The application is responsible for */
472 return solv->updateCandidateCb(solv->pool, s, qs);
479 n = s - pool->solvables;
482 * look for updates for s
484 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
486 if (p == n) /* skip itself */
489 ps = pool->solvables + p;
490 if (s->name == ps->name) /* name match */
492 if (!allow_all && !solv->allowdowngrade && evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
495 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
497 obsp = ps->repo->idarraydata + ps->obsoletes;
498 while ((obs = *obsp++) != 0) /* for all obsoletes */
500 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
502 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
504 if (p2 == n) /* match ! */
510 if (!obs) /* continue if no match */
512 /* here we have 'p' with a matching provides/obsoletes combination
513 * thus flagging p as a valid update candidate for s
518 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
520 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
524 /* if we have found some valid candidates and noupdateprovide is not set, we're
525 done. otherwise we fallback to all obsoletes */
526 if (!solv->noupdateprovide && qs->count)
528 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
531 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
533 ps = pool->solvables + p;
534 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
536 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))