maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly
History
Tobias Grosser ca7887d729 Another formatting fix 
llvm-svn: 198386
 		2014-01-03 00:56:20 +00:00
..
autoconf [autoconf/cmake] Make sure we detect the latest version of isl. 2013-07-02 14:11:32 +00:00
cmake [autoconf/cmake] Make sure we detect the latest version of isl. 2013-07-02 14:11:32 +00:00
docs
…
include Another formatting fix 2014-01-03 00:56:20 +00:00
lib Introduce -polly-canonicalize pass 2014-01-02 23:39:18 +00:00
test Report detected scops using the new diagnostics 2013-12-18 10:49:53 +00:00
tools Update the copyright credits -- Happy new year 2014! 2014-01-01 08:27:31 +00:00
utils Update isl to latest maintenance release 2013-12-07 11:58:06 +00:00
www Introduce -polly-canonicalize pass 2014-01-02 23:39:18 +00:00
.gitattributes gitattributes: .png and .txt are no text files 2013-07-28 09:05:20 +00:00
CMakeLists.txt cmake: Provide path to installed clang-format 2013-11-22 22:42:13 +00:00
CREDITS.txt (Test commit for polly) 2011-07-16 13:30:03 +00:00
LICENSE.txt Update the copyright credits -- Happy new year 2014! 2014-01-01 08:27:31 +00:00
Makefile Revert "Fix a bug introduced by r153739: We are not able to provide the correct" 2012-04-11 07:43:13 +00:00
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 'chmod -x' on files that do not need the executable bits 2012-12-29 15:09:03 +00:00
README Trivial change to the README, mainly to test commit access. 2012-10-09 04:59:42 +00:00
configure [autoconf/cmake] Make sure we detect the latest version of isl. 2013-07-02 14:11:32 +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.