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));
335 * prune to recommended/suggested packages.
336 * does not prune installed packages (they are also somewhat recommended).
340 prune_to_recommended(Solver *solv, Queue *plist)
342 Pool *pool = solv->pool;
345 Id p, pp, rec, *recp, sug, *sugp;
350 for (i = 0; i < plist->count; i++)
352 p = plist->elements[i];
353 s = pool->solvables + p;
354 if (pool->installed && s->repo == pool->installed)
358 if (plist->count - ninst < 2)
361 /* update our recommendsmap/suggestsmap */
362 if (solv->recommends_index < 0)
364 MAPZERO(&solv->recommendsmap);
365 MAPZERO(&solv->suggestsmap);
366 #ifdef ENABLE_COMPLEX_DEPS
367 if (solv->recommendscplxq)
369 queue_free(solv->recommendscplxq);
370 solv->recommendscplxq = solv_free(solv->recommendscplxq);
372 if (solv->suggestscplxq)
374 queue_free(solv->suggestscplxq);
375 solv->suggestscplxq = solv_free(solv->suggestscplxq);
378 solv->recommends_index = 0;
380 while (solv->recommends_index < solv->decisionq.count)
382 p = solv->decisionq.elements[solv->recommends_index++];
385 s = pool->solvables + p;
386 #ifdef ENABLE_COMPLEX_DEPS
387 if (solv->recommendscplxq && solv->recommendscplxq->elements[p & 255])
388 if (solv->recommendscplxq->elements[p & 255] & (1 << (p >> 8 & 31)))
389 recheck_complex_dep(solv, p, &solv->recommendsmap, &solv->recommendscplxq);
390 if (solv->suggestscplxq && solv->suggestscplxq->elements[p & 255])
391 if (solv->suggestscplxq->elements[p & 255] & (1 << (p >> 8 & 31)))
392 recheck_complex_dep(solv, p, &solv->suggestsmap, &solv->suggestscplxq);
396 recp = s->repo->idarraydata + s->recommends;
397 while ((rec = *recp++) != 0)
399 #ifdef ENABLE_COMPLEX_DEPS
400 if (pool_is_complex_dep(pool, rec))
402 check_complex_dep(solv, rec, &solv->recommendsmap, &solv->recommendscplxq);
406 FOR_PROVIDES(p, pp, rec)
407 MAPSET(&solv->recommendsmap, p);
412 sugp = s->repo->idarraydata + s->suggests;
413 while ((sug = *sugp++) != 0)
415 #ifdef ENABLE_COMPLEX_DEPS
416 if (pool_is_complex_dep(pool, sug))
418 check_complex_dep(solv, sug, &solv->suggestsmap, &solv->suggestscplxq);
422 FOR_PROVIDES(p, pp, sug)
423 MAPSET(&solv->suggestsmap, p);
428 /* prune to recommended/supplemented */
430 for (i = j = 0; i < plist->count; i++)
432 p = plist->elements[i];
433 s = pool->solvables + p;
434 if (pool->installed && s->repo == pool->installed)
438 plist->elements[j++] = p;
441 if (!MAPTST(&solv->recommendsmap, p))
442 if (!solver_is_supplementing(solv, s))
446 for (k = 0; j < ninst; k++)
448 s = pool->solvables + plist->elements[k];
449 if (pool->installed && s->repo == pool->installed)
450 plist->elements[j++] = plist->elements[k];
453 plist->elements[j++] = p;
458 /* anything left to prune? */
459 if (plist->count - ninst < 2)
462 /* prune to suggested/enhanced */
464 for (i = j = 0; i < plist->count; i++)
466 p = plist->elements[i];
467 s = pool->solvables + p;
468 if (pool->installed && s->repo == pool->installed)
472 plist->elements[j++] = p;
475 if (!MAPTST(&solv->suggestsmap, p))
476 if (!solver_is_enhancing(solv, s))
480 for (k = 0; j < ninst; k++)
482 s = pool->solvables + plist->elements[k];
483 if (pool->installed && s->repo == pool->installed)
484 plist->elements[j++] = plist->elements[k];
487 plist->elements[j++] = p;
494 prune_to_best_arch(const Pool *pool, Queue *plist)
500 if (!pool->id2arch || plist->count < 2)
503 for (i = 0; i < plist->count; i++)
505 s = pool->solvables + plist->elements[i];
507 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
508 if (a && a != 1 && (!bestscore || a < bestscore))
513 for (i = j = 0; i < plist->count; i++)
515 s = pool->solvables + plist->elements[i];
517 if (a > pool->lastarch)
519 a = pool->id2arch[a];
520 /* a == 1 -> noarch */
521 if (a != 1 && ((a ^ bestscore) & 0xffff0000) != 0)
523 plist->elements[j++] = plist->elements[i];
540 /* This is Tarjan's SCC algorithm, slightly modified */
542 trj_visit(struct trj_data *trj, Id node)
545 Pool *pool = trj->pool;
546 Queue *plist = trj->plist;
547 Id myidx, stackstart;
550 Id p, pp, obs, *obsp;
552 low[node] = myidx = trj->idx++;
553 trj->stack[(stackstart = trj->nstack++)] = node;
555 s = pool->solvables + plist->elements[node];
558 obsp = s->repo->idarraydata + s->obsoletes;
559 while ((obs = *obsp++) != 0)
561 FOR_PROVIDES(p, pp, obs)
563 Solvable *ps = pool->solvables + p;
564 if (ps->name == s->name)
566 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
568 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
570 /* hmm, expensive. should use hash if plist is big */
571 for (i = 0; i < plist->count; i++)
573 if (node != i && plist->elements[i] == p)
590 if (l < trj->firstidx)
593 /* this means we have reached an old SCC found earlier.
594 * delete it as we obsolete it */
597 if (low[trj->stack[k]] == l)
598 low[trj->stack[k]] = -1;
603 else if (l < low[node])
610 if (low[node] == myidx) /* found a SCC? */
612 /* we're only interested in SCCs that contain the first node,
613 * as all others are "obsoleted" */
614 if (myidx != trj->firstidx)
616 for (i = stackstart; i < trj->nstack; i++)
617 low[trj->stack[i]] = myidx;
618 trj->nstack = stackstart; /* empty stack */
623 * remove entries from plist that are obsoleted by other entries
624 * with different name.
627 prune_obsoleted(Pool *pool, Queue *plist)
629 Id data_buf[2 * 16], *data;
634 if (plist->count <= 16)
636 memset(data_buf, 0, sizeof(data_buf));
640 data = solv_calloc(plist->count, 2 * sizeof(Id));
645 trj.stack = data + plist->count - 1; /* -1 so we can index with idx (which starts with 1) */
646 for (i = 0; i < plist->count; i++)
650 s = pool->solvables + plist->elements[i];
653 trj.firstidx = trj.nstack = trj.idx;
658 Id myidx = trj.idx++;
660 trj.stack[myidx] = i;
663 for (i = j = 0; i < plist->count; i++)
665 plist->elements[j++] = plist->elements[i];
667 if (data != data_buf)
671 /* this is prune_obsoleted special-cased for two elements */
673 prune_obsoleted_2(Pool *pool, Queue *plist)
677 Id p, pp, obs, *obsp;
681 for (i = 0; i < 2; i++)
683 s = pool->solvables + plist->elements[i];
684 other = plist->elements[1 - i];
687 obsp = s->repo->idarraydata + s->obsoletes;
688 while ((obs = *obsp++) != 0)
690 FOR_PROVIDES(p, pp, obs)
695 ps = pool->solvables + p;
696 if (ps->name == s->name)
698 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
700 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
710 if (obmap == 0 || obmap == 3)
713 plist->elements[0] = plist->elements[1];
718 * bring those elements to the front of the queue that
719 * have a installed solvable with the same name
722 move_installed_to_front(Pool *pool, Queue *plist)
728 for (i = j = 0; i < plist->count; i++)
730 s = pool->solvables + plist->elements[i];
731 if (s->repo != pool->installed)
733 FOR_PROVIDES(p, pp, s->name)
735 Solvable *ps = pool->solvables + p;
736 if (s->name == ps->name && ps->repo == pool->installed)
743 if (s->repo == pool->installed)
747 p = plist->elements[i];
749 plist->elements[i] = plist->elements[j];
751 memmove(plist->elements + j + 1, plist->elements + j, (i - j) * sizeof(Id));
752 plist->elements[j] = p;
754 else if (j + 2 == plist->count)
755 break; /* no need to check last element if all prev ones are installed */
762 * prune_to_best_version
764 * sort list of packages (given through plist) by name and evr
765 * return result through plist
768 prune_to_best_version(Pool *pool, Queue *plist)
773 if (plist->count < 2) /* no need to prune for a single entry */
775 POOL_DEBUG(SOLV_DEBUG_POLICY, "prune_to_best_version %d\n", plist->count);
777 /* sort by name first, prefer installed */
778 solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
780 /* now find best 'per name' */
782 for (i = j = 0; i < plist->count; i++)
784 s = pool->solvables + plist->elements[i];
786 POOL_DEBUG(SOLV_DEBUG_POLICY, "- %s[%s]\n",
787 pool_solvable2str(pool, s),
788 (pool->installed && s->repo == pool->installed) ? "installed" : "not installed");
790 if (!best) /* if no best yet, the current is best */
796 /* name switch: finish group, re-init */
797 if (best->name != s->name) /* new name */
799 plist->elements[j++] = best - pool->solvables; /* move old best to front */
800 best = s; /* take current as new best */
804 if (best->evr != s->evr) /* compare evr */
806 if (pool_evrcmp(pool, best->evr, s->evr, EVRCMP_COMPARE) < 0)
810 plist->elements[j++] = best - pool->solvables; /* finish last group */
813 /* we reduced the list to one package per name, now look at
814 * package obsoletes */
815 if (plist->count > 1)
817 if (plist->count == 2)
818 prune_obsoleted_2(pool, plist);
820 prune_obsoleted(pool, plist);
822 if (plist->count > 1 && pool->installed)
823 move_installed_to_front(pool, plist);
828 * POLICY_MODE_CHOOSE: default, do all pruning steps
829 * POLICY_MODE_RECOMMEND: leave out prune_to_recommended
830 * POLICY_MODE_SUGGEST: leave out prune_to_recommended, do prio pruning just per name
833 policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
835 Pool *pool = solv->pool;
836 if (plist->count > 1)
838 if (mode != POLICY_MODE_SUGGEST)
839 solver_prune_to_highest_prio(solv, plist);
841 solver_prune_to_highest_prio_per_name(solv, plist);
843 if (plist->count > 1)
844 prune_to_best_arch(pool, plist);
845 if (plist->count > 1)
846 prune_to_best_version(pool, plist);
847 if (plist->count > 1 && mode == POLICY_MODE_CHOOSE)
848 prune_to_recommended(solv, plist);
852 /* check if there is an illegal architecture change if
853 * installed solvable s1 is replaced by s2 */
855 policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
857 Pool *pool = solv->pool;
858 Id a1 = s1->arch, a2 = s2->arch;
860 /* we allow changes to/from noarch */
861 if (a1 == a2 || a1 == pool->noarchid || a2 == pool->noarchid)
865 a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
866 a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
867 if (((a1 ^ a2) & 0xffff0000) != 0)
872 /* check if there is an illegal vendor change if
873 * installed solvable s1 is replaced by s2 */
875 policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
877 Pool *pool = solv->pool;
879 Id vendormask1, vendormask2;
881 if (pool->custom_vendorcheck)
882 return pool->custom_vendorcheck(pool, s1, s2);
884 /* treat a missing vendor as empty string */
885 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
886 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
889 vendormask1 = pool_vendor2mask(pool, v1);
891 return 1; /* can't match */
892 vendormask2 = pool_vendor2mask(pool, v2);
893 if ((vendormask1 & vendormask2) != 0)
895 return 1; /* no class matches */
898 /* check if it is illegal to replace installed
899 * package "is" with package "s" (which must obsolete "is")
902 policy_is_illegal(Solver *solv, Solvable *is, Solvable *s, int ignore)
904 Pool *pool = solv->pool;
906 int duppkg = solv->dupmap_all ? 1 : 0;
907 if (!(ignore & POLICY_ILLEGAL_DOWNGRADE) && !(duppkg ? solv->dup_allowdowngrade : solv->allowdowngrade))
909 if (is->name == s->name && pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE) > 0)
910 ret |= POLICY_ILLEGAL_DOWNGRADE;
912 if (!(ignore & POLICY_ILLEGAL_ARCHCHANGE) && !(duppkg ? solv->dup_allowarchchange : solv->allowarchchange))
914 if (is->arch != s->arch && policy_illegal_archchange(solv, is, s))
915 ret |= POLICY_ILLEGAL_ARCHCHANGE;
917 if (!(ignore & POLICY_ILLEGAL_VENDORCHANGE) && !(duppkg ? solv->dup_allowvendorchange : solv->allowvendorchange))
919 if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, is, s))
920 ret |= POLICY_ILLEGAL_VENDORCHANGE;
922 if (!(ignore & POLICY_ILLEGAL_NAMECHANGE) && !(duppkg ? solv->dup_allownamechange : solv->allownamechange))
924 if (is->name != s->name)
925 ret |= POLICY_ILLEGAL_NAMECHANGE;
930 /*-------------------------------------------------------------------
932 * create reverse obsoletes map for installed solvables
934 * For each installed solvable find which packages with *different* names
935 * obsolete the solvable.
936 * This index is used in policy_findupdatepackages() below.
939 policy_create_obsolete_index(Solver *solv)
941 Pool *pool = solv->pool;
943 Repo *installed = solv->installed;
944 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
947 solv->obsoletes = solv_free(solv->obsoletes);
948 solv->obsoletes_data = solv_free(solv->obsoletes_data);
949 if (!installed || installed->start == installed->end)
951 cnt = installed->end - installed->start;
952 solv->obsoletes = obsoletes = solv_calloc(cnt, sizeof(Id));
953 for (i = 1; i < pool->nsolvables; i++)
955 s = pool->solvables + i;
958 if (!pool_installable(pool, s))
960 obsp = s->repo->idarraydata + s->obsoletes;
961 while ((obs = *obsp++) != 0)
963 FOR_PROVIDES(p, pp, obs)
965 Solvable *ps = pool->solvables + p;;
966 if (ps->repo != installed)
968 if (ps->name == s->name)
970 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
972 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
974 obsoletes[p - installed->start]++;
979 for (i = 0; i < cnt; i++)
982 n += obsoletes[i] + 1;
985 solv->obsoletes_data = obsoletes_data = solv_calloc(n + 1, sizeof(Id));
986 POOL_DEBUG(SOLV_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
987 for (i = pool->nsolvables - 1; i > 0; i--)
989 s = pool->solvables + i;
992 if (!pool_installable(pool, s))
994 obsp = s->repo->idarraydata + s->obsoletes;
995 while ((obs = *obsp++) != 0)
997 FOR_PROVIDES(p, pp, obs)
999 Solvable *ps = pool->solvables + p;;
1000 if (ps->repo != installed)
1002 if (ps->name == s->name)
1004 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1006 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1008 if (obsoletes_data[obsoletes[p - installed->start]] != i)
1009 obsoletes_data[--obsoletes[p - installed->start]] = i;
1017 * find update candidates
1019 * s: installed solvable to be updated
1020 * qs: [out] queue to hold Ids of candidates
1021 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
1026 policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
1028 /* installed packages get a special upgrade allowed rule */
1029 Pool *pool = solv->pool;
1030 Id p, pp, n, p2, pp2;
1033 int haveprovobs = 0;
1034 int allowdowngrade = allow_all ? 1 : solv->allowdowngrade;
1035 int allownamechange = allow_all ? 1 : solv->allownamechange;
1036 int allowarchchange = allow_all ? 1 : solv->allowarchchange;
1037 int allowvendorchange = allow_all ? 1 : solv->allowvendorchange;
1040 allowdowngrade = solv->dup_allowdowngrade;
1041 allownamechange = solv->dup_allownamechange;
1042 allowarchchange = solv->dup_allowarchchange;
1043 allowvendorchange = solv->dup_allowvendorchange;
1048 n = s - pool->solvables;
1051 * look for updates for s
1053 FOR_PROVIDES(p, pp, s->name) /* every provider of s' name */
1055 if (p == n) /* skip itself */
1058 ps = pool->solvables + p;
1059 if (s->name == ps->name) /* name match */
1061 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1063 if (!allowdowngrade && pool_evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
1066 else if (!allownamechange)
1068 else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
1070 /* check if package ps obsoletes installed package s */
1071 /* implicitobsoleteusescolors is somewhat wrong here, but we nevertheless
1072 * use it to limit our update candidates */
1073 if ((pool->obsoleteusescolors || pool->implicitobsoleteusescolors) && !pool_colormatch(pool, s, ps))
1075 obsp = ps->repo->idarraydata + ps->obsoletes;
1076 while ((obs = *obsp++) != 0) /* for all obsoletes */
1078 FOR_PROVIDES(p2, pp2, obs) /* and all matching providers of the obsoletes */
1080 Solvable *ps2 = pool->solvables + p2;
1081 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps2, obs))
1083 if (p2 == n) /* match ! */
1086 if (p2) /* match! */
1089 if (!obs) /* continue if no match */
1091 /* here we have 'p' with a matching provides/obsoletes combination
1092 * thus flagging p as a valid update candidate for s
1098 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
1100 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
1104 if (!allownamechange)
1106 /* if we have found some valid candidates and noupdateprovide is not set, we're
1107 done. otherwise we fallback to all obsoletes */
1108 if (!solv->noupdateprovide && haveprovobs)
1110 if (solv->obsoletes && solv->obsoletes[n - solv->installed->start])
1113 for (opp = solv->obsoletes_data + solv->obsoletes[n - solv->installed->start]; (p = *opp++) != 0;)
1115 ps = pool->solvables + p;
1116 if (!allowarchchange && s->arch != ps->arch && policy_illegal_archchange(solv, s, ps))
1118 if (!allowvendorchange && s->vendor != ps->vendor && policy_illegal_vendorchange(solv, s, ps))
1120 /* implicitobsoleteusescolors is somewhat wrong here, but we nevertheless
1121 * use it to limit our update candidates */
1122 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1130 policy_illegal2str(Solver *solv, int illegal, Solvable *s, Solvable *rs)
1132 Pool *pool = solv->pool;
1134 if (illegal == POLICY_ILLEGAL_DOWNGRADE)
1136 str = pool_tmpjoin(pool, "downgrade of ", pool_solvable2str(pool, s), 0);
1137 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1139 if (illegal == POLICY_ILLEGAL_NAMECHANGE)
1141 str = pool_tmpjoin(pool, "name change of ", pool_solvable2str(pool, s), 0);
1142 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1144 if (illegal == POLICY_ILLEGAL_ARCHCHANGE)
1146 str = pool_tmpjoin(pool, "architecture change of ", pool_solvable2str(pool, s), 0);
1147 return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1149 if (illegal == POLICY_ILLEGAL_VENDORCHANGE)
1151 str = pool_tmpjoin(pool, "vendor change from '", pool_id2str(pool, s->vendor), "' (");
1154 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to '");
1155 str = pool_tmpappend(pool, str, pool_id2str(pool, rs->vendor), "' (");
1158 str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to no vendor (");
1159 return pool_tmpappend(pool, str, pool_solvable2str(pool, rs), ")");
1161 return "unknown illegal change";