Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (21.96 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.26 % 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 (54.65%)
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% (43.72%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (53.93%)
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.72%) lower than cumulative innermost loop coverage (53.93%)
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 (%) |
|---|---|---|---|---|---|---|
| ►83 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 3 | 43.72 | 40.74 | 70.37 |
| ○ | [SA] Several paths (3 paths) - Simplify control structure or force the compiler to use masked instructions. There are 3 issues ( = paths) costing 1 point each. | 3 | ||||
| ○26 | exec | Partial or unexisting vectorization - No issue detected | 0 | 3.13 | 0 | 37.5 |
| ○25 | exec | Partial or unexisting vectorization - No issue detected | 0 | 2.99 | 8.33 | 52.08 |
| ○66 | exec | Partial or unexisting vectorization - No issue detected | 0 | 1.74 | 0 | 50 |
| ○106 | exec | Partial or unexisting vectorization - No issue detected | 0 | 1.68 | 7.69 | 51.92 |
| ►82 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 5 | 0.46 | 0 | 50 |
| ○ | [SA] Several paths (3 paths) - Simplify control structure or force the compiler to use masked instructions. There are 3 issues ( = paths) costing 1 point each. | 3 | ||||
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
| ►96 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 19 | 0.41 | 32.69 | 50.96 |
| ○ | [SA] Too many paths (15 paths) - Simplify control structure. There are 15 issues ( = paths) costing 1 point each with a malus of 4 points. | 19 | ||||
| ○ | Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option. | 0 | ||||
| ►81 | exec | Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access. | 6 | 0.23 | 0 | 40.63 |
| ○ | [SA] Several paths (4 paths) - Simplify control structure or force the compiler to use masked instructions. There are 4 issues ( = paths) costing 1 point each. | 4 | ||||
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 | ||||
| ○109 | exec | Partial or unexisting vectorization - No issue detected | 0 | 0.1 | 20 | 55 |
| ○67 | exec | Partial or unexisting vectorization - No issue detected | 0 | 0.09 | 0 | 50 |