options

exec - 2023-12-20 11:33:16 - MAQAO 2.18.1

Help is available by moving the cursor above any symbol or by checking MAQAO website.

Stylizer  

[ 4 / 4 ] Application profile is long enough (22.68 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 -mcpu is used

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0 % 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 (%)
1092execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.16213.329295
[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 40 issues (= instructions) costing 4 points each.160
[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
571execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.100211.2900
[SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point.1000
[SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points.2
540execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.27.03022.47
[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
606execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.326.7292.31100
[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
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
522execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10005.64020
[SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point.1000
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
49execInefficient vectorization.645.18100100
[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
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
545execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.45.16022.25
[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
523execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10005.03021.55
[SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point.1000
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
52execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.664.9295.2496.43
[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: 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
572execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10004.0831.8231.82
[SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point.1000
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
×