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
19 #include "solver_private.h"
22 #include "poolvendor.h"
27 /*-----------------------------------------------------------------*/
30 * prep for prune_best_version
35 prune_to_best_version_sortcmp(const void *ap, const void *bp, void *dp)
43 sa = pool->solvables + a;
44 sb = pool->solvables + b;
45 r = sa->name - sb->name;
49 /* different names. We use real strcmp here so that the result
50 * is not depending on some random solvable order */
51 na = pool_id2str(pool, sa->name);
52 nb = pool_id2str(pool, sb->name);
53 return strcmp(na, nb);
55 if (sa->arch != sb->arch)
58 aa = (sa->arch <= pool->lastarch) ? pool->id2arch[sa->arch] : 0;
59 ab = (sb->arch <= pool->lastarch) ? pool->id2arch[sb->arch] : 0;
60 if (aa != ab && aa > 1 && ab > 1)
61 return aa - ab; /* lowest score first */
64 /* the same name, bring installed solvables to the front */
67 if (sa->repo == pool->installed)
69 if (sb->repo != pool->installed)
72 else if (sb->repo == pool->installed)
75 /* sort by repository sub-prio (installed repo handled above) */
76 r = (sb->repo ? sb->repo->subpriority : 0) - (sa->repo ? sa->repo->subpriority : 0);
79 /* no idea about the order, sort by id */
85 * prune to repository with highest priority.
86 * does not prune installed solvables.
90 prune_to_highest_prio(Pool *pool, Queue *plist)
94 int bestprio = 0, bestprioset = 0;
96 /* prune to highest priority */
97 for (i = 0; i < plist->count; i++) /* find highest prio in queue */
99 s = pool->solvables + plist->elements[i];
100 if (pool->installed && s->repo == pool->installed)
102 if (!bestprioset || s->repo->priority > bestprio)
104 bestprio = s->repo->priority;
110 for (i = j = 0; i < plist->count; i++) /* remove all with lower prio */
112 s = pool->solvables + plist->elements[i];
113 if (s->repo->priority == bestprio || (pool->installed && s->repo == pool->installed))
114 plist->elements[j++] = plist->elements[i];
120 /* installed packages involed in a dup operation can only be kept
121 * if they are identical to a non-installed one */
123 solver_prune_installed_dup_packages(Solver *solv, Queue *plist)
125 Pool *pool = solv->pool;
126 int i, j, bestprio = 0;
128 /* find bestprio (again) */
129 for (i = 0; i < plist->count; i++)
131 Solvable *s = pool->solvables + plist->elements[i];
132 if (s->repo != pool->installed)
134 bestprio = s->repo->priority;
138 if (i == plist->count)
139 return; /* only installed packages, could not find prio */
140 for (i = j = 0; i < plist->count; i++)
142 Id p = plist->elements[i];
143 Solvable *s = pool->solvables + p;
144 if (s->repo != pool->installed && s->repo->priority < bestprio)
146 if (s->repo == pool->installed && (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))))
150 FOR_PROVIDES(p2, pp2, s->name)
152 Solvable *s2 = pool->solvables + p2;
153 if (s2->repo == pool->installed || s2->evr != s->evr || s2->repo->priority < bestprio)
155 if (!solvable_identical(s, s2))
158 if (s2->repo->priority > bestprio)
161 bestprio = s2->repo->priority;
166 continue; /* no identical package found, ignore installed package */
168 plist->elements[j++] = p;
175 * like prune_to_highest_prio, but calls solver prune_installed_dup_packages
176 * when there are dup packages
179 solver_prune_to_highest_prio(Solver *solv, Queue *plist)
181 prune_to_highest_prio(solv->pool, plist);
182 if (plist->count > 1 && solv->pool->installed && (solv->dupmap_all || solv->dupinvolvedmap.size))
183 solver_prune_installed_dup_packages(solv, plist);
188 solver_prune_to_highest_prio_per_name(Solver *solv, Queue *plist)
190 Pool *pool = solv->pool;
196 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
197 queue_push(&pq, plist->elements[0]);
198 name = pool->solvables[pq.elements[0]].name;
199 for (i = 1, j = 0; i < plist->count; i++)
201 if (pool->solvables[plist->elements[i]].name != name)
204 solver_prune_to_highest_prio(solv, &pq);
205 for (k = 0; k < pq.count; k++)
206 plist->elements[j++] = pq.elements[k];
208 queue_push(&pq, plist->elements[i]);
209 name = pool->solvables[pq.elements[0]].name;
213 solver_prune_to_highest_prio(solv, &pq);
214 for (k = 0; k < pq.count; k++)
215 plist->elements[j++] = pq.elements[k];
221 #ifdef ENABLE_COMPLEX_DEPS
223 /* simple fixed-size hash for package ids */
224 #define CPLXDEPHASH_EMPTY(elements) (memset(elements, 0, sizeof(Id) * 256))
225 #define CPLXDEPHASH_SET(elements, p) (elements[(p) & 255] |= (1 << ((p) >> 8 & 31)))
226 #define CPLXDEPHASH_TST(elements, p) (elements[(p) & 255] && (elements[(p) & 255] & (1 << ((p) >> 8 & 31))))
229 check_complex_dep(Solver *solv, Id dep, Map *m, Queue **cqp)
231 Pool *pool = solv->pool;
238 printf("check_complex_dep %s\n", pool_dep2str(pool, dep));
240 i = pool_normalize_complex_dep(pool, dep, &q, CPLXDEPS_EXPAND);
241 if (i == 0 || i == 1)
247 for (i = 0; i < qcnt; i++)
249 /* we rely on the fact that blocks are ordered here.
250 * if we reach a positive element, we know that we
251 * saw all negative ones */
252 for (; (p = q.elements[i]) < 0; i++)
254 if (solv->decisionmap[-p] < 0)
256 if (solv->decisionmap[-p] == 0)
257 queue_push(&q, -p); /* undecided negative literal */
262 printf("complex dep block cannot be true or no pos literals\n");
264 while (q.elements[i])
267 queue_truncate(&q, qcnt);
272 /* all negative literals installed, add positive literals to map */
273 for (; (p = q.elements[i]) != 0; i++)
278 /* at least one undecided negative literal, postpone */
282 printf("add new complex dep block\n");
283 for (j = qcnt; j < q.count; j++)
284 printf(" - %s\n", pool_solvid2str(pool, q.elements[j]));
286 while (q.elements[i])
290 cq = solv_calloc(1, sizeof(Queue));
292 queue_insertn(cq, 0, 256, 0); /* allocate hash area */
295 for (j = qcnt; j < q.count; j++)
298 /* check if we already have this (dep, p) entry */
299 for (k = 256; k < cq->count; k += 2)
300 if (cq->elements[k + 1] == dep && cq->elements[k] == p)
304 /* a new one. add to cq and hash */
305 queue_push2(cq, p, dep);
306 CPLXDEPHASH_SET(cq->elements, p);
309 queue_truncate(&q, qcnt);
316 recheck_complex_deps(Solver *solv, Id p, Map *m, Queue **cqp)
322 printf("recheck_complex_deps for package %s\n", pool_solvid2str(solv->pool, p));
324 /* make sure that we don't have a false hit */
325 for (i = 256; i < cq->count; i += 2)
326 if (cq->elements[i] == p)
329 return; /* false alert */
330 if (solv->decisionmap[p] <= 0)
331 return; /* just in case... */
333 /* rebuild the hash, call check_complex_dep for our package */
334 CPLXDEPHASH_EMPTY(cq->elements);
335 for (i = 256; i < cq->count; i += 2)
336 if ((pp = cq->elements[i]) == p)
338 Id dep = cq->elements[i + 1];
339 queue_deleten(cq, i, 2);
341 check_complex_dep(solv, dep, m, &cq);
344 CPLXDEPHASH_SET(cq->elements, pp);
351 policy_update_recommendsmap(Solver *solv)
353 Pool *pool = solv->pool;
355 Id p, pp, rec, *recp, sug, *sugp;
357 if (solv->recommends_index < 0)
359 MAPZERO(&solv->recommendsmap);
360 MAPZERO(&solv->suggestsmap);
361 #ifdef ENABLE_COMPLEX_DEPS
362 if (solv->recommendscplxq)
364 queue_free(solv->recommendscplxq);
365 solv->recommendscplxq = solv_free(solv->recommendscplxq);
367 if (solv->suggestscplxq)
369 queue_free(solv->suggestscplxq);
370 solv->suggestscplxq = solv_free(solv->suggestscplxq);
373 solv->recommends_index = 0;
375 while (solv->recommends_index < solv->decisionq.count)
377 p = solv->decisionq.elements[solv->recommends_index++];
380 s = pool->solvables + p;
381 #ifdef ENABLE_COMPLEX_DEPS
382 /* re-check postponed complex blocks */
383 if (solv->recommendscplxq && CPLXDEPHASH_TST(solv->recommendscplxq->elements, p))
384 recheck_complex_deps(solv, p, &solv->recommendsmap, &solv->recommendscplxq);
385 if (solv->suggestscplxq && CPLXDEPHASH_TST(solv->suggestscplxq->elements, p))
386 recheck_complex_deps(solv, p, &solv->suggestsmap, &solv->suggestscplxq);
390 recp = s->repo->idarraydata + s->recommends;
391 while ((rec = *recp++) != 0)
393 #ifdef ENABLE_COMPLEX_DEPS
394 if (pool_is_complex_dep(pool, rec))
396 check_complex_dep(solv, rec, &solv->recommendsmap, &solv->recommendscplxq);
400 FOR_PROVIDES(p, pp, rec)
401 MAPSET(&solv->recommendsmap, p);
406 sugp = s->repo->idarraydata + s->suggests;
407 while ((sug = *sugp++) != 0)
409 #ifdef ENABLE_COMPLEX_DEPS
410 if (pool_is_complex_dep(pool, sug))
412 check_complex_dep(solv, sug, &solv->suggestsmap, &solv->suggestscplxq);
416 FOR_PROVIDES(p, pp, sug)
417 MAPSET(&solv->suggestsmap, p);
423 /* bring suggested/enhanced packages to front
424 * installed packages count as suggested */
426 prefer_suggested(Solver *solv, Queue *plist)
428 Pool *pool = solv->pool;
431 /* update our recommendsmap/suggestsmap */
432 if (solv->recommends_index < solv->decisionq.count)
433 policy_update_recommendsmap(solv);
435 for (i = 0, count = plist->count; i < count; i++)
437 Id p = plist->elements[i];
438 Solvable *s = pool->solvables + p;
439 if ((pool->installed && s->repo == pool->installed) ||
440 MAPTST(&solv->suggestsmap, p) ||
441 solver_is_enhancing(solv, s))
442 continue; /* good package */
444 if (i < plist->count - 1)
446 memmove(plist->elements + i, plist->elements + i + 1, (plist->count - 1 - i) * sizeof(Id));
447 plist->elements[plist->count - 1] = p;
455 * prune to recommended/suggested packages.
456 * does not prune installed packages (they are also somewhat recommended).
459 prune_to_recommended(Solver *solv, Queue *plist)
461 Pool *pool = solv->pool;
469 for (i = 0; i < plist->count; i++)
471 p = plist->elements[i];
472 s = pool->solvables + p;
473 if (pool->installed && s->repo == pool->installed)
477 if (plist->count - ninst < 2)
480 /* update our recommendsmap/suggestsmap */
481 if (solv->recommends_index < solv->decisionq.count)
482 policy_update_recommendsmap(solv);
484 /* prune to recommended/supplemented */
486 for (i = j = 0; i < plist->count; i++)
488 p = plist->elements[i];
489 s = pool->solvables + p;
490 if (pool->installed && s->repo == pool->installed)
494 plist->elements[j++] = p;
497 if (!MAPTST(&solv->recommendsmap, p))
498 if (!solver_is_supplementing(solv, s))
502 for (k = 0; j < ninst; k++)
504 s = pool->solvables + plist->elements[k];
505 if (pool->installed && s->repo == pool->installed)
506 plist->elements[j++] = plist->elements[k];
509 plist->elements[j++] = p;
515 /* anything left to prune? */
516 if (plist->count - ninst < 2)
519 /* prune to suggested/enhanced */
521 for (i = j = 0; i < plist->count; i++)
523 p = plist->elements[i];
524 s = pool->solvables + p;
525 if (pool->installed && s->repo == pool->installed)
529 plist->elements[j++] = p;
532 if (!MAPTST(&solv->suggestsmap, p))
533 if (!solver_is_enhancing(solv, s))
537 for (k = 0; j < ninst; k++)
539 s = pool->solvables + plist->elements[k];
540 if (pool->installed && s->repo == pool->installed)
541 plist->elements[j++] = plist->elements[k];
544 plist->elements[j++] = p;
552 prune_to_best_arch(const Pool *pool, Queue *plist)
558 if (!pool->id2arch || plist->count < 2)
561 for (i = 0; i < plist->count; i++)
563 s = pool->solvables + plist->elements[i];
565 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
566 if (a && a != 1 && (!bestscore || a < bestscore))
571 for (i = j = 0; i < plist->count; i++)
573 s = pool->solvables + plist->elements[i];
575 if (a > pool->lastarch)
577 a = pool->id2arch[a];
578 /* a == 1 -> noarch */
579 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
581 plist->elements[j++] = plist->elements[i];
598 /* This is Tarjan's SCC algorithm, slightly modified */
600 trj_visit(struct trj_data *trj, Id node)
603 Pool *pool = trj->pool;
604 Queue *plist = trj->plist;
605 Id myidx, stackstart;
608 Id p, pp, obs, *obsp;
610 low[node] = myidx = trj->idx++;
611 trj->stack[(stackstart = trj->nstack++)] = node;
613 s = pool->solvables + plist->elements[node];
616 obsp = s->repo->idarraydata + s->obsoletes;
617 while ((obs = *obsp++) != 0)
619 FOR_PROVIDES(p, pp, obs)
621 Solvable *ps = pool->solvables + p;
622 if (ps->name == s->name)
624 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
626 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
628 /* hmm, expensive. should use hash if plist is big */
629 for (i = 0; i < plist->count; i++)
631 if (node != i && plist->elements[i] == p)
648 if (l < trj->firstidx)
651 /* this means we have reached an old SCC found earlier.
652 * delete it as we obsolete it */
655 if (low[trj->stack[k]] == l)
656 low[trj->stack[k]] = -1;
661 else if (l < low[node])
668 if (low[node] == myidx) /* found a SCC? */
670 /* we're only interested in SCCs that contain the first node,
671 * as all others are "obsoleted" */
672 if (myidx != trj->firstidx)
674 for (i = stackstart; i < trj->nstack; i++)
675 low[trj->stack[i]] = myidx;
676 trj->nstack = stackstart; /* empty stack */
681 * remove entries from plist that are obsoleted by other entries
682 * with different name.
685 prune_obsoleted(Pool *pool, Queue *plist)
687 Id data_buf[2 * 16], *data;
692 if (plist->count <= 16)
694 memset(data_buf, 0, sizeof(data_buf));
698 data = solv_calloc(plist->count, 2 * sizeof(Id));
703 trj.stack = data + plist->count - 1; /* -1 so we can index with idx (which starts with 1) */
704 for (i = 0; i < plist->count; i++)
708 s = pool->solvables + plist->elements[i];
711 trj.firstidx = trj.nstack = trj.idx;
716 Id myidx = trj.idx++;
718 trj.stack[myidx] = i;
721 for (i = j = 0; i < plist->count; i++)
723 plist->elements[j++] = plist->elements[i];
725 if (data != data_buf)
729 /* this is prune_obsoleted special-cased for two elements */
731 prune_obsoleted_2(Pool *pool, Queue *plist)
735 Id p, pp, obs, *obsp;
739 for (i = 0; i < 2; i++)
741 s = pool->solvables + plist->elements[i];
742 other = plist->elements[1 - i];
745 obsp = s->repo->idarraydata + s->obsoletes;
746 while ((obs = *obsp++) != 0)
748 FOR_PROVIDES(p, pp, obs)
753 ps = pool->solvables + p;
754 if (ps->name == s->name)
756 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
758 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
768 if (obmap == 0 || obmap == 3)
771 plist->elements[0] = plist->elements[1];
776 * bring those elements to the front of the queue that
777 * have a installed solvable with the same name
780 move_installed_to_front(Pool *pool, Queue *plist)
786 for (i = j = 0; i < plist->count; i++)
788 s = pool->solvables + plist->elements[i];
789 if (s->repo != pool->installed)
791 FOR_PROVIDES(p, pp, s->name)
793 Solvable *ps = pool->solvables + p;
794 if (s->name == ps->name && ps->repo == pool->installed)
801 if (s->repo == pool->installed)
805 p = plist->elements[i];
807 plist->elements[i] = plist->elements[j];
809 memmove(plist->elements + j + 1, plist->elements + j, (i - j) * sizeof(Id));
810 plist->elements[j] = p;
812 else if (j + 2 == plist->count)
813 break; /* no need to check last element if all prev ones are installed */
820 * prune_to_best_version
822 * sort list of packages (given through plist) by name and evr
823 * return result through plist
826 prune_to_best_version(Pool *pool, Queue *plist)
831 if (plist->count < 2) /* no need to prune for a single entry */
833 POOL_DEBUG(SOLV_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
835 /* sort by name first, prefer installed */
836 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
838 /* now find best 'per name' */
840 for (i = j = 0; i < plist->count; i++)
842 s = pool->solvables + plist->elements[i];
844 POOL_DEBUG(SOLV_DEBUG_POLICY, "- %s[%s]\n",
845 pool_solvable2str(pool, s),
846 (pool->installed && s->repo == pool->installed) ? "installed" : "not installed");
848 if (!best) /* if no best yet, the current is best */
854 /* name switch: finish group, re-init */
855 if (best->name != s->name) /* new name */
857 plist->elements[j++] = best - pool->solvables; /* move old best to front */
858 best = s; /* take current as new best */
862 if (best->evr != s->evr) /* compare evr */
864 if (pool_evrcmp(pool, best->evr, s->evr, EVRCMP_COMPARE) < 0)
868 plist->elements[j++] = best - pool->solvables; /* finish last group */
871 /* we reduced the list to one package per name, now look at
872 * package obsoletes */
873 if (plist->count > 1)
875 if (plist->count == 2)
876 prune_obsoleted_2(pool, plist);
878 prune_obsoleted(pool, plist);
880 if (plist->count > 1 && pool->installed)
881 move_installed_to_front(pool, plist);
886 sort_by_name_evr_sortcmp(const void *ap, const void *bp, void *dp)
889 Id a, *aa = (Id *)ap;
890 Id b, *bb = (Id *)bp;
891 Id r = aa[1] - bb[1];
893 return r < 0 ? -1 : 1;
896 a = aa[2] < 0 ? -aa[2] : aa[2];
897 b = bb[2] < 0 ? -bb[2] : bb[2];
898 if (pool->disttype != DISTTYPE_DEB && a != b)
900 /* treat release-less versions different */
901 const char *as = pool_id2str(pool, a);
902 const char *bs = pool_id2str(pool, b);
905 if (!strchr(bs, '-'))
914 r = pool_evrcmp(pool, b, a, EVRCMP_COMPARE);
915 if (!r && (aa[2] < 0 || bb[2] < 0))
923 return r < 0 ? -1 : 1;
927 /* common end of sort_by_srcversion and sort_by_common_dep */
929 sort_by_name_evr_array(Pool *pool, Queue *plist, int count, int ent)
932 int i, j, bad, havebad;
933 Id *pp, *elements = plist->elements;
937 queue_truncate(plist, count);
940 solv_sort(elements + count * 2, ent, sizeof(Id) * 3, sort_by_name_evr_sortcmp, pool);
943 for (i = 0, pp = elements + count * 2; i < ent; i++, pp += 3)
945 if (lastname && pp[1] == lastname)
947 if (pp[0] != pp[-3] && sort_by_name_evr_sortcmp(pp - 3, pp, pool) == -1)
950 printf("%s - %s: bad %s %s - %s\n", pool_solvid2str(pool, elements[pp[-3]]), pool_solvid2str(pool, elements[pp[0]]), pool_dep2str(pool, lastname), pool_id2str(pool, pp[-1] < 0 ? -pp[-1] : pp[-1]), pool_id2str(pool, pp[2] < 0 ? -pp[2] : pp[2]));
961 elements[count + pp[0]] += bad;
965 for (i = 0; i < count; i++)
966 printf("%s badness %d\n", pool_solvid2str(pool, elements[i]), elements[count + i]);
971 /* simple stable insertion sort */
973 for (i = 0; i < count; i++)
974 if (pool->solvables[elements[i]].repo == pool->installed)
975 elements[i + count] = 0;
976 for (i = 1; i < count; i++)
977 for (j = i, pp = elements + count + j; j > 0; j--, pp--)
980 Id *pp2 = pp - count;
991 queue_truncate(plist, count);
996 sort_by_srcversion(Pool *pool, Queue *plist)
998 int i, count = plist->count, ent = 0;
999 queue_insertn(plist, count, count, 0);
1000 for (i = 0; i < count; i++)
1002 Id name, evr, p = plist->elements[i];
1003 Solvable *s = pool->solvables + p;
1004 if (solvable_lookup_void(s, SOLVABLE_SOURCENAME))
1007 name = solvable_lookup_id(s, SOLVABLE_SOURCENAME);
1008 if (solvable_lookup_void(s, SOLVABLE_SOURCEEVR))
1011 evr = solvable_lookup_id(s, SOLVABLE_SOURCEEVR);
1012 if (!name || !evr || ISRELDEP(evr))
1014 queue_push(plist, i);
1015 queue_push2(plist, name, evr);
1018 sort_by_name_evr_array(pool, plist, count, ent);
1023 sort_by_common_dep(Pool *pool, Queue *plist)
1025 int i, count = plist->count, ent = 0;
1027 queue_insertn(plist, count, count, 0);
1028 for (i = 0; i < count; i++)
1030 Id p = plist->elements[i];
1031 Solvable *s = pool->solvables + p;
1034 for (dp = s->repo->idarraydata + s->provides; (id = *dp++) != 0; )
1039 rd = GETRELDEP(pool, id);
1040 if ((rd->flags == REL_EQ || rd->flags == (REL_EQ | REL_LT) || rd->flags == REL_LT) && !ISRELDEP(rd->evr))
1042 if (rd->flags == REL_EQ)
1045 const char *s = pool_id2str(pool, rd->evr);
1048 while ((*s >= 'a' && *s <= 'f') || (*s >= '0' && *s <= '9'))
1054 queue_push(plist, i);
1055 queue_push2(plist, rd->name, rd->flags == REL_LT ? -rd->evr : rd->evr);
1060 sort_by_name_evr_array(pool, plist, count, ent);
1063 /* check if we have an update candidate */
1065 dislike_old_versions(Pool *pool, Queue *plist)
1069 for (i = 0, count = plist->count; i < count; i++)
1071 Id p = plist->elements[i];
1072 Solvable *s = pool->solvables + p;
1073 Repo *repo = s->repo;
1077 if (!repo || repo == pool->installed)
1079 FOR_PROVIDES(q, qq, s->name)
1081 Solvable *qs = pool->solvables + q;
1084 if (s->name != qs->name || s->arch != qs->arch)
1086 if (repo->priority != qs->repo->priority)
1088 if (repo->priority > qs->repo->priority)
1093 if (pool_evrcmp(pool, qs->evr, s->evr, EVRCMP_COMPARE) > 0)
1102 if (i < plist->count - 1)
1104 memmove(plist->elements + i, plist->elements + i + 1, (plist->count - 1 - i) * sizeof(Id));
1105 plist->elements[plist->count - 1] = p;
1113 * POLICY_MODE_CHOOSE: default, do all pruning steps
1114 * POLICY_MODE_RECOMMEND: leave out prune_to_recommended
1115 * POLICY_MODE_SUGGEST: leave out prune_to_recommended, do prio pruning just per name
1118 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
1120 Pool *pool = solv->pool;
1121 if (plist->count > 1)
1123 if (mode != POLICY_MODE_SUGGEST)
1124 solver_prune_to_highest_prio(solv, plist);
1126 solver_prune_to_highest_prio_per_name(solv, plist);
1128 if (plist->count > 1)
1129 prune_to_best_arch(pool, plist);
1130 if (plist->count > 1)
1131 prune_to_best_version(pool, plist);
1132 if (plist->count > 1 && (mode == POLICY_MODE_CHOOSE || mode == POLICY_MODE_CHOOSE_NOREORDER))
1134 prune_to_recommended(solv, plist);
1135 if (plist->count > 1 && mode != POLICY_MODE_CHOOSE_NOREORDER)
1137 /* do some fancy reordering */
1139 sort_by_srcversion(pool, plist);
1141 dislike_old_versions(pool, plist);
1142 sort_by_common_dep(pool, plist);
1143 prefer_suggested(solv, plist);
1149 /* check if there is an illegal architecture change if
1150 * installed solvable s1 is replaced by s2 */
1152 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
1154 Pool *pool = solv->pool;
1155 Id a1 = s1->arch, a2 = s2->arch;
1157 /* we allow changes to/from noarch */
1158 if (a1 == a2 || a1 == pool->noarchid || a2 == pool->noarchid)
1162 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
1163 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
1164 if (((a1 ^ a2) & 0xffff0000) != 0)
1169 /* check if there is an illegal vendor change if
1170 * installed solvable s1 is replaced by s2 */
1172 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
1174 Pool *pool = solv->pool;
1176 Id vendormask1, vendormask2;
1178 if (pool->custom_vendorcheck)
1179 return pool->custom_vendorcheck(pool, s1, s2);
1181 /* treat a missing vendor as empty string */
1182 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
1183 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
1186 vendormask1 = pool_vendor2mask(pool, v1);
1188 return 1; /* can't match */
1189 vendormask2 = pool_vendor2mask(pool, v2);
1190 if ((vendormask1 & vendormask2) != 0)
1192 return 1; /* no class matches */
1195 /* check if it is illegal to replace installed
1196 * package "is" with package "s" (which must obsolete "is")
1199 policy_is_illegal(Solver *solv, Solvable *is, Solvable *s, int ignore)
1201 Pool *pool = solv->pool;
1203 int duppkg = solv->dupmap_all ? 1 : 0;
1204 if (!(ignore & POLICY_ILLEGAL_DOWNGRADE) && !(duppkg ? solv->dup_allowdowngrade : solv->allowdowngrade))
1206 if (is->name == s->name && pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE) > 0)
1207 ret |= POLICY_ILLEGAL_DOWNGRADE;
1209 if (!(ignore & POLICY_ILLEGAL_ARCHCHANGE) && !(duppkg ? solv->dup_allowarchchange : solv->allowarchchange))
1211 if (is->arch != s->arch && policy_illegal_archchange(solv, is, s))
1212 ret |= POLICY_ILLEGAL_ARCHCHANGE;
1214 if (!(ignore & POLICY_ILLEGAL_VENDORCHANGE) && !(duppkg ? solv->dup_allowvendorchange : solv->allowvendorchange))
1216 if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, is, s))
1217 ret |= POLICY_ILLEGAL_VENDORCHANGE;
1219 if (!(ignore & POLICY_ILLEGAL_NAMECHANGE) && !(duppkg ? solv->dup_allownamechange : solv->allownamechange))
1221 if (is->name != s->name)
1222 ret |= POLICY_ILLEGAL_NAMECHANGE;
1227 /*-------------------------------------------------------------------
1229 * create reverse obsoletes map for installed solvables
1231 * For each installed solvable find which packages with *different* names
1232 * obsolete the solvable.
1233 * This index is used in policy_findupdatepackages() below.
1236 policy_create_obsolete_index(Solver *solv)
1238 Pool *pool = solv->pool;
1240 Repo *installed = solv->installed;
1241 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
1244 solv->obsoletes = solv_free(solv->obsoletes);
1245 solv->obsoletes_data = solv_free(solv->obsoletes_data);
1246 if (!installed || installed->start == installed->end)
1248 cnt = installed->end - installed->start;
1249 solv->obsoletes = obsoletes = solv_calloc(cnt, sizeof(Id));
1250 for (i = 1; i < pool->nsolvables; i++)
1252 s = pool->solvables + i;
1255 if (!pool_installable(pool, s))
1257 obsp = s->repo->idarraydata + s->obsoletes;
1258 while ((obs = *obsp++) != 0)
1260 FOR_PROVIDES(p, pp, obs)
1262 Solvable *ps = pool->solvables + p;;
1263 if (ps->repo != installed)
1265 if (ps->name == s->name)
1267 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1269 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1271 obsoletes[p - installed->start]++;
1276 for (i = 0; i < cnt; i++)
1279 n += obsoletes[i] + 1;
1282 solv->obsoletes_data = obsoletes_data = solv_calloc(n + 1, sizeof(Id));
1283 POOL_DEBUG(SOLV_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
1284 for (i = pool->nsolvables - 1; i > 0; i--)
1286 s = pool->solvables + i;
1289 if (!pool_installable(pool, s))
1291 obsp = s->repo->idarraydata + s->obsoletes;
1292 while ((obs = *obsp++) != 0)
1294 FOR_PROVIDES(p, pp, obs)
1296 Solvable *ps = pool->solvables + p;;
1297 if (ps->repo != installed)
1299 if (ps->name == s->name)
1301 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1303 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1305 if (obsoletes_data[obsoletes[p - installed->start]] != i)
1306 obsoletes_data[--obsoletes[p - installed->start]] = i;
1314 * find update candidates
1316 * s: installed solvable to be updated
1317 * qs: [out] queue to hold Ids of candidates
1318 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
1323 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
1325 /* installed packages get a special upgrade allowed rule */
1326 Pool *pool = solv->pool;
1327 Id p, pp, n, p2, pp2;
1330 int haveprovobs = 0;
1331 int allowdowngrade = allow_all ? 1 : solv->allowdowngrade;
1332 int allownamechange = allow_all ? 1 : solv->allownamechange;
1333 int allowarchchange = allow_all ? 1 : solv->allowarchchange;
1334 int allowvendorchange = allow_all ? 1 : solv->allowvendorchange;
1337 allowdowngrade = solv->dup_allowdowngrade;
1338 allownamechange = solv->dup_allownamechange;
1339 allowarchchange = solv->dup_allowarchchange;
1340 allowvendorchange = solv->dup_allowvendorchange;
1345 n = s - pool->solvables;
1348 * look for updates for s
1350 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
1352 if (p == n) /* skip itself */
1355 ps = pool->solvables + p;
1356 if (s->name == ps->name) /* name match */
1358 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1360 if (!allowdowngrade && pool_evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
1363 else if (!allownamechange)
1365 else if ((!solv->noupdateprovide || solv->needupdateprovide) && ps->obsoletes) /* provides/obsoletes combination ? */
1367 /* check if package ps obsoletes installed package s */
1368 /* implicitobsoleteusescolors is somewhat wrong here, but we nevertheless
1369 * use it to limit our update candidates */
1370 if ((pool->obsoleteusescolors || pool->implicitobsoleteusescolors) && !pool_colormatch(pool, s, ps))
1372 obsp = ps->repo->idarraydata + ps->obsoletes;
1373 while ((obs = *obsp++) != 0) /* for all obsoletes */
1375 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
1377 Solvable *ps2 = pool->solvables + p2;
1378 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps2, obs))
1380 if (p2 == n) /* match ! */
1383 if (p2) /* match! */
1386 if (!obs) /* continue if no match */
1388 /* here we have 'p' with a matching provides/obsoletes combination
1389 * thus flagging p as a valid update candidate for s
1395 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
1397 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
1401 if (!allownamechange)
1403 /* if we have found some valid candidates and noupdateprovide is not set, we're
1404 done. otherwise we fallback to all obsoletes */
1405 if (solv->needupdateprovide || (!solv->noupdateprovide && haveprovobs))
1407 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
1410 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
1412 ps = pool->solvables + p;
1413 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
1415 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
1417 /* implicitobsoleteusescolors is somewhat wrong here, but we nevertheless
1418 * use it to limit our update candidates */
1419 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1427 policy_illegal2str(Solver *solv, int illegal, Solvable *s, Solvable *rs)
1429 Pool *pool = solv->pool;
1431 if (illegal == POLICY_ILLEGAL_DOWNGRADE)
1433 str = pool_tmpjoin(pool, "downgrade of ", pool_solvable2str(pool, s), 0);
1434 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1436 if (illegal == POLICY_ILLEGAL_NAMECHANGE)
1438 str = pool_tmpjoin(pool, "name change of ", pool_solvable2str(pool, s), 0);
1439 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1441 if (illegal == POLICY_ILLEGAL_ARCHCHANGE)
1443 str = pool_tmpjoin(pool, "architecture change of ", pool_solvable2str(pool, s), 0);
1444 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1446 if (illegal == POLICY_ILLEGAL_VENDORCHANGE)
1448 str = pool_tmpjoin(pool, "vendor change from '", pool_id2str(pool, s->vendor), "' (");
1451 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to '");
1452 str = pool_tmpappend(pool, str, pool_id2str(pool, rs->vendor), "' (");
1455 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to no vendor (");
1456 return pool_tmpappend(pool, str, pool_solvable2str(pool, rs), ")");
1458 return "unknown illegal change";