summaryrefslogtreecommitdiff
path: root/isl_map_piplib.c
diff options
context:
space:
mode:
authorSven Verdoolaege <skimo@kotnet.org>2009-02-03 21:41:40 +0100
committerSven Verdoolaege <skimo@kotnet.org>2009-02-04 12:38:43 +0100
commit5cdc5fc56539695f2183307321974d50bbd0f138 (patch)
treeba75f3f64c078d4f7fc40c57c2339bb59ce189b9 /isl_map_piplib.c
parentc9c4f446e9f40d07f76235d81c2b250e4ef94bd8 (diff)
downloadisl-5cdc5fc56539695f2183307321974d50bbd0f138.tar.gz
isl-5cdc5fc56539695f2183307321974d50bbd0f138.tar.bz2
isl-5cdc5fc56539695f2183307321974d50bbd0f138.zip
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.
Diffstat (limited to 'isl_map_piplib.c')
-rw-r--r--isl_map_piplib.c3
1 files changed, 1 insertions, 2 deletions
diff --git a/isl_map_piplib.c b/isl_map_piplib.c
index 0c9a1130..257b4607 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);