Searched refs:m_data (Results 1 - 25 of 267) sorted by relevance

1234567891011

/external/chromium_org/third_party/WebKit/Source/core/rendering/style/
H A DDataRef.h33 const T* get() const { return m_data.get(); }
40 if (!m_data->hasOneRef())
41 m_data = m_data->copy();
42 return m_data.get();
47 ASSERT(!m_data);
48 m_data = T::create();
53 ASSERT(m_data);
54 ASSERT(o.m_data);
55 return m_data
66 RefPtr<T> m_data; member in class:blink::DataRef
[all...]
H A DNinePieceImage.h66 bool operator==(const NinePieceImage& other) const { return m_data == other.m_data; }
67 bool operator!=(const NinePieceImage& other) const { return m_data != other.m_data; }
69 bool hasImage() const { return m_data->image; }
70 StyleImage* image() const { return m_data->image.get(); }
71 void setImage(PassRefPtr<StyleImage> image) { m_data.access()->image = image; }
73 const LengthBox& imageSlices() const { return m_data->imageSlices; }
74 void setImageSlices(const LengthBox& slices) { m_data.access()->imageSlices = slices; }
76 bool fill() const { return m_data
128 DataRef<NinePieceImageData> m_data; member in class:blink::NinePieceImage
[all...]
/external/lldb/source/Core/
H A DScalar.cpp79 m_data()
88 m_data(rhs.m_data) // TODO: verify that for C++ this will correctly copy the union??
94 // m_data()
101 // case 1: m_type = e_uint; m_data.uint = reg.value.uint8; break;
102 // case 2: m_type = e_uint; m_data.uint = reg.value.uint16; break;
103 // case 4: m_type = e_uint; m_data.uint = reg.value.uint32; break;
104 // case 8: m_type = e_ulonglong; m_data.ulonglong = reg.value.uint64; break;
112 // case 1: m_type = e_sint; m_data.sint = reg.value.sint8; break;
113 // case 2: m_type = e_sint; m_data
[all...]
H A DDataBufferHeap.cpp18 m_data()
27 m_data()
29 if (n < m_data.max_size())
30 m_data.assign (n, ch);
38 m_data()
58 if (m_data.empty())
60 return &m_data[0];
70 if (m_data.empty())
72 return &m_data[0];
81 return m_data
[all...]
H A DRegisterValue.cpp217 m_data.buffer.byte_order = src_byte_order;
220 m_data.buffer.length = src_len;
242 switch (m_data.buffer.length)
245 case 1: scalar = m_data.uint8; return true;
246 case 2: scalar = m_data.uint16; return true;
247 case 4: scalar = m_data.uint32; return true;
248 case 8: scalar = m_data.uint64; return true;
251 case eTypeUInt8: scalar = m_data.uint8; return true;
252 case eTypeUInt16: scalar = m_data.uint16; return true;
253 case eTypeUInt32: scalar = m_data
[all...]
H A DOpcode.cpp38 bytes_written = s->Printf ("0x%2.2x", m_data.inst8);
41 bytes_written = s->Printf ("0x%4.4x", m_data.inst16);
45 bytes_written = s->Printf ("0x%8.8x", m_data.inst32);
49 bytes_written = s->Printf ("0x%16.16" PRIx64, m_data.inst64);
54 for (uint32_t i=0; i<m_data.inst.length; ++i)
58 bytes_written += s->Printf ("%2.2x", m_data.inst.bytes[i]);
101 case Opcode::eType8: buffer_sp.reset (new DataBufferHeap (&m_data.inst8, byte_size)); break;
102 case Opcode::eType16: buffer_sp.reset (new DataBufferHeap (&m_data.inst16, byte_size)); break;
107 buf[0] = m_data.inst.bytes[2];
108 buf[1] = m_data
[all...]
/external/chromium_org/third_party/WebKit/Source/core/svg/
H A DSVGPathByteStream.h45 return adoptPtr(new SVGPathByteStream(m_data));
51 DataIterator begin() const { return m_data.begin(); }
52 DataIterator end() const { return m_data.end(); }
53 void append(unsigned char byte) { m_data.append(byte); }
54 void append(SVGPathByteStream* other) { m_data.appendVector(other->m_data); }
55 void clear() { m_data.clear(); }
56 void reserveInitialCapacity(size_t size) { m_data.reserveInitialCapacity(size); }
57 void shrinkToFit() { m_data.shrinkToFit(); }
58 bool isEmpty() const { return m_data
68 Data m_data; member in class:blink::SVGPathByteStream
[all...]
/external/chromium_org/third_party/WebKit/Source/core/css/
H A DMediaValuesCached.cpp50 m_data.viewportWidth = calculateViewportWidth(frame);
51 m_data.viewportHeight = calculateViewportHeight(frame);
52 m_data.deviceWidth = calculateDeviceWidth(frame);
53 m_data.deviceHeight = calculateDeviceHeight(frame);
54 m_data.devicePixelRatio = calculateDevicePixelRatio(frame);
55 m_data.colorBitsPerComponent = calculateColorBitsPerComponent(frame);
56 m_data.monochromeBitsPerComponent = calculateMonochromeBitsPerComponent(frame);
57 m_data.primaryPointerType = calculatePrimaryPointerType(frame);
58 m_data.availablePointerTypes = calculateAvailablePointerTypes(frame);
59 m_data
[all...]
/external/chromium_org/third_party/WebKit/Source/wtf/text/
H A DStringBuffer.h47 m_data = StringImpl::createUninitialized(length, characters);
56 unsigned length() const { return m_data ? m_data->length() : 0; }
57 CharType* characters() { return length() ? const_cast<CharType*>(m_data->getCharacters<CharType>()) : 0; }
61 PassRefPtr<StringImpl> release() { return m_data.release(); }
64 RefPtr<StringImpl> m_data;
70 ASSERT(m_data);
71 if (m_data->length() == newLength)
73 m_data->truncateAssumingIsolated(newLength);
H A DStringUTF8Adaptor.h51 : m_data(0)
61 m_data = reinterpret_cast<const char*>(string.characters8());
68 m_data = m_utf8Buffer.data();
73 const char* data() const { return m_data; }
78 const char* m_data; member in class:WTF::StringUTF8Adaptor
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DSpaceSplitString.h35 bool operator!=(const SpaceSplitString& other) const { return m_data != other.m_data; }
38 void clear() { m_data.clear(); }
40 bool contains(const AtomicString& string) const { return m_data && m_data->contains(string); }
41 bool containsAll(const SpaceSplitString& names) const { return !names.m_data || (m_data && m_data->containsAll(*names.m_data)); }
45 size_t size() const { return m_data
[all...]
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DArrayBufferContents.cpp38 : m_data(0)
43 : m_data(0)
51 m_data = 0;
55 allocateMemory(numElements * elementByteSize, policy, m_data);
61 : m_data(data)
65 if (!m_data) {
68 // Allow null data if size is 0 bytes, make sure m_data is valid pointer.
70 allocateMemory(0, ZeroInitialize, m_data);
76 freeMemory(m_data, m_sizeInBytes);
82 if (m_data
[all...]
H A DBitArray.h39 memset(m_data, value ? 0xFF : 0, sizeof(m_data));
45 m_data[index / 8] |= 1 << (index & 7);
51 m_data[index / 8] &= ~(1 << (index & 7));
57 return !!(m_data[index / 8] & (1 << (index & 7)));
61 unsigned char m_data[arraySize / 8 + 1];
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/utils/ui/
H A DGridDataFactory.java104 private final GridData m_data; field in class:GridDataFactory
115 m_data = gridData;
116 if (m_control.getLayoutData() != m_data) {
117 m_control.setLayoutData(m_data);
160 m_data.horizontalSpan = hSpan;
161 m_data.verticalSpan = vSpan;
173 m_data.horizontalSpan = hSpan;
185 m_data.verticalSpan = vSpan;
205 m_data.widthHint = xHint;
206 m_data
[all...]
/external/lldb/tools/debugserver/source/MacOSX/
H A DMachVMRegion.cpp30 memset(&m_data, 0, sizeof(m_data));
48 memset(&m_data, 0, sizeof(m_data));
104 if (m_curr_protection != m_data.protection && m_protection_size > 0)
106 m_err = ::mach_vm_protect (m_task, m_protection_addr, m_protection_size, 0, m_data.protection);
108 m_err.LogThreaded("::mach_vm_protect ( task = 0x%4.4x, addr = 0x%8.8llx, size = %llu, set_max = %i, prot = %u )", m_task, (uint64_t)m_protection_addr, (uint64_t)m_protection_size, 0, m_data.protection);
113 m_curr_protection = m_data.protection;
137 m_err = ::mach_vm_region_recurse (m_task, &m_start, &m_size, &m_depth, (vm_region_recurse_info_t)&m_data, &info_size);
143 m_err.LogThreaded("::mach_vm_region_recurse ( task = 0x%4.4x, address => 0x%8.8llx, size => %llu, nesting_depth => %d, info => %p, infoCnt => %d) addr = 0x%8.8llx ", m_task, (uint64_t)m_start, (uint64_t)m_size, m_depth, &m_data, info_siz
[all...]
/external/eigen/Eigen/src/Core/
H A DDenseStorage.h123 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...]
/external/chromium_org/third_party/WebKit/Source/core/xml/
H A DXPathValue.cpp48 visitor->trace(m_data);
56 if (!m_data) {
61 return m_data->nodeSet();
69 if (!m_data)
70 m_data = ValueData::create();
73 return m_data->nodeSet();
80 return !m_data->nodeSet().isEmpty();
86 return !m_data->m_string.isEmpty();
100 const String& str = m_data->m_string.simplifyWhiteSpace();
128 if (m_data
[all...]
/external/lldb/include/lldb/Core/
H A DOpcode.h48 m_data.inst8 = inst;
53 m_data.inst16 = inst;
58 m_data.inst32 = inst;
63 m_data.inst64 = inst;
88 case Opcode::eType8: return m_data.inst8;
105 case Opcode::eType8: return m_data.inst8;
106 case Opcode::eType16: return m_data.inst16;
121 case Opcode::eType8: return m_data.inst8;
122 case Opcode::eType16: return m_data.inst16;
124 case Opcode::eType32: return m_data
[all...]
H A DBaton.h37 m_data (p)
51 void *m_data; // Leave baton public for easy access member in class:lldb_private::Baton
/external/eigen/unsupported/Eigen/src/Skyline/
H A DSkylineMatrix.h70 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...]
/external/chromium_org/third_party/WebKit/Source/platform/
H A DPlatformGestureEvent.h43 memset(&m_data, 0, sizeof(m_data));
52 memset(&m_data, 0, sizeof(m_data));
57 m_data.m_scrollUpdate.m_deltaX = deltaX;
58 m_data.m_scrollUpdate.m_deltaY = deltaY;
59 m_data.m_scrollUpdate.m_velocityX = velocityX;
60 m_data.m_scrollUpdate.m_velocityY = velocityY;
73 return m_data.m_scrollUpdate.m_deltaX;
80 return m_data
166 } m_data; member in class:blink::PlatformGestureEvent
[all...]
/external/deqp/executor/
H A DxeBatchResult.hpp58 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...]
/external/deqp/framework/common/
H A DtcuVector.hpp87 m_vector.m_data[m_index[i]] = v.m_data[i];
102 T m_data[Size]; member in class:tcu::Vector
114 const T* getPtr (void) const { return &m_data[0]; }
115 T* getPtr (void) { return &m_data[0]; }
118 T x (void) const { return m_data[0]; }
119 T y (void) const { DE_STATIC_ASSERT(Size >= 2); return m_data[1]; }
120 T z (void) const { DE_STATIC_ASSERT(Size >= 3); return m_data[2]; }
121 T w (void) const { DE_STATIC_ASSERT(Size >= 4); return m_data[3]; }
124 T& x (void) { return m_data[
[all...]
/external/eigen/Eigen/src/SparseCore/
H A DSparseVector.h87 EIGEN_STRONG_INLINE const Scalar* valuePtr() const { return &m_data.value(0); }
88 EIGEN_STRONG_INLINE Scalar* valuePtr() { return &m_data.value(0); }
90 EIGEN_STRONG_INLINE const Index* innerIndexPtr() const { return &m_data.index(0); }
91 EIGEN_STRONG_INLINE Index* innerIndexPtr() { return &m_data.index(0); }
94 inline Storage& data() { return m_data; }
96 inline const Storage& data() const { return m_data; }
106 return m_data.at(i);
124 return m_data.atWithInsertion(i);
132 inline void setZero() { m_data.clear(); }
135 inline Index nonZeros() const { return static_cast<Index>(m_data
343 Storage m_data; member in class:Eigen::SparseVector
374 const internal::CompressedStorage<Scalar,Index>& m_data; member in class:Eigen::SparseVector::InnerIterator
406 const internal::CompressedStorage<Scalar,Index>& m_data; member in class:Eigen::SparseVector::ReverseInnerIterator
[all...]
/external/chromium_org/third_party/WebKit/Source/core/xml/parser/
H A DXMLParserInput.h43 , m_data(0)
54 m_data = reinterpret_cast<const char*>(m_source.characters8());
58 m_data = reinterpret_cast<const char*>(m_source.characters16());
64 const char* data() const { return m_data; }
70 const char* m_data; member in class:blink::XMLParserInput

Completed in 8576 milliseconds

1234567891011