hanchenye-llvm-project/polly
Tobias Grosser edb885cb12 GPGPU: generate code for ScopStatements
This change introduces the actual compute code in the GPU kernels. To ensure
all values referenced from the statements in the GPU kernel are indeed available
we scan all ScopStmts in the GPU kernel for references to llvm::Values that
are not yet covered by already modeled outer loop iterators, parameters, or
array base pointers and also pass these additional llvm::Values to the
GPU kernel.

For arrays used in the GPU kernel we introduce a new ScopArrayInfo object, which
is referenced by the newly generated access functions within the GPU kernel and
which is used to help with code generation.

llvm-svn: 276270
2016-07-21 13:15:59 +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 IslNodeBuilder: expose addReferencesFromStmt [NFC] 2016-07-21 13:15:55 +00:00
lib GPGPU: generate code for ScopStatements 2016-07-21 13:15:59 +00:00
test GPGPU: generate code for ScopStatements 2016-07-21 13:15:59 +00:00
tools GPURuntime: Only print status in debug mode 2016-07-06 03:04:53 +00:00
utils
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: Shorten ppcg include paths to avoid conflict with cuda.h 2016-07-15 07:50:36 +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.