options

exec - 2023-09-12 16:31:51 - 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 (%)
1107execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.440.420.912.33
[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] 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
661execInefficient vectorization.1715.87100100
[DA] Ratio time (ORIG)/time (DL1) is greater than 3 (12.27) - Perform blocking. Perform array restructuring. There are 2 issues (= non unit stride or indirect memory access) costing 2 point each, with an additional malus of 13 points due to the ORIG/DL1 ratio.17
739execInefficient vectorization.78.67100100
[DA] Ratio time (ORIG)/time (DL1) is greater than 3 (4.62) - 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 5 points due to the ORIG/DL1 ratio.7
1106execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.43.190.912.33
[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] 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
597execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.41.23012.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 2 issues ( = data accesses) costing 2 point each.4
838execPartial or unexisting vectorization - No issue detected00.76012.5
741execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.100.7311.1113.89
[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
307execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10000.72010
[SA] Too many paths (6561 paths) - Simplify control structure. There are 6561 issues ( = paths) costing 1 point, limited to 1000.1000
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
594execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.40.6012.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 2 issues ( = data accesses) costing 2 point each.4
837execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.20.4328.5716.07
[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
×