From 5cdc5fc56539695f2183307321974d50bbd0f138 Mon Sep 17 00:00:00 2001 From: Sven Verdoolaege Date: Tue, 3 Feb 2009 21:41:40 +0100 Subject: [PATCH] isl_map_from_quast: don't throw away any bottom leaves Before, we would perform an "optimization" that would simply discard any leaves with a bottom when we hadn't seen any leaves with a solution yet, the intention being that we don't need to collect bottom leaves if there are no solutions. However, the bottom leaves may precede solution leaves and then we would erroneously discard them. --- isl_map_piplib.c | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/isl_map_piplib.c b/isl_map_piplib.c index 0c9a113..257b460 100644 --- a/isl_map_piplib.c +++ b/isl_map_piplib.c @@ -224,8 +224,7 @@ static struct isl_map *scan_quast_r(struct scan_data *data, PipQuast *q, map = isl_map_add(map, isl_basic_map_copy(bmap)); if (isl_basic_map_free_equality(bmap, n_out)) goto error; - } else if (map->n && data->rest) { - /* not interested in rest if no sol */ + } else if (data->rest) { struct isl_basic_set *bset; bset = isl_basic_set_from_basic_map(isl_basic_map_copy(bmap)); bset = isl_basic_set_drop_dims(bset, n_in, n_out); -- 2.7.4