options

exec - 2024-04-05 17:19:54 - MAQAO 2.19.4

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

Stylizer  

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

Optimizer

Loop IDModuleAnalysisPenalty ScoreCoverage (%)Vectorization
Ratio (%)
Vector Length
Use (%)
1277execPartial or unexisting vectorization - No issue detected026.2433.3333.33
969execPartial or unexisting vectorization - No issue detected06.8233.3333.33
978execPartial or unexisting vectorization - No issue detected06.0933.3333.33
531+execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10023.37025
[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
1182execPartial or unexisting vectorization - No issue detected03.3300
1278execPartial or unexisting vectorization - No issue detected02.58025
1274+execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10032.3025
[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
201+execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10002.15025
[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
587+execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.21.76025
[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
570+execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10021.75025
[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 (Outermost) - 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
×