queuepushunique(&plist, p);
break;
case REL_NAMESPACE:
+#if 0
/* unknown namespace, just pass through */
pp = GET_PROVIDESP(evr, p);
while ((p = *pp++) != 0)
queuepush(&plist, p);
+#endif
break;
default:
break;
if (MAPTST(m, i))
continue;
s = pool->solvables + i;
+ if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
+ continue;
+ if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
+ continue;
sup = 0;
if ((supp = s->supplements) != 0)
{
continue;
if (dq.count > 1)
+ prune_to_recommended(solv, &dq);
+ if (dq.count > 1)
prune_best_version_arch(pool, &dq);
#if 0
s = pool->solvables + dq.elements[0];
s = pool->solvables + i;
if (!s->supplements && !s->freshens)
continue;
+ if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
+ continue;
+ if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
+ continue;
if ((supp = s->supplements) != 0)
{
while ((sup = *supp++) != 0)