cc: Switch to Chromium DCHECKs LOGs

cc/math_util.cc

 // Copyright 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "config.h"
 
 #include "CCMathUtil.h"
 
 #include "FloatPoint.h"
 #include "FloatQuad.h"
@@ skipping 48 matching lines @@
     //    p = (1-t) h1 + (t) h2
     //
     // We want to compute point p such that p.w == epsilon, where epsilon is a small
     // non-zero number. (but the smaller the number is, the higher the risk of overflow)
     // To do this, we solve for t in the following equation:
     //    p.w = epsilon = (1-t) * h1.w + (t) * h2.w
     //
     // Once paramter t is known, the rest of p can be computed via p = (1-t) h1 + (t) h2.
 
     // Technically this is a special case of the following assertion, but its a good idea to keep it an explicit sanity check here.
-    ASSERT(h2.w != h1.w);
+    DCHECK(h2.w != h1.w);
     // Exactly one of h1 or h2 (but not both) must be on the negative side of the w plane when this is called.
-    ASSERT(h1.shouldBeClipped() ^ h2.shouldBeClipped());
+    DCHECK(h1.shouldBeClipped() ^ h2.shouldBeClipped());
 
     double w = 0.00001; // or any positive non-zero small epsilon
 
     double t = (w - h1.w) / (h2.w - h1.w);
 
     double x = (1-t) * h1.x + t * h2.x;
     double y = (1-t) * h1.y + t * h2.y;
     double z = (1-t) * h1.z + t * h2.z;
 
     return HomogeneousCoordinate(x, y, z, w);
@@ skipping 76 matching lines @@
 
     if (h3.shouldBeClipped() ^ h4.shouldBeClipped())
         addVertexToClippedQuad(computeClippedPointForEdge(h3, h4).cartesianPoint2d(), clippedQuad, numVerticesInClippedQuad);
 
     if (!h4.shouldBeClipped())
         addVertexToClippedQuad(h4.cartesianPoint2d(), clippedQuad, numVerticesInClippedQuad);
 
     if (h4.shouldBeClipped() ^ h1.shouldBeClipped())
         addVertexToClippedQuad(computeClippedPointForEdge(h4, h1).cartesianPoint2d(), clippedQuad, numVerticesInClippedQuad);
 
-    ASSERT(numVerticesInClippedQuad <= 8);
+    DCHECK(numVerticesInClippedQuad <= 8);
 }
 
 FloatRect CCMathUtil::computeEnclosingRectOfVertices(FloatPoint vertices[], int numVertices)
 {
     if (numVertices < 2)
         return FloatRect();
 
     float xmin = std::numeric_limits<float>::max();
     float xmax = -std::numeric_limits<float>::max();
     float ymin = std::numeric_limits<float>::max();
@@ skipping 191 matching lines @@
 }
 
 FloatSize CCMathUtil::projectVector(const FloatSize& source, const FloatSize& destination)
 {
     float sourceDotDestination = source.width() * destination.width() + source.height() * destination.height();
     float projectedLength = sourceDotDestination / destination.diagonalLengthSquared();
     return FloatSize(projectedLength * destination.width(), projectedLength * destination.height());
 }
 
 } // namespace cc