llvm-project/polly
serge-sans-paille 8ceee08de1 Make Polly tests dependencies explicit
Due to libPolly now using the component infrastructure, it no longer carries all
dependencies as it used to do.

Differential Revision: https://reviews.llvm.org/D79295
2020-05-04 08:06:39 +02:00
..
cmake [cmake] Use source-groups in Polly. 2020-01-07 14:20:06 -06:00
docs [Polly] Add -polly-isl-arg command line option. 2020-04-06 08:56:57 -05:00
include/polly [polly][opaque pointers] Remove use of deprecated APIs. 2020-04-03 18:00:33 -07:00
lib Use components instead of libraries in Polly linkage step 2020-04-28 09:44:10 +02:00
test [Polly] Fix long loop due to unsigned warparound. 2020-04-27 12:15:56 -05:00
tools Fix typos throughout the license files that somehow I and my reviewers 2019-01-21 09:52:34 +00:00
unittests Make Polly tests dependencies explicit 2020-05-04 08:06:39 +02:00
utils [arc] Remove unittesting from arcconfig 2018-05-15 13:43:42 +00:00
www [NFC] correct "thier" to "their" 2020-04-15 14:38:52 -07:00
.arclint
.gitattributes
.gitignore
CMakeLists.txt [JSONExporter] Replace bundled Jsoncpp with llvm/Support/JSON.h. NFC. 2018-08-01 00:15:16 +00:00
CREDITS.txt
LICENSE.txt Fix typos throughout the license files that somehow I and my reviewers 2019-01-21 09:52:34 +00:00
README Test commit 2017-06-28 12:58:44 +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.