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 sort_by_favorq_cmp(const void *ap, const void *bp, void *dp)
459 const Id *a = ap, *b = bp, *d = dp;
460 return d[b[0]] - d[a[0]];
464 sort_by_favorq(Queue *favorq, Id *el, int cnt)
467 /* map to offsets into favorq */
468 for (i = 0; i < cnt; i++)
471 /* lookup p in sorted favorq */
472 int med = 0, low = 0;
473 int high = favorq->count / 2;
476 med = (low + high) / 2;
477 Id pp = favorq->elements[2 * med];
485 while(med && favorq->elements[2 * med - 2] == p)
487 if (favorq->elements[2 * med] == p)
492 /* sort by position */
493 solv_sort(el, cnt, sizeof(Id), sort_by_favorq_cmp, favorq->elements);
495 for (i = 0; i < cnt; i++)
497 el[i] = favorq->elements[el[i] - 1];
500 /* bring favored packages to front and disfavored packages to back */
502 policy_prefer_favored(Solver *solv, Queue *plist)
504 int i, fav, disfav, count;
505 if (!solv->favormap.size)
507 for (i = fav = disfav = 0, count = plist->count; i < count; i++)
509 Id p = plist->elements[i];
510 if (!MAPTST(&solv->favormap, p))
512 if (solv->isdisfavormap.size && MAPTST(&solv->isdisfavormap, p))
514 /* disfavored package. bring to back */
515 if (i < plist->count - 1)
517 memmove(plist->elements + i, plist->elements + i + 1, (plist->count - 1 - i) * sizeof(Id));
518 plist->elements[plist->count - 1] = p;
526 /* favored package. bring to front */
528 memmove(plist->elements + fav + 1, plist->elements + fav, (i - fav) * sizeof(Id));
529 plist->elements[fav++] = p;
532 /* if we have multiple favored/disfavored packages, sort by favorq index */
534 sort_by_favorq(solv->favorq, plist->elements, fav);
536 sort_by_favorq(solv->favorq, plist->elements + plist->count - disfav, disfav);
540 * prune to recommended/suggested packages.
541 * does not prune installed packages (they are also somewhat recommended).
544 prune_to_recommended(Solver *solv, Queue *plist)
546 Pool *pool = solv->pool;
554 for (i = 0; i < plist->count; i++)
556 p = plist->elements[i];
557 s = pool->solvables + p;
558 if (pool->installed && s->repo == pool->installed)
562 if (plist->count - ninst < 2)
565 /* update our recommendsmap/suggestsmap */
566 if (solv->recommends_index < solv->decisionq.count)
567 policy_update_recommendsmap(solv);
569 /* prune to recommended/supplemented */
571 for (i = j = 0; i < plist->count; i++)
573 p = plist->elements[i];
574 s = pool->solvables + p;
575 if (pool->installed && s->repo == pool->installed)
579 plist->elements[j++] = p;
582 if (!MAPTST(&solv->recommendsmap, p))
583 if (!solver_is_supplementing(solv, s))
587 for (k = 0; j < ninst; k++)
589 s = pool->solvables + plist->elements[k];
590 if (pool->installed && s->repo == pool->installed)
591 plist->elements[j++] = plist->elements[k];
594 plist->elements[j++] = p;
600 /* anything left to prune? */
601 if (plist->count - ninst < 2)
604 /* prune to suggested/enhanced */
606 for (i = j = 0; i < plist->count; i++)
608 p = plist->elements[i];
609 s = pool->solvables + p;
610 if (pool->installed && s->repo == pool->installed)
614 plist->elements[j++] = p;
617 if (!MAPTST(&solv->suggestsmap, p))
618 if (!solver_is_enhancing(solv, s))
622 for (k = 0; j < ninst; k++)
624 s = pool->solvables + plist->elements[k];
625 if (pool->installed && s->repo == pool->installed)
626 plist->elements[j++] = plist->elements[k];
629 plist->elements[j++] = p;
637 prune_to_best_arch(const Pool *pool, Queue *plist)
643 if (!pool->id2arch || plist->count < 2)
646 for (i = 0; i < plist->count; i++)
648 s = pool->solvables + plist->elements[i];
650 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
651 if (a && a != 1 && (!bestscore || a < bestscore))
656 for (i = j = 0; i < plist->count; i++)
658 s = pool->solvables + plist->elements[i];
660 if (a > pool->lastarch)
662 a = pool->id2arch[a];
663 /* a == 1 -> noarch */
664 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
666 plist->elements[j++] = plist->elements[i];
683 /* This is Tarjan's SCC algorithm, slightly modified */
685 trj_visit(struct trj_data *trj, Id node)
688 Pool *pool = trj->pool;
689 Queue *plist = trj->plist;
690 Id myidx, stackstart;
693 Id p, pp, obs, *obsp;
695 low[node] = myidx = trj->idx++;
696 trj->stack[(stackstart = trj->nstack++)] = node;
698 s = pool->solvables + plist->elements[node];
701 obsp = s->repo->idarraydata + s->obsoletes;
702 while ((obs = *obsp++) != 0)
704 FOR_PROVIDES(p, pp, obs)
706 Solvable *ps = pool->solvables + p;
707 if (ps->name == s->name)
709 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
711 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
713 /* hmm, expensive. should use hash if plist is big */
714 for (i = 0; i < plist->count; i++)
716 if (node != i && plist->elements[i] == p)
733 if (l < trj->firstidx)
736 /* this means we have reached an old SCC found earlier.
737 * delete it as we obsolete it */
740 if (low[trj->stack[k]] == l)
741 low[trj->stack[k]] = -1;
746 else if (l < low[node])
753 if (low[node] == myidx) /* found a SCC? */
755 /* we're only interested in SCCs that contain the first node,
756 * as all others are "obsoleted" */
757 if (myidx != trj->firstidx)
759 for (i = stackstart; i < trj->nstack; i++)
760 low[trj->stack[i]] = myidx;
761 trj->nstack = stackstart; /* empty stack */
766 * remove entries from plist that are obsoleted by other entries
767 * with different name.
770 prune_obsoleted(Pool *pool, Queue *plist)
772 Id data_buf[2 * 16], *data;
777 if (plist->count <= 16)
779 memset(data_buf, 0, sizeof(data_buf));
783 data = solv_calloc(plist->count, 2 * sizeof(Id));
788 trj.stack = data + plist->count - 1; /* -1 so we can index with idx (which starts with 1) */
789 for (i = 0; i < plist->count; i++)
793 s = pool->solvables + plist->elements[i];
796 trj.firstidx = trj.nstack = trj.idx;
801 Id myidx = trj.idx++;
803 trj.stack[myidx] = i;
806 for (i = j = 0; i < plist->count; i++)
808 plist->elements[j++] = plist->elements[i];
810 if (data != data_buf)
814 /* this is prune_obsoleted special-cased for two elements */
816 prune_obsoleted_2(Pool *pool, Queue *plist)
820 Id p, pp, obs, *obsp;
824 for (i = 0; i < 2; i++)
826 s = pool->solvables + plist->elements[i];
827 other = plist->elements[1 - i];
830 obsp = s->repo->idarraydata + s->obsoletes;
831 while ((obs = *obsp++) != 0)
833 FOR_PROVIDES(p, pp, obs)
838 ps = pool->solvables + p;
839 if (ps->name == s->name)
841 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
843 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
853 if (obmap == 0 || obmap == 3)
856 plist->elements[0] = plist->elements[1];
861 * bring those elements to the front of the queue that
862 * have a installed solvable with the same name
865 move_installed_to_front(Pool *pool, Queue *plist)
871 for (i = j = 0; i < plist->count; i++)
873 s = pool->solvables + plist->elements[i];
874 if (s->repo != pool->installed)
876 FOR_PROVIDES(p, pp, s->name)
878 Solvable *ps = pool->solvables + p;
879 if (s->name == ps->name && ps->repo == pool->installed)
886 if (s->repo == pool->installed)
890 p = plist->elements[i];
892 plist->elements[i] = plist->elements[j];
894 memmove(plist->elements + j + 1, plist->elements + j, (i - j) * sizeof(Id));
895 plist->elements[j] = p;
897 else if (j + 2 == plist->count)
898 break; /* no need to check last element if all prev ones are installed */
905 * prune_to_best_version
907 * sort list of packages (given through plist) by name and evr
908 * return result through plist
911 prune_to_best_version(Pool *pool, Queue *plist)
916 if (plist->count < 2) /* no need to prune for a single entry */
918 POOL_DEBUG(SOLV_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
920 /* sort by name first, prefer installed */
921 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
923 /* now find best 'per name' */
925 for (i = j = 0; i < plist->count; i++)
927 s = pool->solvables + plist->elements[i];
929 POOL_DEBUG(SOLV_DEBUG_POLICY, "- %s[%s]\n",
930 pool_solvable2str(pool, s),
931 (pool->installed && s->repo == pool->installed) ? "installed" : "not installed");
933 if (!best) /* if no best yet, the current is best */
939 /* name switch: finish group, re-init */
940 if (best->name != s->name) /* new name */
942 plist->elements[j++] = best - pool->solvables; /* move old best to front */
943 best = s; /* take current as new best */
946 r = best->evr != s->evr ? pool_evrcmp(pool, best->evr, s->evr, EVRCMP_COMPARE) : 0;
947 #ifdef ENABLE_LINKED_PKGS
948 if (r == 0 && has_package_link(pool, s))
949 r = pool_link_evrcmp(pool, best, s);
954 plist->elements[j++] = best - pool->solvables; /* finish last group */
957 /* we reduced the list to one package per name, now look at
958 * package obsoletes */
959 if (plist->count > 1)
961 if (plist->count == 2)
962 prune_obsoleted_2(pool, plist);
964 prune_obsoleted(pool, plist);
966 if (plist->count > 1 && pool->installed)
967 move_installed_to_front(pool, plist);
972 sort_by_name_evr_sortcmp(const void *ap, const void *bp, void *dp)
975 Id a, *aa = (Id *)ap;
976 Id b, *bb = (Id *)bp;
977 Id r = aa[1] - bb[1];
979 return r < 0 ? -1 : 1;
982 a = aa[2] < 0 ? -aa[2] : aa[2];
983 b = bb[2] < 0 ? -bb[2] : bb[2];
984 if (pool->disttype != DISTTYPE_DEB && a != b)
986 /* treat release-less versions different */
987 const char *as = pool_id2str(pool, a);
988 const char *bs = pool_id2str(pool, b);
991 if (!strchr(bs, '-'))
1000 r = pool_evrcmp(pool, b, a, EVRCMP_COMPARE);
1001 if (!r && (aa[2] < 0 || bb[2] < 0))
1009 return r < 0 ? -1 : 1;
1013 /* common end of sort_by_srcversion and sort_by_common_dep */
1015 sort_by_name_evr_array(Pool *pool, Queue *plist, int count, int ent)
1018 int i, j, bad, havebad;
1019 Id *pp, *elements = plist->elements;
1023 queue_truncate(plist, count);
1026 solv_sort(elements + count * 2, ent, sizeof(Id) * 3, sort_by_name_evr_sortcmp, pool);
1029 for (i = 0, pp = elements + count * 2; i < ent; i++, pp += 3)
1031 if (lastname && pp[1] == lastname)
1033 if (pp[0] != pp[-3] && sort_by_name_evr_sortcmp(pp - 3, pp, pool) == -1)
1036 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]));
1047 elements[count + pp[0]] += bad;
1051 for (i = 0; i < count; i++)
1052 printf("%s badness %d\n", pool_solvid2str(pool, elements[i]), elements[count + i]);
1057 /* simple stable insertion sort */
1058 if (pool->installed)
1059 for (i = 0; i < count; i++)
1060 if (pool->solvables[elements[i]].repo == pool->installed)
1061 elements[i + count] = 0;
1062 for (i = 1; i < count; i++)
1063 for (j = i, pp = elements + count + j; j > 0; j--, pp--)
1066 Id *pp2 = pp - count;
1077 queue_truncate(plist, count);
1082 sort_by_srcversion(Pool *pool, Queue *plist)
1084 int i, count = plist->count, ent = 0;
1085 queue_insertn(plist, count, count, 0);
1086 for (i = 0; i < count; i++)
1088 Id name, evr, p = plist->elements[i];
1089 Solvable *s = pool->solvables + p;
1090 if (solvable_lookup_void(s, SOLVABLE_SOURCENAME))
1093 name = solvable_lookup_id(s, SOLVABLE_SOURCENAME);
1094 if (solvable_lookup_void(s, SOLVABLE_SOURCEEVR))
1097 evr = solvable_lookup_id(s, SOLVABLE_SOURCEEVR);
1098 if (!name || !evr || ISRELDEP(evr))
1100 queue_push(plist, i);
1101 queue_push2(plist, name, evr);
1104 sort_by_name_evr_array(pool, plist, count, ent);
1109 sort_by_common_dep(Pool *pool, Queue *plist)
1111 int i, count = plist->count, ent = 0;
1113 queue_insertn(plist, count, count, 0);
1114 for (i = 0; i < count; i++)
1116 Id p = plist->elements[i];
1117 Solvable *s = pool->solvables + p;
1120 for (dp = s->repo->idarraydata + s->provides; (id = *dp++) != 0; )
1125 rd = GETRELDEP(pool, id);
1126 if ((rd->flags == REL_EQ || rd->flags == (REL_EQ | REL_LT) || rd->flags == REL_LT) && !ISRELDEP(rd->evr))
1128 if (rd->flags == REL_EQ)
1131 const char *s = pool_id2str(pool, rd->evr);
1134 while ((*s >= 'a' && *s <= 'f') || (*s >= '0' && *s <= '9'))
1140 queue_push(plist, i);
1141 queue_push2(plist, rd->name, rd->flags == REL_LT ? -rd->evr : rd->evr);
1146 sort_by_name_evr_array(pool, plist, count, ent);
1149 /* check if we have an update candidate */
1151 dislike_old_versions(Pool *pool, Queue *plist)
1155 for (i = 0, count = plist->count; i < count; i++)
1157 Id p = plist->elements[i];
1158 Solvable *s = pool->solvables + p;
1159 Repo *repo = s->repo;
1163 if (!repo || repo == pool->installed)
1165 FOR_PROVIDES(q, qq, s->name)
1167 Solvable *qs = pool->solvables + q;
1170 if (s->name != qs->name || s->arch != qs->arch)
1172 if (repo->priority != qs->repo->priority)
1174 if (repo->priority > qs->repo->priority)
1179 if (pool_evrcmp(pool, qs->evr, s->evr, EVRCMP_COMPARE) > 0)
1188 if (i < plist->count - 1)
1190 memmove(plist->elements + i, plist->elements + i + 1, (plist->count - 1 - i) * sizeof(Id));
1191 plist->elements[plist->count - 1] = p;
1199 /* special lang package handling for urpm */
1200 /* see https://bugs.mageia.org/show_bug.cgi?id=18315 */
1203 urpm_reorder_cmp(const void *ap, const void *bp, void *dp)
1205 return ((Id *)bp)[1] - ((Id *)ap)[1];
1209 urpm_reorder(Solver *solv, Queue *plist)
1211 Pool *pool = solv->pool;
1212 int i, count = plist->count;
1213 /* add locale score to packages */
1214 queue_insertn(plist, count, count, 0);
1215 for (i = count - 1; i >= 0; i--)
1217 Solvable *s = pool->solvables + plist->elements[i];
1219 const char *sn = pool_id2str(pool, s->name);
1221 if (!strncmp(sn, "kernel-", 7))
1223 const char *devel = strstr(sn, "-devel-");
1224 if (devel && strlen(sn) < 256)
1228 memcpy(kn, sn, devel - sn);
1229 strcpy(kn + (devel - sn), devel + 6);
1230 knid = pool_str2id(pool, kn, 0);
1233 FOR_PROVIDES(p, pp, knid)
1235 if (solv->decisionmap[p] > 0)
1240 else if (pool->installed && pool->solvables[p].repo == pool->installed)
1246 else if ((sn = strstr(sn, "-kernel-")) != 0)
1249 if (strlen(sn) < 256 - 8 && *sn >= '0' && *sn <= '9' && sn[1] == '.')
1251 const char *flavor = strchr(sn, '-');
1254 const char *release = strchr(flavor + 1, '-');
1259 memcpy(kn, "kernel", 8);
1260 memcpy(kn + 6, flavor, release - flavor + 1);
1261 memcpy(kn + 6 + (release - flavor) + 1, sn, flavor - sn);
1262 strcpy(kn + 6 + (release + 1 - sn), release);
1263 knid = pool_str2id(pool, kn, 0);
1266 FOR_PROVIDES(p, pp, knid)
1268 if (solv->decisionmap[p] > 0)
1273 if (pool->installed && pool->solvables[p].repo == pool->installed)
1281 if (score == 1 && s->requires)
1285 for (idp = s->repo->idarraydata + s->requires; (id = *idp) != 0; idp++)
1287 while (ISRELDEP(id))
1289 Reldep *rd = GETRELDEP(pool, id);
1292 deps = strstr(pool_id2str(pool, id), "locales-");
1295 if (!strncmp(deps + 8, "en", 2))
1300 FOR_PROVIDES(p, pp, id)
1302 if (solv->decisionmap[p] > 0)
1307 if (pool->installed && pool->solvables[p].repo == pool->installed)
1314 plist->elements[i * 2] = plist->elements[i];
1315 plist->elements[i * 2 + 1] = score;
1317 solv_sort(plist->elements, count, sizeof(Id) * 2, urpm_reorder_cmp, pool);
1318 for (i = 0; i < count; i++)
1319 plist->elements[i] = plist->elements[2 * i];
1320 queue_truncate(plist, count);
1325 * POLICY_MODE_CHOOSE: default, do all pruning steps
1326 * POLICY_MODE_RECOMMEND: leave out prune_to_recommended
1327 * POLICY_MODE_SUGGEST: leave out prune_to_recommended, do prio pruning just per name
1330 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
1332 Pool *pool = solv->pool;
1333 if (mode == POLICY_MODE_SUPPLEMENT)
1336 dislike_old_versions(pool, plist);
1337 sort_by_common_dep(pool, plist);
1338 if (solv->urpmreorder)
1339 urpm_reorder(solv, plist);
1340 prefer_suggested(solv, plist);
1341 policy_prefer_favored(solv, plist);
1344 if (plist->count > 1)
1346 if (mode != POLICY_MODE_SUGGEST)
1347 solver_prune_to_highest_prio(solv, plist);
1349 solver_prune_to_highest_prio_per_name(solv, plist);
1351 if (plist->count > 1)
1352 prune_to_best_arch(pool, plist);
1353 if (plist->count > 1)
1354 prune_to_best_version(pool, plist);
1355 if (plist->count > 1 && (mode == POLICY_MODE_CHOOSE || mode == POLICY_MODE_CHOOSE_NOREORDER))
1357 prune_to_recommended(solv, plist);
1358 if (plist->count > 1 && mode != POLICY_MODE_CHOOSE_NOREORDER)
1360 /* do some fancy reordering */
1362 sort_by_srcversion(pool, plist);
1364 dislike_old_versions(pool, plist);
1365 sort_by_common_dep(pool, plist);
1366 if (solv->urpmreorder)
1367 urpm_reorder(solv, plist);
1368 prefer_suggested(solv, plist);
1369 policy_prefer_favored(solv, plist);
1375 /* check if there is an illegal architecture change if
1376 * installed solvable s1 is replaced by s2 */
1378 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
1380 Pool *pool = solv->pool;
1381 Id a1 = s1->arch, a2 = s2->arch;
1383 /* we allow changes to/from noarch */
1384 if (a1 == a2 || a1 == pool->noarchid || a2 == pool->noarchid)
1388 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
1389 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
1390 if (((a1 ^ a2) & 0xffff0000) != 0)
1395 /* check if there is an illegal vendor change if
1396 * installed solvable s1 is replaced by s2 */
1398 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
1400 Pool *pool = solv->pool;
1402 Id vendormask1, vendormask2;
1404 if (pool->custom_vendorcheck)
1405 return pool->custom_vendorcheck(pool, s1, s2);
1407 /* treat a missing vendor as empty string */
1408 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
1409 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
1412 vendormask1 = pool_vendor2mask(pool, v1);
1414 return 1; /* can't match */
1415 vendormask2 = pool_vendor2mask(pool, v2);
1416 if ((vendormask1 & vendormask2) != 0)
1418 return 1; /* no class matches */
1421 /* check if it is illegal to replace installed
1422 * package "is" with package "s" (which must obsolete "is")
1425 policy_is_illegal(Solver *solv, Solvable *is, Solvable *s, int ignore)
1427 Pool *pool = solv->pool;
1429 int duppkg = solv->dupmap_all ? 1 : 0;
1430 if (!(ignore & POLICY_ILLEGAL_DOWNGRADE) && !(duppkg ? solv->dup_allowdowngrade : solv->allowdowngrade))
1432 if (is->name == s->name && pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE) > 0)
1433 ret |= POLICY_ILLEGAL_DOWNGRADE;
1435 if (!(ignore & POLICY_ILLEGAL_ARCHCHANGE) && !(duppkg ? solv->dup_allowarchchange : solv->allowarchchange))
1437 if (is->arch != s->arch && policy_illegal_archchange(solv, is, s))
1438 ret |= POLICY_ILLEGAL_ARCHCHANGE;
1440 if (!(ignore & POLICY_ILLEGAL_VENDORCHANGE) && !(duppkg ? solv->dup_allowvendorchange : solv->allowvendorchange))
1442 if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, is, s))
1443 ret |= POLICY_ILLEGAL_VENDORCHANGE;
1445 if (!(ignore & POLICY_ILLEGAL_NAMECHANGE) && !(duppkg ? solv->dup_allownamechange : solv->allownamechange))
1447 if (is->name != s->name)
1448 ret |= POLICY_ILLEGAL_NAMECHANGE;
1453 /*-------------------------------------------------------------------
1455 * create reverse obsoletes map for installed solvables
1457 * For each installed solvable find which packages with *different* names
1458 * obsolete the solvable.
1459 * This index is used in policy_findupdatepackages() below.
1462 policy_create_obsolete_index(Solver *solv)
1464 Pool *pool = solv->pool;
1466 Repo *installed = solv->installed;
1467 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
1470 solv->obsoletes = solv_free(solv->obsoletes);
1471 solv->obsoletes_data = solv_free(solv->obsoletes_data);
1472 if (!installed || installed->start == installed->end)
1474 cnt = installed->end - installed->start;
1475 solv->obsoletes = obsoletes = solv_calloc(cnt, sizeof(Id));
1476 for (i = 1; i < pool->nsolvables; i++)
1478 s = pool->solvables + i;
1481 if (!pool_installable(pool, s))
1483 obsp = s->repo->idarraydata + s->obsoletes;
1484 while ((obs = *obsp++) != 0)
1486 FOR_PROVIDES(p, pp, obs)
1488 Solvable *ps = pool->solvables + p;;
1489 if (ps->repo != installed)
1491 if (ps->name == s->name)
1493 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1495 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1497 obsoletes[p - installed->start]++;
1502 for (i = 0; i < cnt; i++)
1505 n += obsoletes[i] + 1;
1508 solv->obsoletes_data = obsoletes_data = solv_calloc(n + 1, sizeof(Id));
1509 POOL_DEBUG(SOLV_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
1510 for (i = pool->nsolvables - 1; i > 0; i--)
1512 s = pool->solvables + i;
1515 if (!pool_installable(pool, s))
1517 obsp = s->repo->idarraydata + s->obsoletes;
1518 while ((obs = *obsp++) != 0)
1520 FOR_PROVIDES(p, pp, obs)
1522 Solvable *ps = pool->solvables + p;;
1523 if (ps->repo != installed)
1525 if (ps->name == s->name)
1527 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1529 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1531 if (obsoletes_data[obsoletes[p - installed->start]] != i)
1532 obsoletes_data[--obsoletes[p - installed->start]] = i;
1540 * find update candidates
1542 * s: installed solvable to be updated
1543 * qs: [out] queue to hold Ids of candidates
1544 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
1549 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
1551 /* installed packages get a special upgrade allowed rule */
1552 Pool *pool = solv->pool;
1553 Id p, pp, n, p2, pp2;
1556 int haveprovobs = 0;
1557 int allowdowngrade = allow_all ? 1 : solv->allowdowngrade;
1558 int allownamechange = allow_all ? 1 : solv->allownamechange;
1559 int allowarchchange = allow_all ? 1 : solv->allowarchchange;
1560 int allowvendorchange = allow_all ? 1 : solv->allowvendorchange;
1563 allowdowngrade = solv->dup_allowdowngrade;
1564 allownamechange = solv->dup_allownamechange;
1565 allowarchchange = solv->dup_allowarchchange;
1566 allowvendorchange = solv->dup_allowvendorchange;
1571 n = s - pool->solvables;
1574 * look for updates for s
1576 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
1578 if (p == n) /* skip itself */
1581 ps = pool->solvables + p;
1582 if (s->name == ps->name) /* name match */
1584 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1586 if (!allowdowngrade && pool_evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
1589 else if (!allownamechange)
1591 else if ((!solv->noupdateprovide || solv->needupdateprovide) && ps->obsoletes) /* provides/obsoletes combination ? */
1593 /* check if package ps obsoletes installed package s */
1594 /* implicitobsoleteusescolors is somewhat wrong here, but we nevertheless
1595 * use it to limit our update candidates */
1596 if ((pool->obsoleteusescolors || pool->implicitobsoleteusescolors) && !pool_colormatch(pool, s, ps))
1598 obsp = ps->repo->idarraydata + ps->obsoletes;
1599 while ((obs = *obsp++) != 0) /* for all obsoletes */
1601 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
1603 Solvable *ps2 = pool->solvables + p2;
1604 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps2, obs))
1606 if (p2 == n) /* match ! */
1609 if (p2) /* match! */
1612 if (!obs) /* continue if no match */
1614 /* here we have 'p' with a matching provides/obsoletes combination
1615 * thus flagging p as a valid update candidate for s
1621 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
1623 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
1627 if (!allownamechange)
1629 /* if we have found some valid candidates and noupdateprovide is not set, we're
1630 done. otherwise we fallback to all obsoletes */
1631 if (solv->needupdateprovide || (!solv->noupdateprovide && haveprovobs))
1633 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
1636 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
1638 ps = pool->solvables + p;
1639 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
1641 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
1643 /* implicitobsoleteusescolors is somewhat wrong here, but we nevertheless
1644 * use it to limit our update candidates */
1645 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1653 policy_illegal2str(Solver *solv, int illegal, Solvable *s, Solvable *rs)
1655 Pool *pool = solv->pool;
1657 if (illegal == POLICY_ILLEGAL_DOWNGRADE)
1659 str = pool_tmpjoin(pool, "downgrade of ", pool_solvable2str(pool, s), 0);
1660 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1662 if (illegal == POLICY_ILLEGAL_NAMECHANGE)
1664 str = pool_tmpjoin(pool, "name change of ", pool_solvable2str(pool, s), 0);
1665 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1667 if (illegal == POLICY_ILLEGAL_ARCHCHANGE)
1669 str = pool_tmpjoin(pool, "architecture change of ", pool_solvable2str(pool, s), 0);
1670 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1672 if (illegal == POLICY_ILLEGAL_VENDORCHANGE)
1674 str = pool_tmpjoin(pool, "vendor change from '", pool_id2str(pool, s->vendor), "' (");
1677 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to '");
1678 str = pool_tmpappend(pool, str, pool_id2str(pool, rs->vendor), "' (");
1681 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to no vendor (");
1682 return pool_tmpappend(pool, str, pool_solvable2str(pool, rs), ")");
1684 return "unknown illegal change";