forked from OSchip/llvm-project
c393ff07b2
We update to a newer version of isl, which includes changes to the compute out facility that make it a lot more predicable. With our new value, we can reliably bail out for all reported bugs, while still being able to compute dependences for all but two test cases in the LLVM test suite. For the remaining two test cases, the dependence problem we construct is unnecessarily complex, so there is hope we can improve on this. However, to avoid any future issues, having a reliable compute out facility in place is important. llvm-svn: 206106 |
||
|---|---|---|
| .. | ||
| 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.