/external/lldb/include/lldb/Core/ |
H A D | DataBufferHeap.h | 133 buffer_t m_data; ///< The heap based buffer where data is stored member in class:lldb_private::DataBufferHeap
|
H A D | Baton.h | 37 m_data (p) 51 void *m_data; // Leave baton public for easy access member in class:lldb_private::Baton
|
H A D | DataBufferMemoryMap.h | 150 uint8_t *m_data; ///< The data the user requested somewhere within the memory mapped data. member in class:lldb_private::DataBufferMemoryMap
|
/external/lldb/include/lldb/Expression/ |
H A D | DWARFExpression.h | 366 data = m_data; 414 DataExtractor m_data; ///< A data extractor capable of reading opcode bytes member in class:lldb_private::DWARFExpression
|
H A D | IRMemoryMap.h | 87 DataBufferHeap m_data; member in struct:lldb_private::IRMemoryMap::Allocation 106 m_data (),
|
/external/svox/pico/tts/ |
H A D | svox_ssml_parser.h | 151 char* m_data; /* internal text field, holds parsed text */ member in class:SvoxSsmlParser
|
/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::__anon2971 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::__anon2976 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/eigen/Eigen/src/Core/ |
H A D | DenseStorage.h | 123 internal::plain_array<T,Size,_Options> m_data; member in class:Eigen::DenseStorage 127 : m_data(internal::constructor_without_unaligned_array_assert()) {} 129 inline void swap(DenseStorage& other) { std::swap(m_data,other.m_data); } 134 inline const T *data() const { return m_data.array; } 135 inline T *data() { return m_data.array; } 167 internal::plain_array<T,Size,_Options> m_data; member in class:Eigen::DenseStorage 173 : m_data(internal::constructor_without_unaligned_array_assert()), m_rows(0), m_cols(0) {} 176 { std::swap(m_data,other.m_data); st 188 internal::plain_array<T,Size,_Options> m_data; member in class:Eigen::DenseStorage 207 internal::plain_array<T,Size,_Options> m_data; member in class:Eigen::DenseStorage 226 T *m_data; member in class:Eigen::DenseStorage 268 T *m_data; member in class:Eigen::DenseStorage 304 T *m_data; member in class:Eigen::DenseStorage [all...] |
H A D | MapBase.h | 88 inline const Scalar* data() const { return m_data; } 92 return m_data[colId * colStride() + rowId * rowStride()]; 98 return m_data[index * innerStride()]; 103 return this->m_data[colId * colStride() + rowId * rowStride()]; 109 return this->m_data[index * innerStride()]; 116 (m_data + (colId * colStride() + rowId * rowStride())); 123 return internal::ploadt<PacketScalar, LoadMode>(m_data + index * innerStride()); 126 inline MapBase(PointerType dataPtr) : m_data(dataPtr), m_rows(RowsAtCompileTime), m_cols(ColsAtCompileTime) 133 : m_data(dataPtr), 144 : m_data(dataPt 163 PointerType m_data; member in class:Eigen::MapBase [all...] |
/external/lldb/include/lldb/Symbol/ |
H A D | ObjectContainer.h | 60 m_data () 65 m_data.SetData (data_sp, data_offset, length); 166 /// ObjectContainer::m_data. If an object file parser does not 228 DataExtractor m_data; ///< The data for this object file so things can be parsed lazily. member in class:lldb_private::ObjectContainer
|
/external/lldb/test/api/multithreaded/ |
H A D | common.h | 28 std::queue<T> m_data; member in class:multithreaded_queue 35 m_data.push(e); 44 if (!m_data.empty()) { 46 T ret = m_data.front(); 47 m_data.pop();
|
/external/lldb/tools/debugserver/source/MacOSX/ |
H A D | MachVMRegion.h | 70 RegionInfo m_data; member in class:MachVMRegion 71 vm_prot_t m_curr_protection; // The current, possibly modified protections. Original value is saved in m_data.protections.
|
/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 int getSize (void) const { return (int)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 int getDataSize (void) const { return (int)m_data.size(); } 59 void setDataSize (int 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/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/eigen/Eigen/src/Core/util/ |
H A D | BlasUtil.h | 126 blas_data_mapper(Scalar* data, Index stride) : m_data(data), m_stride(stride) {} 128 { return m_data[StorageOrder==RowMajor ? j + i*m_stride : i + j*m_stride]; } 130 Scalar* EIGEN_RESTRICT m_data; member in class:Eigen::internal::blas_data_mapper 139 const_blas_data_mapper(const Scalar* data, Index stride) : m_data(data), m_stride(stride) {} 141 { return m_data[StorageOrder==RowMajor ? j + i*m_stride : i + j*m_stride]; } 143 const Scalar* EIGEN_RESTRICT m_data; member in class:Eigen::internal::const_blas_data_mapper
|
/external/lldb/source/Plugins/ObjectContainer/BSD-Archive/ |
H A D | ObjectContainerBSDArchive.h | 207 return m_data; 220 lldb_private::DataExtractor m_data; ///< The data for this object container so we don't lose data if the .a files gets modified member in class:ObjectContainerBSDArchive::Archive
|
/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/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...] |