/external/eigen/test/eigen2/ |
H A D | eigen2_packetmath.cpp | 22 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/Eigen/src/SparseLU/ |
H A D | SparseLU_kernel_bmod.h | 66 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 D | SparseLU_panel_bmod.h | 69 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;
|
H A D | SparseLU_gemm_kernel.h | 33 PacketSize = packet_traits<Scalar>::size, enumerator in enum:Eigen::internal::__anon20998 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...] |
/external/eigen/bench/ |
H A D | benchVecAdd.cpp | 94 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/test/ |
H A D | vectorization_logic.cpp | 81 PacketSize = internal::packet_traits<Scalar>::size enumerator in enum:vectorization_logic::__anon21062 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 D | packetmath.cpp | 54 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 258 const int PacketSize = internal::packet_traits<Scalar>::size; local 289 const int PacketSize = internal::packet_traits<Scalar>::size; local 317 const int PacketSize = internal::packet_traits<Scalar>::size; local [all...] |
/external/eigen/Eigen/src/Core/ |
H A D | Assign.h | 43 PacketSize = packet_traits<typename Derived::Scalar>::size enumerator in enum:Eigen::internal::assign_traits::__anon20493 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 D | Redux.h | 31 PacketSize = packet_traits<typename Derived::Scalar>::size, enumerator in enum:Eigen::internal::redux_traits::__anon20672 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::__anon20679 295 PacketSize = packet_traits<Scalar>::size, enumerator in enum:Eigen::internal::redux_impl::__anon20683 297 VectorizedSize = (Size / PacketSize) * PacketSize 302 Scalar res = func.predux(redux_vec_unroller<Func, Derived, 0, Size / PacketSize>::run(mat,func));
|
H A D | Reverse.h | 85 PacketSize = internal::packet_traits<Scalar>::size, enumerator in enum:Eigen::Reverse::__anon20690 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));
|
/external/eigen/Eigen/src/Core/products/ |
H A D | CoeffBasedProduct.h | 129 PacketSize = internal::packet_traits<Scalar>::size, enumerator in enum:Eigen::CoeffBasedProduct::__anon20751 280 enum { PacketSize = packet_traits<typename Lhs::Scalar>::size }; enumerator in enum:Eigen::internal::product_coeff_vectorized_unroller::__anon20752 283 product_coeff_vectorized_unroller<UnrollingIndex-PacketSize, Lhs, Rhs, Packet>::run(row, col, lhs, rhs, pres); 303 enum { PacketSize = packet_traits<typename Lhs::Scalar>::size }; enumerator in enum:Eigen::internal::product_coeff_impl::__anon20753 307 product_coeff_vectorized_unroller<UnrollingIndex+1-PacketSize, Lhs, Rhs, Packet>::run(row, col, lhs, rhs, pres);
|
H A D | SelfadjointMatrixMatrix.h | 79 enum { PacketSize = packet_traits<Scalar>::size }; enumerator in enum:Eigen::internal::symm_pack_rhs::__anon20773
|
H A D | SelfadjointMatrixVector.h | 47 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 D | GeneralBlockPanelKernel.h | 1128 enum { PacketSize = packet_traits<Scalar>::size }; enumerator in enum:Eigen::internal::__anon20760 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::__anon20761 1264 enum { PacketSize = packet_traits<Scalar>::size }; enumerator in enum:Eigen::internal::gemm_pack_rhs::__anon20762 [all...] |
/external/eigen/Eigen/src/Eigen2Support/ |
H A D | SVD.h | 37 PacketSize = internal::packet_traits<Scalar>::size, enumerator in enum:Eigen::SVD::__anon20883 38 AlignmentMask = int(PacketSize)-1,
|
/external/eigen/bench/btl/libs/eigen3/ |
H A D | eigen3_interface.hh | 117 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/eigen/Eigen/src/Cholesky/ |
H A D | LLT.h | 65 PacketSize = internal::packet_traits<Scalar>::size, enumerator in enum:Eigen::LLT::__anon20489 66 AlignmentMask = int(PacketSize)-1,
|
/external/chromium_org/net/quic/ |
H A D | quic_packet_creator.cc | 347 DCHECK_GE(max_plaintext_size, PacketSize()); 348 return max_plaintext_size - min(max_plaintext_size, PacketSize() 352 size_t QuicPacketCreator::PacketSize() const { function in class:net::QuicPacketCreator
|
/external/eigen/Eigen/src/Core/util/ |
H A D | Memory.h | 467 enum { PacketSize = packet_traits<Scalar>::size, enumerator in enum:Eigen::internal::__anon20807 468 PacketAlignedMask = PacketSize-1 471 if(PacketSize==1) 485 return std::min<Index>( (PacketSize - (Index((size_t(array)/sizeof(Scalar))) & PacketAlignedMask))
|