Searched refs:prevSibling (Results 1 – 8 of 8) sorted by relevance
19 struct hieralloc_header * nextSibling, * prevSibling; member52 assert(!header->nextSibling || header->nextSibling->prevSibling == header); in check_header()54 assert(!header->prevSibling || header->prevSibling->nextSibling == header); in check_header()55 assert(!header->prevSibling || header->prevSibling->parent == header->parent); in check_header()85 assert(NULL == header->prevSibling); in add_to_parent()96 parent->child->prevSibling = header; in add_to_parent()99 header->prevSibling = NULL; in add_to_parent()104 assert(!header->nextSibling || header->nextSibling->prevSibling == header); in add_to_parent()106 assert(!header->prevSibling || header->prevSibling->nextSibling == header); in add_to_parent()107 assert(!header->prevSibling || header->prevSibling->parent == header->parent); in add_to_parent()[all …]
69 private NestedMapData prevSibling = null; field in NestedMapData113 data.prevSibling = sym.lastChild; in createChildNode()135 if (prevSibling != null) { in severNode()136 prevSibling.nextSibling = nextSibling; in severNode()141 nextSibling.prevSibling = prevSibling; in severNode()143 parent.lastChild = prevSibling; in severNode()264 return prevSibling == null; in isFirstSibling()
304 if (Frame* prevSibling = previousSibling()) in traversePreviousWithWrap() local305 return prevSibling->tree()->deepLastChild(); in traversePreviousWithWrap()
735 int prevSibling = _prevsib(index); in dumpDTM() local737 if (DTM.NULL == prevSibling) in dumpDTM()739 else if (NOTPROCESSED == prevSibling) in dumpDTM()742 ps.println("Prev sibling: " + prevSibling); in dumpDTM()
50 this.prevSibling = null;301 child.prevSibling = i - 1 >= 0 ? this.children[i - 1] : null;
688 int prevSibling = dtm.getPreviousSibling(context); in findPrecedingOrAncestorOrSelf() local690 if (DTM.NULL == prevSibling) in findPrecedingOrAncestorOrSelf()698 context = dtm.getLastChild(prevSibling); in findPrecedingOrAncestorOrSelf()701 context = prevSibling; in findPrecedingOrAncestorOrSelf()
1236 Node* prevSibling = innerPreviousSibling(node); in didInsertDOMNode() local1237 int prevId = prevSibling ? m_documentNodeToIdMap.get(prevSibling) : 0; in didInsertDOMNode()
1022 RenderLayer* prevSibling = beforeChild ? beforeChild->previousSibling() : lastChild(); in addChild() local1023 if (prevSibling) { in addChild()1024 child->setPreviousSibling(prevSibling); in addChild()1025 prevSibling->setNextSibling(child); in addChild()1026 ASSERT(prevSibling != child); in addChild()