Rename Blink constants generated from IDL files.

third_party/WebKit/Source/core/xml/XPathStep.cpp

 /*
  * Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
  * Copyright (C) 2006, 2009 Apple Inc. All rights reserved.
  * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org>
  *
  * 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
@@ skipping 134 matching lines @@
             evaluationContext.size = nodes.size();
             evaluationContext.position = j + 1;
             if (predicate->evaluate(evaluationContext))
                 newNodes->append(node);
         }
 
         nodes.swap(*newNodes);
     }
 }
 
-#if ENABLE(ASSERT)
+#if DCHECK_IS_ON()
 static inline Node::NodeType primaryNodeType(Step::Axis axis)
 {
     switch (axis) {
     case Step::AttributeAxis:
-        return Node::ATTRIBUTE_NODE;
+        return Node::kAttributeNode;
     default:
-        return Node::ELEMENT_NODE;
+        return Node::kElementNode;
     }
 }
 #endif
 
 // Evaluate NodeTest without considering merged predicates.
 static inline bool nodeMatchesBasicTest(Node* node, Step::Axis axis, const Step::NodeTest& nodeTest)
 {
     switch (nodeTest.getKind()) {
     case Step::NodeTest::TextNodeTest: {
         Node::NodeType type = node->getNodeType();
-        return type == Node::TEXT_NODE || type == Node::CDATA_SECTION_NODE;
+        return type == Node::kTextNode || type == Node::kCdataSectionNode;
     }
     case Step::NodeTest::CommentNodeTest:
-        return node->getNodeType() == Node::COMMENT_NODE;
+        return node->getNodeType() == Node::kCommentNode;
     case Step::NodeTest::ProcessingInstructionNodeTest: {
         const AtomicString& name = nodeTest.data();
-        return node->getNodeType() == Node::PROCESSING_INSTRUCTION_NODE && (name.isEmpty() || node->nodeName() == name);
+        return node->getNodeType() == Node::kProcessingInstructionNode && (name.isEmpty() || node->nodeName() == name);
     }
     case Step::NodeTest::AnyNodeTest:
         return true;
     case Step::NodeTest::NameTest: {
         const AtomicString& name = nodeTest.data();
         const AtomicString& namespaceURI = nodeTest.namespaceURI();
 
         if (axis == Step::AttributeAxis) {
             Attr* attr = toAttr(node);
 
             // In XPath land, namespace nodes are not accessible on the
             // attribute axis.
             if (attr->namespaceURI() == XMLNSNames::xmlnsNamespaceURI)
                 return false;
 
             if (name == starAtom)
                 return namespaceURI.isEmpty() || attr->namespaceURI() == namespaceURI;
 
             return attr->localName() == name && attr->namespaceURI() == namespaceURI;
         }
 
         // Node test on the namespace axis is not implemented yet, the caller
         // has a check for it.
-        ASSERT(axis != Step::NamespaceAxis);
+        DCHECK_NE(Step::NamespaceAxis, axis);
 
         // For other axes, the principal node type is element.
-        ASSERT(primaryNodeType(axis) == Node::ELEMENT_NODE);
+#if DCHECK_IS_ON()
+        DCHECK_EQ(Node::kElementNode, primaryNodeType(axis));
+#endif
         if (!node->isElementNode())
             return false;
         Element& element = toElement(*node);
 
         if (name == starAtom)
             return namespaceURI.isEmpty() || namespaceURI == element.namespaceURI();
 
         if (element.document().isHTMLDocument()) {
             if (element.isHTMLElement()) {
                 // Paths without namespaces should match HTML elements in HTML
@@ skipping 83 matching lines @@
         }
         for (n = n->parentNode(); n; n = n->parentNode()) {
             if (nodeMatches(evaluationContext, n, AncestorAxis, nodeTest()))
                 nodes.append(n);
         }
         nodes.markSorted(false);
         return;
     }
 
     case FollowingSiblingAxis:
-        if (context->getNodeType() == Node::ATTRIBUTE_NODE)
+        if (context->getNodeType() == Node::kAttributeNode)
             return;
 
         for (Node* n = context->nextSibling(); n; n = n->nextSibling()) {
             if (nodeMatches(evaluationContext, n, FollowingSiblingAxis, nodeTest()))
                 nodes.append(n);
         }
         return;
 
     case PrecedingSiblingAxis:
-        if (context->getNodeType() == Node::ATTRIBUTE_NODE)
+        if (context->getNodeType() == Node::kAttributeNode)
             return;
 
         for (Node* n = context->previousSibling(); n; n = n->previousSibling()) {
             if (nodeMatches(evaluationContext, n, PrecedingSiblingAxis, nodeTest()))
                 nodes.append(n);
         }
         nodes.markSorted(false);
         return;
 
     case FollowingAxis:
@@ skipping 97 matching lines @@
         nodes.markSorted(false);
         return;
     }
     }
     ASSERT_NOT_REACHED();
 }
 
 } // namespace XPath
 
 } // namespace blink