hanchenye-llvm-project/polly
Johannes Doerfert f8206cf6d4 Allow loops in non-affine subregions -- SCoP Modeling
This will allow the ScopInfo to build the polyhedral representation for
  non-affine regions that contain loops. Such loops are basically not visible
  in the SCoP representation. Accesses that are variant in such loops are
  therefor represented as non-affine accesses.

Differential Revision: http://reviews.llvm.org/D8153

llvm-svn: 234713
2015-04-12 22:58:40 +00:00
..
autoconf Drop libpluto support 2015-03-30 17:54:01 +00:00
cmake Drop libpluto support 2015-03-30 17:54:01 +00:00
include Allow loops in non-affine subregions -- SCoP Modeling 2015-04-12 22:58:40 +00:00
lib Allow loops in non-affine subregions -- SCoP Modeling 2015-04-12 22:58:40 +00:00
test Allow loops in non-affine subregions -- SCoP Modeling 2015-04-12 22:58:40 +00:00
tools Ensure the functions in our GPURuntime are visible 2015-03-10 20:23:14 +00:00
utils Remove isl/cloog build scripts 2015-02-15 11:19:20 +00:00
www Drop ISL_INSTALL path 2015-04-10 15:41:14 +00:00
.arcconfig Added arcanist (arc) unit test support 2014-09-08 19:30:09 +00:00
.arclint Added arcanist linters and cleaned errors and warnings 2014-08-18 00:40:13 +00:00
.gitattributes gitattributes: .png and .txt are no text files 2013-07-28 09:05:20 +00:00
.gitignore Add test/lit.site.cfg to .gitignore 2014-09-07 15:03:30 +00:00
CMakeLists.txt Drop libpluto support 2015-03-30 17:54:01 +00:00
CREDITS.txt Add myself to the credits 2014-08-10 03:37:29 +00:00
LICENSE.txt Update the copyright credits -- Happy new year 2014! 2014-01-01 08:27:31 +00:00
Makefile
Makefile.common.in
Makefile.config.in Drop libpluto support 2015-03-30 17:54:01 +00:00
README
configure Drop libpluto support 2015-03-30 17:54:01 +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.