maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly
History
Wei Mi eb14ac5396 Polly tests update contributed by Tobias Grosser for SCEV patch in r259736. 
llvm-svn: 259737
 		2016-02-04 01:34:28 +00:00
..
cmake Compile ISL into its own library 2015-09-24 11:30:22 +00:00
include/polly tScopInfo: Shorten comment slightly 2016-02-03 15:42:38 +00:00
lib Properly build shared libraries if LLVM_LINK_LLVM_DYLIB is enabled. 2016-02-03 16:29:04 +00:00
test Polly tests update contributed by Tobias Grosser for SCEV patch in r259736. 2016-02-04 01:34:28 +00:00
tools Remove autotools build system 2016-01-28 12:00:33 +00:00
utils Revise polly-{update|check}-format targets 2015-09-14 16:59:50 +00:00
www www: Simplify 'build & install' descriptions 2016-02-03 16:18:24 +00:00
.arcconfig Adjusted arc linter config for modern version of arcanist 2015-08-12 09:01:16 +00:00
.arclint Adjusted arc linter config for modern version of arcanist 2015-08-12 09:01:16 +00:00
.gitattributes gitattributes: .png and .txt are no text files 2013-07-28 09:05:20 +00:00
.gitignore Add git patch files to .gitignore 2015-06-23 20:55:01 +00:00
CMakeLists.txt Add -sort-includes to our automatic source code formatting 2015-10-15 12:18:37 +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
README Trivial change to the README, mainly to test commit access. 2012-10-09 04:59:42 +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.