Removed unused parameters

src/core/SkScan_Hairline.cpp

 
 /*
  * Copyright 2006 The Android Open Source Project
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 
 #include "SkScan.h"
@@ skipping 175 matching lines @@
     blitter->blitRect(r.fLeft, r.fTop + 1, 1, height - 2);      // left
     blitter->blitRect(r.fRight - 1, r.fTop + 1, 1, height - 2); // right
     blitter->blitH(r.fLeft, r.fBottom - 1, width);              // bottom
 }
 
 ///////////////////////////////////////////////////////////////////////////////
 
 #include "SkPath.h"
 #include "SkGeometry.h"
 
-static bool quad_too_curvy(const SkPoint pts[3]) {
-    return true;
-}
-
 static int compute_int_quad_dist(const SkPoint pts[3]) {
     // compute the vector between the control point ([1]) and the middle of the
     // line connecting the start and end ([0] and [2])
     SkScalar dx = SkScalarHalf(pts[0].fX + pts[2].fX) - pts[1].fX;
     SkScalar dy = SkScalarHalf(pts[0].fY + pts[2].fY) - pts[1].fY;
     // we want everyone to be positive
     dx = SkScalarAbs(dx);
     dy = SkScalarAbs(dy);
     // convert to whole pixel values (use ceiling to be conservative)
     int idx = SkScalarCeil(dx);
     int idy = SkScalarCeil(dy);
     // use the cheap approx for distance
     if (idx > idy) {
         return idx + (idy >> 1);
     } else {
         return idy + (idx >> 1);
     }
 }
 
 static void hairquad(const SkPoint pts[3], const SkRegion* clip, SkBlitter* blitter, int level,
                      void (*lineproc)(const SkPoint&, const SkPoint&, const SkRegion* clip, SkBlitter*))
 {
 #if 1
-    if (level > 0 && quad_too_curvy(pts))
+    if (level > 0)
     {
         SkPoint tmp[5];
 
         SkChopQuadAtHalf(pts, tmp);
         hairquad(tmp, clip, blitter, level - 1, lineproc);
         hairquad(&tmp[2], clip, blitter, level - 1, lineproc);
     }
     else
         lineproc(pts[0], pts[2], clip, blitter);
 #else
     int count = 1 << level;
     const SkScalar dt = SkFixedToScalar(SK_Fixed1 >> level);
     SkScalar t = dt;
     SkPoint prevPt = pts[0];
     for (int i = 1; i < count; i++) {
         SkPoint nextPt;
         SkEvalQuadAt(pts, t, &nextPt);
         lineproc(prevPt, nextPt, clip, blitter);
         t += dt;
         prevPt = nextPt;
     }
     // draw the last line explicitly to 1.0, in case t didn't match that exactly
     lineproc(prevPt, pts[2], clip, blitter);
 #endif
 }
 
-static bool cubic_too_curvy(const SkPoint pts[4])
-{
-    return true;
-}
-
 static void haircubic(const SkPoint pts[4], const SkRegion* clip, SkBlitter* blitter, int level,
                       void (*lineproc)(const SkPoint&, const SkPoint&, const SkRegion*, SkBlitter*))
 {
-    if (level > 0 && cubic_too_curvy(pts))
+    if (level > 0)
     {
         SkPoint tmp[7];
 
         SkChopCubicAt(pts, tmp, SK_Scalar1/2);
         haircubic(tmp, clip, blitter, level - 1, lineproc);
         haircubic(&tmp[3], clip, blitter, level - 1, lineproc);
     }
     else
         lineproc(pts[0], pts[3], clip, blitter);
 }
@@ skipping 149 matching lines @@
 
         SkAAClipBlitterWrapper wrap;
         if (!clip.quickContains(ir)) {
             wrap.init(clip, blitter);
             blitter = wrap.getBlitter();
             clipRgn = &wrap.getRgn();
         }
         AntiHairLineRgn(p0, p1, clipRgn, blitter);
     }
 }