OV - exec - Loop 15

	Loop Id: 15	Module: exec	Source: stream.c:277-279	Coverage: 0.07%

0x401b6c STR	D30, [X15, X16,LSL #3]    [3]

0x401b70 ADD	X17, X16, #1

0x401b74 ADD	X11, X16, #2

0x401b78 STR	D31, [X13, X16,LSL #3]    [1]

0x401b7c ADD	X10, X16, #3

0x401b80 ADD	X9, X16, #4

0x401b84 STR	XZR, [X14, X16,LSL #3]    [2]

0x401b88 ADD	X8, X16, #5

0x401b8c ADD	X18, X16, #6

0x401b90 STR	D30, [X15, X17,LSL #3]    [3]

0x401b94 ADD	X30, X16, #7

0x401b98 ADD	X16, X16, #8

0x401b9c STR	D31, [X13, X17,LSL #3]    [1]

0x401ba0 STR	XZR, [X14, X17,LSL #3]    [2]

0x401ba4 STR	D30, [X15, X11,LSL #3]    [3]

0x401ba8 STR	D31, [X13, X11,LSL #3]    [1]

0x401bac STR	XZR, [X14, X11,LSL #3]    [2]

0x401bb0 STR	D30, [X15, X10,LSL #3]    [3]

0x401bb4 STR	D31, [X13, X10,LSL #3]    [1]

0x401bb8 STR	XZR, [X14, X10,LSL #3]    [2]

0x401bbc STR	D30, [X15, X9,LSL #3]    [3]

0x401bc0 STR	D31, [X13, X9,LSL #3]    [1]

0x401bc4 STR	XZR, [X14, X9,LSL #3]    [2]

0x401bc8 STR	D30, [X15, X8,LSL #3]    [3]

0x401bcc STR	D31, [X13, X8,LSL #3]    [1]

0x401bd0 STR	XZR, [X14, X8,LSL #3]    [2]

0x401bd4 STR	D30, [X15, X18,LSL #3]    [3]

0x401bd8 STR	D31, [X13, X18,LSL #3]    [1]

0x401bdc STR	XZR, [X14, X18,LSL #3]    [2]

0x401be0 STR	D30, [X15, X30,LSL #3]    [3]

0x401be4 STR	D31, [X13, X30,LSL #3]    [1]

0x401be8 STR	XZR, [X14, X30,LSL #3]    [2]

0x401bec CMP	X12, X16

0x401bf0 B.NE	401b6c

/home/eoseret/Tools/QaaS/qaas_runs/175-492-1446/intel/stream/build/stream/src/stream.c: 277 - 279

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

277: 	    a[j] = 1.0;

278: 	    b[j] = 2.0;

279: 	    c[j] = 0.0;

Coverage (%)	Name	Source Location	Module
►100.00+	gomp_thread_start	team.c:130	libgomp.so.1.0.0
○	start_thread		libc.so.6
○	thread_start		libc.so.6

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.50
CQA speedup if FP arith vectorized	1.00
CQA speedup if fully vectorized	2.00
CQA speedup if no inter-iteration dependency	NA
CQA speedup if next bottleneck killed	1.50
Bottlenecks	P12, P13,
Function	main._omp_fn.2
Source	stream.c:277-279
Source loop unroll info	not unrolled or unrolled with no peel/tail loop
Source loop unroll confidence level	max
Unroll/vectorization loop type	NA
Unroll factor	NA
CQA cycles	12.00
CQA cycles if no scalar integer	8.00
CQA cycles if FP arith vectorized	12.00
CQA cycles if fully vectorized	6.00
Front-end cycles	4.25
P0 cycles	0.50
P1 cycles	0.50
P2 cycles	1.58
P3 cycles	1.58
P4 cycles	1.50
P5 cycles	1.50
P6 cycles	1.42
P7 cycles	1.42
P8 cycles	8.00
P9 cycles	8.00
P10 cycles	0.00
P11 cycles	0.00
P12 cycles	12.00
P13 cycles	12.00
P14 cycles	0.00
P15 cycles	4.00
P16 cycles	4.00
DIV/SQRT cycles	0.00
Inter-iter dependencies cycles	1
FE+BE cycles (UFS)	NA
Stall cycles (UFS)	NA
Nb insns	34.00
Nb uops	34.00
Nb loads	NA
Nb stores	24.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	16.00
Bytes prefetched	0.00
Bytes loaded	0.00
Bytes stored	192.00
Stride 0	0.00
Stride 1	3.00
Stride n	0.00
Stride unknown	0.00
Stride indirect	0.00
Vectorization ratio all	0.00
Vectorization ratio load	NA
Vectorization ratio store	0.00
Vectorization ratio mul	NA
Vectorization ratio add_sub	NA
Vectorization ratio fma	NA
Vectorization ratio div_sqrt	NA
Vectorization ratio other	NA
Vector-efficiency ratio all	50.00
Vector-efficiency ratio load	NA
Vector-efficiency ratio store	50.00
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	NA

Metric	Value
CQA speedup if no scalar integer	1.50
CQA speedup if FP arith vectorized	1.00
CQA speedup if fully vectorized	2.00
CQA speedup if no inter-iteration dependency	NA
CQA speedup if next bottleneck killed	1.50
Bottlenecks	P12, P13,
Function	main._omp_fn.2
Source	stream.c:277-279
Source loop unroll info	not unrolled or unrolled with no peel/tail loop
Source loop unroll confidence level	max
Unroll/vectorization loop type	NA
Unroll factor	NA
CQA cycles	12.00
CQA cycles if no scalar integer	8.00
CQA cycles if FP arith vectorized	12.00
CQA cycles if fully vectorized	6.00
Front-end cycles	4.25
P0 cycles	0.50
P1 cycles	0.50
P2 cycles	1.58
P3 cycles	1.58
P4 cycles	1.50
P5 cycles	1.50
P6 cycles	1.42
P7 cycles	1.42
P8 cycles	8.00
P9 cycles	8.00
P10 cycles	0.00
P11 cycles	0.00
P12 cycles	12.00
P13 cycles	12.00
P14 cycles	0.00
P15 cycles	4.00
P16 cycles	4.00
DIV/SQRT cycles	0.00
Inter-iter dependencies cycles	1
FE+BE cycles (UFS)	NA
Stall cycles (UFS)	NA
Nb insns	34.00
Nb uops	34.00
Nb loads	NA
Nb stores	24.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	16.00
Bytes prefetched	0.00
Bytes loaded	0.00
Bytes stored	192.00
Stride 0	0.00
Stride 1	3.00
Stride n	0.00
Stride unknown	0.00
Stride indirect	0.00
Vectorization ratio all	0.00
Vectorization ratio load	NA
Vectorization ratio store	0.00
Vectorization ratio mul	NA
Vectorization ratio add_sub	NA
Vectorization ratio fma	NA
Vectorization ratio div_sqrt	NA
Vectorization ratio other	NA
Vector-efficiency ratio all	50.00
Vector-efficiency ratio load	NA
Vector-efficiency ratio store	50.00
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	NA

Path /

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

Function	main._omp_fn.2
Source file and lines	stream.c:277-279
Module	exec

The loop is defined in /home/eoseret/Tools/QaaS/qaas_runs/175-492-1446/intel/stream/build/stream/src/stream.c:277-279.

The related source loop is not unrolled or unrolled with no peel/tail loop.

gain
potential
hint
expert

Code clean check

Detected a slowdown caused by scalar integer instructions (typically used for address computation). By removing them, you can lower the cost of an iteration from 12.00 to 8.00 cycles (1.50x speedup).

Workaround

Try to reorganize arrays of structures to structures of arrays
Consider to permute loops (see vectorization gain report)

Vectorization

Your loop is not vectorized. 2 data elements could be processed at once in vector registers. By vectorizing your loop, you can lower the cost of an iteration from 12.00 to 6.00 cycles (2.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 storing 192 bytes.

General properties

nb instructions	34
nb uops	34
loop length	136
used w registers	0
used x registers	13
used b registers	0
used h registers	0
used s registers	0
used d registers	2
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	4.25 cycles
front end	4.25 cycles

Back-end

	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P10	P11	P12	P13	P14	P15	P16
uops	0.50	0.50	1.58	1.58	1.50	1.50	1.42	1.42	8.00	8.00	0.00	0.00	12.00	12.00	0.00	4.00	4.00
cycles	0.50	0.50	1.58	1.58	1.50	1.50	1.42	1.42	8.00	8.00	0.00	0.00	12.00	12.00	0.00	4.00	4.00

Execution ports to units layout:

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

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

Cycles summary

Front-end	4.25
Dispatch	12.00
Data deps.	1.00
Overall L1	12.00

Vectorization ratios

all	0%
load	NA (no load vectorizable/vectorized instructions)
store	0%
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	NA (no other vectorizable/vectorized instructions)

Vector efficiency ratios

all	50%
load	NA (no load vectorizable/vectorized instructions)
store	50%
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	NA (no other vectorizable/vectorized instructions)

Cycles and memory resources usage

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

33% of peak store performance is reached (16.00 out of 48.00 bytes stored per cycle (GB/s @ 1GHz))

Front-end bottlenecks

Found no such bottlenecks.

ASM code

In the binary file, the address of the loop is: 401b6c

Instruction	Nb FU	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P12	P13	P15	P16	Latency	Recip. throughput	Vectorization
STR D30, [X15, X16,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
ADD X17, X16, #1	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
ADD X11, X16, #2	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
STR D31, [X13, X16,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
ADD X10, X16, #3	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
ADD X9, X16, #4	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
STR XZR, [X14, X16,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
ADD X8, X16, #5	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
ADD X18, X16, #6	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
STR D30, [X15, X17,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
ADD X30, X16, #7	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
ADD X16, X16, #8	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
STR D31, [X13, X17,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X17,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
STR D30, [X15, X11,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR D31, [X13, X11,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X11,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
STR D30, [X15, X10,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR D31, [X13, X10,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X10,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
STR D30, [X15, X9,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR D31, [X13, X9,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X9,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
STR D30, [X15, X8,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR D31, [X13, X8,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X8,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
STR D30, [X15, X18,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR D31, [X13, X18,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X18,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
STR D30, [X15, X30,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR D31, [X13, X30,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X30,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
CMP X12, X16	1	0	0	0.25	0.25	0	0	0.25	0.25	0	0	0	0	0	0	1	0.33	N/A
B.NE 401b6c <main._omp_fn.2+0x10c>	1	0.50	0.50	0	0	0	0	0	0	0	0	0	0	0	0	1	0.50	N/A

Function	main._omp_fn.2
Source file and lines	stream.c:277-279
Module	exec

The loop is defined in /home/eoseret/Tools/QaaS/qaas_runs/175-492-1446/intel/stream/build/stream/src/stream.c:277-279.

The related source loop is not unrolled or unrolled with no peel/tail loop.

gain
potential
hint
expert

Code clean check

Detected a slowdown caused by scalar integer instructions (typically used for address computation). By removing them, you can lower the cost of an iteration from 12.00 to 8.00 cycles (1.50x speedup).

Workaround

Try to reorganize arrays of structures to structures of arrays
Consider to permute loops (see vectorization gain report)

Vectorization

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 storing 192 bytes.

General properties

nb instructions	34
nb uops	34
loop length	136
used w registers	0
used x registers	13
used b registers	0
used h registers	0
used s registers	0
used d registers	2
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	4.25 cycles
front end	4.25 cycles

Back-end

	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P10	P11	P12	P13	P14	P15	P16
uops	0.50	0.50	1.58	1.58	1.50	1.50	1.42	1.42	8.00	8.00	0.00	0.00	12.00	12.00	0.00	4.00	4.00
cycles	0.50	0.50	1.58	1.58	1.50	1.50	1.42	1.42	8.00	8.00	0.00	0.00	12.00	12.00	0.00	4.00	4.00

Execution ports to units layout:

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

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

Cycles summary

Front-end	4.25
Dispatch	12.00
Data deps.	1.00
Overall L1	12.00

Vectorization ratios

all	0%
load	NA (no load vectorizable/vectorized instructions)
store	0%
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	NA (no other vectorizable/vectorized instructions)

Vector efficiency ratios

all	50%
load	NA (no load vectorizable/vectorized instructions)
store	50%
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	NA (no other vectorizable/vectorized instructions)

Cycles and memory resources usage

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

33% of peak store performance is reached (16.00 out of 48.00 bytes stored per cycle (GB/s @ 1GHz))

Front-end bottlenecks

Found no such bottlenecks.

ASM code

In the binary file, the address of the loop is: 401b6c

Instruction	Nb FU	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P12	P13	P15	P16	Latency	Recip. throughput	Vectorization
STR D30, [X15, X16,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
ADD X17, X16, #1	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
ADD X11, X16, #2	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
STR D31, [X13, X16,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
ADD X10, X16, #3	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
ADD X9, X16, #4	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
STR XZR, [X14, X16,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
ADD X8, X16, #5	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
ADD X18, X16, #6	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
STR D30, [X15, X17,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
ADD X30, X16, #7	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
ADD X16, X16, #8	1	0	0	0.17	0.17	0.17	0.17	0.17	0.17	0	0	0	0	0	0	1	0.17	N/A
STR D31, [X13, X17,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X17,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
STR D30, [X15, X11,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR D31, [X13, X11,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X11,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
STR D30, [X15, X10,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR D31, [X13, X10,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X10,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
STR D30, [X15, X9,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR D31, [X13, X9,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X9,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
STR D30, [X15, X8,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR D31, [X13, X8,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X8,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
STR D30, [X15, X18,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR D31, [X13, X18,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X18,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
STR D30, [X15, X30,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR D31, [X13, X30,LSL #3]	1	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	0	0	2	0.50	scal (50.0%)
STR XZR, [X14, X30,LSL #3]	1	0	0	0	0	0	0	0	0	0	0	0.50	0.50	0.50	0.50	1	0.50	scal (50.0%)
CMP X12, X16	1	0	0	0.25	0.25	0	0	0.25	0.25	0	0	0	0	0	0	1	0.33	N/A
B.NE 401b6c <main._omp_fn.2+0x10c>	1	0.50	0.50	0	0	0	0	0	0	0	0	0	0	0	0	1	0.50	N/A

Report Configuration

Code clean check

Workaround

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

Code clean check

Workaround

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