options

bench_mos - 2024-02-26 18:06:29 - MAQAO 2.19.2

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

Stylizer  

[ 4 / 4 ] Application profile is long enough (52.02 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 % 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

Optimizer

Loop IDModuleAnalysisPenalty ScoreCoverage (%)Vectorization
Ratio (%)
Vector Length
Use (%)
520libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.270.6498.0499.02
[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
489libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.621.6196.398.15
[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
[SA] Bottleneck in the front end - If loop size is very small (rare occurrences), perform unroll and jam. If loop size is large, perform loop splitting. This issue costs 2 points.2
[SA] Presence of a large number of scalar integer instructions - Simplify loop structure, perform loop splitting or perform unroll and jam. This issue costs 2 points.2
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
514libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.21.1995.2497.62
[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
522libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10000.87050
[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
519libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10020.5948.4874.24
[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
97libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.320.552.2550.45
[SA] Too many paths (26 paths) - Simplify control structure. There are 26 issues ( = paths) costing 1 point each with a malus of 4 points.30
[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
484libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.60.3883.3391.67
[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
[SA] Bottleneck in the front end - If loop size is very small (rare occurrences), perform unroll and jam. If loop size is large, perform loop splitting. This issue costs 2 points.2
[SA] Presence of a large number of scalar integer instructions - Simplify loop structure, perform loop splitting or perform unroll and jam. This issue costs 2 points.2
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
491libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.40.31050
[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
84libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10030.319.7758.43
[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
125libqmckl.so.0.0.0Partial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10030.212.4448.78
[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
×