ce9ef39c10
Providing an explicit PointerLikeTypeTraits implementation became necessary since LLVM started in https://llvm.org/svn/llvm-project/llvm/trunk@256620 to automatically derive the pointer alignment from the pointer element type, which does not work for incomplete types as used by isl. To ensure our code still compiles, we provide an instantiation of PointerLikeTypeTraits for isl_id which assumes no minimal alignment. isl pointers are likely to have a "higher" alignment. We can exploit this later in case this becomes performance relevant. llvm-svn: 256650 |
||
|---|---|---|
| .. | ||
| autoconf | ||
| cmake | ||
| include/polly | ||
| 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.