llvm-project

History

Tobias Grosser 9b34a08b19 [isl C++ bindings] Add explicit const casts for foreach bindings This avoids a compiler warning about lost 'const' attributes. Suggested-by: Michael Kruse <llvm@meinersbur.de> llvm-svn: 301108		2017-04-23 07:54:12 +00:00
..
cmake	[Cmake] Generate a PollyConfig.cmake.	2017-03-09 17:58:20 +00:00
docs	Porting the example illustrating Polly from HTML to reStructuredText	2017-02-10 11:46:57 +00:00
include/polly	GICHelper: remove forgotten isl foreach declarations	2017-04-21 10:50:33 +00:00
lib	[isl C++ bindings] Add explicit const casts for foreach bindings	2017-04-23 07:54:12 +00:00
test	[CMake] Fix polly-isl-test execution in out-of-LLVM-tree builds.	2017-04-22 23:02:53 +00:00
tools	GPURuntime: ensure compilation with C99	2016-09-11 07:32:50 +00:00
unittests	[CMake] Fix unittests in out-of-LLVM-tree builds.	2017-04-22 23:02:46 +00:00
utils	Revise polly-{update\|check}-format targets	2015-09-14 16:59:50 +00:00
www	Add two Polly images	2017-04-05 11:50:31 +00:00
.arcconfig	Upgrade all the .arcconfigs to https.	2016-07-14 13:15:37 +00:00
.arclint	[External] Move lib/JSON to lib/External/JSON. NFC.	2017-02-05 15:26:56 +00:00
.gitattributes	…
.gitignore	Do not track the isl PDF manual in SVN	2017-01-16 11:48:03 +00:00
CMakeLists.txt	[CMake] Fix polly-isl-test execution in out-of-LLVM-tree builds.	2017-04-22 23:02:53 +00:00
CREDITS.txt	Add myself to the credits	2014-08-10 03:37:29 +00:00
LICENSE.txt	[External] Move lib/JSON to lib/External/JSON. NFC.	2017-02-05 15:26:56 +00:00
README	…

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.