{
return pool->solvables + p;
}
+
extern const char *solvable2str(Pool *pool, Solvable *s);
static inline const char *solvid2str(Pool *pool, Id p)
{
repo = (Repo *)sat_calloc(1, sizeof(*repo));
pool->repos = (Repo **)sat_realloc2(pool->repos, pool->nrepos + 1, sizeof(Repo *));
pool->repos[pool->nrepos++] = repo;
+ repo->repoid = pool->nrepos;
repo->name = name ? strdup(name) : 0;
repo->pool = pool;
repo->start = pool->nsolvables;
if (i == pool->nrepos) /* repo not in pool, return */
return;
if (i < pool->nrepos - 1)
- memmove(pool->repos + i, pool->repos + i + 1, (pool->nrepos - 1 - i) * sizeof(Repo *));
+ {
+ memmove(pool->repos + i, pool->repos + i + 1, (pool->nrepos - 1 - i) * sizeof(Repo *));
+ /* fix repo ids */
+ for (; i < pool->nrepos - 1; i++)
+ pool->repos[i]->repoid = i + 1;
+ }
pool->nrepos--;
repo_freedata(repo);
}
typedef struct _Repo {
const char *name;
- struct _Pool *pool; /* pool containing repo data */
+ Id repoid; /* our id */
+ Pool *pool; /* pool containing repo data */
int start; /* start of this repo solvables within pool->solvables */
int end; /* last solvable + 1 of this repo */
pool_free_solvable_block(repo->pool, start, count, reuseids);
}
+static inline Repo *pool_id2repo(Pool *pool, Id repoid)
+{
+ return pool->repos[repoid - 1];
+}
+
#define FOR_REPO_SOLVABLES(r, p, s) \
for (p = (r)->start, s = (r)->pool->solvables + p; p < (r)->end; p++, s = (r)->pool->solvables + p) \
if (s->repo == (r))
switch (how & SOLVER_JOBMASK)
{
case SOLVER_DISTUPGRADE:
- if (what < 0 || what > pool->nrepos)
+ if (what <= 0 || what > pool->nrepos)
break;
- repo = pool->repos[what];
+ repo = pool_id2repo(pool, what);
FOR_REPO_SOLVABLES(repo, p, s)
{
MAPSET(&solv->dupmap, p);