SYSTEMSOLVABLE
arch = pool->solvables[SYSTEMSOLVABLE].arch;
if (p == SYSTEMSOLVABLE)
return SYSTEMSOLVABLE;
pool->solvables[SYSTEMSOLVABLE].arch = pool->noarchid;
if (p == SYSTEMSOLVABLE)
whatprovidesdata[2] = SYSTEMSOLVABLE;
if (count == 1 && q->elements[0] == SYSTEMSOLVABLE)
s = pool->solvables + SYSTEMSOLVABLE;
queue_push(&plist, SYSTEMSOLVABLE);
queue_push(&plist, SYSTEMSOLVABLE);
if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
MAPCLR(&solv->dupinvolvedmap, SYSTEMSOLVABLE);
if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
if ((r->d == 0 || r->d == -1) && r->w2 == 0 && r->p == -SYSTEMSOLVABLE)
if (p != -SYSTEMSOLVABLE)
queue_push(q, -SYSTEMSOLVABLE); /* hmm, better to return an empty result? */
if (p == SYSTEMSOLVABLE || pool->solvables[p].repo == solv->installed)
MAPSET(&installedm, SYSTEMSOLVABLE);
MAPSET(&im, SYSTEMSOLVABLE);
if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
MAPSET(&im, SYSTEMSOLVABLE); /* in case we cleared it above */
if (buddy > 0 && buddy != SYSTEMSOLVABLE && buddy != n && buddy < pool->nsolvables)
if (*dp == SYSTEMSOLVABLE) /* always installed */
return -SYSTEMSOLVABLE; /* supported but not installable */
return -SYSTEMSOLVABLE;
if (j == 0 && p == -SYSTEMSOLVABLE && solv->dupmap_all)
else if (p != -SYSTEMSOLVABLE)
if (qs.count && p == -SYSTEMSOLVABLE)
if (p == SYSTEMSOLVABLE)
queue_push(&solv->decisionq, SYSTEMSOLVABLE);
solv->decisionmap[SYSTEMSOLVABLE] = 1; /* installed at level '1' */
MAPSET(&addedmap, SYSTEMSOLVABLE);
queue_push(&q, -SYSTEMSOLVABLE);
if (select == SOLVER_SOLVABLE_PROVIDES && !d && (p == SYSTEMSOLVABLE || p == -SYSTEMSOLVABLE) && ISRELDEP(what))
p = SYSTEMSOLVABLE;
if (v == -SYSTEMSOLVABLE)
*infop = SYSTEMSOLVABLE;
assert(v > 0 || v == -SYSTEMSOLVABLE);
if (p == SYSTEMSOLVABLE || (solv->installed && pool->solvables[p].repo == solv->installed))
if (n == SYSTEMSOLVABLE)
if (n == SYSTEMSOLVABLE)
if (p <= 0 || p == SYSTEMSOLVABLE)
MAPCLR(&trans->transactsmap, SYSTEMSOLVABLE);