forked from OSchip/llvm-project
80e237bd53
Such codes are not interesting to optimize and most likely never appear in the normal compilation flow. However, they show up during test case reduction with bugpoint and trigger -- without this change -- an assert in polly::MemoryAccess::foldAccess(). It is better to detect them in ScopDetection itself and just bail out. Contributed-by: Utpal Bora <cs14mtech11017@iith.ac.in> Reviewers: grosser Subscribers: pollydev, llvm-commits Differential Revision: http://reviews.llvm.org/D11425 llvm-svn: 243515 |
||
|---|---|---|
| .. | ||
| autoconf | ||
| cmake | ||
| include/polly | ||
| 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.