Lines Matching refs:listChildNode
195 Node* listChildNode = enclosingListChild(selectionNode);
197 if (listChildNode) {
199 RefPtr<HTMLElement> listNode = enclosingList(listChildNode);
201 listNode = fixOrphanedListChild(listChildNode);
205 // listChildNode will be removed from the list and a list of type m_type will be created.
246 unlistifyParagraph(endingSelection().visibleStart(), listNode.get(), listChildNode);
249 if (!listChildNode || switchListType || forceCreateList)
253 void InsertListCommand::unlistifyParagraph(const VisiblePosition& originalStart, HTMLElement* listNode, Node* listChildNode)
259 if (listChildNode->hasTagName(liTag)) {
260 start = firstPositionInNode(listChildNode);
261 end = lastPositionInNode(listChildNode);
262 nextListChild = listChildNode->nextSibling();
263 previousListChild = listChildNode->previousSibling();
269 ASSERT(nextListChild != listChildNode);
271 ASSERT(previousListChild != listChildNode);
285 // We want to pull listChildNode out of listNode, and place it before nextListChild
287 // But to split listNode, we must first split ancestors of listChildNode between it and listNode,
289 // FIXME: We appear to split at nextListChild as opposed to listChildNode so that when we remove
290 // listChildNode below in moveParagraphs, previousListChild will be removed along with it if it is
294 } else if (nextListChild || listChildNode->parentNode() != listNode) {
295 // Just because listChildNode has no previousListChild doesn't mean there isn't any content
296 // in listNode that comes before listChildNode, as listChildNode could have ancestors
298 // where we're about to move listChildNode to.
299 if (listChildNode->parentNode() != listNode)
300 splitElement(listNode, splitTreeToNode(listChildNode, listNode).get());
