llvm-capstone/polly
2023-07-03 12:49:28 -07:00
..
cmake [Polly] Remove Polly-ACC. 2023-03-08 17:33:04 -06:00
docs [polly] Fix typos in documentation 2023-05-27 10:29:20 -07:00
include/polly Replace None with std::nullopt in comments (NFC) 2023-05-12 18:33:26 -07:00
lib [Polly][FIX] Adjust enum after D153305 2023-07-03 12:49:28 -07:00
test [SCEV] Compute AddRec range computations using different type BECount 2023-05-31 21:05:17 -07:00
unittests Migrate away from the soft-deprecated functions in APInt.h (NFC) 2023-02-20 00:58:29 -08:00
utils [NFC][Py Reformat] Reformat python files in the rest of the dirs 2023-05-25 11:17:05 +02:00
www [Polly] Remove Polly-ACC. 2023-03-08 17:33:04 -06:00
.arclint
.gitattributes
.gitignore
CMakeLists.txt Reland "[CMake] Bumps minimum version to 3.20.0. 2023-05-27 12:51:21 +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.