llvm-project

History

Tobias Grosser 2784b0803a Check assert before the instruction that uses the assumption checked. I did not find a good test case, as the assert should generally hold in Polly. llvm-svn: 225582		2015-01-10 07:40:39 +00:00
..
autoconf	Drop Cloog support	2014-12-02 19:26:58 +00:00
cmake	Drop Cloog support	2014-12-02 19:26:58 +00:00
include	Make registerPollyPasses public	2015-01-06 20:40:33 +00:00
lib	Check assert before the instruction that uses the assumption checked.	2015-01-10 07:40:39 +00:00
test	Adjust test for the new 'distinct' metadata nodes	2015-01-09 08:10:36 +00:00
tools	Update the copyright credits -- Happy new year 2014!	2014-01-01 08:27:31 +00:00
utils	Update to the latest version of isl	2014-12-07 16:04:29 +00:00
www	todo: Remove some redundant topics	2015-01-07 21:28:44 +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	Drop Cloog support	2014-12-02 19:26:58 +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 Cloog support	2014-12-02 19:26:58 +00:00
README	Trivial change to the README, mainly to test commit access.	2012-10-09 04:59:42 +00:00
configure	Drop Cloog support	2014-12-02 19:26:58 +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.