options

exec - 2024-02-23 13:28:18 - MAQAO 2.19.1

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

Stylizer  

[ 4 / 4 ] Application profile is long enough (290.35 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 -axCORE is used

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0.61 % 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

Optimizer

Loop IDModuleAnalysisPenalty ScoreCoverage (%)Vectorization
Ratio (%)
Vector Length
Use (%)
145execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.993.1444.0718.01
[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 (3 paths) - Simplify control structure or force the compiler to use masked instructions. There are 3 issues ( = paths) costing 1 point each.3
[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
152execPartial or unexisting vectorization - No issue detected01.26012.5
144execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.90.93012.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 (3 paths) - Simplify control structure or force the compiler to use masked instructions. There are 3 issues ( = paths) costing 1 point each.3
[SA] Non innermost loop (InBetween) - Collapse loop with innermost ones. This issue costs 2 points.2
84execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.60.8333.3314.58
[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
131execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.310.8346.8117.15
[SA] Too many paths (24 paths) - Simplify control structure. There are 24 issues ( = paths) costing 1 point each with a malus of 4 points.28
[SA] Presence of calls - Inline either by compiler or by hand and use SVML for libm calls. There are 3 issues (= calls) costing 1 point each.3
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
154execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.40.667.6913.46
[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
143execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.110.33011.25
[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
147execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.20.275015.63
[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
85execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.60.1433.3314.58
[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
69execPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.60.0938.4615.87
[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
×