|
Name |
|
Date |
Size |
#Lines |
LOC |
| .. | | 09-Dec-2020 | - |
| cmake/ | H | 03-May-2022 | - | 181 | 157 |
| docs/ | H | 03-May-2022 | - | 8,834 | 7,533 |
| include/polly/ | H | 09-Dec-2020 | - | 12,642 | 4,219 |
| lib/ | H | 03-May-2022 | - | 435,544 | 330,624 |
| test/ | H | 03-May-2022 | - | 90,861 | 76,622 |
| tools/GPURuntime/ | H | 03-May-2022 | - | 1,981 | 1,458 |
| unittests/ | H | 03-May-2022 | - | 1,662 | 1,263 |
| utils/ | H | 09-Dec-2020 | - | 3,140 | 2,206 |
| www/ | H | 03-May-2022 | - | 625 | 536 |
| .arclint | H A D | 09-Dec-2020 | 662 | 26 | 25 |
| .gitattributes | H A D | 09-Dec-2020 | 92 | 5 | 4 |
| .gitignore | H A D | 09-Dec-2020 | 54 | 4 | 3 |
| README | H A D | 09-Dec-2020 | 709 | 13 | 11 |
README
1Polly - Polyhedral optimizations for LLVM
2-----------------------------------------
3http://polly.llvm.org/
4
5Polly uses a mathematical representation, the polyhedral model, to represent and
6transform loops and other control flow structures. Using an abstract
7representation it is possible to reason about transformations in a more general
8way and to use highly optimized linear programming libraries to figure out the
9optimal loop structure. These transformations can be used to do constant
10propagation through arrays, remove dead loop iterations, optimize loops for
11cache locality, optimize arrays, apply advanced automatic parallelization, drive
12vectorization, or they can be used to do software pipelining.
13