2 * Copyright (c) 2017, SUSE Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * code to find and erase unneeded packages
20 #include "solverdebug.h"
21 #include "solver_private.h"
31 * This functions collects all packages that are looked at
32 * when a dependency is checked. We need it to "pin" installed
33 * packages when removing a supplemented package in createcleandepsmap.
34 * Here's an not uncommon example:
35 * A contains "Supplements: packageand(B, C)"
36 * B contains "Requires: A"
37 * Now if we remove C, the supplements is no longer true,
38 * thus we also remove A. Without the dep_pkgcheck function, we
39 * would now also remove B, but this is wrong, as adding back
40 * C doesn't make the supplements true again. Thus we "pin" B
42 * There's probably a better way to do this, but I haven't come
46 dep_pkgcheck_slow(Solver *solv, Id dep, Map *m, Queue *q)
48 Pool *pool = solv->pool;
53 Reldep *rd = GETRELDEP(pool, dep);
56 if (rd->flags == REL_AND)
58 dep_pkgcheck_slow(solv, rd->name, m, q);
59 dep_pkgcheck_slow(solv, rd->evr, m, q);
62 if (rd->flags == REL_COND || rd->flags == REL_UNLESS)
64 dep_pkgcheck_slow(solv, rd->name, m, q);
65 if (ISRELDEP(rd->evr))
67 Reldep *rd2 = GETRELDEP(pool, rd->evr);
68 if (rd2->flags == REL_ELSE)
69 dep_pkgcheck_slow(solv, rd2->evr, m, q);
73 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
77 FOR_PROVIDES(p, pp, dep)
78 if (!m || MAPTST(m, p))
83 dep_pkgcheck(Solver *solv, Id dep, Map *m, Queue *q)
85 Pool *pool = solv->pool;
88 if (!ISSIMPLEDEP(pool, dep))
90 dep_pkgcheck_slow(solv, dep, m, q);
93 FOR_PROVIDES(p, pp, dep)
94 if (!m || MAPTST(m, p))
99 check_xsupp(Solver *solv, Queue *depq, Id dep)
101 Pool *pool = solv->pool;
106 Reldep *rd = GETRELDEP(pool, dep);
109 if (rd->flags == REL_AND)
111 if (!check_xsupp(solv, depq, rd->name))
113 return check_xsupp(solv, depq, rd->evr);
115 if (rd->flags == REL_OR)
117 if (check_xsupp(solv, depq, rd->name))
119 return check_xsupp(solv, depq, rd->evr);
121 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
123 if (depq && rd->flags == REL_NAMESPACE)
126 for (i = 0; i < depq->count; i++)
127 if (depq->elements[i] == dep || depq->elements[i] == rd->name)
132 FOR_PROVIDES(p, pp, dep)
133 if (p == SYSTEMSOLVABLE || pool->solvables[p].repo == solv->installed)
146 /* Tarjan's SCC algorithm, slightly modifed */
148 trj_visit(struct trj_data *trj, Id node)
151 Queue *edges = trj->edges;
152 Id nnode, myidx, stackstart;
155 low[node] = myidx = trj->idx++;
156 low[(stackstart = trj->nstack++)] = node;
157 for (i = edges->elements[node]; (nnode = edges->elements[i]) != 0; i++)
162 if (!edges->elements[edges->elements[nnode]])
168 trj_visit(trj, nnode);
173 if (l < trj->firstidx)
176 for (k = l; low[low[k]] == l; k++)
179 else if (l < low[node])
182 if (low[node] == myidx)
184 if (myidx != trj->firstidx)
186 for (i = stackstart; i < trj->nstack; i++)
188 trj->nstack = stackstart;
192 #ifdef ENABLE_COMPLEX_DEPS
194 complex_filter_unneeded(Pool *pool, Id ip, Id req, Queue *edges, Map *cleandepsmap, Queue *unneededq)
201 i = pool_normalize_complex_dep(pool, req, &dq, CPLXDEPS_EXPAND);
202 if (i == 0 || i == 1)
207 for (i = 0; i < dq.count; i++)
209 for (; (p = dq.elements[i]) != 0; i++)
213 if (pool->solvables[-p].repo != pool->installed)
217 if (p == ip || pool->solvables[p].repo != pool->installed || !MAPTST(cleandepsmap, p - pool->installed->start))
219 for (j = 0; j < unneededq->count; j++)
220 if (p == unneededq->elements[j])
222 if (edges->elements[edges->count - 1] != j + 1)
223 queue_push(edges, j + 1);
227 while (dq.elements[i])
236 filter_unneeded(Solver *solv, Queue *unneededq, Map *unneededmap, int justone)
238 Pool *pool = solv->pool;
239 Repo *installed = solv->installed;
243 int i, j, pass, count = unneededq->count;
246 if (unneededq->count < 2)
252 map_grow(unneededmap, installed->end - installed->start);
253 for (i = 0; i < count; i++)
254 MAPSET(unneededmap, unneededq->elements[i] - installed->start);
256 map_init(&installedm, pool->nsolvables);
257 for (i = installed->start; i < installed->end; i++)
258 if (pool->solvables[i].repo == installed)
259 MAPSET(&installedm, i);
261 nrequires = solv_calloc(count, sizeof(Id));
263 queue_prealloc(&edges, count * 4 + 10); /* pre-size */
266 * Go through the solvables in the nodes queue and create edges for
267 * all requires/recommends/supplements between the nodes.
268 * The edges are stored in the edges queue, we add 1 to the node
269 * index so that nodes in the edges queue are != 0 and we can
270 * terminate the edge list with 0.
271 * Thus for node element 5, the edges are stored starting at
272 * edges.elements[6] and are 0-terminated.
274 /* leave first element zero to make things easier */
275 /* also add trailing zero */
276 queue_insertn(&edges, 0, 1 + count + 1, 0);
278 /* first requires and recommends */
279 for (i = 0; i < count; i++)
281 Solvable *s = pool->solvables + unneededq->elements[i];
282 int oldcount = edges.count;
283 edges.elements[i + 1] = oldcount;
284 for (pass = 0; pass < 2; pass++)
286 unsigned int off = pass == 0 ? s->requires : s->recommends;
289 for (dp = s->repo->idarraydata + off; (dep = *dp) != 0; dp++)
291 #ifdef ENABLE_COMPLEX_DEPS
292 if (pool_is_complex_dep(pool, dep))
294 complex_filter_unneeded(pool, s - pool->solvables, dep, &edges, unneededmap, unneededq);
301 FOR_PROVIDES(p, pp, dep)
303 Solvable *sp = pool->solvables + p;
304 if (s == sp || sp->repo != installed)
311 FOR_PROVIDES(p, pp, dep)
313 Solvable *sp = pool->solvables + p;
314 if (s == sp || sp->repo != installed || !MAPTST(unneededmap, p - installed->start))
316 for (j = 0; j < count; j++)
317 if (p == unneededq->elements[j])
319 if (edges.elements[edges.count - 1] != j + 1)
320 queue_push(&edges, j + 1);
325 nrequires[i] = edges.count - oldcount;
327 queue_push(&edges, 0);
330 printf("requires + recommends\n");
331 for (i = 0; i < count; i++)
334 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
335 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
336 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
340 /* then add supplements */
341 for (i = 0; i < count; i++)
343 Solvable *s = pool->solvables + unneededq->elements[i];
348 for (dp = s->repo->idarraydata + s->supplements; *dp; dp++)
349 if (solver_dep_possible(solv, *dp, &installedm))
353 queue_init_buffer(&iq, iqbuf, sizeof(iqbuf)/sizeof(*iqbuf));
354 dep_pkgcheck(solv, *dp, 0, &iq);
355 if (justone && iq.count != 1)
360 for (k = 0; k < iq.count; k++)
362 Id p = iq.elements[k];
363 Solvable *sp = pool->solvables + p;
364 if (p == unneededq->elements[i] || sp->repo != installed || !MAPTST(unneededmap, p - installed->start))
366 for (j = 0; j < count; j++)
367 if (p == unneededq->elements[j])
369 /* now add edge from j + 1 to i + 1 */
370 queue_insert(&edges, edges.elements[j + 1] + nrequires[j], i + 1);
371 /* addapt following edge pointers */
372 for (j = j + 2; j < count + 1; j++)
381 printf("+ supplements\n");
382 for (i = 0; i < count; i++)
385 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
386 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
387 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
390 map_free(&installedm);
392 /* now run SCC algo two times, first with requires+recommends+supplements,
393 * then again without the requires. We run it the second time to get rid
394 * of packages that got dragged in via recommends/supplements */
396 * low will contain the result of the SCC search.
397 * it must be of at least size 2 * (count + 1) and
398 * must be zero initialized.
400 * 0 low low ... low stack stack ...stack 0
403 low = solv_calloc(count + 1, 2 * sizeof(Id));
404 for (pass = 0; pass < 2; pass++)
409 memset(low, 0, (count + 1) * (2 * sizeof(Id)));
410 for (i = 0; i < count; i++)
412 edges.elements[i + 1] += nrequires[i];
413 if (!unneededq->elements[i])
414 low[i + 1] = -1; /* ignore this node */
419 trj.idx = count + 1; /* stack starts here */
420 for (i = 1; i <= count; i++)
424 if (edges.elements[edges.elements[i]])
426 trj.firstidx = trj.nstack = trj.idx;
431 Id myidx = trj.idx++;
437 for (i = 0; i < count; i++)
439 unneededq->elements[i] = 0;
442 solv_free(nrequires);
445 /* finally remove all pruned entries from unneededq */
446 for (i = j = 0; i < count; i++)
447 if (unneededq->elements[i])
448 unneededq->elements[j++] = unneededq->elements[i];
449 queue_truncate(unneededq, j);
454 #ifdef ENABLE_COMPLEX_DEPS
456 complex_cleandeps_remove(Pool *pool, Id ip, Id req, Map *im, Map *installedm, Queue *iq)
463 i = pool_normalize_complex_dep(pool, req, &dq, CPLXDEPS_EXPAND);
464 if (i == 0 || i == 1)
469 for (i = 0; i < dq.count; i++)
471 for (; (p = dq.elements[i]) != 0; i++)
475 if (!MAPTST(installedm, -p))
479 if (p != SYSTEMSOLVABLE && MAPTST(im, p))
481 #ifdef CLEANDEPSDEBUG
482 printf("%s requires/recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
487 while (dq.elements[i])
494 complex_cleandeps_addback(Pool *pool, Id ip, Id req, Map *im, Map *installedm, Queue *iq, Map *userinstalled)
501 i = pool_normalize_complex_dep(pool, req, &dq, CPLXDEPS_EXPAND);
502 if (i == 0 || i == 1)
507 for (i = 0; i < dq.count; i++)
510 for (; (p = dq.elements[i]) != 0; i++)
514 if (!MAPTST(installedm, -p))
522 for (i = blk; (p = dq.elements[i]) != 0; i++)
528 if (!MAPTST(installedm, p))
530 if (p == ip || MAPTST(userinstalled, p - pool->installed->start))
532 #ifdef CLEANDEPSDEBUG
533 printf("%s requires/recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
539 while (dq.elements[i])
548 queue_contains(Queue *q, Id id)
551 for (i = 0; i < q->count; i++)
552 if (q->elements[i] == id)
558 find_update_seeds(Solver *solv, Queue *updatepkgs_filtered, Map *userinstalled)
560 Pool *pool = solv->pool;
561 Repo *installed = solv->installed;
562 Queue *cleandeps_updatepkgs = solv->cleandeps_updatepkgs;
566 queue_prealloc(updatepkgs_filtered, cleandeps_updatepkgs->count);
567 for (i = 0; i < cleandeps_updatepkgs->count; i++)
569 p = cleandeps_updatepkgs->elements[i];
570 if (pool->solvables[p].repo == installed)
572 #ifdef ENABLE_LINKED_PKGS
573 const char *name = pool_id2str(pool, pool->solvables[p].name);
574 if (strncmp(name, "pattern:", 8) == 0 || strncmp(name, "application:", 12) == 0)
577 queue_push(updatepkgs_filtered, p);
580 #ifdef CLEANDEPSDEBUG
581 printf("SEEDS IN (%d)\n", updatepkgs_filtered->count);
582 for (i = 0; i < updatepkgs_filtered->count; i++)
583 printf(" - %s\n", pool_solvid2str(pool, updatepkgs_filtered->elements[i]));
585 filter_unneeded(solv, updatepkgs_filtered, 0, 1);
586 #ifdef CLEANDEPSDEBUG
587 printf("SEEDS OUT (%d)\n", updatepkgs_filtered->count);
588 for (i = 0; i < updatepkgs_filtered->count; i++)
589 printf(" - %s\n", pool_solvid2str(pool, updatepkgs_filtered->elements[i]));
591 /* make sure userinstalled packages are in the seeds */
592 for (i = j = 0; i < updatepkgs_filtered->count; i++)
594 p = updatepkgs_filtered->elements[i];
595 if (!MAPTST(userinstalled, p - installed->start))
596 updatepkgs_filtered->elements[j++] = p;
598 queue_truncate(updatepkgs_filtered, j);
599 for (i = 0; i < cleandeps_updatepkgs->count; i++)
601 p = cleandeps_updatepkgs->elements[i];
602 if (pool->solvables[p].repo == installed)
604 #ifdef ENABLE_LINKED_PKGS
605 const char *name = pool_id2str(pool, pool->solvables[p].name);
606 if (strncmp(name, "pattern:", 8) == 0 || strncmp(name, "application:", 12) == 0)
608 queue_push(updatepkgs_filtered, p);
612 if (MAPTST(userinstalled, p - installed->start))
613 queue_push(updatepkgs_filtered, p);
616 #ifdef CLEANDEPSDEBUG
617 printf("SEEDS FINAL\n");
618 for (i = 0; i < updatepkgs_filtered->count; i++)
619 printf(" - %s\n", pool_solvid2str(pool, updatepkgs_filtered->elements[i]));
624 * Find all installed packages that are no longer
625 * needed regarding the current solver job.
628 * - remove pass: remove all packages that could have
629 * been dragged in by the obsoleted packages.
630 * i.e. if package A is obsolete and contains "Requires: B",
631 * also remove B, as installing A will have pulled in B.
632 * after this pass, we have a set of still installed packages
633 * with broken dependencies.
635 * now add back all packages that the still installed packages
638 * The cleandeps packages are the packages removed in the first
639 * pass and not added back in the second pass.
641 * If we search for unneeded packages (unneeded is true), we
642 * simply remove all packages except the userinstalled ones in
646 solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded)
648 Pool *pool = solv->pool;
649 Repo *installed = solv->installed;
650 Queue *job = &solv->job;
655 Id rid, how, what, select;
657 Id req, *reqp, sup, *supp;
659 Queue iq, iqcopy, xsuppq;
660 Queue updatepkgs_filtered;
663 map_empty(cleandepsmap);
664 if (!installed || installed->end == installed->start)
666 map_init(&userinstalled, installed->end - installed->start);
667 map_init(&im, pool->nsolvables);
668 map_init(&installedm, pool->nsolvables);
672 for (i = 0; i < job->count; i += 2)
674 how = job->elements[i];
675 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
677 what = job->elements[i + 1];
678 select = how & SOLVER_SELECTMASK;
679 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && what == installed->repoid))
681 FOR_REPO_SOLVABLES(installed, p, s)
682 MAPSET(&userinstalled, p - installed->start);
684 FOR_JOB_SELECT(p, pp, select, what)
685 if (pool->solvables[p].repo == installed)
686 MAPSET(&userinstalled, p - installed->start);
688 if ((how & (SOLVER_JOBMASK | SOLVER_SELECTMASK)) == (SOLVER_ERASE | SOLVER_SOLVABLE_PROVIDES))
690 what = job->elements[i + 1];
693 Reldep *rd = GETRELDEP(pool, what);
694 if (rd->flags != REL_NAMESPACE)
698 queue_pushunique(&iq, rd->name);
701 FOR_PROVIDES(p, pp, what)
706 queue_pushunique(&iq, what);
711 /* have special namespace cleandeps erases */
714 for (ip = installed->start; ip < installed->end; ip++)
716 s = pool->solvables + ip;
717 if (s->repo != installed)
721 supp = s->repo->idarraydata + s->supplements;
722 while ((sup = *supp++) != 0)
723 if (ISRELDEP(sup) && check_xsupp(solv, &iq, sup) && !check_xsupp(solv, 0, sup))
725 #ifdef CLEANDEPSDEBUG
726 printf("xsupp %s from %s\n", pool_dep2str(pool, sup), pool_solvid2str(pool, ip));
728 queue_pushunique(&xsuppq, sup);
734 /* also add visible patterns to userinstalled for openSUSE */
738 dataiterator_init(&di, pool, 0, 0, SOLVABLE_ISVISIBLE, 0, 0);
739 while (dataiterator_step(&di))
744 s = pool->solvables + di.solvid;
745 if (!s->repo || !s->requires)
747 if (s->repo != installed && !pool_installable(pool, s))
749 if (strncmp(pool_id2str(pool, s->name), "pattern:", 8) != 0)
751 for (dp = s->repo->idarraydata + s->requires; *dp; dp++)
752 FOR_PROVIDES(p, pp, *dp)
753 if (pool->solvables[p].repo == installed)
755 if (strncmp(pool_id2str(pool, pool->solvables[p].name), "pattern", 7) != 0)
757 MAPSET(&userinstalled, p - installed->start);
760 dataiterator_free(&di);
764 /* all products and their buddies are userinstalled */
765 for (p = installed->start; p < installed->end; p++)
767 Solvable *s = pool->solvables + p;
768 if (s->repo != installed)
770 if (!strncmp("product:", pool_id2str(pool, s->name), 8))
772 MAPSET(&userinstalled, p - installed->start);
773 #ifdef ENABLE_LINKED_PKGS
774 if (solv->instbuddy && solv->instbuddy[p - installed->start] > 1)
776 Id buddy = solv->instbuddy[p - installed->start];
777 if (buddy >= installed->start && buddy < installed->end)
778 MAPSET(&userinstalled, buddy - installed->start);
785 /* add all positive elements (e.g. locks) to "userinstalled" */
786 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
788 r = solv->rules + rid;
791 i = solv->ruletojob.elements[rid - solv->jobrules];
792 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
794 FOR_RULELITERALS(p, jp, r)
795 if (p > 0 && pool->solvables[p].repo == installed)
796 MAPSET(&userinstalled, p - installed->start);
799 /* add all cleandeps candidates to iq */
800 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
802 r = solv->rules + rid;
803 if (r->d < 0) /* disabled? */
805 if (r->d == 0 && r->p < 0 && r->w2 == 0) /* negative assertion (erase job)? */
808 if (pool->solvables[p].repo != installed)
810 MAPCLR(&userinstalled, p - installed->start);
813 i = solv->ruletojob.elements[rid - solv->jobrules];
814 how = job->elements[i];
815 if ((how & (SOLVER_JOBMASK|SOLVER_CLEANDEPS)) == (SOLVER_ERASE|SOLVER_CLEANDEPS))
818 else if (r->p > 0) /* install job */
822 i = solv->ruletojob.elements[rid - solv->jobrules];
823 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
825 /* check if the literals all obsolete some installed package */
829 /* just one installed literal */
830 if (r->d == 0 && r->w2 == 0 && pool->solvables[r->p].repo == installed)
832 /* multiversion is bad */
833 if (solv->multiversion.size && !solv->keepexplicitobsoletes)
835 FOR_RULELITERALS(p, jp, r)
836 if (MAPTST(&solv->multiversion, p))
844 FOR_RULELITERALS(p, jp, r)
848 queue_truncate(&iq, iqstart); /* abort */
851 if (pool->solvables[p].repo == installed)
853 if (iq.count == iqstart)
857 for (i = iqstart; i < iq.count; i++)
858 if (iq.elements[i] == p)
860 queue_truncate(&iq, iqstart);
866 solver_intersect_obsoleted(solv, p, &iq, iqstart, &om);
867 if (iq.count == iqstart)
875 queue_init_clone(&iqcopy, &iq);
879 if (solv->cleandeps_updatepkgs)
880 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
881 queue_push(&iq, solv->cleandeps_updatepkgs->elements[i]);
885 queue_empty(&iq); /* just in case... */
887 /* clear userinstalled bit for the packages we really want to delete/update */
888 for (i = 0; i < iq.count; i++)
891 if (pool->solvables[p].repo != installed)
893 MAPCLR(&userinstalled, p - installed->start);
896 for (p = installed->start; p < installed->end; p++)
898 if (pool->solvables[p].repo != installed)
900 MAPSET(&installedm, p);
901 if (pool->considered && !MAPTST(pool->considered, p))
902 MAPSET(&userinstalled, p - installed->start); /* we may not remove those */
903 if (unneeded && !MAPTST(&userinstalled, p - installed->start))
907 MAPSET(&installedm, SYSTEMSOLVABLE);
908 MAPSET(&im, SYSTEMSOLVABLE);
910 if (!unneeded && solv->cleandeps_updatepkgs)
912 /* find update "seeds" */
913 queue_init(&updatepkgs_filtered);
914 find_update_seeds(solv, &updatepkgs_filtered, &userinstalled);
917 #ifdef CLEANDEPSDEBUG
918 printf("REMOVE PASS\n");
927 /* supplements pass */
928 for (ip = installed->start; ip < installed->end; ip++)
930 if (!MAPTST(&installedm, ip))
932 s = pool->solvables + ip;
935 if (!MAPTST(&im, ip))
937 if (MAPTST(&userinstalled, ip - installed->start))
939 supp = s->repo->idarraydata + s->supplements;
940 while ((sup = *supp++) != 0)
941 if (solver_dep_possible(solv, sup, &im))
945 supp = s->repo->idarraydata + s->supplements;
946 while ((sup = *supp++) != 0)
947 if (solver_dep_possible(solv, sup, &installedm) || (xsuppq.count && queue_contains(&xsuppq, sup)))
949 /* no longer supplemented, also erase */
950 int iqcount = iq.count;
951 /* pin packages, see comment above dep_pkgcheck */
952 dep_pkgcheck(solv, sup, &im, &iq);
953 for (i = iqcount; i < iq.count; i++)
955 Id pqp = iq.elements[i];
956 if (pool->solvables[pqp].repo == installed)
957 MAPSET(&userinstalled, pqp - installed->start);
959 queue_truncate(&iq, iqcount);
960 #ifdef CLEANDEPSDEBUG
961 printf("%s supplemented [%s]\n", pool_solvid2str(pool, ip), pool_dep2str(pool, sup));
968 break; /* no supplementing package found, we're done */
970 ip = queue_shift(&iq);
971 s = pool->solvables + ip;
972 if (!MAPTST(&im, ip))
974 if (!MAPTST(&installedm, ip))
976 if (s->repo == installed && MAPTST(&userinstalled, ip - installed->start))
979 #ifdef CLEANDEPSDEBUG
980 printf("removing %s\n", pool_solvable2str(pool, s));
984 reqp = s->repo->idarraydata + s->requires;
985 while ((req = *reqp++) != 0)
987 if (req == SOLVABLE_PREREQMARKER)
989 #ifdef ENABLE_COMPLEX_DEPS
990 if (pool_is_complex_dep(pool, req))
992 complex_cleandeps_remove(pool, ip, req, &im, &installedm, &iq);
996 FOR_PROVIDES(p, pp, req)
998 if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
1000 #ifdef CLEANDEPSDEBUG
1001 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
1010 reqp = s->repo->idarraydata + s->recommends;
1011 while ((req = *reqp++) != 0)
1013 #ifdef ENABLE_COMPLEX_DEPS
1014 if (pool_is_complex_dep(pool, req))
1016 complex_cleandeps_remove(pool, ip, req, &im, &installedm, &iq);
1020 FOR_PROVIDES(p, pp, req)
1022 if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
1024 #ifdef CLEANDEPSDEBUG
1025 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
1034 /* turn userinstalled into remove set for pruning */
1035 map_empty(&userinstalled);
1036 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
1038 r = solv->rules + rid;
1039 if (r->p >= 0 || r->d != 0 || r->w2 != 0)
1040 continue; /* disabled or not erase */
1043 if (pool->solvables[p].repo == installed)
1044 MAPSET(&userinstalled, p - installed->start);
1046 if (!unneeded && solv->cleandeps_updatepkgs)
1048 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
1050 p = solv->cleandeps_updatepkgs->elements[i];
1051 if (pool->solvables[p].repo == installed)
1052 MAPSET(&userinstalled, p - installed->start);
1055 MAPSET(&im, SYSTEMSOLVABLE); /* in case we cleared it above */
1056 for (p = installed->start; p < installed->end; p++)
1059 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
1061 r = solv->rules + rid;
1064 FOR_RULELITERALS(p, jp, r)
1068 /* also put directly addressed packages on the install queue
1069 * so we can mark patterns as installed */
1070 for (i = 0; i < job->count; i += 2)
1072 how = job->elements[i];
1073 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
1075 what = job->elements[i + 1];
1076 select = how & SOLVER_SELECTMASK;
1077 if (select == SOLVER_SOLVABLE && pool->solvables[what].repo != installed)
1078 queue_push(&iq, what);
1082 #ifdef CLEANDEPSDEBUG
1083 printf("ADDBACK PASS\n");
1089 /* supplements pass */
1090 for (ip = installed->start; ip < installed->end; ip++)
1092 if (!MAPTST(&installedm, ip))
1094 if (MAPTST(&userinstalled, ip - installed->start))
1096 s = pool->solvables + ip;
1097 if (!s->supplements)
1099 if (MAPTST(&im, ip))
1101 supp = s->repo->idarraydata + s->supplements;
1102 while ((sup = *supp++) != 0)
1103 if (solver_dep_possible(solv, sup, &im))
1107 #ifdef CLEANDEPSDEBUG
1108 printf("%s supplemented\n", pool_solvid2str(pool, ip));
1111 queue_push(&iq, ip);
1117 ip = queue_shift(&iq);
1118 s = pool->solvables + ip;
1119 #ifdef CLEANDEPSDEBUG
1120 printf("adding back %s\n", pool_solvable2str(pool, s));
1122 if (s->repo == installed && pool->implicitobsoleteusescolors)
1124 unsigned int a, bestscore = 0;
1125 FOR_PROVIDES(p, pp, s->name)
1127 Solvable *ps = pool->solvables + p;
1128 if (ps->name != s->name || ps->repo == installed)
1130 a = pool_arch2score(pool, ps->arch);
1131 if (a && a != 1 && (!bestscore || a < bestscore))
1134 if (bestscore && pool_arch2score(pool, s->arch) != bestscore)
1136 FOR_PROVIDES(p, pp, s->name)
1138 Solvable *ps = pool->solvables + p;
1139 if (ps->repo == installed && ps->name == s->name && ps->evr == s->evr && ps->arch != s->arch && pool_arch2score(pool, ps->arch) == bestscore)
1140 if (!MAPTST(&im, p))
1142 #ifdef CLEANDEPSDEBUG
1143 printf("%s lockstep %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
1153 reqp = s->repo->idarraydata + s->requires;
1154 while ((req = *reqp++) != 0)
1156 #ifdef ENABLE_COMPLEX_DEPS
1157 if (pool_is_complex_dep(pool, req))
1159 complex_cleandeps_addback(pool, ip, req, &im, &installedm, &iq, &userinstalled);
1163 FOR_PROVIDES(p, pp, req)
1168 FOR_PROVIDES(p, pp, req)
1172 if (MAPTST(&installedm, p))
1176 if (MAPTST(&userinstalled, p - installed->start))
1178 #ifdef CLEANDEPSDEBUG
1179 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
1189 reqp = s->repo->idarraydata + s->recommends;
1190 while ((req = *reqp++) != 0)
1192 #ifdef ENABLE_COMPLEX_DEPS
1193 if (pool_is_complex_dep(pool, req))
1195 complex_cleandeps_addback(pool, ip, req, &im, &installedm, &iq, &userinstalled);
1199 FOR_PROVIDES(p, pp, req)
1204 FOR_PROVIDES(p, pp, req)
1208 if (MAPTST(&installedm, p))
1212 if (MAPTST(&userinstalled, p - installed->start))
1214 #ifdef CLEANDEPSDEBUG
1215 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
1226 /* make sure the updatepkgs and mistakes are not in the cleandeps map */
1227 if (!unneeded && solv->cleandeps_updatepkgs)
1229 for (i = 0; i < updatepkgs_filtered.count; i++)
1230 MAPSET(&im, updatepkgs_filtered.elements[i]);
1231 queue_free(&updatepkgs_filtered);
1233 if (solv->cleandeps_mistakes)
1234 for (i = 0; i < solv->cleandeps_mistakes->count; i++)
1235 MAPSET(&im, solv->cleandeps_mistakes->elements[i]);
1236 /* also remove original iq packages */
1237 for (i = 0; i < iqcopy.count; i++)
1238 MAPSET(&im, iqcopy.elements[i]);
1239 queue_free(&iqcopy);
1240 for (p = installed->start; p < installed->end; p++)
1242 if (pool->solvables[p].repo != installed)
1244 if (pool->considered && !MAPTST(pool->considered, p))
1246 if (!MAPTST(&im, p))
1247 MAPSET(cleandepsmap, p - installed->start);
1250 map_free(&installedm);
1251 map_free(&userinstalled);
1252 queue_free(&xsuppq);
1253 #ifdef CLEANDEPSDEBUG
1254 printf("=== final cleandeps map:\n");
1255 for (p = installed->start; p < installed->end; p++)
1256 if (MAPTST(cleandepsmap, p - installed->start))
1257 printf(" - %s\n", pool_solvid2str(pool, p));
1262 solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered)
1264 Repo *installed = solv->installed;
1268 queue_empty(unneededq);
1269 if (!installed || installed->end == installed->start)
1272 map_init(&cleandepsmap, installed->end - installed->start);
1273 solver_createcleandepsmap(solv, &cleandepsmap, 1);
1274 for (i = installed->start; i < installed->end; i++)
1275 if (MAPTST(&cleandepsmap, i - installed->start))
1276 queue_push(unneededq, i);
1279 filter_unneeded(solv, unneededq, &cleandepsmap, 0);
1280 map_free(&cleandepsmap);
1284 add_cleandeps_mistake(Solver *solv, Id p)
1286 if (!solv->cleandeps_mistakes)
1288 solv->cleandeps_mistakes = solv_calloc(1, sizeof(Queue));
1289 queue_init(solv->cleandeps_mistakes);
1291 queue_push(solv->cleandeps_mistakes, p);
1292 MAPCLR(&solv->cleandepsmap, p - solv->installed->start);
1293 solver_reenablepolicyrules_cleandeps(solv, p);
1297 cleandeps_rule_is_true(Solver *solv, Rule *r)
1299 Pool *pool = solv->pool;
1301 FOR_RULELITERALS(p, pp, r)
1302 if (p > 0 && solv->decisionmap[p] > 0)
1308 solver_check_cleandeps_mistakes(Solver *solv)
1310 Pool *pool = solv->pool;
1311 Repo *installed = solv->installed;
1314 int mademistake = 0;
1316 if (!solv->cleandepsmap.size || !installed)
1318 /* check for mistakes */
1319 policy_update_recommendsmap(solv);
1320 for (i = installed->start; i < installed->end; i++)
1322 if (pool->solvables[i].repo != installed)
1324 if (solv->decisionmap[i] > 0)
1327 Solvable *s = pool->solvables + i;
1328 /* kept package, check requires. we need to do this for things like requires(pre) */
1329 reqp = s->repo->idarraydata + s->requires;
1330 while ((req = *reqp++) != 0)
1333 FOR_PROVIDES(p2, pp2, req)
1335 if (pool->solvables[p2].repo != installed)
1337 if (p2 == i || solv->decisionmap[p2] > 0)
1339 if (!MAPTST(&solv->cleandepsmap, p2 - installed->start))
1341 POOL_DEBUG(SOLV_DEBUG_SOLVER, "cleandeps requires mistake: %s %s %s\n", pool_solvid2str(pool, i), pool_dep2str(pool, req), pool_solvid2str(pool, p2));
1342 add_cleandeps_mistake(solv, p2);
1347 if (!MAPTST(&solv->cleandepsmap, i - installed->start))
1349 /* a mistake is when the featurerule is true but the updaterule is false */
1350 fr = solv->rules + solv->featurerules + (i - installed->start);
1352 fr = solv->rules + solv->updaterules + (i - installed->start);
1355 if (!cleandeps_rule_is_true(solv, fr))
1357 /* feature rule is not true, thus we cleandeps erased the package */
1358 /* check if the package is recommended/supplemented. if yes, we made a mistake. */
1359 if (!MAPTST(&solv->recommendsmap, i) && !solver_is_supplementing(solv, pool->solvables + i))
1360 continue; /* feature rule is not true */
1361 POOL_DEBUG(SOLV_DEBUG_SOLVER, "cleandeps recommends mistake: ");
1362 solver_printruleclass(solv, SOLV_DEBUG_SOLVER, fr);
1366 Rule *r = solv->rules + solv->updaterules + (i - installed->start);
1367 if (!r->p || r == fr || cleandeps_rule_is_true(solv, r))
1369 /* update rule is true, check best rules */
1370 if (!solv->bestrules_info)
1372 nj = solv->bestrules_end - solv->bestrules;
1373 for (j = solv->bestrules_up - solv->bestrules; j < nj; j++)
1374 if (solv->bestrules_info[j] == i)
1376 r = solv->rules + solv->bestrules + j;
1377 if (!cleandeps_rule_is_true(solv, r))
1383 POOL_DEBUG(SOLV_DEBUG_SOLVER, "cleandeps mistake: ");
1384 solver_printruleclass(solv, SOLV_DEBUG_SOLVER, r);
1385 POOL_DEBUG(SOLV_DEBUG_SOLVER, "feature rule: ");
1386 solver_printruleclass(solv, SOLV_DEBUG_SOLVER, fr);
1388 add_cleandeps_mistake(solv, i);