Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (37.88 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 0 / 3 ] Some functions are compiled with a low optimization level (O0 or O1)
To have better performances, it is advised to help the compiler by using a proper optimization level (-O2 of higher). Warning, depending on compilers, faster optimization levels can decrease numeric accuracy.
[ 0 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information
Functions without compilation information (typically not compiled with -g) cumulate 100.00% of the time spent in analyzed modules. Check that -g is present. Remark: if -g is indeed used, this can also be due to some compiler built-in functions (typically math) or statically linked libraries. This warning can be ignored in that case.
[ 0 / 3 ] Compilation of some functions is not optimized for the target processor
Architecture specific options are needed to produce efficient code for a specific processor ( -mcpu=native ).
[ 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 (79.19%)
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% (26.35%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (66.61%)
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 (12.58%) lower than cumulative innermost loop coverage (66.61%)
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 (%) |
|---|---|---|---|---|---|---|
| ○1378 | exec | Partial or unexisting vectorization - No issue detected | 0 | 26.35 | 33.33 | 33.33 |
| ○1057 | exec | Partial or unexisting vectorization - No issue detected | 0 | 6.8 | 33.33 | 33.33 |
| ○1066 | exec | Partial or unexisting vectorization - No issue detected | 0 | 6.08 | 33.33 | 33.33 |
| ►566 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1002 | 3.6 | 0 | 25 |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 | ||||
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ○1274 | exec | Partial or unexisting vectorization - No issue detected | 0 | 3.6 | 0 | 0 |
| ○1379 | exec | Partial or unexisting vectorization - No issue detected | 0 | 2.54 | 0 | 25 |
| ►213 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1000 | 2.27 | 0 | 25 |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►1375 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 1003 | 2.25 | 0 | 25 |
| ○ | [SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point. | 1000 | ||||
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
| ○ | [SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 1 issues (= calls) costing 1 point each. | 1 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►625 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 2 | 1.82 | 0 | 25 |
| ○ | [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 | ||||
| ○1211 | exec | Partial or unexisting vectorization - No issue detected | 0 | 1.74 | 0 | 0 |