d2795d0365
Until today, we compared two affine expressions by defining two maps describing them, creating an union of those maps, adding constraints that do the comparison and projecting out unneeded dimensions. This was simplified to using the isl_pw_aff representation of the affine expressions and using the relevant isl functions to compare them. llvm-svn: 137932 |
||
|---|---|---|
| .. | ||
| 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.