Based on pull request #391 by Aaron D. Marasco. Thanks!
if (!q.count)
{
queue_empty(selection);
+ queue_free(&q);
return;
}
queue_truncate(selection, 2);
selection->elements[0] = SOLVER_SOLVABLE | SOLVER_NOAUTOSET;
selection->elements[1] = q.elements[0];
}
+ queue_free(&q);
}
/* only supports simple rels plus REL_ARCH */
return 0;
}
+static void
+free_considered(Pool *pool)
+{
+ if (pool->considered)
+ {
+ map_free(pool->considered);
+ pool->considered = solv_free(pool->considered);
+ }
+}
+
int
main(int argc, char **argv)
{
solv = testcase_read(pool, fp, argv[optind], &job, &result, &resultflags);
if (!solv)
{
+ free_considered(pool);
pool_free(pool);
+ queue_free(&job);
exit(resultflags == 77 ? 77 : 1);
}
if (reusesolv)
}
if (reusesolv)
solver_free(reusesolv);
+ free_considered(pool);
pool_free(pool);
fclose(fp);
}