options

exec - 2024-04-18 02:26:51 - MAQAO 2.20.0

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 (98.00%)

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

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

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

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 IDAnalysisPenalty Score
Loop 3093 - exec+Execution Time: 40 % - Vectorization Ratio: 57.41 % - Vector Length Use: 29.28 %
Loop Computation Issues+2
[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
Control Flow Issues+70
[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
Data Access Issues+35
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 8 issues (= instructions) costing 4 points each.32
[SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each.3
Vectorization Roadblocks+70
[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
Inefficient Vectorization+35
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 8 issues (= instructions) costing 4 points each.32
[SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each.3
Loop 3076 - exec+Execution Time: 7 % - Vectorization Ratio: 60.78 % - Vector Length Use: 30.27 %
Loop Computation Issues+2
[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
Control Flow Issues+2
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
Data Access Issues+35
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 8 issues (= instructions) costing 4 points each.32
[SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each.3
Vectorization Roadblocks+1002
[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
Inefficient Vectorization+35
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 8 issues (= instructions) costing 4 points each.32
[SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each.3
Loop 2462 - exec+Execution Time: 3 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 %
Loop Computation Issues+6
[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
Control Flow Issues+2
[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
Data Access Issues+4
[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
Vectorization Roadblocks+6
[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 2 issues ( = data accesses) costing 2 point each.4
Loop 3123 - exec+Execution Time: 3 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 %
Loop Computation Issues+2
[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
Control Flow Issues+38
[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
Vectorization Roadblocks+38
[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
Loop 96 - exec+Execution Time: 2 % - Vectorization Ratio: 0.00 % - Vector Length Use: 11.80 %
Control Flow Issues+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
Data Access Issues+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
Vectorization Roadblocks+12
[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] 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
Loop 2453 - exec+Execution Time: 2 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 %
Control Flow Issues+2
[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
Data Access Issues+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
Vectorization Roadblocks+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
[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
Loop 3085 - exec+Execution Time: 2 % - Vectorization Ratio: 57.41 % - Vector Length Use: 29.28 %
Loop Computation Issues+2
[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
Control Flow Issues+70
[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
Data Access Issues+35
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 8 issues (= instructions) costing 4 points each.32
[SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each.3
Vectorization Roadblocks+70
[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
Inefficient Vectorization+35
[SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 8 issues (= instructions) costing 4 points each.32
[SA] Presence of special instructions executing on a single port (INSERT/EXTRACT, BLEND/MERGE) - Simplify data access and try to get stride 1 access. There are 3 issues (= instructions) costing 1 point each.3
Loop 109 - exec+Execution Time: 2 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 %
Data Access Issues+16
[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
Vectorization Roadblocks+16
[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
Loop 1900 - exec+Execution Time: 2 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 %
Control Flow Issues+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
Data Access Issues+12
[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] 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] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points.2
Vectorization Roadblocks+14
[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] 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] 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
Loop 1890 - exec+Execution Time: 2 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 %
Control Flow Issues+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
Data Access Issues+8
[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] More than 20% of the loads are accessing the stack - Perform loop splitting to decrease pressure on registers. This issue costs 2 points.2
Vectorization Roadblocks+10
[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] 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
×