llvm-project

History

Tobias Grosser b5846f9e15 ScopDetect: Make foreachs 'const auto &' We mostly iterate over read-only values. Following a suggestion by Duncan P.N Exons Smith, we use the construct 'const auto &' for this. llvm-svn: 202651		2014-03-02 17:05:27 +00:00
..
autoconf	GMP is only required for CLooG	2014-02-22 02:15:39 +00:00
cmake	cmake: Do not link in system libs	2014-02-28 10:11:20 +00:00
docs	…
include	Use C++11 formatting	2014-03-02 17:05:21 +00:00
lib	ScopDetect: Make foreachs 'const auto &'	2014-03-02 17:05:27 +00:00
test	Dead code elimination: Schedule another approximative step before actual DCE	2014-02-24 08:52:20 +00:00
tools	Update the copyright credits -- Happy new year 2014!	2014-01-01 08:27:31 +00:00
utils	Update to isl 1b3ba3b72c0482fd36bf0b4a1186a259f7bafeed	2014-01-26 19:36:28 +00:00
www	www: Add FOSDEM presentation and Polly buildbots	2014-02-19 21:58:56 +00:00
.gitattributes	gitattributes: .png and .txt are no text files	2013-07-28 09:05:20 +00:00
CMakeLists.txt	Set CMAKE_INSTALL_RPATH_USE_LINK_PATH to true.	2014-02-22 13:28:31 +00:00
CREDITS.txt	(Test commit for polly)	2011-07-16 13:30:03 +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	'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	GMP is only required for CLooG	2014-02-22 02:15:39 +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.