llvm-project

History

Tobias Grosser 084d8f7d4c ScopInfo: Store ScopStmt pointer in the domain Store a pointer to each ScopStmt in the isl_id associated with the space of its domain. This will later allow us to recover the statement during code generation with isl. llvm-svn: 157607		2012-05-29 09:29:44 +00:00
..
autoconf	add a check for ISL codegen at configure time	2012-05-07 16:20:07 +00:00
cmake	add a check for ISL codegen at configure time	2012-05-07 16:20:07 +00:00
docs	Add initial version of Polly	2011-04-29 06:27:02 +00:00
include	Move executeScopConditionally() into its own file	2012-05-29 09:11:54 +00:00
lib	ScopInfo: Store ScopStmt pointer in the domain	2012-05-29 09:29:44 +00:00
test	ScopInfo: Add parameter bounds to context	2012-05-22 10:47:27 +00:00
tools	Add initial version of Polly	2011-04-29 06:27:02 +00:00
utils	ScopInfo: Add parameter bounds to context	2012-05-22 10:47:27 +00:00
www	WWW: Adapt the vectorize option change.	2012-05-06 10:22:57 +00:00
CMakeLists.txt	compile cloog code only when CLOOG_FOUND is set	2012-05-04 20:30:03 +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	Add initial version of Polly	2011-04-29 06:27:02 +00:00
Makefile.config.in	add a check for ISL codegen at configure time	2012-05-07 16:20:07 +00:00
README	Remove some empty lines	2011-10-04 06:56:36 +00:00
configure	add a check for ISL codegen at configure time	2012-05-07 16:20:07 +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.