#ifdef ENABLE_DEBIAN
#include "repo_deb.h"
#endif
+#ifdef ENABLE_ARCHREPO
+#include "repo_arch.h"
+#endif
#include "solver.h"
#include "solv_xfopen.h"
Queue job;
Queue rids;
Queue cand;
- Queue archlocks;
char *arch, *exclude_pat;
int i, j;
Id p;
- Id rpmid, rpmarch, rpmrel, archlock;
+ Id archid, noarchid;
+ Id rpmrel;
+#ifndef DEBIAN
+ Id rpmid;
+#endif
int status = 0;
int nocheck = 0;
int withsrc = 0;
int obsoletepkgcheck = 0;
exclude_pat = 0;
- archlock = 0;
if (argc < 3)
usage(argv);
arch = argv[1];
pool = pool_create();
pool_setarch(pool, arch);
+ noarchid = pool->solvables[SYSTEMSOLVABLE].arch;
for (i = 2; i < argc; i++)
{
FILE *fp;
r = repo_add_debpackages(repo, fp, 0);
}
#endif
+#ifdef ENABLE_ARCHREPO
+ else if (l >= 10 && (!strcmp(argv[i] + l - 10, ".db.tar.gz") || !strcmp(argv[i] + l - 10, ".db.tar.xz")))
+ {
+ r = repo_add_arch_repo(repo, fp, 0);
+ }
+#endif
else
r = repo_add_solv(repo, fp, 0);
if (r)
}
pool_addfileprovides(pool);
pool_createwhatprovides(pool);
+ archid = pool_str2id(pool, arch, 0);
+#ifndef DEBIAN
rpmid = pool_str2id(pool, "rpm", 0);
- rpmarch = pool_str2id(pool, arch, 0);
rpmrel = 0;
-#ifndef DEBIAN
- if (rpmid && rpmarch)
+ if (rpmid && archid)
{
for (p = 1; p < pool->nsolvables; p++)
{
Solvable *s = pool->solvables + p;
- if (s->name == rpmid && s->arch == rpmarch)
+ if (s->name == rpmid && s->arch == archid && pool_installable(pool, s))
break;
}
if (p < pool->nsolvables)
- rpmrel = pool_rel2id(pool, rpmid, rpmarch, REL_ARCH, 1);
+ rpmrel = pool_rel2id(pool, rpmid, archid, REL_ARCH, 1);
}
+#else
+ rpmrel = 0;
#endif
queue_init(&job);
queue_init(&rids);
queue_init(&cand);
- queue_init(&archlocks);
- for (p = 1; p < pool->nsolvables; p++)
+ for (p = 1; p < (nocheck ? nocheck : pool->nsolvables); p++)
{
Solvable *s = pool->solvables + p;
if (!s->repo)
}
if (!pool_installable(pool, s))
continue;
- if (rpmrel && s->arch != rpmarch)
+ if (archid && s->arch != archid && s->arch != noarchid)
{
+ /* check if we will conflict with a infarch rule, if yes,
+ * don't bother checking the package */
Id rp, rpp;
FOR_PROVIDES(rp, rpp, s->name)
{
if (pool->solvables[rp].name != s->name)
continue;
- if (pool->solvables[rp].arch == rpmarch)
+ if (pool->solvables[rp].arch == archid)
break;
}
if (rp)
- {
- queue_push(&archlocks, p);
- continue;
- }
+ continue;
}
queue_push(&cand, p);
}
-
- if (archlocks.count)
+ if (obsoletepkgcheck)
{
- archlock = pool_queuetowhatprovides(pool, &archlocks);
- }
-
+ int obsoleteusesprovides = pool_get_flag(pool, POOL_FLAG_OBSOLETEUSESPROVIDES);
+ int obsoleteusescolors = pool_get_flag(pool, POOL_FLAG_OBSOLETEUSESCOLORS);
- if (obsoletepkgcheck)
- for (i = 0; i < cand.count; i++)
- {
- Solvable *s;
- s = pool->solvables + cand.elements[i];
+ for (i = 0; i < cand.count; i++)
+ {
+ Solvable *s;
+ s = pool->solvables + cand.elements[i];
- if (s->obsoletes)
- {
- Id op, opp;
- Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
+ if (s->obsoletes)
+ {
+ Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
- while ((obs = *obsp++) != 0)
- {
- FOR_PROVIDES(op, opp, obs)
- {
- if (nocheck && op >= nocheck)
- continue;
+ while ((obs = *obsp++) != 0)
+ {
+ Id op, opp;
+ FOR_PROVIDES(op, opp, obs)
+ {
+ Solvable *os = pool->solvables + op;
+ if (nocheck && op >= nocheck)
+ continue;
+ if (solvable_identical(s, os))
+ continue;
+ if (!obsoleteusesprovides && !pool_match_nevr(pool, os, obs))
+ continue;
+ if (obsoleteusescolors && !pool_colormatch(pool, s, os))
+ continue;
+ status = 2;
+ printf("can't install %s:\n", pool_solvid2str(pool, op));
+ printf(" package is obsoleted by %s\n", pool_solvable2str(pool, s));
+ }
+ }
+ }
+ }
+ }
- if (!solvable_identical(s, pool_id2solvable(pool, op))
- && pool_match_nevr(pool, pool_id2solvable(pool, op), obs))
- {
- status = 2;
- printf("can't install %s:\n", pool_solvid2str(pool, op));
- printf(" package is obsoleted by %s\n", pool_solvable2str(pool, s));
- }
- }
- }
- }
- }
+ solv = solver_create(pool);
/* prune cand by doing weak installs */
while (cand.count)
{
- solv = solver_create(pool);
queue_empty(&job);
for (i = 0; i < cand.count; i++)
{
p = cand.elements[i];
- queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_WEAK);
- queue_push(&job, p);
+ queue_push2(&job, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_WEAK, p);
}
if (rpmrel)
- {
- queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE_NAME);
- queue_push(&job, rpmrel);
- }
- if (archlock)
- {
- queue_push(&job, SOLVER_LOCK|SOLVER_SOLVABLE_ONE_OF);
- queue_push(&job, archlock);
- }
+ queue_push2(&job, SOLVER_INSTALL|SOLVER_SOLVABLE_NAME, rpmrel);
solver_set_flag(solv, SOLVER_FLAG_IGNORE_RECOMMENDED, 1);
solver_solve(solv, &job);
/* prune... */
int problemcount;
p = cand.elements[i];
- if (nocheck && p >= nocheck)
- continue;
if (exclude_pat)
{
char *ptr, *save = 0, *pattern;
int match = 0;
- pattern = strdup(exclude_pat);
+ pattern = solv_strdup(exclude_pat);
for (ptr = strtok_r(pattern, " ", &save);
ptr;
break;
}
}
- free(pattern);
+ solv_free(pattern);
if (match)
continue;
}
s = pool->solvables + p;
- solv = solver_create(pool);
queue_empty(&job);
- queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE);
- queue_push(&job, p);
+ queue_push2(&job, SOLVER_INSTALL|SOLVER_SOLVABLE, p);
if (rpmrel)
- {
- queue_push(&job, SOLVER_INSTALL|SOLVER_SOLVABLE_NAME);
- queue_push(&job, rpmrel);
- }
- if (archlock)
- {
- queue_push(&job, SOLVER_LOCK|SOLVER_SOLVABLE_ONE_OF);
- queue_push(&job, archlock);
- }
+ queue_push2(&job, SOLVER_INSTALL|SOLVER_SOLVABLE_NAME, rpmrel);
solver_set_flag(solv, SOLVER_FLAG_IGNORE_RECOMMENDED, 1);
problemcount = solver_solve(solv, &job);
if (problemcount)
printf(" %s can not be updated\n", pool_solvable2str(pool, s));
break;
case SOLVER_RULE_JOB:
+ case SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM:
+ case SOLVER_RULE_JOB_UNKNOWN_PACKAGE:
+ case SOLVER_RULE_JOB_UNSUPPORTED:
break;
case SOLVER_RULE_RPM:
printf(" some dependency problem\n");
}
}
#endif
- solver_free(solv);
}
+ solver_free(solv);
exit(status);
}
projects / platform / upstream / libsolv.git / blobdiff