hanchenye-llvm-project/polly
Johannes Doerfert 21aa3dc014 [FIX] Move the statistic code to fix the build.
llvm-svn: 221038
2014-11-01 01:30:11 +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 Remove the LoopBounds from the TempScop class. 2014-11-01 01:14:56 +00:00
lib [FIX] Move the statistic code to fix the build. 2014-11-01 01:30:11 +00:00
test Change the RegionSet type to a SetVector 2014-10-22 20:39:07 +00:00
tools
utils Change the output of arc unit 2014-10-01 21:26:24 +00:00
www [www] Update formatting of news feed 2014-09-22 07:37:12 +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 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
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.