llvm-capstone/polly
Marek Sedláček 3fee76cff3 Headers for basic blocks in CFG dot graphs
This change adds separators for basic block names, which makes it
easier to find a basic block based on its name and separates it
from the code.

Currently there is also a chance that the basic block label will
be present twice, that is in case the basic block has explicit
numbering, this change fixes this bug.

Differential Revision: https://reviews.llvm.org/D154102
2023-08-17 07:55:23 -07:00
..
cmake [Polly] Remove Polly-ACC. 2023-03-08 17:33:04 -06:00
docs Clear release notes for 18.x 2023-07-25 13:58:49 +02:00
include/polly Replace None with std::nullopt in comments (NFC) 2023-05-12 18:33:26 -07:00
lib [polly] Remove use of getWithSamePointeeType() (NFC) 2023-07-18 11:52:27 +02:00
test Headers for basic blocks in CFG dot graphs 2023-08-17 07:55:23 -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
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.