forked from OSchip/llvm-project
9143d67aba
If too many parameters are involved in accesses used to create RTCs we might end up with enormous compile times and RTC expressions. The reason is that the lexmin/lexmax is dependent on all these parameters and isl might need to create a case for every "ordering" of them (e.g., p0 <= p1 <= p2, p1 <= p0 <= p2, ...). The exact number of parameters allowed in accesses is defined by the command line option -polly-rtc-max-parameters=XXX and set by default to 8. Differential Revision: http://reviews.llvm.org/D5500 llvm-svn: 218566 |
||
|---|---|---|
| .. | ||
| 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.