Replace ASSERT*() with DCHECK*() in core/events/.

third_party/WebKit/Source/core/events/EventPath.h

 /*
  * Copyright (C) 2013 Google 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:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Neither the name of Google Inc. nor the names of its
@@ skipping 38 matching lines @@
 public:
     explicit EventPath(Node&, Event* = nullptr);
 
     void initializeWith(Node&, Event*);
 
     NodeEventContext& operator[](size_t index) { return m_nodeEventContexts[index]; }
     const NodeEventContext& operator[](size_t index) const { return m_nodeEventContexts[index]; }
     NodeEventContext& at(size_t index) { return m_nodeEventContexts[index]; }
     NodeEventContext& last() { return m_nodeEventContexts[size() - 1]; }
 
-    WindowEventContext& windowEventContext() { ASSERT(m_windowEventContext); return *m_windowEventContext; }
+    WindowEventContext& windowEventContext() { DCHECK(m_windowEventContext); return *m_windowEventContext; }
     void ensureWindowEventContext();
 
     bool isEmpty() const { return m_nodeEventContexts.isEmpty(); }
     size_t size() const { return m_nodeEventContexts.size(); }
 
     void adjustForRelatedTarget(Node&, EventTarget* relatedTarget);
     void adjustForTouchEvent(TouchEvent&);
 
     static EventTarget* eventTargetRespectingTargetRules(Node&);
 
     DECLARE_TRACE();
     void clear()
     {
         m_nodeEventContexts.clear();
         m_treeScopeEventContexts.clear();
     }
 
 private:
     EventPath();
 
     void initialize();
     void calculatePath();
     void calculateAdjustedTargets();
     void calculateTreeOrderAndSetNearestAncestorClosedTree();
 
-    void shrink(size_t newSize) { ASSERT(!m_windowEventContext); m_nodeEventContexts.shrink(newSize); }
+    void shrink(size_t newSize) { DCHECK(!m_windowEventContext); m_nodeEventContexts.shrink(newSize); }
 
     void retargetRelatedTarget(const Node& relatedTargetNode);
 
     void shrinkForRelatedTarget(const Node& target, const Node& relatedTarget);
 
     void adjustTouchList(const TouchList*, HeapVector<Member<TouchList>> adjustedTouchList, const HeapVector<Member<TreeScope>>& treeScopes);
 
     using TreeScopeEventContextMap = HeapHashMap<Member<TreeScope>, Member<TreeScopeEventContext>>;
     TreeScopeEventContext* ensureTreeScopeEventContext(Node* currentTarget, TreeScope*, TreeScopeEventContextMap&);
 
     using RelatedTargetMap = HeapHashMap<Member<TreeScope>, Member<EventTarget>>;
 
     static void buildRelatedNodeMap(const Node&, RelatedTargetMap&);
     static EventTarget* findRelatedNode(TreeScope&, RelatedTargetMap&);
 
-#if ENABLE(ASSERT)
+#if DCHECK_IS_ON()
     static void checkReachability(TreeScope&, TouchList&);
 #endif
 
     const NodeEventContext& topNodeEventContext();
 
     HeapVector<NodeEventContext> m_nodeEventContexts;
     Member<Node> m_node;
     Member<Event> m_event;
     HeapVector<Member<TreeScopeEventContext>> m_treeScopeEventContexts;
     Member<WindowEventContext> m_windowEventContext;
 };
 
 } // namespace blink
 
 #endif