replica
/
hanchenye-llvm-project
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
hanchenye-llvm-project/polly
History
Tobias Grosser 69b4675180 GPGPU: Generate an AST for the GPU-mapped schedule 
For this we need to provide an explicit list of statements as they occur in
the polly::Scop to ppcg.

We also setup basic AST printing facilities to facilitate debugging. To allow
code reuse some (minor) changes in ppcg are have been necessary.

llvm-svn: 275436
 		2016-07-14 15:51:37 +00:00
..
cmake Respect LLVM_INSTALL_TOOLCHAIN_ONLY. 2016-06-21 18:14:01 +00:00
docs docs: Remove reference to PoCC 2016-05-17 19:44:16 +00:00
include/polly [NFC] Add full title/author information to "Apply the BLIS matmul optimization pattern" 2016-07-14 10:40:15 +00:00
lib GPGPU: Generate an AST for the GPU-mapped schedule 2016-07-14 15:51:37 +00:00
test GPGPU: Generate an AST for the GPU-mapped schedule 2016-07-14 15:51:37 +00:00
tools GPURuntime: Only print status in debug mode 2016-07-06 03:04:53 +00:00
utils Revise polly-{update|check}-format targets 2015-09-14 16:59:50 +00:00
www [WWW] Mark task as done and me as owner of some task 2016-05-02 11:21:30 +00:00
.arcconfig Upgrade all the .arcconfigs to https. 2016-07-14 13:15:37 +00:00
.arclint
…
.gitattributes
…
.gitignore
…
CMakeLists.txt GPGPU: create default initialized PPCG scop and gpu program 2016-07-14 10:22:19 +00:00
CREDITS.txt
…
LICENSE.txt Update copyright year to 2016. 2016-03-30 22:41:38 +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.