OV - exec - Loop 2756

  (2755) 0x483fc0 CMP	X30, X21

  (2755) 0x483fc4 STR	X23, [X5, X26,LSL #3]

  (2755) 0x483fc8 STR	X20, [X7, X26,LSL #3]

  (2755) 0x483fcc ORR	X19, XZR, X21

  (2755) 0x483fd0 ORR	X20, XZR, X24

  (2755) 0x483fd4 ORR	X23, XZR, X6

  (2755) 0x483fd8 ORR	X26, XZR, X30

  (2755) 0x483fdc B.EQ	4841e0

  (2755) 0x483fe0 LDUR	X8, [X29, #496]

  (2755) 0x483fe4 LDR	X8, [X8]

  (2755) 0x483fe8 CBZ	X8, 483ff4

  (2755) 0x483fec ADD	X6, X23, #1

  (2755) 0x483ff0 STR	X23, [X0, X26,LSL #3]

  (2755) 0x483ff4 LDR	X8, [X15]

  (2755) 0x483ff8 CBZ	X8, 4840c0

  (2755) 0x483ffc LDUR	X8, [X29, #488]

  (2755) 0x484000 ADD	X13, X8, X26,LSL #3

  (2755) 0x484004 LDP	X14, X8, [X13]

  (2755) 0x484008 CMP	X14, X8

  (2755) 0x48400c B.GE	4840e0

  (2755) 0x484010 LDR	X8, [SP, #72]

  (2755) 0x484014 ORR	X24, XZR, X20

  (2755) 0x484018 LDR	X19, [X8]

  (2755) 0x48401c LDUR	X8, [X29, #448]

  (2755) 0x484020 LDR	X27, [X8]

  (2755) 0x484024 B	484038

    (2759) 0x484028 LDR	X8, [X13, #8]

    (2759) 0x48402c ADD	X14, X14, #1

    (2759) 0x484030 CMP	X14, X8

    (2759) 0x484034 B.GE	4840c4

    (2759) 0x484038 LDR	X28, [X17, X14,LSL #3]

    (2759) 0x48403c ADD	X8, X28, #1

    (2759) 0x484040 LDR	X9, [X18, X28,LSL #3]

    (2759) 0x484044 LDR	X10, [X18, X8,LSL #3]

    (2759) 0x484048 B	484050

      (2761) 0x48404c ADD	X9, X9, #1

      (2761) 0x484050 CMP	X9, X10

      (2761) 0x484054 B.GE	484080

      (2761) 0x484058 LDR	X25, [X22]

      (2761) 0x48405c LDR	X12, [X19, X9,LSL #3]

      (2761) 0x484060 ADD	X30, X0, X25,LSL #3

      (2761) 0x484064 LDR	X25, [X30, X12,LSL #3]

      (2761) 0x484068 CMP	X25, X20

      (2761) 0x48406c B.GE	48404c

      (2761) 0x484070 STR	X24, [X30, X12,LSL #3]

      (2761) 0x484074 ADD	X24, X24, #1

      (2761) 0x484078 LDR	X10, [X18, X8,LSL #3]

      (2761) 0x48407c B	48404c

    (2759) 0x484080 LDR	X9, [X1, X28,LSL #3]

    (2759) 0x484084 LDR	X10, [X1, X8,LSL #3]

    (2759) 0x484088 B	484090

      (2760) 0x48408c ADD	X9, X9, #1

      (2760) 0x484090 CMP	X9, X10

      (2760) 0x484094 B.GE	484028

      (2760) 0x484098 LDR	X12, [X27, X9,LSL #3]

      (2760) 0x48409c LDR	X25, [X0, X12,LSL #3]

      (2760) 0x4840a0 CMP	X25, X23

      (2760) 0x4840a4 B.GE	48408c

      (2760) 0x4840a8 STR	X6, [X0, X12,LSL #3]

      (2760) 0x4840ac ADD	X6, X6, #1

      (2760) 0x4840b0 LDR	X10, [X1, X8,LSL #3]

      (2760) 0x4840b4 B	48408c

  (2755) 0x4840c0 ORR	X24, XZR, X20

  (2755) 0x4840c4 ADD	X30, X26, #1

  (2755) 0x4840c8 LDR	X28, [X2, X26,LSL #3]

  (2755) 0x4840cc LDR	X8, [X2, X30,LSL #3]

  (2755) 0x4840d0 CMP	X28, X8

  (2755) 0x4840d4 B.GE	483fc0

0x4840d8 B	4840f8

  (2755) 0x4840e0 ORR	X24, XZR, X20

  (2755) 0x4840e4 ADD	X30, X26, #1

  (2755) 0x4840e8 LDR	X28, [X2, X26,LSL #3]

  (2755) 0x4840ec LDR	X8, [X2, X30,LSL #3]

  (2755) 0x4840f0 CMP	X28, X8

  (2755) 0x4840f4 B.GE	483fc0

0x4840f8 LDP	X9, X8, [X29, #968]

0x4840fc LDR	X27, [X9]

0x484100 LDR	X13, [X8]

0x484104 LDP	X9, X8, [X29, #984]

0x484108 LDR	X14, [X9]

0x48410c LDR	X19, [X8]

0x484110 B	484130

0x484120 LDR	X8, [X2, X30,LSL #3]

0x484124 ADD	X28, X28, #1

0x484128 CMP	X28, X8

0x48412c B.GE	483fc0

0x484130 LDR	X9, [X3, X28,LSL #3]

0x484134 ADD	X8, X9, #1

0x484138 LDR	X10, [X4, X9,LSL #3]

0x48413c LDR	X12, [X4, X8,LSL #3]

0x484140 B	484148

  (2758) 0x484144 ADD	X10, X10, #1

  (2758) 0x484148 CMP	X10, X12

  (2758) 0x48414c B.GE	484180

  (2758) 0x484150 LDR	X25, [X27, X10,LSL #3]

  (2758) 0x484154 LDR	X16, [X0, X25,LSL #3]

  (2758) 0x484158 CMP	X16, X23

  (2758) 0x48415c B.GE	484144

  (2758) 0x484160 STR	X6, [X0, X25,LSL #3]

  (2758) 0x484164 ADD	X6, X6, #1

  (2758) 0x484168 LDR	X12, [X4, X8,LSL #3]

  (2758) 0x48416c B	484144

0x484180 LDR	X10, [X11]

0x484184 CBZ	X10, 484120

/home/eoseret/qaas/qaas_runs/178-188-3659/intel/AMG/build/AMG/AMG/parcsr_mv/par_csr_matop.c: 127 - 242

--------------------------------------------------------------------------------

127:     for (i1 = ns; i1 < ne; i1++)

[...]

135:       if ( allsquare ) {

136:          B_marker[i1] = jj_count_diag;

137:          jj_count_diag++;

[...]

144:       if (num_cols_offd_A)

145:       {

146:          for (jj2 = A_offd_i[i1]; jj2 < A_offd_i[i1+1]; jj2++)

147:          {

148:             i2 = A_offd_j[jj2];

[...]

154:             for (jj3 = B_ext_offd_i[i2]; jj3 < B_ext_offd_i[i2+1]; jj3++)

155:             {

156:                i3 = num_cols_diag_B+B_ext_offd_j[jj3];

[...]

164:                if (B_marker[i3] < jj_row_begin_offd)

165:                {

166:                   B_marker[i3] = jj_count_offd;

167:                   jj_count_offd++;

168:                }

169:             }

170:             for (jj3 = B_ext_diag_i[i2]; jj3 < B_ext_diag_i[i2+1]; jj3++)

171:             {

172:                i3 = B_ext_diag_j[jj3];

173:

174:                if (B_marker[i3] < jj_row_begin_diag)

175:                {

176:                   B_marker[i3] = jj_count_diag;

177:                   jj_count_diag++;

[...]

187:       for (jj2 = A_diag_i[i1]; jj2 < A_diag_i[i1+1]; jj2++)

188:       {

189:          i2 = A_diag_j[jj2];

[...]

195:          for (jj3 = B_diag_i[i2]; jj3 < B_diag_i[i2+1]; jj3++)

196:          {

197:             i3 = B_diag_j[jj3];

[...]

205:             if (B_marker[i3] < jj_row_begin_diag)

206:             {

207:                B_marker[i3] = jj_count_diag;

208:                jj_count_diag++;

[...]

216:          if (num_cols_offd_B)

[...]

241:       (*C_diag_i)[i1] = jj_row_begin_diag;

242:       (*C_offd_i)[i1] = jj_row_begin_offd;

Coverage (%)	Name	Source Location	Module
►98.95+	__kmp_invoke_microtask		libomp.so
○	__kmp_invoke_task_func		libomp.so
○	__kmp_launch_thread		libomp.so
○	__kmp_launch_worker(void*)		libomp.so
○	start_thread		libc.so.6
○	thread_start		libc.so.6
►1.05+	__kmp_invoke_microtask		libomp.so
○	__kmp_invoke_task_func		libomp.so
○	__kmp_fork_call		libomp.so
○	__kmpc_fork_call		libomp.so
○	hypre_ParMatmul_RowSizes	par_csr_matop.c:286	exec
○	hypre_ParMatmul	par_csr_matop.c:811	exec
○	hypre_BoomerAMGSetup	par_amg_setup.c:1226	exec
○	hypre_PCGSetup	pcg.c:234	exec
○	main	amg.c:398	exec
○	__libc_start_call_main		libc.so.6
○	__libc_start_main		libc.so.6
○	_start		exec

min	med	avg	max

Percentile Index	10	20	30	40	50	60	70	80	90	100
Value

min	med	avg	max

Percentile Index	10	20	30	40	50	60	70	80	90	100
Value

Path /

Metric	Value
CQA speedup if no scalar integer	1.00
CQA speedup if FP arith vectorized	1.00
CQA speedup if fully vectorized	4.00
CQA speedup if no inter-iteration dependency	NA
CQA speedup if next bottleneck killed	1.47
Bottlenecks	P10, P11, P12,
Function	hypre_ParMatmul_RowSizes.omp_outlined
Source	par_csr_matop.c:187-189,par_csr_matop.c:195-195,par_csr_matop.c:216-216
Source loop unroll info	NA
Source loop unroll confidence level	NA
Unroll/vectorization loop type	NA
Unroll factor	NA
CQA cycles	3.67
CQA cycles if no scalar integer	3.67
CQA cycles if FP arith vectorized	3.67
CQA cycles if fully vectorized	0.92
Front-end cycles	2.38
P0 cycles	2.50
P1 cycles	2.50
P2 cycles	0.75
P3 cycles	0.75
P4 cycles	0.75
P5 cycles	0.75
P6 cycles	0.00
P7 cycles	0.00
P8 cycles	0.00
P9 cycles	0.00
P10 cycles	3.67
P11 cycles	3.67
P12 cycles	3.67
P13 cycles	0.00
P14 cycles	0.00
DIV/SQRT cycles	0.00
Inter-iter dependencies cycles	NA
FE+BE cycles (UFS)	NA
Stall cycles (UFS)	NA
Nb insns	19.00
Nb uops	19.00
Nb loads	NA
Nb stores	0.00
Nb stack references	0.00
FLOP/cycle	0.00
Nb FLOP add-sub	0.00
Nb FLOP mul	0.00
Nb FLOP fma	0.00
Nb FLOP div	0.00
Nb FLOP rcp	0.00
Nb FLOP sqrt	0.00
Nb FLOP rsqrt	0.00
Bytes/cycle	0.00
Bytes prefetched	0.00
Bytes loaded	0.00
Bytes stored	0.00
Stride 0	NA
Stride 1	NA
Stride n	NA
Stride unknown	NA
Stride indirect	NA
Vectorization ratio all	0.00
Vectorization ratio load	0.00
Vectorization ratio store	NA
Vectorization ratio mul	NA
Vectorization ratio add_sub	NA
Vectorization ratio fma	NA
Vectorization ratio div_sqrt	NA
Vectorization ratio other	0.00
Vector-efficiency ratio all	25.00
Vector-efficiency ratio load	25.00
Vector-efficiency ratio store	NA
Vector-efficiency ratio mul	NA
Vector-efficiency ratio add_sub	NA
Vector-efficiency ratio fma	NA
Vector-efficiency ratio div_sqrt	NA
Vector-efficiency ratio other	25.00

Metric	Value
CQA speedup if no scalar integer	1.00
CQA speedup if FP arith vectorized	1.00
CQA speedup if fully vectorized	4.00
CQA speedup if no inter-iteration dependency	NA
CQA speedup if next bottleneck killed	1.47
Bottlenecks	P10, P11, P12,
Function	hypre_ParMatmul_RowSizes.omp_outlined
Source	par_csr_matop.c:187-189,par_csr_matop.c:195-195,par_csr_matop.c:216-216
Source loop unroll info	NA
Source loop unroll confidence level	NA
Unroll/vectorization loop type	NA
Unroll factor	NA
CQA cycles	3.67
CQA cycles if no scalar integer	3.67
CQA cycles if FP arith vectorized	3.67
CQA cycles if fully vectorized	0.92
Front-end cycles	2.38
P0 cycles	2.50
P1 cycles	2.50
P2 cycles	0.75
P3 cycles	0.75
P4 cycles	0.75
P5 cycles	0.75
P6 cycles	0.00
P7 cycles	0.00
P8 cycles	0.00
P9 cycles	0.00
P10 cycles	3.67
P11 cycles	3.67
P12 cycles	3.67
P13 cycles	0.00
P14 cycles	0.00
DIV/SQRT cycles	0.00
Inter-iter dependencies cycles	NA
FE+BE cycles (UFS)	NA
Stall cycles (UFS)	NA
Nb insns	19.00
Nb uops	19.00
Nb loads	NA
Nb stores	0.00
Nb stack references	0.00
FLOP/cycle	0.00
Nb FLOP add-sub	0.00
Nb FLOP mul	0.00
Nb FLOP fma	0.00
Nb FLOP div	0.00
Nb FLOP rcp	0.00
Nb FLOP sqrt	0.00
Nb FLOP rsqrt	0.00
Bytes/cycle	0.00
Bytes prefetched	0.00
Bytes loaded	0.00
Bytes stored	0.00
Stride 0	NA
Stride 1	NA
Stride n	NA
Stride unknown	NA
Stride indirect	NA
Vectorization ratio all	0.00
Vectorization ratio load	0.00
Vectorization ratio store	NA
Vectorization ratio mul	NA
Vectorization ratio add_sub	NA
Vectorization ratio fma	NA
Vectorization ratio div_sqrt	NA
Vectorization ratio other	0.00
Vector-efficiency ratio all	25.00
Vector-efficiency ratio load	25.00
Vector-efficiency ratio store	NA
Vector-efficiency ratio mul	NA
Vector-efficiency ratio add_sub	NA
Vector-efficiency ratio fma	NA
Vector-efficiency ratio div_sqrt	NA
Vector-efficiency ratio other	25.00

Path /

Average path: Display a virtual path defined by average values of all real paths

Function	hypre_ParMatmul_RowSizes.omp_outlined
Source file and lines	par_csr_matop.c:127-242
Module	exec

The loop is defined in /home/eoseret/qaas/qaas_runs/178-188-3659/intel/AMG/build/AMG/AMG/parcsr_mv/par_csr_matop.c:127,135-137,144-148,154-156,164-177,187-189,195-197,205-208,216,241-242.

Analyzed code is defined in /home/eoseret/qaas/qaas_runs/178-188-3659/intel/AMG/build/AMG/AMG/parcsr_mv/par_csr_matop.c:187-189,195,216.

Warnings:

Non-innermost loop: analyzing only self part (ignoring child loops).
Ignoring paths for analysis
Failed to get the number of paths
RecMII not computed since number of paths is unknown or > max_paths
Streams not analyzed since number of paths is unknown or > max_paths

gain
potential
hint
expert

Vectorization

Your loop is not vectorized. 4 data elements could be processed at once in vector registers. By vectorizing your loop, you can lower the cost of an iteration from 3.67 to 0.92 cycles (4.00x speedup).

Details

All VPU instructions are used in scalar version (process only one data element in vector registers). Since your execution units are vector units, only a vectorized loop can use their full power.

Workaround

Try another compiler or update/tune your current one:
- recompile with ffast-math (included in Ofast) to extend loop vectorization to FP reductions.
Remove inter-iterations dependences from your loop and make it unit-stride:
- If your arrays have 2 or more dimensions, check whether elements are accessed contiguously and, otherwise, try to permute loops accordingly: C storage order is row-major: for(i) for(j) a[j][i] = b[j][i]; (slow, non stride 1) => for(i) for(j) a[i][j] = b[i][j]; (fast, stride 1)
- If your loop streams arrays of structures (AoS), try to use structures of arrays instead (SoA): for(i) a[i].x = b[i].x; (slow, non stride 1) => for(i) a.x[i] = b.x[i]; (fast, stride 1)

No data for this section

Matching between your loop (in the source code) and the binary loop

The binary loop does not contain any FP arithmetical operations. The binary loop does not load or store any data.

General properties

nb instructions	19
nb uops	19
loop length	76
used w registers	0
used x registers	15
used b registers	0
used h registers	0
used s registers	0
used d registers	0
used q registers	0
used v registers	0
used z registers	0
nb stack references	0

Front-end

MACRO FUSION NOT POSSIBLE FIT IN UOP CACHE

micro-operation queue	2.38 cycles
front end	2.38 cycles

Back-end

	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P10	P11	P12	P13	P14
uops	2.50	2.50	0.75	0.75	0.75	0.75	0.00	0.00	0.00	0.00	3.67	3.67	3.67	0.00	0.00
cycles	2.50	2.50	0.75	0.75	0.75	0.75	0.00	0.00	0.00	0.00	3.67	3.67	3.67	0.00	0.00

Execution ports to units layout:

P0: BRU
P1: BRU
P2: ALU
P3: ALU
P4: ALU
P5: ALU
P6 (128 bits): VPU, FP store data, ALU, DIV/SQRT
P7 (128 bits): VPU, ALU, FP store data
P8 (128 bits): VPU, ALU, DIV/SQRT
P9 (128 bits): ALU, VPU
P10 (256 bits): store address, load
P11 (256 bits): store address, load
P12 (256 bits): load
P13 (64 bits): store data
P14 (64 bits): store data

Cycles executing div or sqrt instructions

NA

Cycles summary

Front-end	2.38
Dispatch	3.67
Overall L1	3.67

Vectorization ratios

all	0%
load	0%
store	NA (no store vectorizable/vectorized instructions)
mul	NA (no mul vectorizable/vectorized instructions)
add-sub	NA (no add-sub vectorizable/vectorized instructions)
fma	NA (no fma vectorizable/vectorized instructions)
div/sqrt	NA (no div/sqrt vectorizable/vectorized instructions)
other	0%

Vector efficiency ratios

all	25%
load	25%
store	NA (no store vectorizable/vectorized instructions)
mul	NA (no mul vectorizable/vectorized instructions)
add-sub	NA (no add-sub vectorizable/vectorized instructions)
fma	NA (no fma vectorizable/vectorized instructions)
div/sqrt	NA (no div/sqrt vectorizable/vectorized instructions)
other	25%

Cycles and memory resources usage

Assuming all data fit into the L1 cache, each iteration of the binary loop takes 3.67 cycles.

Front-end bottlenecks

Found no such bottlenecks.

ASM code

In the binary file, the address of the loop is: 484120

Instruction	Nb FU	P0	P1	P2	P3	P4	P5	P10	P11	P12	Latency	Recip. throughput	Vectorization
B 4840f8 <hypre_ParMatmul_RowSizes.omp_outlined+0x2b8>	1	0.50	0.50	0	0	0	0	0	0	0	1	0.50	N/A
LDP X9, X8, [X29, #968]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	1	N/A
LDR X27, [X9]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
LDR X13, [X8]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
LDP X9, X8, [X29, #984]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	1	N/A
LDR X14, [X9]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
LDR X19, [X8]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
B 484130 <hypre_ParMatmul_RowSizes.omp_outlined+0x2f0>	1	0.50	0.50	0	0	0	0	0	0	0	1	0.50	N/A
LDR X8, [X2, X30,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	N/A
ADD X28, X28, #1	1	0	0	0.25	0.25	0.25	0.25	0	0	0	1	0.25	N/A
CMP X28, X8	1	0	0	0.25	0.25	0.25	0.25	0	0	0	1	0.33	scal (25.0%)
B.GE 483fc0 <hypre_ParMatmul_RowSizes.omp_outlined+0x180>	1	0.50	0.50	0	0	0	0	0	0	0	1	0.50	N/A
LDR X9, [X3, X28,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	N/A
ADD X8, X9, #1	1	0	0	0.25	0.25	0.25	0.25	0	0	0	1	0.25	N/A
LDR X10, [X4, X9,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
LDR X12, [X4, X8,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
B 484148 <hypre_ParMatmul_RowSizes.omp_outlined+0x308>	1	0.50	0.50	0	0	0	0	0	0	0	1	0.50	N/A
LDR X10, [X11]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
CBZ X10, 484120 <hypre_ParMatmul_RowSizes.omp_outlined+0x2e0>	1	0.50	0.50	0	0	0	0	0	0	0	1	0.50	N/A

Function	hypre_ParMatmul_RowSizes.omp_outlined
Source file and lines	par_csr_matop.c:127-242
Module	exec

The loop is defined in /home/eoseret/qaas/qaas_runs/178-188-3659/intel/AMG/build/AMG/AMG/parcsr_mv/par_csr_matop.c:127,135-137,144-148,154-156,164-177,187-189,195-197,205-208,216,241-242.

Analyzed code is defined in /home/eoseret/qaas/qaas_runs/178-188-3659/intel/AMG/build/AMG/AMG/parcsr_mv/par_csr_matop.c:187-189,195,216.

Warnings:

Non-innermost loop: analyzing only self part (ignoring child loops).
Ignoring paths for analysis
Failed to get the number of paths
RecMII not computed since number of paths is unknown or > max_paths
Streams not analyzed since number of paths is unknown or > max_paths

gain
potential
hint
expert

Vectorization

Your loop is not vectorized. 4 data elements could be processed at once in vector registers. By vectorizing your loop, you can lower the cost of an iteration from 3.67 to 0.92 cycles (4.00x speedup).

Details

All VPU instructions are used in scalar version (process only one data element in vector registers). Since your execution units are vector units, only a vectorized loop can use their full power.

Workaround

Try another compiler or update/tune your current one:
- recompile with ffast-math (included in Ofast) to extend loop vectorization to FP reductions.
Remove inter-iterations dependences from your loop and make it unit-stride:
- If your arrays have 2 or more dimensions, check whether elements are accessed contiguously and, otherwise, try to permute loops accordingly: C storage order is row-major: for(i) for(j) a[j][i] = b[j][i]; (slow, non stride 1) => for(i) for(j) a[i][j] = b[i][j]; (fast, stride 1)
- If your loop streams arrays of structures (AoS), try to use structures of arrays instead (SoA): for(i) a[i].x = b[i].x; (slow, non stride 1) => for(i) a.x[i] = b.x[i]; (fast, stride 1)

No data for this section

Matching between your loop (in the source code) and the binary loop

The binary loop does not contain any FP arithmetical operations. The binary loop does not load or store any data.

General properties

nb instructions	19
nb uops	19
loop length	76
used w registers	0
used x registers	15
used b registers	0
used h registers	0
used s registers	0
used d registers	0
used q registers	0
used v registers	0
used z registers	0
nb stack references	0

Front-end

MACRO FUSION NOT POSSIBLE FIT IN UOP CACHE

micro-operation queue	2.38 cycles
front end	2.38 cycles

Back-end

	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P10	P11	P12	P13	P14
uops	2.50	2.50	0.75	0.75	0.75	0.75	0.00	0.00	0.00	0.00	3.67	3.67	3.67	0.00	0.00
cycles	2.50	2.50	0.75	0.75	0.75	0.75	0.00	0.00	0.00	0.00	3.67	3.67	3.67	0.00	0.00

Execution ports to units layout:

P0: BRU
P1: BRU
P2: ALU
P3: ALU
P4: ALU
P5: ALU
P6 (128 bits): VPU, FP store data, ALU, DIV/SQRT
P7 (128 bits): VPU, ALU, FP store data
P8 (128 bits): VPU, ALU, DIV/SQRT
P9 (128 bits): ALU, VPU
P10 (256 bits): store address, load
P11 (256 bits): store address, load
P12 (256 bits): load
P13 (64 bits): store data
P14 (64 bits): store data

Cycles executing div or sqrt instructions

NA

Cycles summary

Front-end	2.38
Dispatch	3.67
Overall L1	3.67

Vectorization ratios

all	0%
load	0%
store	NA (no store vectorizable/vectorized instructions)
mul	NA (no mul vectorizable/vectorized instructions)
add-sub	NA (no add-sub vectorizable/vectorized instructions)
fma	NA (no fma vectorizable/vectorized instructions)
div/sqrt	NA (no div/sqrt vectorizable/vectorized instructions)
other	0%

Vector efficiency ratios

all	25%
load	25%
store	NA (no store vectorizable/vectorized instructions)
mul	NA (no mul vectorizable/vectorized instructions)
add-sub	NA (no add-sub vectorizable/vectorized instructions)
fma	NA (no fma vectorizable/vectorized instructions)
div/sqrt	NA (no div/sqrt vectorizable/vectorized instructions)
other	25%

Cycles and memory resources usage

Assuming all data fit into the L1 cache, each iteration of the binary loop takes 3.67 cycles.

Front-end bottlenecks

Found no such bottlenecks.

ASM code

In the binary file, the address of the loop is: 484120

Instruction	Nb FU	P0	P1	P2	P3	P4	P5	P10	P11	P12	Latency	Recip. throughput	Vectorization
B 4840f8 <hypre_ParMatmul_RowSizes.omp_outlined+0x2b8>	1	0.50	0.50	0	0	0	0	0	0	0	1	0.50	N/A
LDP X9, X8, [X29, #968]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	1	N/A
LDR X27, [X9]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
LDR X13, [X8]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
LDP X9, X8, [X29, #984]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	1	N/A
LDR X14, [X9]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
LDR X19, [X8]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
B 484130 <hypre_ParMatmul_RowSizes.omp_outlined+0x2f0>	1	0.50	0.50	0	0	0	0	0	0	0	1	0.50	N/A
LDR X8, [X2, X30,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	N/A
ADD X28, X28, #1	1	0	0	0.25	0.25	0.25	0.25	0	0	0	1	0.25	N/A
CMP X28, X8	1	0	0	0.25	0.25	0.25	0.25	0	0	0	1	0.33	scal (25.0%)
B.GE 483fc0 <hypre_ParMatmul_RowSizes.omp_outlined+0x180>	1	0.50	0.50	0	0	0	0	0	0	0	1	0.50	N/A
LDR X9, [X3, X28,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	N/A
ADD X8, X9, #1	1	0	0	0.25	0.25	0.25	0.25	0	0	0	1	0.25	N/A
LDR X10, [X4, X9,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
LDR X12, [X4, X8,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
B 484148 <hypre_ParMatmul_RowSizes.omp_outlined+0x308>	1	0.50	0.50	0	0	0	0	0	0	0	1	0.50	N/A
LDR X10, [X11]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33	scal (25.0%)
CBZ X10, 484120 <hypre_ParMatmul_RowSizes.omp_outlined+0x2e0>	1	0.50	0.50	0	0	0	0	0	0	0	1	0.50	N/A

Report Configuration

Vectorization

Details

Workaround

Matching between your loop (in the source code) and the binary loop

General properties

Front-end

Back-end

Cycles summary

Vectorization ratios

Vector efficiency ratios

Cycles and memory resources usage

Front-end bottlenecks

ASM code

Vectorization

Details

Workaround

Matching between your loop (in the source code) and the binary loop

General properties

Front-end

Back-end

Cycles summary

Vectorization ratios

Vector efficiency ratios

Cycles and memory resources usage

Front-end bottlenecks

ASM code