OV - exec - Loop 2181

	Loop Id: 2181	Module: exec	Source: forall.hpp:59-59 [...]	Coverage: 0.01%

0x4be343 CMPQ	$0,-0x80(%RBP)

0x4be348 JLE	4be660

0x4be34e MOV	-0x208(%RBP),%RAX

0x4be355 MOV	-0x200(%RBP),%R9

0x4be35c CQTO

0x4be35e IDIVQ	-0xc0(%RBP)

0x4be365 MOV	-0x218(%RBP),%R10

0x4be36c LEA	(%R9,%RDI,8),%R11

0x4be370 MOV	%R11,-0x70(%RBP)

0x4be374 LEA	(%R10,%RCX,8),%RSI

0x4be378 CMP	$0x1,%RDX

0x4be37c SBB	$-0x1,%RAX

0x4be380 MOV	%RAX,-0x40(%RBP)

0x4be384 TEST	%RAX,%RAX

0x4be387 JLE	4be660

0x4be38d MOV	-0x100(%RBP),%RAX

0x4be394 MOV	-0xf8(%RBP),%RDX

0x4be39b MOV	%RAX,-0x60(%RBP)

0x4be39f MOV	%RDX,-0x58(%RBP)

0x4be3a3 MOVQ	$0,-0x50(%RBP)

0x4be3ab MOV	%R8,-0xd0(%RBP)

0x4be3b2 MOV	%RBX,-0x68(%RBP)

0x4be3b6 MOV	%RDI,-0xd8(%RBP)

0x4be3bd MOV	%RCX,-0xe0(%RBP)

0x4be3c4 MOV	-0xf0(%RBP),%R11

