options

exec - 2024-02-21 10:09:13 - MAQAO 2.19.1

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

Optimizer

Loop IDModuleAnalysisPenalty ScoreCoverage (%)Vectorization
Ratio (%)
Vector Length
Use (%)
31execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.1437.4413.3314.17
[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 5 issues ( = data accesses) costing 2 point each.10
[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 (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
32execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.220.62012.5
[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
26execThe loop is fully and efficiently vectorized.010.85100100
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
33execPartial or unexisting vectorization - No issue detected010.84012.5
17execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.362.0611.1113.89
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 9 issues ( = indirect data accesses) costing 4 point each.36
21execPartial or unexisting vectorization - No issue detected00.31012.5
35execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.150.03011.51
[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
25execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.150.01012.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
24execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.150.01012.13
[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
30execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.160.01010.94
[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 6 issues ( = data accesses) costing 2 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 (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
×