llvm-project/polly
Michael Kruse 5f16986271 [DeLICM] Partial writes for PHIs.
Enable the use for partial writes for PHI write accesses with a switch.
This simply skips the test for whether a PHI write would be partial.

The analog test for partial value writes also protects for partial reads
which we do not support (yet). It is possible to test for partial reads
separately such that we could skip the partial write check as well. In
case this shows up to be useful, I can implement it as well.

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

llvm-svn: 303762
2017-05-24 15:23:06 +00:00
..
cmake [Polly][CMake] Fix variable name in target exports 2017-05-12 10:39:38 +00:00
docs Add new C++ bindings to release notes 2017-05-24 06:46:09 +00:00
include/polly Header file to help forcibly link GPURuntime 2017-05-24 06:46:03 +00:00
lib [DeLICM] Partial writes for PHIs. 2017-05-24 15:23:06 +00:00
test [DeLICM] Partial writes for PHIs. 2017-05-24 15:23:06 +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
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.