Use the unswapped end point y for early out case in winding_line

src/core/SkPath.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 "SkBuffer.h"
 #include "SkCubicClipper.h"
 #include "SkErrorInternals.h"
@@ skipping 2826 matching lines @@
     SkScalar dy = y1 - y0;
 
     int dir = 1;
     if (y0 > y1) {
         SkTSwap(y0, y1);
         dir = -1;
     }
     if (y < y0 || y > y1) {
         return 0;
     }
-    if (y == y1) {
+    if (y == pts[1].fY) {
         if (y0 == y1 && between(x0, x, x1) && x != x1) {  // check if on horizontal line
             *onCurveCount += 1;
         }
         return 0;
     }
     SkScalar cross = SkScalarMul(x1 - x0, y - pts[0].fY) - SkScalarMul(dy, x - x0);
 
     if (!cross) {
-        if (x != x1 || y != pts[1].fY) { // don't test end points since they're also start points
-            *onCurveCount += 1;   // zero cross means the point is on the line
-        }
+        // zero cross means the point is on the line, and since the case where
+        // y of the query point is at the end point is handled above, we can be
+        // sure that we're on the line (excluding the end point) here
+        *onCurveCount += 1;
         dir = 0;
     } else if (SkScalarSignAsInt(cross) == dir) {
         dir = 0;
     }
     return dir;
 }
 
 static void tangent_cubic(const SkPoint pts[], SkScalar x, SkScalar y,
         SkTDArray<SkVector>* tangents) {
     if (!between(pts[0].fY, y, pts[1].fY) && !between(pts[1].fY, y, pts[2].fY)
@@ skipping 197 matching lines @@
         }
     } while (!done);
     return SkToBool(tangents.count()) ^ isInverse;
 }
 
 int SkPath::ConvertConicToQuads(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2,
                                 SkScalar w, SkPoint pts[], int pow2) {
     const SkConic conic(p0, p1, p2, w);
     return conic.chopIntoQuadsPOW2(pts, pow2);
 }