Replace remaining ASSERT with DCHECK/_EQ as appropriate

third_party/WebKit/Source/core/page/FrameTree.cpp

 /*
  * Copyright (C) Research In Motion Limited 2010. All rights reserved.
  * Copyright (C) 2006 Apple Computer, Inc.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
@@ skipping 199 matching lines @@
     if (frame == ancestor)
       return true;
   }
   return false;
 }
 
 DISABLE_CFI_PERF
 Frame* FrameTree::TraverseNext(const Frame* stay_within) const {
   Frame* child = FirstChild();
   if (child) {
-    ASSERT(!stay_within || child->Tree().IsDescendantOf(stay_within));
+    DCHECK(!stay_within || child->Tree().IsDescendantOf(stay_within));
     return child;
   }
 
   if (this_frame_ == stay_within)
     return nullptr;
 
   Frame* sibling = NextSibling();
   if (sibling) {
-    ASSERT(!stay_within || sibling->Tree().IsDescendantOf(stay_within));
+    DCHECK(!stay_within || sibling->Tree().IsDescendantOf(stay_within));
     return sibling;
   }
 
   Frame* frame = this_frame_;
   while (!sibling && (!stay_within || frame->Tree().Parent() != stay_within)) {
     frame = frame->Tree().Parent();
     if (!frame)
       return nullptr;
     sibling = frame->Tree().NextSibling();
   }
 
   if (frame) {
-    ASSERT(!stay_within || !sibling ||
+    DCHECK(!stay_within || !sibling ||
            sibling->Tree().IsDescendantOf(stay_within));
     return sibling;
   }
 
   return nullptr;
 }
 
 DEFINE_TRACE(FrameTree) {
   visitor->Trace(this_frame_);
 }
@@ skipping 43 matching lines @@
 void showFrameTree(const blink::Frame* frame) {
   if (!frame) {
     printf("Null input frame\n");
     return;
   }
 
   printFrames(&frame->Tree().Top(), frame, 0);
 }
 
 #endif