llvm-project/polly
Michael Kruse ed0c2f7e90 [ScopInfo] Do not add terminator & synthesizable instructions to the output instructions.
Such instructions are generates on-demand by the CodeGenerator and thus
do not need representation in a statement.

Differential Revision: https://reviews.llvm.org/D33642

llvm-svn: 304151
2017-05-29 12:27:38 +00:00
..
cmake [Polly][CMake] Fix variable name in target exports 2017-05-12 10:39:38 +00:00
docs Update information on isl C++ bindings in Polly release notes 2017-05-27 11:01:01 +00:00
include/polly Delinearize memory accesses that reference parameters coming from function calls 2017-05-27 15:18:53 +00:00
lib [ScopInfo] Do not add terminator & synthesizable instructions to the output instructions. 2017-05-29 12:27:38 +00:00
test [ScopInfo] Do not add terminator & synthesizable instructions to the output instructions. 2017-05-29 12:27:38 +00:00
tools [GPUJIT] Disabled gcc's -Wpedantic for use of dlsym 2017-05-10 11:51:44 +00:00
unittests [Polly][NewPM] Reenable ScopPassManager unittest 2017-05-23 11:28:50 +00:00
utils Revise polly-{update|check}-format targets 2015-09-14 16:59:50 +00:00
www Add a permanent Polly Hangouts URL 2017-05-24 06:46:11 +00:00
.arcconfig Upgrade all the .arcconfigs to https. 2016-07-14 13:15:37 +00:00
.arclint [External] Move lib/JSON to lib/External/JSON. NFC. 2017-02-05 15:26:56 +00:00
.gitattributes
.gitignore Do not track the isl PDF manual in SVN 2017-01-16 11:48:03 +00:00
CMakeLists.txt [Polly][CMake] Exclude isl_config from the polly-check-format target. 2017-05-15 13:20:26 +00:00
CREDITS.txt Add myself to the credits 2014-08-10 03:37:29 +00:00
LICENSE.txt [External] Move lib/JSON to lib/External/JSON. NFC. 2017-02-05 15:26:56 +00:00
README

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.