options

exec - 2024-03-29 16:52:03 - 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 (20.37 s)

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

[ 3.00 / 3 ] Optimization level option is correctly used

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

[ 3.00 / 3 ] Architecture specific option -march=sapphirerapids is used

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.54 % 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 (%)
25execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.1357.7612.514.06
[SA] Too many paths (9 paths) - Simplify control structure. There are 9 issues ( = paths) costing 1 point each with a malus of 4 points.13
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
16execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.27.133.3312.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 1 issues ( = data accesses) costing 2 point each.2
24execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.464.8311.7613.79
[SA] Too many paths (40 paths) - Simplify control structure. There are 40 issues ( = paths) costing 1 point each with a malus of 4 points.44
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
18execPartial or unexisting vectorization - No issue detected02.72012.5
61execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.102.41010.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 5 issues ( = data accesses) costing 2 point each.10
17execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.222.22012.41
[SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points.20
[SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points.2
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
20execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.81.92012.5
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each.8
19execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.141.05012.15
[SA] Too many paths (8 paths) - Simplify control structure. There are 8 issues ( = paths) costing 1 point each with a malus of 4 points.12
[SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points.2
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
23execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.470.316.6711.46
[SA] Too many paths (41 paths) - Simplify control structure. There are 41 issues ( = paths) costing 1 point each with a malus of 4 points.45
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
28execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.80.15012.5
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each.8
×