/external/pdfium/fxbarcode/qrcode/ |
H A D | BC_QRCoderECBlocks.h | 28 const CBC_QRCoderECBlockData& m_data; member in class:CBC_QRCoderECBlocks
|
/external/deqp/framework/common/ |
H A D | tcuArray.hpp | 41 inline T operator[] (int ndx) const { return m_data[ndx]; } 42 inline T& operator[] (int ndx) { return m_data[ndx]; } 44 inline const T* getPtr (void) const { return m_data; } 45 inline T* getPtr (void) { return m_data; } 48 T m_data[Size]; member in class:tcu::Array
|
H A D | tcuEither.hpp | 78 deUint8 m_data[sizeof(First) > sizeof(Second) ? sizeof(First) : sizeof(Second)]; member in union:tcu::Either::__anon4718 158 m_first = new(m_data)First(first); 165 m_second = new(m_data)Second(second); 179 m_first = new(m_data)First(*other.m_first); 181 m_second = new(m_data)Second(*other.m_second); 195 m_first = new(m_data)First(*other.m_first); 197 m_second = new(m_data)Second(*other.m_second); 208 m_first = new(m_data)First(first); 219 m_second = new(m_data)Second(second);
|
H A D | tcuMaybe.hpp | 57 deUint8 m_data[sizeof(T)]; member in union:tcu::Maybe::__anon4724 91 m_ptr = new(m_data)T(val); 100 m_ptr = new(m_data)T(val); 110 m_ptr = new(m_data)T(*other.m_ptr); 123 m_ptr = new(m_data)T(*other.m_ptr);
|
H A D | tcuCompressedTexture.hpp | 124 int getDataSize (void) const { return (int)m_data.size(); } 125 const void* getData (void) const { return &m_data[0]; } 126 void* getData (void) { return &m_data[0]; } 135 std::vector<deUint8> m_data; member in class:tcu::CompressedTexture
|
/external/deqp/framework/randomshaders/ |
H A D | rsgExecutionContext.hpp | 57 Scalar m_data[EXEC_VEC_WIDTH]; member in class:rsg::ExecMaskStorage
|
/external/testng/src/test/java/test/dataprovider/ |
H A D | MyIterator.java | 7 private Object[][] m_data; field in class:MyIterator 10 m_data = data; 15 return m_count < m_data.length; 21 return m_data[m_count++];
|
/external/deqp/external/vulkancts/modules/vulkan/dynamic_state/ |
H A D | vktDynamicStateBaseClass.hpp | 108 std::vector<PositionColorVertex> m_data; member in class:vkt::DynamicState::DynamicStateBaseClass
|
/external/deqp/external/vulkancts/modules/vulkan/ycbcr/ |
H A D | vktYCbCrUtil.hpp | 143 void* getDataPtr (void) const { return m_data; } 159 void* const m_data; member in class:vkt::ycbcr::ChannelAccess
|
/external/eigen/Eigen/src/Core/ |
H A D | DenseStorage.h | 185 internal::plain_array<T,Size,_Options> m_data; member in class:Eigen::DenseStorage 192 : m_data(internal::constructor_without_unaligned_array_assert()) {} 194 DenseStorage(const DenseStorage& other) : m_data(other.m_data) { 200 if (this != &other) m_data = other.m_data; 210 EIGEN_DEVICE_FUNC void swap(DenseStorage& other) { std::swap(m_data,other.m_data); } 215 EIGEN_DEVICE_FUNC const T *data() const { return m_data.array; } 216 EIGEN_DEVICE_FUNC T *data() { return m_data 250 internal::plain_array<T,Size,_Options> m_data; member in class:Eigen::DenseStorage 282 internal::plain_array<T,Size,_Options> m_data; member in class:Eigen::DenseStorage 311 internal::plain_array<T,Size,_Options> m_data; member in class:Eigen::DenseStorage 340 T *m_data; member in class:Eigen::DenseStorage 423 T *m_data; member in class:Eigen::DenseStorage 497 T *m_data; member in class:Eigen::DenseStorage [all...] |
H A D | MapBase.h | 99 EIGEN_DEVICE_FUNC inline const Scalar* data() const { return m_data; } 105 return m_data[colId * colStride() + rowId * rowStride()]; 113 return m_data[index * innerStride()]; 120 return this->m_data[colId * colStride() + rowId * rowStride()]; 128 return this->m_data[index * innerStride()]; 136 (m_data + (colId * colStride() + rowId * rowStride())); 144 return internal::ploadt<PacketScalar, LoadMode>(m_data + index * innerStride()); 149 explicit inline MapBase(PointerType dataPtr) : m_data(dataPtr), m_rows(RowsAtCompileTime), m_cols(ColsAtCompileTime) 158 : m_data(dataPtr), 171 : m_data(dataPt 200 PointerType m_data; member in class:Eigen::MapBase [all...] |
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
H A D | TensorStorage.h | 46 EIGEN_ALIGN_MAX T m_data[MinSize]; member in class:Eigen::TensorStorage 56 EIGEN_STRONG_INLINE T *data() { return m_data; } 58 EIGEN_STRONG_INLINE const T *data() const { return m_data; } 77 EIGEN_DEVICE_FUNC TensorStorage() : m_data(0), m_dimensions() { 79 m_data = internal::conditional_aligned_new_auto<T,(Options_&DontAlign)==0>(1); 83 : m_data(0), m_dimensions(internal::template repeat<NumIndices_, Index>(0)) {} 85 : m_data(internal::conditional_aligned_new_auto<T,(Options_&DontAlign)==0>(size)), m_dimensions(dimensions) 91 m_data = internal::conditional_aligned_new_auto<T,(Options_&DontAlign)==0>(internal::array_prod(m_dimensions)); 96 : m_data(internal::conditional_aligned_new_auto<T,(Options_&DontAlign)==0>(internal::array_prod(other.m_dimensions))) 99 internal::smart_copy(other.m_data, othe 140 T *m_data; member in class:Eigen::TensorStorage [all...] |
H A D | TensorEvaluator.h | 49 : m_data(const_cast<typename internal::traits<Derived>::template MakePointer<Scalar>::Type>(m.data())), m_dims(m.dimensions()), m_device(device), m_impl(m) 58 m_device.memcpy((void*)dest, m_data, sizeof(Scalar) * m_dims.TotalSize()); 67 eigen_assert(m_data); 68 return m_data[index]; 72 eigen_assert(m_data); 73 return m_data[index]; 79 return internal::ploadt<PacketReturnType, LoadMode>(m_data + index); 85 return internal::pstoret<Scalar, PacketReturnType, StoreMode>(m_data + index, x); 89 eigen_assert(m_data); 91 return m_data[m_dim 117 typename internal::traits<Derived>::template MakePointer<Scalar>::Type m_data; member in struct:Eigen::TensorEvaluator 216 typename internal::traits<Derived>::template MakePointer<const Scalar>::Type m_data; member in struct:Eigen::TensorEvaluator [all...] |
H A D | TensorMap.h | 60 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr) : m_data(dataPtr), m_dimensions() { 67 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr, Index firstDimension, IndexTypes... otherDimensions) : m_data(dataPtr), m_dimensions(firstDimension, otherDimensions...) { 73 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr, Index firstDimension) : m_data(dataPtr), m_dimensions(firstDimension) { 78 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr, Index dim1, Index dim2) : m_data(dataPtr), m_dimensions(dim1, dim2) { 82 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr, Index dim1, Index dim2, Index dim3) : m_data(dataPtr), m_dimensions(dim1, dim2, dim3) { 86 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr, Index dim1, Index dim2, Index dim3, Index dim4) : m_data(dataPtr), m_dimensions(dim1, dim2, dim3, dim4) { 90 EIGEN_STRONG_INLINE TensorMap(PointerArgType dataPtr, Index dim1, Index dim2, Index dim3, Index dim4, Index dim5) : m_data(dataPtr), m_dimensions(dim1, dim2, dim3, dim4, dim5) { 96 : m_data(dataPtr), m_dimensions(dimensions) 101 : m_data(dataPtr), m_dimensions(dimensions) 105 : m_data(tenso 315 typename MakePointer_<Scalar>::Type m_data; member in class:Eigen::TensorMap [all...] |
/external/clang/test/Analysis/ |
H A D | malloc.cpp | 16 mutable void* m_data; member in struct:Foo 17 Foo(void* data) : m_data(data) {}
|
/external/deqp/executor/ |
H A D | xeBatchResult.hpp | 58 size_t getSize (void) const { return m_data.size(); } 59 const deUint8* getBytes (void) const { return !m_data.empty() ? &m_data[0] : DE_NULL; } 67 std::vector<deUint8> m_data; member in class:xe::InfoLog 83 int getDataSize (void) const { return (int)m_data.size(); } 84 void setDataSize (int size) { m_data.resize(size); } 86 const deUint8* getData (void) const { return !m_data.empty() ? &m_data[0] : DE_NULL; } 87 deUint8* getData (void) { return !m_data.empty() ? &m_data[ 96 std::vector<deUint8> m_data; member in class:xe::TestCaseResultData [all...] |
H A D | xeCallQueue.hpp | 58 size_t getDataSize (void) const { return m_data.size(); } 59 void setDataSize (size_t size) { m_data.resize(size); } 61 const deUint8* getData (void) const { return m_data.empty() ? DE_NULL : &m_data[0]; } 62 deUint8* getData (void) { return m_data.empty() ? DE_NULL : &m_data[0]; } 66 std::vector<deUint8> m_data; member in class:xe::Call
|
/external/deqp/external/vulkancts/modules/vulkan/draw/ |
H A D | vktDrawBaseClass.hpp | 151 std::vector<VertexElementData> m_data; member in class:vkt::Draw::DrawTestsBaseClass
|
/external/deqp/modules/gles2/functional/ |
H A D | es2fBufferTestUtil.hpp | 87 deUint8* getPtr (int offset = 0) { return &m_data[offset]; } 88 const deUint8* getPtr (int offset = 0) const { return &m_data[offset]; } 91 std::vector<deUint8> m_data; member in class:deqp::gles2::Functional::BufferTestUtil::ReferenceBuffer
|
/external/deqp/external/openglcts/modules/gl/ |
H A D | gl3cGPUShader5Tests.hpp | 291 const void* m_data; member in struct:gl3cts::GPUShader5FloatEncodingTest::valueInfo
|
/external/deqp/external/vulkancts/framework/vulkan/ |
H A D | vkRef.hpp | 249 inline const T& get (void) const throw() { return m_data.object; } 254 RefBase (RefData<T> data) : m_data(data) {} 261 RefData<T> m_data; member in class:vk::refdetails::RefBase 273 if (!!m_data.object) 274 m_data.deleter(m_data.object); 276 m_data = RefData<T>(); 283 swap(m_data, tmp); 291 m_data = data;
|
/external/deqp/framework/delibs/decpp/ |
H A D | deUniquePtr.hpp | 60 T* get (void) const throw() { return m_data.ptr; } //!< Get stored pointer. 61 D getDeleter (void) const throw() { return m_data.deleter; } 67 UniqueBase (T* ptr, D deleter) : m_data(ptr, deleter) {} 68 UniqueBase (PtrData<T, D> data) : m_data(data) {} 76 PtrData<T, D> m_data; member in class:de::details::UniqueBase 88 if (m_data.ptr != DE_NULL) 90 m_data.deleter(m_data.ptr); 91 m_data.ptr = DE_NULL; 98 PtrData<T, D> data = m_data; [all...] |
/external/deqp/modules/glshared/ |
H A D | glsBufferTestUtil.hpp | 94 deUint8* getPtr (int offset = 0) { return &m_data[offset]; } 95 const deUint8* getPtr (int offset = 0) const { return &m_data[offset]; } 98 std::vector<deUint8> m_data; member in class:deqp::gls::BufferTestUtil::ReferenceBuffer
|
/external/eigen/Eigen/src/Core/util/ |
H A D | BlasUtil.h | 139 EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE BlasVectorMapper(Scalar *data) : m_data(data) {} 142 return m_data[i]; 146 return ploadt<Packet, AlignmentType>(m_data + i); 151 return (UIntPtr(m_data+i)%sizeof(Packet))==0; 155 Scalar* m_data; member in class:Eigen::internal::BlasVectorMapper 164 EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE BlasLinearMapper(Scalar *data) : m_data(data) {} 171 return m_data[i]; 175 return ploadt<Packet, AlignmentType>(m_data + i); 179 return ploadt<HalfPacket, AlignmentType>(m_data + i); 183 pstoret<Scalar, Packet, AlignmentType>(m_data 187 Scalar *m_data; member in class:Eigen::internal::BlasLinearMapper 250 Scalar* EIGEN_RESTRICT m_data; member in class:Eigen::internal::blas_data_mapper [all...] |
/external/eigen/unsupported/Eigen/src/Skyline/ |
H A D | SkylineMatrix.h | 70 SkylineStorage<Scalar> m_data; member in class:Eigen::SkylineMatrix 91 return m_data.upperSize(); 95 return m_data.lowerSize(); 107 return &m_data.diag(0); 111 return &m_data.diag(0); 115 return &m_data.upper(0); 119 return &m_data.upper(0); 123 return &m_data.lower(0); 127 return &m_data.lower(0); 131 return &m_data 235 eigen_assert(idx < outerSize()); eigen_assert(idx < innerSize()); return this->m_data.diag(idx); } inline Scalar coeffLower(Index row, Index col) const { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); eigen_assert(inner != outer); if (IsRowMajor) { const Index minInnerIndex = outer - m_data.lowerProfile(outer); if (inner >= minInnerIndex) return this->m_data.lower(m_rowStartIndex[outer] + inner - (outer - m_data.lowerProfile(outer))); else return Scalar(0); } else { const Index maxInnerIndex = outer + m_data.lowerProfile(outer); if (inner <= maxInnerIndex) return this->m_data.lower(m_rowStartIndex[outer] + (inner - outer)); else return Scalar(0); } } inline Scalar coeffUpper(Index row, Index col) const { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); eigen_assert(inner != outer); if (IsRowMajor) { const Index minOuterIndex = inner - m_data.upperProfile(inner); if (outer >= minOuterIndex) return this->m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner))); else return Scalar(0); } else { const Index maxOuterIndex = inner + m_data.upperProfile(inner); if (outer <= maxOuterIndex) return this->m_data.upper(m_colStartIndex[inner] + (outer - inner)); else return Scalar(0); } } inline Scalar& coeffRefDiag(Index idx) { eigen_assert(idx < outerSize()); eigen_assert(idx < innerSize()); return this->m_data.diag(idx); } inline Scalar& coeffRefLower(Index row, Index col) { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); eigen_assert(inner != outer); if (IsRowMajor) { const Index minInnerIndex = outer - m_data.lowerProfile(outer); eigen_assert(inner >= minInnerIndex && �); return this->m_data.lower(m_rowStartIndex[outer] + inner - (outer - m_data.lowerProfile(outer))); } else { const Index maxInnerIndex = outer + m_data.lowerProfile(outer); eigen_assert(inner <= maxInnerIndex && �); return this->m_data.lower(m_rowStartIndex[outer] + (inner - outer)); } } inline bool coeffExistLower(Index row, Index col) { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); eigen_assert(inner != outer); if (IsRowMajor) { const Index minInnerIndex = outer - m_data.lowerProfile(outer); return inner >= minInnerIndex; } else { const Index maxInnerIndex = outer + m_data.lowerProfile(outer); return inner <= maxInnerIndex; } } inline Scalar& coeffRefUpper(Index row, Index col) { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); eigen_assert(inner != outer); if (IsRowMajor) { const Index minOuterIndex = inner - m_data.upperProfile(inner); eigen_assert(outer >= minOuterIndex && �); return this->m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner))); } else { const Index maxOuterIndex = inner + m_data.upperProfile(inner); eigen_assert(outer <= maxOuterIndex && �); return this->m_data.upper(m_colStartIndex[inner] + (outer - inner)); } } inline bool coeffExistUpper(Index row, Index col) { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); eigen_assert(inner != outer); if (IsRowMajor) { const Index minOuterIndex = inner - m_data.upperProfile(inner); return outer >= minOuterIndex; } else { const Index maxOuterIndex = inner + m_data.upperProfile(inner); return outer <= maxOuterIndex; } } protected: public: class InnerUpperIterator; class InnerLowerIterator; class OuterUpperIterator; class OuterLowerIterator; inline void setZero() { m_data.clear(); memset(m_colStartIndex, 0, (m_outerSize + 1) * sizeof (Index)); memset(m_rowStartIndex, 0, (m_outerSize + 1) * sizeof (Index)); } inline Index nonZeros() const { return m_data.diagSize() + m_data.upperSize() + m_data.lowerSize(); } inline void reserve(Index reserveSize, Index reserveUpperSize, Index reserveLowerSize) { m_data.reserve(reserveSize, reserveUpperSize, reserveLowerSize); } EIGEN_DONT_INLINE Scalar & insert(Index row, Index col) { const Index outer = IsRowMajor ? row : col; const Index inner = IsRowMajor ? col : row; eigen_assert(outer < outerSize()); eigen_assert(inner < innerSize()); if (outer == inner) return m_data.diag(col); if (IsRowMajor) { if (outer < inner) { Index minOuterIndex = 0; minOuterIndex = inner - m_data.upperProfile(inner); if (outer < minOuterIndex) { const Index previousProfile = m_data.upperProfile(inner); m_data.upperProfile(inner) = inner - outer; const Index bandIncrement = m_data.upperProfile(inner) - previousProfile; const Index stop = m_colStartIndex[cols()]; const Index start = m_colStartIndex[inner]; for (Index innerIdx = stop; innerIdx >= start; innerIdx--) { m_data.upper(innerIdx + bandIncrement) = m_data.upper(innerIdx); } for (Index innerIdx = cols(); innerIdx > inner; innerIdx--) { m_colStartIndex[innerIdx] += bandIncrement; } memset(this->_upperPtr() + start, 0, (bandIncrement - 1) * sizeof (Scalar)); return m_data.upper(m_colStartIndex[inner]); } else { return m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner))); } } if (outer > inner) { const Index minInnerIndex = outer - m_data.lowerProfile(outer); if (inner < minInnerIndex) { const Index previousProfile = m_data.lowerProfile(outer); m_data.lowerProfile(outer) = outer - inner; const Index bandIncrement = m_data.lowerProfile(outer) - previousProfile; const Index stop = m_rowStartIndex[rows()]; const Index start = m_rowStartIndex[outer]; for (Index innerIdx = stop; innerIdx >= start; innerIdx--) { m_data.lower(innerIdx + bandIncrement) = m_data.lower(innerIdx); } for (Index innerIdx = rows(); innerIdx > outer; innerIdx--) { m_rowStartIndex[innerIdx] += bandIncrement; } memset(this->_lowerPtr() + start, 0, (bandIncrement - 1) * sizeof (Scalar)); return m_data.lower(m_rowStartIndex[outer]); } else { return m_data.lower(m_rowStartIndex[outer] + inner - (outer - m_data.lowerProfile(outer))); } } } else { if (outer > inner) { const Index maxOuterIndex = inner + m_data.upperProfile(inner); if (outer > maxOuterIndex) { const Index previousProfile = m_data.upperProfile(inner); m_data.upperProfile(inner) = outer - inner; const Index bandIncrement = m_data.upperProfile(inner) - previousProfile; const Index stop = m_rowStartIndex[rows()]; const Index start = m_rowStartIndex[inner + 1]; for (Index innerIdx = stop; innerIdx >= start; innerIdx--) { m_data.upper(innerIdx + bandIncrement) = m_data.upper(innerIdx); } for (Index innerIdx = inner + 1; innerIdx < outerSize() + 1; innerIdx++) { m_rowStartIndex[innerIdx] += bandIncrement; } memset(this->_upperPtr() + m_rowStartIndex[inner] + previousProfile + 1, 0, (bandIncrement - 1) * sizeof (Scalar)); return m_data.upper(m_rowStartIndex[inner] + m_data.upperProfile(inner)); } else { return m_data.upper(m_rowStartIndex[inner] + (outer - inner)); } } if (outer < inner) { const Index maxInnerIndex = outer + m_data.lowerProfile(outer); if (inner > maxInnerIndex) { const Index previousProfile = m_data.lowerProfile(outer); m_data.lowerProfile(outer) = inner - outer; const Index bandIncrement = m_data.lowerProfile(outer) - previousProfile; const Index stop = m_colStartIndex[cols()]; const Index start = m_colStartIndex[outer + 1]; for (Index innerIdx = stop; innerIdx >= start; innerIdx--) argument [all...] |