fix bugs found by computing flat clips in 800K skps

src/pathops/SkDCubicLineIntersection.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "SkIntersections.h"
 #include "SkPathOpsCubic.h"
 #include "SkPathOpsLine.h"
 
@@ skipping 243 matching lines @@
     }
 
     /* Note that this does not look for endpoints of the line that are near the cubic.
        These points are found later when check ends looks for missing points */
     void addNearEndPoints() {
         for (int cIndex = 0; cIndex < 4; cIndex += 3) {
             double cubicT = (double) (cIndex >> 1);
             if (fIntersections->hasT(cubicT)) {
                 continue;
             }
-            double lineT = fLine.nearPoint(fCubic[cIndex]);
+            double lineT = fLine.nearPoint(fCubic[cIndex], NULL);
             if (lineT < 0) {
                 continue;
             }
             fIntersections->insert(cubicT, lineT, fCubic[cIndex]);
         }
     }
 
     void addExactHorizontalEndPoints(double left, double right, double y) {
         for (int cIndex = 0; cIndex < 4; cIndex += 3) {
             double lineT = SkDLine::ExactPointH(fCubic[cIndex], left, right, y);
@@ skipping 119 matching lines @@
 }
 
 int SkIntersections::intersectRay(const SkDCubic& cubic, const SkDLine& line) {
     LineCubicIntersections c(cubic, line, this);
     fUsed = c.intersectRay(fT[0]);
     for (int index = 0; index < fUsed; ++index) {
         fPt[index] = cubic.ptAtT(fT[0][index]);
     }
     return fUsed;
 }