llvm-capstone/polly
Karthika Devi C 7ddd3d7764
[polly][NFC] Refactor reduction detection code for modularity (#72343)
This patch pulls out the memory checks from the base reduction detection
algorithm. This is the first one in the reduction patch series, to
reduce the difference in future patches.
2023-12-07 14:04:52 -08:00
..
cmake [polly] Dynamic libraries are not supported on Cygwin 2023-09-05 14:38:35 -07:00
docs Clear release notes for 18.x 2023-07-25 13:58:49 +02:00
include/polly [llvm][NFC] A start at cleaning up zero byte files that should have been removed (#74404) 2023-12-05 01:57:14 -05:00
lib [polly][NFC] Refactor reduction detection code for modularity (#72343) 2023-12-07 14:04:52 -08:00
test [Polly] Add disjoint flag to some tests (NFC) 2023-12-05 14:37:19 +01:00
unittests
utils
www [polly][www] Remove unused VideoJS 2023-09-13 12:24:46 -07:00
.arclint
.gitattributes
.gitignore
CMakeLists.txt
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.