Rename ExceptionCode constants to use the names in the spec (2/3)

Source/core/dom/Range.cpp

 /*
  * (C) 1999 Lars Knoll (knoll@kde.org)
  * (C) 2000 Gunnstein Lye (gunnstein@netcom.no)
  * (C) 2000 Frederik Holljen (frederik.holljen@hig.no)
  * (C) 2001 Peter Kelly (pmk@post.com)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights reserved.
  * Copyright (C) 2011 Motorola Mobility. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
@@ skipping 113 matching lines @@
         m_ownerDocument->detachRange(this);
     m_ownerDocument = document;
     m_start.setToStartOfNode(document);
     m_end.setToStartOfNode(document);
     m_ownerDocument->attachRange(this);
 }
 
 Node* Range::startContainer(ExceptionCode& ec) const
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return 0;
     }
 
     return m_start.container();
 }
 
 int Range::startOffset(ExceptionCode& ec) const
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return 0;
     }
 
     return m_start.offset();
 }
 
 Node* Range::endContainer(ExceptionCode& ec) const
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return 0;
     }
 
     return m_end.container();
 }
 
 int Range::endOffset(ExceptionCode& ec) const
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return 0;
     }
 
     return m_end.offset();
 }
 
 Node* Range::commonAncestorContainer(ExceptionCode& ec) const
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return 0;
     }
 
     return commonAncestorContainer(m_start.container(), m_end.container());
 }
 
 Node* Range::commonAncestorContainer(Node* containerA, Node* containerB)
 {
     for (Node* parentA = containerA; parentA; parentA = parentA->parentNode()) {
         for (Node* parentB = containerB; parentB; parentB = parentB->parentNode()) {
             if (parentA == parentB)
                 return parentA;
         }
     }
     return 0;
 }
 
 bool Range::collapsed(ExceptionCode& ec) const
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return 0;
     }
 
     return m_start == m_end;
 }
 
 static inline bool checkForDifferentRootContainer(const RangeBoundaryPoint& start, const RangeBoundaryPoint& end)
 {
     Node* endRootContainer = end.container();
     while (endRootContainer->parentNode())
         endRootContainer = endRootContainer->parentNode();
     Node* startRootContainer = start.container();
     while (startRootContainer->parentNode())
         startRootContainer = startRootContainer->parentNode();
 
     return startRootContainer != endRootContainer || (Range::compareBoundaryPoints(start, end, ASSERT_NO_EXCEPTION) > 0);
 }
 
 void Range::setStart(PassRefPtr<Node> refNode, int offset, ExceptionCode& ec)
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     if (!refNode) {
         ec = NotFoundError;
         return;
     }
 
     bool didMoveDocument = false;
     if (refNode->document() != m_ownerDocument) {
         setDocument(refNode->document());
         didMoveDocument = true;
     }
 
     ec = 0;
     Node* childNode = checkNodeWOffset(refNode.get(), offset, ec);
     if (ec)
         return;
 
     m_start.set(refNode, offset, childNode);
 
     if (didMoveDocument || checkForDifferentRootContainer(m_start, m_end))
         collapse(true, ec);
 }
 
 void Range::setEnd(PassRefPtr<Node> refNode, int offset, ExceptionCode& ec)
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     if (!refNode) {
         ec = NotFoundError;
         return;
     }
 
     bool didMoveDocument = false;
     if (refNode->document() != m_ownerDocument) {
@@ skipping 20 matching lines @@
 
 void Range::setEnd(const Position& end, ExceptionCode& ec)
 {
     Position parentAnchored = end.parentAnchoredEquivalent();
     setEnd(parentAnchored.containerNode(), parentAnchored.offsetInContainerNode(), ec);
 }
 
 void Range::collapse(bool toStart, ExceptionCode& ec)
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     if (toStart)
         m_end = m_start;
     else
         m_start = m_end;
 }
 
 bool Range::isPointInRange(Node* refNode, int offset, ExceptionCode& ec)
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return false;
     }
 
     if (!refNode) {
         ec = HierarchyRequestError;
         return false;
     }
 
     if (!refNode->attached() || refNode->document() != m_ownerDocument) {
         return false;
     }
 
     ec = 0;
     checkNodeWOffset(refNode, offset, ec);
     if (ec)
         return false;
 
     return compareBoundaryPoints(refNode, offset, m_start.container(), m_start.offset(), ec) >= 0 && !ec
         && compareBoundaryPoints(refNode, offset, m_end.container(), m_end.offset(), ec) <= 0 && !ec;
 }
 
 short Range::comparePoint(Node* refNode, int offset, ExceptionCode& ec) const
 {
     // http://developer.mozilla.org/en/docs/DOM:range.comparePoint
     // This method returns -1, 0 or 1 depending on if the point described by the 
     // refNode node and an offset within the node is before, same as, or after the range respectively.
 
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return 0;
     }
 
     if (!refNode) {
         ec = HierarchyRequestError;
         return 0;
     }
 
     if (!refNode->attached() || refNode->document() != m_ownerDocument) {
         ec = WrongDocumentError;
@@ skipping 25 matching lines @@
     // http://developer.mozilla.org/en/docs/DOM:range.compareNode
     // This method returns 0, 1, 2, or 3 based on if the node is before, after,
     // before and after(surrounds), or inside the range, respectively
 
     if (!refNode) {
         ec = NotFoundError;
         return NODE_BEFORE;
     }
     
     if (!m_start.container() && refNode->attached()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return NODE_BEFORE;
     }
 
     if (m_start.container() && !refNode->attached()) {
         // Firefox doesn't throw an exception for this case; it returns 0.
         return NODE_BEFORE;
     }
 
     if (refNode->document() != m_ownerDocument) {
         // Firefox doesn't throw an exception for this case; it returns 0.
@@ skipping 17 matching lines @@
     } else { // starts at or after the range start
         if (comparePoint(parentNode, nodeIndex + 1, ec) > 0) // ends after the range
             return NODE_AFTER;
         return NODE_INSIDE; // ends inside the range
     }
 }
 
 short Range::compareBoundaryPoints(CompareHow how, const Range* sourceRange, ExceptionCode& ec) const
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return 0;
     }
 
     if (!sourceRange) {
         ec = NotFoundError;
         return 0;
     }
 
     ec = 0;
     Node* thisCont = commonAncestorContainer(ec);
@@ skipping 23 matching lines @@
         case START_TO_START:
             return compareBoundaryPoints(m_start, sourceRange->m_start, ec);
         case START_TO_END:
             return compareBoundaryPoints(m_end, sourceRange->m_start, ec);
         case END_TO_END:
             return compareBoundaryPoints(m_end, sourceRange->m_end, ec);
         case END_TO_START:
             return compareBoundaryPoints(m_start, sourceRange->m_end, ec);
     }
 
-    ec = SYNTAX_ERR;
+    ec = SyntaxError;
     return 0;
 }
 
 short Range::compareBoundaryPoints(Node* containerA, int offsetA, Node* containerB, int offsetB, ExceptionCode& ec)
 {
     ASSERT(containerA);
     ASSERT(containerB);
 
     if (!containerA)
         return -1;
@@ skipping 103 matching lines @@
     processContents(DELETE_CONTENTS, ec);
 }
 
 bool Range::intersectsNode(Node* refNode, ExceptionCode& ec)
 {
     // http://developer.mozilla.org/en/docs/DOM:range.intersectsNode
     // Returns a bool if the node intersects the range.
 
     // Throw exception if the range is already detached.
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return false;
     }
     if (!refNode) {
         ec = NotFoundError;
         return false;
     }
 
     if (!refNode->attached() || refNode->document() != m_ownerDocument) {
         // Firefox doesn't throw an exception for these cases; it returns false.
         return false;
@@ skipping 331 matching lines @@
     checkDeleteExtract(ec);
     if (ec)
         return 0;
 
     return processContents(EXTRACT_CONTENTS, ec);
 }
 
 PassRefPtr<DocumentFragment> Range::cloneContents(ExceptionCode& ec)
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return 0;
     }
 
     return processContents(CLONE_CONTENTS, ec);
 }
 
 void Range::insertNode(PassRefPtr<Node> prpNewNode, ExceptionCode& ec)
 {
     RefPtr<Node> newNode = prpNewNode;
 
     ec = 0;
 
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     if (!newNode) {
         ec = NotFoundError;
         return;
     }
 
     // HierarchyRequestError: Raised if the container of the start of the Range is of a type that
     // does not allow children of the type of newNode or if newNode is an ancestor of the container.
@@ skipping 84 matching lines @@
             return;
 
         if (collapsed && numNewChildren)
             m_end.set(m_start.container(), startOffset + numNewChildren, lastChild.get());
     }
 }
 
 String Range::toString(ExceptionCode& ec) const
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return String();
     }
 
     StringBuilder builder;
 
     Node* pastLast = pastLastNode();
     for (Node* n = firstNode(); n != pastLast; n = NodeTraversal::next(n)) {
         if (n->nodeType() == Node::TEXT_NODE || n->nodeType() == Node::CDATA_SECTION_NODE) {
             String data = static_cast<CharacterData*>(n)->data();
             int length = data.length();
@@ skipping 19 matching lines @@
     // We need to update layout, since plainText uses line boxes in the render tree.
     // FIXME: As with innerText, we'd like this to work even if there are no render objects.
     m_start.container()->document()->updateLayout();
 
     return plainText(this);
 }
 
 PassRefPtr<DocumentFragment> Range::createContextualFragment(const String& markup, ExceptionCode& ec)
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return 0;
     }
 
     Node* element = m_start.container()->isElementNode() ? m_start.container() : m_start.container()->parentNode();
     if (!element || !element->isHTMLElement()) {
         ec = NotSupportedError;
         return 0;
     }
 
     RefPtr<DocumentFragment> fragment = WebCore::createContextualFragment(markup, toHTMLElement(element), AllowScriptingContentAndDoNotMarkAlreadyStarted, ec);
     if (!fragment)
         return 0;
 
     return fragment.release();
 }
 
 
 void Range::detach(ExceptionCode& ec)
 {
     // Check first to see if we've already detached:
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     m_ownerDocument->detachRange(this);
 
     m_start.clear();
     m_end.clear();
 }
 
 Node* Range::checkNodeWOffset(Node* n, int offset, ExceptionCode& ec) const
@@ skipping 74 matching lines @@
         case Node::TEXT_NODE:
         case Node::XPATH_NAMESPACE_NODE:
             ec = INVALID_NODE_TYPE_ERR;
             return;
     }
 }
 
 PassRefPtr<Range> Range::cloneRange(ExceptionCode& ec) const
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return 0;
     }
 
     return Range::create(m_ownerDocument, m_start.container(), m_start.offset(), m_end.container(), m_end.offset());
 }
 
 void Range::setStartAfter(Node* refNode, ExceptionCode& ec)
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     if (!refNode) {
         ec = NotFoundError;
         return;
     }
 
     ec = 0;
     checkNodeBA(refNode, ec);
     if (ec)
         return;
 
     setStart(refNode->parentNode(), refNode->nodeIndex() + 1, ec);
 }
 
 void Range::setEndBefore(Node* refNode, ExceptionCode& ec)
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     if (!refNode) {
         ec = NotFoundError;
         return;
     }
 
     ec = 0;
     checkNodeBA(refNode, ec);
     if (ec)
         return;
 
     setEnd(refNode->parentNode(), refNode->nodeIndex(), ec);
 }
 
 void Range::setEndAfter(Node* refNode, ExceptionCode& ec)
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     if (!refNode) {
         ec = NotFoundError;
         return;
     }
 
     ec = 0;
     checkNodeBA(refNode, ec);
     if (ec)
         return;
 
     setEnd(refNode->parentNode(), refNode->nodeIndex() + 1, ec);
 }
 
 void Range::selectNode(Node* refNode, ExceptionCode& ec)
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     if (!refNode) {
         ec = NotFoundError;
         return;
     }
 
     // INVALID_NODE_TYPE_ERR: Raised if an ancestor of refNode is an Entity, Notation or
     // DocumentType node or if refNode is a Document, DocumentFragment, ShadowRoot, Attr, Entity, or Notation
@@ skipping 42 matching lines @@
     ec = 0;
     setStartBefore(refNode, ec);
     if (ec)
         return;
     setEndAfter(refNode, ec);
 }
 
 void Range::selectNodeContents(Node* refNode, ExceptionCode& ec)
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     if (!refNode) {
         ec = NotFoundError;
         return;
     }
 
     // INVALID_NODE_TYPE_ERR: Raised if refNode or an ancestor of refNode is an Entity, Notation
     // or DocumentType node.
@@ skipping 22 matching lines @@
 
     m_start.setToStartOfNode(refNode);
     m_end.setToEndOfNode(refNode);
 }
 
 void Range::surroundContents(PassRefPtr<Node> passNewParent, ExceptionCode& ec)
 {
     RefPtr<Node> newParent = passNewParent;
 
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     if (!newParent) {
         ec = NotFoundError;
         return;
     }
 
     // INVALID_NODE_TYPE_ERR: Raised if node is an Attr, Entity, DocumentType, Notation,
     // Document, or DocumentFragment node.
@@ skipping 37 matching lines @@
     // allowed by the type of node?
 
     // BAD_BOUNDARYPOINTS_ERR: Raised if the Range partially selects a non-Text node.
     Node* startNonTextContainer = m_start.container();
     if (startNonTextContainer->nodeType() == Node::TEXT_NODE)
         startNonTextContainer = startNonTextContainer->parentNode();
     Node* endNonTextContainer = m_end.container();
     if (endNonTextContainer->nodeType() == Node::TEXT_NODE)
         endNonTextContainer = endNonTextContainer->parentNode();
     if (startNonTextContainer != endNonTextContainer) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     ec = 0;
     while (Node* n = newParent->firstChild()) {
         toContainerNode(newParent.get())->removeChild(n, ec);
         if (ec)
             return;
     }
     RefPtr<DocumentFragment> fragment = extractContents(ec);
     if (ec)
         return;
     insertNode(newParent, ec);
     if (ec)
         return;
     newParent->appendChild(fragment.release(), ec);
     if (ec)
         return;
     selectNode(newParent.get(), ec);
 }
 
 void Range::setStartBefore(Node* refNode, ExceptionCode& ec)
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     if (!refNode) {
         ec = NotFoundError;
         return;
     }
 
     ec = 0;
     checkNodeBA(refNode, ec);
     if (ec)
         return;
 
     setStart(refNode->parentNode(), refNode->nodeIndex(), ec);
 }
 
 void Range::checkDeleteExtract(ExceptionCode& ec)
 {
     if (!m_start.container()) {
-        ec = INVALID_STATE_ERR;
+        ec = InvalidStateError;
         return;
     }
 
     ec = 0;
     if (!commonAncestorContainer(ec) || ec)
         return;
         
     Node* pastLast = pastLastNode();
     for (Node* n = firstNode(); n != pastLast; n = NodeTraversal::next(n)) {
         if (n->nodeType() == Node::DOCUMENT_TYPE_NODE) {
@@ skipping 422 matching lines @@
 
 void showTree(const WebCore::Range* range)
 {
     if (range && range->boundaryPointsValid()) {
         range->startContainer()->showTreeAndMark(range->startContainer(), "S", range->endContainer(), "E");
         fprintf(stderr, "start offset: %d, end offset: %d\n", range->startOffset(), range->endOffset());
     }
 }
 
 #endif