forked from OSchip/llvm-project
5416a0395f
We do this currently only for test cases where we have integer offsets that clearly access array dimensions out-of-bound. -; for (long i = 0; i < n; i++) -; for (long j = 0; j < m; j++) -; for (long k = 0; k < o; k++) +; for (long i = 0; i < n - 3; i++) +; for (long j = 4; j < m; j++) +; for (long k = 0; k < o - 7; k++) ; A[i+3][j-4][k+7] = 1.0; This will be helpful if we later want to simplify the access functions under the assumption that they do not access memory out of bounds. llvm-svn: 210179 |
||
|---|---|---|
| .. | ||
| autoconf | ||
| cmake | ||
| docs | ||
| include | ||
| lib | ||
| test | ||
| tools | ||
| utils | ||
| www | ||
| .gitattributes | ||
| 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.