hanchenye-llvm-project/polly
Tobias Grosser 2df884f95a ScopInfo: use project_out instead of remove_dims
By just removing dimensions (and the constraints they are involved in) we
may loose information about the dimensions we do not remove. By instead
using project_out, we are sure all constraints on the outer dimensions are
preserved.

No test case, as this error condition is very unlikely to be triggered by
isl's current code. We still 'fix' this, as isl gives little guarantees
regarding the behavior of remove_divs.

llvm-svn: 246567
2015-09-01 18:17:41 +00:00
..
autoconf Enable ISL's small integer optimization 2015-06-25 20:47:35 +00:00
cmake Unify FOLDER property of Polly targets 2015-07-21 12:40:01 +00:00
include/polly [NFC] Add isl_set output stream operator 2015-08-31 13:54:36 +00:00
lib ScopInfo: use project_out instead of remove_dims 2015-09-01 18:17:41 +00:00
test ScopInfo: Add test case for two loops following right after each other 2015-09-01 11:33:13 +00:00
tools Do not compile GPU library with sanitizers 2015-07-28 12:51:23 +00:00
utils Make arc unit work with ninja builds 2015-08-12 09:02:20 +00:00
www Do not use negative option name 2015-08-19 08:22:06 +00:00
.arcconfig Adjusted arc linter config for modern version of arcanist 2015-08-12 09:01:16 +00:00
.arclint Adjusted arc linter config for modern version of arcanist 2015-08-12 09:01:16 +00:00
.gitattributes
.gitignore Add git patch files to .gitignore 2015-06-23 20:55:01 +00:00
CMakeLists.txt Do not use -fvisibility option with Visual C 2015-08-07 22:16:44 +00:00
CREDITS.txt
LICENSE.txt
Makefile
Makefile.common.in
Makefile.config.in Fix autotools build 2015-06-25 16:50:13 +00:00
README
configure Enable ISL's small integer optimization 2015-06-25 20:47:35 +00: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.