detect strides even if the remainder of the lower bound depends on outer iterators
commit814dcc193842e46aa7b5c7cb0e6ea7e70b091ffe
authorSven Verdoolaege <skimo@kotnet.org>
Sat, 14 Aug 2010 13:51:04 +0000 (14 15:51 +0200)
committerSven Verdoolaege <skimo@kotnet.org>
Sat, 14 Aug 2010 22:01:12 +0000 (15 00:01 +0200)
tree191ace582fc83819eee5a5439bfe60e4330250bb
parent146eae3a3a38a24ff6d2a8db1086b99b606f0b0c
detect strides even if the remainder of the lower bound depends on outer iterators

The original implementation of stride detection only works if the remainder
of the lower bound on division by a potential stride is a constant.
The new implementation allows this remainder to vary with each iteration
of the outer loop(s), while of course still remaining constant within
the same iteration of the outer loop(s).

Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
include/cloog/domain.h
include/cloog/stride.h
source/clast.c
source/isl/domain.c
source/loop.c
source/stride.c
test/reservoir/bastoul3.c