/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
D | RenderQuote.cpp | 38 , m_next(0) in RenderQuote() 48 ASSERT(!m_next && !m_previous); in ~RenderQuote() 304 ASSERT(!m_next && !m_previous); in attachQuote() 319 m_next = m_previous->m_next; in attachQuote() 320 m_previous->m_next = this; in attachQuote() 321 if (m_next) in attachQuote() 322 m_next->m_previous = this; in attachQuote() 327 m_next = view()->renderQuoteHead(); in attachQuote() 329 if (m_next) in attachQuote() 330 m_next->m_previous = this; in attachQuote() [all …]
|
D | LayoutState.cpp | 46 , m_next(0) in LayoutState() 56 , m_next(renderer.view()->layoutState()) in LayoutState() 60 …m_cachedOffsetsEnabled = m_next->m_cachedOffsetsEnabled && renderer.supportsLayoutStateCachedOffse… in LayoutState() 67 m_paintOffset = m_next->m_paintOffset + offset; in LayoutState() 82 m_clipped = !fixed && m_next->m_clipped; in LayoutState() 84 m_clipRect = m_next->m_clipRect; in LayoutState() 111 m_pageLogicalHeight = m_next->m_pageLogicalHeight; in LayoutState() 112 m_pageLogicalHeightChanged = m_next->m_pageLogicalHeightChanged; in LayoutState() 113 m_pageOffset = m_next->m_pageOffset; in LayoutState() 121 …m_isPaginated = m_pageLogicalHeight || m_next->m_columnInfo || renderer.flowThreadContainingBlock(… in LayoutState() [all …]
|
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
D | NodeSequence.java | 50 protected int m_next = 0; field in NodeSequence 271 m_next=0; in setRoot() 283 m_next = 0; in reset() 318 if(m_next < vec.size()) in nextNode() 321 int next = vec.elementAt(m_next); in nextNode() 322 m_next++; in nextNode() 327 m_next++; in nextNode() 343 m_next++; in nextNode() 349 m_next++; in nextNode() 353 m_next++; in nextNode() [all …]
|
/external/opencv/cv/src/ |
D | _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/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
D | FillLayer.cpp | 30 FillLayer* m_next; member 46 : m_next(0) in FillLayer() 80 : m_next(o.m_next ? new FillLayer(*o.m_next) : 0) in FillLayer() 115 delete m_next; in ~FillLayer() 120 if (m_next != o.m_next) { in operator =() 121 delete m_next; in operator =() 122 m_next = o.m_next ? new FillLayer(*o.m_next) : 0; in operator =() 170 && ((m_next && o.m_next) ? *m_next == *o.m_next : m_next == o.m_next); in operator ==() 300 next = p->m_next; in cullEmptyLayers() 303 p->m_next = 0; in cullEmptyLayers() [all …]
|
D | FillLayer.h | 85 const FillLayer* next() const { return m_next; } in next() 86 FillLayer* next() { return m_next; } in next() 142 void setNext(FillLayer* n) { if (m_next != n) { delete m_next; m_next = n; } } in setNext() local 160 return m_next ? m_next->hasImage() : false; in hasImage() 167 return m_next ? m_next->hasFixedImage() : false; in hasFixedImage() 201 FillLayer* m_next; variable
|
/external/chromium_org/third_party/usrsctp/usrsctplib/ |
D | user_mbuf.c | 87 m->m_next = NULL; in mbuf_constructor_dup() 192 struct mbuf *n = m->m_next; in m_free() 452 m->m_next = NULL; in mb_ctor_mbuf() 594 for(; m; m=m->m_next) { 595 …"%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) { in m_pullup() 723 n = n->m_next; in m_pullup() 753 m->m_next = n; in m_pullup() 818 for (t = m; t; t = t->m_next) in m_pulldown() 828 n = n->m_next; in m_pulldown() [all …]
|
/external/apache-xml/src/main/java/org/apache/xpath/ |
D | NodeSetDTM.java | 285 m_next = 0; in reset() 388 if ((m_next) < this.size()) in nextNode() 390 int next = this.elementAt(m_next); in nextNode() 392 m_next++; in nextNode() 418 if ((m_next - 1) > 0) in previousNode() 420 m_next--; in previousNode() 422 return this.elementAt(m_next); in previousNode() 463 return (m_next == 0); in isFresh() 485 if ((index >= 0) && (m_next < m_firstFree)) in runTo() 486 m_next = index; in runTo() [all …]
|
D | NodeSet.java | 172 m_next = 0; in reset() 244 if ((m_next) < this.size()) in nextNode() 246 Node next = this.elementAt(m_next); in nextNode() 248 m_next++; in nextNode() 274 if ((m_next - 1) > 0) in previousNode() 276 m_next--; in previousNode() 278 return this.elementAt(m_next); in previousNode() 307 return (m_next == 0); in isFresh() 329 if ((index >= 0) && (m_next < m_firstFree)) in runTo() 330 m_next = index; in runTo() [all …]
|
/external/chromium_org/third_party/WebKit/Source/platform/text/ |
D | BidiRunList.h | 80 m_lastRun->m_next = run; in addRun() 88 ASSERT(!run->m_next); in prependRun() 93 run->m_next = m_firstRun; in prependRun() 103 ASSERT(run->m_next); in moveRunToEnd() 115 current->m_next = run->m_next; in moveRunToEnd() 117 run->m_next = 0; in moveRunToEnd() 118 m_lastRun->m_next = run; in moveRunToEnd() 136 current->m_next = run->m_next; in moveRunToBeginning() 140 run->m_next = m_firstRun; in moveRunToBeginning() 234 curr->m_next = newNext; in reverseRuns() [all …]
|
D | BidiCharacterRun.h | 33 , m_next(0) in BidiCharacterRun() 66 BidiCharacterRun* next() const { return m_next; } in next() 67 void setNext(BidiCharacterRun* next) { m_next = next; } in setNext() 73 BidiCharacterRun* m_next; member
|
/external/emma/core/java12/com/vladium/util/ |
D | SoftValueMap.java | 169 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get() 238 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put() 307 …ntry entry = buckets [bucketIndex], prev = null; entry != null; prev = entry, entry = entry.m_next) in remove() 315 buckets [bucketIndex] = entry.m_next; in remove() 319 prev.m_next = entry.m_next; in remove() 331 entry.m_next = null; in remove() 351 …final SoftEntry next = entry.m_next; // remember next pointer because we are going to reuse this e… in clear() 358 entry.m_next = null; in clear() 454 m_next = next; in SoftEntry() 460 SoftEntry m_next; // singly-linked list link field in SoftValueMap.SoftEntry [all …]
|
D | IntIntMap.java | 91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains() 115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get() 134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get() 153 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys() 179 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put() 224 final Entry next = entry.m_next; in remove() 231 prev.m_next = next; in remove() 270 m_next = next; in Entry() 276 Entry m_next; // singly-linked list link field in IntIntMap.Entry 300 … final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry in rehash() [all …]
|
D | ObjectIntMap.java | 96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains() 124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get() 143 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys() 172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put() 220 final Entry next = entry.m_next; in remove() 227 prev.m_next = next; in remove() 266 m_next = next; in Entry() 272 Entry m_next; // singly-linked list link field in ObjectIntMap.Entry 296 … final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry in rehash() 303 entry.m_next = bucketListHead; in rehash()
|
D | IntSet.java | 89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains() 109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in values() 127 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in values() 146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in add() 201 m_next = next; in Entry() 206 Entry m_next; // singly-linked list link field in IntSet.Entry 230 … final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry in rehash() 237 entry.m_next = bucketListHead; in rehash()
|
D | IntObjectMap.java | 91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains() 116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get() 136 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys() 165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put() 228 m_next = next; in Entry() 234 Entry m_next; // singly-linked list link field in IntObjectMap.Entry 258 … final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry in rehash() 265 entry.m_next = bucketListHead; in rehash()
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
D | TreeNode.h | 55 : m_next(0) in TreeNode() 63 NodeType* next() const { return m_next; } in next() 70 …bool orphan() const { return !m_parent && !m_next && !m_previous && !m_firstChild && !m_lastChild;… in orphan() 88 newChild->m_next = refChild; in insertBefore() 92 newPrevious->m_next = newChild; in insertBefore() 111 ASSERT(!m_lastChild->m_next); in appendChild() 116 oldLast->m_next = child; in appendChild() 130 child->m_parent = child->m_next = child->m_previous = 0; in removeChild() 135 oldPrevious->m_next = oldNext; in removeChild() 151 NodeType* m_next;
|
D | LinkedHashSet.h | 54 LinkedHashSetNodeBase() : m_prev(this), m_next(this) { } in LinkedHashSetNodeBase() 58 if (!m_next) in unlink() 61 ASSERT(m_next->m_prev == this); in unlink() 62 ASSERT(m_prev->m_next == this); in unlink() 63 m_next->m_prev = m_prev; in unlink() 64 m_prev->m_next = m_next; in unlink() 74 other.m_next = this; in insertBefore() 76 m_prev->m_next = &other; in insertBefore() 78 ASSERT(other.m_next); in insertBefore() 80 ASSERT(m_next); in insertBefore() [all …]
|
/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
D | ElemContext.java | 106 private ElemContext m_next; field in ElemContext 167 ElemContext frame = this.m_next; in push() 174 this.m_next = frame; in push() 201 ElemContext frame = this.m_next; in push() 208 this.m_next = frame; in push()
|
/external/chromium_org/third_party/WebKit/Source/platform/fonts/ |
D | FontFamily.h | 54 RefPtr<SharedFontFamily> m_next; variable 73 RefPtr<SharedFontFamily> reaper = m_next.release(); in ~FontFamily() 80 return m_next.get(); in next() 85 m_next = family; in appendFamily() 90 return m_next.release(); in releaseNext()
|
/external/qemu/slirp-android/ |
D | mbuf.c | 34 m_freelist.m_next = m_freelist.m_prev = &m_freelist; in m_init() 35 m_usedlist.m_next = m_usedlist.m_prev = &m_usedlist; in m_init() 54 if (m_freelist.m_next == &m_freelist) { in m_get() 63 m = m_freelist.m_next; in m_get() 214 for (m = m_usedlist.m_next; m != &m_usedlist; m = m->m_next) { in dtom()
|
/external/qemu/slirp/ |
D | mbuf.c | 34 m_freelist.m_next = m_freelist.m_prev = &m_freelist; in m_init() 35 m_usedlist.m_next = m_usedlist.m_prev = &m_usedlist; in m_init() 54 if (m_freelist.m_next == &m_freelist) { in m_get() 63 m = m_freelist.m_next; in m_get() 214 for (m = m_usedlist.m_next; m != &m_usedlist; m = m->m_next) { in dtom()
|
/external/apache-xml/src/main/java/org/apache/xalan/templates/ |
D | RedundentExprEliminator.java | 173 next = next.m_next; in eleminateSharedPartialPaths() 218 matchedPathsTail.m_next = null; in matchAndEliminatePartialPaths() 223 matchedPathsTail.m_next = (MultistepExprHolder)meh.clone(); in matchAndEliminatePartialPaths() 227 matchedPathsTail = matchedPathsTail.m_next; in matchAndEliminatePartialPaths() 228 matchedPathsTail.m_next = null; in matchAndEliminatePartialPaths() 231 meh = meh.m_next; in matchAndEliminatePartialPaths() 255 matchedPaths = matchedPaths.m_next; in matchAndEliminatePartialPaths() 317 next = next.m_next; in findCommonAncestor() 390 next = next.m_next; in isNotSameAsOwner() 629 tail.m_next = new MultistepExprHolder(owner2, stepCount, null); in findAndEliminateRedundant() [all …]
|
D | TemplateSubPatternAssociation.java | 50 private TemplateSubPatternAssociation m_next = null; field in TemplateSubPatternAssociation 87 tspa.m_next = null; in clone() 233 return m_next; in getNext() 247 m_next = mp; in setNext()
|
/external/chromium_org/third_party/WebKit/Source/platform/heap/ |
D | HeapLinkedStack.h | 54 for (Node* current = m_head; current; current = current->m_next) in trace() 66 Member<Node> m_next; variable 76 , m_next(next) in Node() 103 m_head = m_head->m_next; in pop()
|