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_best_version_arch_sortcmp_data;
27 /*-----------------------------------------------------------------*/
30 * prep for prune_best_version_arch
35 prune_best_version_arch_sortcmp(const void *ap, const void *bp)
37 Solver *solv = prune_best_version_arch_sortcmp_data;
38 Pool *pool = solv->pool;
42 r = pool->solvables[a].name - pool->solvables[b].name;
46 /* different names. We use real strcmp here so that the result
47 * is not depending on some random solvable order */
48 na = id2str(pool, pool->solvables[a].name);
49 nb = id2str(pool, pool->solvables[b].name);
50 /* bring patterns to the front */
51 if (!strncmp(na, "pattern:", 8))
53 if (strncmp(nb, "pattern:", 8))
56 else if (!strncmp(nb, "pattern:", 8))
58 if (strncmp(na, "pattern:", 8))
61 return strcmp(na, nb);
64 if ( pool->solvables[a].evr == pool->solvables[b].evr)
66 /* prefer installed solvables first */
67 if (solv->installed && pool->solvables[a].repo == solv->installed)
69 if (solv->installed && pool->solvables[b].repo == solv->installed)
78 * prune queue, only keep solvables of kind
83 prune_to_kind(Pool *pool, Queue *plist, solvable_kind kind)
88 /* prune to highest priority */
89 for (i = j = 0; i < plist->count; i++)
91 s = pool->solvables + plist->elements[i];
93 plist->elements[j++] = plist->elements[i];
100 * prune to repository with highest priority
105 prune_to_highest_prio(Pool *pool, Queue *plist)
111 /* prune to highest priority */
112 for (i = 0; i < plist->count; i++) /* find highest prio in queue */
114 s = pool->solvables + plist->elements[i];
115 if (i == 0 || s->repo->priority > bestprio)
116 bestprio = s->repo->priority;
118 for (i = j = 0; i < plist->count; i++) /* remove all with lower prio */
120 s = pool->solvables + plist->elements[i];
121 if (s->repo->priority == bestprio)
122 plist->elements[j++] = plist->elements[i];
129 * prune_to_recommended
131 * XXX: should we prune to requires/suggests that are already
132 * fulfilled by other packages?
136 prune_to_recommended(Solver *solv, Queue *plist)
138 Pool *pool = solv->pool;
141 Id p, *pp, rec, *recp, sug, *sugp;
143 if (solv->recommends_index < 0)
145 MAPZERO(&solv->recommendsmap);
146 MAPZERO(&solv->suggestsmap);
147 solv->recommends_index = 0;
149 while (solv->recommends_index < solv->decisionq.count)
151 p = solv->decisionq.elements[solv->recommends_index++];
154 s = pool->solvables + p;
157 recp = s->repo->idarraydata + s->recommends;
158 while ((rec = *recp++) != 0)
159 FOR_PROVIDES(p, pp, rec)
160 MAPSET(&solv->recommendsmap, p);
164 sugp = s->repo->idarraydata + s->suggests;
165 while ((sug = *sugp++) != 0)
166 FOR_PROVIDES(p, pp, sug)
167 MAPSET(&solv->suggestsmap, p);
170 /* prune to recommended/supplemented */
171 for (i = j = 0; i < plist->count; i++)
173 p = plist->elements[i];
174 if (MAPTST(&solv->recommendsmap, p))
176 plist->elements[j++] = p;
179 if (solver_is_supplementing(solv, pool->solvables + p))
180 plist->elements[j++] = p;
185 /* prune to suggested/enhanced*/
186 if (plist->count < 2)
188 for (i = j = 0; i < plist->count; i++)
190 p = plist->elements[i];
191 if (MAPTST(&solv->suggestsmap, p))
193 plist->elements[j++] = p;
196 if (solver_is_enhancing(solv, pool->solvables + p))
197 plist->elements[j++] = p;
204 prune_to_best_arch(Pool *pool, Queue *plist)
210 if (!pool->id2arch || plist->count < 2)
213 for (i = 0; i < plist->count; i++)
215 s = pool->solvables + plist->elements[i];
217 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
218 if (a && a != 1 && (!bestscore || a < bestscore))
221 for (i = j = 0; i < plist->count; i++)
223 s = pool->solvables + plist->elements[i];
225 if (a > pool->lastarch)
227 a = pool->id2arch[a];
228 /* a == 1 -> noarch */
229 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
231 plist->elements[j++] = plist->elements[i];
238 * prune_best_version_arch
240 * sort list of packages (given through plist) by name and evr
241 * return result through plist
246 prune_to_best_version(Solver *solv, Queue *plist)
248 Pool *pool = solv->pool;
253 if (plist->count < 2) /* no need to prune for a single entry */
255 POOL_DEBUG(SAT_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
257 prune_best_version_arch_sortcmp_data = solv;
258 /* sort by name first, prefer installed */
259 qsort(plist->elements, plist->count, sizeof(Id), prune_best_version_arch_sortcmp);
261 /* delete obsoleted. hmm, looks expensive! */
262 /* FIXME maybe also check provides depending on noupdateprovide? */
263 /* FIXME do not prune cycles */
264 for (i = 0; i < plist->count; i++)
266 Id p, *pp, obs, *obsp;
267 s = pool->solvables + plist->elements[i];
270 obsp = s->repo->idarraydata + s->obsoletes;
271 while ((obs = *obsp++) != 0)
273 FOR_PROVIDES(p, pp, obs)
275 if (pool->solvables[p].name == s->name)
277 for (j = 0; j < plist->count; j++)
281 if (plist->elements[j] == p)
282 plist->elements[j] = 0;
287 for (i = j = 0; i < plist->count; i++)
288 if (plist->elements[i])
289 plist->elements[j++] = plist->elements[i];
292 /* now find best 'per name' */
293 for (i = j = 0; i < plist->count; i++)
295 s = pool->solvables + plist->elements[i];
297 POOL_DEBUG(SAT_DEBUG_POLICY, "- %s[%s]\n",
298 solvable2str(pool, s),
299 (solv->installed && s->repo == solv->installed) ? "installed" : "not installed");
301 if (!best) /* if no best yet, the current is best */
303 best = plist->elements[i];
307 /* name switch: re-init */
308 if (pool->solvables[best].name != s->name) /* new name */
310 plist->elements[j++] = best; /* move old best to front */
311 best = plist->elements[i]; /* take current as new best */
315 if (pool->solvables[best].evr != s->evr) /* compare evr */
317 if (evrcmp(pool, pool->solvables[best].evr, s->evr, EVRCMP_MATCH_RELEASE) < 0)
318 best = plist->elements[i];
323 best = plist->elements[0];
325 plist->elements[j++] = best;
330 /* legacy, do not use anymore!
331 * (rates arch higher than version, but thats a policy)
335 prune_best_arch_name_version(Solver *solv, Pool *pool, Queue *plist)
337 if (solv && solv->bestSolvableCb)
338 { /* The application is responsible for */
339 return solv->bestSolvableCb (solv->pool, plist);
342 if (plist->count > 1)
343 prune_to_best_arch(pool, plist);
344 if (plist->count > 1)
345 prune_to_best_version(solv, plist);
350 policy_filter_unwanted(Solver *solv, Queue *plist, Id inst, int mode)
352 Pool *pool = solv->pool;
353 if (plist->count > 1 && solv->limittokind)
354 prune_to_kind(pool, plist, solv->limittokind-1);
355 if (plist->count > 1 && mode != POLICY_MODE_SUGGEST)
356 prune_to_highest_prio(pool, plist);
357 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
358 prune_to_recommended(solv, plist);
359 /* FIXME: do this different! */
361 queue_push(plist, inst);
363 prune_best_arch_name_version (solv, pool, plist);
368 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
370 Pool *pool = solv->pool;
371 Id a1 = s1->arch, a2 = s2->arch;
373 if (solv && solv->archCheckCb)
374 { /* The application is responsible for */
375 return solv->archCheckCb (solv->pool, s1, s2);
378 /* we allow changes to/from noarch */
379 if (a1 == a2 || a1 == ARCH_NOARCH || a2 == ARCH_NOARCH)
383 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
384 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
385 if (((a1 ^ a2) & 0xffff0000) != 0)
391 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
393 Pool *pool = solv->pool;
394 Id vendormask1, vendormask2;
396 if (solv && solv->vendorCheckCb)
397 { /* The application is responsible for */
398 return solv->vendorCheckCb (solv->pool, s1, s2);
401 if (s1->vendor == s2->vendor)
403 vendormask1 = pool_vendor2mask(pool, s1->vendor);
406 vendormask2 = pool_vendor2mask(pool, s2->vendor);
407 if ((vendormask1 & vendormask2) == 0)
413 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allowall)
415 /* installed packages get a special upgrade allowed rule */
416 Pool *pool = solv->pool;
417 Id p, *pp, n, p2, *pp2;
424 if (solv && solv->updateCandidateCb)
425 { /* The application is responsible for */
426 return solv->updateCandidateCb (solv->pool, s, qs);
433 n = s - pool->solvables;
434 vendormask = pool_vendor2mask(pool, s->vendor);
437 * look for updates for s
439 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
441 if (p == n) /* skip itself */
444 ps = pool->solvables + p;
445 if (s->name == ps->name) /* name match */
449 if (!solv->allowdowngrade && evrcmp(pool, s->evr, ps->evr, EVRCMP_MATCH_RELEASE) > 0)
451 if (!solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
453 if (!solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
457 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
459 obsp = ps->repo->idarraydata + ps->obsoletes;
460 while ((obs = *obsp++) != 0) /* for all obsoletes */
462 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
464 if (p2 == n) /* match ! */
470 if (!obs) /* continue if no match */
472 /* here we have 'p' with a matching provides/obsoletes combination
473 * thus flagging p as a valid update candidate for s
480 if (solv->noupdateprovide && solv->obsoletes && solv->obsoletes[n - solv->installed->start])
482 for (pp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *pp++) != 0;)