llvm-project

History

Tobias Grosser ae2d83ec41 Formatting: Break lines after binary operators such as '&&' assert(Condition && "Text"); -> assert(Condition && "Text); This aligns Polly with the style used in LLVM. llvm-svn: 171242		2012-12-29 23:57:18 +00:00
..
autoconf	'chmod -x' on files that do not need the executable bits	2012-12-29 15:09:03 +00:00
cmake	autoconf/cmake: Always require isl code generation.	2012-10-21 21:48:21 +00:00
docs	…
include	isl: vector code generation based on ISL ast	2012-12-18 07:46:13 +00:00
lib	Formatting: Break lines after binary operators such as '&&'	2012-12-29 23:57:18 +00:00
test	isl: vector code generation based on ISL ast	2012-12-18 07:46:13 +00:00
tools	Update libGPURuntime to be dual licensed under MIT and UIUC license.	2012-07-06 10:40:15 +00:00
utils	User isl sha commit id instead of the git tag	2012-12-04 21:54:37 +00:00
www	www: Add news to Polly website	2012-12-29 17:40:09 +00:00
CMakeLists.txt	cmake: Fix installation of include files	2012-11-28 10:12:21 +00:00
CREDITS.txt	(Test commit for polly)	2011-07-16 13:30:03 +00:00
LICENSE.txt	Happy new year 2012!	2012-01-01 08:16:56 +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	do not require cloog from configure	2012-11-26 23:03:41 +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.