move more geometry to simd

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"
 #include "SkBlitter.h"
 #include "SkRasterClip.h"
@@ skipping 200 matching lines @@
         return idx + (idy >> 1);
     } else {
         return idy + (idx >> 1);
     }
 }
 
 static void hairquad(const SkPoint pts[3], const SkRegion* clip,
                      SkBlitter* blitter, int level, SkScan::HairRgnProc lineproc) {
     SkASSERT(level <= kMaxQuadSubdivideLevel);
 
-    SkPoint coeff[3];
-    SkQuadToCoeff(pts, coeff);
+    SkQuadCoeff coeff(pts);
 
     const int lines = 1 << level;
     Sk2s t(0);
     Sk2s dt(SK_Scalar1 / lines);
 
     SkPoint tmp[(1 << kMaxQuadSubdivideLevel) + 1];
     SkASSERT((unsigned)lines < SK_ARRAY_COUNT(tmp));
 
     tmp[0] = pts[0];
-    Sk2s A = Sk2s::Load(&coeff[0].fX);
-    Sk2s B = Sk2s::Load(&coeff[1].fX);
-    Sk2s C = Sk2s::Load(&coeff[2].fX);
+    Sk2s A = coeff.fA;
+    Sk2s B = coeff.fB;
+    Sk2s C = coeff.fC;
     for (int i = 1; i < lines; ++i) {
         t = t + dt;
         ((A * t + B) * t + C).store(&tmp[i].fX);
     }
     tmp[lines] = pts[2];
     lineproc(tmp, lines + 1, clip, blitter);
 }
 
 static inline Sk2s abs(const Sk2s& value) {
     return Sk2s::Max(value, Sk2s(0)-value);
@@ skipping 44 matching lines @@
 static void hair_cubic(const SkPoint pts[4], const SkRegion* clip, SkBlitter* blitter,
                        SkScan::HairRgnProc lineproc) {
     const int lines = compute_cubic_segs(pts);
     SkASSERT(lines > 0);
     if (1 == lines) {
         SkPoint tmp[2] = { pts[0], pts[3] };
         lineproc(tmp, 2, clip, blitter);
         return;
     }
 
-    SkPoint coeff[4];
-    SkCubicToCoeff(pts, coeff);
+    SkCubicCoeff coeff(pts);
 
     const Sk2s dt(SK_Scalar1 / lines);
     Sk2s t(0);
 
     SkPoint tmp[(1 << kMaxCubicSubdivideLevel) + 1];
     SkASSERT((unsigned)lines < SK_ARRAY_COUNT(tmp));
 
     tmp[0] = pts[0];
-    Sk2s A = Sk2s::Load(&coeff[0].fX);
-    Sk2s B = Sk2s::Load(&coeff[1].fX);
-    Sk2s C = Sk2s::Load(&coeff[2].fX);
-    Sk2s D = Sk2s::Load(&coeff[3].fX);
+    Sk2s A = coeff.fA;
+    Sk2s B = coeff.fB;
+    Sk2s C = coeff.fC;
+    Sk2s D = coeff.fD;
     for (int i = 1; i < lines; ++i) {
         t = t + dt;
         (((A * t + B) * t + C) * t + D).store(&tmp[i].fX);
     }
     tmp[lines] = pts[3];
     lineproc(tmp, lines + 1, clip, blitter);
 }
 
 static SkRect compute_nocheck_cubic_bounds(const SkPoint pts[4]) {
     SkASSERT(SkScalarsAreFinite(&pts[0].fX, 8));
@@ skipping 358 matching lines @@
 
         SkAAClipBlitterWrapper wrap;
         if (!clip.quickContains(r.roundOut().makeOutset(1, 1))) {
             wrap.init(clip, blitter);
             blitter = wrap.getBlitter();
             clipRgn = &wrap.getRgn();
         }
         AntiHairLineRgn(pts, count, clipRgn, blitter);
     }
 }