options

exec - 2024-03-27 17:48:34 - 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 (266.29 s)

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

[ 2.99 / 3 ] Optimization level option is correctly used

[ 2.99 / 3 ] Most of time spent in analyzed modules comes from functions compiled with -g and -fno-omit-frame-pointer

-g option gives access to debugging informations, such are source locations. -fno-omit-frame-pointer improve the accuracy of callchains found during the application profiling.

[ 2.99 / 3 ] Architecture specific option -x SAPPHIRERAPIDS is used

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.47 % 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 (%)
86execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.991.9835.9316.99
[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
[SA] Several paths (3 paths) - Simplify control structure or force the compiler to use masked instructions. There are 3 issues ( = paths) costing 1 point each.3
[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
92execPartial or unexisting vectorization - No issue detected01.1012.5
85execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.91.06012.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 2 issues ( = data accesses) costing 2 point each.4
[SA] Several paths (3 paths) - Simplify control structure or force the compiler to use masked instructions. There are 3 issues ( = paths) costing 1 point each.3
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
88execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.21.035015.63
[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
57execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.615022.92
[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
80execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.740.6834.4314.45
[SA] Too many paths (70 paths) - Simplify control structure. There are 70 issues ( = paths) costing 1 point each with a malus of 4 points.74
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
94execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.890.5896.4376.34
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 10 issues (= instructions) costing 4 points each.40
[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 indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 3 issues ( = indirect data accesses) costing 4 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] Presence of special instructions executing on a single port (BROADCAST) - Simplify data access and try to get stride 1 access. There are 1 issues (= instructions) costing 1 point each.1
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
84execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.180.48010.16
[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 4 issues ( = data accesses) costing 2 point each.8
[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
[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] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
45execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.60.0930.7713.94
[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
93execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.1010.0681.4866.09
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 10 issues (= instructions) costing 4 points each.40
[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] Too many paths (12 paths) - Simplify control structure. There are 12 issues ( = paths) costing 1 point each with a malus of 4 points.16
[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] 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] 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] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points.2
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
×