llvm-project/polly
Mark de Wever d0398d3593 Revert "Reland "[CMake] Bumps minimum version to 3.20.0.""
This reverts commit a72165e5df.

Some buildbots have not been updated yet.
2023-03-18 20:32:43 +01: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] Convert remaining tests to opaque pointers (NFC) 2023-03-17 15:44:54 +01:00
unittests Migrate away from the soft-deprecated functions in APInt.h (NFC) 2023-02-20 00:58:29 -08:00
utils Harmonize Python shebang 2020-07-16 21:53:45 +02:00
www [Polly] Remove Polly-ACC. 2023-03-08 17:33:04 -06:00
.arclint [External] Move lib/JSON to lib/External/JSON. NFC. 2017-02-05 15:26:56 +00:00
.gitattributes gitattributes: .png and .txt are no text files 2013-07-28 09:05:20 +00:00
.gitignore Do not track the isl PDF manual in SVN 2017-01-16 11:48:03 +00:00
CMakeLists.txt Revert "Reland "[CMake] Bumps minimum version to 3.20.0."" 2023-03-18 20:32:43 +01:00
CREDITS.txt Add myself to the credits 2014-08-10 03:37:29 +00:00
LICENSE.TXT Rename top-level LICENSE.txt files to LICENSE.TXT 2021-03-10 21:26:24 -08:00
README Test commit 2017-06-28 12:58:44 +00:00

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.