1d348673e0
Such a dead code elimination can remove redundant stores to arrays. It can also eliminate calculations where the results are stored to memory but where they are overwritten before ever being read. It may also fix bugs like: http://llvm.org/bugs/show_bug.cgi?id=5117 This commit just adds a sceleton without any functionality. If anybody is interested to learn about polyhedral optimizations this would be a good task. Well definined, self contained and pretty simple. Ping me if you want to start and you need some pointers to get going. llvm-svn: 149386 |
||
|---|---|---|
| .. | ||
| autoconf | ||
| cmake | ||
| docs | ||
| include | ||
| lib | ||
| test | ||
| tools | ||
| utils | ||
| www | ||
| CMakeLists.txt | ||
| CREDITS.txt | ||
| LICENSE.txt | ||
| Makefile | ||
| Makefile.common.in | ||
| Makefile.config.in | ||
| README | ||
| configure | ||
README
Polly - Polyhedral optimizations for LLVM 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.