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 #include "repo_susetags.h"
24 #include "repo_rpmmd.h"
28 cookie_gzread(void *cookie, char *buf, size_t nbytes)
30 return gzread((gzFile *)cookie, buf, nbytes);
34 cookie_gzclose(void *cookie)
36 return gzclose((gzFile *)cookie);
40 myfopen(const char *fn)
42 cookie_io_functions_t cio;
48 suf = strrchr(fn, '.');
49 if (!suf || strcmp(suf, ".gz") != 0)
50 return fopen(fn, "r");
51 gzf = gzopen(fn, "r");
54 memset(&cio, 0, sizeof(cio));
55 cio.read = cookie_gzread;
56 cio.close = cookie_gzclose;
57 return fopencookie(gzf, "r", cio);
63 printf("Usage:\n%s: <arch> repo [--nocheck repo]...\n", argv[0]);
69 main(int argc, char **argv)
77 char *arch, *exclude_pat;
80 Id rpmid, rpmarch, rpmrel, archlock;
91 pool_setarch(pool, arch);
92 for (i = 2; i < argc; i++)
97 if (!strcmp(argv[i], "--nocheck"))
100 nocheck = pool->nsolvables;
103 if (!strcmp(argv[i], "--exclude"))
107 printf("--exclude needs a whitespace separated list of substrings as parameter\n");
110 exclude_pat = argv[i + 1];
115 if (!strcmp(argv[i], "-"))
117 else if ((fp = myfopen(argv[i])) == 0)
122 Repo *repo = repo_create(pool, argv[i]);
123 if (l >= 8 && !strcmp(argv[i] + l - 8, "packages"))
125 repo_add_susetags(repo, fp, 0, 0, 0);
127 else if (l >= 11 && !strcmp(argv[i] + l - 11, "packages.gz"))
129 repo_add_susetags(repo, fp, 0, 0, 0);
131 else if (l >= 14 && !strcmp(argv[i] + l - 14, "primary.xml.gz"))
133 repo_add_rpmmd(repo, fp, 0, 0);
135 else if (repo_add_solv(repo, fp))
137 fprintf(stderr, "could not add repo %s\n", argv[i]);
143 pool_addfileprovides(pool);
144 pool_createwhatprovides(pool);
145 rpmid = str2id(pool, "rpm", 0);
146 rpmarch = str2id(pool, arch, 0);
148 if (rpmid && rpmarch)
150 for (p = 1; p < pool->nsolvables; p++)
152 Solvable *s = pool->solvables + p;
153 if (s->name == rpmid && s->arch == rpmarch)
156 if (p < pool->nsolvables)
157 rpmrel = rel2id(pool, rpmid, rpmarch, REL_ARCH, 1);
163 queue_init(&archlocks);
164 for (p = 1; p < pool->nsolvables; p++)
166 Solvable *s = pool->solvables + p;
169 if (!pool_installable(pool, s))
171 if (rpmrel && s->arch != rpmarch)
174 FOR_PROVIDES(rp, rpp, s->name)
176 if (pool->solvables[rp].name != s->name)
178 if (pool->solvables[rp].arch == rpmarch)
183 queue_push(&archlocks, p);
187 queue_push(&cand, p);
192 archlock = pool_queuetowhatprovides(pool, &archlocks);
194 /* prune cand by doing weak installs */
197 solv = solver_create(pool);
199 for (i = 0; i < cand.count; i++)
201 p = cand.elements[i];
202 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_WEAK);
207 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE_NAME);
208 queue_push(&job, rpmrel);
212 queue_push(&job, SOLVER_LOCK|SOLVER_SOLVABLE_ONE_OF);
213 queue_push(&job, archlock);
215 solv->dontinstallrecommended = 1;
216 solver_solve(solv, &job);
218 for (i = j = 0; i < cand.count; i++)
220 p = cand.elements[i];
221 if (solv->decisionmap[p] <= 0)
223 cand.elements[j++] = p;
227 Solvable *s = pool->solvables + p;
228 if (!strcmp(id2str(pool, s->name), "libusb-compat-devel"))
230 cand.elements[j++] = p;
240 /* now check every candidate */
241 for (i = 0; i < cand.count; i++)
245 p = cand.elements[i];
246 if (nocheck && p >= nocheck)
250 char *ptr, *save = 0, *pattern;
252 pattern = strdup(exclude_pat);
254 for (ptr = strtok_r(pattern, " ", &save);
256 ptr = strtok_r(NULL, " ", &save))
258 if (*ptr && strstr(solvid2str(pool, p), ptr))
268 s = pool->solvables + p;
269 solv = solver_create(pool);
271 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE);
275 queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE_NAME);
276 queue_push(&job, rpmrel);
280 queue_push(&job, SOLVER_LOCK|SOLVER_SOLVABLE_ONE_OF);
281 queue_push(&job, archlock);
283 solv->dontinstallrecommended = 1;
284 solver_solve(solv, &job);
285 if (solv->problems.count)
291 printf("can't install %s:\n", solvable2str(pool, s));
292 while ((problem = solver_next_problem(solv, problem)) != 0)
294 solver_findallproblemrules(solv, problem, &rids);
295 for (j = 0; j < rids.count; j++)
297 Id probr = rids.elements[j];
302 solver_allruleinfos(solv, probr, &rinfo);
303 for (k = 0; k < rinfo.count; k += 4)
305 Id dep, source, target;
306 source = rinfo.elements[k + 1];
307 target = rinfo.elements[k + 2];
308 dep = rinfo.elements[k + 3];
309 switch (rinfo.elements[k])
311 case SOLVER_PROBLEM_DISTUPGRADE_RULE:
313 case SOLVER_PROBLEM_INFARCH_RULE:
314 s = pool_id2solvable(pool, source);
315 printf(" %s has inferior architecture\n", solvable2str(pool, s));
317 case SOLVER_PROBLEM_UPDATE_RULE:
319 case SOLVER_PROBLEM_JOB_RULE:
321 case SOLVER_PROBLEM_RPM_RULE:
322 printf(" some dependency problem\n");
324 case SOLVER_PROBLEM_JOB_NOTHING_PROVIDES_DEP:
325 printf(" nothing provides requested %s\n", dep2str(pool, dep));
327 case SOLVER_PROBLEM_NOT_INSTALLABLE:
328 s = pool_id2solvable(pool, source);
329 printf(" package %s is not installable\n", solvable2str(pool, s));
331 case SOLVER_PROBLEM_NOTHING_PROVIDES_DEP:
332 s = pool_id2solvable(pool, source);
333 printf(" nothing provides %s needed by %s\n", dep2str(pool, dep), solvable2str(pool, s));
336 Reldep *rd = GETRELDEP(pool, dep);
337 if (!ISRELDEP(rd->name))
340 FOR_PROVIDES(rp, rpp, rd->name)
341 printf(" (we have %s)\n", solvable2str(pool, pool->solvables + rp));
345 case SOLVER_PROBLEM_SAME_NAME:
346 s = pool_id2solvable(pool, source);
347 s2 = pool_id2solvable(pool, target);
348 printf(" cannot install both %s and %s\n", solvable2str(pool, s), solvable2str(pool, s2));
350 case SOLVER_PROBLEM_PACKAGE_CONFLICT:
351 s = pool_id2solvable(pool, source);
352 s2 = pool_id2solvable(pool, target);
353 printf(" package %s conflicts with %s provided by %s\n", solvable2str(pool, s), dep2str(pool, dep), solvable2str(pool, s2));
355 case SOLVER_PROBLEM_PACKAGE_OBSOLETES:
356 s = pool_id2solvable(pool, source);
357 s2 = pool_id2solvable(pool, target);
358 printf(" package %s obsoletes %s provided by %s\n", solvable2str(pool, s), dep2str(pool, dep), solvable2str(pool, s2));
360 case SOLVER_PROBLEM_DEP_PROVIDERS_NOT_INSTALLABLE:
361 s = pool_id2solvable(pool, source);
362 printf(" package %s requires %s, but none of the providers can be installed\n", solvable2str(pool, s), dep2str(pool, dep));
364 case SOLVER_PROBLEM_SELF_CONFLICT:
365 s = pool_id2solvable(pool, source);
366 printf(" package %s conflicts with %s provided by itself\n", solvable2str(pool, s), dep2str(pool, dep));
376 if (!strcmp(id2str(pool, s->name), "libusb-compat-devel"))
378 solver_printdecisions(solv);