hanchenye-llvm-project/polly
Chandler Carruth d01918fa13 [PM] Convert Polly over to directly use the legacy pass manager
namespace and header rather than the top-level header and using
declarations. These helpers impede modular builds and are going away.
Migrating away from them will also be necessary to start mixing in any
usage of the new pass manager.

llvm-svn: 229091
2015-02-13 09:51:50 +00:00
..
autoconf Import isl(+imath) as an external library into Polly 2015-02-04 20:55:43 +00:00
cmake Import isl(+imath) as an external library into Polly 2015-02-04 20:55:43 +00:00
include [PM] Convert Polly over to directly use the legacy pass manager 2015-02-13 09:51:50 +00:00
lib [PM] Convert Polly over to directly use the legacy pass manager 2015-02-13 09:51:50 +00:00
test [FIX] Remove XFAIL again 2015-02-11 19:28:39 +00:00
tools
utils Update to the latest version of isl 2014-12-07 16:04:29 +00:00
www Update TODO list. 2015-02-11 18:18:19 +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 Build the isl files as PIC 2015-02-04 21:56:28 +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 Import isl(+imath) as an external library into Polly 2015-02-04 20:55:43 +00:00
README
configure Import isl(+imath) as an external library into Polly 2015-02-04 20:55:43 +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.