| /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); \
103 const int PacketSize = internal::packet_traits<Scalar>::size;
106 const int size = PacketSize*4
[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/Eigen/src/Jacobi/ |
| Jacobi.h | 297 enum { PacketSize = packet_traits<Scalar>::size };
311 ((incrx==1 && incry==1) || PacketSize == 1))
317 Index alignedEnd = alignedStart + ((size-alignedStart)/PacketSize)*PacketSize;
336 for(Index i=alignedStart; i<alignedEnd; i+=PacketSize)
342 px += PacketSize;
343 py += PacketSize;
348 Index peelingEnd = alignedStart + ((size-alignedStart)/(Peeling*PacketSize))*(Peeling*PacketSize);
349 for(Index i=alignedStart; i<peelingEnd; i+=Peeling*PacketSize)
[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));
|
| 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...] |
| 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...] |
| GeneralProduct.h | 373 PacketSize = internal::packet_traits<Scalar>::size
375 internal::plain_array<Scalar,EIGEN_SIZE_MIN_PREFER_FIXED(Size,MaxSize)+(ForceAlignment?PacketSize:0),0> m_data;
|
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointMatrixVector.h | 39 const Index PacketSize = sizeof(Packet)/sizeof(Scalar);
90 size_t alignedEnd = alignedStart + ((endi-alignedStart)/(PacketSize))*(PacketSize);
118 for (size_t i=alignedStart; i<alignedEnd; i+=PacketSize)
120 Packet A0i = ploadu<Packet>(a0It); a0It += PacketSize;
121 Packet A1i = ploadu<Packet>(a1It); a1It += PacketSize;
122 Packet Bi = ploadu<Packet>(rhsIt); rhsIt += PacketSize; // FIXME should be aligned in most cases
128 pstore(resIt,Xi); resIt += PacketSize;
|
| GeneralBlockPanelKernel.h | [all...] |
| CoeffBasedProduct.h | 129 PacketSize = internal::packet_traits<Scalar>::size,
280 enum { PacketSize = packet_traits<typename Lhs::Scalar>::size };
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 };
307 product_coeff_vectorized_unroller<UnrollingIndex+1-PacketSize, Lhs, Rhs, Packet>::run(row, col, lhs, rhs, pres);
|
| SelfadjointMatrixMatrix.h | 79 enum { PacketSize = packet_traits<Scalar>::size };
|
| /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/chromium_org/net/quic/ |
| quic_packet_creator.h | 121 // value than max_packet_size - PacketSize(), in this case.
128 size_t PacketSize() const;
215 // Mutable so PacketSize() can adjust it when the packet is empty.
218 // packet_size should never be read directly, use PacketSize() instead.
|
| quic_packet_creator.cc | 275 DCHECK_GE(max_plaintext_size, PacketSize());
282 size_t expanded_packet_size = PacketSize() +
291 size_t QuicPacketCreator::PacketSize() const {
|
| /external/eigen/Eigen/src/Core/util/ |
| Memory.h | 450 enum { PacketSize = packet_traits<Scalar>::size,
451 PacketAlignedMask = PacketSize-1
454 if(PacketSize==1)
468 return std::min<Index>( (PacketSize - (Index((size_t(array)/sizeof(Scalar))) & PacketAlignedMask))
[all...] |
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 65 PacketSize = internal::packet_traits<Scalar>::size,
66 AlignmentMask = int(PacketSize)-1,
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| SVD.h | 37 PacketSize = internal::packet_traits<Scalar>::size,
38 AlignmentMask = int(PacketSize)-1,
|
| /frameworks/av/media/libstagefright/codecs/m4v_h263/enc/src/ |
| mp4enc_api.cpp | 202 Int PacketSize = encOption->packetSize << 3;
238 /* Check whether the input packetsize is valid (Note: put code here (before any memory allocation) in order to avoid memory leak */
267 if (PacketSize == 0)
292 if (PacketSize > profile_level_table[profile_table_index])
348 encParams->ResyncPacketsize = encOption->packetSize << 3;
405 encParams->ResyncPacketsize = PacketSize;
413 encParams->ResyncPacketsize = PacketSize;
700 /* Allocate (2*packetsize) working bitstreams */
[all...] |
