options

exec - 2024-02-22 11:41:29 - 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 (18.99 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=znver4 is used

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.17 % 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 (%)
483execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.424.4012.5
[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
481execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.158.4012.5
[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
[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
1191execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.47.22012.5
[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
1199execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.46.64012.5
[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
1190execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.160.98012.5
[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] 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
[SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points.2
470execThe loop is fully and efficiently vectorized.00.96100100
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
1198execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.120.8733.3316.67
[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
[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
[SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points.2
1187execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.40.6012.5
[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
774execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.150.6012.5
[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
[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
1118execThe loop is fully and efficiently vectorized.00.6100100
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
×