hanchenye-llvm-project/polly
Michael Kruse 89d2be0702 [Support] Force instantiation of isl dump() methods. NFC.
In order for debuggers to be able to call an inline method, it must have
been instantiated somewhere. The dump() methods are usually not used, so
add an instantiation in debug builds.

This allows to call .dump() on any isl++ object from the gcc/gdb and
Visual Studio debugger in debug builds with assertions enabled.
In optimized builds, even with assertions enabled, the dump() methods
are also inlined in GICHelper.cpp, so no externally visible symbols
will be available either.

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

llvm-svn: 314395
2017-09-28 09:51:04 +00:00
..
cmake [CMake] FindJsoncpp.cmake: Use descriptive variable name for libjsoncpp.so path. 2017-07-18 10:10:02 +00:00
docs Tiny docs fix 2017-07-27 18:14:00 +00:00
include/polly [ScopInfo] Allow uniform branch conditions 2017-09-25 16:37:15 +00:00
lib [Support] Force instantiation of isl dump() methods. NFC. 2017-09-28 09:51:04 +00:00
test [ScopInfo] Allow PHI nodes that reference an error block 2017-09-26 15:00:10 +00:00
tools [GPUJIT] Improved temporary file handling. 2017-09-19 10:41:29 +00:00
unittests [test] Add some test cases for computeArrayUnused. 2017-08-21 23:04:55 +00:00
utils
www [Polly] Information about generalized matrix multiplication 2017-09-24 19:00:25 +00:00
.arcconfig
.arclint
.gitattributes
.gitignore
CMakeLists.txt [Polly][CMake] Skip unit-tests in lit if gtest is not available 2017-07-11 11:37:35 +00:00
CREDITS.txt
LICENSE.txt
README Test commit 2017-06-28 12:58:44 +00:00

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.