options

exec - 2024-01-19 19:41:05 - MAQAO 2.18.1

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

Stylizer  

[ 4 / 4 ] Application profile is long enough (20.08 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.02 % 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 (%)
3293execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.219.167.6912.98
[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 10 issues ( = data accesses) costing 2 point each.20
[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
3085execInefficient vectorization.28.0410050
[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
3162execInefficient vectorization.24.2110050
[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
2399execInefficient vectorization.43.9310050
[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] 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
7926execPartial or unexisting vectorization - No issue detected02.91012.5
2589execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.62.32012.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 3 issues ( = data accesses) costing 2 point each.6
3294execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.32.0416.6713.54
[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
[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
4434execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.1061.84011.73
[SA] Too many paths (100 paths) - Simplify control structure. There are 100 issues ( = paths) costing 1 point each with a malus of 4 points.104
[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
4436execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.281.62012.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 12 issues ( = data accesses) costing 2 point each.24
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 1 issues ( = indirect data accesses) costing 4 point each.4
7925execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.21.5206.25
[SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points.2
×