hanchenye-llvm-project/polly
Tobias Grosser 6a62ebdd0f TODO: Add topic 'teach bugpoint to extract regions'
This does not only seem helpful for Polly, but it should help in general to
further reduce bugs.

llvm-svn: 200225
2014-01-27 14:48:17 +00:00
..
autoconf [autoconf/cmake] Make sure we detect the latest version of isl. 2013-07-02 14:11:32 +00:00
cmake [autoconf/cmake] Make sure we detect the latest version of isl. 2013-07-02 14:11:32 +00:00
docs
include Temporarily reformat Polly to silence buildbots 2014-01-06 01:37:13 +00:00
lib Detection: Allow to filter the regions that can be detected 2014-01-27 14:24:53 +00:00
test Do not test polybench with 'make check-polly' 2014-01-27 10:37:33 +00:00
tools Update the copyright credits -- Happy new year 2014! 2014-01-01 08:27:31 +00:00
utils Update to isl 1b3ba3b72c0482fd36bf0b4a1186a259f7bafeed 2014-01-26 19:36:28 +00:00
www TODO: Add topic 'teach bugpoint to extract regions' 2014-01-27 14:48:17 +00:00
.gitattributes gitattributes: .png and .txt are no text files 2013-07-28 09:05:20 +00:00
CMakeLists.txt cmake: Provide path to installed clang-format 2013-11-22 22:42:13 +00:00
CREDITS.txt
LICENSE.txt Update the copyright credits -- Happy new year 2014! 2014-01-01 08:27:31 +00:00
Makefile
Makefile.common.in 'chmod -x' on files that do not need the executable bits 2012-12-29 15:09:03 +00:00
Makefile.config.in 'chmod -x' on files that do not need the executable bits 2012-12-29 15:09:03 +00:00
README
configure [autoconf/cmake] Make sure we detect the latest version of isl. 2013-07-02 14:11:32 +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.