| commit | 6b88a37d4a5d7351ea927bb755c0af6b3c793f08 | |
| author | Sven Verdoolaege <skimo@kotnet.org> | |
| Thu, 14 Feb 2013 20:27:10 +0000 (14 21:27 +0100) | ||
| committer | Sven Verdoolaege <skimo@kotnet.org> | |
| Wed, 18 Sep 2013 10:58:10 +0000 (18 12:58 +0200) | ||
| tree | 25546c68cac6de06e4b0402fa8d6c8114bb40c53 | treesnapshot (tar.gz zip) |
| parent | 2566aef997c3be8f3a733c782bd461c43f7e5145 | commitdiff |
isl_ast_build_expr.c: extract_modulo: consider additional cases
In particular, look for any constraints in the domain that are equal
or opposite to the div expression (modulo the denominator).
Looking for such constraints is fairly cheap and the constraint
expression is guaranteed to be non-negative over the domain.
This allows us to detect some modulos that are fairly "obvious"
from the point of view of a user. However, this will not catch
all "obvious" cases. In particular, the new heuristic will not
catch those cases where the div expression can be written as
the sum of two or more constraints (modulo the denominator).
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
In particular, look for any constraints in the domain that are equal
or opposite to the div expression (modulo the denominator).
Looking for such constraints is fairly cheap and the constraint
expression is guaranteed to be non-negative over the domain.
This allows us to detect some modulos that are fairly "obvious"
from the point of view of a user. However, this will not catch
all "obvious" cases. In particular, the new heuristic will not
catch those cases where the div expression can be written as
the sum of two or more constraints (modulo the denominator).
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
15 files changed: