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)
77 prune_to_highest_prio(Pool *pool, Queue *plist)
83 /* prune to highest priority */
84 for (i = 0; i < plist->count; i++)
86 s = pool->solvables + plist->elements[i];
87 if (i == 0 || s->repo->priority > bestprio)
88 bestprio = s->repo->priority;
90 for (i = j = 0; i < plist->count; i++)
92 s = pool->solvables + plist->elements[i];
93 if (s->repo->priority == bestprio)
94 plist->elements[j++] = plist->elements[i];
100 * prune_to_recommended
102 * XXX: should we prune to requires/suggests that are already
103 * fulfilled by other packages?
106 prune_to_recommended(Solver *solv, Queue *plist)
108 Pool *pool = solv->pool;
111 Id p, *pp, rec, *recp, sug, *sugp;
113 if (solv->recommends_index < 0)
115 MAPZERO(&solv->recommendsmap);
116 MAPZERO(&solv->suggestsmap);
117 solv->recommends_index = 0;
119 while (solv->recommends_index < solv->decisionq.count)
121 p = solv->decisionq.elements[solv->recommends_index++];
124 s = pool->solvables + p;
127 recp = s->repo->idarraydata + s->recommends;
128 while ((rec = *recp++) != 0)
129 FOR_PROVIDES(p, pp, rec)
130 MAPSET(&solv->recommendsmap, p);
134 sugp = s->repo->idarraydata + s->suggests;
135 while ((sug = *sugp++) != 0)
136 FOR_PROVIDES(p, pp, sug)
137 MAPSET(&solv->suggestsmap, p);
140 /* prune to recommended/supplemented */
141 for (i = j = 0; i < plist->count; i++)
143 p = plist->elements[i];
144 if (MAPTST(&solv->recommendsmap, p))
146 plist->elements[j++] = p;
149 if (solver_is_supplementing(solv, pool->solvables + p))
150 plist->elements[j++] = p;
155 /* prune to suggested/enhanced*/
156 if (plist->count < 2)
158 for (i = j = 0; i < plist->count; i++)
160 p = plist->elements[i];
161 if (MAPTST(&solv->suggestsmap, p))
163 plist->elements[j++] = p;
166 if (solver_is_enhancing(solv, pool->solvables + p))
167 plist->elements[j++] = p;
174 prune_to_best_arch(Pool *pool, Queue *plist)
180 if (!pool->id2arch || plist->count < 2)
183 for (i = 0; i < plist->count; i++)
185 s = pool->solvables + plist->elements[i];
187 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
188 if (a && a != 1 && (!bestscore || a < bestscore))
191 for (i = j = 0; i < plist->count; i++)
193 s = pool->solvables + plist->elements[i];
195 if (a > pool->lastarch)
197 a = pool->id2arch[a];
198 /* a == 1 -> noarch */
199 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
201 plist->elements[j++] = plist->elements[i];
208 * prune_best_version_arch
210 * sort list of packages (given through plist) by name and evr
211 * return result through plist
216 prune_to_best_version(Solver *solv, Queue *plist)
218 Pool *pool = solv->pool;
223 if (plist->count < 2) /* no need to prune for a single entry */
225 POOL_DEBUG(SAT_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
227 prune_best_version_arch_sortcmp_data = solv;
228 /* sort by name first, prefer installed */
229 qsort(plist->elements, plist->count, sizeof(Id), prune_best_version_arch_sortcmp);
231 /* delete obsoleted. hmm, looks expensive! */
232 /* FIXME maybe also check provides depending on noupdateprovide? */
233 /* FIXME do not prune cycles */
234 for (i = 0; i < plist->count; i++)
236 Id p, *pp, obs, *obsp;
237 s = pool->solvables + plist->elements[i];
240 obsp = s->repo->idarraydata + s->obsoletes;
241 while ((obs = *obsp++) != 0)
243 FOR_PROVIDES(p, pp, obs)
245 if (pool->solvables[p].name == s->name)
247 for (j = 0; j < plist->count; j++)
251 if (plist->elements[j] == p)
252 plist->elements[j] = 0;
257 for (i = j = 0; i < plist->count; i++)
258 if (plist->elements[i])
259 plist->elements[j++] = plist->elements[i];
262 /* now find best 'per name' */
263 for (i = j = 0; i < plist->count; i++)
265 s = pool->solvables + plist->elements[i];
267 POOL_DEBUG(SAT_DEBUG_POLICY, "- %s[%s]\n",
268 solvable2str(pool, s),
269 (solv->installed && s->repo == solv->installed) ? "installed" : "not installed");
271 if (!best) /* if no best yet, the current is best */
273 best = plist->elements[i];
277 /* name switch: re-init */
278 if (pool->solvables[best].name != s->name) /* new name */
280 plist->elements[j++] = best; /* move old best to front */
281 best = plist->elements[i]; /* take current as new best */
285 if (pool->solvables[best].evr != s->evr) /* compare evr */
287 if (evrcmp(pool, pool->solvables[best].evr, s->evr, EVRCMP_MATCH_RELEASE) < 0)
288 best = plist->elements[i];
293 best = plist->elements[0];
295 plist->elements[j++] = best;
300 prune_best_arch_name_version(Solver *solv, Pool *pool, Queue *plist)
302 if (solv && solv->bestSolvableCb)
303 { /* The application is responsible for */
304 return solv->bestSolvableCb (solv->pool, plist);
307 if (plist->count > 1)
308 prune_to_best_arch(pool, plist);
309 if (plist->count > 1)
310 prune_to_best_version(solv, plist);
315 policy_filter_unwanted(Solver *solv, Queue *plist, Id inst, int mode)
317 Pool *pool = solv->pool;
318 if (plist->count > 1 && mode != POLICY_MODE_SUGGEST)
319 prune_to_highest_prio(pool, plist);
320 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
321 prune_to_recommended(solv, plist);
322 /* FIXME: do this different! */
324 queue_push(plist, inst);
326 prune_best_arch_name_version (solv, pool, plist);
331 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
333 Pool *pool = solv->pool;
334 Id a1 = s1->arch, a2 = s2->arch;
336 if (solv && solv->archCheckCb)
337 { /* The application is responsible for */
338 return solv->archCheckCb (solv->pool, s1, s2);
341 /* we allow changes to/from noarch */
342 if (a1 == a2 || a1 == ARCH_NOARCH || a2 == ARCH_NOARCH)
346 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
347 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
348 if (((a1 ^ a2) & 0xffff0000) != 0)
354 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
356 Pool *pool = solv->pool;
357 Id vendormask1, vendormask2;
359 if (solv && solv->vendorCheckCb)
360 { /* The application is responsible for */
361 return solv->vendorCheckCb (solv->pool, s1, s2);
364 if (s1->vendor == s2->vendor)
366 vendormask1 = pool_vendor2mask(pool, s1->vendor);
369 vendormask2 = pool_vendor2mask(pool, s2->vendor);
370 if ((vendormask1 & vendormask2) == 0)
376 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allowall)
378 /* installed packages get a special upgrade allowed rule */
379 Pool *pool = solv->pool;
380 Id p, *pp, n, p2, *pp2;
387 if (solv && solv->updateCandidateCb)
388 { /* The application is responsible for */
389 return solv->updateCandidateCb (solv->pool, s, qs);
396 n = s - pool->solvables;
397 vendormask = pool_vendor2mask(pool, s->vendor);
400 * look for updates for s
402 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
404 if (p == n) /* skip itself */
407 ps = pool->solvables + p;
408 if (s->name == ps->name) /* name match */
412 if (!solv->allowdowngrade && evrcmp(pool, s->evr, ps->evr, EVRCMP_MATCH_RELEASE) > 0)
414 if (!solv->allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
416 if (!solv->allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
420 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
422 obsp = ps->repo->idarraydata + ps->obsoletes;
423 while ((obs = *obsp++) != 0) /* for all obsoletes */
425 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
427 if (p2 == n) /* match ! */
433 if (!obs) /* continue if no match */
435 /* here we have 'p' with a matching provides/obsoletes combination
436 * thus flagging p as a valid update candidate for s
443 if (solv->noupdateprovide && solv->obsoletes && solv->obsoletes[n - solv->installed->start])
445 for (pp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *pp++) != 0;)