llvm-capstone/polly
Michael Kruse 42cd38c01e [Polly] Remove -polly-vectorizer=polly.
Polly's internal vectorizer is not well maintained and is known to not work in some cases such as region ScopStmts. Unlike LLVM's LoopVectorize pass it also does not have a target-dependent cost heuristics, and we recommend using LoopVectorize instead of -polly-vectorizer=polly.

In the future we hope that Polly can collaborate better with LoopVectorize, like Polly marking a loop is safe to vectorize with a specific simd width, instead of replicating its functionality.

Reviewed By: grosser

Differential Revision: https://reviews.llvm.org/D142640
2023-03-08 12:51:42 -06:00
..
cmake [cmake] Fix path to LLVMConfig.cmake for multi-config builds 2023-01-13 20:32:59 +01:00
docs [Polly] Remove -polly-vectorizer=polly. 2023-03-08 12:51:42 -06:00
include/polly [Polly] Remove -polly-vectorizer=polly. 2023-03-08 12:51:42 -06:00
lib [Polly] Remove -polly-vectorizer=polly. 2023-03-08 12:51:42 -06:00
test [Polly] Remove -polly-vectorizer=polly. 2023-03-08 12:51:42 -06:00
tools [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
unittests Migrate away from the soft-deprecated functions in APInt.h (NFC) 2023-02-20 00:58:29 -08:00
utils
www [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
.arclint
.gitattributes
.gitignore
CMakeLists.txt Revert "[CMake] Bumps minimum version to 3.20.0." 2023-03-04 18:28:13 +01:00
CREDITS.txt
LICENSE.TXT Rename top-level LICENSE.txt files to LICENSE.TXT 2021-03-10 21:26:24 -08:00
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.