options

exec - 2023-09-12 16:27:10 - MAQAO 2.17.8

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

Optimizer

Loop IDModuleAnalysisPenalty ScoreCoverage (%)Vectorization
Ratio (%)
Vector Length
Use (%)
672execInefficient vectorization.1225.6100100
[DA] Ratio time (ORIG)/time (DL1) is greater than 3 (11.67) - Perform blocking. Perform array restructuring. There are 0 issues (= non unit stride or indirect memory access) costing 2 point each, with an additional malus of 12 points due to the ORIG/DL1 ratio.12
679execInefficient vectorization.3414.71100100
[SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 12 issues ( = arrays) costing 2 points each24
[DA] Ratio time (ORIG)/time (DL1) is greater than 3 (5.34) - Perform blocking. Perform array restructuring. There are 1 issues (= non unit stride or indirect memory access) costing 2 point each, with an additional malus of 6 points due to the ORIG/DL1 ratio.8
[SA] Presence of a large number of scalar integer instructions - Simplify loop structure, perform loop splitting or perform unroll and jam. This issue costs 2 points.2
971execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.8413.2490.9189.22
[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 10 issues ( = arrays) costing 2 points each20
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 3 issues (= instructions) costing 4 points each.12
[SA] Presence of special instructions executing on a single port (BLEND/MERGE, BROADCAST) - Simplify data access and try to get stride 1 access. There are 10 issues (= instructions) costing 1 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
[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] Inefficient vectorization: use of masked instructions - Simplify control structure. 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
1264execInefficient vectorization.21.0210050
[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
230execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.210.9792.6871.67
[SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, COMPRESS/EXPAND, BLEND/MERGE, SHUFFLE/PERM, BROADCAST) - Simplify data access and try to get stride 1 access. There are 7 issues (= instructions) costing 1 point each.7
[SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 2 issues ( = arrays) costing 2 points each4
[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] Inefficient vectorization: use of masked instructions - Simplify control structure. The issue costs 2 points.2
[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
[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] Presence of a large number of scalar integer instructions - Simplify loop structure, perform loop splitting or perform unroll and jam. This issue costs 2 points.2
674execPartial or unexisting vectorization - No issue detected00.89012.5
245execInefficient vectorization.100.65100100
[SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 5 issues ( = arrays) costing 2 points each10
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
780execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.20.632515.63
[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
241execInefficient vectorization.40.52100100
[SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 2 issues ( = arrays) costing 2 points each4
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
772execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.20.4933.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 1 issues ( = data accesses) costing 2 point each.2
×