hanchenye-llvm-project/polly
Tobias Grosser 9a44b97913 Revert "CodeGeneration: Implement ceild/floord exactly as CLooG does"
I think I did not get the implementation right. As the current implementation
works well, we will just stick with it for now.

llvm-svn: 150691
2012-02-16 14:13:19 +00:00
..
autoconf configure: Add gmp_inc when checking for CLooG 2011-10-04 06:55:03 +00:00
cmake
docs
include ScopInfo: Add Scop::getDomains() 2012-02-14 14:02:40 +00:00
lib Revert "CodeGeneration: Implement ceild/floord exactly as CLooG does" 2012-02-16 14:13:19 +00:00
test CodeGen: Name stmt bbs 'polly.stmt.' + OriginalName 2012-02-15 09:58:46 +00:00
tools
utils Use isl version: 3c66541593a6bf3b5a3d35d31567abe6c9e5a04b 2012-01-30 19:38:40 +00:00
www www: Add 'pet' paper to the publications 2012-02-16 09:59:34 +00:00
CMakeLists.txt Buildsystem: Add -no-rtti 2011-06-30 19:50:04 +00:00
CREDITS.txt (Test commit for polly) 2011-07-16 13:30:03 +00:00
LICENSE.txt Happy new year 2012! 2012-01-01 08:16:56 +00:00
Makefile
Makefile.common.in
Makefile.config.in Buildsystem: Add -no-rtti 2011-06-30 19:50:04 +00:00
README Remove some empty lines 2011-10-04 06:56:36 +00:00
configure configure: Add gmp_inc when checking for CLooG 2011-10-04 06:55:03 +00:00

README

Polly - Polyhedral optimizations for LLVM

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.