if (dq.count)
{
Map dqmap;
- int decisioncount;
+ int decisioncount = solv->decisionq.count;
if (dq.count == 1)
{
if (level <= olevel)
break;
}
- if (i < dqs.count)
+ if (i < dqs.count || solv->decisionq.count < decisioncount)
{
map_free(&dqmap);
continue;
/* install all recommended packages */
/* more work as we want to created branches if multiple
* choices are valid */
- decisioncount = solv->decisionq.count;
for (i = 0; i < decisioncount; i++)
{
Id rec, *recp, pp;