hanchenye-llvm-project/polly
Duncan P. N. Exon Smith ddf3a0ef38 Update polly for LLVM rename of debug info metadata with DI* prefix
Ran the same rename-md-di-prefix.sh script attached to PR23080 as in
LLVM r236120 and CFE r236121.

llvm-svn: 236127
2015-04-29 17:02:14 +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 Extract IslNodeBuilder into its own file 2015-04-27 12:32:24 +00:00
lib Update polly for LLVM rename of debug info metadata with DI* prefix 2015-04-29 17:02:14 +00:00
test Update polly for LLVM rename of debug info metadata with DI* prefix 2015-04-29 17:02:14 +00:00
tools Fix formatting issues in banner 2015-04-27 12:02:36 +00:00
utils Rename 'scattering' to 'schedule' 2015-04-21 11:37:25 +00:00
www Rename 'scattering' to 'schedule' 2015-04-21 11:37:25 +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
.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
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.