replica
/
hanchenye-llvm-project
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
hanchenye-llvm-project/polly
History
Michael Kruse d07d155ebb [DeLICM] Remove overloaded Knowledge constructor. NFC. 
The isl C++ bindings now has implicit conversions from isl::set to
isl::union_set. Therefore the additional overload accepting isl::set
is not required anymore.

llvm-svn: 298529
 		2017-03-22 18:01:23 +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 Introduce another level of metadata to distinguish non-aliasing accesses 2017-03-22 14:25:24 +00:00
lib [DeLICM] Remove overloaded Knowledge constructor. NFC. 2017-03-22 18:01:23 +00:00
test Introduce another level of metadata to distinguish non-aliasing accesses 2017-03-22 14:25:24 +00:00
tools GPURuntime: ensure compilation with C99 2016-09-11 07:32:50 +00:00
unittests [DeLICM] Refector out parseSetOrNull. NFC. 2017-03-20 15:37:32 +00:00
utils Revise polly-{update|check}-format targets 2015-09-14 16:59:50 +00:00
www Porting the example illustrating Polly from HTML to reStructuredText 2017-02-10 11:46:57 +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 [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.