s = pool->solvables + i;
if ((obsp = s->obsoletes) == 0)
continue;
+ if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
+ continue;
+ if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
+ continue;
while ((obs = *obsp++) != 0)
FOR_PROVIDES(p, pp, obs)
{
s = pool->solvables + i;
if ((obsp = s->obsoletes) == 0)
continue;
+ if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
+ continue;
+ if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
+ continue;
while ((obs = *obsp++) != 0)
FOR_PROVIDES(p, pp, obs)
{