HomeSort by relevance Sort by last modified time
    Searched full:alignedstart (Results 1 - 7 of 7) sorted by null

  /external/eigen/Eigen/src/Core/products/
GeneralMatrixVector.h 89 Index alignedStart = internal::first_aligned(res,size);
90 Index alignedSize = ResPacketSize>1 ? alignedStart + ((size-alignedStart) & ~ResPacketAlignedMask) : 0;
91 const Index peeledSize = peels>1 ? alignedStart + ((alignedSize-alignedStart) & ~PeelAlignedMask) : alignedStart;
107 alignedStart = 0;
114 alignedStart != ((lhsAlignmentOffset + alignmentStep*skipColumns)%LhsPacketSize))
131 || (size_t(lhs+alignedStart+lhsStride*skipColumns)%sizeof(LhsPacket))==0);
135 alignedStart = 0
    [all...]
SelfadjointMatrixVector.h 89 size_t alignedStart = (starti) + internal::first_aligned(&res[starti], endi-starti);
90 size_t alignedEnd = alignedStart + ((endi-alignedStart)/(PacketSize))*(PacketSize);
106 for (size_t i=starti; i<alignedStart; ++i)
114 const Scalar* EIGEN_RESTRICT a0It = A0 + alignedStart;
115 const Scalar* EIGEN_RESTRICT a1It = A1 + alignedStart;
116 const Scalar* EIGEN_RESTRICT rhsIt = rhs + alignedStart;
117 Scalar* EIGEN_RESTRICT resIt = res + alignedStart;
118 for (size_t i=alignedStart; i<alignedEnd; i+=PacketSize)
  /external/eigen/Eigen/src/Jacobi/
Jacobi.h 316 Index alignedStart = internal::first_aligned(y, size);
317 Index alignedEnd = alignedStart + ((size-alignedStart)/PacketSize)*PacketSize;
323 for(Index i=0; i<alignedStart; ++i)
331 Scalar* EIGEN_RESTRICT px = x + alignedStart;
332 Scalar* EIGEN_RESTRICT py = y + alignedStart;
334 if(internal::first_aligned(x, size)==alignedStart)
336 for(Index i=alignedStart; i<alignedEnd; i+=PacketSize)
348 Index peelingEnd = alignedStart + ((size-alignedStart)/(Peeling*PacketSize))*(Peeling*PacketSize)
    [all...]
  /external/eigen/bench/btl/libs/eigen3/
eigen3_interface.hh 121 // const int alignedEnd = alignedStart + ((innerSize-alignedStart) & ~packetAlignedMask);
125 int alignedStart = (starti) + internal::first_aligned(&A0[starti], size-starti);
126 alignedEnd = alignedStart + ((size-alignedStart)/(2*PacketSize))*(PacketSize*2);
129 for (int index = starti; index<alignedStart ; ++index)
138 for (int index = alignedStart; index<alignedEnd; index+=PacketSize)
  /external/eigen/Eigen/src/Core/
Redux.h 204 const Index alignedStart = internal::first_aligned(mat);
209 const Index alignedSize2 = ((size-alignedStart)/(2*packetSize))*(2*packetSize);
210 const Index alignedSize = ((size-alignedStart)/(packetSize))*(packetSize);
211 const Index alignedEnd2 = alignedStart + alignedSize2;
212 const Index alignedEnd = alignedStart + alignedSize;
216 PacketScalar packet_res0 = mat.template packet<alignment>(alignedStart);
219 PacketScalar packet_res1 = mat.template packet<alignment>(alignedStart+packetSize);
220 for(Index index = alignedStart + 2*packetSize; index < alignedEnd2; index += 2*packetSize)
232 for(Index index = 0; index < alignedStart; ++index)
Assign.h 402 const Index alignedStart = assign_traits<Derived1,Derived2>::DstIsAligned ? 0
404 const Index alignedEnd = alignedStart + ((size-alignedStart)/packetSize)*packetSize;
406 unaligned_assign_impl<assign_traits<Derived1,Derived2>::DstIsAligned!=0>::run(src,dst,0,alignedStart);
408 for(Index index = alignedStart; index < alignedEnd; index += packetSize)
453 Index alignedStart = ((!alignable) || assign_traits<Derived1,Derived2>::DstIsAligned) ? 0
458 const Index alignedEnd = alignedStart + ((innerSize-alignedStart) & ~packetAlignedMask);
460 for(Index inner = 0; inner<alignedStart ; ++inner)
464 for(Index inner = alignedStart; inner<alignedEnd; inner+=packetSize
    [all...]
  /external/eigen/doc/
I03_InsideEigenExample.dox 345 const int alignedStart = internal::assign_traits<Derived1,Derived2>::DstIsAligned ? 0
347 const int alignedEnd = alignedStart + ((size-alignedStart)/packetSize)*packetSize;
349 for(int index = 0; index < alignedStart; index++)
352 for(int index = alignedStart; index < alignedEnd; index += packetSize)
368 \li first, vectorization works much better if the packets are 128-bit-aligned. This is especially important for write access. So when writing to the coefficients of \a dst, we want to group these coefficients by packets of 4 such that each of these packets is 128-bit-aligned. In general, this requires to skip a few coefficients at the beginning of \a dst. This is the purpose of \a alignedStart. We then copy these first few coefficients one by one, not by packets. However, in our case, the \a dst expression is a VectorXf and remember that in the construction of the vectors we allocated aligned arrays. Thanks to \a DstIsAligned, Eigen remembers that without having to do any runtime check, so \a alignedStart is zero and this part is avoided altogether.
375 for(int index = alignedStart; index < alignedEnd; index += packetSize)
482 for(int index = alignedStart; index < alignedEnd; index += packetSize)

Completed in 580 milliseconds