llvm-capstone/polly
2023-04-28 13:18:45 +02:00
..
cmake [Polly] Remove Polly-ACC. 2023-03-08 17:33:04 -06:00
docs [Polly] Remove Polly-ACC. 2023-03-08 17:33:04 -06:00
include/polly [Polly] Remove Polly-ACC. 2023-03-08 17:33:04 -06:00
lib [Polly] Remove some bitcasts (NFC) 2023-03-17 15:59:19 +01:00
test [polly] Drop redundant use of -instnamer in polly MemAccess lit tests 2023-04-28 13:18:45 +02:00
unittests Migrate away from the soft-deprecated functions in APInt.h (NFC) 2023-02-20 00:58:29 -08:00
utils
www [Polly] Remove Polly-ACC. 2023-03-08 17:33:04 -06:00
.arclint
.gitattributes
.gitignore
CMakeLists.txt Revert "Revert "Revert "[CMake] Bumps minimum version to 3.20.0.""" 2023-04-15 20:12:24 +02:00
CREDITS.txt
LICENSE.TXT Rename top-level LICENSE.txt files to LICENSE.TXT 2021-03-10 21:26:24 -08: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.