hanchenye-llvm-project/polly
Tobias Grosser e2c8275346 ScopInfo: Allow simple 'AddRec * Parameter' products in delinearization
We also allow such products for cases where 'Parameter' is loaded within the
scop, but where we can dynamically verify that the value of 'Parameter' remains
unchanged during the execution of the scop.

This change relies on Polly's new RequiredILS tracking infrastructure recently
contributed by Johannes.

llvm-svn: 250019
2015-10-12 08:02:30 +00:00
..
autoconf Generate gitversion.h in autoconf builds 2015-09-09 13:15:11 +00:00
cmake Compile ISL into its own library 2015-09-24 11:30:22 +00:00
include/polly Delete leftover function declaration 2015-10-12 05:14:03 +00:00
lib ScopInfo: Allow simple 'AddRec * Parameter' products in delinearization 2015-10-12 08:02:30 +00:00
test ScopInfo: Allow simple 'AddRec * Parameter' products in delinearization 2015-10-12 08:02:30 +00:00
tools Do not compile GPU library with sanitizers 2015-07-28 12:51:23 +00:00
utils Revise polly-{update|check}-format targets 2015-09-14 16:59:50 +00:00
www Mark a couple of issues as done 2015-09-24 14:30:14 +00:00
.arcconfig Adjusted arc linter config for modern version of arcanist 2015-08-12 09:01:16 +00:00
.arclint Adjusted arc linter config for modern version of arcanist 2015-08-12 09:01:16 +00:00
.gitattributes
.gitignore
CMakeLists.txt Compile ISL into its own library 2015-09-24 11:30:22 +00:00
CREDITS.txt
LICENSE.txt
Makefile
Makefile.common.in
Makefile.config.in Fix autotools build 2015-06-25 16:50:13 +00:00
README
configure Enable ISL's small integer optimization 2015-06-25 20:47:35 +00:00

README

Polly - Polyhedral optimizations for LLVM
-----------------------------------------
http://polly.llvm.org/

Polly uses a mathematical representation, the polyhedral model, to represent and
transform loops and other control flow structures. Using an abstract
representation it is possible to reason about transformations in a more general
way and to use highly optimized linear programming libraries to figure out the
optimal loop structure. These transformations can be used to do constant
propagation through arrays, remove dead loop iterations, optimize loops for
cache locality, optimize arrays, apply advanced automatic parallelization, drive
vectorization, or they can be used to do software pipelining.