Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (620.54 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=znver4 is used
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.21 % 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 (99.64%)
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% (13.21%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (99.52%)
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.12%) lower than cumulative innermost loop coverage (99.52%)
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 (%) |
|---|---|---|---|---|---|---|
| ►586 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 9 | 13.21 | 10.47 | 13.81 |
| ○ | [SA] Too many paths (5 paths) - Simplify control structure. There are 5 issues ( = paths) costing 1 point each with a malus of 4 points. | 9 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►217 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 40 | 11.79 | 47.24 | 37.07 |
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 10 issues ( = indirect data accesses) costing 4 point each. | 40 | ||||
| ►176 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 114 | 7.3 | 48.09 | 39.27 |
| ○ | [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 47 issues ( = data accesses) costing 2 point each. | 94 | ||||
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 5 issues ( = indirect data accesses) costing 4 point each. | 20 | ||||
| ►200 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 10 | 6.89 | 13.95 | 14.24 |
| ○ | [SA] Too many paths (6 paths) - Simplify control structure. There are 6 issues ( = paths) costing 1 point each with a malus of 4 points. | 10 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►173 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 106 | 5.98 | 45.91 | 38.13 |
| ○ | [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 45 issues ( = data accesses) costing 2 point each. | 90 | ||||
| ○ | [SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 4 issues ( = indirect data accesses) costing 4 point each. | 16 | ||||
| ►273 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 6 | 5.21 | 73.08 | 76.44 |
| ○ | [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 | ||||
| ►157 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 60 | 5.13 | 86 | 87.75 |
| ○ | [SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 8 issues (= instructions) costing 4 points each. | 32 | ||||
| ○ | [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 13 issues ( = data accesses) costing 2 point each. | 26 | ||||
| ○ | [SA] Inefficient vectorization: use of shorter than available vector length - Force compiler to use proper vector length. CAUTION: use of 512 bits vectors could be more expensive than 256 bits on some processors. Use intrinsics (costly and not portable). The issue costs 2 points. | 2 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►198 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 10 | 4.73 | 16.67 | 14.58 |
| ○ | [SA] Too many paths (6 paths) - Simplify control structure. There are 6 issues ( = paths) costing 1 point each with a malus of 4 points. | 10 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►270 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 104 | 3.99 | 82.93 | 85.06 |
| ○ | [SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 24 issues (= instructions) costing 4 points each. | 96 | ||||
| ○ | [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] Inefficient vectorization: use of shorter than available vector length - Force compiler to use proper vector length. CAUTION: use of 512 bits vectors could be more expensive than 256 bits on some processors. Use intrinsics (costly and not portable). The issue costs 2 points. | 2 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 | ||||
| ►240 | exec | Inefficient vectorization. | 260 | 3.1 | 100 | 100 |
| ○ | [SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 64 issues (= instructions) costing 4 points each. | 256 | ||||
| ○ | [SA] Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA - Reorganize arithmetic expressions to exhibit potential for FMA. This issue costs 4 points. | 4 | ||||
| ○ | Warning! There is no dynamic data for this loop. Some checks can not been performed. | 0 |