hanchenye-llvm-project/polly
Tobias Grosser c28ae257c0 TODO: Polly can handle boolean expressions (Open->Done)
The necessary support was committed by Johannes in r249971.

llvm-svn: 256826
2016-01-05 11:48:59 +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 IslExprBuilder: Provide PointerLikeTypeTraits for isl_id 2015-12-30 20:11:48 +00:00
lib Do not store scalar accesses in InstructionToAccess 2015-12-22 23:25:11 +00:00
test Add option to assume single-loop scops with sufficient compute are profitable 2015-12-21 21:00:43 +00:00
tools
utils Revise polly-{update|check}-format targets 2015-09-14 16:59:50 +00:00
www TODO: Polly can handle boolean expressions (Open->Done) 2016-01-05 11:48:59 +00:00
.arcconfig
.arclint
.gitattributes
.gitignore
CMakeLists.txt Add -sort-includes to our automatic source code formatting 2015-10-15 12:18:37 +00:00
CREDITS.txt
LICENSE.txt
Makefile
Makefile.common.in
Makefile.config.in
README
configure

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.