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(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 if (pool->solvables[p].name == s->name)
300 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
302 for (j = 0; j < plist->count; j++)
306 if (plist->elements[j] == p)
307 plist->elements[j] = 0;
312 /* delete zeroed out queue entries */
313 for (i = j = 0; i < plist->count; i++)
314 if (plist->elements[i])
315 plist->elements[j++] = plist->elements[i];
318 /* now find best 'per name' */
320 for (i = j = 0; i < plist->count; i++)
322 s = pool->solvables + plist->elements[i];
324 POOL_DEBUG(SAT_DEBUG_POLICY, "- %s[%s]\n",
325 solvable2str(pool, s),
326 (pool->installed && s->repo == pool->installed) ? "installed" : "not installed");
328 if (!best) /* if no best yet, the current is best */
330 best = plist->elements[i];
334 /* name switch: re-init */
335 if (pool->solvables[best].name != s->name) /* new name */
337 plist->elements[j++] = best; /* move old best to front */
338 best = plist->elements[i]; /* take current as new best */
342 if (pool->solvables[best].evr != s->evr) /* compare evr */
344 if (evrcmp(pool, pool->solvables[best].evr, s->evr, EVRCMP_COMPARE) < 0)
345 best = plist->elements[i];
350 best = plist->elements[0];
352 plist->elements[j++] = best;
357 /* legacy, do not use anymore!
358 * (rates arch higher than version, but thats a policy)
362 prune_best_arch_name_version(Solver *solv, Pool *pool, Queue *plist)
364 if (solv && solv->bestSolvableCb)
365 { /* The application is responsible for */
366 return solv->bestSolvableCb(solv->pool, plist);
369 if (plist->count > 1)
370 prune_to_best_arch(pool, plist);
371 if (plist->count > 1)
372 prune_to_best_version(pool, plist);
377 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
379 Pool *pool = solv->pool;
380 if (plist->count > 1 && mode != POLICY_MODE_SUGGEST)
381 prune_to_highest_prio(pool, plist);
382 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
383 prune_to_recommended(solv, plist);
384 prune_best_arch_name_version(solv, pool, plist);
389 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
391 Pool *pool = solv->pool;
392 Id a1 = s1->arch, a2 = s2->arch;
394 if (solv && solv->archCheckCb)
395 { /* The application is responsible for */
396 return solv->archCheckCb(solv->pool, s1, s2);
399 /* we allow changes to/from noarch */
400 if (a1 == a2 || a1 == ARCH_NOARCH || a2 == ARCH_NOARCH)
404 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
405 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
406 if (((a1 ^ a2) & 0xffff0000) != 0)
412 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
414 Pool *pool = solv->pool;
416 Id vendormask1, vendormask2;
418 if (solv->vendorCheckCb)
419 { /* The application is responsible for */
420 return solv->vendorCheckCb(pool, s1, s2);
422 /* treat a missing vendor as empty string */
423 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
424 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
427 vendormask1 = pool_vendor2mask(pool, v1);
429 return 1; /* can't match */
430 vendormask2 = pool_vendor2mask(pool, v2);
431 if ((vendormask1 & vendormask2) != 0)
433 return 1; /* no class matches */
437 /*-------------------------------------------------------------------
439 * create reverse obsoletes map for installed solvables
441 * For each installed solvable find which packages with *different* names
442 * obsolete the solvable.
443 * This index is used in policy_findupdatepackages() below.
446 policy_create_obsolete_index(Solver *solv)
448 Pool *pool = solv->pool;
450 Repo *installed = solv->installed;
451 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
454 if (!installed || installed->start == installed->end)
456 cnt = installed->end - installed->start;
457 solv->obsoletes = obsoletes = sat_calloc(cnt, sizeof(Id));
458 for (i = 1; i < pool->nsolvables; i++)
460 s = pool->solvables + i;
463 if (!pool_installable(pool, s))
465 obsp = s->repo->idarraydata + s->obsoletes;
466 while ((obs = *obsp++) != 0)
468 FOR_PROVIDES(p, pp, obs)
470 if (pool->solvables[p].repo != installed)
472 if (pool->solvables[p].name == s->name)
474 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
476 obsoletes[p - installed->start]++;
481 for (i = 0; i < cnt; i++)
484 n += obsoletes[i] + 1;
487 solv->obsoletes_data = obsoletes_data = sat_calloc(n + 1, sizeof(Id));
488 POOL_DEBUG(SAT_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
489 for (i = pool->nsolvables - 1; i > 0; i--)
491 s = pool->solvables + i;
494 if (!pool_installable(pool, s))
496 obsp = s->repo->idarraydata + s->obsoletes;
497 while ((obs = *obsp++) != 0)
499 FOR_PROVIDES(p, pp, obs)
501 if (pool->solvables[p].repo != installed)
503 if (pool->solvables[p].name == s->name)
505 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
507 p -= installed->start;
508 if (obsoletes_data[obsoletes[p]] != i)
509 obsoletes_data[--obsoletes[p]] = i;
517 * find update candidates
519 * s: solvable to be updated
520 * qs: [out] queue to hold Ids of candidates
521 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
525 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
527 /* installed packages get a special upgrade allowed rule */
528 Pool *pool = solv->pool;
529 Id p, pp, n, p2, pp2;
536 if (solv && solv->updateCandidateCb)
537 { /* The application is responsible for */
538 return solv->updateCandidateCb(solv->pool, s, qs);
545 n = s - pool->solvables;
548 * look for updates for s
550 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
552 if (p == n) /* skip itself */
555 ps = pool->solvables + p;
556 if (s->name == ps->name) /* name match */
558 if (!allow_all && !solv->allowdowngrade && evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
561 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
563 obsp = ps->repo->idarraydata + ps->obsoletes;
564 while ((obs = *obsp++) != 0) /* for all obsoletes */
566 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
568 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
570 if (p2 == n) /* match ! */
576 if (!obs) /* continue if no match */
578 /* here we have 'p' with a matching provides/obsoletes combination
579 * thus flagging p as a valid update candidate for s
585 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
587 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
591 /* if we have found some valid candidates and noupdateprovide is not set, we're
592 done. otherwise we fallback to all obsoletes */
593 if (!solv->noupdateprovide && haveprovobs)
595 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
598 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
600 ps = pool->solvables + p;
601 if (!allow_all && !solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
603 if (!allow_all && !solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))