if (a && a != 1 && (!bestscore || a < bestscore))
bestscore = a;
}
+ if (!bestscore)
+ return;
for (i = j = 0; i < plist->count; i++)
{
s = pool->solvables + plist->elements[i];
}
+/* check if there is an illegal architecture change if
+ * installed solvable s1 is replaced by s2 */
int
policy_illegal_archchange(Solver *solv, Solvable *s1, Solvable *s2)
{
return 0;
}
+/* check if there is an illegal vendor change if
+ * installed solvable s1 is replaced by s2 */
int
policy_illegal_vendorchange(Solver *solv, Solvable *s1, Solvable *s2)
{
}
if (!(ignore & POLICY_ILLEGAL_ARCHCHANGE) && !solv->allowarchchange)
{
- if (is->arch != s->arch && policy_illegal_archchange(solv, s, is))
+ if (is->arch != s->arch && policy_illegal_archchange(solv, is, s))
ret |= POLICY_ILLEGAL_ARCHCHANGE;
}
if (!(ignore & POLICY_ILLEGAL_VENDORCHANGE) && !solv->allowvendorchange)
{
- if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, s, is))
+ if (is->vendor != s->vendor && policy_illegal_vendorchange(solv, is, s))
ret |= POLICY_ILLEGAL_VENDORCHANGE;
}
return ret;
/*
* find update candidates
*
- * s: solvable to be updated
+ * s: installed solvable to be updated
* qs: [out] queue to hold Ids of candidates
* allow_all: 0 = dont allow downgrades, 1 = allow all candidates
*
return solv->updateCandidateCb(solv->pool, s, qs);
}
- /*
- * s = solvable ptr
- * n = solvable Id
- */
n = s - pool->solvables;
/*