hanchenye-llvm-project/polly
Tobias Grosser 2873645c51 Drop -polly-vectorizer-unroll-only option
This options was earlier used for experiments with the vectorizer, but to my
knowledge is not really used anymore. If anybody needs this, we can always
reintroduce this feature.

llvm-svn: 232934
2015-03-23 07:00:36 +00:00
..
autoconf Import isl(+imath) as an external library into Polly 2015-02-04 20:55:43 +00:00
cmake Import isl(+imath) as an external library into Polly 2015-02-04 20:55:43 +00:00
include Drop -polly-vectorizer-unroll-only option 2015-03-23 07:00:36 +00:00
lib Drop -polly-vectorizer-unroll-only option 2015-03-23 07:00:36 +00:00
test Drop -polly-vectorizer-unroll-only option 2015-03-23 07:00:36 +00:00
tools Ensure the functions in our GPURuntime are visible 2015-03-10 20:23:14 +00:00
utils Remove isl/cloog build scripts 2015-02-15 11:19:20 +00:00
www Format non-affine subregions news item 2015-02-28 14:48:15 +00:00
.arcconfig Added arcanist (arc) unit test support 2014-09-08 19:30:09 +00:00
.arclint Added arcanist linters and cleaned errors and warnings 2014-08-18 00:40:13 +00:00
.gitattributes
.gitignore Add test/lit.site.cfg to .gitignore 2014-09-07 15:03:30 +00:00
CMakeLists.txt Build the isl files as PIC 2015-02-04 21:56:28 +00:00
CREDITS.txt Add myself to the credits 2014-08-10 03:37:29 +00:00
LICENSE.txt Update the copyright credits -- Happy new year 2014! 2014-01-01 08:27:31 +00:00
Makefile
Makefile.common.in
Makefile.config.in Import isl(+imath) as an external library into Polly 2015-02-04 20:55:43 +00:00
README
configure Import isl(+imath) as an external library into Polly 2015-02-04 20:55:43 +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.