Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (51.07 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 3.00 / 3 ] Optimization level option is correctly used
[ 3.00 / 3 ] Most of time spent in analyzed modules comes from functions compiled with -g and -fno-omit-frame-pointer
-g option gives access to debugging informations, such are source locations. -fno-omit-frame-pointer improve the accuracy of callchains found during the application profiling.
[ 3.00 / 3 ] Architecture specific option -march=native is used
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.01 % of the execution time)
To have a representative profiling, it is advised that the category "Others" represents less than 20% of the execution time in order to analyze as much as possible of the user code
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (95.39%)
If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.
[ 4 / 4 ] Loop profile is not flat
At least one loop coverage is greater than 4% (6.33%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (95.39%)
If the time spent in analyzed innermost loops is less than 15%, standard innermost loop optimizations such as vectorisation will have a limited impact on application performances.
[ 3 / 3 ] Less than 10% (0%) is spend in BLAS1 operations
It could be more efficient to inline by hand BLAS1 operations
[ 3 / 3 ] Cumulative Outermost/In between loops coverage (0.00%) lower than cumulative innermost loop coverage (95.39%)
Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex
[ 2 / 2 ] Less than 10% (0%) is spend in Libm/SVML (special functions)
[ 2 / 2 ] Less than 10% (0%) is spend in BLAS2 operations
BLAS2 calls usually could make a poor cache usage and could benefit from inlining.
| Loop ID | Module | Analysis | Penalty Score | Coverage (%) | Vectorization Ratio (%) | Vector Length Use (%) |
|---|---|---|---|---|---|---|
| ►192 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 132 | 6.33 | 38.29 | 22.76 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 28 issues ( = indirect data accesses) costing 4 point each. | 112 | ||||
| ○ | [SA] Presence of constant non unit stride data access - Use array restructuring, perform loop interchange or use gather instructions to lower a bit the cost. There are 10 issues ( = data accesses) costing 2 point each. | 20 | ||||
| ►153 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 100 | 5.4 | 41.56 | 24.11 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 22 issues ( = indirect data accesses) costing 4 point each. | 88 | ||||
| ○ | [SA] Presence of constant non unit stride data access - Use array restructuring, perform loop interchange or use gather instructions to lower a bit the cost. There are 6 issues ( = data accesses) costing 2 point each. | 12 | ||||
| ►160 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 16 | 5.34 | 2.27 | 12.5 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each. | 8 | ||||
| ○ | [SA] Presence of constant non unit stride data access - Use array restructuring, perform loop interchange or use gather instructions to lower a bit the cost. There are 3 issues ( = data accesses) costing 2 point each. | 6 | ||||
| ○ | [SA] Several paths (2 paths) - Simplify control structure or force the compiler to use masked instructions. There are 2 issues ( = paths) costing 1 point each. | 2 | ||||
| ►180 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 172 | 5.18 | 30.64 | 20.05 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 38 issues ( = indirect data accesses) costing 4 point each. | 152 | ||||
| ○ | [SA] Presence of constant non unit stride data access - Use array restructuring, perform loop interchange or use gather instructions to lower a bit the cost. There are 10 issues ( = data accesses) costing 2 point each. | 20 | ||||
| ►291 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 106 | 4.31 | 41.35 | 33.51 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 26 issues ( = indirect data accesses) costing 4 point each. | 104 | ||||
| ○ | [SA] Several paths (2 paths) - Simplify control structure or force the compiler to use masked instructions. There are 2 issues ( = paths) costing 1 point each. | 2 | ||||
| ►340 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 64 | 4.24 | 35.58 | 21.27 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 16 issues ( = indirect data accesses) costing 4 point each. | 64 | ||||
| ►333 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 106 | 4.22 | 41.89 | 34.13 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 26 issues ( = indirect data accesses) costing 4 point each. | 104 | ||||
| ○ | [SA] Several paths (2 paths) - Simplify control structure or force the compiler to use masked instructions. There are 2 issues ( = paths) costing 1 point each. | 2 | ||||
| ►306 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 64 | 4.18 | 34.95 | 21 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 16 issues ( = indirect data accesses) costing 4 point each. | 64 | ||||
| ►163 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 60 | 4.13 | 36.22 | 21.75 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 15 issues ( = indirect data accesses) costing 4 point each. | 60 | ||||
| ►293 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 20 | 3.42 | 48.39 | 37.19 |
| ○ | [SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points. | 20 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 |