options

exec - 2023-12-13 15:11:51 - MAQAO 2.18.0

Help is available by moving the cursor above any symbol or by checking MAQAO website.

Stylizer  

[ 4 / 4 ] Application profile is long enough (30.3 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 ( -x(target) or -ax(target) ).

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.11 % 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

Strategizer  

[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (67.86%)

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% (38.44%), representing an hotspot for the application

[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (29.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

[ 0 / 3 ] Cumulative Outermost/In between loops coverage (38.47%) greater than cumulative innermost loop coverage (29.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.

Optimizer

Loop IDModuleAnalysisPenalty ScoreCoverage (%)Vectorization
Ratio (%)
Vector Length
Use (%)
31execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.1438.4413.3314.17
[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 5 issues ( = data accesses) costing 2 point each.10
[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
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
32execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.220.56012.5
[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 1 issues ( = data accesses) costing 2 point each.2
33execPartial or unexisting vectorization - No issue detected04.1012.5
26execThe loop is fully and efficiently vectorized.03.93100100
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
17execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.360.7911.1113.89
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 9 issues ( = indirect data accesses) costing 4 point each.36
35execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.150.01011.51
[SA] Too many paths (9 paths) - Simplify control structure. There are 9 issues ( = paths) costing 1 point each with a malus of 4 points.13
[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
21execPartial or unexisting vectorization - No issue detected00.01012.5
30execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.160.01010.94
[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
[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
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
18execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.240.01011.61
[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 7 issues ( = data accesses) costing 2 point each.14
[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] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
×