/external/mesa3d/src/talloc/ |
D | hieralloc.c | 19 struct hieralloc_header * nextSibling, * prevSibling; member 52 assert(!header->nextSibling || header->nextSibling->prevSibling == header); in check_header() 53 assert(!header->nextSibling || header->nextSibling->parent == header->parent); in check_header() 54 assert(!header->prevSibling || header->prevSibling->nextSibling == header); in check_header() 75 child = child->nextSibling; in check_children() 86 assert(NULL == header->nextSibling); in add_to_parent() 98 header->nextSibling = parent->child; in add_to_parent() 104 assert(!header->nextSibling || header->nextSibling->prevSibling == header); in add_to_parent() 105 assert(!header->nextSibling || header->nextSibling->parent == header->parent); in add_to_parent() 106 assert(!header->prevSibling || header->prevSibling->nextSibling == header); in add_to_parent() [all …]
|
/external/webkit/Source/WebCore/html/ |
D | HTMLTableRowsCollection.cpp | 62 for (child = previous->nextSibling(); child; child = child->nextSibling()) { in rowAfter() 72 child = previous->parentNode()->nextSibling(); in rowAfter() 73 for (; child; child = child->nextSibling()) { in rowAfter() 75 … for (Node* grandchild = child->firstChild(); grandchild; grandchild = grandchild->nextSibling()) { in rowAfter() 86 child = previous->nextSibling(); in rowAfter() 88 child = previous->parentNode()->nextSibling(); in rowAfter() 89 for (; child; child = child->nextSibling()) { in rowAfter() 93 … for (Node* grandchild = child->firstChild(); grandchild; grandchild = grandchild->nextSibling()) { in rowAfter() 104 child = previous->parentNode()->nextSibling(); in rowAfter() 105 for (; child; child = child->nextSibling()) { in rowAfter() [all …]
|
D | HTMLTableRowElement.cpp | 74 for (Node *row = head->firstChild(); row; row = row->nextSibling()) { in rowIndex() 82 for (Node *node = table->firstChild(); node; node = node->nextSibling()) { in rowIndex() 85 for (Node* row = section->firstChild(); row; row = row->nextSibling()) { in rowIndex() 95 for (Node *row = foot->firstChild(); row; row = row->nextSibling()) { in rowIndex()
|
/external/webkit/LayoutTests/dom/xhtml/level3/core/ |
D | canonicalform08.js | 131 node = node.nextSibling; 140 node = node.nextSibling; 145 node = node.nextSibling; 154 node = node.nextSibling; 162 node = node.nextSibling; 171 node = node.nextSibling; 176 node = node.nextSibling; 185 node = node.nextSibling; 190 node = node.nextSibling;
|
D | canonicalform09.js | 133 node = node.nextSibling; 142 node = node.nextSibling; 147 node = node.nextSibling; 156 node = node.nextSibling; 164 node = node.nextSibling;
|
/external/webkit/Source/WebCore/inspector/front-end/ |
D | treeoutline.js | 57 lastChild.nextSibling = child; 61 child.nextSibling = null; 98 previousChild.nextSibling = child; 107 child.nextSibling = nextChild; 109 child.nextSibling = null; 151 else if (child.nextSibling) 152 child.nextSibling.select(); 158 child.previousSibling.nextSibling = child.nextSibling; 159 if (child.nextSibling) 160 child.nextSibling.previousSibling = child.previousSibling; [all …]
|
D | TimelineGrid.js | 117 divider = divider.nextSibling; 118 dividerLabelBar = dividerLabelBar.nextSibling; 123 var nextDivider = divider.nextSibling; 128 var nextDivider = dividerLabelBar.nextSibling;
|
D | DataGrid.js | 623 child.previousSibling.nextSibling = child.nextSibling; 624 if (child.nextSibling) 625 child.nextSibling.previousSibling = child.previousSibling; 629 child.nextSibling = null; 645 child.nextSibling = null; 672 child.nextSibling = null; 711 previousSiblingNode.nextSibling = node; 716 previousSiblingNode.nextSibling = null; 998 this.nextSibling = null; 1208 previousChild.nextSibling = this; [all …]
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
D | LinkedListMultimap.java | 112 Node<K, V> nextSibling; // the next node with the same key field in LinkedListMultimap.Node 186 @Nullable K key, @Nullable V value, @Nullable Node<K, V> nextSibling) { in addNode() argument 192 } else if (nextSibling == null) { // non-empty list, add to tail in addNode() 199 keyTail.nextSibling = node; in addNode() 205 node.previous = nextSibling.previous; in addNode() 206 node.previousSibling = nextSibling.previousSibling; in addNode() 207 node.next = nextSibling; in addNode() 208 node.nextSibling = nextSibling; in addNode() 209 if (nextSibling.previousSibling == null) { // nextSibling was key head in addNode() 212 nextSibling.previousSibling.nextSibling = node; in addNode() [all …]
|
/external/webkit/Source/WebCore/dom/ |
D | Text.cpp | 68 parentNode()->insertBefore(newText.get(), nextSibling(), ec); in splitText() 101 while ((n = n->nextSibling())) { in latestLogicallyAdjacentTextNode() 120 Node* onePastEndText = endText->nextSibling(); in wholeText() 122 for (const Node* n = startText; n != onePastEndText; n = n->nextSibling()) { in wholeText() 134 for (const Node* n = startText; n != onePastEndText; n = n->nextSibling()) { in wholeText() 161 n = nodeToRemove->nextSibling(); in replaceWholeText() 166 Node* onePastEndText = endText->nextSibling(); in replaceWholeText() 167 …for (RefPtr<Node> n = nextSibling(); n && n != onePastEndText && n->isTextNode() && n->parentNode(… in replaceWholeText() 169 n = nodeToRemove->nextSibling(); in replaceWholeText() 230 first = first->nextSibling(); in rendererIsNeeded()
|
D | TreeWalker.cpp | 93 if (node->nextSibling()) { in firstChild() 94 node = node->nextSibling(); in firstChild() 176 Node* TreeWalker::nextSibling(ScriptState* state) in nextSibling() function in WebCore::TreeWalker 182 for (RefPtr<Node> sibling = node->nextSibling(); sibling; ) { in nextSibling() 200 sibling = sibling->nextSibling(); in nextSibling() 266 while (Node* nextSibling = node->traverseNextSibling(root())) { in nextNode() local 267 node = nextSibling; in nextNode()
|
D | ContainerNode.cpp | 61 for (Node* child = node->firstChild(); child; child = child->nextSibling()) in collectNodes() 193 ASSERT(!newChild->nextSibling()); in insertBeforeCommon() 202 ASSERT(prev->nextSibling() == nextChild); in insertBeforeCommon() 267 RefPtr<Node> next = oldChild->nextSibling(); in replaceChild() 290 RefPtr<Node> nextChild = isFragment ? child->nextSibling() : 0; in replaceChild() 307 ASSERT(!child->nextSibling()); in replaceChild() 320 next = prev->nextSibling(); in replaceChild() 445 Node* next = child->nextSibling(); in removeChild() 493 Node* next = oldChild->nextSibling(); in parserRemoveChild() 525 Node* next = n->nextSibling(); in removeChildren() [all …]
|
D | TreeWalker.h | 51 Node* nextSibling(ScriptState*); 61 …Node* nextSibling() { return nextSibling(scriptStateFromNode(mainThreadNormalWorld(), m_current.ge… in nextSibling() function
|
/external/jsilver/src/com/google/clearsilver/jsilver/data/ |
D | NestedMapData.java | 70 private NestedMapData nextSibling = null; field in NestedMapData 105 curr = curr.nextSibling; in createChildNode() 116 sym.lastChild.nextSibling = data; in createChildNode() 136 prevSibling.nextSibling = nextSibling; in severNode() 138 parent.firstChild = nextSibling; in severNode() 140 if (nextSibling != null) { in severNode() 141 nextSibling.prevSibling = prevSibling; in severNode() 272 return nextSibling == null; in isLastSibling() 276 return nextSibling; in getNextSibling() 353 curr = curr.nextSibling; in getChildNode() [all …]
|
/external/webkit/LayoutTests/fast/xpath/ |
D | evaluate-twice-expected.txt | 2 PASS expr.evaluate(doc.documentElement.firstChild.nextSibling, XPathResult.STRING_TYPE, null).strin… 4 PASS expr.evaluate(doc.documentElement.firstChild.nextSibling, XPathResult.STRING_TYPE, null).strin… 6 PASS expr.evaluate(doc.documentElement.firstChild.nextSibling, XPathResult.STRING_TYPE, null).strin… 8 PASS expr.evaluate(doc.documentElement.firstChild.nextSibling, XPathResult.NUMBER_TYPE, null).numbe…
|
/external/guava/guava/src/com/google/common/collect/ |
D | LinkedListMultimap.java | 116 Node<K, V> nextSibling; // the next node with the same key field in LinkedListMultimap.Node 190 @Nullable K key, @Nullable V value, @Nullable Node<K, V> nextSibling) { in addNode() argument 196 } else if (nextSibling == null) { // non-empty list, add to tail in addNode() 203 keyTail.nextSibling = node; in addNode() 209 node.previous = nextSibling.previous; in addNode() 210 node.previousSibling = nextSibling.previousSibling; in addNode() 211 node.next = nextSibling; in addNode() 212 node.nextSibling = nextSibling; in addNode() 213 if (nextSibling.previousSibling == null) { // nextSibling was key head in addNode() 216 nextSibling.previousSibling.nextSibling = node; in addNode() [all …]
|
/external/webkit/Source/WebCore/editing/ |
D | MergeIdenticalElementsCommand.cpp | 40 ASSERT(m_element1->nextSibling() == m_element2); in MergeIdenticalElementsCommand() 45 …if (m_element1->nextSibling() != m_element2 || !m_element1->rendererIsEditable() || !m_element2->r… in doApply() 53 for (Node* child = m_element1->firstChild(); child; child = child->nextSibling()) in doApply() 81 …r (Node* child = m_element2->firstChild(); child && child != atChild; child = child->nextSibling()) in doUnapply()
|
D | ModifySelectionListLevel.cpp | 81 RenderObject* r = endListChild->renderer()->nextSibling(); in getStartEndListChildren() 95 Node* next = node->nextSibling(); in insertSiblingNodeRangeBefore() 110 Node* next = node->nextSibling(); in insertSiblingNodeRangeAfter() 126 Node* next = node->nextSibling(); in appendSiblingNodeRange() 262 …Node* nextItem = endListChild->renderer()->nextSibling() ? endListChild->renderer()->nextSibling()… in doApply()
|
D | ApplyStyleCommand.cpp | 423 next = node->nextSibling(); in cleanupUnstyledAppleStyleSpans() 472 if (before ? n->previousSibling() : n->nextSibling()) in splitAncestorsWithUnicodeBidi() 473 splitElement(parent, before ? n : n->nextSibling()); in splitAncestorsWithUnicodeBidi() 745 Node* sibling = node->nextSibling(); in applyInlineStyleToNodeRange() 750 sibling = runEnd->nextSibling(); in applyInlineStyleToNodeRange() 791 RefPtr<Node> nextSibling = node->nextSibling(); in removeStyleFromRunBeforeApplyingStyle() local 797 runStart = previousSibling ? previousSibling->nextSibling() : parent->firstChild(); in removeStyleFromRunBeforeApplyingStyle() 799 runEnd = nextSibling ? nextSibling->previousSibling() : parent->lastChild(); in removeStyleFromRunBeforeApplyingStyle() 996 Node* nextChild = child->nextSibling(); in pushDownInlineStyleAroundNode() 1087 for (; childNode; childNode = childNode->nextSibling()) in removeInlineStyle() [all …]
|
D | BreakBlockquoteCommand.cpp | 150 listChildNode = listChildNode->nextSibling(); in doApply() 162 Node *next = moveNode->nextSibling(); in doApply() 178 moveNode = ancestor->nextSibling(); in doApply() 180 Node *next = moveNode->nextSibling(); in doApply()
|
/external/webkit/Source/WebCore/rendering/mathml/ |
D | RenderMathMLUnderOver.cpp | 70 current = current->nextSibling(); in addChild() 130 base = base->nextSibling(); in stretchToHeight() 164 base = over->nextSibling(); in layout() 215 base = over->nextSibling(); in layout() 257 current = current->nextSibling(); in baselinePosition() 284 for (RenderObject* current = firstChild(); current; current = current->nextSibling()) { in nonOperatorHeight()
|
D | RenderMathMLRow.cpp | 47 for (RenderObject* current = firstChild(); current; current = current->nextSibling()) { in nonOperatorHeight() 75 for (RenderObject* current = firstChild(); current; current = current->nextSibling()) { in layout() 106 for (RenderObject* current = firstChild(); current; current = current->nextSibling()) { in layout()
|
/external/webkit/Source/WebCore/rendering/ |
D | RenderTable.cpp | 354 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) { in layout() 414 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) { in layout() 498 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) { in addOverflowFromChildren() 508 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) { in setCellLogicalWidths() 559 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) { in paintObject() 581 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) in paintObject() 674 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) { in splitColumn() 692 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) { in appendColumn() 705 next = current->nextSibling(); in nextColElement() 707 next = current->parent()->nextSibling(); in nextColElement() [all …]
|
/external/webkit/Source/WebCore/svg/ |
D | SVGUseElement.cpp | 245 …entInstance* instance = targetInstance->firstChild(); instance; instance = instance->nextSibling()) in updateContainerSize() 298 …entInstance* instance = targetInstance->firstChild(); instance; instance = instance->nextSibling()) in updateContainerOffset() 421 …entInstance* instance = targetInstance->firstChild(); instance; instance = instance->nextSibling()) in dumpInstanceTree() 448 for (Node* cur = start->firstChild(); cur; cur = cur->nextSibling()) { in subtreeContainsDisallowedElement() 725 for (Node* node = target->firstChild(); node; node = node->nextSibling()) { in buildInstanceTree() 883 … for (RefPtr<Node> sibling = element->nextSibling(); sibling; sibling = sibling->nextSibling()) in expandUseElementsInShadowTree() 887 for (RefPtr<Node> child = element->firstChild(); child; child = child->nextSibling()) in expandUseElementsInShadowTree() 907 for (Node* child = element->firstChild(); child; child = child->nextSibling()) { in expandSymbolElementsInShadowTree() 931 … for (RefPtr<Node> sibling = element->nextSibling(); sibling; sibling = sibling->nextSibling()) in expandSymbolElementsInShadowTree() 935 for (RefPtr<Node> child = element->firstChild(); child; child = child->nextSibling()) in expandSymbolElementsInShadowTree() [all …]
|
D | SVGElementInstanceList.cpp | 40 …entInstance* instance = m_rootInstance->firstChild(); instance; instance = instance->nextSibling()) in length() 50 instance = instance->nextSibling(); in item()
|