only call scalar finite when necessary

src/pathops/SkReduceOrder.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 "SkReduceOrder.h"
 
 int SkReduceOrder::reduce(const SkDLine& line) {
     fLine[0] = line[0];
@@ skipping 108 matching lines @@
 }
 
 // check to see if it is a quadratic or a line
 static int check_quadratic(const SkDCubic& cubic, SkDCubic& reduction) {
     double dx10 = cubic[1].fX - cubic[0].fX;
     double dx23 = cubic[2].fX - cubic[3].fX;
     double midX = cubic[0].fX + dx10 * 3 / 2;
     double sideAx = midX - cubic[3].fX;
     double sideBx = dx23 * 3 / 2;
     if (approximately_zero(sideAx) ? !approximately_equal(sideAx, sideBx)
-            : !AlmostEqualUlps(sideAx, sideBx)) {
+            : !AlmostEqualUlps_Pin(sideAx, sideBx)) {
         return 0;
     }
     double dy10 = cubic[1].fY - cubic[0].fY;
     double dy23 = cubic[2].fY - cubic[3].fY;
     double midY = cubic[0].fY + dy10 * 3 / 2;
     double sideAy = midY - cubic[3].fY;
     double sideBy = dy23 * 3 / 2;
     if (approximately_zero(sideAy) ? !approximately_equal(sideAy, sideBy)
-            : !AlmostEqualUlps(sideAy, sideBy)) {
+            : !AlmostEqualUlps_Pin(sideAy, sideBy)) {
         return 0;
     }
     reduction[0] = cubic[0];
     reduction[1].fX = midX;
     reduction[1].fY = midY;
     reduction[2] = cubic[3];
     return 3;
 }
 
 static int check_linear(const SkDCubic& cubic,
@@ skipping 122 matching lines @@
     cubic.set(a);
     SkReduceOrder reducer;
     int order = reducer.reduce(cubic, kAllow_Quadratics);
     if (order == 2 || order == 3) {  // cubic became line or quad
         for (int index = 0; index < order; ++index) {
             *reducePts++ = reducer.fQuad[index].asSkPoint();
         }
     }
     return SkPathOpsPointsToVerb(order - 1);
 }