options

exec - 2024-03-27 15:38:45 - 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 (41.46 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 -x CORE is used

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.16 % 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 (%)
858execInefficient vectorization.228.7910025
[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
867execInefficient vectorization.2611.1510050
[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] 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
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
2076execPartial or unexisting vectorization - No issue detected010.7625.4515.68
1847execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.145.7254.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 5 issues ( = data accesses) costing 2 point each.10
[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
1342execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.601.8194.7448.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] 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
379execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10001.17010.85
[SA] Too many paths (6561 paths) - Simplify control structure. There are 6561 issues ( = paths) costing 1 point, limited to 1000.1000
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
2331execInefficient vectorization.20.9510050
[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
860execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.80.88011.93
[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
949execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.80.6333.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 4 issues ( = data accesses) costing 2 point each.8
319execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.850.509.94
[SA] Too many paths (81 paths) - Simplify control structure. There are 81 issues ( = paths) costing 1 point each with a malus of 4 points.85
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
×