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 = pool_arch2score(pool, sa->arch);
61 ab = pool_arch2score(pool, sb->arch);
62 if (aa != ab && aa > 1 && ab > 1)
63 return aa < ab ? -1 : 1; /* 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->dupinvolvedmap_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->dupinvolvedmap_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)
205 name = pool->solvables[plist->elements[i]].name;
207 solver_prune_to_highest_prio(solv, &pq);
208 for (k = 0; k < pq.count; k++)
209 plist->elements[j++] = pq.elements[k];
212 queue_push(&pq, plist->elements[i]);
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_favor_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]];
463 /* bring favored packages to front and disfavored packages to back */
465 policy_prefer_favored(Solver *solv, Queue *plist)
467 if (solv->favormap && plist->count > 1)
468 solv_sort(plist->elements, plist->count, sizeof(Id), sort_by_favor_cmp, solv->favormap);
472 * prune to recommended/suggested packages.
473 * does not prune installed packages (they are also somewhat recommended).
476 prune_to_recommended(Solver *solv, Queue *plist)
478 Pool *pool = solv->pool;
486 for (i = 0; i < plist->count; i++)
488 p = plist->elements[i];
489 s = pool->solvables + p;
490 if (pool->installed && s->repo == pool->installed)
494 if (plist->count - ninst < 2)
497 /* update our recommendsmap/suggestsmap */
498 if (solv->recommends_index < solv->decisionq.count)
499 policy_update_recommendsmap(solv);
501 /* prune to recommended/supplemented */
503 for (i = j = 0; i < plist->count; i++)
505 p = plist->elements[i];
506 s = pool->solvables + p;
507 if (pool->installed && s->repo == pool->installed)
511 plist->elements[j++] = p;
514 if (!MAPTST(&solv->recommendsmap, p))
515 if (!solver_is_supplementing(solv, s))
519 for (k = 0; j < ninst; k++)
521 s = pool->solvables + plist->elements[k];
522 if (pool->installed && s->repo == pool->installed)
523 plist->elements[j++] = plist->elements[k];
526 plist->elements[j++] = p;
532 /* anything left to prune? */
533 if (plist->count - ninst < 2)
536 /* prune to suggested/enhanced */
538 for (i = j = 0; i < plist->count; i++)
540 p = plist->elements[i];
541 s = pool->solvables + p;
542 if (pool->installed && s->repo == pool->installed)
546 plist->elements[j++] = p;
549 if (!MAPTST(&solv->suggestsmap, p))
550 if (!solver_is_enhancing(solv, s))
554 for (k = 0; j < ninst; k++)
556 s = pool->solvables + plist->elements[k];
557 if (pool->installed && s->repo == pool->installed)
558 plist->elements[j++] = plist->elements[k];
561 plist->elements[j++] = p;
569 prune_to_best_arch(const Pool *pool, Queue *plist)
575 if (!pool->id2arch || plist->count < 2)
578 for (i = 0; i < plist->count; i++)
580 s = pool->solvables + plist->elements[i];
581 a = pool_arch2score(pool, s->arch);
582 if (a && a != 1 && (!bestscore || a < bestscore))
587 for (i = j = 0; i < plist->count; i++)
589 s = pool->solvables + plist->elements[i];
590 a = pool_arch2score(pool, s->arch);
593 /* a == 1 -> noarch */
594 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
596 plist->elements[j++] = plist->elements[i];
613 /* This is Tarjan's SCC algorithm, slightly modified */
615 trj_visit(struct trj_data *trj, Id node)
618 Pool *pool = trj->pool;
619 Queue *plist = trj->plist;
620 Id myidx, stackstart;
623 Id p, pp, obs, *obsp;
625 low[node] = myidx = trj->idx++;
626 trj->stack[(stackstart = trj->nstack++)] = node;
628 s = pool->solvables + plist->elements[node];
631 obsp = s->repo->idarraydata + s->obsoletes;
632 while ((obs = *obsp++) != 0)
634 FOR_PROVIDES(p, pp, obs)
636 Solvable *ps = pool->solvables + p;
637 if (ps->name == s->name)
639 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
641 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
643 /* hmm, expensive. should use hash if plist is big */
644 for (i = 0; i < plist->count; i++)
646 if (node != i && plist->elements[i] == p)
663 if (l < trj->firstidx)
666 /* this means we have reached an old SCC found earlier.
667 * delete it as we obsolete it */
670 if (low[trj->stack[k]] == l)
671 low[trj->stack[k]] = -1;
676 else if (l < low[node])
683 if (low[node] == myidx) /* found a SCC? */
685 /* we're only interested in SCCs that contain the first node,
686 * as all others are "obsoleted" */
687 if (myidx != trj->firstidx)
689 for (i = stackstart; i < trj->nstack; i++)
690 low[trj->stack[i]] = myidx;
691 trj->nstack = stackstart; /* empty stack */
696 * remove entries from plist that are obsoleted by other entries
697 * with different name.
700 prune_obsoleted(Pool *pool, Queue *plist)
702 Id data_buf[2 * 16], *data;
707 if (plist->count <= 16)
709 memset(data_buf, 0, sizeof(data_buf));
713 data = solv_calloc(plist->count, 2 * sizeof(Id));
718 trj.stack = data + plist->count - 1; /* -1 so we can index with idx (which starts with 1) */
719 for (i = 0; i < plist->count; i++)
723 s = pool->solvables + plist->elements[i];
726 trj.firstidx = trj.nstack = trj.idx;
731 Id myidx = trj.idx++;
733 trj.stack[myidx] = i;
736 for (i = j = 0; i < plist->count; i++)
738 plist->elements[j++] = plist->elements[i];
740 if (data != data_buf)
744 /* this is prune_obsoleted special-cased for two elements */
746 prune_obsoleted_2(Pool *pool, Queue *plist)
750 Id p, pp, obs, *obsp;
754 for (i = 0; i < 2; i++)
756 s = pool->solvables + plist->elements[i];
757 other = plist->elements[1 - i];
760 obsp = s->repo->idarraydata + s->obsoletes;
761 while ((obs = *obsp++) != 0)
763 FOR_PROVIDES(p, pp, obs)
768 ps = pool->solvables + p;
769 if (ps->name == s->name)
771 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
773 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
783 if (obmap == 0 || obmap == 3)
786 plist->elements[0] = plist->elements[1];
791 * bring those elements to the front of the queue that
792 * have a installed solvable with the same name
795 move_installed_to_front(Pool *pool, Queue *plist)
801 if (!pool->installed)
803 for (i = j = 0; i < plist->count; i++)
805 s = pool->solvables + plist->elements[i];
806 if (s->repo != pool->installed)
808 FOR_PROVIDES(p, pp, s->name)
810 Solvable *ps = pool->solvables + p;
811 if (s->name == ps->name && ps->repo == pool->installed)
818 if (s->repo == pool->installed)
822 p = plist->elements[i];
824 plist->elements[i] = plist->elements[j];
826 memmove(plist->elements + j + 1, plist->elements + j, (i - j) * sizeof(Id));
827 plist->elements[j] = p;
829 else if (j + 2 == plist->count)
830 break; /* no need to check last element if all prev ones are installed */
838 pool_buildversioncmp(Pool *pool, Solvable *s1, Solvable *s2)
840 const char *bv1, *bv2;
841 unsigned int cnt1, cnt2;
842 cnt1 = solvable_lookup_count(s1, SOLVABLE_TRACK_FEATURES);
843 cnt2 = solvable_lookup_count(s2, SOLVABLE_TRACK_FEATURES);
845 return cnt1 > cnt2 ? -1 : 1;
846 bv1 = solvable_lookup_str(s1, SOLVABLE_BUILDVERSION);
847 bv2 = solvable_lookup_str(s2, SOLVABLE_BUILDVERSION);
850 return pool_evrcmp_str(pool, bv1 ? bv1 : "" , bv2 ? bv2 : "", EVRCMP_COMPARE);
854 pool_buildflavorcmp(Pool *pool, Solvable *s1, Solvable *s2)
856 const char *f1 = solvable_lookup_str(s1, SOLVABLE_BUILDFLAVOR);
857 const char *f2 = solvable_lookup_str(s2, SOLVABLE_BUILDFLAVOR);
860 return pool_evrcmp_str(pool, f1 ? f1 : "" , f2 ? f2 : "", EVRCMP_COMPARE);
865 * prune_to_best_version
867 * sort list of packages (given through plist) by name and evr
868 * return result through plist
871 prune_to_best_version(Pool *pool, Queue *plist)
876 if (plist->count < 2) /* no need to prune for a single entry */
878 POOL_DEBUG(SOLV_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
880 /* sort by name first, prefer installed */
881 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
883 /* now find best 'per name' */
885 for (i = j = 0; i < plist->count; i++)
887 s = pool->solvables + plist->elements[i];
889 POOL_DEBUG(SOLV_DEBUG_POLICY, "- %s [%d]%s\n",
890 pool_solvable2str(pool, s), plist->elements[i],
891 (pool->installed && s->repo == pool->installed) ? "I" : "");
893 if (!best) /* if no best yet, the current is best */
899 /* name switch: finish group, re-init */
900 if (best->name != s->name) /* new name */
902 plist->elements[j++] = best - pool->solvables; /* move old best to front */
903 best = s; /* take current as new best */
906 r = best->evr != s->evr ? pool_evrcmp(pool, best->evr, s->evr, EVRCMP_COMPARE) : 0;
907 #ifdef ENABLE_LINKED_PKGS
908 if (r == 0 && has_package_link(pool, s))
909 r = pool_link_evrcmp(pool, best, s);
912 if (pool->disttype == DISTTYPE_CONDA)
915 r = (best->repo ? best->repo->subpriority : 0) - (s->repo ? s->repo->subpriority : 0);
917 r = pool_buildversioncmp(pool, best, s);
919 r = pool_buildflavorcmp(pool, best, s);
925 plist->elements[j++] = best - pool->solvables; /* finish last group */
928 /* we reduced the list to one package per name, now look at
929 * package obsoletes */
930 if (plist->count > 1)
932 if (plist->count == 2)
933 prune_obsoleted_2(pool, plist);
935 prune_obsoleted(pool, plist);
941 sort_by_name_evr_sortcmp(const void *ap, const void *bp, void *dp)
944 Id a, *aa = (Id *)ap;
945 Id b, *bb = (Id *)bp;
946 Id r = aa[1] - bb[1];
948 return r < 0 ? -1 : 1;
951 a = aa[2] < 0 ? -aa[2] : aa[2];
952 b = bb[2] < 0 ? -bb[2] : bb[2];
953 r = pool_evrcmp(pool, b, a, pool->disttype != DISTTYPE_DEB ? EVRCMP_MATCH_RELEASE : EVRCMP_COMPARE);
954 if (!r && (aa[2] < 0 || bb[2] < 0))
964 /* common end of sort_by_srcversion and sort_by_common_dep */
966 sort_by_name_evr_array(Pool *pool, Queue *plist, int count, int ent)
969 int i, j, bad, havebad;
970 Id *pp, *elements = plist->elements;
974 queue_truncate(plist, count);
977 solv_sort(elements + count * 2, ent, sizeof(Id) * 3, sort_by_name_evr_sortcmp, pool);
980 for (i = 0, pp = elements + count * 2; i < ent; i++, pp += 3)
982 if (lastname && pp[1] == lastname)
984 if (pp[0] != pp[-3] && sort_by_name_evr_sortcmp(pp - 3, pp, pool) == -1)
987 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]));
998 elements[count + pp[0]] += bad;
1002 for (i = 0; i < count; i++)
1003 printf("%s badness %d\n", pool_solvid2str(pool, elements[i]), elements[count + i]);
1008 /* simple stable insertion sort */
1009 if (pool->installed)
1010 for (i = 0; i < count; i++)
1011 if (pool->solvables[elements[i]].repo == pool->installed)
1012 elements[i + count] = 0;
1013 for (i = 1; i < count; i++)
1014 for (j = i, pp = elements + count + j; j > 0; j--, pp--)
1017 Id *pp2 = pp - count;
1028 queue_truncate(plist, count);
1033 sort_by_srcversion(Pool *pool, Queue *plist)
1035 int i, count = plist->count, ent = 0;
1036 queue_insertn(plist, count, count, 0);
1037 for (i = 0; i < count; i++)
1039 Id name, evr, p = plist->elements[i];
1040 Solvable *s = pool->solvables + p;
1041 if (solvable_lookup_void(s, SOLVABLE_SOURCENAME))
1044 name = solvable_lookup_id(s, SOLVABLE_SOURCENAME);
1045 if (solvable_lookup_void(s, SOLVABLE_SOURCEEVR))
1048 evr = solvable_lookup_id(s, SOLVABLE_SOURCEEVR);
1049 if (!name || !evr || ISRELDEP(evr))
1051 queue_push(plist, i);
1052 queue_push2(plist, name, evr);
1055 sort_by_name_evr_array(pool, plist, count, ent);
1060 sort_by_common_dep(Pool *pool, Queue *plist)
1062 int i, count = plist->count, ent = 0;
1064 queue_insertn(plist, count, count, 0);
1065 for (i = 0; i < count; i++)
1067 Id p = plist->elements[i];
1068 Solvable *s = pool->solvables + p;
1071 for (dp = s->repo->idarraydata + s->provides; (id = *dp++) != 0; )
1076 rd = GETRELDEP(pool, id);
1077 if ((rd->flags == REL_EQ || rd->flags == (REL_EQ | REL_LT) || rd->flags == REL_LT) && !ISRELDEP(rd->evr))
1079 if (rd->flags == REL_EQ)
1082 const char *s = pool_id2str(pool, rd->evr);
1085 while ((*s >= 'a' && *s <= 'f') || (*s >= '0' && *s <= '9'))
1091 queue_push(plist, i);
1092 queue_push2(plist, rd->name, rd->flags == REL_LT ? -rd->evr : rd->evr);
1097 sort_by_name_evr_array(pool, plist, count, ent);
1100 /* check if we have an update candidate */
1102 dislike_old_versions(Pool *pool, Queue *plist)
1106 for (i = 0, count = plist->count; i < count; i++)
1108 Id p = plist->elements[i];
1109 Solvable *s = pool->solvables + p;
1110 Repo *repo = s->repo;
1114 if (!repo || repo == pool->installed)
1116 FOR_PROVIDES(q, qq, s->name)
1118 Solvable *qs = pool->solvables + q;
1121 if (s->name != qs->name || s->arch != qs->arch)
1123 if (repo->priority != qs->repo->priority)
1125 if (repo->priority > qs->repo->priority)
1130 if (pool_evrcmp(pool, qs->evr, s->evr, EVRCMP_COMPARE) > 0)
1139 if (i < plist->count - 1)
1141 memmove(plist->elements + i, plist->elements + i + 1, (plist->count - 1 - i) * sizeof(Id));
1142 plist->elements[plist->count - 1] = p;
1150 /* special lang package handling for urpm */
1151 /* see https://bugs.mageia.org/show_bug.cgi?id=18315 */
1154 urpm_reorder_cmp(const void *ap, const void *bp, void *dp)
1156 return ((Id *)bp)[1] - ((Id *)ap)[1];
1160 urpm_reorder(Solver *solv, Queue *plist)
1162 Pool *pool = solv->pool;
1163 int i, count = plist->count;
1164 /* add locale score to packages */
1165 queue_insertn(plist, count, count, 0);
1166 for (i = count - 1; i >= 0; i--)
1168 Solvable *s = pool->solvables + plist->elements[i];
1170 const char *sn = pool_id2str(pool, s->name);
1172 if (!strncmp(sn, "kernel-", 7))
1174 const char *devel = strstr(sn, "-devel-");
1175 if (devel && strlen(sn) < 256)
1179 memcpy(kn, sn, devel - sn);
1180 strcpy(kn + (devel - sn), devel + 6);
1181 knid = pool_str2id(pool, kn, 0);
1184 FOR_PROVIDES(p, pp, knid)
1186 if (solv->decisionmap[p] > 0)
1191 else if (pool->installed && pool->solvables[p].repo == pool->installed)
1197 else if ((sn = strstr(sn, "-kernel-")) != 0)
1200 if (strlen(sn) < 256 - 8 && *sn >= '0' && *sn <= '9' && sn[1] == '.')
1202 const char *flavor = strchr(sn, '-');
1205 const char *release = strchr(flavor + 1, '-');
1210 memcpy(kn, "kernel", 7);
1211 memcpy(kn + 6, flavor, release - flavor + 1);
1212 memcpy(kn + 6 + (release - flavor) + 1, sn, flavor - sn);
1213 strcpy(kn + 6 + (release + 1 - sn), release);
1214 knid = pool_str2id(pool, kn, 0);
1217 FOR_PROVIDES(p, pp, knid)
1219 if (solv->decisionmap[p] > 0)
1224 if (pool->installed && pool->solvables[p].repo == pool->installed)
1232 if (score == 1 && s->requires)
1236 for (idp = s->repo->idarraydata + s->requires; (id = *idp) != 0; idp++)
1238 while (ISRELDEP(id))
1240 Reldep *rd = GETRELDEP(pool, id);
1243 deps = strstr(pool_id2str(pool, id), "locales-");
1246 if (!strncmp(deps + 8, "en", 2))
1251 FOR_PROVIDES(p, pp, id)
1253 if (solv->decisionmap[p] > 0)
1258 if (pool->installed && pool->solvables[p].repo == pool->installed)
1265 plist->elements[i * 2] = plist->elements[i];
1266 plist->elements[i * 2 + 1] = score;
1268 solv_sort(plist->elements, count, sizeof(Id) * 2, urpm_reorder_cmp, pool);
1269 for (i = 0; i < count; i++)
1270 plist->elements[i] = plist->elements[2 * i];
1271 queue_truncate(plist, count);
1274 /* support multiple favor groups by calling policy_filter_unwanted on
1275 * each of them and combining the result */
1277 policy_filter_unwanted_favored(Solver *solv, Queue *plist, int mode)
1281 queue_init_clone(&qin, plist);
1283 /* sort by favor group */
1284 solv_sort(qin.elements, qin.count, sizeof(Id), sort_by_favor_cmp, solv->favormap);
1285 /* go over groups */
1286 queue_init(&qprune);
1287 for (i = 0; i < qin.count; i = j)
1289 /* find end of group */
1290 f = solv->favormap[qin.elements[i]];
1291 for (j = i + 1; j < qin.count; j++)
1292 if (solv->favormap[qin.elements[j]] != f)
1294 /* prune this group */
1295 queue_empty(&qprune);
1296 queue_insertn(&qprune, 0, j, qin.elements);
1297 policy_filter_unwanted(solv, &qprune, mode | POLICY_MODE_FAVOR_REC);
1298 for (i = 0; i < qprune.count; i++)
1299 if (solv->favormap[qprune.elements[i]] == f)
1300 queue_push(plist, qprune.elements[i]);
1302 queue_free(&qprune);
1307 * POLICY_MODE_CHOOSE: default, do all pruning steps
1308 * POLICY_MODE_RECOMMEND: leave out prune_to_recommended
1309 * POLICY_MODE_SUGGEST: leave out prune_to_recommended, do prio pruning just per name
1312 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
1314 Pool *pool = solv->pool;
1315 if (mode == POLICY_MODE_SUPPLEMENT)
1318 dislike_old_versions(pool, plist);
1319 sort_by_common_dep(pool, plist);
1320 if (solv->urpmreorder)
1321 urpm_reorder(solv, plist);
1322 prefer_suggested(solv, plist);
1323 policy_prefer_favored(solv, plist);
1326 if (mode & POLICY_MODE_FAVOR_REC)
1327 mode ^= POLICY_MODE_FAVOR_REC;
1328 else if (solv->favormap && plist->count > 1)
1330 /* check if we have multiple favor groups */
1331 int i, f = solv->favormap[plist->elements[0]];
1332 for (i = 1; i < plist->count; i++)
1333 if (solv->favormap[plist->elements[i]] != f)
1335 if (i < plist->count)
1337 policy_filter_unwanted_favored(solv, plist, mode);
1341 if (plist->count > 1)
1343 if (mode != POLICY_MODE_SUGGEST)
1344 solver_prune_to_highest_prio(solv, plist);
1346 solver_prune_to_highest_prio_per_name(solv, plist);
1348 if (plist->count > 1)
1349 prune_to_best_arch(pool, plist);
1350 if (plist->count > 1)
1351 prune_to_best_version(pool, plist);
1352 if (plist->count > 1 && (mode == POLICY_MODE_CHOOSE || mode == POLICY_MODE_CHOOSE_NOREORDER))
1354 prune_to_recommended(solv, plist);
1355 if (plist->count > 1 && mode != POLICY_MODE_CHOOSE_NOREORDER)
1357 /* do some fancy reordering */
1359 sort_by_srcversion(pool, plist);
1361 dislike_old_versions(pool, plist);
1362 sort_by_common_dep(pool, plist);
1363 move_installed_to_front(pool, plist);
1364 if (solv->urpmreorder)
1365 urpm_reorder(solv, plist);
1366 prefer_suggested(solv, plist);
1367 policy_prefer_favored(solv, plist);
1373 pool_best_solvables(Pool *pool, Queue *plist, int flags)
1375 if (plist->count > 1)
1376 prune_to_highest_prio(pool, plist);
1377 if (plist->count > 1)
1378 prune_to_best_arch(pool, plist);
1379 if (plist->count > 1)
1380 prune_to_best_version(pool, plist);
1381 if (plist->count > 1)
1383 dislike_old_versions(pool, plist);
1384 sort_by_common_dep(pool, plist);
1385 move_installed_to_front(pool, plist);
1390 /* check if there is an illegal architecture change if
1391 * installed solvable s1 is replaced by s2 */
1393 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
1395 Pool *pool = solv->pool;
1396 Id a1 = s1->arch, a2 = s2->arch;
1398 /* we allow changes to/from noarch */
1399 if (a1 == a2 || a1 == pool->noarchid || a2 == pool->noarchid)
1403 a1 = pool_arch2score(pool, a1);
1404 a2 = pool_arch2score(pool, a2);
1405 if (((a1 ^ a2) & 0xffff0000) != 0)
1410 /* check if there is an illegal vendor change if
1411 * installed solvable s1 is replaced by s2 */
1413 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
1415 Pool *pool = solv->pool;
1417 Id vendormask1, vendormask2;
1419 if (pool->custom_vendorcheck)
1420 return pool->custom_vendorcheck(pool, s1, s2);
1422 /* treat a missing vendor as empty string */
1423 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
1424 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
1427 vendormask1 = pool_vendor2mask(pool, v1);
1429 return 1; /* can't match */
1430 vendormask2 = pool_vendor2mask(pool, v2);
1431 if ((vendormask1 & vendormask2) != 0)
1433 return 1; /* no class matches */
1436 /* check if it is illegal to replace installed
1437 * package "is" with package "s" (which must obsolete "is")
1440 policy_is_illegal(Solver *solv, Solvable *is, Solvable *s, int ignore)
1442 Pool *pool = solv->pool;
1444 int duppkg = solv->dupinvolvedmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, is - pool->solvables));
1445 if (!(ignore & POLICY_ILLEGAL_DOWNGRADE) && !(duppkg ? solv->dup_allowdowngrade : solv->allowdowngrade))
1447 if (is->name == s->name && pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE) > 0)
1448 ret |= POLICY_ILLEGAL_DOWNGRADE;
1450 if (!(ignore & POLICY_ILLEGAL_ARCHCHANGE) && !(duppkg ? solv->dup_allowarchchange : solv->allowarchchange))
1452 if (is->arch != s->arch && policy_illegal_archchange(solv, is, s))
1453 ret |= POLICY_ILLEGAL_ARCHCHANGE;
1455 if (!(ignore & POLICY_ILLEGAL_VENDORCHANGE) && !(duppkg ? solv->dup_allowvendorchange : solv->allowvendorchange))
1457 if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, is, s))
1458 ret |= POLICY_ILLEGAL_VENDORCHANGE;
1460 if (!(ignore & POLICY_ILLEGAL_NAMECHANGE) && !(duppkg ? solv->dup_allownamechange : solv->allownamechange))
1462 if (is->name != s->name)
1463 ret |= POLICY_ILLEGAL_NAMECHANGE;
1468 /*-------------------------------------------------------------------
1470 * create reverse obsoletes map for installed solvables
1472 * For each installed solvable find which packages with *different* names
1473 * obsolete the solvable.
1474 * This index is used in policy_findupdatepackages() below.
1477 policy_create_obsolete_index(Solver *solv)
1479 Pool *pool = solv->pool;
1481 Repo *installed = solv->installed;
1482 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
1485 solv->obsoletes = solv_free(solv->obsoletes);
1486 solv->obsoletes_data = solv_free(solv->obsoletes_data);
1487 if (!installed || installed->start == installed->end)
1489 cnt = installed->end - installed->start;
1490 solv->obsoletes = obsoletes = solv_calloc(cnt, sizeof(Id));
1491 for (i = 1; i < pool->nsolvables; i++)
1493 s = pool->solvables + i;
1496 if (!pool_installable(pool, s))
1498 obsp = s->repo->idarraydata + s->obsoletes;
1499 while ((obs = *obsp++) != 0)
1501 FOR_PROVIDES(p, pp, obs)
1503 Solvable *ps = pool->solvables + p;;
1504 if (ps->repo != installed)
1506 if (ps->name == s->name)
1508 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1510 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1512 obsoletes[p - installed->start]++;
1517 for (i = 0; i < cnt; i++)
1520 n += obsoletes[i] + 1;
1523 solv->obsoletes_data = obsoletes_data = solv_calloc(n + 1, sizeof(Id));
1524 POOL_DEBUG(SOLV_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
1525 for (i = pool->nsolvables - 1; i > 0; i--)
1527 s = pool->solvables + i;
1530 if (!pool_installable(pool, s))
1532 obsp = s->repo->idarraydata + s->obsoletes;
1533 while ((obs = *obsp++) != 0)
1535 FOR_PROVIDES(p, pp, obs)
1537 Solvable *ps = pool->solvables + p;;
1538 if (ps->repo != installed)
1540 if (ps->name == s->name)
1542 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1544 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1546 if (obsoletes_data[obsoletes[p - installed->start]] != i)
1547 obsoletes_data[--obsoletes[p - installed->start]] = i;
1555 * find update candidates
1557 * s: installed solvable to be updated
1558 * qs: [out] queue to hold Ids of candidates
1559 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
1564 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
1566 /* installed packages get a special upgrade allowed rule */
1567 Pool *pool = solv->pool;
1568 Id p, pp, n, p2, pp2;
1571 int haveprovobs = 0;
1572 int allowdowngrade = allow_all ? 1 : solv->allowdowngrade;
1573 int allownamechange = allow_all ? 1 : solv->allownamechange;
1574 int allowarchchange = allow_all ? 1 : solv->allowarchchange;
1575 int allowvendorchange = allow_all ? 1 : solv->allowvendorchange;
1578 allowdowngrade = solv->dup_allowdowngrade;
1579 allownamechange = solv->dup_allownamechange;
1580 allowarchchange = solv->dup_allowarchchange;
1581 allowvendorchange = solv->dup_allowvendorchange;
1586 n = s - pool->solvables;
1589 * look for updates for s
1591 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
1593 if (p == n) /* skip itself */
1596 ps = pool->solvables + p;
1597 if (pool->considered && pool->whatprovideswithdisabled && ps->repo != pool->installed && pool_disabled_solvable(pool, ps))
1599 if (s->name == ps->name) /* name match */
1601 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1603 if (!allowdowngrade && pool_evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
1606 else if (!allownamechange)
1608 else if ((!solv->noupdateprovide || solv->needupdateprovide) && ps->obsoletes) /* provides/obsoletes combination ? */
1610 /* check if package ps obsoletes installed package s */
1611 /* implicitobsoleteusescolors is somewhat wrong here, but we nevertheless
1612 * use it to limit our update candidates */
1613 if ((pool->obsoleteusescolors || pool->implicitobsoleteusescolors) && !pool_colormatch(pool, s, ps))
1615 obsp = ps->repo->idarraydata + ps->obsoletes;
1616 while ((obs = *obsp++) != 0) /* for all obsoletes */
1618 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
1620 Solvable *ps2 = pool->solvables + p2;
1621 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps2, obs))
1623 if (p2 == n) /* match ! */
1626 if (p2) /* match! */
1629 if (!obs) /* continue if no match */
1631 /* here we have 'p' with a matching provides/obsoletes combination
1632 * thus flagging p as a valid update candidate for s
1638 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
1640 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
1644 if (!allownamechange)
1646 /* if we have found some valid candidates and noupdateprovide is not set, we're
1647 done. otherwise we fallback to all obsoletes */
1648 if (solv->needupdateprovide || (!solv->noupdateprovide && haveprovobs))
1650 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
1653 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
1655 ps = pool->solvables + p;
1656 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
1658 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
1660 /* implicitobsoleteusescolors is somewhat wrong here, but we nevertheless
1661 * use it to limit our update candidates */
1662 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1670 policy_illegal2str(Solver *solv, int illegal, Solvable *s, Solvable *rs)
1672 Pool *pool = solv->pool;
1674 if (illegal == POLICY_ILLEGAL_DOWNGRADE)
1676 str = pool_tmpjoin(pool, "downgrade of ", pool_solvable2str(pool, s), 0);
1677 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1679 if (illegal == POLICY_ILLEGAL_NAMECHANGE)
1681 str = pool_tmpjoin(pool, "name change of ", pool_solvable2str(pool, s), 0);
1682 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1684 if (illegal == POLICY_ILLEGAL_ARCHCHANGE)
1686 str = pool_tmpjoin(pool, "architecture change of ", pool_solvable2str(pool, s), 0);
1687 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1689 if (illegal == POLICY_ILLEGAL_VENDORCHANGE)
1691 str = pool_tmpjoin(pool, "vendor change from '", pool_id2str(pool, s->vendor), "' (");
1694 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to '");
1695 str = pool_tmpappend(pool, str, pool_id2str(pool, rs->vendor), "' (");
1698 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to no vendor (");
1699 return pool_tmpappend(pool, str, pool_solvable2str(pool, rs), ")");
1701 return "unknown illegal change";