llvm-project/polly
Tobias Grosser 6a629c59ba Use isl_schedule_get_ctx
llvm-svn: 222560
2014-11-21 19:39:42 +00:00
..
autoconf Added arcanist linters and cleaned errors and warnings 2014-08-18 00:40:13 +00:00
cmake [Polly] Remove the PoCC and ScopLib support 2014-08-13 17:49:16 +00:00
docs
include Add OpenMP code generation to isl backend 2014-11-15 21:32:53 +00:00
lib Use isl_schedule_get_ctx 2014-11-21 19:39:42 +00:00
test Modify test cases to work with SCEV based code generation 2014-11-16 22:43:21 +00:00
tools Update the copyright credits -- Happy new year 2014! 2014-01-01 08:27:31 +00:00
utils Revert "Temporary disable formatting error" 2014-11-03 22:11:20 +00:00
www todo: We can support modifiable memory access functions 2014-11-19 16:31:33 +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 gitattributes: .png and .txt are no text files 2013-07-28 09:05:20 +00:00
.gitignore Add test/lit.site.cfg to .gitignore 2014-09-07 15:03:30 +00:00
CMakeLists.txt Added arcanist linters and cleaned errors and warnings 2014-08-18 00:40:13 +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 [Polly] Remove the PoCC and ScopLib support 2014-08-13 17:49:16 +00:00
README
configure [Polly] Remove the PoCC and ScopLib support 2014-08-13 17:49:16 +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.