hanchenye-llvm-project

History

Tobias Grosser 3081b0f5ec Update LoopInfo correctly When the Polly code generation was written we did not correctly update the LoopInfo data, but still claimed that the loop information is correct. This does not only lead to missed optimizations, but it can also cause miscompilations in case passes such as LoopSimplify are run after Polly. Reported-by: Sergei Larin <slarin@codeaurora.org> llvm-svn: 181987		2013-05-16 06:40:24 +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	LoopGenerators: Construct loops such that they are already loop rotated	2013-05-16 06:40:06 +00:00
lib	Update LoopInfo correctly	2013-05-16 06:40:24 +00:00
test	Update LoopInfo correctly	2013-05-16 06:40:24 +00:00
tools	Reformat with clang-format	2013-05-07 07:30:56 +00:00
utils	cmake: Add target to reformat with clang-format	2013-05-07 07:30:31 +00:00
www	Remove unneeded RegionSimplify pass.	2013-04-17 07:20:30 +00:00
CMakeLists.txt	cmake: Add target to reformat with clang-format	2013-05-07 07:30:31 +00:00
CREDITS.txt	(Test commit for polly)	2011-07-16 13:30:03 +00:00
LICENSE.txt	Update the copyright coredits -- Happy new year 2013!	2013-01-01 10:00:19 +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.