options

exec - 2024-04-12 18:27:10 - 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 (78.34 s)

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

[ 1.76 / 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.76 / 3 ] Most of time spent in analyzed modules comes from functions without compilation information

Functions without compilation information (typically not compiled with -g) cumulate 41.41% 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.76 / 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 (%)
115execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.1283.8299.3582.59
[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 expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 7 issues (= instructions) costing 4 points each.28
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 6 issues ( = indirect data accesses) costing 4 point each.24
[SA] Presence of special instructions executing on a single port (BLEND/MERGE, 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
[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
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
665execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.3533.4898.2984.16
[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 52 issues (= instructions) costing 4 points each.208
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 18 issues (= instructions) costing 4 points each.72
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 15 issues ( = indirect data accesses) costing 4 point each.60
[SA] Presence of special instructions executing on a single port (BROADCAST) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each.3
[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
[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
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
150execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.3723.4799.2483.3
[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 56 issues (= instructions) costing 4 points each.224
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 18 issues (= instructions) costing 4 points each.72
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 17 issues ( = indirect data accesses) costing 4 point each.68
[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
123execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.1363.3999.3481.16
[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 indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 8 issues ( = indirect data accesses) costing 4 point each.32
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 7 issues (= instructions) costing 4 points each.28
[SA] Presence of special instructions executing on a single port (BLEND/MERGE, 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
[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
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
95execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.2923.2898.8276.91
[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 23 issues ( = indirect data accesses) costing 4 point each.92
[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] 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
[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
246execInefficient vectorization.1823.1910082.69
[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 16 issues (= instructions) costing 4 points each.64
[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
192execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.1083.0897.4486.06
[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 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
99execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.1952.8799.1182.54
[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 20 issues (= instructions) costing 4 points each.80
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 13 issues (= instructions) costing 4 points each.52
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 12 issues ( = indirect data accesses) costing 4 point each.48
[SA] Presence of special instructions executing on a single port (BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each.3
[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 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] 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
[SA] Inefficient vectorization: use of masked instructions - Simplify control structure. 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
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
107execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.1952.5899.0883.28
[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 20 issues (= instructions) costing 4 points each.80
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 13 issues (= instructions) costing 4 points each.52
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 12 issues ( = indirect data accesses) costing 4 point each.48
[SA] Presence of special instructions executing on a single port (BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each.3
[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 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] 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
[SA] Inefficient vectorization: use of masked instructions - Simplify control structure. 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
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
121execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.822.5397.5676.98
[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 6 issues (= instructions) costing 4 points each.24
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 5 issues ( = indirect data accesses) costing 4 point each.20
[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] 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
×