options

cp2k.psmp - 2023-07-18 11:54:34 - MAQAO 2.17.5

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

Optimizer

Loop IDModuleAnalysisPenalty ScoreCoverage (%)Vectorization
Ratio (%)
Vector Length
Use (%)
94704cp2k.psmpPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.117.7215.3812.02
[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
[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
94746cp2k.psmpPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.116.817.6910.58
[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
[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
94695cp2k.psmpPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.955.695.5611.24
[SA] Too many paths (86 paths) - Simplify control structure. There are 86 issues ( = paths) costing 1 point each with a malus of 4 points.90
[SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 3 issues (= calls) costing 1 point each.3
[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
94735cp2k.psmpPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.955.244.7611.48
[SA] Too many paths (86 paths) - Simplify control structure. There are 86 issues ( = paths) costing 1 point each with a malus of 4 points.90
[SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 3 issues (= calls) costing 1 point each.3
[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
94747cp2k.psmpPartial or unexisting vectorization - No issue detected03.67012.5
286418cp2k.psmpPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.22.7607.03
[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
233987cp2k.psmpPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.42.6377.1480
[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 2 issues ( = data accesses) costing 2 point each.4
94705cp2k.psmpPartial or unexisting vectorization - No issue detected02.62012.5
151455cp2k.psmpPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.122.4485.7187.5
[SA] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 3 issues ( = arrays) costing 2 points each6
[SA] Presence of special instructions executing on a single port (BROADCAST) - Simplify data access and try to get stride 1 access. There are 2 issues (= instructions) costing 1 point each.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
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
233985cp2k.psmpPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.341.9396.396.76
[SA] Too many paths (18 paths) - Simplify control structure. There are 18 issues ( = paths) costing 1 point each with a malus of 4 points.22
[SA] Less than 10% of the FP ADD/SUB/MUL arithmetic operations are performed using FMA - Reorganize arithmetic expressions to exhibit potential for FMA. This issue costs 4 points.4
[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
[SA] Presence of special instructions executing on a single port (BROADCAST) - Simplify data access and try to get stride 1 access. There are 2 issues (= instructions) costing 1 point each.2
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.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] Inefficient vectorization: more than 10% of the vector loads instructions are unaligned - When allocating arrays, don’t forget to align them. There are 0 issues ( = arrays) costing 2 points each0
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
×