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"
24 #include "linkedpkg.h"
29 /*-----------------------------------------------------------------*/
32 * prep for prune_best_version
37 prune_to_best_version_sortcmp(const void *ap, const void *bp, void *dp)
45 sa = pool->solvables + a;
46 sb = pool->solvables + b;
47 r = sa->name - sb->name;
51 /* different names. We use real strcmp here so that the result
52 * is not depending on some random solvable order */
53 na = pool_id2str(pool, sa->name);
54 nb = pool_id2str(pool, sb->name);
55 return strcmp(na, nb);
57 if (sa->arch != sb->arch)
60 aa = (sa->arch <= pool->lastarch) ? pool->id2arch[sa->arch] : 0;
61 ab = (sb->arch <= pool->lastarch) ? pool->id2arch[sb->arch] : 0;
62 if (aa != ab && aa > 1 && ab > 1)
63 return aa - ab; /* lowest score first */
66 /* the same name, bring installed solvables to the front */
69 if (sa->repo == pool->installed)
71 if (sb->repo != pool->installed)
74 else if (sb->repo == pool->installed)
77 /* sort by repository sub-prio (installed repo handled above) */
78 r = (sb->repo ? sb->repo->subpriority : 0) - (sa->repo ? sa->repo->subpriority : 0);
81 /* no idea about the order, sort by id */
87 * prune to repository with highest priority.
88 * does not prune installed solvables.
92 prune_to_highest_prio(Pool *pool, Queue *plist)
96 int bestprio = 0, bestprioset = 0;
98 /* prune to highest priority */
99 for (i = 0; i < plist->count; i++) /* find highest prio in queue */
101 s = pool->solvables + plist->elements[i];
102 if (pool->installed && s->repo == pool->installed)
104 if (!bestprioset || s->repo->priority > bestprio)
106 bestprio = s->repo->priority;
112 for (i = j = 0; i < plist->count; i++) /* remove all with lower prio */
114 s = pool->solvables + plist->elements[i];
115 if (s->repo->priority == bestprio || (pool->installed && s->repo == pool->installed))
116 plist->elements[j++] = plist->elements[i];
122 /* installed packages involed in a dup operation can only be kept
123 * if they are identical to a non-installed one */
125 solver_prune_installed_dup_packages(Solver *solv, Queue *plist)
127 Pool *pool = solv->pool;
128 int i, j, bestprio = 0;
130 /* find bestprio (again) */
131 for (i = 0; i < plist->count; i++)
133 Solvable *s = pool->solvables + plist->elements[i];
134 if (s->repo != pool->installed)
136 bestprio = s->repo->priority;
140 if (i == plist->count)
141 return; /* only installed packages, could not find prio */
142 for (i = j = 0; i < plist->count; i++)
144 Id p = plist->elements[i];
145 Solvable *s = pool->solvables + p;
146 if (s->repo != pool->installed && s->repo->priority < bestprio)
148 if (s->repo == pool->installed && (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))))
152 FOR_PROVIDES(p2, pp2, s->name)
154 Solvable *s2 = pool->solvables + p2;
155 if (s2->repo == pool->installed || s2->evr != s->evr || s2->repo->priority < bestprio)
157 if (!solvable_identical(s, s2))
160 if (s2->repo->priority > bestprio)
163 bestprio = s2->repo->priority;
168 continue; /* no identical package found, ignore installed package */
170 plist->elements[j++] = p;
177 * like prune_to_highest_prio, but calls solver prune_installed_dup_packages
178 * when there are dup packages
181 solver_prune_to_highest_prio(Solver *solv, Queue *plist)
183 prune_to_highest_prio(solv->pool, plist);
184 if (plist->count > 1 && solv->pool->installed && (solv->dupmap_all || solv->dupinvolvedmap.size))
185 solver_prune_installed_dup_packages(solv, plist);
190 solver_prune_to_highest_prio_per_name(Solver *solv, Queue *plist)
192 Pool *pool = solv->pool;
198 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
199 queue_push(&pq, plist->elements[0]);
200 name = pool->solvables[pq.elements[0]].name;
201 for (i = 1, j = 0; i < plist->count; i++)
203 if (pool->solvables[plist->elements[i]].name != name)
206 solver_prune_to_highest_prio(solv, &pq);
207 for (k = 0; k < pq.count; k++)
208 plist->elements[j++] = pq.elements[k];
210 queue_push(&pq, plist->elements[i]);
211 name = pool->solvables[pq.elements[0]].name;
215 solver_prune_to_highest_prio(solv, &pq);
216 for (k = 0; k < pq.count; k++)
217 plist->elements[j++] = pq.elements[k];
223 #ifdef ENABLE_COMPLEX_DEPS
225 /* simple fixed-size hash for package ids */
226 #define CPLXDEPHASH_EMPTY(elements) (memset(elements, 0, sizeof(Id) * 256))
227 #define CPLXDEPHASH_SET(elements, p) (elements[(p) & 255] |= (1 << ((p) >> 8 & 31)))
228 #define CPLXDEPHASH_TST(elements, p) (elements[(p) & 255] && (elements[(p) & 255] & (1 << ((p) >> 8 & 31))))
231 check_complex_dep(Solver *solv, Id dep, Map *m, Queue **cqp)
233 Pool *pool = solv->pool;
240 printf("check_complex_dep %s\n", pool_dep2str(pool, dep));
242 i = pool_normalize_complex_dep(pool, dep, &q, CPLXDEPS_EXPAND);
243 if (i == 0 || i == 1)
249 for (i = 0; i < qcnt; i++)
251 /* we rely on the fact that blocks are ordered here.
252 * if we reach a positive element, we know that we
253 * saw all negative ones */
254 for (; (p = q.elements[i]) < 0; i++)
256 if (solv->decisionmap[-p] < 0)
258 if (solv->decisionmap[-p] == 0)
259 queue_push(&q, -p); /* undecided negative literal */
264 printf("complex dep block cannot be true or no pos literals\n");
266 while (q.elements[i])
269 queue_truncate(&q, qcnt);
274 /* all negative literals installed, add positive literals to map */
275 for (; (p = q.elements[i]) != 0; i++)
280 /* at least one undecided negative literal, postpone */
284 printf("add new complex dep block\n");
285 for (j = qcnt; j < q.count; j++)
286 printf(" - %s\n", pool_solvid2str(pool, q.elements[j]));
288 while (q.elements[i])
292 cq = solv_calloc(1, sizeof(Queue));
294 queue_insertn(cq, 0, 256, 0); /* allocate hash area */
297 for (j = qcnt; j < q.count; j++)
300 /* check if we already have this (dep, p) entry */
301 for (k = 256; k < cq->count; k += 2)
302 if (cq->elements[k + 1] == dep && cq->elements[k] == p)
306 /* a new one. add to cq and hash */
307 queue_push2(cq, p, dep);
308 CPLXDEPHASH_SET(cq->elements, p);
311 queue_truncate(&q, qcnt);
318 recheck_complex_deps(Solver *solv, Id p, Map *m, Queue **cqp)
324 printf("recheck_complex_deps for package %s\n", pool_solvid2str(solv->pool, p));
326 /* make sure that we don't have a false hit */
327 for (i = 256; i < cq->count; i += 2)
328 if (cq->elements[i] == p)
331 return; /* false alert */
332 if (solv->decisionmap[p] <= 0)
333 return; /* just in case... */
335 /* rebuild the hash, call check_complex_dep for our package */
336 CPLXDEPHASH_EMPTY(cq->elements);
337 for (i = 256; i < cq->count; i += 2)
338 if ((pp = cq->elements[i]) == p)
340 Id dep = cq->elements[i + 1];
341 queue_deleten(cq, i, 2);
343 check_complex_dep(solv, dep, m, &cq);
346 CPLXDEPHASH_SET(cq->elements, pp);
353 policy_update_recommendsmap(Solver *solv)
355 Pool *pool = solv->pool;
357 Id p, pp, rec, *recp, sug, *sugp;
359 if (solv->recommends_index < 0)
361 MAPZERO(&solv->recommendsmap);
362 MAPZERO(&solv->suggestsmap);
363 #ifdef ENABLE_COMPLEX_DEPS
364 if (solv->recommendscplxq)
366 queue_free(solv->recommendscplxq);
367 solv->recommendscplxq = solv_free(solv->recommendscplxq);
369 if (solv->suggestscplxq)
371 queue_free(solv->suggestscplxq);
372 solv->suggestscplxq = solv_free(solv->suggestscplxq);
375 solv->recommends_index = 0;
377 while (solv->recommends_index < solv->decisionq.count)
379 p = solv->decisionq.elements[solv->recommends_index++];
382 s = pool->solvables + p;
383 #ifdef ENABLE_COMPLEX_DEPS
384 /* re-check postponed complex blocks */
385 if (solv->recommendscplxq && CPLXDEPHASH_TST(solv->recommendscplxq->elements, p))
386 recheck_complex_deps(solv, p, &solv->recommendsmap, &solv->recommendscplxq);
387 if (solv->suggestscplxq && CPLXDEPHASH_TST(solv->suggestscplxq->elements, p))
388 recheck_complex_deps(solv, p, &solv->suggestsmap, &solv->suggestscplxq);
392 recp = s->repo->idarraydata + s->recommends;
393 while ((rec = *recp++) != 0)
395 #ifdef ENABLE_COMPLEX_DEPS
396 if (pool_is_complex_dep(pool, rec))
398 check_complex_dep(solv, rec, &solv->recommendsmap, &solv->recommendscplxq);
402 FOR_PROVIDES(p, pp, rec)
403 MAPSET(&solv->recommendsmap, p);
408 sugp = s->repo->idarraydata + s->suggests;
409 while ((sug = *sugp++) != 0)
411 #ifdef ENABLE_COMPLEX_DEPS
412 if (pool_is_complex_dep(pool, sug))
414 check_complex_dep(solv, sug, &solv->suggestsmap, &solv->suggestscplxq);
418 FOR_PROVIDES(p, pp, sug)
419 MAPSET(&solv->suggestsmap, p);
425 /* bring suggested/enhanced packages to front
426 * installed packages count as suggested */
428 prefer_suggested(Solver *solv, Queue *plist)
430 Pool *pool = solv->pool;
433 /* update our recommendsmap/suggestsmap */
434 if (solv->recommends_index < solv->decisionq.count)
435 policy_update_recommendsmap(solv);
437 for (i = 0, count = plist->count; i < count; i++)
439 Id p = plist->elements[i];
440 Solvable *s = pool->solvables + p;
441 if ((pool->installed && s->repo == pool->installed) ||
442 MAPTST(&solv->suggestsmap, p) ||
443 solver_is_enhancing(solv, s))
444 continue; /* good package */
446 if (i < plist->count - 1)
448 memmove(plist->elements + i, plist->elements + i + 1, (plist->count - 1 - i) * sizeof(Id));
449 plist->elements[plist->count - 1] = p;
457 * prune to recommended/suggested packages.
458 * does not prune installed packages (they are also somewhat recommended).
461 prune_to_recommended(Solver *solv, Queue *plist)
463 Pool *pool = solv->pool;
471 for (i = 0; i < plist->count; i++)
473 p = plist->elements[i];
474 s = pool->solvables + p;
475 if (pool->installed && s->repo == pool->installed)
479 if (plist->count - ninst < 2)
482 /* update our recommendsmap/suggestsmap */
483 if (solv->recommends_index < solv->decisionq.count)
484 policy_update_recommendsmap(solv);
486 /* prune to recommended/supplemented */
488 for (i = j = 0; i < plist->count; i++)
490 p = plist->elements[i];
491 s = pool->solvables + p;
492 if (pool->installed && s->repo == pool->installed)
496 plist->elements[j++] = p;
499 if (!MAPTST(&solv->recommendsmap, p))
500 if (!solver_is_supplementing(solv, s))
504 for (k = 0; j < ninst; k++)
506 s = pool->solvables + plist->elements[k];
507 if (pool->installed && s->repo == pool->installed)
508 plist->elements[j++] = plist->elements[k];
511 plist->elements[j++] = p;
517 /* anything left to prune? */
518 if (plist->count - ninst < 2)
521 /* prune to suggested/enhanced */
523 for (i = j = 0; i < plist->count; i++)
525 p = plist->elements[i];
526 s = pool->solvables + p;
527 if (pool->installed && s->repo == pool->installed)
531 plist->elements[j++] = p;
534 if (!MAPTST(&solv->suggestsmap, p))
535 if (!solver_is_enhancing(solv, s))
539 for (k = 0; j < ninst; k++)
541 s = pool->solvables + plist->elements[k];
542 if (pool->installed && s->repo == pool->installed)
543 plist->elements[j++] = plist->elements[k];
546 plist->elements[j++] = p;
554 prune_to_best_arch(const Pool *pool, Queue *plist)
560 if (!pool->id2arch || plist->count < 2)
563 for (i = 0; i < plist->count; i++)
565 s = pool->solvables + plist->elements[i];
567 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
568 if (a && a != 1 && (!bestscore || a < bestscore))
573 for (i = j = 0; i < plist->count; i++)
575 s = pool->solvables + plist->elements[i];
577 if (a > pool->lastarch)
579 a = pool->id2arch[a];
580 /* a == 1 -> noarch */
581 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
583 plist->elements[j++] = plist->elements[i];
600 /* This is Tarjan's SCC algorithm, slightly modified */
602 trj_visit(struct trj_data *trj, Id node)
605 Pool *pool = trj->pool;
606 Queue *plist = trj->plist;
607 Id myidx, stackstart;
610 Id p, pp, obs, *obsp;
612 low[node] = myidx = trj->idx++;
613 trj->stack[(stackstart = trj->nstack++)] = node;
615 s = pool->solvables + plist->elements[node];
618 obsp = s->repo->idarraydata + s->obsoletes;
619 while ((obs = *obsp++) != 0)
621 FOR_PROVIDES(p, pp, obs)
623 Solvable *ps = pool->solvables + p;
624 if (ps->name == s->name)
626 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
628 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
630 /* hmm, expensive. should use hash if plist is big */
631 for (i = 0; i < plist->count; i++)
633 if (node != i && plist->elements[i] == p)
650 if (l < trj->firstidx)
653 /* this means we have reached an old SCC found earlier.
654 * delete it as we obsolete it */
657 if (low[trj->stack[k]] == l)
658 low[trj->stack[k]] = -1;
663 else if (l < low[node])
670 if (low[node] == myidx) /* found a SCC? */
672 /* we're only interested in SCCs that contain the first node,
673 * as all others are "obsoleted" */
674 if (myidx != trj->firstidx)
676 for (i = stackstart; i < trj->nstack; i++)
677 low[trj->stack[i]] = myidx;
678 trj->nstack = stackstart; /* empty stack */
683 * remove entries from plist that are obsoleted by other entries
684 * with different name.
687 prune_obsoleted(Pool *pool, Queue *plist)
689 Id data_buf[2 * 16], *data;
694 if (plist->count <= 16)
696 memset(data_buf, 0, sizeof(data_buf));
700 data = solv_calloc(plist->count, 2 * sizeof(Id));
705 trj.stack = data + plist->count - 1; /* -1 so we can index with idx (which starts with 1) */
706 for (i = 0; i < plist->count; i++)
710 s = pool->solvables + plist->elements[i];
713 trj.firstidx = trj.nstack = trj.idx;
718 Id myidx = trj.idx++;
720 trj.stack[myidx] = i;
723 for (i = j = 0; i < plist->count; i++)
725 plist->elements[j++] = plist->elements[i];
727 if (data != data_buf)
731 /* this is prune_obsoleted special-cased for two elements */
733 prune_obsoleted_2(Pool *pool, Queue *plist)
737 Id p, pp, obs, *obsp;
741 for (i = 0; i < 2; i++)
743 s = pool->solvables + plist->elements[i];
744 other = plist->elements[1 - i];
747 obsp = s->repo->idarraydata + s->obsoletes;
748 while ((obs = *obsp++) != 0)
750 FOR_PROVIDES(p, pp, obs)
755 ps = pool->solvables + p;
756 if (ps->name == s->name)
758 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
760 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
770 if (obmap == 0 || obmap == 3)
773 plist->elements[0] = plist->elements[1];
778 * bring those elements to the front of the queue that
779 * have a installed solvable with the same name
782 move_installed_to_front(Pool *pool, Queue *plist)
788 for (i = j = 0; i < plist->count; i++)
790 s = pool->solvables + plist->elements[i];
791 if (s->repo != pool->installed)
793 FOR_PROVIDES(p, pp, s->name)
795 Solvable *ps = pool->solvables + p;
796 if (s->name == ps->name && ps->repo == pool->installed)
803 if (s->repo == pool->installed)
807 p = plist->elements[i];
809 plist->elements[i] = plist->elements[j];
811 memmove(plist->elements + j + 1, plist->elements + j, (i - j) * sizeof(Id));
812 plist->elements[j] = p;
814 else if (j + 2 == plist->count)
815 break; /* no need to check last element if all prev ones are installed */
822 * prune_to_best_version
824 * sort list of packages (given through plist) by name and evr
825 * return result through plist
828 prune_to_best_version(Pool *pool, Queue *plist)
833 if (plist->count < 2) /* no need to prune for a single entry */
835 POOL_DEBUG(SOLV_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
837 /* sort by name first, prefer installed */
838 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
840 /* now find best 'per name' */
842 for (i = j = 0; i < plist->count; i++)
844 s = pool->solvables + plist->elements[i];
846 POOL_DEBUG(SOLV_DEBUG_POLICY, "- %s[%s]\n",
847 pool_solvable2str(pool, s),
848 (pool->installed && s->repo == pool->installed) ? "installed" : "not installed");
850 if (!best) /* if no best yet, the current is best */
856 /* name switch: finish group, re-init */
857 if (best->name != s->name) /* new name */
859 plist->elements[j++] = best - pool->solvables; /* move old best to front */
860 best = s; /* take current as new best */
863 r = best->evr != s->evr ? pool_evrcmp(pool, best->evr, s->evr, EVRCMP_COMPARE) : 0;
864 #ifdef ENABLE_LINKED_PKGS
865 if (r == 0 && has_package_link(pool, s))
866 r = pool_link_evrcmp(pool, best, s);
871 plist->elements[j++] = best - pool->solvables; /* finish last group */
874 /* we reduced the list to one package per name, now look at
875 * package obsoletes */
876 if (plist->count > 1)
878 if (plist->count == 2)
879 prune_obsoleted_2(pool, plist);
881 prune_obsoleted(pool, plist);
883 if (plist->count > 1 && pool->installed)
884 move_installed_to_front(pool, plist);
889 sort_by_name_evr_sortcmp(const void *ap, const void *bp, void *dp)
892 Id a, *aa = (Id *)ap;
893 Id b, *bb = (Id *)bp;
894 Id r = aa[1] - bb[1];
896 return r < 0 ? -1 : 1;
899 a = aa[2] < 0 ? -aa[2] : aa[2];
900 b = bb[2] < 0 ? -bb[2] : bb[2];
901 if (pool->disttype != DISTTYPE_DEB && a != b)
903 /* treat release-less versions different */
904 const char *as = pool_id2str(pool, a);
905 const char *bs = pool_id2str(pool, b);
908 if (!strchr(bs, '-'))
917 r = pool_evrcmp(pool, b, a, EVRCMP_COMPARE);
918 if (!r && (aa[2] < 0 || bb[2] < 0))
926 return r < 0 ? -1 : 1;
930 /* common end of sort_by_srcversion and sort_by_common_dep */
932 sort_by_name_evr_array(Pool *pool, Queue *plist, int count, int ent)
935 int i, j, bad, havebad;
936 Id *pp, *elements = plist->elements;
940 queue_truncate(plist, count);
943 solv_sort(elements + count * 2, ent, sizeof(Id) * 3, sort_by_name_evr_sortcmp, pool);
946 for (i = 0, pp = elements + count * 2; i < ent; i++, pp += 3)
948 if (lastname && pp[1] == lastname)
950 if (pp[0] != pp[-3] && sort_by_name_evr_sortcmp(pp - 3, pp, pool) == -1)
953 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]));
964 elements[count + pp[0]] += bad;
968 for (i = 0; i < count; i++)
969 printf("%s badness %d\n", pool_solvid2str(pool, elements[i]), elements[count + i]);
974 /* simple stable insertion sort */
976 for (i = 0; i < count; i++)
977 if (pool->solvables[elements[i]].repo == pool->installed)
978 elements[i + count] = 0;
979 for (i = 1; i < count; i++)
980 for (j = i, pp = elements + count + j; j > 0; j--, pp--)
983 Id *pp2 = pp - count;
994 queue_truncate(plist, count);
999 sort_by_srcversion(Pool *pool, Queue *plist)
1001 int i, count = plist->count, ent = 0;
1002 queue_insertn(plist, count, count, 0);
1003 for (i = 0; i < count; i++)
1005 Id name, evr, p = plist->elements[i];
1006 Solvable *s = pool->solvables + p;
1007 if (solvable_lookup_void(s, SOLVABLE_SOURCENAME))
1010 name = solvable_lookup_id(s, SOLVABLE_SOURCENAME);
1011 if (solvable_lookup_void(s, SOLVABLE_SOURCEEVR))
1014 evr = solvable_lookup_id(s, SOLVABLE_SOURCEEVR);
1015 if (!name || !evr || ISRELDEP(evr))
1017 queue_push(plist, i);
1018 queue_push2(plist, name, evr);
1021 sort_by_name_evr_array(pool, plist, count, ent);
1026 sort_by_common_dep(Pool *pool, Queue *plist)
1028 int i, count = plist->count, ent = 0;
1030 queue_insertn(plist, count, count, 0);
1031 for (i = 0; i < count; i++)
1033 Id p = plist->elements[i];
1034 Solvable *s = pool->solvables + p;
1037 for (dp = s->repo->idarraydata + s->provides; (id = *dp++) != 0; )
1042 rd = GETRELDEP(pool, id);
1043 if ((rd->flags == REL_EQ || rd->flags == (REL_EQ | REL_LT) || rd->flags == REL_LT) && !ISRELDEP(rd->evr))
1045 if (rd->flags == REL_EQ)
1048 const char *s = pool_id2str(pool, rd->evr);
1051 while ((*s >= 'a' && *s <= 'f') || (*s >= '0' && *s <= '9'))
1057 queue_push(plist, i);
1058 queue_push2(plist, rd->name, rd->flags == REL_LT ? -rd->evr : rd->evr);
1063 sort_by_name_evr_array(pool, plist, count, ent);
1066 /* check if we have an update candidate */
1068 dislike_old_versions(Pool *pool, Queue *plist)
1072 for (i = 0, count = plist->count; i < count; i++)
1074 Id p = plist->elements[i];
1075 Solvable *s = pool->solvables + p;
1076 Repo *repo = s->repo;
1080 if (!repo || repo == pool->installed)
1082 FOR_PROVIDES(q, qq, s->name)
1084 Solvable *qs = pool->solvables + q;
1087 if (s->name != qs->name || s->arch != qs->arch)
1089 if (repo->priority != qs->repo->priority)
1091 if (repo->priority > qs->repo->priority)
1096 if (pool_evrcmp(pool, qs->evr, s->evr, EVRCMP_COMPARE) > 0)
1105 if (i < plist->count - 1)
1107 memmove(plist->elements + i, plist->elements + i + 1, (plist->count - 1 - i) * sizeof(Id));
1108 plist->elements[plist->count - 1] = p;
1116 * POLICY_MODE_CHOOSE: default, do all pruning steps
1117 * POLICY_MODE_RECOMMEND: leave out prune_to_recommended
1118 * POLICY_MODE_SUGGEST: leave out prune_to_recommended, do prio pruning just per name
1121 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
1123 Pool *pool = solv->pool;
1124 if (plist->count > 1)
1126 if (mode != POLICY_MODE_SUGGEST)
1127 solver_prune_to_highest_prio(solv, plist);
1129 solver_prune_to_highest_prio_per_name(solv, plist);
1131 if (plist->count > 1)
1132 prune_to_best_arch(pool, plist);
1133 if (plist->count > 1)
1134 prune_to_best_version(pool, plist);
1135 if (plist->count > 1 && (mode == POLICY_MODE_CHOOSE || mode == POLICY_MODE_CHOOSE_NOREORDER))
1137 prune_to_recommended(solv, plist);
1138 if (plist->count > 1 && mode != POLICY_MODE_CHOOSE_NOREORDER)
1140 /* do some fancy reordering */
1142 sort_by_srcversion(pool, plist);
1144 dislike_old_versions(pool, plist);
1145 sort_by_common_dep(pool, plist);
1146 prefer_suggested(solv, plist);
1152 /* check if there is an illegal architecture change if
1153 * installed solvable s1 is replaced by s2 */
1155 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
1157 Pool *pool = solv->pool;
1158 Id a1 = s1->arch, a2 = s2->arch;
1160 /* we allow changes to/from noarch */
1161 if (a1 == a2 || a1 == pool->noarchid || a2 == pool->noarchid)
1165 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
1166 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
1167 if (((a1 ^ a2) & 0xffff0000) != 0)
1172 /* check if there is an illegal vendor change if
1173 * installed solvable s1 is replaced by s2 */
1175 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
1177 Pool *pool = solv->pool;
1179 Id vendormask1, vendormask2;
1181 if (pool->custom_vendorcheck)
1182 return pool->custom_vendorcheck(pool, s1, s2);
1184 /* treat a missing vendor as empty string */
1185 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
1186 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
1189 vendormask1 = pool_vendor2mask(pool, v1);
1191 return 1; /* can't match */
1192 vendormask2 = pool_vendor2mask(pool, v2);
1193 if ((vendormask1 & vendormask2) != 0)
1195 return 1; /* no class matches */
1198 /* check if it is illegal to replace installed
1199 * package "is" with package "s" (which must obsolete "is")
1202 policy_is_illegal(Solver *solv, Solvable *is, Solvable *s, int ignore)
1204 Pool *pool = solv->pool;
1206 int duppkg = solv->dupmap_all ? 1 : 0;
1207 if (!(ignore & POLICY_ILLEGAL_DOWNGRADE) && !(duppkg ? solv->dup_allowdowngrade : solv->allowdowngrade))
1209 if (is->name == s->name && pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE) > 0)
1210 ret |= POLICY_ILLEGAL_DOWNGRADE;
1212 if (!(ignore & POLICY_ILLEGAL_ARCHCHANGE) && !(duppkg ? solv->dup_allowarchchange : solv->allowarchchange))
1214 if (is->arch != s->arch && policy_illegal_archchange(solv, is, s))
1215 ret |= POLICY_ILLEGAL_ARCHCHANGE;
1217 if (!(ignore & POLICY_ILLEGAL_VENDORCHANGE) && !(duppkg ? solv->dup_allowvendorchange : solv->allowvendorchange))
1219 if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, is, s))
1220 ret |= POLICY_ILLEGAL_VENDORCHANGE;
1222 if (!(ignore & POLICY_ILLEGAL_NAMECHANGE) && !(duppkg ? solv->dup_allownamechange : solv->allownamechange))
1224 if (is->name != s->name)
1225 ret |= POLICY_ILLEGAL_NAMECHANGE;
1230 /*-------------------------------------------------------------------
1232 * create reverse obsoletes map for installed solvables
1234 * For each installed solvable find which packages with *different* names
1235 * obsolete the solvable.
1236 * This index is used in policy_findupdatepackages() below.
1239 policy_create_obsolete_index(Solver *solv)
1241 Pool *pool = solv->pool;
1243 Repo *installed = solv->installed;
1244 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
1247 solv->obsoletes = solv_free(solv->obsoletes);
1248 solv->obsoletes_data = solv_free(solv->obsoletes_data);
1249 if (!installed || installed->start == installed->end)
1251 cnt = installed->end - installed->start;
1252 solv->obsoletes = obsoletes = solv_calloc(cnt, sizeof(Id));
1253 for (i = 1; i < pool->nsolvables; i++)
1255 s = pool->solvables + i;
1258 if (!pool_installable(pool, s))
1260 obsp = s->repo->idarraydata + s->obsoletes;
1261 while ((obs = *obsp++) != 0)
1263 FOR_PROVIDES(p, pp, obs)
1265 Solvable *ps = pool->solvables + p;;
1266 if (ps->repo != installed)
1268 if (ps->name == s->name)
1270 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1272 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1274 obsoletes[p - installed->start]++;
1279 for (i = 0; i < cnt; i++)
1282 n += obsoletes[i] + 1;
1285 solv->obsoletes_data = obsoletes_data = solv_calloc(n + 1, sizeof(Id));
1286 POOL_DEBUG(SOLV_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
1287 for (i = pool->nsolvables - 1; i > 0; i--)
1289 s = pool->solvables + i;
1292 if (!pool_installable(pool, s))
1294 obsp = s->repo->idarraydata + s->obsoletes;
1295 while ((obs = *obsp++) != 0)
1297 FOR_PROVIDES(p, pp, obs)
1299 Solvable *ps = pool->solvables + p;;
1300 if (ps->repo != installed)
1302 if (ps->name == s->name)
1304 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1306 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1308 if (obsoletes_data[obsoletes[p - installed->start]] != i)
1309 obsoletes_data[--obsoletes[p - installed->start]] = i;
1317 * find update candidates
1319 * s: installed solvable to be updated
1320 * qs: [out] queue to hold Ids of candidates
1321 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
1326 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
1328 /* installed packages get a special upgrade allowed rule */
1329 Pool *pool = solv->pool;
1330 Id p, pp, n, p2, pp2;
1333 int haveprovobs = 0;
1334 int allowdowngrade = allow_all ? 1 : solv->allowdowngrade;
1335 int allownamechange = allow_all ? 1 : solv->allownamechange;
1336 int allowarchchange = allow_all ? 1 : solv->allowarchchange;
1337 int allowvendorchange = allow_all ? 1 : solv->allowvendorchange;
1340 allowdowngrade = solv->dup_allowdowngrade;
1341 allownamechange = solv->dup_allownamechange;
1342 allowarchchange = solv->dup_allowarchchange;
1343 allowvendorchange = solv->dup_allowvendorchange;
1348 n = s - pool->solvables;
1351 * look for updates for s
1353 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
1355 if (p == n) /* skip itself */
1358 ps = pool->solvables + p;
1359 if (s->name == ps->name) /* name match */
1361 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1363 if (!allowdowngrade && pool_evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
1366 else if (!allownamechange)
1368 else if ((!solv->noupdateprovide || solv->needupdateprovide) && ps->obsoletes) /* provides/obsoletes combination ? */
1370 /* check if package ps obsoletes installed package s */
1371 /* implicitobsoleteusescolors is somewhat wrong here, but we nevertheless
1372 * use it to limit our update candidates */
1373 if ((pool->obsoleteusescolors || pool->implicitobsoleteusescolors) && !pool_colormatch(pool, s, ps))
1375 obsp = ps->repo->idarraydata + ps->obsoletes;
1376 while ((obs = *obsp++) != 0) /* for all obsoletes */
1378 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
1380 Solvable *ps2 = pool->solvables + p2;
1381 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps2, obs))
1383 if (p2 == n) /* match ! */
1386 if (p2) /* match! */
1389 if (!obs) /* continue if no match */
1391 /* here we have 'p' with a matching provides/obsoletes combination
1392 * thus flagging p as a valid update candidate for s
1398 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
1400 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
1404 if (!allownamechange)
1406 /* if we have found some valid candidates and noupdateprovide is not set, we're
1407 done. otherwise we fallback to all obsoletes */
1408 if (solv->needupdateprovide || (!solv->noupdateprovide && haveprovobs))
1410 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
1413 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
1415 ps = pool->solvables + p;
1416 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
1418 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
1420 /* implicitobsoleteusescolors is somewhat wrong here, but we nevertheless
1421 * use it to limit our update candidates */
1422 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1430 policy_illegal2str(Solver *solv, int illegal, Solvable *s, Solvable *rs)
1432 Pool *pool = solv->pool;
1434 if (illegal == POLICY_ILLEGAL_DOWNGRADE)
1436 str = pool_tmpjoin(pool, "downgrade of ", pool_solvable2str(pool, s), 0);
1437 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1439 if (illegal == POLICY_ILLEGAL_NAMECHANGE)
1441 str = pool_tmpjoin(pool, "name change of ", pool_solvable2str(pool, s), 0);
1442 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1444 if (illegal == POLICY_ILLEGAL_ARCHCHANGE)
1446 str = pool_tmpjoin(pool, "architecture change of ", pool_solvable2str(pool, s), 0);
1447 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1449 if (illegal == POLICY_ILLEGAL_VENDORCHANGE)
1451 str = pool_tmpjoin(pool, "vendor change from '", pool_id2str(pool, s->vendor), "' (");
1454 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to '");
1455 str = pool_tmpappend(pool, str, pool_id2str(pool, rs->vendor), "' (");
1458 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to no vendor (");
1459 return pool_tmpappend(pool, str, pool_solvable2str(pool, rs), ")");
1461 return "unknown illegal change";