hanchenye-llvm-project/polly
Tobias Grosser 72cebdec2e Add another hint for fixing check-polly errors to get_started.html
Reversed the order in which LD_LIBRARY_PATH is defined in order to make sure the
${CLOOG_INSTALL} prefix is found first.

Contributed-by: Christian Bielert <cib123@googlemail.com>
llvm-svn: 205556
2014-04-03 19:38:38 +00:00
..
autoconf GMP is only required for CLooG 2014-02-22 02:15:39 +00:00
cmake record in POLLY_LINK_LIBS all the libs needed for polly 2014-03-13 20:24:48 +00:00
docs
include Replace INVALID/INVALID_NOVERIFY with diagnostics. 2014-04-02 11:54:01 +00:00
lib Use explit types in foreach iterators 2014-04-02 20:18:19 +00:00
test Delete trivial PHI nodes (aka stack slot sharing) 2014-04-01 16:01:33 +00:00
tools Update the copyright credits -- Happy new year 2014! 2014-01-01 08:27:31 +00:00
utils Update CLooG and some test cases 2014-03-10 17:31:22 +00:00
www Add another hint for fixing check-polly errors to get_started.html 2014-04-03 19:38:38 +00:00
.gitattributes gitattributes: .png and .txt are no text files 2013-07-28 09:05:20 +00:00
CMakeLists.txt record in POLLY_LINK_LIBS all the libs needed for polly 2014-03-13 20:24:48 +00:00
CREDITS.txt
LICENSE.txt Update the copyright credits -- Happy new year 2014! 2014-01-01 08:27:31 +00:00
Makefile
Makefile.common.in 'chmod -x' on files that do not need the executable bits 2012-12-29 15:09:03 +00:00
Makefile.config.in autoconf: Add PLUTO_FOUND flag 2014-03-18 18:50:58 +00:00
README Trivial change to the README, mainly to test commit access. 2012-10-09 04:59:42 +00:00
configure GMP is only required for CLooG 2014-02-22 02:15:39 +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.