options

exec - 2024-04-11 16:30:40 - 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 (81.6 s)

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

[ 2.91 / 3 ] Optimization level option is correctly used

[ 2.91 / 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.91 / 3 ] Architecture specific option -march=native is used

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.76 % 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 (%)
873execInefficient vectorization.227.1910025
[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
880execInefficient vectorization.2411.3810050
[SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 11 issues ( = arrays) costing 2 points each22
[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
2090execPartial or unexisting vectorization - No issue detected09.9112.7714.1
1864execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.165.3254.5515.91
[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 indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 1 issues ( = indirect data accesses) costing 4 point each.4
1370execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.922.029748.88
[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] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 9 issues ( = arrays) costing 2 points each18
[SA] Presence of special instructions executing on a single port (BROADCAST) - Simplify data access and try to get stride 1 access. There are 6 issues (= instructions) costing 1 point each.6
[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
393execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.291.2289.4744.08
[SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 5 issues ( = arrays) costing 2 points each10
[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
[SA] Presence of special instructions executing on a single port (COMPRESS/EXPAND, BROADCAST) - Simplify data access and try to get stride 1 access. There are 5 issues (= instructions) costing 1 point each.5
[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
[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
875execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.180.993015.31
[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 9 issues ( = data accesses) costing 2 point each.18
2345execInefficient vectorization.20.9710050
[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
332execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.440.5486.9644.57
[SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 8 issues ( = arrays) costing 2 points each16
[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 (COMPRESS/EXPAND, BROADCAST) - Simplify data access and try to get stride 1 access. There are 8 issues (= instructions) costing 1 point each.8
[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
[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
981execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.20.4633.3316.67
[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
×