options

exec - 2023-09-05 18:43:49 - MAQAO 2.17.8

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

Stylizer  

[ 0 / 9 ] Compilation options are not available

Compilation options are an important optimization leverage but ONE-View is not able to analyze them.

[ 4 / 4 ] Application profile is long enough (31 s)

To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 1.77 % of the execution time)

To have a representative profiling, it is advised that the category "Others" represents less than 20% of the execution time in order to analyze as much as possible of the user code

Strategizer  

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

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% (59.78%), representing an hotspot for the application

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

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 (60.08%) greater than cumulative innermost loop coverage (38.06%)

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 (%)
595libkripke.soPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.3859.7863.9333.91
[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 (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
642libkripke.soPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.1612.5012.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 6 issues ( = data accesses) costing 2 point each.12
[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
431libkripke.soInefficient vectorization.1212.4410050
[DA] Ratio time (ORIG)/time (DL1) is greater than 3 (5.48) - 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 6 points due to the ORIG/DL1 ratio.10
[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
504libkripke.soInefficient vectorization.1012.3710050
[DA] Ratio time (ORIG)/time (DL1) is greater than 3 (3.89) - 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 4 points due to the ORIG/DL1 ratio.8
[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
525libkripke.soInefficient vectorization.20.7110050
[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
641libkripke.soPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.240.18012.11
[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 7 issues ( = data accesses) costing 2 point each.14
[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] 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
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
640libkripke.soPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.110.03012.2
[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
596libkripke.soPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.380.03011.46
[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 (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
383libkripke.soPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.10000.0214.0411.95
[SA] Too many paths (at least 1000 paths) - Simplify control structure. There are at least 1000 issues ( = paths) costing 1 point.1000
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
597libkripke.soPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.700.02012.5
[SA] Too many paths (64 paths) - Simplify control structure. There are 64 issues ( = paths) costing 1 point each with a malus of 4 points.68
[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
×