The SCEV Validator is used to check if the bound of a loop can be translated
into a polyhedral constraint. The new validator is more general as the check
used previously and e.g. allows bounds like 'smax 1, %a'. At the moment, we
only allow signed comparisons. Also, the new validator is only used to verify
loop bounds. Memory accesses are still handled by the old validator.

llvm-svn: 143576

This is not needed anymore -> Reduce impact of SCEVAffFunc.

llvm-svn: 143575

This is reducing the impact of SCEVAffFunc

llvm-svn: 143574

llvm-svn: 143004

llvm-svn: 142768

-polly-detect-only=<functionname> allows to limit the scop detection to
a single function.

llvm-svn: 142750

Reported by: Yabin Hu <yabin.hwu@gmail.com>

llvm-svn: 142184

llvm-svn: 141461

llvm-svn: 141459

llvm-svn: 141458

llvm-svn: 141457

llvm-svn: 141455

- Use __isl_give and __isl_take
- Convert variables to start with Uppercase letter
- Only assign the 'domain' after it is fully constructed
- Only name it after it is fully constructed

llvm-svn: 141361

llvm-svn: 141325

Also take the chance and rename access functions to access relations. This is
because we do not only allow plain functions to describe an access, but we
can have any access relation that can be described with linear constraints.

llvm-svn: 141257

llvm-svn: 141256

llvm-svn: 141255

llvm-svn: 141254

llvm-svn: 141253

Use this to simplify some code.

llvm-svn: 141252

Polly should now be compiled with CLooG 0c252c88946b27b7b61a1a8d8fd7f94d2461dbfd
and isl 56b7d238929980e62218525b4b3be121af386edf. The most convenient way to
update is utils/checkout_cloog.sh.

llvm-svn: 141251

Due to the recent introduction of isl_id, parameters need now always to be
aligned. This was not yet taken care of in the code path of vectorization and
dependence analysis.

llvm-svn: 138555

llvm-svn: 138400

I am planning to eliminate the TempScopInfo pass. To simplify this I remove
some features that may later be added to the ScopInfo pass.

The interchange pass is currently strongly tested and furthermore ment to be
replaced by the general scheduling optimizer. Reductions itself can later
be added easily.

llvm-svn: 138219

Because of me not understanding the LLVM pass structure well, I did not find a
good way to allocate isl_ctx and to free it later without getting issues with
reference counting. I now found this place, such that we can free isl_ctx. This
patch also fixes the memory leaks that were ignored beforehand.

llvm-svn: 138204

llvm-svn: 138202

llvm-svn: 138155

This simplifies the code quite a bit.

llvm-svn: 138147

Until today, we compared two affine expressions by defining two maps describing
them, creating an union of those maps, adding constraints that do the comparison
and projecting out unneeded dimensions.

This was simplified to using the isl_pw_aff representation of the affine
expressions and using the relevant isl functions to compare them.

llvm-svn: 137932

At the moment, we still remove the ids after all data structures are created,
as later passes do not yet support ids. This limitation will be removed later.

llvm-svn: 137931

Do not use AffFunc to derive the affine expressions, but use isl_pw_aff to
analyze the original SCEV directly. This will allow several simplifications in
follow up patches, with the final goal of removing AffFunc completely.

llvm-svn: 137930

llvm-svn: 137929

llvm-svn: 137928

llvm-svn: 137927

Support for generating code for an access function change which is
a constant is added. 

llvm-svn: 137603

The changed access relations imported from JSCOP file is shown
as output of -analyze pass.

llvm-svn: 136774

Signed-off-by: Tobias Grosser <tobias@grosser.es>

llvm-svn: 136750

Signed-off-by: Tobias Grosser <tobias@grosser.es>
llvm-svn: 136749

This patch reads the change in access functions from
imported JSCOP file. A test case is also added.

llvm-svn: 134991

As we do not delete the SCoP, there is no need to remove it from the SCoP
detection.

llvm-svn: 131356