| /external/webkit/Source/WebCore/rendering/style/ |
| CursorList.h | 41 const CursorData& operator[](int i) const { return m_vector[i]; }
42 CursorData& operator[](int i) { return m_vector[i]; }
43 const CursorData& at(size_t i) const { return m_vector.at(i); }
44 CursorData& at(size_t i) { return m_vector.at(i); }
46 bool operator==(const CursorList& o) const { return m_vector == o.m_vector; }
47 bool operator!=(const CursorList& o) const { return m_vector != o.m_vector; }
49 size_t size() const { return m_vector.size(); }
50 void append(const CursorData& cursorData) { m_vector.append(cursorData);
57 Vector<CursorData> m_vector; member in class:WebCore::CursorList
[all...] |
| /external/webkit/Source/JavaScriptCore/runtime/ |
| StructureChain.cpp | 44 m_vector = adoptArrayPtr(new WriteBarrier<Structure>[size + 1]);
48 m_vector[i++].set(globalData, this, current);
49 m_vector[i].clear();
59 while (m_vector[i])
60 markStack.append(&m_vector[i++]);
|
| ArgList.cpp | 68 if (m_vector.size() < m_vector.capacity()) {
69 m_vector.uncheckedAppend(v);
75 m_vector.reserveCapacity(m_vector.capacity() * 4);
77 m_vector.uncheckedAppend(v);
78 m_buffer = m_vector.data();
|
| StructureChain.h | 46 WriteBarrier<Structure>* head() { return m_vector.get(); }
54 OwnArrayPtr<WriteBarrier<Structure> > m_vector; member in class:JSC::StructureChain
|
| ArgList.h | 54 m_buffer = m_vector.data();
100 m_vector.clear();
114 m_vector.uncheckedAppend(v);
129 m_vector.removeLast();
153 VectorType m_vector; member in class:JSC::MarkedArgumentBuffer
|
| JSArray.cpp | 183 WriteBarrier<Unknown>* vector = m_storage->m_vector;
222 WriteBarrier<Unknown>* vector = m_storage->m_vector;
254 JSValue value = storage->m_vector[i].get();
302 WriteBarrier<Unknown>& value = storage->m_vector[i];
356 WriteBarrier<Unknown>& valueSlot = storage->m_vector[i];
412 storage->m_vector[i].set(exec->globalData(), this, value);
454 WriteBarrier<Unknown>* vector = storage->m_vector;
474 storage->m_vector[i].set(exec->globalData(), this, value);
501 WriteBarrier<Unknown>& valueSlot = storage->m_vector[i];
541 if (storage->m_vector[i]
[all...] |
| JSArray.h | 33 // struct by pointing to m_vector. To access the contained ArrayStorage struct, use the getStorage() and
47 WriteBarrier<Unknown> m_vector[1]; member in struct:JSC::ArrayStorage
91 bool canGetIndex(unsigned i) { return i < m_vectorLength && m_storage->m_vector[i]; }
95 return m_storage->m_vector[i].get();
103 WriteBarrier<Unknown>& x = m_storage->m_vector[i];
120 storage->m_vector[i].set(globalData, this, v);
167 unsigned m_vectorLength; // The valid length of m_vector
195 markStack.appendValues(storage->m_vector, usedVectorLength, MayContainNullValues);
|
| /external/webkit/Source/WebCore/dom/ |
| SpaceSplitString.cpp | 49 ASSERT(m_vector.isEmpty());
66 m_vector.append(AtomicString(characters + start, end - start));
79 size_t thisSize = m_vector.size();
80 size_t otherSize = other.m_vector.size();
82 const AtomicString& name = other.m_vector[i];
85 if (m_vector[j] == name)
99 m_vector.append(string);
107 while (position < m_vector.size()) {
108 if (m_vector[position] == string)
109 m_vector.remove(position)
[all...] |
| SpaceSplitString.h | 42 size_t size = m_vector.size();
44 if (m_vector[i] == string)
55 size_t size() { ensureVector(); return m_vector.size(); }
56 const AtomicString& operator[](size_t i) { ensureVector(); ASSERT(i < size()); return m_vector[i]; }
64 StringVector m_vector;
|
| /external/webkit/Source/JavaScriptCore/wtf/text/ |
| CString.h | 37 const char* data() { return m_vector.data(); }
38 size_t length() { return m_vector.size(); }
44 CStringBuffer(size_t length) : m_vector(length) { }
45 char* mutableData() { return m_vector.data(); }
47 Vector<char> m_vector; member in class:WTF::CStringBuffer
|
| /external/webkit/Source/JavaScriptCore/wtf/ |
| SegmentedVector.h | 46 T& operator*() const { return m_vector.m_segments.at(m_segment)->at(m_index); }
47 T* operator->() const { return &m_vector.m_segments.at(m_segment)->at(m_index); }
54 if (m_index >= m_vector.m_segments.at(m_segment)->size()) {
55 if (m_segment + 1 < m_vector.m_segments.size()) {
56 ASSERT(m_vector.m_segments.at(m_segment)->size() > 0);
70 return (m_index == other.m_index && m_segment = other.m_segment && &m_vector == &other.m_vector);
75 return (m_index != other.m_index || m_segment != other.m_segment || &m_vector != &other.m_vector);
80 m_vector = other.m_vector
94 SegmentedVector<T, SegmentSize>& m_vector; member in class:WTF::SegmentedVectorIterator
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| AmbiVector.h | 292 : m_vector(vec)
295 m_isDense = m_vector.m_mode==IsDense;
300 m_cachedIndex = m_vector.m_start-1;
305 ListEl* EIGEN_RESTRICT llElements = reinterpret_cast<ListEl*>(m_vector.m_buffer);
306 m_currentEl = m_vector.m_llStart;
333 } while (m_cachedIndex<m_vector.m_end && internal::abs(m_vector.m_buffer[m_cachedIndex])<m_epsilon);
334 if (m_cachedIndex<m_vector.m_end)
335 m_cachedValue = m_vector.m_buffer[m_cachedIndex];
341 ListEl* EIGEN_RESTRICT llElements = reinterpret_cast<ListEl*>(m_vector.m_buffer)
[all...] |
| /external/webkit/Source/JavaScriptCore/dfg/ |
| DFGSpeculativeJIT.cpp | 566 // Check that base is an array, and that property is contained within m_vector (< m_vectorLength).
574 m_jit.loadPtr(MacroAssembler::BaseIndex(storageReg, propertyReg, MacroAssembler::ScalePtr, OBJECT_OFFSETOF(ArrayStorage, m_vector[0])), result.registerID());
593 // Check that base is an array, and that property is contained within m_vector (< m_vectorLength).
601 MacroAssembler::Jump notHoleValue = m_jit.branchTestPtr(MacroAssembler::NonZero, MacroAssembler::BaseIndex(storageReg, propertyReg, MacroAssembler::ScalePtr, OBJECT_OFFSETOF(ArrayStorage, m_vector[0])));
614 m_jit.storePtr(valueReg, MacroAssembler::BaseIndex(storageReg, propertyReg, MacroAssembler::ScalePtr, OBJECT_OFFSETOF(ArrayStorage, m_vector[0])));
635 m_jit.storePtr(valueReg, MacroAssembler::BaseIndex(storageReg, propertyReg, MacroAssembler::ScalePtr, OBJECT_OFFSETOF(ArrayStorage, m_vector[0])));
|
| /external/webkit/Source/JavaScriptCore/jit/ |
| JITPropertyAccess32_64.cpp | 317 load32(BaseIndex(regT3, regT2, TimesEight, OBJECT_OFFSETOF(ArrayStorage, m_vector[0]) + OBJECT_OFFSETOF(JSValue, u.asBits.tag)), regT1); // tag
318 load32(BaseIndex(regT3, regT2, TimesEight, OBJECT_OFFSETOF(ArrayStorage, m_vector[0]) + OBJECT_OFFSETOF(JSValue, u.asBits.payload)), regT0); // payload
369 Jump empty = branch32(Equal, BaseIndex(regT3, regT2, TimesEight, OBJECT_OFFSETOF(ArrayStorage, m_vector[0]) + OBJECT_OFFSETOF(JSValue, u.asBits.tag)), TrustedImm32(JSValue::EmptyValueTag));
373 store32(regT0, BaseIndex(regT3, regT2, TimesEight, OBJECT_OFFSETOF(ArrayStorage, m_vector[0]) + OBJECT_OFFSETOF(JSValue, u.asBits.payload))); // payload
374 store32(regT1, BaseIndex(regT3, regT2, TimesEight, OBJECT_OFFSETOF(ArrayStorage, m_vector[0]) + OBJECT_OFFSETOF(JSValue, u.asBits.tag))); // tag
[all...] |
| JITPropertyAccess.cpp | 107 loadPtr(BaseIndex(regT2, regT1, ScalePtr, OBJECT_OFFSETOF(ArrayStorage, m_vector[0])), regT0);
204 Jump empty = branchTestPtr(Zero, BaseIndex(regT2, regT1, ScalePtr, OBJECT_OFFSETOF(ArrayStorage, m_vector[0])));
208 storePtr(regT0, BaseIndex(regT2, regT1, ScalePtr, OBJECT_OFFSETOF(ArrayStorage, m_vector[0])));
[all...] |
| JITOpcodes.cpp | [all...] |
| JITOpcodes32_64.cpp | [all...] |
