llvm-project

History

Tobias Grosser 97d8745087 Dump YAML schedule tree as properly indented tree in DEBUG output llvm-svn: 238645		2015-05-30 06:46:59 +00:00
..
autoconf	Drop libpluto support	2015-03-30 17:54:01 +00:00
cmake	Drop libpluto support	2015-03-30 17:54:01 +00:00
include	Use value semantics for list of ScopStmt(s) instead of std::owningptr	2015-05-27 05:16:57 +00:00
lib	Dump YAML schedule tree as properly indented tree in DEBUG output	2015-05-30 06:46:59 +00:00
test	Exploit non-negative numerators	2015-05-29 17:08:19 +00:00
tools	Fix formatting issues in banner	2015-04-27 12:02:36 +00:00
utils	Rename 'scattering' to 'schedule'	2015-04-21 11:37:25 +00:00
www	Rename 'scattering' to 'schedule'	2015-04-21 11:37:25 +00:00
.arcconfig	Added arcanist (arc) unit test support	2014-09-08 19:30:09 +00:00
.arclint	Added arcanist linters and cleaned errors and warnings	2014-08-18 00:40:13 +00:00
.gitattributes	gitattributes: .png and .txt are no text files	2013-07-28 09:05:20 +00:00
.gitignore	Add test/lit.site.cfg to .gitignore	2014-09-07 15:03:30 +00:00
CMakeLists.txt	[cmake] Remove two unused include paths	2015-05-06 12:28:23 +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
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	Drop libpluto support	2015-03-30 17:54:01 +00:00
README	Trivial change to the README, mainly to test commit access.	2012-10-09 04:59:42 +00:00
configure	Drop libpluto support	2015-03-30 17:54:01 +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.