llvm-project

History

Tobias Grosser 25e8ebe29d Drop explicit -polly-delinearize parameter Delinearization is now enabled by default and does not need to explicitly need to be enabled in our tests. llvm-svn: 264154		2016-03-23 13:21:02 +00:00
..
cmake	Compile ISL into its own library	2015-09-24 11:30:22 +00:00
docs	doxygen: Also show private members	2016-03-07 21:38:19 +00:00
include/polly	Invalidate scop on encountering a complex control flow	2016-03-22 22:05:32 +00:00
lib	Codegen:Do not invalidate dominator tree when bailing out during code generation	2016-03-23 06:57:51 +00:00
test	Drop explicit -polly-delinearize parameter	2016-03-23 13:21:02 +00:00
tools	Also clang-format *.c run-time library files	2016-03-08 07:34:58 +00:00
utils	Revise polly-{update\|check}-format targets	2015-09-14 16:59:50 +00:00
www	www: Drop one more </div>	2016-03-23 09:27:41 +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	Also clang-format *.c run-time library files	2016-03-08 07:34:58 +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.