0x4be3cb NOPL	(%RAX,%RAX,1)

  (2184) 0x4be3d0 MOV	-0x58(%RBP),%RBX

  (2184) 0x4be3d4 MOV	-0x88(%RBP),%RDI

  (2184) 0x4be3db LEA	(,%RBX,8),%RCX

  (2184) 0x4be3e3 MOV	-0xb8(%RBP),%R10

  (2184) 0x4be3ea MOV	-0x60(%RBP),%R9

  (2184) 0x4be3ee MOV	-0x98(%RBP),%RDX

  (2184) 0x4be3f5 LEA	(%RCX,%RDI,1),%R8

  (2184) 0x4be3f9 MOV	-0x90(%RBP),%RDI

  (2184) 0x4be400 LEA	(%R10,%R9,8),%RAX

  (2184) 0x4be404 ADD	%RCX,%RDI

  (2184) 0x4be407 MOV	-0x78(%RBP),%R9

  (2184) 0x4be40b ADD	%RDX,%RCX

  (2184) 0x4be40e XOR	%R10D,%R10D

  (2184) 0x4be411 MOV	-0x70(%RBP),%RDX

  (2184) 0x4be415 TESTB	$0x1,-0x40(%RBP)

  (2184) 0x4be419 JE	4be4ce

  (2184) 0x4be41f VMOVSD	(%R12),%XMM5

  (2184) 0x4be425 MOV	-0x68(%RBP),%RBX

  (2184) 0x4be429 VADDSD	%XMM5,%XMM5,%XMM0

  (2184) 0x4be42d MOV	-0x48(%RBP),%R10

  (2184) 0x4be431 VMOVSD	(%R13),%XMM10

  (2184) 0x4be437 VDIVSD	(%R10),%XMM0,%XMM1

  (2184) 0x4be43c VMOVSD	(%RBX),%XMM13

  (2184) 0x4be440 VMULSD	(%RAX),%XMM1,%XMM6

  (2184) 0x4be444 VADDSD	%XMM10,%XMM10,%XMM11

  (2184) 0x4be449 VADDSD	%XMM13,%XMM13,%XMM14

  (2184) 0x4be44e VMOVSD	(%R8),%XMM2

  (2184) 0x4be453 MOV	-0x70(%RBP),%RDX

  (2184) 0x4be457 VDIVSD	(%R9),%XMM11,%XMM12

  (2184) 0x4be45c VDIVSD	(%R11),%XMM14,%XMM15

  (2184) 0x4be461 VFMADD231SD	(%RSI),%XMM12,%XMM6

  (2184) 0x4be466 VADDSD	%XMM1,%XMM15,%XMM4

  (2184) 0x4be46a VFMADD132SD	(%RDX),%XMM2,%XMM15

  (2184) 0x4be46f VADDSD	(%RDI),%XMM12,%XMM8

  (2184) 0x4be473 MOV	-0x40(%RBP),%RBX

  (2184) 0x4be477 MOV	$0x1,%R10D

  (2184) 0x4be47d VADDSD	%XMM4,%XMM8,%XMM9

  (2184) 0x4be481 VADDSD	%XMM6,%XMM15,%XMM7

  (2184) 0x4be485 ADD	%R15,%R9

  (2184) 0x4be488 ADD	%R14,%R8

  (2184) 0x4be48b VDIVSD	%XMM9,%XMM7,%XMM10

  (2184) 0x4be490 ADD	%R14,%RDI

  (2184) 0x4be493 VMOVSD	%XMM10,(%RCX)

  (2184) 0x4be497 VMOVAPD	%XMM10,%XMM11

  (2184) 0x4be49c VFMSUB213SD	(%RSI),%XMM3,%XMM11

  (2184) 0x4be4a1 VMOVAPD	%XMM10,%XMM12

  (2184) 0x4be4a6 ADD	%R14,%RCX

  (2184) 0x4be4a9 VMOVSD	%XMM11,(%RSI)

  (2184) 0x4be4ad VFMSUB213SD	(%RDX),%XMM3,%XMM12

  (2184) 0x4be4b2 VMOVSD	%XMM12,(%RDX)

  (2184) 0x4be4b6 VFMSUB213SD	(%RAX),%XMM3,%XMM10

  (2184) 0x4be4bb ADD	%R15,%RDX

  (2184) 0x4be4be VMOVSD	%XMM10,(%RAX)

  (2184) 0x4be4c2 ADD	%R15,%RAX

  (2184) 0x4be4c5 CMP	%RBX,%R10

  (2184) 0x4be4c8 JE	4be612

  (2184) 0x4be4ce MOV	%R10,-0x38(%RBP)

  (2184) 0x4be4d2 MOV	-0x68(%RBP),%RBX

    (2183) 0x4be4d6 VMOVSD	(%R12),%XMM4

    (2183) 0x4be4dc MOV	-0x48(%RBP),%R10

    (2183) 0x4be4e0 VADDSD	%XMM4,%XMM4,%XMM2

    (2183) 0x4be4e4 VMOVSD	(%R13),%XMM13

    (2183) 0x4be4ea VMOVSD	(%RBX),%XMM5

    (2183) 0x4be4ee VDIVSD	(%R10),%XMM2,%XMM6

    (2183) 0x4be4f3 VMULSD	(%RAX),%XMM6,%XMM9

    (2183) 0x4be4f7 VADDSD	%XMM13,%XMM13,%XMM14

    (2183) 0x4be4fc VADDSD	%XMM5,%XMM5,%XMM0

    (2183) 0x4be500 VMOVSD	(%R8),%XMM7

    (2183) 0x4be505 VDIVSD	(%R9),%XMM14,%XMM15

    (2183) 0x4be50a VDIVSD	(%R11),%XMM0,%XMM1

    (2183) 0x4be50f VFMADD231SD	(%RSI),%XMM15,%XMM9

    (2183) 0x4be514 VADDSD	%XMM6,%XMM1,%XMM8

    (2183) 0x4be518 VFMADD132SD	(%RDX),%XMM7,%XMM1

    (2183) 0x4be51d VADDSD	(%RDI),%XMM15,%XMM11

    (2183) 0x4be521 ADD	%R14,%R8

    (2183) 0x4be524 ADD	%R15,%R9

    (2183) 0x4be527 VADDSD	%XMM8,%XMM11,%XMM12

    (2183) 0x4be52c VADDSD	%XMM9,%XMM1,%XMM10

    (2183) 0x4be531 ADD	%R14,%RDI

    (2183) 0x4be534 VDIVSD	%XMM12,%XMM10,%XMM13

    (2183) 0x4be539 VMOVSD	%XMM13,(%RCX)

    (2183) 0x4be53d VMOVAPD	%XMM13,%XMM14

    (2183) 0x4be542 VFMSUB213SD	(%RSI),%XMM3,%XMM14

    (2183) 0x4be547 VMOVAPD	%XMM13,%XMM15

    (2183) 0x4be54c ADD	%R14,%RCX

    (2183) 0x4be54f VMOVSD	%XMM14,(%RSI)

    (2183) 0x4be553 VFMSUB213SD	(%RDX),%XMM3,%XMM15

    (2183) 0x4be558 VMOVSD	%XMM15,(%RDX)

    (2183) 0x4be55c VFMSUB213SD	(%RAX),%XMM3,%XMM13

    (2183) 0x4be561 ADD	%R15,%RDX

    (2183) 0x4be564 VMOVSD	%XMM13,(%RAX)

    (2183) 0x4be568 VMOVSD	(%R12),%XMM8

    (2183) 0x4be56e ADD	%R15,%RAX

    (2183) 0x4be571 VADDSD	%XMM8,%XMM8,%XMM7

    (2183) 0x4be576 VMOVSD	(%R13),%XMM5

    (2183) 0x4be57c VMOVSD	(%RBX),%XMM4

    (2183) 0x4be580 VDIVSD	(%R10),%XMM7,%XMM9

    (2183) 0x4be585 VMULSD	(%RAX),%XMM9,%XMM12

    (2183) 0x4be589 VADDSD	%XMM5,%XMM5,%XMM0

    (2183) 0x4be58d VADDSD	%XMM4,%XMM4,%XMM2

    (2183) 0x4be591 VMOVSD	(%R8),%XMM11

    (2183) 0x4be596 VDIVSD	(%R9),%XMM0,%XMM1

    (2183) 0x4be59b VDIVSD	(%R11),%XMM2,%XMM6

    (2183) 0x4be5a0 VFMADD231SD	(%RSI),%XMM1,%XMM12

    (2183) 0x4be5a5 VADDSD	%XMM9,%XMM6,%XMM10

    (2183) 0x4be5aa VFMADD132SD	(%RDX),%XMM11,%XMM6

    (2183) 0x4be5af VADDSD	(%RDI),%XMM1,%XMM14

    (2183) 0x4be5b3 ADD	%R15,%R9

    (2183) 0x4be5b6 ADD	%R14,%R8

    (2183) 0x4be5b9 VADDSD	%XMM10,%XMM14,%XMM15

    (2183) 0x4be5be VADDSD	%XMM12,%XMM6,%XMM13

    (2183) 0x4be5c3 ADD	%R14,%RDI

    (2183) 0x4be5c6 VDIVSD	%XMM15,%XMM13,%XMM5

    (2183) 0x4be5cb VMOVSD	%XMM5,(%RCX)

    (2183) 0x4be5cf VMOVAPD	%XMM5,%XMM0

    (2183) 0x4be5d3 VFMSUB213SD	(%RSI),%XMM3,%XMM0

    (2183) 0x4be5d8 VMOVAPD	%XMM5,%XMM1

    (2183) 0x4be5dc ADD	%R14,%RCX

    (2183) 0x4be5df VMOVSD	%XMM0,(%RSI)

    (2183) 0x4be5e3 VFMSUB213SD	(%RDX),%XMM3,%XMM1

    (2183) 0x4be5e8 ADDQ	$0x2,-0x38(%RBP)

    (2183) 0x4be5ed MOV	-0x40(%RBP),%R10

    (2183) 0x4be5f1 VMOVSD	%XMM1,(%RDX)

    (2183) 0x4be5f5 VFMSUB213SD	(%RAX),%XMM3,%XMM5

    (2183) 0x4be5fa ADD	%R15,%RDX

    (2183) 0x4be5fd VMOVSD	%XMM5,(%RAX)

    (2183) 0x4be601 ADD	%R15,%RAX

    (2183) 0x4be604 CMP	%R10,-0x38(%RBP)

    (2183) 0x4be608 JNE	4be4d6

  (2184) 0x4be60e MOV	%RBX,-0x68(%RBP)

  (2184) 0x4be612 INCQ	-0x50(%RBP)

  (2184) 0x4be616 MOV	-0xa0(%RBP),%RCX

  (2184) 0x4be61d MOV	-0xa8(%RBP),%RAX

  (2184) 0x4be624 MOV	-0xb0(%RBP),%RDI

  (2184) 0x4be62b MOV	-0x50(%RBP),%R8

  (2184) 0x4be62f ADD	%RAX,-0x58(%RBP)

  (2184) 0x4be633 ADD	%RDI,-0x60(%RBP)

  (2184) 0x4be637 ADD	%RCX,%R11

  (2184) 0x4be63a ADD	%RCX,%RSI

  (2184) 0x4be63d CMP	%R8,-0x80(%RBP)

  (2184) 0x4be641 JNE	4be3d0

