if (pool->solvables[best].evr != s->evr) /* compare evr */
{
- if (evrcmp(pool, pool->solvables[best].evr, s->evr, EVRCMP_MATCH_RELEASE) < 0)
+ if (evrcmp(pool, pool->solvables[best].evr, s->evr, EVRCMP_COMPARE) < 0)
best = plist->elements[i];
}
}
ps = pool->solvables + p;
if (s->name == ps->name) /* name match */
{
- if (!allow_all && !solv->allowdowngrade && evrcmp(pool, s->evr, ps->evr, EVRCMP_MATCH_RELEASE) > 0)
+ if (!allow_all && !solv->allowdowngrade && evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
continue;
}
else if (!solv->noupdateprovide && ps->obsoletes) /* provides/obsoletes combination ? */
if (analyze_unsolvable(solv, r, disablerules))
continue;
queue_free(&dq);
+ queue_free(&dqs);
return;
}
}
if (level == 0)
{
queue_free(&dq);
+ queue_free(&dqs);
return;
}
if (level <= olevel)
if (level == 0) /* unsolvable */
{
queue_free(&dq);
+ queue_free(&dqs);
return;
}
if (level <= olevel)
if (level == 0)
{
queue_free(&dq);
+ queue_free(&dqs);
return;
}
if (level <= olevel)
if (level == 0)
{
queue_free(&dq);
+ queue_free(&dqs);
return;
}
if (level <= olevel)
if (level == 0)
{
queue_free(&dq);
+ queue_free(&dqs);
return;
}
if (level <= olevel)
if (level == 0)
{
queue_free(&dq);
+ queue_free(&dqs);
return;
}
if (level < systemlevel)
if (level == 0)
{
queue_free(&dq);
+ queue_free(&dqs);
return;
}
continue;
if (level == 0)
{
queue_free(&dq);
+ queue_free(&dqs);
return;
}
continue;