forked from OSchip/llvm-project
b917f47fc4
Count the number of computational steps that have been used to solve the dependence problem and abort in case we reach the "compute-out". This ensures we do not hang forever in cases the dependence problem is too difficult to solve. There is just a single case in the LLVM test-suite that runs into the compute-out. Even in this case, we can probably coalesce some of the parameters (i32 b, i32 b zext i64, ...) to simplify the problem enough to not hit the compute out. However, for now we set the compute out in place to address the general issue. The compute out was choosen such that it stops on a recent laptop after about 8 seconds. llvm-svn: 200156 |
||
|---|---|---|
| .. | ||
| 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.