Rename ASSERT_NO_EXCEPTION_STATE and IGNORE_EXCEPTION_STATE

Source/core/editing/MergeIdenticalElementsCommand.cpp

 /*
  * Copyright (C) 2005, 2008 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
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 37 matching lines @@
         return;
 
     m_atChild = m_element2->firstChild();
 
     Vector<RefPtr<Node> > children;
     for (Node* child = m_element1->firstChild(); child; child = child->nextSibling())
         children.append(child);
 
     size_t size = children.size();
     for (size_t i = 0; i < size; ++i)
-        m_element2->insertBefore(children[i].release(), m_atChild.get(), IGNORE_EXCEPTION_STATE);
+        m_element2->insertBefore(children[i].release(), m_atChild.get(), IGNORE_EXCEPTION);
 
-    m_element1->remove(IGNORE_EXCEPTION_STATE);
+    m_element1->remove(IGNORE_EXCEPTION);
 }
 
 void MergeIdenticalElementsCommand::doUnapply()
 {
     ASSERT(m_element1);
     ASSERT(m_element2);
 
     RefPtr<Node> atChild = m_atChild.release();
 
     ContainerNode* parent = m_element2->parentNode();
@@ skipping 17 matching lines @@
 
 #ifndef NDEBUG
 void MergeIdenticalElementsCommand::getNodesInCommand(HashSet<Node*>& nodes)
 {
     addNodeAndDescendants(m_element1.get(), nodes);
     addNodeAndDescendants(m_element2.get(), nodes);
 }
 #endif
 
 } // namespace WebCore