forked from OSchip/llvm-project
1a07e19180
As Polly got a lot faster after the small-integer-optimization imath patch, we now increase the compute out to optimize larger kernels. This should also expose additional slow-downs for us to address. In LNT this gives us a 3.4x speedup on 3mm, at a cost of a 2x increase in compile time (now 0.77s). reg_detect, oorafft and adi also show some compile time increases. This compile time cost is divided between more time in isl and more time in LLVM's backends due to increased code size (versioning and tiling). llvm-svn: 240840 |
||
|---|---|---|
| .. | ||
| autoconf | ||
| cmake | ||
| 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.