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

third_party/WebKit/Source/core/events/TreeScopeEventContext.cpp

 /*
  * Copyright (C) 2014 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:
  * 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 34 matching lines @@
 
     // (2) If no closed shadow root in ancestors of this, include it.
     if (!containingClosedShadowTree())
         return true;
 
     // (3) If |this| is descendent of |other|, exclude if any closed shadow root in between.
     if (isDescendantOf(other))
         return !containingClosedShadowTree()->isDescendantOf(other);
 
     // (4) |this| and |other| must be in exclusive branches.
-    ASSERT(other.isExclusivePartOf(*this));
+#if DCHECK_IS_ON()
+    DCHECK(other.isExclusivePartOf(*this));
+#endif
     return false;
 }
 
 HeapVector<Member<EventTarget>>& TreeScopeEventContext::ensureEventPath(EventPath& path)
 {
     if (m_eventPath)
         return *m_eventPath;
 
     m_eventPath = new HeapVector<Member<EventTarget>>();
     LocalDOMWindow* window = path.windowEventContext().window();
@@ skipping 46 matching lines @@
     m_preOrder = orderNumber;
     m_containingClosedShadowTree = (rootNode().isShadowRoot() && !toShadowRoot(rootNode()).isOpenOrV0()) ? this : nearestAncestorClosedTreeScopeEventContext;
     for (size_t i = 0; i < m_children.size(); ++i)
         orderNumber = m_children[i]->calculateTreeOrderAndSetNearestAncestorClosedTree(orderNumber + 1, containingClosedShadowTree());
     m_postOrder = orderNumber + 1;
 
     return orderNumber + 1;
 }
 
 } // namespace blink