options

exec - 2024-03-22 19:03:04 - MAQAO 2.19.1

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

Stylizer  

[ 4 / 4 ] Application profile is long enough (140.9 s)

To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.

[ 1.18 / 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.

[ 1.18 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information

Functions without compilation information (typically not compiled with -g) cumulate 60.61% 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.

[ 1.18 / 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 % 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 (%)
170execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.2322.8696.5543.77
[SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 24 issues (= instructions) costing 4 points each.96
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 16 issues (= instructions) costing 4 points each.64
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 13 issues ( = indirect data accesses) costing 4 point each.52
[SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 11 issues (= instructions) costing 1 point each.11
[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
[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] 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] Inefficient vectorization: use of masked instructions - Simplify control structure. The 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! There is no dynamic data for this loop. Some checks can not been performed.0
178execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.2372.7695.8243.53
[SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 24 issues (= instructions) costing 4 points each.96
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 16 issues (= instructions) costing 4 points each.64
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 14 issues ( = indirect data accesses) costing 4 point each.56
[SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 12 issues (= instructions) costing 1 point each.12
[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
[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] 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] Inefficient vectorization: use of masked instructions - Simplify control structure. The 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! There is no dynamic data for this loop. Some checks can not been performed.0
710execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.2742.6696.7843.31
[SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 32 issues (= instructions) costing 4 points each.128
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 19 issues (= instructions) costing 4 points each.76
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 14 issues ( = indirect data accesses) costing 4 point each.56
[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] Presence of special instructions executing on a single port (BROADCAST) - Simplify data access and try to get stride 1 access. There are 2 issues (= instructions) costing 1 point each.2
[SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 2 issues (= calls) costing 1 point each.2
[SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points.2
[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] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points.2
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
241execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.762.3297.4445.03
[SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 8 issues (= instructions) costing 4 points each.32
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 5 issues (= instructions) costing 4 points each.20
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 4 issues ( = indirect data accesses) costing 4 point each.16
[SA] Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA - Reorganize arithmetic expressions to exhibit potential for FMA. This issue costs 4 points.4
[SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 2 issues (= calls) costing 1 point each.2
[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
150execInefficient vectorization.2342.2310042.66
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 40 issues (= instructions) costing 4 points each.160
[SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 26 issues ( = arrays) costing 2 points each52
[SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 4 issues (= instructions) costing 4 points each.16
[SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points.2
[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
293execInefficient vectorization.1502.1510043.43
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 28 issues (= instructions) costing 4 points each.112
[SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 8 issues (= instructions) costing 4 points each.32
[SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points.2
[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
209execInefficient vectorization.1902.1110044.8
[SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 28 issues (= instructions) costing 4 points each.112
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 18 issues (= instructions) costing 4 points each.72
[SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points.2
[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] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points.2
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
295execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.4521.5698.0842.72
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 40 issues (= instructions) costing 4 points each.160
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 31 issues ( = indirect data accesses) costing 4 point each.124
[SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 39 issues ( = arrays) costing 2 points each78
[SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 16 issues (= instructions) costing 4 points each.64
[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] Presence of special instructions executing on a single port (INSERT/EXTRACT, BROADCAST) - Simplify data access and try to get stride 1 access. There are 7 issues (= instructions) costing 1 point each.7
[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
[SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. 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! There is no dynamic data for this loop. Some checks can not been performed.0
162execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.3501.596.4644.39
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 28 issues (= instructions) costing 4 points each.112
[SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 24 issues (= instructions) costing 4 points each.96
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 19 issues ( = indirect data accesses) costing 4 point each.76
[SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 21 issues ( = arrays) costing 2 points each42
[SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 15 issues (= instructions) costing 1 point each.15
[SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points.2
[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
[SA] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. 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! There is no dynamic data for this loop. Some checks can not been performed.0
154execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.3481.4496.643.77
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 28 issues (= instructions) costing 4 points each.112
[SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 24 issues (= instructions) costing 4 points each.96
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 19 issues ( = indirect data accesses) costing 4 point each.76
[SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 21 issues ( = arrays) costing 2 points each42
[SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 15 issues (= instructions) costing 1 point each.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] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points.2
[SA] Inefficient vectorization: use of masked instructions - Simplify control structure. The 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! There is no dynamic data for this loop. Some checks can not been performed.0
×