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 inline Id dep2name(Pool *pool, Id dep)
29 Reldep *rd = rd = GETRELDEP(pool, dep);
35 static Solver *prune_best_version_arch_sortcmp_data;
37 /*-----------------------------------------------------------------*/
40 * prep for prune_best_version_arch
45 prune_best_version_arch_sortcmp(const void *ap, const void *bp)
47 Solver *solv = prune_best_version_arch_sortcmp_data;
48 Pool *pool = solv->pool;
52 r = pool->solvables[a].name - pool->solvables[b].name;
56 /* different names. We use real strcmp here so that the result
57 * is not depending on some random solvable order */
58 na = id2str(pool, pool->solvables[a].name);
59 nb = id2str(pool, pool->solvables[b].name);
60 /* bring patterns to the front */
61 /* XXX: no longer needed? */
62 if (!strncmp(na, "pattern:", 8))
64 if (strncmp(nb, "pattern:", 8))
67 else if (!strncmp(nb, "pattern:", 8))
69 if (strncmp(na, "pattern:", 8))
72 return strcmp(na, nb);
75 if (pool->solvables[a].evr == pool->solvables[b].evr && solv->installed)
77 /* prefer installed solvables */
78 if (pool->solvables[a].repo == solv->installed)
80 if (pool->solvables[b].repo == solv->installed)
88 * prune to repository with highest priority
93 prune_to_highest_prio(Pool *pool, Queue *plist)
99 /* prune to highest priority */
100 for (i = 0; i < plist->count; i++) /* find highest prio in queue */
102 s = pool->solvables + plist->elements[i];
103 if (i == 0 || s->repo->priority > bestprio)
104 bestprio = s->repo->priority;
106 for (i = j = 0; i < plist->count; i++) /* remove all with lower prio */
108 s = pool->solvables + plist->elements[i];
109 if (s->repo->priority == bestprio)
110 plist->elements[j++] = plist->elements[i];
117 * prune_to_recommended
119 * XXX: should we prune to requires/suggests that are already
120 * fulfilled by other packages?
124 prune_to_recommended(Solver *solv, Queue *plist)
126 Pool *pool = solv->pool;
129 Id p, *pp, rec, *recp, sug, *sugp;
131 if (solv->recommends_index < 0)
133 MAPZERO(&solv->recommendsmap);
134 MAPZERO(&solv->suggestsmap);
135 solv->recommends_index = 0;
137 while (solv->recommends_index < solv->decisionq.count)
139 p = solv->decisionq.elements[solv->recommends_index++];
142 s = pool->solvables + p;
145 recp = s->repo->idarraydata + s->recommends;
146 while ((rec = *recp++) != 0)
147 FOR_PROVIDES(p, pp, rec)
148 MAPSET(&solv->recommendsmap, p);
152 sugp = s->repo->idarraydata + s->suggests;
153 while ((sug = *sugp++) != 0)
154 FOR_PROVIDES(p, pp, sug)
155 MAPSET(&solv->suggestsmap, p);
158 /* prune to recommended/supplemented */
159 for (i = j = 0; i < plist->count; i++)
161 p = plist->elements[i];
162 if (MAPTST(&solv->recommendsmap, p))
164 plist->elements[j++] = p;
167 if (solver_is_supplementing(solv, pool->solvables + p))
168 plist->elements[j++] = p;
173 /* prune to suggested/enhanced*/
174 if (plist->count < 2)
176 for (i = j = 0; i < plist->count; i++)
178 p = plist->elements[i];
179 if (MAPTST(&solv->suggestsmap, p))
181 plist->elements[j++] = p;
184 if (solver_is_enhancing(solv, pool->solvables + p))
185 plist->elements[j++] = p;
192 prune_to_best_arch(Pool *pool, Queue *plist)
198 if (!pool->id2arch || plist->count < 2)
201 for (i = 0; i < plist->count; i++)
203 s = pool->solvables + plist->elements[i];
205 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
206 if (a && a != 1 && (!bestscore || a < bestscore))
209 for (i = j = 0; i < plist->count; i++)
211 s = pool->solvables + plist->elements[i];
213 if (a > pool->lastarch)
215 a = pool->id2arch[a];
216 /* a == 1 -> noarch */
217 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
219 plist->elements[j++] = plist->elements[i];
226 * prune_best_version_arch
228 * sort list of packages (given through plist) by name and evr
229 * return result through plist
234 prune_to_best_version(Solver *solv, Queue *plist)
236 Pool *pool = solv->pool;
241 if (plist->count < 2) /* no need to prune for a single entry */
243 POOL_DEBUG(SAT_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
245 prune_best_version_arch_sortcmp_data = solv;
246 /* sort by name first, prefer installed */
247 qsort(plist->elements, plist->count, sizeof(Id), prune_best_version_arch_sortcmp);
249 /* delete obsoleted. hmm, looks expensive! */
250 /* FIXME maybe also check provides depending on noupdateprovide? */
251 /* FIXME do not prune cycles */
252 for (i = 0; i < plist->count; i++)
254 Id p, *pp, obs, *obsp;
255 s = pool->solvables + plist->elements[i];
258 obsp = s->repo->idarraydata + s->obsoletes;
259 while ((obs = *obsp++) != 0)
261 Id obsname = dep2name(pool, obs);
262 FOR_PROVIDES(p, pp, obs)
264 if (pool->solvables[p].name == s->name)
266 if (!solv->obsoleteusesprovides && obsname != pool->solvables[p].name)
268 for (j = 0; j < plist->count; j++)
272 if (plist->elements[j] == p)
273 plist->elements[j] = 0;
278 for (i = j = 0; i < plist->count; i++)
279 if (plist->elements[i])
280 plist->elements[j++] = plist->elements[i];
283 /* now find best 'per name' */
284 for (i = j = 0; i < plist->count; i++)
286 s = pool->solvables + plist->elements[i];
288 POOL_DEBUG(SAT_DEBUG_POLICY, "- %s[%s]\n",
289 solvable2str(pool, s),
290 (solv->installed && s->repo == solv->installed) ? "installed" : "not installed");
292 if (!best) /* if no best yet, the current is best */
294 best = plist->elements[i];
298 /* name switch: re-init */
299 if (pool->solvables[best].name != s->name) /* new name */
301 plist->elements[j++] = best; /* move old best to front */
302 best = plist->elements[i]; /* take current as new best */
306 if (pool->solvables[best].evr != s->evr) /* compare evr */
308 if (evrcmp(pool, pool->solvables[best].evr, s->evr, EVRCMP_MATCH_RELEASE) < 0)
309 best = plist->elements[i];
314 best = plist->elements[0];
316 plist->elements[j++] = best;
321 /* legacy, do not use anymore!
322 * (rates arch higher than version, but thats a policy)
326 prune_best_arch_name_version(Solver *solv, Pool *pool, Queue *plist)
328 if (solv && solv->bestSolvableCb)
329 { /* The application is responsible for */
330 return solv->bestSolvableCb(solv->pool, plist);
333 if (plist->count > 1)
334 prune_to_best_arch(pool, plist);
335 if (plist->count > 1)
336 prune_to_best_version(solv, plist);
341 policy_filter_unwanted(Solver *solv, Queue *plist, Id inst, int mode)
343 Pool *pool = solv->pool;
344 if (plist->count > 1 && mode != POLICY_MODE_SUGGEST)
345 prune_to_highest_prio(pool, plist);
346 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
347 prune_to_recommended(solv, plist);
348 /* FIXME: do this different! */
350 queue_push(plist, inst);
352 prune_best_arch_name_version(solv, pool, plist);
357 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
359 Pool *pool = solv->pool;
360 Id a1 = s1->arch, a2 = s2->arch;
362 if (solv && solv->archCheckCb)
363 { /* The application is responsible for */
364 return solv->archCheckCb(solv->pool, s1, s2);
367 /* we allow changes to/from noarch */
368 if (a1 == a2 || a1 == ARCH_NOARCH || a2 == ARCH_NOARCH)
372 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
373 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
374 if (((a1 ^ a2) & 0xffff0000) != 0)
380 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
382 Pool *pool = solv->pool;
383 Id vendormask1, vendormask2;
385 if (solv && solv->vendorCheckCb)
386 { /* The application is responsible for */
387 return solv->vendorCheckCb(solv->pool, s1, s2);
390 if (s1->vendor == s2->vendor)
392 vendormask1 = pool_vendor2mask(pool, s1->vendor);
395 vendormask2 = pool_vendor2mask(pool, s2->vendor);
396 if ((vendormask1 & vendormask2) == 0)
402 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allowall)
404 /* installed packages get a special upgrade allowed rule */
405 Pool *pool = solv->pool;
406 Id p, *pp, n, p2, *pp2;
413 if (solv && solv->updateCandidateCb)
414 { /* The application is responsible for */
415 return solv->updateCandidateCb(solv->pool, s, qs);
422 n = s - pool->solvables;
423 vendormask = pool_vendor2mask(pool, s->vendor);
426 * look for updates for s
428 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
430 if (p == n) /* skip itself */
433 ps = pool->solvables + p;
434 if (s->name == ps->name) /* name match */
438 if (!solv->allowdowngrade && evrcmp(pool, s->evr, ps->evr, EVRCMP_MATCH_RELEASE) > 0)
440 if (!solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
442 if (!solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
446 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
448 obsp = ps->repo->idarraydata + ps->obsoletes;
449 while ((obs = *obsp++) != 0) /* for all obsoletes */
451 Id obsname = dep2name(pool, obs);
452 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
454 if (!solv->obsoleteusesprovides && obsname != pool->solvables[p2].name)
456 if (p2 == n) /* match ! */
462 if (!obs) /* continue if no match */
464 /* here we have 'p' with a matching provides/obsoletes combination
465 * thus flagging p as a valid update candidate for s
472 if (solv->noupdateprovide && solv->obsoletes && solv->obsoletes[n - solv->installed->start])
474 for (pp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *pp++) != 0;)