/external/chromium_org/third_party/WebKit/Source/platform/heap/ |
Handle.cpp | 14 // m_next are 0. 15 if (!m_prev && !m_next) 18 m_prev->m_next = m_next; 21 *headPtr = m_next; 23 if (m_next) 24 m_next->m_prev = m_prev; 26 m_next = 0; 39 newHead->m_next = oldHead; 49 *headPtr = oldHead->m_next; [all...] |
HeapLinkedStack.h | 54 for (Node* current = m_head; current; current = current->m_next) 66 Member<Node> m_next; member in class:blink::HeapLinkedStack::Node 76 , m_next(next) 103 m_head = m_head->m_next;
|
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
NodeSequence.java | 50 protected int m_next = 0; field in class:NodeSequence 271 m_next=0; 283 m_next = 0; 318 if(m_next < vec.size()) 321 int next = vec.elementAt(m_next); 322 m_next++; 327 m_next++; 343 m_next++; 349 m_next++; 353 m_next++ [all...] |
/external/chromium_org/third_party/WebKit/Source/platform/text/ |
BidiRunList.h | 80 m_lastRun->m_next = run; 88 ASSERT(!run->m_next); 93 run->m_next = m_firstRun; 103 ASSERT(run->m_next); 115 current->m_next = run->m_next; 117 run->m_next = 0; 118 m_lastRun->m_next = run; 136 current->m_next = run->m_next; [all...] |
BidiCharacterRun.h | 33 , m_next(0) 66 BidiCharacterRun* next() const { return m_next; } 67 void setNext(BidiCharacterRun* next) { m_next = next; } 69 // Do not add anything apart from bitfields until after m_next. See https://bugs.webkit.org/show_bug.cgi?id=100173 73 BidiCharacterRun* m_next; member in struct:blink::BidiCharacterRun
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
LayoutState.cpp | 41 , m_next(0) 52 , m_next(renderer.view()->layoutState()) 62 m_layoutOffset = m_next->m_layoutOffset + offset; 82 m_pageLogicalHeight = m_next->m_pageLogicalHeight; 83 m_pageLogicalHeightChanged = m_next->m_pageLogicalHeightChanged; 84 m_pageOffset = m_next->m_pageOffset; 92 m_isPaginated = m_pageLogicalHeight || m_next->m_columnInfo || renderer.flowThreadContainingBlock(); 97 m_columnInfo = m_next->m_columnInfo; 107 , m_next(root.view()->layoutState()) 112 ASSERT(!m_next || root.isTableSection()) [all...] |
BidiRun.h | 46 BidiRun* next() { return static_cast<BidiRun*>(m_next); }
|
RenderQuote.cpp | 38 , m_next(nullptr) 48 ASSERT(!m_next && !m_previous); 53 visitor->trace(m_next); 311 ASSERT(!m_next && !m_previous); 326 m_next = m_previous->m_next; 327 m_previous->m_next = this; 328 if (m_next) 329 m_next->m_previous = this; 334 m_next = view()->renderQuoteHead() [all...] |
/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
ElemContext.java | 101 * that connections between the frames via m_next and m_prev 106 private ElemContext m_next; field in class:ElemContext 167 ElemContext frame = this.m_next; 174 this.m_next = frame; 201 ElemContext frame = this.m_next; 208 this.m_next = frame;
|
/external/chromium_org/third_party/WebKit/Source/platform/fonts/ |
FontFamily.h | 54 RefPtr<SharedFontFamily> m_next; member in class:blink::FontFamily 73 RefPtr<SharedFontFamily> reaper = m_next.release(); 80 return m_next.get(); 85 m_next = family; 90 return m_next.release();
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
NameSpace.java | 37 public NameSpace m_next = null; field in class:NameSpace
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
TreeNode.h | 55 : m_next(0) 63 NodeType* next() const { return m_next; } 70 bool orphan() const { return !m_parent && !m_next && !m_previous && !m_firstChild && !m_lastChild; } 88 newChild->m_next = refChild; 92 newPrevious->m_next = newChild; 111 ASSERT(!m_lastChild->m_next); 116 oldLast->m_next = child; 130 child->m_parent = child->m_next = child->m_previous = 0; 135 oldPrevious->m_next = oldNext; 151 NodeType* m_next; member in class:WTF::TreeNode [all...] |
LinkedHashSet.h | 54 LinkedHashSetNodeBase() : m_prev(this), m_next(this) { } 58 if (!m_next) 61 ASSERT(m_next->m_prev == this); 62 ASSERT(m_prev->m_next == this); 63 m_next->m_prev = m_prev; 64 m_prev->m_next = m_next; 74 other.m_next = this; 76 m_prev->m_next = &other; 78 ASSERT(other.m_next); 104 LinkedHashSetNodeBase* m_next; member in class:WTF::LinkedHashSetNodeBase [all...] |
LinkedStack.h | 62 OwnPtr<Node> m_next; member in class:WTF::LinkedStack::Node 73 , m_next(next) 100 m_head = m_head->m_next.release();
|
/external/opencv/cv/src/ |
_cvlist.h | 89 struct prefix##element_##type* m_next;\ 121 if(element->m_next != NULL)\ 123 element->m_next->m_prev = NULL;\ 124 l->m_head_free.m_pos = element->m_next;\ 152 element->m_next = ((element_type*)l->m_head_free.m_pos);\ 197 pos->m_pos = element->m_next;\ 234 element->m_next = (ELEMENT_##type*)(l->m_head.m_pos);\ 236 if(element->m_next)\ 238 element->m_next->m_prev = element;\ 251 element->m_next = NULL; [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/ |
NodeSetDTM.java | 285 m_next = 0; 388 if ((m_next) < this.size()) 390 int next = this.elementAt(m_next); 392 m_next++; 418 if ((m_next - 1) > 0) 420 m_next--; 422 return this.elementAt(m_next); 463 return (m_next == 0); 469 * m_next to the index. If the index argument is -1, this 485 if ((index >= 0) && (m_next < m_firstFree) 1103 transient protected int m_next = 0; field in class:NodeSetDTM [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
FillLayer.cpp | 30 FillLayer* m_next; member in struct:blink::SameSizeAsFillLayer 46 : m_next(0) 80 : m_next(o.m_next ? new FillLayer(*o.m_next) : 0) 115 delete m_next; 120 if (m_next != o.m_next) { 121 delete m_next; 122 m_next = o.m_next ? new FillLayer(*o.m_next) : 0 [all...] |
FillLayer.h | 85 const FillLayer* next() const { return m_next; } 86 FillLayer* next() { return m_next; } 89 if (!m_next) 90 m_next = new FillLayer(type()); 91 return m_next; 164 return m_next ? m_next->hasImage() : false; 171 return m_next ? m_next->hasFixedImage() : false; 205 FillLayer* m_next; member in class:blink::FillLayer [all...] |
/external/emma/core/java12/com/vladium/util/ |
IntObjectMap.java | 91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 136 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) 165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 228 m_next = next; 234 Entry m_next; // singly-linked list link field in class:IntObjectMap.Entry 258 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry 265 entry.m_next = bucketListHead;
|
IntSet.java | 89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) 127 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) 146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 201 m_next = next; 206 Entry m_next; // singly-linked list link field in class:IntSet.Entry 230 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry 237 entry.m_next = bucketListHead;
|
IntIntMap.java | 91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 153 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) 179 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 224 final Entry next = entry.m_next; 231 prev.m_next = next; 270 m_next = next; 276 Entry m_next; // singly-linked list link field in class:IntIntMap.Entry 300 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entr [all...] |
SoftValueMap.java | 169 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 238 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) 307 for (SoftEntry entry = buckets [bucketIndex], prev = null; entry != null; prev = entry, entry = entry.m_next) 315 buckets [bucketIndex] = entry.m_next; 319 prev.m_next = entry.m_next; 331 entry.m_next = null; 351 final SoftEntry next = entry.m_next; // remember next pointer because we are going to reuse this entry 358 entry.m_next = null; 454 m_next = next 460 SoftEntry m_next; \/\/ singly-linked list link field in class:SoftValueMap.SoftEntry [all...] |
/external/apache-xml/src/main/java/org/apache/xalan/templates/ |
TemplateSubPatternAssociation.java | 50 private TemplateSubPatternAssociation m_next = null; field in class:TemplateSubPatternAssociation 87 tspa.m_next = null; 233 return m_next; 247 m_next = mp;
|
/external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
HTMLInputStream.h | 134 m_inputStream->splitInto(m_next); 145 m_inputStream->mergeFrom(m_next); 152 SegmentedString m_next; member in class:blink::InsertionPointRecord
|
/external/chromium_org/third_party/usrsctp/usrsctplib/ |
user_mbuf.c | 87 m->m_next = NULL; 192 struct mbuf *n = m->m_next; 452 m->m_next = NULL; 594 for(; m; m=m->m_next) { 595 SCTP_DEBUG_USR(SCTP_DEBUG_USR, "%p: m_len = %ld, m_type = %x, m_next = %p.\n", (void *)m, m->m_len, m->m_type, (void *)m->m_next); 719 n->m_data + len < &n->m_dat[MLEN] && n->m_next) { 723 n = n->m_next; 753 m->m_next = n; 818 for (t = m; t; t = t->m_next) [all...] |