2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
9 * Generic policy interface for SAT solver
19 #include "solver_private.h"
22 #include "poolvendor.h"
27 /*-----------------------------------------------------------------*/
30 * prep for prune_best_version
35 prune_to_best_version_sortcmp(const void *ap, const void *bp, void *dp)
43 sa = pool->solvables + a;
44 sb = pool->solvables + b;
45 r = sa->name - sb->name;
49 /* different names. We use real strcmp here so that the result
50 * is not depending on some random solvable order */
51 na = pool_id2str(pool, sa->name);
52 nb = pool_id2str(pool, sb->name);
53 return strcmp(na, nb);
55 if (sa->arch != sb->arch)
58 aa = (sa->arch <= pool->lastarch) ? pool->id2arch[sa->arch] : 0;
59 ab = (sb->arch <= pool->lastarch) ? pool->id2arch[sb->arch] : 0;
60 if (aa != ab && aa > 1 && ab > 1)
61 return aa - ab; /* lowest score first */
64 /* the same name, bring installed solvables to the front */
67 if (sa->repo == pool->installed)
69 if (sb->repo != pool->installed)
72 else if (sb->repo == pool->installed)
75 /* sort by repository sub-prio (installed repo handled above) */
76 r = (sb->repo ? sb->repo->subpriority : 0) - (sa->repo ? sa->repo->subpriority : 0);
79 /* no idea about the order, sort by id */
85 * prune to repository with highest priority.
86 * does not prune installed solvables.
90 prune_to_highest_prio(Pool *pool, Queue *plist)
94 int bestprio = 0, bestprioset = 0;
96 /* prune to highest priority */
97 for (i = 0; i < plist->count; i++) /* find highest prio in queue */
99 s = pool->solvables + plist->elements[i];
100 if (pool->installed && s->repo == pool->installed)
102 if (!bestprioset || s->repo->priority > bestprio)
104 bestprio = s->repo->priority;
110 for (i = j = 0; i < plist->count; i++) /* remove all with lower prio */
112 s = pool->solvables + plist->elements[i];
113 if (s->repo->priority == bestprio || (pool->installed && s->repo == pool->installed))
114 plist->elements[j++] = plist->elements[i];
120 /* installed packages involed in a dup operation can only be kept
121 * if they are identical to a non-installed one */
123 solver_prune_installed_dup_packages(Solver *solv, Queue *plist)
125 Pool *pool = solv->pool;
126 int i, j, bestprio = 0;
128 /* find bestprio (again) */
129 for (i = 0; i < plist->count; i++)
131 Solvable *s = pool->solvables + plist->elements[i];
132 if (s->repo != pool->installed)
134 bestprio = s->repo->priority;
138 if (i == plist->count)
139 return; /* only installed packages, could not find prio */
140 for (i = j = 0; i < plist->count; i++)
142 Id p = plist->elements[i];
143 Solvable *s = pool->solvables + p;
144 if (s->repo != pool->installed && s->repo->priority < bestprio)
146 if (s->repo == pool->installed && (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))))
150 FOR_PROVIDES(p2, pp2, s->name)
152 Solvable *s2 = pool->solvables + p2;
153 if (s2->repo == pool->installed || s2->evr != s->evr || s2->repo->priority < bestprio)
155 if (!solvable_identical(s, s2))
158 if (s2->repo->priority > bestprio)
161 bestprio = s2->repo->priority;
166 continue; /* no identical package found, ignore installed package */
168 plist->elements[j++] = p;
175 * like prune_to_highest_prio, but calls solver prune_installed_dup_packages
176 * when there are dup packages
179 solver_prune_to_highest_prio(Solver *solv, Queue *plist)
181 prune_to_highest_prio(solv->pool, plist);
182 if (plist->count > 1 && solv->pool->installed && (solv->dupmap_all || solv->dupinvolvedmap.size))
183 solver_prune_installed_dup_packages(solv, plist);
188 solver_prune_to_highest_prio_per_name(Solver *solv, Queue *plist)
190 Pool *pool = solv->pool;
196 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
197 queue_push(&pq, plist->elements[0]);
198 name = pool->solvables[pq.elements[0]].name;
199 for (i = 1, j = 0; i < plist->count; i++)
201 if (pool->solvables[plist->elements[i]].name != name)
204 solver_prune_to_highest_prio(solv, &pq);
205 for (k = 0; k < pq.count; k++)
206 plist->elements[j++] = pq.elements[k];
208 queue_push(&pq, plist->elements[i]);
209 name = pool->solvables[pq.elements[0]].name;
213 solver_prune_to_highest_prio(solv, &pq);
214 for (k = 0; k < pq.count; k++)
215 plist->elements[j++] = pq.elements[k];
221 #ifdef ENABLE_COMPLEX_DEPS
224 check_complex_dep(Solver *solv, Id dep, Map *m, Queue **cqp)
226 Pool *pool = solv->pool;
233 printf("check_complex_dep %s\n", pool_dep2str(pool, dep));
235 i = pool_normalize_complex_dep(pool, dep, &q, CPLXDEPS_EXPAND);
236 if (i == 0 || i == 1)
242 for (i = 0; i < qcnt; i++)
244 for (; (p = q.elements[i]) != 0; i++)
248 if (solv->decisionmap[-p] > 0)
250 if (solv->decisionmap[-p] < 0)
254 if (p > 0 && qcnt == q.count)
260 printf("complex dep block cannot be true\n");
262 while (q.elements[i])
265 queue_truncate(&q, qcnt);
267 else if (qcnt != q.count)
272 printf("add new complex dep block\n");
273 for (j = qcnt; j < q.count; j++)
274 printf(" - %s\n", pool_solvid2str(pool, q.elements[j]));
278 cq = solv_calloc(1, sizeof(Queue));
281 queue_insertn(cq, 0, 256, 0);
283 for (j = qcnt; j < q.count; j++)
286 for (k = 256; k < cq->count; k += 2)
287 if (cq->elements[k + 1] == dep && cq->elements[k] == p)
291 queue_push2(cq, p, dep);
292 cq->elements[p & 255] |= (1 << (p >> 8 & 31));
295 queue_truncate(&q, qcnt);
302 recheck_complex_dep(Solver *solv, Id p, Map *m, Queue **cqp)
307 printf("recheck_complex_dep for package %s\n", pool_solvid2str(solv->pool, p));
309 for (i = 256; i < cq->count; i += 2)
310 if (cq->elements[i] == p)
313 return; /* false alert */
314 if (solv->decisionmap[p] <= 0)
315 return; /* just in case... */
316 memset(cq->elements, 0, sizeof(Id) * 256);
317 for (i = 256; i < cq->count; i += 2)
318 if (cq->elements[i] == p)
320 Id dep = cq->elements[i + 1];
321 queue_deleten(cq, i, 2);
323 check_complex_dep(solv, dep, m, &cq);
327 Id pp = cq->elements[i];
328 cq->elements[pp & 255] |= (1 << (pp >> 8 & 31));
336 policy_update_recommendsmap(Solver *solv)
338 Pool *pool = solv->pool;
340 Id p, pp, rec, *recp, sug, *sugp;
342 if (solv->recommends_index < 0)
344 MAPZERO(&solv->recommendsmap);
345 MAPZERO(&solv->suggestsmap);
346 #ifdef ENABLE_COMPLEX_DEPS
347 if (solv->recommendscplxq)
349 queue_free(solv->recommendscplxq);
350 solv->recommendscplxq = solv_free(solv->recommendscplxq);
352 if (solv->suggestscplxq)
354 queue_free(solv->suggestscplxq);
355 solv->suggestscplxq = solv_free(solv->suggestscplxq);
358 solv->recommends_index = 0;
360 while (solv->recommends_index < solv->decisionq.count)
362 p = solv->decisionq.elements[solv->recommends_index++];
365 s = pool->solvables + p;
366 #ifdef ENABLE_COMPLEX_DEPS
367 if (solv->recommendscplxq && solv->recommendscplxq->elements[p & 255])
368 if (solv->recommendscplxq->elements[p & 255] & (1 << (p >> 8 & 31)))
369 recheck_complex_dep(solv, p, &solv->recommendsmap, &solv->recommendscplxq);
370 if (solv->suggestscplxq && solv->suggestscplxq->elements[p & 255])
371 if (solv->suggestscplxq->elements[p & 255] & (1 << (p >> 8 & 31)))
372 recheck_complex_dep(solv, p, &solv->suggestsmap, &solv->suggestscplxq);
376 recp = s->repo->idarraydata + s->recommends;
377 while ((rec = *recp++) != 0)
379 #ifdef ENABLE_COMPLEX_DEPS
380 if (pool_is_complex_dep(pool, rec))
382 check_complex_dep(solv, rec, &solv->recommendsmap, &solv->recommendscplxq);
386 FOR_PROVIDES(p, pp, rec)
387 MAPSET(&solv->recommendsmap, p);
392 sugp = s->repo->idarraydata + s->suggests;
393 while ((sug = *sugp++) != 0)
395 #ifdef ENABLE_COMPLEX_DEPS
396 if (pool_is_complex_dep(pool, sug))
398 check_complex_dep(solv, sug, &solv->suggestsmap, &solv->suggestscplxq);
402 FOR_PROVIDES(p, pp, sug)
403 MAPSET(&solv->suggestsmap, p);
409 /* bring suggested/enhanced packages to front
410 * installed packages count as suggested */
412 prefer_suggested(Solver *solv, Queue *plist)
414 Pool *pool = solv->pool;
417 /* update our recommendsmap/suggestsmap */
418 if (solv->recommends_index < solv->decisionq.count)
419 policy_update_recommendsmap(solv);
421 for (i = 0, count = plist->count; i < count; i++)
423 Id p = plist->elements[i];
424 Solvable *s = pool->solvables + p;
425 if ((pool->installed && s->repo == pool->installed) ||
426 MAPTST(&solv->suggestsmap, p) ||
427 solver_is_enhancing(solv, s))
428 continue; /* good package */
430 if (i < plist->count - 1)
432 memmove(plist->elements + i, plist->elements + i + 1, (plist->count - 1 - i) * sizeof(Id));
433 plist->elements[plist->count - 1] = p;
441 * prune to recommended/suggested packages.
442 * does not prune installed packages (they are also somewhat recommended).
445 prune_to_recommended(Solver *solv, Queue *plist)
447 Pool *pool = solv->pool;
455 for (i = 0; i < plist->count; i++)
457 p = plist->elements[i];
458 s = pool->solvables + p;
459 if (pool->installed && s->repo == pool->installed)
463 if (plist->count - ninst < 2)
466 /* update our recommendsmap/suggestsmap */
467 if (solv->recommends_index < solv->decisionq.count)
468 policy_update_recommendsmap(solv);
470 /* prune to recommended/supplemented */
472 for (i = j = 0; i < plist->count; i++)
474 p = plist->elements[i];
475 s = pool->solvables + p;
476 if (pool->installed && s->repo == pool->installed)
480 plist->elements[j++] = p;
483 if (!MAPTST(&solv->recommendsmap, p))
484 if (!solver_is_supplementing(solv, s))
488 for (k = 0; j < ninst; k++)
490 s = pool->solvables + plist->elements[k];
491 if (pool->installed && s->repo == pool->installed)
492 plist->elements[j++] = plist->elements[k];
495 plist->elements[j++] = p;
501 /* anything left to prune? */
502 if (plist->count - ninst < 2)
505 /* prune to suggested/enhanced */
507 for (i = j = 0; i < plist->count; i++)
509 p = plist->elements[i];
510 s = pool->solvables + p;
511 if (pool->installed && s->repo == pool->installed)
515 plist->elements[j++] = p;
518 if (!MAPTST(&solv->suggestsmap, p))
519 if (!solver_is_enhancing(solv, s))
523 for (k = 0; j < ninst; k++)
525 s = pool->solvables + plist->elements[k];
526 if (pool->installed && s->repo == pool->installed)
527 plist->elements[j++] = plist->elements[k];
530 plist->elements[j++] = p;
538 prune_to_best_arch(const Pool *pool, Queue *plist)
544 if (!pool->id2arch || plist->count < 2)
547 for (i = 0; i < plist->count; i++)
549 s = pool->solvables + plist->elements[i];
551 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
552 if (a && a != 1 && (!bestscore || a < bestscore))
557 for (i = j = 0; i < plist->count; i++)
559 s = pool->solvables + plist->elements[i];
561 if (a > pool->lastarch)
563 a = pool->id2arch[a];
564 /* a == 1 -> noarch */
565 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
567 plist->elements[j++] = plist->elements[i];
584 /* This is Tarjan's SCC algorithm, slightly modified */
586 trj_visit(struct trj_data *trj, Id node)
589 Pool *pool = trj->pool;
590 Queue *plist = trj->plist;
591 Id myidx, stackstart;
594 Id p, pp, obs, *obsp;
596 low[node] = myidx = trj->idx++;
597 trj->stack[(stackstart = trj->nstack++)] = node;
599 s = pool->solvables + plist->elements[node];
602 obsp = s->repo->idarraydata + s->obsoletes;
603 while ((obs = *obsp++) != 0)
605 FOR_PROVIDES(p, pp, obs)
607 Solvable *ps = pool->solvables + p;
608 if (ps->name == s->name)
610 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
612 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
614 /* hmm, expensive. should use hash if plist is big */
615 for (i = 0; i < plist->count; i++)
617 if (node != i && plist->elements[i] == p)
634 if (l < trj->firstidx)
637 /* this means we have reached an old SCC found earlier.
638 * delete it as we obsolete it */
641 if (low[trj->stack[k]] == l)
642 low[trj->stack[k]] = -1;
647 else if (l < low[node])
654 if (low[node] == myidx) /* found a SCC? */
656 /* we're only interested in SCCs that contain the first node,
657 * as all others are "obsoleted" */
658 if (myidx != trj->firstidx)
660 for (i = stackstart; i < trj->nstack; i++)
661 low[trj->stack[i]] = myidx;
662 trj->nstack = stackstart; /* empty stack */
667 * remove entries from plist that are obsoleted by other entries
668 * with different name.
671 prune_obsoleted(Pool *pool, Queue *plist)
673 Id data_buf[2 * 16], *data;
678 if (plist->count <= 16)
680 memset(data_buf, 0, sizeof(data_buf));
684 data = solv_calloc(plist->count, 2 * sizeof(Id));
689 trj.stack = data + plist->count - 1; /* -1 so we can index with idx (which starts with 1) */
690 for (i = 0; i < plist->count; i++)
694 s = pool->solvables + plist->elements[i];
697 trj.firstidx = trj.nstack = trj.idx;
702 Id myidx = trj.idx++;
704 trj.stack[myidx] = i;
707 for (i = j = 0; i < plist->count; i++)
709 plist->elements[j++] = plist->elements[i];
711 if (data != data_buf)
715 /* this is prune_obsoleted special-cased for two elements */
717 prune_obsoleted_2(Pool *pool, Queue *plist)
721 Id p, pp, obs, *obsp;
725 for (i = 0; i < 2; i++)
727 s = pool->solvables + plist->elements[i];
728 other = plist->elements[1 - i];
731 obsp = s->repo->idarraydata + s->obsoletes;
732 while ((obs = *obsp++) != 0)
734 FOR_PROVIDES(p, pp, obs)
739 ps = pool->solvables + p;
740 if (ps->name == s->name)
742 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
744 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
754 if (obmap == 0 || obmap == 3)
757 plist->elements[0] = plist->elements[1];
762 * bring those elements to the front of the queue that
763 * have a installed solvable with the same name
766 move_installed_to_front(Pool *pool, Queue *plist)
772 for (i = j = 0; i < plist->count; i++)
774 s = pool->solvables + plist->elements[i];
775 if (s->repo != pool->installed)
777 FOR_PROVIDES(p, pp, s->name)
779 Solvable *ps = pool->solvables + p;
780 if (s->name == ps->name && ps->repo == pool->installed)
787 if (s->repo == pool->installed)
791 p = plist->elements[i];
793 plist->elements[i] = plist->elements[j];
795 memmove(plist->elements + j + 1, plist->elements + j, (i - j) * sizeof(Id));
796 plist->elements[j] = p;
798 else if (j + 2 == plist->count)
799 break; /* no need to check last element if all prev ones are installed */
806 * prune_to_best_version
808 * sort list of packages (given through plist) by name and evr
809 * return result through plist
812 prune_to_best_version(Pool *pool, Queue *plist)
817 if (plist->count < 2) /* no need to prune for a single entry */
819 POOL_DEBUG(SOLV_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
821 /* sort by name first, prefer installed */
822 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
824 /* now find best 'per name' */
826 for (i = j = 0; i < plist->count; i++)
828 s = pool->solvables + plist->elements[i];
830 POOL_DEBUG(SOLV_DEBUG_POLICY, "- %s[%s]\n",
831 pool_solvable2str(pool, s),
832 (pool->installed && s->repo == pool->installed) ? "installed" : "not installed");
834 if (!best) /* if no best yet, the current is best */
840 /* name switch: finish group, re-init */
841 if (best->name != s->name) /* new name */
843 plist->elements[j++] = best - pool->solvables; /* move old best to front */
844 best = s; /* take current as new best */
848 if (best->evr != s->evr) /* compare evr */
850 if (pool_evrcmp(pool, best->evr, s->evr, EVRCMP_COMPARE) < 0)
854 plist->elements[j++] = best - pool->solvables; /* finish last group */
857 /* we reduced the list to one package per name, now look at
858 * package obsoletes */
859 if (plist->count > 1)
861 if (plist->count == 2)
862 prune_obsoleted_2(pool, plist);
864 prune_obsoleted(pool, plist);
866 if (plist->count > 1 && pool->installed)
867 move_installed_to_front(pool, plist);
872 sort_by_name_evr_sortcmp(const void *ap, const void *bp, void *dp)
875 Id a, *aa = (Id *)ap;
876 Id b, *bb = (Id *)bp;
877 Id r = aa[1] - bb[1];
879 return r < 0 ? -1 : 1;
880 a = aa[2] < 0 ? -aa[2] : aa[2];
881 b = bb[2] < 0 ? -bb[2] : bb[2];
882 if (pool->disttype != DISTTYPE_DEB)
884 /* treat release-less versions different */
885 const char *as = pool_id2str(pool, a);
886 const char *bs = pool_id2str(pool, b);
889 if (!strchr(bs, '-'))
898 r = pool_evrcmp(pool, b, a, EVRCMP_COMPARE);
899 if (!r && (aa[2] < 0 || bb[2] < 0))
907 return r < 0 ? -1 : 1;
911 /* common end of sort_by_srcversion and sort_by_common_dep */
913 sort_by_name_evr_array(Pool *pool, Queue *plist, int count, int ent)
916 int i, j, bad, havebad;
917 Id *pp, *elements = plist->elements;
921 queue_truncate(plist, count);
924 solv_sort(elements + count * 2, ent, sizeof(Id) * 3, sort_by_name_evr_sortcmp, pool);
927 for (i = 0, pp = elements + count * 2; i < ent; i++, pp += 3)
929 if (lastname && pp[1] == lastname)
931 if (pp[0] != pp[-3] && sort_by_name_evr_sortcmp(pp - 3, pp, pool) == -1)
934 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]));
945 elements[count + pp[0]] += bad;
949 for (i = 0; i < count; i++)
950 printf("%s badness %d\n", pool_solvid2str(pool, elements[i]), elements[count + i]);
955 /* simple stable insertion sort */
957 for (i = 0; i < count; i++)
958 if (pool->solvables[elements[i]].repo == pool->installed)
959 elements[i + count] = 0;
960 for (i = 1; i < count; i++)
961 for (j = i, pp = elements + count + j; j > 0; j--, pp--)
964 Id *pp2 = pp - count;
975 queue_truncate(plist, count);
980 sort_by_srcversion(Pool *pool, Queue *plist)
982 int i, count = plist->count, ent = 0;
983 queue_insertn(plist, count, count, 0);
984 for (i = 0; i < count; i++)
986 Id name, evr, p = plist->elements[i];
987 Solvable *s = pool->solvables + p;
988 if (solvable_lookup_void(s, SOLVABLE_SOURCENAME))
991 name = solvable_lookup_id(s, SOLVABLE_SOURCENAME);
992 if (solvable_lookup_void(s, SOLVABLE_SOURCEEVR))
995 evr = solvable_lookup_id(s, SOLVABLE_SOURCEEVR);
996 if (!name || !evr || ISRELDEP(evr))
998 queue_push(plist, i);
999 queue_push2(plist, name, evr);
1002 sort_by_name_evr_array(pool, plist, count, ent);
1007 sort_by_common_dep(Pool *pool, Queue *plist)
1009 int i, count = plist->count, ent = 0;
1011 queue_insertn(plist, count, count, 0);
1012 for (i = 0; i < count; i++)
1014 Id p = plist->elements[i];
1015 Solvable *s = pool->solvables + p;
1018 for (dp = s->repo->idarraydata + s->provides; (id = *dp++) != 0; )
1023 rd = GETRELDEP(pool, id);
1024 if ((rd->flags == REL_EQ || rd->flags == (REL_EQ | REL_LT) || rd->flags == REL_LT) && !ISRELDEP(rd->evr))
1026 if (rd->flags == REL_EQ)
1029 const char *s = pool_id2str(pool, rd->evr);
1032 while ((*s >= 'a' && *s <= 'f') || (*s >= '0' && *s <= '9'))
1038 queue_push(plist, i);
1039 queue_push2(plist, rd->name, rd->flags == REL_LT ? -rd->evr : rd->evr);
1044 sort_by_name_evr_array(pool, plist, count, ent);
1047 /* check if we have an update candidate */
1049 dislike_old_versions(Pool *pool, Queue *plist)
1051 int i, count = plist->count;
1052 Id *elements = plist->elements;
1055 for (i = 0; i < count; i++)
1058 Solvable *s = pool->solvables + p;
1059 Repo *repo = s->repo;
1062 if (!repo || repo == pool->installed)
1064 FOR_PROVIDES(q, qq, s->name)
1066 Solvable *qs = pool->solvables + q;
1069 if (s->name != qs->name || s->arch != qs->arch)
1071 if (repo->priority != qs->repo->priority)
1073 if (repo->priority > qs->repo->priority)
1079 if (pool_evrcmp(pool, qs->evr, s->evr, EVRCMP_COMPARE) > 0)
1089 /* now move negative elements to the back */
1090 for (i = 0; i < count; i++)
1095 if (i < plist->count - 1)
1097 memmove(elements + i, elements + i + 1, (plist->count - 1 - i) * sizeof(Id));
1098 elements[plist->count - 1] = -p;
1106 * POLICY_MODE_CHOOSE: default, do all pruning steps
1107 * POLICY_MODE_RECOMMEND: leave out prune_to_recommended
1108 * POLICY_MODE_SUGGEST: leave out prune_to_recommended, do prio pruning just per name
1111 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
1113 Pool *pool = solv->pool;
1114 if (plist->count > 1)
1116 if (mode != POLICY_MODE_SUGGEST)
1117 solver_prune_to_highest_prio(solv, plist);
1119 solver_prune_to_highest_prio_per_name(solv, plist);
1121 if (plist->count > 1)
1122 prune_to_best_arch(pool, plist);
1123 if (plist->count > 1)
1124 prune_to_best_version(pool, plist);
1125 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
1127 prune_to_recommended(solv, plist);
1128 if (plist->count > 1)
1130 /* do some fancy reordering */
1132 sort_by_srcversion(pool, plist);
1134 dislike_old_versions(pool, plist);
1135 sort_by_common_dep(pool, plist);
1136 prefer_suggested(solv, plist);
1142 /* check if there is an illegal architecture change if
1143 * installed solvable s1 is replaced by s2 */
1145 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
1147 Pool *pool = solv->pool;
1148 Id a1 = s1->arch, a2 = s2->arch;
1150 /* we allow changes to/from noarch */
1151 if (a1 == a2 || a1 == pool->noarchid || a2 == pool->noarchid)
1155 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
1156 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
1157 if (((a1 ^ a2) & 0xffff0000) != 0)
1162 /* check if there is an illegal vendor change if
1163 * installed solvable s1 is replaced by s2 */
1165 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
1167 Pool *pool = solv->pool;
1169 Id vendormask1, vendormask2;
1171 if (pool->custom_vendorcheck)
1172 return pool->custom_vendorcheck(pool, s1, s2);
1174 /* treat a missing vendor as empty string */
1175 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
1176 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
1179 vendormask1 = pool_vendor2mask(pool, v1);
1181 return 1; /* can't match */
1182 vendormask2 = pool_vendor2mask(pool, v2);
1183 if ((vendormask1 & vendormask2) != 0)
1185 return 1; /* no class matches */
1188 /* check if it is illegal to replace installed
1189 * package "is" with package "s" (which must obsolete "is")
1192 policy_is_illegal(Solver *solv, Solvable *is, Solvable *s, int ignore)
1194 Pool *pool = solv->pool;
1196 int duppkg = solv->dupmap_all ? 1 : 0;
1197 if (!(ignore & POLICY_ILLEGAL_DOWNGRADE) && !(duppkg ? solv->dup_allowdowngrade : solv->allowdowngrade))
1199 if (is->name == s->name && pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE) > 0)
1200 ret |= POLICY_ILLEGAL_DOWNGRADE;
1202 if (!(ignore & POLICY_ILLEGAL_ARCHCHANGE) && !(duppkg ? solv->dup_allowarchchange : solv->allowarchchange))
1204 if (is->arch != s->arch && policy_illegal_archchange(solv, is, s))
1205 ret |= POLICY_ILLEGAL_ARCHCHANGE;
1207 if (!(ignore & POLICY_ILLEGAL_VENDORCHANGE) && !(duppkg ? solv->dup_allowvendorchange : solv->allowvendorchange))
1209 if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, is, s))
1210 ret |= POLICY_ILLEGAL_VENDORCHANGE;
1212 if (!(ignore & POLICY_ILLEGAL_NAMECHANGE) && !(duppkg ? solv->dup_allownamechange : solv->allownamechange))
1214 if (is->name != s->name)
1215 ret |= POLICY_ILLEGAL_NAMECHANGE;
1220 /*-------------------------------------------------------------------
1222 * create reverse obsoletes map for installed solvables
1224 * For each installed solvable find which packages with *different* names
1225 * obsolete the solvable.
1226 * This index is used in policy_findupdatepackages() below.
1229 policy_create_obsolete_index(Solver *solv)
1231 Pool *pool = solv->pool;
1233 Repo *installed = solv->installed;
1234 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
1237 solv->obsoletes = solv_free(solv->obsoletes);
1238 solv->obsoletes_data = solv_free(solv->obsoletes_data);
1239 if (!installed || installed->start == installed->end)
1241 cnt = installed->end - installed->start;
1242 solv->obsoletes = obsoletes = solv_calloc(cnt, sizeof(Id));
1243 for (i = 1; i < pool->nsolvables; i++)
1245 s = pool->solvables + i;
1248 if (!pool_installable(pool, s))
1250 obsp = s->repo->idarraydata + s->obsoletes;
1251 while ((obs = *obsp++) != 0)
1253 FOR_PROVIDES(p, pp, obs)
1255 Solvable *ps = pool->solvables + p;;
1256 if (ps->repo != installed)
1258 if (ps->name == s->name)
1260 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1262 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1264 obsoletes[p - installed->start]++;
1269 for (i = 0; i < cnt; i++)
1272 n += obsoletes[i] + 1;
1275 solv->obsoletes_data = obsoletes_data = solv_calloc(n + 1, sizeof(Id));
1276 POOL_DEBUG(SOLV_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
1277 for (i = pool->nsolvables - 1; i > 0; i--)
1279 s = pool->solvables + i;
1282 if (!pool_installable(pool, s))
1284 obsp = s->repo->idarraydata + s->obsoletes;
1285 while ((obs = *obsp++) != 0)
1287 FOR_PROVIDES(p, pp, obs)
1289 Solvable *ps = pool->solvables + p;;
1290 if (ps->repo != installed)
1292 if (ps->name == s->name)
1294 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1296 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1298 if (obsoletes_data[obsoletes[p - installed->start]] != i)
1299 obsoletes_data[--obsoletes[p - installed->start]] = i;
1307 * find update candidates
1309 * s: installed solvable to be updated
1310 * qs: [out] queue to hold Ids of candidates
1311 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
1316 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
1318 /* installed packages get a special upgrade allowed rule */
1319 Pool *pool = solv->pool;
1320 Id p, pp, n, p2, pp2;
1323 int haveprovobs = 0;
1324 int allowdowngrade = allow_all ? 1 : solv->allowdowngrade;
1325 int allownamechange = allow_all ? 1 : solv->allownamechange;
1326 int allowarchchange = allow_all ? 1 : solv->allowarchchange;
1327 int allowvendorchange = allow_all ? 1 : solv->allowvendorchange;
1330 allowdowngrade = solv->dup_allowdowngrade;
1331 allownamechange = solv->dup_allownamechange;
1332 allowarchchange = solv->dup_allowarchchange;
1333 allowvendorchange = solv->dup_allowvendorchange;
1338 n = s - pool->solvables;
1341 * look for updates for s
1343 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
1345 if (p == n) /* skip itself */
1348 ps = pool->solvables + p;
1349 if (s->name == ps->name) /* name match */
1351 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1353 if (!allowdowngrade && pool_evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
1356 else if (!allownamechange)
1358 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
1360 /* check if package ps obsoletes installed package s */
1361 /* implicitobsoleteusescolors is somewhat wrong here, but we nevertheless
1362 * use it to limit our update candidates */
1363 if ((pool->obsoleteusescolors || pool->implicitobsoleteusescolors) && !pool_colormatch(pool, s, ps))
1365 obsp = ps->repo->idarraydata + ps->obsoletes;
1366 while ((obs = *obsp++) != 0) /* for all obsoletes */
1368 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
1370 Solvable *ps2 = pool->solvables + p2;
1371 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps2, obs))
1373 if (p2 == n) /* match ! */
1376 if (p2) /* match! */
1379 if (!obs) /* continue if no match */
1381 /* here we have 'p' with a matching provides/obsoletes combination
1382 * thus flagging p as a valid update candidate for s
1388 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
1390 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
1394 if (!allownamechange)
1396 /* if we have found some valid candidates and noupdateprovide is not set, we're
1397 done. otherwise we fallback to all obsoletes */
1398 if (!solv->noupdateprovide && haveprovobs)
1400 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
1403 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
1405 ps = pool->solvables + p;
1406 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
1408 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
1410 /* implicitobsoleteusescolors is somewhat wrong here, but we nevertheless
1411 * use it to limit our update candidates */
1412 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1420 policy_illegal2str(Solver *solv, int illegal, Solvable *s, Solvable *rs)
1422 Pool *pool = solv->pool;
1424 if (illegal == POLICY_ILLEGAL_DOWNGRADE)
1426 str = pool_tmpjoin(pool, "downgrade of ", pool_solvable2str(pool, s), 0);
1427 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1429 if (illegal == POLICY_ILLEGAL_NAMECHANGE)
1431 str = pool_tmpjoin(pool, "name change of ", pool_solvable2str(pool, s), 0);
1432 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1434 if (illegal == POLICY_ILLEGAL_ARCHCHANGE)
1436 str = pool_tmpjoin(pool, "architecture change of ", pool_solvable2str(pool, s), 0);
1437 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1439 if (illegal == POLICY_ILLEGAL_VENDORCHANGE)
1441 str = pool_tmpjoin(pool, "vendor change from '", pool_id2str(pool, s->vendor), "' (");
1444 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to '");
1445 str = pool_tmpappend(pool, str, pool_id2str(pool, rs->vendor), "' (");
1448 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to no vendor (");
1449 return pool_tmpappend(pool, str, pool_solvable2str(pool, rs), ")");
1451 return "unknown illegal change";