options

exec - 2023-09-11 18:50:08 - MAQAO 2.17.8

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

Strategizer  

[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (99.55%)

If the time spent in analyzed loops is less than 30%, standard loop optimizations will have a limited impact on application performances.

[ 4 / 4 ] Loop profile is not flat

At least one loop coverage is greater than 4% (47.27%), representing an hotspot for the application

[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (25.74%)

If the time spent in analyzed innermost loops is less than 15%, standard innermost loop optimizations such as vectorisation will have a limited impact on application performances.

[ 3 / 3 ] Less than 10% (0%) is spend in BLAS1 operations

It could be more efficient to inline by hand BLAS1 operations

[ 0 / 3 ] Cumulative Outermost/In between loops coverage (73.81%) greater than cumulative innermost loop coverage (25.74%)

Having cumulative Outermost/In between loops coverage greater than cumulative innermost loop coverage will make loop optimization more complex

[ 2 / 2 ] Less than 10% (0%) is spend in Libm/SVML (special functions)

[ 2 / 2 ] Less than 10% (0%) is spend in BLAS2 operations

BLAS2 calls usually could make a poor cache usage and could benefit from inlining.

Optimizer

Loop IDModuleAnalysisPenalty ScoreCoverage (%)Vectorization
Ratio (%)
Vector Length
Use (%)
3120execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.13447.2753.8545.77
[SA] Too many paths (128 paths) - Simplify control structure. There are 128 issues ( = paths) costing 1 point each with a malus of 4 points.132
[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
3103execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10028.758.3348.54
[SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point.1000
[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
2481execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.63012.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
[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
110execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.162.52012.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 8 issues ( = data accesses) costing 2 point each.16
97execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.122.43011.8
[SA] Presence of indirect accesses - Use array restructuring or gather instructions to lower the cost. There are 2 issues ( = indirect data accesses) costing 4 point each.8
[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
3150execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.382.41012.5
[SA] Too many paths (32 paths) - Simplify control structure. There are 32 issues ( = paths) costing 1 point each with a malus of 4 points.36
[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
1908execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.102.11012.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 3 issues ( = data accesses) costing 2 point each.6
[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
2472execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.42.09012.5
[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
627execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10022.05012.5
[SA] Too many paths (65026 paths) - Simplify control structure. There are 65026 issues ( = paths) costing 1 point, limited to 1000.1000
[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
665execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.742.01012.5
[SA] Too many paths (68 paths) - Simplify control structure. There are 68 issues ( = paths) costing 1 point each with a malus of 4 points.72
[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
×