1 /* vim: sw=2 et cino=>4,n-2,{1s
5 * Copyright (c) 2009, Novell Inc.
7 * This program is licensed under the BSD license, read LICENSE.BSD
8 * for further information
22 #include "repo_solv.h"
23 #ifdef ENABLE_SUSEREPO
24 #include "repo_susetags.h"
27 #include "repo_rpmmd.h"
33 #include "solv_xfopen.h"
39 printf("Usage:\n%s: <arch> [options..] repo [--nocheck repo]...\n"
40 "\t--exclude <pattern>\twhitespace-separated list of (sub-)"
41 "packagenames to ignore\n"
42 "\t--withobsoletes\t\tCheck for obsoletes on packages contained in repos\n"
43 "\t--nocheck\t\tDo not warn about all following repos (only use them to fulfill dependencies)\n"
44 "\t--withsrc\t\tAlso check dependencies of src.rpm\n\n"
51 main(int argc, char **argv)
60 char *arch, *exclude_pat;
63 Id rpmarch, rpmrel, archlock;
70 int obsoletepkgcheck = 0;
79 pool_setarch(pool, arch);
80 for (i = 2; i < argc; i++)
85 if (!strcmp(argv[i], "--withsrc"))
90 if (!strcmp(argv[i], "--withobsoletes"))
95 if (!strcmp(argv[i], "--nocheck"))
98 nocheck = pool->nsolvables;
101 if (!strcmp(argv[i], "--exclude"))
105 printf("--exclude needs a whitespace separated list of substrings as parameter\n");
108 exclude_pat = argv[i + 1];
113 if (!strcmp(argv[i], "-"))
115 else if ((fp = solv_xfopen(argv[i], 0)) == 0)
120 repo = repo_create(pool, argv[i]);
125 #ifdef ENABLE_SUSEREPO
126 else if (l >= 8 && !strcmp(argv[i] + l - 8, "packages"))
128 r = repo_add_susetags(repo, fp, 0, 0, 0);
130 else if (l >= 11 && !strcmp(argv[i] + l - 11, "packages.gz"))
132 r = repo_add_susetags(repo, fp, 0, 0, 0);
136 else if (l >= 14 && !strcmp(argv[i] + l - 14, "primary.xml.gz"))
138 r = repo_add_rpmmd(repo, fp, 0, 0);
142 else if (l >= 8 && !strcmp(argv[i] + l - 8, "Packages"))
144 r = repo_add_debpackages(repo, fp, 0);
146 else if (l >= 11 && !strcmp(argv[i] + l - 11, "Packages.gz"))
148 r = repo_add_debpackages(repo, fp, 0);
152 r = repo_add_solv(repo, fp, 0);
155 fprintf(stderr, "could not add repo %s: %s\n", argv[i], pool_errstr(pool));
161 pool_addfileprovides(pool);
162 pool_createwhatprovides(pool);
164 rpmid = pool_str2id(pool, "rpm", 0);
165 rpmarch = pool_str2id(pool, arch, 0);
167 if (rpmid && rpmarch)
169 for (p = 1; p < pool->nsolvables; p++)
171 Solvable *s = pool->solvables + p;
172 if (s->name == rpmid && s->arch == rpmarch)
175 if (p < pool->nsolvables)
176 rpmrel = pool_rel2id(pool, rpmid, rpmarch, REL_ARCH, 1);
179 rpmrel = rpmarch = 0;
185 queue_init(&archlocks);
186 for (p = 1; p < pool->nsolvables; p++)
188 Solvable *s = pool->solvables + p;
191 if (withsrc && (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC))
193 queue_push(&cand, p);
196 if (!pool_installable(pool, s))
198 if (rpmrel && s->arch != rpmarch)
201 FOR_PROVIDES(rp, rpp, s->name)
203 if (pool->solvables[rp].name != s->name)
205 if (pool->solvables[rp].arch == rpmarch)
210 queue_push(&archlocks, p);
214 queue_push(&cand, p);
219 archlock = pool_queuetowhatprovides(pool, &archlocks);
223 if (obsoletepkgcheck)
224 for (i = 0; i < cand.count; i++)
227 s = pool->solvables + cand.elements[i];
232 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
234 while ((obs = *obsp++) != 0)
236 FOR_PROVIDES(op, opp, obs)
238 if (nocheck && op >= nocheck)
241 if (!solvable_identical(s, pool_id2solvable(pool, op))
242 && pool_match_nevr(pool, pool_id2solvable(pool, op), obs))
245 printf("can't install %s:\n", pool_solvid2str(pool, op));
246 printf(" package is obsoleted by %s\n", pool_solvable2str(pool, s));
253 solv = solver_create(pool);
255 /* prune cand by doing weak installs */
259 for (i = 0; i < cand.count; i++)
261 p = cand.elements[i];
262 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_WEAK);
267 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE_NAME);
268 queue_push(&job, rpmrel);
272 queue_push(&job, SOLVER_LOCK|SOLVER_SOLVABLE_ONE_OF);
273 queue_push(&job, archlock);
275 solver_set_flag(solv, SOLVER_FLAG_IGNORE_RECOMMENDED, 1);
276 solver_solve(solv, &job);
278 for (i = j = 0; i < cand.count; i++)
280 p = cand.elements[i];
281 if (solver_get_decisionlevel(solv, p) <= 0)
283 cand.elements[j++] = p;
287 Solvable *s = pool->solvables + p;
288 if (!strcmp(pool_id2str(pool, s->name), "libusb-compat-devel"))
290 cand.elements[j++] = p;
300 /* now check every candidate */
301 for (i = 0; i < cand.count; i++)
306 p = cand.elements[i];
307 if (nocheck && p >= nocheck)
311 char *ptr, *save = 0, *pattern;
313 pattern = strdup(exclude_pat);
315 for (ptr = strtok_r(pattern, " ", &save);
317 ptr = strtok_r(NULL, " ", &save))
319 if (*ptr && strstr(pool_solvid2str(pool, p), ptr))
329 s = pool->solvables + p;
331 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE);
335 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE_NAME);
336 queue_push(&job, rpmrel);
340 queue_push(&job, SOLVER_LOCK|SOLVER_SOLVABLE_ONE_OF);
341 queue_push(&job, archlock);
343 solver_set_flag(solv, SOLVER_FLAG_IGNORE_RECOMMENDED, 1);
344 problemcount = solver_solve(solv, &job);
351 printf("can't install %s:\n", pool_solvable2str(pool, s));
352 while ((problem = solver_next_problem(solv, problem)) != 0)
354 solver_findallproblemrules(solv, problem, &rids);
355 for (j = 0; j < rids.count; j++)
357 Id probr = rids.elements[j];
362 solver_allruleinfos(solv, probr, &rinfo);
363 for (k = 0; k < rinfo.count; k += 4)
365 Id dep, source, target;
366 source = rinfo.elements[k + 1];
367 target = rinfo.elements[k + 2];
368 dep = rinfo.elements[k + 3];
369 switch (rinfo.elements[k])
371 case SOLVER_RULE_DISTUPGRADE:
373 case SOLVER_RULE_INFARCH:
374 s = pool_id2solvable(pool, source);
375 printf(" %s has inferior architecture\n", pool_solvable2str(pool, s));
377 case SOLVER_RULE_UPDATE:
378 s = pool_id2solvable(pool, source);
379 printf(" %s can not be updated\n", pool_solvable2str(pool, s));
381 case SOLVER_RULE_JOB:
382 case SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM:
384 case SOLVER_RULE_RPM:
385 printf(" some dependency problem\n");
387 case SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP:
388 printf(" nothing provides requested %s\n", pool_dep2str(pool, dep));
390 case SOLVER_RULE_RPM_NOT_INSTALLABLE:
391 s = pool_id2solvable(pool, source);
392 printf(" package %s is not installable\n", pool_solvable2str(pool, s));
394 case SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP:
395 s = pool_id2solvable(pool, source);
396 printf(" nothing provides %s needed by %s\n", pool_dep2str(pool, dep), pool_solvable2str(pool, s));
399 Reldep *rd = GETRELDEP(pool, dep);
400 if (!ISRELDEP(rd->name))
403 FOR_PROVIDES(rp, rpp, rd->name)
404 printf(" (we have %s)\n", pool_solvable2str(pool, pool->solvables + rp));
408 case SOLVER_RULE_RPM_SAME_NAME:
409 s = pool_id2solvable(pool, source);
410 s2 = pool_id2solvable(pool, target);
411 printf(" cannot install both %s and %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, s2));
413 case SOLVER_RULE_RPM_PACKAGE_CONFLICT:
414 s = pool_id2solvable(pool, source);
415 s2 = pool_id2solvable(pool, target);
416 printf(" package %s conflicts with %s provided by %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, dep), pool_solvable2str(pool, s2));
418 case SOLVER_RULE_RPM_PACKAGE_OBSOLETES:
419 s = pool_id2solvable(pool, source);
420 s2 = pool_id2solvable(pool, target);
421 printf(" package %s obsoletes %s provided by %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, dep), pool_solvable2str(pool, s2));
423 case SOLVER_RULE_RPM_PACKAGE_REQUIRES:
424 s = pool_id2solvable(pool, source);
425 printf(" package %s requires %s, but none of the providers can be installed\n", pool_solvable2str(pool, s), pool_dep2str(pool, dep));
427 case SOLVER_RULE_RPM_SELF_CONFLICT:
428 s = pool_id2solvable(pool, source);
429 printf(" package %s conflicts with %s provided by itself\n", pool_solvable2str(pool, s), pool_dep2str(pool, dep));
439 if (!strcmp(pool_id2str(pool, s->name), "libusb-compat-devel"))
441 solver_printdecisions(solv);