OV - exec - Loop 2102

0x49404c LDR	X22, [X0]    [2]

0x494050 LDR	X10, [X24, #16]    [4]

0x494054 LDR	X8, [X24, #120]    [4]

0x494058 LDR	X5, [X24, #144]    [4]

0x49405c LDR	X6, [X10, X22,LSL #3]    [1]

0x494060 LDR	X21, [X8, X6,LSL #3]    [7]

0x494064 ADD	X7, X5, X6,LSL #5

0x494068 LDR	X23, [X7, #8]    [3]

0x49406c LDR	X11, [X21]    [6]

0x494070 CMN	X11, #1

0x494074 B.EQ	494cd8

0x494078 LDR	X13, [X21, X23,LSL #3]    [5]

0x49407c ADD	X21, X21, X23,LSL #3

0x494080 CMN	X13, #1

0x494084 B.EQ	4948ec

/home/hbollore/qaas/qaas-runs/169-817-5851/intel/Kripke/build/Kripke/src/Kripke/SweepSolver.cpp: 59 - 67

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

59:       SdomId sdom_id = sdom_ready[0];

60:

61:       auto upwind = field_upwind.getView(sdom_id);

62:

63:       // Clear boundary conditions

64:       if(upwind(Dimension{0}) == -1){

65:         Kripke::Kernel::kConst(data_store.getVariable<Field_IPlane>("i_plane"), sdom_id, 0.0);

66:       }

67:       if(upwind(Dimension{1}) == -1){

/home/hbollore/qaas/qaas-runs/169-817-5851/intel/Kripke/build/Kripke/src/Kripke/Core/Field.h: 221 - 224

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

221:         size_t chunk_id = Parent::m_subdomain_to_chunk[*sdom_id];

222:

223:         auto ptr = Parent::m_chunk_to_data[chunk_id];

224:         auto layout = m_chunk_to_layout[chunk_id];

/home/hbollore/qaas/qaas-runs/169-817-5851/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/util/View.hpp: 110 - 110

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

110:     return data[idx];

Coverage (%)	Name	Source Location	Module
►100.00+	Kripke::SteadyStateSolver(Krip[...]	stl_vector.h:680	exec
○	main	kripke.cpp:485	exec
○	__libc_start_main		libc-2.31.so
○	_start	iostream:74	exec

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.60
Bottlenecks	P10, P11, P12,
Function	Kripke::SweepSolver(Kripke::Core::DataStore&, std::vector >, bool)
Source	SweepSolver.cpp:59-67,Field.h:221-224,View.hpp:110-110
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	3.00
CQA cycles if no scalar integer	3.00
CQA cycles if FP arith vectorized	3.00
CQA cycles if fully vectorized	0.75
Front-end cycles	1.88
DIV/SQRT cycles	1.00
P0 cycles	1.00
P1 cycles	1.00
P2 cycles	1.00
P3 cycles	1.00
P4 cycles	1.00
P5 cycles	0.00
P6 cycles	0.00
P7 cycles	0.00
P8 cycles	0.00
P9 cycles	3.00
P10 cycles	3.00
P11 cycles	3.00
P12 cycles	0.00
P13 cycles	0.00
P14 cycles	0.00
Inter-iter dependencies cycles	NA
FE+BE cycles (UFS)	NA
Stall cycles (UFS)	NA
Nb insns	15.00
Nb uops	15.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	24.00
Bytes prefetched	0.00
Bytes loaded	72.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	NA
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	NA
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.60
Bottlenecks	P10, P11, P12,
Function	Kripke::SweepSolver(Kripke::Core::DataStore&, std::vector >, bool)
Source	SweepSolver.cpp:59-67,Field.h:221-224,View.hpp:110-110
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	3.00
CQA cycles if no scalar integer	3.00
CQA cycles if FP arith vectorized	3.00
CQA cycles if fully vectorized	0.75
Front-end cycles	1.88
DIV/SQRT cycles	1.00
P0 cycles	1.00
P1 cycles	1.00
P2 cycles	1.00
P3 cycles	1.00
P4 cycles	1.00
P5 cycles	0.00
P6 cycles	0.00
P7 cycles	0.00
P8 cycles	0.00
P9 cycles	3.00
P10 cycles	3.00
P11 cycles	3.00
P12 cycles	0.00
P13 cycles	0.00
P14 cycles	0.00
Inter-iter dependencies cycles	NA
FE+BE cycles (UFS)	NA
Stall cycles (UFS)	NA
Nb insns	15.00
Nb uops	15.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	24.00
Bytes prefetched	0.00
Bytes loaded	72.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	NA
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	NA
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	Kripke::SweepSolver(Kripke::Core::DataStore&, std::vector >, bool)
Source file and lines	SweepSolver.cpp:59-67
Module	exec

The loop is defined in:

/home/hbollore/qaas/qaas-runs/169-817-5851/intel/Kripke/build/Kripke/src/Kripke/SweepSolver.cpp:59-67
/home/hbollore/qaas/qaas-runs/169-817-5851/intel/Kripke/build/Kripke/src/Kripke/Core/Field.h:221-224
/home/hbollore/qaas/qaas-runs/169-817-5851/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/util/View.hpp:110

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

Ignoring paths for analysis
Failed to get the number of paths
RecMII not computed 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.00 to 0.75 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 72 bytes.

General properties

nb instructions	15
loop length	60
nb stack references	0

Front-end

FIT IN UOP CACHE

front end

1.88 cycles

Back-end

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

Cycles executing div or sqrt instructions

NA

Cycles summary

Front-end	1.88
Overall L1	3.00

Vectorization ratios

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

Cycles and memory resources usage

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

25% of peak load performance is reached (24.00 out of 96.00 bytes loaded per cycle (GB/s @ 1GHz))

ASM code

In the binary file, the address of the loop is: 49404c

Instruction	Nb FU	P0	P1	P2	P3	P4	P5	P10	P11	P12	Latency	Recip. throughput
LDR X22, [X0]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
LDR X10, [X24, #16]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
LDR X8, [X24, #120]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
LDR X5, [X24, #144]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
LDR X6, [X10, X22,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
LDR X21, [X8, X6,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
ADD X7, X5, X6,LSL #5	1	0	0	0	0	0.50	0.50	0	0	0	2	0.50
LDR X23, [X7, #8]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
LDR X11, [X21]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
CMN X11, #1	1	0	0	0.25	0.25	0.25	0.25	0	0	0	1	0.33
B.EQ 494cd8 <_ZN6Kripke11SweepSolverERNS_4Core9DataStoreESt6vectorINS_6SdomIdESaIS4_EEb+0x17f8>	1	0.50	0.50	0	0	0	0	0	0	0	1	0.50
LDR X13, [X21, X23,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
ADD X21, X21, X23,LSL #3	1	0	0	0.25	0.25	0.25	0.25	0	0	0	1	0.25
CMN X13, #1	1	0	0	0.25	0.25	0.25	0.25	0	0	0	1	0.33
B.EQ 4948ec <_ZN6Kripke11SweepSolverERNS_4Core9DataStoreESt6vectorINS_6SdomIdESaIS4_EEb+0x140c>	1	0.50	0.50	0	0	0	0	0	0	0	1	0.50

Function	Kripke::SweepSolver(Kripke::Core::DataStore&, std::vector >, bool)
Source file and lines	SweepSolver.cpp:59-67
Module	exec

The loop is defined in:

/home/hbollore/qaas/qaas-runs/169-817-5851/intel/Kripke/build/Kripke/src/Kripke/SweepSolver.cpp:59-67
/home/hbollore/qaas/qaas-runs/169-817-5851/intel/Kripke/build/Kripke/src/Kripke/Core/Field.h:221-224
/home/hbollore/qaas/qaas-runs/169-817-5851/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/util/View.hpp:110

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

Ignoring paths for analysis
Failed to get the number of paths
RecMII not computed 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.00 to 0.75 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 72 bytes.

General properties

nb instructions	15
loop length	60
nb stack references	0

Front-end

FIT IN UOP CACHE

front end

1.88 cycles

Back-end

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

Cycles executing div or sqrt instructions

NA

Cycles summary

Front-end	1.88
Overall L1	3.00

Vectorization ratios

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

Cycles and memory resources usage

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

25% of peak load performance is reached (24.00 out of 96.00 bytes loaded per cycle (GB/s @ 1GHz))

ASM code

In the binary file, the address of the loop is: 49404c

Instruction	Nb FU	P0	P1	P2	P3	P4	P5	P10	P11	P12	Latency	Recip. throughput
LDR X22, [X0]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
LDR X10, [X24, #16]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
LDR X8, [X24, #120]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
LDR X5, [X24, #144]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
LDR X6, [X10, X22,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
LDR X21, [X8, X6,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
ADD X7, X5, X6,LSL #5	1	0	0	0	0	0.50	0.50	0	0	0	2	0.50
LDR X23, [X7, #8]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
LDR X11, [X21]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
CMN X11, #1	1	0	0	0.25	0.25	0.25	0.25	0	0	0	1	0.33
B.EQ 494cd8 <_ZN6Kripke11SweepSolverERNS_4Core9DataStoreESt6vectorINS_6SdomIdESaIS4_EEb+0x17f8>	1	0.50	0.50	0	0	0	0	0	0	0	1	0.50
LDR X13, [X21, X23,LSL #3]	1	0	0	0	0	0	0	0.33	0.33	0.33	4	0.33
ADD X21, X21, X23,LSL #3	1	0	0	0.25	0.25	0.25	0.25	0	0	0	1	0.25
CMN X13, #1	1	0	0	0.25	0.25	0.25	0.25	0	0	0	1	0.33
B.EQ 4948ec <_ZN6Kripke11SweepSolverERNS_4Core9DataStoreESt6vectorINS_6SdomIdESaIS4_EEb+0x140c>	1	0.50	0.50	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

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