Simplify HTMLStyleElement.

sky/engine/core/html/parser/HTMLElementStack.cpp

 /*
  * Copyright (C) 2010 Google, Inc. All Rights Reserved.
  * Copyright (C) 2011 Apple Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
@@ skipping 39 matching lines @@
 }
 
 HTMLElementStack::~HTMLElementStack()
 {
 }
 
 void HTMLElementStack::popAll()
 {
     m_rootNode = nullptr;
     m_stackDepth = 0;
-    while (m_top) {
-        Node& node = *topNode();
-        if (node.isElementNode())
-            toElement(node).finishParsingChildren();
+    while (m_top)
         m_top = m_top->releaseNext();
-    }
 }
 
 void HTMLElementStack::pop()
 {
     popCommon();
 }
 
 void HTMLElementStack::popUntil(Element* element)
 {
     while (top() != element)
@@ skipping 29 matching lines @@
 void HTMLElementStack::pushCommon(PassRefPtr<ContainerNode> node)
 {
     ASSERT(m_rootNode);
 
     m_stackDepth++;
     m_top = adoptPtr(new ElementRecord(node, m_top.release()));
 }
 
 void HTMLElementStack::popCommon()
 {
-    top()->finishParsingChildren();
     m_top = m_top->releaseNext();
     m_stackDepth--;
 }
 
-void HTMLElementStack::removeNonTopCommon(Element* element)
-{
-    ASSERT(top() != element);
-    for (ElementRecord* pos = m_top.get(); pos; pos = pos->next()) {
-        if (pos->next()->element() == element) {
-            // FIXME: Is it OK to call finishParsingChildren()
-            // when the children aren't actually finished?
-            element->finishParsingChildren();
-            pos->setNext(pos->next()->releaseNext());
-            m_stackDepth--;
-            return;
-        }
-    }
-    ASSERT_NOT_REACHED();
-}
-
 #ifndef NDEBUG
 
 void HTMLElementStack::show()
 {
     for (ElementRecord* record = m_top.get(); record; record = record->next())
         record->element()->showNode();
 }
 
 #endif
 
 }