Help is available by moving the cursor above any 
symbol or by checking MAQAO website.
[ 4 / 4 ] Application profile is long enough (12.13 s)
To have good quality measurements, it is advised that the application profiling time is greater than 10 seconds.
[ 3.00 / 3 ] Optimization level option is correctly used
[ 3.00 / 3 ] Most of time spent in analyzed modules comes from functions compiled with -g and -fno-omit-frame-pointer
-g option gives access to debugging informations, such are source locations. -fno-omit-frame-pointer improve the accuracy of callchains found during the application profiling.
[ 3.00 / 3 ] Architecture specific option -march=sapphirerapids is used
[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.22 % 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
[ 4 / 4 ] Enough time of the experiment time spent in analyzed loops (84.36%)
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% (33.66%), representing an hotspot for the application
[ 4 / 4 ] Enough time of the experiment time spent in analyzed innermost loops (19.44%)
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 (64.92%) greater than cumulative innermost loop coverage (19.44%)
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.
| Loop ID | Analysis | Penalty Score |
|---|---|---|
| ►Loop 44 - libparcsr_ls.so | Execution Time: 33 % - Vectorization Ratio: 54.26 % - Vector Length Use: 46.03 % | |
| ►Loop Computation Issues | 6 | |
| ○ | [SA] Presence of expensive FP instructions - Perform hoisting, change algorithm, use SVML or proper numerical library or perform value profiling (count the number of distinct input values). There are 1 issues (= instructions) costing 4 points each. | 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 | 1002 | |
| ○ | [SA] Too many paths (16385 paths) - Simplify control structure. There are 16385 issues ( = paths) costing 1 point, limited to 1000. | 1000 |
| ○ | [SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 74 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 16 issues (= instructions) costing 4 points each. | 64 |
| ○ | [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 10 issues (= instructions) costing 1 point each. | 10 |
| ►Vectorization Roadblocks | 1002 | |
| ○ | [SA] Too many paths (16385 paths) - Simplify control structure. There are 16385 issues ( = paths) costing 1 point, limited to 1000. | 1000 |
| ○ | [SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Inefficient Vectorization | 74 | |
| ○ | [SA] Presence of expensive instructions (GATHER/SCATTER) - Use array restructuring. There are 16 issues (= instructions) costing 4 points each. | 64 |
| ○ | [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 10 issues (= instructions) costing 1 point each. | 10 |
| ►Loop 147 - libseq_mv.so | Execution Time: 8 % - Vectorization Ratio: 53.85 % - Vector Length Use: 45.77 % | |
| ►Control Flow Issues | 134 | |
| ○ | [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 |
| ►Data Access Issues | 37 | |
| ○ | [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 5 issues (= instructions) costing 1 point each. | 5 |
| ►Vectorization Roadblocks | 134 | |
| ○ | [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 |
| ►Inefficient Vectorization | 37 | |
| ○ | [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 5 issues (= instructions) costing 1 point each. | 5 |
| ►Loop 130 - libseq_mv.so | Execution Time: 7 % - Vectorization Ratio: 58.33 % - Vector Length Use: 48.54 % | |
| ►Control Flow Issues | 2 | |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 37 | |
| ○ | [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 5 issues (= instructions) costing 1 point each. | 5 |
| ►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 | 37 | |
| ○ | [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 5 issues (= instructions) costing 1 point each. | 5 |
| ►Loop 32 - libseq_mv.so | 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 | 22 | |
| ○ | [SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points. | 20 |
| ○ | [SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Vectorization Roadblocks | 22 | |
| ○ | [SA] Too many paths (16 paths) - Simplify control structure. There are 16 issues ( = paths) costing 1 point each with a malus of 4 points. | 20 |
| ○ | [SA] Non innermost loop (Outermost) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Loop 139 - libseq_mv.so | Execution Time: 2 % - Vectorization Ratio: 53.85 % - Vector Length Use: 45.77 % | |
| ►Control Flow Issues | 134 | |
| ○ | [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 |
| ►Data Access Issues | 37 | |
| ○ | [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 5 issues (= instructions) costing 1 point each. | 5 |
| ►Vectorization Roadblocks | 134 | |
| ○ | [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 |
| ►Inefficient Vectorization | 37 | |
| ○ | [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 5 issues (= instructions) costing 1 point each. | 5 |
| ►Loop 25 - libparcsr_mv.so | Execution Time: 1 % - 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 862 - libparcsr_ls.so | Execution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Control Flow Issues | 2 | |
| ○ | [SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points. | 2 |
| ►Data Access Issues | 2 | |
| ○ | [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 | 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 |
| ►Loop 854 - libparcsr_ls.so | Execution Time: 1 % - Vectorization Ratio: 0.00 % - Vector Length Use: 12.50 % | |
| ►Control Flow Issues | 1002 | |
| ○ | [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 |
| ►Data Access Issues | 2 | |
| ○ | [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 | 1002 | |
| ○ | [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 |
| ►Loop 326 - libparcsr_ls.so | Execution Time: 1 % - 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 1987 - libparcsr_ls.so | Execution Time: 1 % - 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 |