replica
/
hanchenye-llvm-project
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
hanchenye-llvm-project/polly
History
Tobias Grosser e8df5bd92b IndependentBlocks: We can only reconstruct PHI nodes that are within the ScoP 
In the classical (non -polly-codegen-scev) mode, we assume that we can always
recreate PHI nodes during code generation. This is not true. We can only
reconstruct them from the polyhedral information, in case the entire loop of the
PHI node is part of the SCoP and consequently the PHI node was translated in
the polyhedral description.

llvm-svn: 179674
 		2013-04-17 07:20:36 +00:00
..
autoconf 'chmod -x' on files that do not need the executable bits 2012-12-29 15:09:03 +00:00
cmake autoconf/cmake: Always require isl code generation. 2012-10-21 21:48:21 +00:00
docs
…
include Remove unneeded RegionSimplify pass. 2013-04-17 07:20:30 +00:00
lib IndependentBlocks: We can only reconstruct PHI nodes that are within the ScoP 2013-04-17 07:20:36 +00:00
test IndependentBlocks: We can only reconstruct PHI nodes that are within the ScoP 2013-04-17 07:20:36 +00:00
tools Update formatting to latest version of clang-format 2013-04-10 06:55:45 +00:00
utils check that clang-format exists 2013-02-15 21:26:50 +00:00
www Remove unneeded RegionSimplify pass. 2013-04-17 07:20:30 +00:00
CMakeLists.txt cmake: Do not clang-format check the externally imported json library 2013-03-23 01:04:48 +00:00
CREDITS.txt
…
LICENSE.txt Update the copyright coredits -- Happy new year 2013! 2013-01-01 10:00:19 +00:00
Makefile
…
Makefile.common.in 'chmod -x' on files that do not need the executable bits 2012-12-29 15:09:03 +00:00
Makefile.config.in 'chmod -x' on files that do not need the executable bits 2012-12-29 15:09:03 +00:00
README
…
configure do not require cloog from configure 2012-11-26 23:03:41 +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.