llvm-capstone/polly
Nico Weber d763c6e5e2 Revert "Reland "[CMake] Bumps minimum version to 3.20.0.""
This reverts commit 65429b9af6.

Broke several projects, see https://reviews.llvm.org/D144509#4347562 onwards.

Also reverts follow-up commit "[OpenMP] Compile assembly files as ASM, not C"

This reverts commit 4072c8aee4.

Also reverts fix attempt  "[cmake] Set CMP0091 to fix Windows builds after the cmake_minimum_required bump"

This reverts commit 7d47dac5f8.
2023-05-17 10:53:33 -04:00
..
cmake [Polly] Remove Polly-ACC. 2023-03-08 17:33:04 -06:00
docs [docs] Hide collaboration and include graphs in doxygen docs 2023-05-04 12:26:51 +02:00
include/polly Replace None with std::nullopt in comments (NFC) 2023-05-12 18:33:26 -07: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 "Reland "[CMake] Bumps minimum version to 3.20.0."" 2023-05-17 10:53:33 -04:00
CREDITS.txt
LICENSE.TXT
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.