options

omp-cloverleaf - 2023-12-19 14:29:19 - MAQAO 2.18.0

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

Stylizer  

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

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

[ 2.86 / 3 ] Optimization level option is correctly used

[ 2.86 / 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.

[ 2.86 / 3 ] Architecture specific option -march=native is used

[ 2 / 2 ] Application is correctly profiled ("Others" category represents 0 % 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 (%)
235omp-cloverleafPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.27.8616.514.56
[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
148omp-cloverleafPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.267.83012.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 13 issues ( = data accesses) costing 2 point each.26
176omp-cloverleafPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.147.4523.0315.38
[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] 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
877omp-cloverleafPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.156.9129.2316.15
[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] 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
154omp-cloverleafPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.286.1614.5214.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 10 issues ( = data accesses) costing 2 point each.20
[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 1 issues ( = indirect data accesses) costing 4 point each.4
336omp-cloverleafPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.205.9243.3317.92
[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 10 issues ( = data accesses) costing 2 point each.20
187omp-cloverleafPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.85.4823.7215.23
[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 2 issues ( = data accesses) costing 2 point each.4
886omp-cloverleafInefficient vectorization.24.5910050
[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
Warning! There is no dynamic data for this loop. Some checks can not been performed.0
338omp-cloverleafPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.144.251614.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 7 issues ( = data accesses) costing 2 point each.14
165omp-cloverleafPartial or unexisting vectorization - Use pragma to force vectorization and check potential dependencies between array access.124.1517.2414.55
[SA] Too many paths (8 paths) - Simplify control structure. There are 8 issues ( = paths) costing 1 point each with a malus of 4 points.12
Warning! Some static analysis are missing because the loop has too many paths. Use a higher value for --maximal_path_number option.0
×