Remove CDATASection

Source/core/dom/Node.cpp

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller (mueller@kde.org)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights reserved.
  * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies)
  * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
@@ skipping 122 matching lines @@
 #endif
 
 void Node::dumpStatistics()
 {
 #if DUMP_NODE_STATISTICS
     size_t nodesWithRareData = 0;
 
     size_t elementNodes = 0;
     size_t attrNodes = 0;
     size_t textNodes = 0;
-    size_t cdataNodes = 0;
     size_t commentNodes = 0;
     size_t piNodes = 0;
     size_t documentNodes = 0;
     size_t docTypeNodes = 0;
     size_t fragmentNodes = 0;
     size_t shadowRootNodes = 0;
 
     HashMap<String, size_t> perTagCount;
 
     size_t attributes = 0;
@@ skipping 28 matching lines @@
                 break;
             }
             case ATTRIBUTE_NODE: {
                 ++attrNodes;
                 break;
             }
             case TEXT_NODE: {
                 ++textNodes;
                 break;
             }
-            case CDATA_SECTION_NODE: {
-                ++cdataNodes;
-                break;
-            }
             case COMMENT_NODE: {
                 ++commentNodes;
                 break;
             }
             case PROCESSING_INSTRUCTION_NODE: {
                 ++piNodes;
                 break;
             }
             case DOCUMENT_NODE: {
                 ++documentNodes;
@@ skipping 13 matching lines @@
         }
     }
 
     printf("Number of Nodes: %d\n\n", liveNodeSet().size());
     printf("Number of Nodes with RareData: %zu\n\n", nodesWithRareData);
 
     printf("NodeType distribution:\n");
     printf("  Number of Element nodes: %zu\n", elementNodes);
     printf("  Number of Attribute nodes: %zu\n", attrNodes);
     printf("  Number of Text nodes: %zu\n", textNodes);
-    printf("  Number of CDATASection nodes: %zu\n", cdataNodes);
     printf("  Number of Comment nodes: %zu\n", commentNodes);
     printf("  Number of ProcessingInstruction nodes: %zu\n", piNodes);
     printf("  Number of Document nodes: %zu\n", documentNodes);
     printf("  Number of DocumentType nodes: %zu\n", docTypeNodes);
     printf("  Number of DocumentFragment nodes: %zu\n", fragmentNodes);
     printf("  Number of ShadowRoot nodes: %zu\n", shadowRootNodes);
 
     printf("Element tag name distibution:\n");
     for (const auto& entry : perTagCount)
         printf("  Number of <%s> tags: %zu\n", entry.key.utf8().data(), entry.value);
@@ skipping 1112 matching lines @@
             content.append(toText(node).data());
         }
     }
     return content.toString();
 }
 
 void Node::setTextContent(const String& text)
 {
     switch (nodeType()) {
         case TEXT_NODE:
-        case CDATA_SECTION_NODE:
         case COMMENT_NODE:
         case PROCESSING_INSTRUCTION_NODE:
             setNodeValue(text);
             return;
         case ELEMENT_NODE:
         case ATTRIBUTE_NODE:
         case DOCUMENT_FRAGMENT_NODE: {
             // FIXME: Merge this logic into replaceChildrenWithText.
             RefPtrWillBeRawPtr<ContainerNode> container = toContainerNode(this);
 
@@ skipping 998 matching lines @@
     visitor->trace(m_treeScope);
 #endif
     EventTarget::trace(visitor);
 }
 
 unsigned Node::lengthOfContents() const
 {
     // This switch statement must be consistent with that of Range::processContentsBetweenOffsets.
     switch (nodeType()) {
     case Node::TEXT_NODE:
-    case Node::CDATA_SECTION_NODE:
     case Node::COMMENT_NODE:
         return toCharacterData(this)->length();
     case Node::PROCESSING_INSTRUCTION_NODE:
         return toProcessingInstruction(this)->data().length();
     case Node::ELEMENT_NODE:
     case Node::ATTRIBUTE_NODE:
     case Node::DOCUMENT_NODE:
     case Node::DOCUMENT_FRAGMENT_NODE:
         return toContainerNode(this)->countChildren();
     case Node::DOCUMENT_TYPE_NODE:
@@ skipping 43 matching lines @@
         node->showTreeForThis();
 }
 
 void showNodePath(const blink::Node* node)
 {
     if (node)
         node->showNodePathForThis();
 }
 
 #endif