| commit | 59baf90d6930cd8661c36a6d4169fb50f41e86fe | |
| author | Sven Verdoolaege <skimo@kotnet.org> | |
| Wed, 13 Oct 2010 20:02:25 +0000 (13 22:02 +0200) | ||
| committer | Sven Verdoolaege <skimo@kotnet.org> | |
| Wed, 13 Oct 2010 20:03:10 +0000 (13 22:03 +0200) | ||
| tree | 85e63f993643d157d4d78f97052677432c86ceec | treesnapshot (tar.gz zip) |
| parent | e8f87cad7c6518bb1f973ae60b1424c1d03b9373 | commitdiff |
isl_map_coalesce: handle some cases of pairs of adjacent equalities
We don't want to handle all cases, because coalescing maps that
are too dissimilar may reduce the effectiveness of some decomposition
techniques during the computation of transitive closure.
Right now, we only perform such coalescing if there is exactly
one pair of adjacent equalities. It's not clear if this is the best
heuristic, but it makes all transitive closure test cases pass.
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
We don't want to handle all cases, because coalescing maps that
are too dissimilar may reduce the effectiveness of some decomposition
techniques during the computation of transitive closure.
Right now, we only perform such coalescing if there is exactly
one pair of adjacent equalities. It's not clear if this is the best
heuristic, but it makes all transitive closure test cases pass.
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
| isl_coalesce.c | diffblobblamehistory | |
| isl_test.c | diffblobblamehistory |