forked from OSchip/llvm-project
bb30377c5a
Requesting size 0 allocations from `cuMalloc` / `cuMallocManaged` fails. If there is a size 0 allocation that can be statically proved, the we fail at PPCGCodeGeneration. This is because if size 0 allocation could take place, we should not generate code that tries to use this array. However, there are cases where we cannot statically prove this, and at runtime we get a request for 0 bytes of memory. We choose to allocate size 1 to allow the program to continue running. Differential Revision: https://reviews.llvm.org/D36751 llvm-svn: 310941 |
||
|---|---|---|
| .. | ||
| cmake | ||
| docs | ||
| include/polly | ||
| lib | ||
| test | ||
| tools | ||
| unittests | ||
| utils | ||
| www | ||
| .arcconfig | ||
| .arclint | ||
| .gitattributes | ||
| .gitignore | ||
| CMakeLists.txt | ||
| CREDITS.txt | ||
| LICENSE.txt | ||
| README | ||
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.