1eedb67fa6
The run-time alias check places code that involves the base pointer at the beginning of the SCoP. This breaks if the base pointer is defined inside the SCoP. Hence, we can only create a run-time alias check if we are sure the base pointer is not an instruction defined inside the scop. If it is we refuse to handle the SCoP. This commit should unbreak most of our current LNT failures. Differential Revision: http://reviews.llvm.org/D5483 llvm-svn: 218412 |
||
|---|---|---|
| .. | ||
| autoconf | ||
| cmake | ||
| docs | ||
| include | ||
| lib | ||
| test | ||
| tools | ||
| utils | ||
| www | ||
| .arcconfig | ||
| .arclint | ||
| .gitattributes | ||
| .gitignore | ||
| CMakeLists.txt | ||
| CREDITS.txt | ||
| LICENSE.txt | ||
| Makefile | ||
| Makefile.common.in | ||
| Makefile.config.in | ||
| README | ||
| configure | ||
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.