replica
/
hanchenye-llvm-project
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
hanchenye-llvm-project/polly
History
Siddharth Bhat 44b6cb4e63 [DependenceInfo] change name Write to MustWrite to remove ambiguity [NFC] 
"Write" is an overloaded term. In collectInfo() till buildFlow(), it is
used to mean "must writes". However, within the memory based analysis,
it is used to mean "both may and must writes". Renaming the Write
variable helps clarify this difference.

Reviewers: grosser

Tags: #polly

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

llvm-svn: 298361
 		2017-03-21 11:54:08 +00:00
..
cmake [Cmake] Generate a PollyConfig.cmake. 2017-03-09 17:58:20 +00:00
docs Porting the example illustrating Polly from HTML to reStructuredText 2017-02-10 11:46:57 +00:00
include/polly [CodeGen] Remove need for all parameters to be in scop context for load hoisting. 2017-03-18 23:12:49 +00:00
lib [DependenceInfo] change name Write to MustWrite to remove ambiguity [NFC] 2017-03-21 11:54:08 +00:00
test [CodeGen] Remove need for all parameters to be in scop context for load hoisting. 2017-03-18 23:12:49 +00:00
tools
…
unittests [DeLICM] Refector out parseSetOrNull. NFC. 2017-03-20 15:37:32 +00:00
utils
…
www Porting the example illustrating Polly from HTML to reStructuredText 2017-02-10 11:46:57 +00:00
.arcconfig
…
.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 [Cmake] Generate a PollyConfig.cmake. 2017-03-09 17:58:20 +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.