OV - exec - Loop 1297

0x44ab04 LDUR	X8, [X29, #472]

0x44ab08 ADD	X25, X25, #1

0x44ab0c ADD	X28, X28, #128

0x44ab10 CMP	X25, X8

0x44ab14 B.EQ	44aac0

0x44ab18 LDR	D0, [X26]

0x44ab1c LDUR	X8, [X29, #480]

0x44ab20 UBFM	X24, X25, #57, #56

0x44ab24 CMP	X28, X19

0x44ab28 CSEL	X27, X28, X19, #3

0x44ab2c STUR	D0, [X29, #488]

0x44ab30 LDR	D0, [X26, X8,LSL #3]

0x44ab34 LDR	X8, [SP, #48]

0x44ab38 STUR	D0, [X29, #496]

0x44ab3c LDR	D0, [X26, X8,LSL #3]

0x44ab40 ADD	X8, X24, #128

0x44ab44 CMP	X19, X8

0x44ab48 CSEL	X8, X19, X8, #3

0x44ab4c CMP	X24, X8

0x44ab50 STUR	D0, [X29, #504]

0x44ab54 B.CS	44ab04

0x44ab58 HINT	#0

0x44ab5c HINT	#0

  (1298) 0x44ab60 ORR	X0, XZR, X21

  (1298) 0x44ab64 ORR	X2, XZR, X20

  (1298) 0x44ab68 SUB	X1, X29, #24

  (1298) 0x44ab6c STR	WZR, [SP]

  (1298) 0x44ab70 ORR	W3, WZR, W19

  (1298) 0x44ab74 ORR	X4, XZR, X22

  (1298) 0x44ab78 ORR	X5, XZR, X23

  (1298) 0x44ab7c ORR	W6, WZR, W19

  (1298) 0x44ab80 ORR	W7, WZR, W24

  (1298) 0x44ab84 BL	44ad10

  (1298) 0x44ab88 ADD	X24, X24, #1

  (1298) 0x44ab8c CMP	X27, X24

  (1298) 0x44ab90 B.NE	44ab60

0x44ab94 B	44ab04

/home/hbollore/qaas/qaas-runs/169-816-8620/intel/miniqmc/build/miniqmc/src/Particle/DistanceTableBA.h: 88 - 101

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

88:     for (size_t iat = 0; iat < ntgt_local; ++iat)

89:       for (size_t team_id = 0; team_id < num_teams; ++team_id)

90:       {

91:         T pos[D];

92:         for (int idim = 0; idim < D; idim++)

93:           pos[idim] = *(tgt_ptr + ntgt_padded * idim + iat);

94:

95:         const size_t first = ChunkSizePerTeam * team_id;

96:         const size_t last  = std::min(first + ChunkSizePerTeam, nsrc_padded);

97:

98:         PRAGMA_OFFLOAD("omp parallel for")

99:         for (size_t jel = first; jel < last; ++jel)

100:         {

101:           DTD_BConds<T, D, SC>::computeDistancesOffload(pos, src_ptr, nsrc_padded, dist_ptr + nsrc_padded * iat,

Coverage (%)	Name	Source Location	Module
►100.00+	qmcplusplus::ParticleSet::upda[...]	stl_vector.h:919	exec
○	.omp_outlined.	miniqmc.cpp:390	exec
○	__kmp_invoke_microtask		libomp.so

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.06
Bottlenecks
Function	qmcplusplus::DistanceTableBA::evaluate(qmcplusplus::ParticleSet&)
Source	DistanceTableBA.h:88-96,DistanceTableBA.h:99-99
Source loop unroll info	NA
Source loop unroll confidence level	NA
Unroll/vectorization loop type	NA
Unroll factor	NA
CQA cycles	3.17
CQA cycles if no scalar integer	3.17
CQA cycles if FP arith vectorized	3.17
CQA cycles if fully vectorized	0.79
Front-end cycles	2.69
DIV/SQRT cycles	1.25
P0 cycles	1.25
P1 cycles	2.50
P2 cycles	2.50
P3 cycles	2.50
P4 cycles	2.50
P5 cycles	1.50
P6 cycles	1.50
P7 cycles	0.00
P8 cycles	0.00
P9 cycles	3.17
P10 cycles	2.83
P11 cycles	3.00
P12 cycles	0.00
P13 cycles	0.00
P14 cycles	0.00
Inter-iter dependencies cycles	1
FE+BE cycles (UFS)	NA
Stall cycles (UFS)	NA
Nb insns	22.50
Nb uops	21.50
Nb loads	NA
Nb stores	3.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	22.74
Bytes prefetched	0.00
Bytes loaded	48.00
Bytes stored	24.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	0.00
Vectorization ratio mul	NA
Vectorization ratio add_sub	0.00
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	25.00
Vector-efficiency ratio mul	NA
Vector-efficiency ratio add_sub	25.00
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.06
Bottlenecks	P10,
Function	qmcplusplus::DistanceTableBA::evaluate(qmcplusplus::ParticleSet&)
Source	DistanceTableBA.h:88-96,DistanceTableBA.h:99-99
Source loop unroll info	NA
Source loop unroll confidence level	NA
Unroll/vectorization loop type	NA
Unroll factor	NA
CQA cycles	3.17
CQA cycles if no scalar integer	3.17
CQA cycles if FP arith vectorized	3.17
CQA cycles if fully vectorized	0.79
Front-end cycles	2.75
DIV/SQRT cycles	1.50
P0 cycles	1.50
P1 cycles	2.50
P2 cycles	2.50
P3 cycles	2.50
P4 cycles	2.50
P5 cycles	1.50
P6 cycles	1.50
P7 cycles	0.00
P8 cycles	0.00
P9 cycles	3.17
P10 cycles	2.83
P11 cycles	3.00
P12 cycles	0.00
P13 cycles	0.00
P14 cycles	0.00
Inter-iter dependencies cycles	1
FE+BE cycles (UFS)	NA
Stall cycles (UFS)	NA
Nb insns	24.00
Nb uops	22.00
Nb loads	NA
Nb stores	3.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	22.74
Bytes prefetched	0.00
Bytes loaded	48.00
Bytes stored	24.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	0.00
Vectorization ratio mul	NA
Vectorization ratio add_sub	0.00
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	25.00
Vector-efficiency ratio mul	NA
Vector-efficiency ratio add_sub	25.00
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.06
Bottlenecks	P10,
Function	qmcplusplus::DistanceTableBA::evaluate(qmcplusplus::ParticleSet&)
Source	DistanceTableBA.h:88-96,DistanceTableBA.h:99-99
Source loop unroll info	NA
Source loop unroll confidence level	NA
Unroll/vectorization loop type	NA
Unroll factor	NA
CQA cycles	3.17
CQA cycles if no scalar integer	3.17
CQA cycles if FP arith vectorized	3.17
CQA cycles if fully vectorized	0.79
Front-end cycles	2.63
DIV/SQRT cycles	1.00
P0 cycles	1.00
P1 cycles	2.50
P2 cycles	2.50
P3 cycles	2.50
P4 cycles	2.50
P5 cycles	1.50
P6 cycles	1.50
P7 cycles	0.00
P8 cycles	0.00
P9 cycles	3.17
P10 cycles	2.83
P11 cycles	3.00
P12 cycles	0.00
P13 cycles	0.00
P14 cycles	0.00
Inter-iter dependencies cycles	1
FE+BE cycles (UFS)	NA
Stall cycles (UFS)	NA
Nb insns	21.00
Nb uops	21.00
Nb loads	NA
Nb stores	3.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	22.74
Bytes prefetched	0.00
Bytes loaded	48.00
Bytes stored	24.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	0.00
Vectorization ratio mul	NA
Vectorization ratio add_sub	0.00
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	25.00
Vector-efficiency ratio mul	NA
Vector-efficiency ratio add_sub	25.00
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	qmcplusplus::DistanceTableBA::evaluate(qmcplusplus::ParticleSet&)
Source file and lines	DistanceTableBA.h:88-101
Module	exec

The loop is defined in /home/hbollore/qaas/qaas-runs/169-816-8620/intel/miniqmc/build/miniqmc/src/Particle/DistanceTableBA.h:88-101.

Analyzed code is defined in /home/hbollore/qaas/qaas-runs/169-816-8620/intel/miniqmc/build/miniqmc/src/Particle/DistanceTableBA.h:88-96,99.

Warnings:
Non-innermost loop: analyzing only self part (ignoring child loops).
The structure of this loop is probably <if then [else] end>.

The presence of multiple execution paths is typically the main/first bottleneck.
Try to simplify control inside loop: ideally, try to remove all conditional expressions, for example by (if applicable):

hoisting them (moving them outside the loop)
turning them into conditional moves, MIN or MAX

Ex: if (x<0) x=0 => x = (x<0 ? 0 : x) (or MAX(0,x) after defining the corresponding macro)

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.17 to 0.79 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
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 is loading 48 bytes. The binary loop is storing 24 bytes.

General properties

nb instructions	22.50
loop length	90
nb stack references	0

Front-end

front end

2.69 cycles

Back-end

	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P10	P11	P12	P13	P14
uops	1.25	1.25	2.50	2.50	2.50	2.50	1.50	1.50	0.00	0.00	3.17	2.83	3.00	0.00	0.00
cycles	1.25	1.25	2.50	2.50	2.50	2.50	1.50	1.50	0.00	0.00	3.17	2.83	3.00	0.00	0.00

Cycles executing div or sqrt instructions	NA
Longest recurrence chain latency (RecMII)	1.00

Cycles summary

Front-end	2.69
Data deps.	1.00
Overall L1	3.17

Vectorization ratios

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

Cycles and memory resources usage

Assuming all data fit into the L1 cache, each iteration of the binary loop takes 3.17 cycles. At this rate:

15% of peak load performance is reached (15.16 out of 96.00 bytes loaded per cycle (GB/s @ 1GHz))
15% of peak store performance is reached (7.58 out of 48.00 bytes stored per cycle (GB/s @ 1GHz))

Function	qmcplusplus::DistanceTableBA::evaluate(qmcplusplus::ParticleSet&)
Source file and lines	DistanceTableBA.h:88-101
Module	exec

The loop is defined in /home/hbollore/qaas/qaas-runs/169-816-8620/intel/miniqmc/build/miniqmc/src/Particle/DistanceTableBA.h:88-101.

Analyzed code is defined in /home/hbollore/qaas/qaas-runs/169-816-8620/intel/miniqmc/build/miniqmc/src/Particle/DistanceTableBA.h:88-96,99.

Warnings:
Non-innermost loop: analyzing only self part (ignoring child loops).
The structure of this loop is probably <if then [else] end>.

The presence of multiple execution paths is typically the main/first bottleneck.
Try to simplify control inside loop: ideally, try to remove all conditional expressions, for example by (if applicable):

hoisting them (moving them outside the loop)
turning them into conditional moves, MIN or MAX

Ex: if (x<0) x=0 => x = (x<0 ? 0 : x) (or MAX(0,x) after defining the corresponding macro)

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.17 to 0.79 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
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 is loading 48 bytes. The binary loop is storing 24 bytes.

General properties

nb instructions	24
loop length	96
nb stack references	0

Front-end

FIT IN UOP CACHE

front end

2.75 cycles

Back-end

	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P10	P11	P12	P13	P14
uops	1.50	1.50	2.50	2.50	2.50	2.50	1.50	1.50	0.00	0.00	3.17	2.83	3.00	0.00	0.00
cycles	1.50	1.50	2.50	2.50	2.50	2.50	1.50	1.50	0.00	0.00	3.17	2.83	3.00	0.00	0.00

Cycles executing div or sqrt instructions	NA
Longest recurrence chain latency (RecMII)	1.00

Cycles summary

Front-end	2.75
Data deps.	1.00
Overall L1	3.17

Vectorization ratios

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

Cycles and memory resources usage

Assuming all data fit into the L1 cache, each iteration of the binary loop takes 3.17 cycles. At this rate:

15% of peak load performance is reached (15.16 out of 96.00 bytes loaded per cycle (GB/s @ 1GHz))
15% of peak store performance is reached (7.58 out of 48.00 bytes stored per cycle (GB/s @ 1GHz))

ASM code

In the binary file, the address of the loop is: 44ab18

Instruction	Nb FU	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P10	P11	P12	P13	P14	Latency	Recip. throughput
LDUR X8, [X29, #472]	1	0	0	0	0	0	0	0	0	0	0	0.33	0.33	0.33	0	0	4	0.33
ADD X25, X25, #1	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	0	0	0	0	1	0.25
ADD X28, X28, #128	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	0	0	0	0	1	0.25
CMP X25, X8	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	0	0	0	0	1	0.33
B.EQ 44aac0 <_ZN11qmcplusplus15DistanceTableBAIdLj3ELi39EE8evaluateERNS_11ParticleSetE+0xc0>	1	0.50	0.50	0	0	0	0	0	0	0	0	0	0	0	0	0	1	0.50
LDR D0, [X26]	1	0	0	0	0	0	0	0	0	0	0	0.33	0.33	0.33	0	0	6	0.33
LDUR X8, [X29, #480]	1	0	0	0	0	0	0	0	0	0	0	0.33	0.33	0.33	0	0	4	0.33
UBFM X24, X25, #57, #56	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	0	0	0	0	1	0.25
CMP X28, X19	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	0	0	0	0	1	0.33
CSEL X27, X28, X19, #3	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	0	0	0	0	1	0.25
STUR D0, [X29, #488]	1	0	0	0	0	0	0	0.50	0.50	0	0	0.50	0.50	0	0	0	2	0.50
LDR D0, [X26, X8,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.33	0.33	0.33	0	0	6	0.33
LDR X8, [SP, #48]	1	0	0	0	0	0	0	0	0	0	0	0.33	0.33	0.33	0	0	4	0.33
STUR D0, [X29, #496]	1	0	0	0	0	0	0	0.50	0.50	0	0	0.50	0.50	0	0	0	2	0.50
LDR D0, [X26, X8,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.33	0.33	0.33	0	0	6	0.33
ADD X8, X24, #128	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	0	0	0	0	1	0.25
CMP X19, X8	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	0	0	0	0	1	0.33
CSEL X8, X19, X8, #3	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	0	0	0	0	1	0.25
CMP X24, X8	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	0	0	0	0	1	0.33
STUR D0, [X29, #504]	1	0	0	0	0	0	0	0.50	0.50	0	0	0.50	0.50	0	0	0	2	0.50
B.CS 44ab04 <_ZN11qmcplusplus15DistanceTableBAIdLj3ELi39EE8evaluateERNS_11ParticleSetE+0x104>	1	0.50	0.50	0	0	0	0	0	0	0	0	0	0	0	0	0	1	0.50
HINT #0
HINT #0
B 44ab04 <_ZN11qmcplusplus15DistanceTableBAIdLj3ELi39EE8evaluateERNS_11ParticleSetE+0x104>	1	0.50	0.50	0	0	0	0	0	0	0	0	0	0	0	0	0	1	0.50

Function	qmcplusplus::DistanceTableBA::evaluate(qmcplusplus::ParticleSet&)
Source file and lines	DistanceTableBA.h:88-101
Module	exec

The loop is defined in /home/hbollore/qaas/qaas-runs/169-816-8620/intel/miniqmc/build/miniqmc/src/Particle/DistanceTableBA.h:88-101.

Analyzed code is defined in /home/hbollore/qaas/qaas-runs/169-816-8620/intel/miniqmc/build/miniqmc/src/Particle/DistanceTableBA.h:88-96,99.

Warnings:
Non-innermost loop: analyzing only self part (ignoring child loops).
The structure of this loop is probably <if then [else] end>.

The presence of multiple execution paths is typically the main/first bottleneck.
Try to simplify control inside loop: ideally, try to remove all conditional expressions, for example by (if applicable):

hoisting them (moving them outside the loop)
turning them into conditional moves, MIN or MAX

Ex: if (x<0) x=0 => x = (x<0 ? 0 : x) (or MAX(0,x) after defining the corresponding macro)

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.17 to 0.79 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
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 is loading 48 bytes. The binary loop is storing 24 bytes.

General properties

nb instructions	21
loop length	84
nb stack references	0

Front-end

FIT IN UOP CACHE

front end

2.63 cycles

Back-end

	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P10	P11	P12	P13	P14
uops	1.00	1.00	2.50	2.50	2.50	2.50	1.50	1.50	0.00	0.00	3.17	2.83	3.00	0.00	0.00
cycles	1.00	1.00	2.50	2.50	2.50	2.50	1.50	1.50	0.00	0.00	3.17	2.83	3.00	0.00	0.00

Cycles executing div or sqrt instructions	NA
Longest recurrence chain latency (RecMII)	1.00

Cycles summary

Front-end	2.63
Data deps.	1.00
Overall L1	3.17

Vectorization ratios

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

Cycles and memory resources usage

Assuming all data fit into the L1 cache, each iteration of the binary loop takes 3.17 cycles. At this rate:

15% of peak load performance is reached (15.16 out of 96.00 bytes loaded per cycle (GB/s @ 1GHz))
15% of peak store performance is reached (7.58 out of 48.00 bytes stored per cycle (GB/s @ 1GHz))

ASM code

In the binary file, the address of the loop is: 44ab18

Instruction	Nb FU	P0	P1	P2	P3	P4	P5	P6	P7	P10	P11	P12	Latency	Recip. throughput
LDUR X8, [X29, #472]	1	0	0	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
ADD X25, X25, #1	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	1	0.25
ADD X28, X28, #128	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	1	0.25
CMP X25, X8	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	1	0.33
B.EQ 44aac0 <_ZN11qmcplusplus15DistanceTableBAIdLj3ELi39EE8evaluateERNS_11ParticleSetE+0xc0>	1	0.50	0.50	0	0	0	0	0	0	0	0	0	1	0.50
LDR D0, [X26]	1	0	0	0	0	0	0	0	0	0.33	0.33	0.33	6	0.33
LDUR X8, [X29, #480]	1	0	0	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
UBFM X24, X25, #57, #56	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	1	0.25
CMP X28, X19	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	1	0.33
CSEL X27, X28, X19, #3	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	1	0.25
STUR D0, [X29, #488]	1	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	2	0.50
LDR D0, [X26, X8,LSL #3]	1	0	0	0	0	0	0	0	0	0.33	0.33	0.33	6	0.33
LDR X8, [SP, #48]	1	0	0	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
STUR D0, [X29, #496]	1	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	2	0.50
LDR D0, [X26, X8,LSL #3]	1	0	0	0	0	0	0	0	0	0.33	0.33	0.33	6	0.33
ADD X8, X24, #128	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	1	0.25
CMP X19, X8	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	1	0.33
CSEL X8, X19, X8, #3	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	1	0.25
CMP X24, X8	1	0	0	0.25	0.25	0.25	0.25	0	0	0	0	0	1	0.33
STUR D0, [X29, #504]	1	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	2	0.50
B.CS 44ab04 <_ZN11qmcplusplus15DistanceTableBAIdLj3ELi39EE8evaluateERNS_11ParticleSetE+0x104>	1	0.50	0.50	0	0	0	0	0	0	0	0	0	1	0.50

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

Cycles and memory resources usage

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

Cycles and memory resources usage

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

Cycles and memory resources usage

ASM code