llvm-project/polly
Michael Kruse 45d5cf47bf [CMake] Remove POLLY_TEST_DIRECTORIES.
The test subdirectory POLLY_TEST_DIRECTORIES was heavily outdated and
only used in out-of-LLVM-tree builds
(to generate polly-test-${subdir} targets).

llvm-svn: 302142
2017-05-04 12:21:25 +00:00
..
cmake [Polly][Cmake] Add missing include paths to exported cmake config 2017-04-27 16:03:42 +00:00
docs Porting the example illustrating Polly from HTML to reStructuredText 2017-02-10 11:46:57 +00:00
include/polly [ScopInfo] Do not use LLVM names to identify statements, arrays, and parameters 2017-05-03 20:08:52 +00:00
lib [ScopDetection] Check for already known required-invariant loads [NFC] 2017-05-04 10:16:20 +00:00
test [CMake] Remove POLLY_TEST_DIRECTORIES. 2017-05-04 12:21:25 +00:00
tools [Polly] [PPCGCodeGeneration] Add managed memory support to GPU code 2017-04-28 11:16:30 +00:00
unittests [CMake] Use object library to build the two flavours of Polly. 2017-04-27 16:13:03 +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] Use object library to build the two flavours of Polly. 2017-04-27 16:13:03 +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.