llvm-project/polly
Vitaly Buka 3f5f2905c4 [test] Propagate HWASAN_OPTIONS 2022-08-17 18:59:49 -07:00
..
cmake [cmake] Support custom package install paths 2022-07-25 21:02:53 +00:00
docs [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
include/polly [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
lib LLVM_FALLTHROUGH => [[fallthrough]]. NFC 2022-08-09 04:06:52 +00:00
test [test] Propagate HWASAN_OPTIONS 2022-08-17 18:59:49 -07:00
tools [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
unittests [polly][unittests] Link DeLICMTests with libLLVMCore 2022-01-28 21:58:40 +01:00
utils Harmonize Python shebang 2020-07-16 21:53:45 +02:00
www [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
.arclint
.gitattributes
.gitignore
CMakeLists.txt [cmake] Make include(GNUInstallDirs) always below project(..) 2022-01-20 18:59:17 +00:00
CREDITS.txt
LICENSE.TXT Rename top-level LICENSE.txt files to LICENSE.TXT 2021-03-10 21:26:24 -08:00
README

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.