HomeSort by relevance Sort by last modified time
    Searched defs:PacketSize (Results 1 - 21 of 21) sorted by null

  /external/eigen/Eigen/src/SparseLU/
SparseLU_kernel_bmod.h 66 const Index PacketSize = internal::packet_traits<Scalar>::size;
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;
SparseLU_panel_bmod.h 69 const Index PacketSize = internal::packet_traits<Scalar>::size;
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;
SparseLU_gemm_kernel.h 33 PacketSize = packet_traits<Scalar>::size,
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/test/eigen2/
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;
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) && "ei_ploadu")
    [all...]
  /external/eigen/bench/
benchVecAdd.cpp 94 const int PacketSize = internal::packet_traits<Scalar>::size;
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/
vectorization_logic.cpp 81 PacketSize = internal::packet_traits<Scalar>::size
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:16,DontAlign|EIGEN_DEFAULT_MATRIX_STORAGE_ORDER_OPTION> Matrix44u
    [all...]
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;
107 const int size = PacketSize*4
    [all...]
product_extra.cpp 117 const int PacketSize = internal::packet_traits<Scalar>::size;
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,1> res
    [all...]
  /external/eigen/Eigen/src/Core/
Reverse.h 85 PacketSize = internal::packet_traits<Scalar>::size,
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));
Assign.h 43 PacketSize = packet_traits<typename Derived::Scalar>::size
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)
330 const Index packetSize = packet_traits<typename Derived1::Scalar>::size;
332 for(Index inner = 0; inner < innerSize; inner+=packetSize)
398 packetSize = PacketTraits::size,
404 const Index alignedEnd = alignedStart + ((size-alignedStart)/packetSize)*packetSize;
    [all...]
Redux.h 31 PacketSize = packet_traits<typename Derived::Scalar>::size,
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,
203 const Index packetSize = packet_traits<Scalar>::size;
209 const Index alignedSize2 = ((size-alignedStart)/(2*packetSize))*(2*packetSize);
210 const Index alignedSize = ((size-alignedStart)/(packetSize))*(packetSize);
217 if(alignedSize>packetSize) // we have at least two packets to partly unroll the loo
    [all...]
  /external/eigen/Eigen/src/Core/products/
SelfadjointMatrixMatrix.h 79 enum { PacketSize = packet_traits<Scalar>::size };
CoeffBasedProduct.h 130 PacketSize = internal::packet_traits<Scalar>::size,
288 enum { PacketSize = packet_traits<typename Lhs::Scalar>::size };
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 };
325 product_coeff_vectorized_unroller<UnrollingIndex-PacketSize, Lhs, Rhs, Packet>::run(row, col, lhs, rhs, pres);
SelfadjointMatrixVector.h 47 const Index PacketSize = sizeof(Packet)/sizeof(Scalar);
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;
GeneralBlockPanelKernel.h     [all...]
  /external/eigen/Eigen/src/Eigen2Support/
SVD.h 37 PacketSize = internal::packet_traits<Scalar>::size,
38 AlignmentMask = int(PacketSize)-1,
  /external/eigen/bench/btl/libs/eigen3/
eigen3_interface.hh 117 const int PacketSize = sizeof(Packet)/sizeof(Scalar);
126 alignedEnd = alignedStart + ((size-alignedStart)/(2*PacketSize))*(PacketSize*2);
138 for (int index = alignedStart; index<alignedEnd; index+=PacketSize)
  /external/eigen/Eigen/src/Cholesky/
LLT.h 65 PacketSize = internal::packet_traits<Scalar>::size,
66 AlignmentMask = int(PacketSize)-1,
  /external/eigen/Eigen/src/Core/util/
Memory.h 469 static const Index PacketSize = packet_traits<Scalar>::size;
470 static const Index PacketAlignedMask = PacketSize-1;
472 if(PacketSize==1)
486 return std::min<Index>( (PacketSize - (Index((size_t(array)/sizeof(Scalar))) & PacketAlignedMask))
    [all...]
  /frameworks/av/media/libstagefright/codecs/m4v_h263/enc/src/
mp4enc_api.cpp 209 Int PacketSize = encOption->packetSize << 3;
245 /* Check whether the input packetsize is valid (Note: put code here (before any memory allocation) in order to avoid memory leak */
274 if (PacketSize == 0)
299 if (PacketSize > profile_level_table[profile_table_index])
355 encParams->ResyncPacketsize = encOption->packetSize << 3;
412 encParams->ResyncPacketsize = PacketSize;
420 encParams->ResyncPacketsize = PacketSize;
723 /* Allocate (2*packetsize) working bitstreams */
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/
scsi.h     [all...]

Completed in 409 milliseconds