0x4be647 MOV	-0xd0(%RBP),%R8

0x4be64e MOV	-0x68(%RBP),%RBX

0x4be652 MOV	-0xd8(%RBP),%RDI

0x4be659 MOV	-0xe0(%RBP),%RCX

0x4be660 MOV	-0x1f8(%RBP),%RDX

0x4be667 MOV	-0x108(%RBP),%RSI

0x4be66e MOV	-0x1e8(%RBP),%R11

0x4be675 MOV	-0x1f0(%RBP),%R9

0x4be67c MOV	-0xe8(%RBP),%R10

0x4be683 INC	%R8

0x4be686 ADD	%RSI,-0x48(%RBP)

0x4be68a ADD	%RDX,-0x88(%RBP)

0x4be691 ADD	%RDX,-0x90(%RBP)

0x4be698 ADD	%RDX,-0x98(%RBP)

0x4be69f ADD	%R11,%RDI

0x4be6a2 ADD	%R9,%RCX

0x4be6a5 CMP	%R10,%R8

0x4be6a8 JNE	4be343

/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/util/Operators.hpp: 304 - 304

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

304:   RAJA_HOST_DEVICE constexpr Ret operator()(const Arg1& lhs,

/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp: 59 - 59

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

59:   for (decltype(distance_it) i = 0; i < distance_it; ++i) {

/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/internal/Iterators.hpp: 244 - 244

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

244:   RAJA_HOST_DEVICE inline difference_type operator-(

/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/util/View.hpp: 107 - 107

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

107:   RAJA_HOST_DEVICE RAJA_INLINE value_type &operator()(Args... args) const

/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/src/Kripke/Kernel/SweepSubdomain.cpp: 87 - 105

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

87:             double xcos_dxi = 2.0 * xcos(d) / dx(i);

88:             double ycos_dyj = 2.0 * ycos(d) / dy(j);

89:             double zcos_dzk = 2.0 * zcos(d) / dz(k);

90:

91:             Zone z(zone_layout(*i, *j, *k));

92:

93:             /* Calculate new zonal flux */

94:             double psi_d_g_z = (rhs(d,g,z)

95:                 + psi_lf(d, g, j, k) * xcos_dxi

96:                 + psi_fr(d, g, i, k) * ycos_dyj

97:                 + psi_bo(d, g, i, j) * zcos_dzk)

98:                 / (xcos_dxi + ycos_dyj + zcos_dzk + sigt(g, z));

99:

100:             psi(d, g, z) = psi_d_g_z;

101:

102:             /* Apply diamond-difference relationships */

103:             psi_lf(d, g, j, k) = 2.0 * psi_d_g_z - psi_lf(d, g, j, k);

104:             psi_fr(d, g, i, k) = 2.0 * psi_d_g_z - psi_fr(d, g, i, k);

105:             psi_bo(d, g, i, j) = 2.0 * psi_d_g_z - psi_bo(d, g, i, j);

Coverage (%)	Name	Source Location	Module
○97.87	gomp_thread_start	team.c:130	libgomp.so.1.0.0
○2.13	GOMP_parallel	libgomp.h:982	libgomp.so.1.0.0

Path /

Metric	Value
CQA speedup if no scalar integer	1.00
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.18
Bottlenecks	P0,
Function	void RAJA::internal::StatementExecutor, RAJA::statement::For<2l, RAJA::policy::loop::loop_exec, RAJA::statement::For<3l, RAJA::policy::loop::loop_exec, RAJA::statement::For<4l, RAJA::policy::loop::loop_exec, RAJA::statement::Lambda<0l> > > > > >::exec, RAJA::statement::For<2l, RAJA::policy::loop::loop_exec, RAJA::statement::For<3l, RAJA::policy::loop::loop_exec, RAJA::statement::For<4l, RAJA::policy::loop::loop_exec, RAJA::statement::Lambda<0l> > > > > >, camp::tuple, Kripke::Direction>, RAJA::impl::Span, Kripke::Group>, RAJA::impl::Span, Kripke::ZoneK>, RAJA::impl::Span, Kripke::ZoneJ>, RAJA::impl::Span, Kripke::ZoneI> >, camp::tuple<>, SweepSdom::operator() >(Kripke::ArchLayoutT, Kripke::Core::DataStore&, Kripke::SdomId) const::{lambda(Kripke::Direction, Kripke::Group, Kripke::ZoneK, Kripke::ZoneJ, Kripke::ZoneI)#1}>&>(RAJA::internal::LoopData, RAJA::statement::For<2l, RAJA::policy::loop::loop_exec, RAJA::statement::For<3l, RAJA::policy::loop::loop_exec, RAJA::statement::For<4l, RAJA::policy::loop::loop_exec, RAJA::statement::Lambda<0l> > > > > >, camp::tuple, Kripke::Direction>, RAJA::impl::Span, Kripke::Group>, RAJA::impl::Span, Kripke::ZoneK>, RAJA::impl::Span, Kripke::ZoneJ>, RAJA::impl::Span, Kripke::ZoneI> >, camp::tuple<>, SweepSdom::operator() >(Kripke::ArchLayoutT, Kripke::Core::DataStore&, Kripke::SdomId) const::{lambda(Kripke::Direction, Kripke::Group, Kripke::ZoneK, Kripke::ZoneJ, Kripke::ZoneI)#1}>&) [clone ._omp_fn.0]
Source	forall.hpp:59-59,Iterators.hpp:244-244
Source loop unroll info	NA
Source loop unroll confidence level	NA
Unroll/vectorization loop type	NA
Unroll factor	NA
CQA cycles	10.00
CQA cycles if no scalar integer	10.00
CQA cycles if FP arith vectorized	10.00
CQA cycles if fully vectorized	5.00
Front-end cycles	8.50
P0 cycles	3.50
P1 cycles	4.80
P2 cycles	7.00
P3 cycles	7.00
P4 cycles	6.50
P5 cycles	3.40
P6 cycles	3.30
P7 cycles	6.50
P8 cycles	6.50
P9 cycles	6.50
P10 cycles	3.40
P11 cycles	7.00
DIV/SQRT cycles	10.00
Inter-iter dependencies cycles	NA
FE+BE cycles (UFS)	NA
Stall cycles (UFS)	NA
Nb insns	44.00
Nb uops	51.00
Nb loads	21.00
Nb stores	13.00
Nb stack references	26.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	27.20
Bytes prefetched	0.00
Bytes loaded	168.00
Bytes stored	104.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	NA
Vectorization ratio fma	NA
Vectorization ratio div_sqrt	0.00
Vectorization ratio other	0.00
Vector-efficiency ratio all	12.24
Vector-efficiency ratio load	12.50
Vector-efficiency ratio store	12.02
Vector-efficiency ratio mul	NA
Vector-efficiency ratio add_sub	NA
Vector-efficiency ratio fma	NA
Vector-efficiency ratio div_sqrt	12.50
Vector-efficiency ratio other	12.50

Metric	Value
CQA speedup if no scalar integer	1.00
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.18
Bottlenecks	P0,
Function	void RAJA::internal::StatementExecutor, RAJA::statement::For<2l, RAJA::policy::loop::loop_exec, RAJA::statement::For<3l, RAJA::policy::loop::loop_exec, RAJA::statement::For<4l, RAJA::policy::loop::loop_exec, RAJA::statement::Lambda<0l> > > > > >::exec, RAJA::statement::For<2l, RAJA::policy::loop::loop_exec, RAJA::statement::For<3l, RAJA::policy::loop::loop_exec, RAJA::statement::For<4l, RAJA::policy::loop::loop_exec, RAJA::statement::Lambda<0l> > > > > >, camp::tuple, Kripke::Direction>, RAJA::impl::Span, Kripke::Group>, RAJA::impl::Span, Kripke::ZoneK>, RAJA::impl::Span, Kripke::ZoneJ>, RAJA::impl::Span, Kripke::ZoneI> >, camp::tuple<>, SweepSdom::operator() >(Kripke::ArchLayoutT, Kripke::Core::DataStore&, Kripke::SdomId) const::{lambda(Kripke::Direction, Kripke::Group, Kripke::ZoneK, Kripke::ZoneJ, Kripke::ZoneI)#1}>&>(RAJA::internal::LoopData, RAJA::statement::For<2l, RAJA::policy::loop::loop_exec, RAJA::statement::For<3l, RAJA::policy::loop::loop_exec, RAJA::statement::For<4l, RAJA::policy::loop::loop_exec, RAJA::statement::Lambda<0l> > > > > >, camp::tuple, Kripke::Direction>, RAJA::impl::Span, Kripke::Group>, RAJA::impl::Span, Kripke::ZoneK>, RAJA::impl::Span, Kripke::ZoneJ>, RAJA::impl::Span, Kripke::ZoneI> >, camp::tuple<>, SweepSdom::operator() >(Kripke::ArchLayoutT, Kripke::Core::DataStore&, Kripke::SdomId) const::{lambda(Kripke::Direction, Kripke::Group, Kripke::ZoneK, Kripke::ZoneJ, Kripke::ZoneI)#1}>&) [clone ._omp_fn.0]
Source	forall.hpp:59-59,Iterators.hpp:244-244
Source loop unroll info	NA
Source loop unroll confidence level	NA
Unroll/vectorization loop type	NA
Unroll factor	NA
CQA cycles	10.00
CQA cycles if no scalar integer	10.00
CQA cycles if FP arith vectorized	10.00
CQA cycles if fully vectorized	5.00
Front-end cycles	8.50
P0 cycles	3.50
P1 cycles	4.80
P2 cycles	7.00
P3 cycles	7.00
P4 cycles	6.50
P5 cycles	3.40
P6 cycles	3.30
P7 cycles	6.50
P8 cycles	6.50
P9 cycles	6.50
P10 cycles	3.40
P11 cycles	7.00
DIV/SQRT cycles	10.00
Inter-iter dependencies cycles	NA
FE+BE cycles (UFS)	NA
Stall cycles (UFS)	NA
Nb insns	44.00
Nb uops	51.00
Nb loads	21.00
Nb stores	13.00
Nb stack references	26.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	27.20
Bytes prefetched	0.00
Bytes loaded	168.00
Bytes stored	104.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	NA
Vectorization ratio fma	NA
Vectorization ratio div_sqrt	0.00
Vectorization ratio other	0.00
Vector-efficiency ratio all	12.24
Vector-efficiency ratio load	12.50
Vector-efficiency ratio store	12.02
Vector-efficiency ratio mul	NA
Vector-efficiency ratio add_sub	NA
Vector-efficiency ratio fma	NA
Vector-efficiency ratio div_sqrt	12.50
Vector-efficiency ratio other	12.50

Path /

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

Function	void RAJA::internal::StatementExecutor, RAJA::statement::For<2l, RAJA::policy::loop::loop_exec, RAJA::statement::For<3l, RAJA::policy::loop::loop_exec, RAJA::statement::For<4l, RAJA::policy::loop::loop_exec, RAJA::statement::Lambda<0l> > > > > >::exec, RAJA::statement::For<2l, RAJA::policy::loop::loop_exec, RAJA::statement::For<3l, RAJA::policy::loop::loop_exec, RAJA::statement::For<4l, RAJA::policy::loop::loop_exec, RAJA::statement::Lambda<0l> > > > > >, camp::tuple, Kripke::Direction>, RAJA::impl::Span, Kripke::Group>, RAJA::impl::Span, Kripke::ZoneK>, RAJA::impl::Span, Kripke::ZoneJ>, RAJA::impl::Span, Kripke::ZoneI> >, camp::tuple<>, SweepSdom::operator() >(Kripke::ArchLayoutT, Kripke::Core::DataStore&, Kripke::SdomId) const::{lambda(Kripke::Direction, Kripke::Group, Kripke::ZoneK, Kripke::ZoneJ, Kripke::ZoneI)#1}>&>(RAJA::internal::LoopData, RAJA::statement::For<2l, RAJA::policy::loop::loop_exec, RAJA::statement::For<3l, RAJA::policy::loop::loop_exec, RAJA::statement::For<4l, RAJA::policy::loop::loop_exec, RAJA::statement::Lambda<0l> > > > > >, camp::tuple, Kripke::Direction>, RAJA::impl::Span, Kripke::Group>, RAJA::impl::Span, Kripke::ZoneK>, RAJA::impl::Span, Kripke::ZoneJ>, RAJA::impl::Span, Kripke::ZoneI> >, camp::tuple<>, SweepSdom::operator() >(Kripke::ArchLayoutT, Kripke::Core::DataStore&, Kripke::SdomId) const::{lambda(Kripke::Direction, Kripke::Group, Kripke::ZoneK, Kripke::ZoneJ, Kripke::ZoneI)#1}>&) [clone ._omp_fn.0]
Source file and lines	forall.hpp:59-59
Module	exec

The loop is defined in:

/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/util/Operators.hpp:304
/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59
/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/internal/Iterators.hpp:244
/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/util/View.hpp:107
/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/src/Kripke/Kernel/SweepSubdomain.cpp:87-105

Warnings:

Non-innermost loop: analyzing only self part (ignoring child loops).
Ignoring paths for analysis
Too many paths. Rerun with max-paths=5
RecMII not computed since number of paths is unknown or > max_paths
Streams not analyzed since number of paths is unknown or > max_paths

Try to simplify control and/or increase the maximum number of paths per function/loop through the 'max-paths-nb' option.

This loop has 5 execution paths.

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. Only 12% of vector register length is used (average across all SSE/AVX instructions). By vectorizing your loop, you can lower the cost of an iteration from 10.00 to 5.00 cycles (2.00x speedup).

Details

All SSE/AVX 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)

Execution units bottlenecks

Performance is limited by execution of divide and square root operations (the divide/square root unit is a bottleneck). By removing all these bottlenecks, you can lower the cost of an iteration from 10.00 to 8.50 cycles (1.18x speedup).

Workaround

Reduce the number of division or square root instructions:

If denominator is constant over iterations, use reciprocal (replace x/y with x*(1/y)). Check precision impact. This will be done by your compiler with ffast-math or Ofast

Expensive FP math instructions/calls

Detected performance impact from expensive FP math instructions/calls. By removing/reexpressing them, you can lower the cost of an iteration from 10.00 to 7.83 cycles (1.28x speedup).

Complex instructions

Detected COMPLEX INSTRUCTIONS.

Details

These instructions generate more than one micro-operation and only one of them can be decoded during a cycle and the extra micro-operations increase pressure on execution units.

ADD: 4 occurrences►
- /home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59
- /home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59
- /home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59
- /home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59
IDIV: 1 occurrences►
- /home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59

Conversion instructions

Detected expensive conversion instructions.

Details

CQTO: 1 occurrences►
- /home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59

Workaround

Avoid mixing data with different types. In particular, check if the type of constants is the same as array elements.

Type of elements and instruction set

No instructions are processing arithmetic or math operations on FP elements. This loop is probably writing/copying data or processing integer elements.

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 168 bytes. The binary loop is storing 104 bytes.

General properties

nb instructions	44
nb uops	51
loop length	244
used x86 registers	11
used mmx registers	0
used xmm registers	0
used ymm registers	0
used zmm registers	0
nb stack references	26

Front-end

ASSUMED MACRO FUSION FIT IN UOP CACHE

micro-operation queue	8.50 cycles
front end	8.50 cycles

Back-end

	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P10	P11
uops	3.50	3.40	7.00	7.00	6.50	3.40	3.30	6.50	6.50	6.50	3.40	7.00
cycles	3.50	4.80	7.00	7.00	6.50	3.40	3.30	6.50	6.50	6.50	3.40	7.00

Execution ports to units layout:

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

Cycles executing div or sqrt instructions

10.00

Cycles summary

Front-end	8.50
Dispatch	7.00
DIV/SQRT	10.00
Overall L1	10.00

Vectorization ratios

all	0%
load	0%
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	0%
other	0%

Vector efficiency ratios

all	12%
load	12%
store	12%
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	12%
other	12%

Cycles and memory resources usage

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

8% of peak load performance is reached (16.80 out of 192.00 bytes loaded per cycle (GB/s @ 1GHz))
8% of peak store performance is reached (10.40 out of 128.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: 4be343

Instruction	Nb FU	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P10	P11	Latency	Recip. throughput	Vectorization
CMPQ $0,-0x80(%RBP)	1	0.20	0.20	0.33	0.33	0	0.20	0.20	0	0	0	0.20	0.33	1	0.33	scal (12.5%)
JLE 4be660 <_ZN4RAJA8internal17StatementExecutorINS_9statement8CollapseINS_26omp_parallel_collapse_execEN4camp7int_seqIlJLl0ELl1EEEEJNS2_3ForILl2ENS_6policy4loop9loop_execEJNS8_ILl3ESB_JNS8_ILl4ESB_JNS2_6LambdaILl0EJEEEEEEEEEEEEEEEE4execIRNS0_8LoopDataINS5_4listIJSH_EEENS5_5tupleIJNS_4impl4SpanINS_9Iterators16numeric_iteratorIN6Kripke9DirectionElPST_EEST_EENSP_INSR_INSS_5GroupElPSX_EESX_EENSP_INSQ_24strided_numeric_iteratorINSS_5ZoneKElPS12_EES12_EENSP_INS11_INSS_5ZoneJElPS16_EES16_EENSP_INS11_INSS_5ZoneIElPS1A_EES1A_EEEEENSN_IJEEEJZNK9SweepSdomclINSS_11ArchLayoutTINSS_12ArchT_OpenMPENSS_11LayoutT_DGZEEEEEvT_RNSS_4Core9DataStoreENSS_6SdomIdEEUlST_SX_S12_S16_S1A_E_EEEEEvOS1M_._omp_fn.0+0xf70>	1	0.50	0	0	0	0	0	0.50	0	0	0	0	0	0	0.50	N/A
MOV -0x208(%RBP),%RAX	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
MOV -0x200(%RBP),%R9	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
CQTO	1	0.50	0	0	0	0	0	0.50	0	0	0	0	0	1	0.50	scal (12.5%)
IDIVQ -0xc0(%RBP)	5	0	3	0.33	0.33	0	0	0	0	0	0	0	0.33	11-16	10	scal (12.5%)
MOV -0x218(%RBP),%R10	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
LEA (%R9,%RDI,8),%R11	1	0	0	0	0	0	0	0	0	0	0	0	0	0	0.17	N/A
MOV %R11,-0x70(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
LEA (%R10,%RCX,8),%RSI	1	0	0	0	0	0	0	0	0	0	0	0	0	0	0.17	N/A
CMP $0x1,%RDX	1	0.20	0.20	0	0	0	0.20	0.20	0	0	0	0.20	0	1	0.20	scal (12.5%)
SBB $-0x1,%RAX	1	0.50	0	0	0	0	0	0.50	0	0	0	0	0	1	0.50	N/A
MOV %RAX,-0x40(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
TEST %RAX,%RAX	1	0.20	0.20	0	0	0	0.20	0.20	0	0	0	0.20	0	2	0.20	scal (12.5%)
JLE 4be660 <_ZN4RAJA8internal17StatementExecutorINS_9statement8CollapseINS_26omp_parallel_collapse_execEN4camp7int_seqIlJLl0ELl1EEEEJNS2_3ForILl2ENS_6policy4loop9loop_execEJNS8_ILl3ESB_JNS8_ILl4ESB_JNS2_6LambdaILl0EJEEEEEEEEEEEEEEEE4execIRNS0_8LoopDataINS5_4listIJSH_EEENS5_5tupleIJNS_4impl4SpanINS_9Iterators16numeric_iteratorIN6Kripke9DirectionElPST_EEST_EENSP_INSR_INSS_5GroupElPSX_EESX_EENSP_INSQ_24strided_numeric_iteratorINSS_5ZoneKElPS12_EES12_EENSP_INS11_INSS_5ZoneJElPS16_EES16_EENSP_INS11_INSS_5ZoneIElPS1A_EES1A_EEEEENSN_IJEEEJZNK9SweepSdomclINSS_11ArchLayoutTINSS_12ArchT_OpenMPENSS_11LayoutT_DGZEEEEEvT_RNSS_4Core9DataStoreENSS_6SdomIdEEUlST_SX_S12_S16_S1A_E_EEEEEvOS1M_._omp_fn.0+0xf70>	1	0.50	0	0	0	0	0	0.50	0	0	0	0	0	0	0.50	N/A
MOV -0x100(%RBP),%RAX	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
MOV -0xf8(%RBP),%RDX	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	scal (12.5%)
MOV %RAX,-0x60(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
MOV %RDX,-0x58(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
MOVQ $0,-0x50(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (6.3%)
MOV %R8,-0xd0(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
MOV %RBX,-0x68(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
MOV %RDI,-0xd8(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
MOV %RCX,-0xe0(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
MOV -0xf0(%RBP),%R11	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	scal (12.5%)
NOPL (%RAX,%RAX,1)	1	0	0	0	0	0	0	0	0	0	0	0	0	0	0.17	N/A
MOV -0xd0(%RBP),%R8	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
MOV -0x68(%RBP),%RBX	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	scal (12.5%)
MOV -0xd8(%RBP),%RDI	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
MOV -0xe0(%RBP),%RCX	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
MOV -0x1f8(%RBP),%RDX	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	scal (12.5%)
MOV -0x108(%RBP),%RSI	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	scal (12.5%)
MOV -0x1e8(%RBP),%R11	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	scal (12.5%)
MOV -0x1f0(%RBP),%R9	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
MOV -0xe8(%RBP),%R10	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
INC %R8	1	0	0	0	0	0	0	0	0	0	0	0	0	1	0.17	N/A
ADD %RSI,-0x48(%RBP)	2	0.20	0.20	0.33	0.33	0.50	0.20	0.20	0.50	0.50	0.50	0.20	0.33	1	0.50	scal (12.5%)
ADD %RDX,-0x88(%RBP)	2	0.20	0.20	0.33	0.33	0.50	0.20	0.20	0.50	0.50	0.50	0.20	0.33	1	0.50	scal (12.5%)
ADD %RDX,-0x90(%RBP)	2	0.20	0.20	0.33	0.33	0.50	0.20	0.20	0.50	0.50	0.50	0.20	0.33	1	0.50	scal (12.5%)
ADD %RDX,-0x98(%RBP)	2	0.20	0.20	0.33	0.33	0.50	0.20	0.20	0.50	0.50	0.50	0.20	0.33	1	0.50	scal (12.5%)
ADD %R11,%RDI	1	0.20	0.20	0	0	0	0.20	0.20	0	0	0	0.20	0	1	0.20	N/A
ADD %R9,%RCX	1	0.20	0.20	0	0	0	0.20	0.20	0	0	0	0.20	0	1	0.20	N/A
CMP %R10,%R8	1	0.20	0.20	0	0	0	0.20	0.20	0	0	0	0.20	0	1	0.20	N/A
JNE 4be343 <_ZN4RAJA8internal17StatementExecutorINS_9statement8CollapseINS_26omp_parallel_collapse_execEN4camp7int_seqIlJLl0ELl1EEEEJNS2_3ForILl2ENS_6policy4loop9loop_execEJNS8_ILl3ESB_JNS8_ILl4ESB_JNS2_6LambdaILl0EJEEEEEEEEEEEEEEEE4execIRNS0_8LoopDataINS5_4listIJSH_EEENS5_5tupleIJNS_4impl4SpanINS_9Iterators16numeric_iteratorIN6Kripke9DirectionElPST_EEST_EENSP_INSR_INSS_5GroupElPSX_EESX_EENSP_INSQ_24strided_numeric_iteratorINSS_5ZoneKElPS12_EES12_EENSP_INS11_INSS_5ZoneJElPS16_EES16_EENSP_INS11_INSS_5ZoneIElPS1A_EES1A_EEEEENSN_IJEEEJZNK9SweepSdomclINSS_11ArchLayoutTINSS_12ArchT_OpenMPENSS_11LayoutT_DGZEEEEEvT_RNSS_4Core9DataStoreENSS_6SdomIdEEUlST_SX_S12_S16_S1A_E_EEEEEvOS1M_._omp_fn.0+0xc53>	1	0.50	0	0	0	0	0	0.50	0	0	0	0	0	0	0.50	N/A

Function	void RAJA::internal::StatementExecutor, RAJA::statement::For<2l, RAJA::policy::loop::loop_exec, RAJA::statement::For<3l, RAJA::policy::loop::loop_exec, RAJA::statement::For<4l, RAJA::policy::loop::loop_exec, RAJA::statement::Lambda<0l> > > > > >::exec, RAJA::statement::For<2l, RAJA::policy::loop::loop_exec, RAJA::statement::For<3l, RAJA::policy::loop::loop_exec, RAJA::statement::For<4l, RAJA::policy::loop::loop_exec, RAJA::statement::Lambda<0l> > > > > >, camp::tuple, Kripke::Direction>, RAJA::impl::Span, Kripke::Group>, RAJA::impl::Span, Kripke::ZoneK>, RAJA::impl::Span, Kripke::ZoneJ>, RAJA::impl::Span, Kripke::ZoneI> >, camp::tuple<>, SweepSdom::operator() >(Kripke::ArchLayoutT, Kripke::Core::DataStore&, Kripke::SdomId) const::{lambda(Kripke::Direction, Kripke::Group, Kripke::ZoneK, Kripke::ZoneJ, Kripke::ZoneI)#1}>&>(RAJA::internal::LoopData, RAJA::statement::For<2l, RAJA::policy::loop::loop_exec, RAJA::statement::For<3l, RAJA::policy::loop::loop_exec, RAJA::statement::For<4l, RAJA::policy::loop::loop_exec, RAJA::statement::Lambda<0l> > > > > >, camp::tuple, Kripke::Direction>, RAJA::impl::Span, Kripke::Group>, RAJA::impl::Span, Kripke::ZoneK>, RAJA::impl::Span, Kripke::ZoneJ>, RAJA::impl::Span, Kripke::ZoneI> >, camp::tuple<>, SweepSdom::operator() >(Kripke::ArchLayoutT, Kripke::Core::DataStore&, Kripke::SdomId) const::{lambda(Kripke::Direction, Kripke::Group, Kripke::ZoneK, Kripke::ZoneJ, Kripke::ZoneI)#1}>&) [clone ._omp_fn.0]
Source file and lines	forall.hpp:59-59
Module	exec

The loop is defined in:

/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/util/Operators.hpp:304
/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59
/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/internal/Iterators.hpp:244
/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/util/View.hpp:107
/home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/src/Kripke/Kernel/SweepSubdomain.cpp:87-105

Warnings:

Non-innermost loop: analyzing only self part (ignoring child loops).
Ignoring paths for analysis
Too many paths. Rerun with max-paths=5
RecMII not computed since number of paths is unknown or > max_paths
Streams not analyzed since number of paths is unknown or > max_paths

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

Details

All SSE/AVX 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)

Execution units bottlenecks

Workaround

Reduce the number of division or square root instructions:

If denominator is constant over iterations, use reciprocal (replace x/y with x*(1/y)). Check precision impact. This will be done by your compiler with ffast-math or Ofast

Expensive FP math instructions/calls

Detected performance impact from expensive FP math instructions/calls. By removing/reexpressing them, you can lower the cost of an iteration from 10.00 to 7.83 cycles (1.28x speedup).

Complex instructions

Detected COMPLEX INSTRUCTIONS.

Details

These instructions generate more than one micro-operation and only one of them can be decoded during a cycle and the extra micro-operations increase pressure on execution units.

ADD: 4 occurrences►
- /home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59
- /home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59
- /home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59
- /home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59
IDIV: 1 occurrences►
- /home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59

Conversion instructions

Detected expensive conversion instructions.

Details

CQTO: 1 occurrences►
- /home/eoseret/qaas_runs_GNR/173-926-6874/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp:59

Workaround

Avoid mixing data with different types. In particular, check if the type of constants is the same as array elements.

Type of elements and instruction set

No instructions are processing arithmetic or math operations on FP elements. This loop is probably writing/copying data or processing integer elements.

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 168 bytes. The binary loop is storing 104 bytes.

General properties

nb instructions	44
nb uops	51
loop length	244
used x86 registers	11
used mmx registers	0
used xmm registers	0
used ymm registers	0
used zmm registers	0
nb stack references	26

Front-end

ASSUMED MACRO FUSION FIT IN UOP CACHE

micro-operation queue	8.50 cycles
front end	8.50 cycles

Back-end

	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P10	P11
uops	3.50	3.40	7.00	7.00	6.50	3.40	3.30	6.50	6.50	6.50	3.40	7.00
cycles	3.50	4.80	7.00	7.00	6.50	3.40	3.30	6.50	6.50	6.50	3.40	7.00

Execution ports to units layout:

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

Cycles executing div or sqrt instructions

10.00

Cycles summary

Front-end	8.50
Dispatch	7.00
DIV/SQRT	10.00
Overall L1	10.00

Vectorization ratios

all	0%
load	0%
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	0%
other	0%

Vector efficiency ratios

all	12%
load	12%
store	12%
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	12%
other	12%

Cycles and memory resources usage

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

8% of peak load performance is reached (16.80 out of 192.00 bytes loaded per cycle (GB/s @ 1GHz))
8% of peak store performance is reached (10.40 out of 128.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: 4be343

Instruction	Nb FU	P0	P1	P2	P3	P4	P5	P6	P7	P8	P9	P10	P11	Latency	Recip. throughput	Vectorization
CMPQ $0,-0x80(%RBP)	1	0.20	0.20	0.33	0.33	0	0.20	0.20	0	0	0	0.20	0.33	1	0.33	scal (12.5%)
JLE 4be660 <_ZN4RAJA8internal17StatementExecutorINS_9statement8CollapseINS_26omp_parallel_collapse_execEN4camp7int_seqIlJLl0ELl1EEEEJNS2_3ForILl2ENS_6policy4loop9loop_execEJNS8_ILl3ESB_JNS8_ILl4ESB_JNS2_6LambdaILl0EJEEEEEEEEEEEEEEEE4execIRNS0_8LoopDataINS5_4listIJSH_EEENS5_5tupleIJNS_4impl4SpanINS_9Iterators16numeric_iteratorIN6Kripke9DirectionElPST_EEST_EENSP_INSR_INSS_5GroupElPSX_EESX_EENSP_INSQ_24strided_numeric_iteratorINSS_5ZoneKElPS12_EES12_EENSP_INS11_INSS_5ZoneJElPS16_EES16_EENSP_INS11_INSS_5ZoneIElPS1A_EES1A_EEEEENSN_IJEEEJZNK9SweepSdomclINSS_11ArchLayoutTINSS_12ArchT_OpenMPENSS_11LayoutT_DGZEEEEEvT_RNSS_4Core9DataStoreENSS_6SdomIdEEUlST_SX_S12_S16_S1A_E_EEEEEvOS1M_._omp_fn.0+0xf70>	1	0.50	0	0	0	0	0	0.50	0	0	0	0	0	0	0.50	N/A
MOV -0x208(%RBP),%RAX	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
MOV -0x200(%RBP),%R9	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
CQTO	1	0.50	0	0	0	0	0	0.50	0	0	0	0	0	1	0.50	scal (12.5%)
IDIVQ -0xc0(%RBP)	5	0	3	0.33	0.33	0	0	0	0	0	0	0	0.33	11-16	10	scal (12.5%)
MOV -0x218(%RBP),%R10	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
LEA (%R9,%RDI,8),%R11	1	0	0	0	0	0	0	0	0	0	0	0	0	0	0.17	N/A
MOV %R11,-0x70(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
LEA (%R10,%RCX,8),%RSI	1	0	0	0	0	0	0	0	0	0	0	0	0	0	0.17	N/A
CMP $0x1,%RDX	1	0.20	0.20	0	0	0	0.20	0.20	0	0	0	0.20	0	1	0.20	scal (12.5%)
SBB $-0x1,%RAX	1	0.50	0	0	0	0	0	0.50	0	0	0	0	0	1	0.50	N/A
MOV %RAX,-0x40(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
TEST %RAX,%RAX	1	0.20	0.20	0	0	0	0.20	0.20	0	0	0	0.20	0	2	0.20	scal (12.5%)
JLE 4be660 <_ZN4RAJA8internal17StatementExecutorINS_9statement8CollapseINS_26omp_parallel_collapse_execEN4camp7int_seqIlJLl0ELl1EEEEJNS2_3ForILl2ENS_6policy4loop9loop_execEJNS8_ILl3ESB_JNS8_ILl4ESB_JNS2_6LambdaILl0EJEEEEEEEEEEEEEEEE4execIRNS0_8LoopDataINS5_4listIJSH_EEENS5_5tupleIJNS_4impl4SpanINS_9Iterators16numeric_iteratorIN6Kripke9DirectionElPST_EEST_EENSP_INSR_INSS_5GroupElPSX_EESX_EENSP_INSQ_24strided_numeric_iteratorINSS_5ZoneKElPS12_EES12_EENSP_INS11_INSS_5ZoneJElPS16_EES16_EENSP_INS11_INSS_5ZoneIElPS1A_EES1A_EEEEENSN_IJEEEJZNK9SweepSdomclINSS_11ArchLayoutTINSS_12ArchT_OpenMPENSS_11LayoutT_DGZEEEEEvT_RNSS_4Core9DataStoreENSS_6SdomIdEEUlST_SX_S12_S16_S1A_E_EEEEEvOS1M_._omp_fn.0+0xf70>	1	0.50	0	0	0	0	0	0.50	0	0	0	0	0	0	0.50	N/A
MOV -0x100(%RBP),%RAX	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
MOV -0xf8(%RBP),%RDX	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	scal (12.5%)
MOV %RAX,-0x60(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
MOV %RDX,-0x58(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
MOVQ $0,-0x50(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (6.3%)
MOV %R8,-0xd0(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
MOV %RBX,-0x68(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
MOV %RDI,-0xd8(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
MOV %RCX,-0xe0(%RBP)	1	0	0	0	0	0.50	0	0	0.50	0.50	0.50	0	0	1	0.50	scal (12.5%)
MOV -0xf0(%RBP),%R11	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	scal (12.5%)
NOPL (%RAX,%RAX,1)	1	0	0	0	0	0	0	0	0	0	0	0	0	0	0.17	N/A
MOV -0xd0(%RBP),%R8	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
MOV -0x68(%RBP),%RBX	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	scal (12.5%)
MOV -0xd8(%RBP),%RDI	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
MOV -0xe0(%RBP),%RCX	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
MOV -0x1f8(%RBP),%RDX	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	scal (12.5%)
MOV -0x108(%RBP),%RSI	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	scal (12.5%)
MOV -0x1e8(%RBP),%R11	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	scal (12.5%)
MOV -0x1f0(%RBP),%R9	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
MOV -0xe8(%RBP),%R10	1	0	0	0.33	0.33	0	0	0	0	0	0	0	0.33	1	0.33	N/A
INC %R8	1	0	0	0	0	0	0	0	0	0	0	0	0	1	0.17	N/A
ADD %RSI,-0x48(%RBP)	2	0.20	0.20	0.33	0.33	0.50	0.20	0.20	0.50	0.50	0.50	0.20	0.33	1	0.50	scal (12.5%)
ADD %RDX,-0x88(%RBP)	2	0.20	0.20	0.33	0.33	0.50	0.20	0.20	0.50	0.50	0.50	0.20	0.33	1	0.50	scal (12.5%)
ADD %RDX,-0x90(%RBP)	2	0.20	0.20	0.33	0.33	0.50	0.20	0.20	0.50	0.50	0.50	0.20	0.33	1	0.50	scal (12.5%)
ADD %RDX,-0x98(%RBP)	2	0.20	0.20	0.33	0.33	0.50	0.20	0.20	0.50	0.50	0.50	0.20	0.33	1	0.50	scal (12.5%)
ADD %R11,%RDI	1	0.20	0.20	0	0	0	0.20	0.20	0	0	0	0.20	0	1	0.20	N/A
ADD %R9,%RCX	1	0.20	0.20	0	0	0	0.20	0.20	0	0	0	0.20	0	1	0.20	N/A
CMP %R10,%R8	1	0.20	0.20	0	0	0	0.20	0.20	0	0	0	0.20	0	1	0.20	N/A
JNE 4be343 <_ZN4RAJA8internal17StatementExecutorINS_9statement8CollapseINS_26omp_parallel_collapse_execEN4camp7int_seqIlJLl0ELl1EEEEJNS2_3ForILl2ENS_6policy4loop9loop_execEJNS8_ILl3ESB_JNS8_ILl4ESB_JNS2_6LambdaILl0EJEEEEEEEEEEEEEEEE4execIRNS0_8LoopDataINS5_4listIJSH_EEENS5_5tupleIJNS_4impl4SpanINS_9Iterators16numeric_iteratorIN6Kripke9DirectionElPST_EEST_EENSP_INSR_INSS_5GroupElPSX_EESX_EENSP_INSQ_24strided_numeric_iteratorINSS_5ZoneKElPS12_EES12_EENSP_INS11_INSS_5ZoneJElPS16_EES16_EENSP_INS11_INSS_5ZoneIElPS1A_EES1A_EEEEENSN_IJEEEJZNK9SweepSdomclINSS_11ArchLayoutTINSS_12ArchT_OpenMPENSS_11LayoutT_DGZEEEEEvT_RNSS_4Core9DataStoreENSS_6SdomIdEEUlST_SX_S12_S16_S1A_E_EEEEEvOS1M_._omp_fn.0+0xc53>	1	0.50	0	0	0	0	0	0.50	0	0	0	0	0	0	0.50	N/A

Report Configuration

Vectorization

Details

Workaround

Execution units bottlenecks

Workaround

Expensive FP math instructions/calls

Complex instructions

Details

Conversion instructions

Details

Workaround

Type of elements and instruction set

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

Execution units bottlenecks

Workaround

Expensive FP math instructions/calls

Complex instructions

Details

Conversion instructions

Details

Workaround

Type of elements and instruction set

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