options

exec - 2023-10-24 10:44:21 - MAQAO 2.17.9

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

Optimizer

Loop IDModuleAnalysisPenalty ScoreCoverage (%)Vectorization
Ratio (%)
Vector Length
Use (%)
227execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.210.12025
[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
913execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.99.6535.7133.93
[SA] Too many paths (5 paths) - Simplify control structure. There are 5 issues ( = paths) costing 1 point each with a malus of 4 points.9
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
282execInefficient vectorization.327.44100100
[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
138execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.126.99023.53
[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
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
175execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.46.92025
[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
146execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.126.39023.44
[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
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
184execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.46.29024.2
[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
130execInefficient vectorization.165.5100100
[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 4 issues (= instructions) costing 4 points each.16
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
120execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.665.3198.3998.79
[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
123execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.665.139598.75
[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
×