Searched refs:PacketSize (Results 1 - 22 of 22) sorted by relevance

/external/eigen/test/
H A Dvectorization_logic.cpp81 PacketSize = internal::packet_traits<Scalar>::size enumerator in enum:vectorization_logic::__anon5367
86 typedef Matrix<Scalar,PacketSize,1> Vector1;
89 typedef Matrix<Scalar,PacketSize,PacketSize> Matrix11;
90 typedef Matrix<Scalar,2*PacketSize,2*PacketSize> Matrix22;
91 typedef Matrix<Scalar,(Matrix11::Flags&RowMajorBit)?16:4*PacketSize,(Matrix11::Flags&RowMajorBit)?4*PacketSize:16> Matrix44;
92 typedef Matrix<Scalar,(Matrix11::Flags&RowMajorBit)?16:4*PacketSize,(Matrix11::Flags&RowMajorBit)?4*PacketSize
[all...]
H A Dpacketmath.cpp54 for (int i=0; i<PacketSize; ++i) \
55 ref[i] = REFOP(data1[i], data1[i+PacketSize]); \
56 internal::pstore(data2, POP(internal::pload<Packet>(data1), internal::pload<Packet>(data1+PacketSize))); \
57 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
61 for (int i=0; i<PacketSize; ++i) \
64 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
89 for (int i=0; i<PacketSize; ++i) \
92 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
104 const int PacketSize = internal::packet_traits<Scalar>::size; local
107 const int size = PacketSize*
212 const int PacketSize = internal::packet_traits<Scalar>::size; local
278 const int PacketSize = internal::packet_traits<Scalar>::size; local
309 const int PacketSize = internal::packet_traits<Scalar>::size; local
337 const int PacketSize = internal::packet_traits<Scalar>::size; local
[all...]
H A Dproduct_extra.cpp117 const int PacketSize = internal::packet_traits<Scalar>::size; local
118 const int PacketSize1 = PacketSize>1 ? PacketSize-1 : 1;
140 Matrix<Scalar,PacketSize,0> a;
142 Matrix<Scalar,PacketSize,1> res;
143 VERIFY_IS_APPROX( (res=a*b), MatrixType::Zero(PacketSize,1) );
144 VERIFY_IS_APPROX( (res=a.lazyProduct(b)), MatrixType::Zero(PacketSize,1) );
156 Matrix<Scalar,PacketSize,Dynamic> a(PacketSize,0);
158 Matrix<Scalar,PacketSize,
[all...]
/external/eigen/test/eigen2/
H A Deigen2_packetmath.cpp22 for (int i=0; i<PacketSize; ++i) \
23 ref[i] = REFOP(data1[i], data1[i+PacketSize]); \
24 ei_pstore(data2, POP(ei_pload(data1), ei_pload(data1+PacketSize))); \
25 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
46 const int PacketSize = ei_packet_traits<Scalar>::size; local
48 const int size = PacketSize*4;
51 EIGEN_ALIGN_128 Packet packets[PacketSize*2];
60 VERIFY(areApprox(data1, data2, PacketSize) && "aligned load/store");
62 for (int offset=0; offset<PacketSize; ++offset)
65 VERIFY(areApprox(data1+offset, data2, PacketSize)
[all...]
/external/eigen/bench/
H A DbenchVecAdd.cpp94 const int PacketSize = internal::packet_traits<Scalar>::size; local
97 for (int i=0; i<size; i+=PacketSize*8)
101 // a1 = internal::pload(&a[i+1*PacketSize]);
102 // b1 = internal::pload(&b[i+1*PacketSize]);
103 // a2 = internal::pload(&a[i+2*PacketSize]);
104 // b2 = internal::pload(&b[i+2*PacketSize]);
105 // a3 = internal::pload(&a[i+3*PacketSize]);
106 // b3 = internal::pload(&b[i+3*PacketSize]);
108 // a0 = internal::pload(&a[i+4*PacketSize]);
109 // b0 = internal::pload(&b[i+4*PacketSize]);
[all...]
/external/eigen/Eigen/src/SparseLU/
H A DSparseLU_gemm_kernel.h33 PacketSize = packet_traits<Scalar>::size, enumerator in enum:Eigen::internal::__anon5299
38 SM = PM*PacketSize // step along M
44 eigen_internal_assert(((lda%PacketSize)==0) && ((ldc%PacketSize)==0) && (i0==internal::first_aligned(C,m)));
62 Index actual_b_end2 = (actual_b/PacketSize)*PacketSize; // actual number of rows suitable for vectorization
109 c0 = pload<Packet>(C0+i+(I)*PacketSize); \
110 c1 = pload<Packet>(C1+i+(I)*PacketSize); \
113 a0 = pload<Packet>(A0+i+(I+1)*PacketSize); \
116 a1 = pload<Packet>(A1+i+(I+1)*PacketSize); \
[all...]
H A DSparseLU_kernel_bmod.h66 const Index PacketSize = internal::packet_traits<Scalar>::size; local
67 Index ldl = internal::first_multiple(nrow, PacketSize);
69 Index aligned_offset = internal::first_aligned(tempv.data()+segsize, PacketSize);
70 Index aligned_with_B_offset = (PacketSize-internal::first_aligned(B.data(), PacketSize))%PacketSize;
H A DSparseLU_panel_bmod.h69 const Index PacketSize = internal::packet_traits<Scalar>::size; local
104 Index ldu = internal::first_multiple<Index>(u_rows, PacketSize);
147 Index ldl = internal::first_multiple<Index>(nrow, PacketSize);
148 Index offset = (PacketSize-internal::first_aligned(B.data(), PacketSize)) % PacketSize;
/external/eigen/Eigen/src/Jacobi/
H A DJacobi.h305 enum { PacketSize = packet_traits<Scalar>::size };
324 ((incrx==1 && incry==1) || PacketSize == 1))
330 Index alignedEnd = alignedStart + ((size-alignedStart)/PacketSize)*PacketSize;
349 for(Index i=alignedStart; i<alignedEnd; i+=PacketSize)
355 px += PacketSize;
356 py += PacketSize;
361 Index peelingEnd = alignedStart + ((size-alignedStart)/(Peeling*PacketSize))*(Peeling*PacketSize);
362 for(Index i=alignedStart; i<peelingEnd; i+=Peeling*PacketSize)
[all...]
/external/eigen/Eigen/src/Core/
H A DReverse.h85 PacketSize = internal::packet_traits<Scalar>::size, enumerator in enum:Eigen::Reverse::__anon4990
89 OffsetRow = ReverseRow && IsColMajor ? PacketSize : 1,
90 OffsetCol = ReverseCol && IsRowMajor ? PacketSize : 1,
164 return internal::preverse(m_matrix.template packet<LoadMode>( m_matrix.size() - index - PacketSize ));
170 m_matrix.const_cast_derived().template writePacket<LoadMode>(m_matrix.size() - index - PacketSize, internal::preverse(x));
H A DRedux.h31 PacketSize = packet_traits<typename Derived::Scalar>::size, enumerator in enum:Eigen::internal::redux_traits::__anon4971
41 MaySliceVectorize = MightVectorize && int(InnerMaxSize)>=3*PacketSize
59 UnrollingLimit = EIGEN_UNROLLING_LIMIT * (int(Traversal) == int(DefaultTraversal) ? 1 : int(PacketSize))
124 PacketSize = packet_traits<typename Derived::Scalar>::size, enumerator in enum:Eigen::internal::redux_vec_unroller::__anon4978
295 PacketSize = packet_traits<Scalar>::size, enumerator in enum:Eigen::internal::redux_impl::__anon4982
297 VectorizedSize = (Size / PacketSize) * PacketSize
302 Scalar res = func.predux(redux_vec_unroller<Func, Derived, 0, Size / PacketSize>::run(mat,func));
H A DAssign.h43 PacketSize = packet_traits<typename Derived::Scalar>::size enumerator in enum:Eigen::internal::assign_traits::__anon4790
50 MayInnerVectorize = MightVectorize && int(InnerSize)!=Dynamic && int(InnerSize)%int(PacketSize)==0
58 && (int(InnerMaxSize)==Dynamic || int(InnerMaxSize)>=3*PacketSize)
78 UnrollingLimit = EIGEN_UNROLLING_LIMIT * (Vectorized ? int(PacketSize) : 1),
110 EIGEN_DEBUG_VAR(PacketSize)
H A DGeneralProduct.h395 PacketSize = internal::packet_traits<Scalar>::size
397 internal::plain_array<Scalar,EIGEN_SIZE_MIN_PREFER_FIXED(Size,MaxSize)+(ForceAlignment?PacketSize:0),0> m_data;
/external/eigen/Eigen/src/Core/products/
H A DSelfadjointMatrixVector.h47 const Index PacketSize = sizeof(Packet)/sizeof(Scalar); local
98 size_t alignedEnd = alignedStart + ((endi-alignedStart)/(PacketSize))*(PacketSize);
126 for (size_t i=alignedStart; i<alignedEnd; i+=PacketSize)
128 Packet A0i = ploadu<Packet>(a0It); a0It += PacketSize;
129 Packet A1i = ploadu<Packet>(a1It); a1It += PacketSize;
130 Packet Bi = ploadu<Packet>(rhsIt); rhsIt += PacketSize; // FIXME should be aligned in most cases
136 pstore(resIt,Xi); resIt += PacketSize;
H A DGeneralBlockPanelKernel.h1128 enum { PacketSize = packet_traits<Scalar>::size }; enumerator in enum:Eigen::internal::__anon5060
1134 eigen_assert( (StorageOrder==RowMajor) || ((Pack1%PacketSize)==0 && Pack1<=4*PacketSize) );
1148 if(Pack1>=1*PacketSize) A = ploadu<Packet>(&lhs(i+0*PacketSize, k));
1149 if(Pack1>=2*PacketSize) B = ploadu<Packet>(&lhs(i+1*PacketSize, k));
1150 if(Pack1>=3*PacketSize) C = ploadu<Packet>(&lhs(i+2*PacketSize, k));
1151 if(Pack1>=4*PacketSize)
1211 enum { PacketSize = packet_traits<Scalar>::size }; enumerator in enum:Eigen::internal::gemm_pack_rhs::__anon5061
1264 enum { PacketSize = packet_traits<Scalar>::size }; enumerator in enum:Eigen::internal::gemm_pack_rhs::__anon5062
[all...]
H A DCoeffBasedProduct.h130 PacketSize = internal::packet_traits<Scalar>::size, enumerator in enum:Eigen::CoeffBasedProduct::__anon5051
288 enum { PacketSize = packet_traits<typename Lhs::Scalar>::size }; enumerator in enum:Eigen::internal::product_coeff_vectorized_unroller::__anon5052
291 product_coeff_vectorized_unroller<UnrollingIndex-PacketSize, Lhs, Rhs, Packet>::run(row, col, lhs, rhs, pres);
321 enum { PacketSize = packet_traits<typename Lhs::Scalar>::size }; enumerator in enum:Eigen::internal::product_coeff_impl::__anon5053
325 product_coeff_vectorized_unroller<UnrollingIndex-PacketSize, Lhs, Rhs, Packet>::run(row, col, lhs, rhs, pres);
H A DSelfadjointMatrixMatrix.h79 enum { PacketSize = packet_traits<Scalar>::size }; enumerator in enum:Eigen::internal::symm_pack_rhs::__anon5073
/external/eigen/bench/btl/libs/eigen3/
H A Deigen3_interface.hh117 const int PacketSize = sizeof(Packet)/sizeof(Scalar); local
126 alignedEnd = alignedStart + ((size-alignedStart)/(2*PacketSize))*(PacketSize*2);
138 for (int index = alignedStart; index<alignedEnd; index+=PacketSize)
/external/webrtc/webrtc/modules/rtp_rtcp/source/
H A Drtcp_utility_unittest.cc103 TEST_F(RtcpParseCommonHeaderTest, PacketSize) {
/external/eigen/Eigen/src/Core/util/
H A DMemory.h469 static const Index PacketSize = packet_traits<Scalar>::size; local
470 static const Index PacketAlignedMask = PacketSize-1;
472 if(PacketSize==1)
486 return std::min<Index>( (PacketSize - (Index((size_t(array)/sizeof(Scalar))) & PacketAlignedMask))
/external/eigen/Eigen/src/Cholesky/
H A DLLT.h65 PacketSize = internal::packet_traits<Scalar>::size, enumerator in enum:Eigen::LLT::__anon4784
66 AlignmentMask = int(PacketSize)-1,
/external/eigen/Eigen/src/Eigen2Support/
H A DSVD.h37 PacketSize = internal::packet_traits<Scalar>::size, enumerator in enum:Eigen::SVD::__anon5182
38 AlignmentMask = int(PacketSize)-1,

Completed in 6797 milliseconds