llvm-project

History

Tobias Grosser 6121eb346f www: Add link to buildbot into main menu llvm-svn: 135387		2011-07-18 11:00:13 +00:00
..
autoconf	Add initial version of Polly	2011-04-29 06:27:02 +00:00
cmake	Add initial version of Polly	2011-04-29 06:27:02 +00:00
docs	Add initial version of Polly	2011-04-29 06:27:02 +00:00
include	Use llvm::*Type without const	2011-07-18 09:53:32 +00:00
lib	Use llvm::*Type without const	2011-07-18 09:53:32 +00:00
test	MemAccess: Reading Change in Access Function	2011-07-12 17:14:03 +00:00
tools	Add initial version of Polly	2011-04-29 06:27:02 +00:00
utils	pollycc: Fix error message if PoCC/Pluto are not available	2011-07-06 18:04:59 +00:00
www	www: Add link to buildbot into main menu	2011-07-18 11:00:13 +00:00
CMakeLists.txt	Buildsystem: Add -no-rtti	2011-06-30 19:50:04 +00:00
CREDITS.txt	(Test commit for polly)	2011-07-16 13:30:03 +00:00
LICENSE.txt	Add initial version of Polly	2011-04-29 06:27:02 +00:00
Makefile	Add initial version of Polly	2011-04-29 06:27:02 +00:00
Makefile.common.in	Add initial version of Polly	2011-04-29 06:27:02 +00:00
Makefile.config.in	Buildsystem: Add -no-rtti	2011-06-30 19:50:04 +00:00
README	Add initial version of Polly	2011-04-29 06:27:02 +00:00
configure	Add initial version of Polly	2011-04-29 06:27:02 +00:00

README

Polly - Polyhedral optimizations for LLVM

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.