llvm-project

History

Raghesh Aloor ea6c99c1d9 Memaccess: Removing some unwanted code llvm-svn: 148100		2012-01-13 06:02:13 +00:00
..
autoconf	configure: Add gmp_inc when checking for CLooG	2011-10-04 06:55:03 +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	Support non-affine access functions in Polly.	2011-12-20 10:43:14 +00:00
lib	Memaccess: Removing some unwanted code	2012-01-13 06:02:13 +00:00
test	Support non-affine access functions in Polly.	2011-12-20 10:43:14 +00:00
tools	Add initial version of Polly	2011-04-29 06:27:02 +00:00
utils	Update isl	2011-12-14 08:58:36 +00:00
www	add polly.sh script	2012-01-04 20:11:18 +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	Happy new year 2012!	2012-01-01 08:16:56 +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	Remove some empty lines	2011-10-04 06:56:36 +00:00
configure	configure: Add gmp_inc when checking for CLooG	2011-10-04 06:55:03 +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.