hanchenye-llvm-project/polly
Roman Lebedev a2619a60e4
Reland "[ScalarEvolution] createSCEV(): recognize `udiv`/`urem` disguised as an `sdiv`/`srem`"
This reverts commit d3e3f36ff1,
which reverter the original commit 2c16100e6f,
but with polly tests now actually passing.
2020-07-06 18:00:22 +03:00
..
cmake [cmake] Use source-groups in Polly. 2020-01-07 14:20:06 -06:00
docs [BasicAA] Replace -basicaa with -basic-aa in polly 2020-06-30 15:50:17 -07:00
include/polly [polly][opaque pointers] Remove use of deprecated APIs. 2020-04-03 18:00:33 -07:00
lib Fix polly build after 8c2082e1dc 2020-06-25 14:39:08 -07:00
test Reland "[ScalarEvolution] createSCEV(): recognize `udiv`/`urem` disguised as an `sdiv`/`srem`" 2020-07-06 18:00:22 +03:00
tools
unittests Make Polly tests dependencies explicit 2020-05-04 08:06:39 +02:00
utils
www [BasicAA] Replace -basicaa with -basic-aa in polly 2020-06-30 15:50:17 -07:00
.arclint
.gitattributes
.gitignore
CMakeLists.txt
CREDITS.txt
LICENSE.txt
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.