move SkPath direction-as-computed into SkPathPriv

gm/convex_all_line_paths.cpp

 /*
  * Copyright 2015 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "gm.h"
+#include "SkPathPriv.h"
 
 static void create_ngon(int n, SkPoint* pts, SkScalar width, SkScalar height) {
     float angleStep = 360.0f / n, angle = 0.0f, sin, cos;
     if ((n % 2) == 1) {
         angle = angleStep/2.0f;
     }
 
     for (int i = 0; i < n; ++i) {
         sin = SkScalarSinCos(SkDegreesToRadians(angle), &cos);
         pts[i].fX = -sin * width;
@@ skipping 211 matching lines @@
             }
         }
 
         path.close();
 #ifdef SK_DEBUG
         // Each path this method returns should be convex, only composed of
         // lines, wound the right direction, and short enough to fit in one
         // of the GMs rows.
         SkASSERT(path.isConvex());
         SkASSERT(SkPath::kLine_SegmentMask == path.getSegmentMasks());
-        SkPath::Direction actualDir;
-        SkASSERT(path.cheapComputeDirection(&actualDir));
-        SkASSERT(dir == actualDir);
+        SkPathPriv::FirstDirection actualDir;
+        SkASSERT(SkPathPriv::CheapComputeFirstDirection(path, &actualDir));
+        SkASSERT(SkPathPriv::AsFirstDirection(dir) == actualDir);
         SkRect bounds = path.getBounds();
         SkASSERT(SkScalarNearlyEqual(bounds.centerX(), 0.0f));
         SkASSERT(bounds.height() <= kMaxPathHeight);
 #endif
         return path;
     }
 
     // Draw a single path several times, shrinking it, flipping its direction
     // and changing its start vertex each time.
     void drawPath(SkCanvas* canvas, int index, SkPoint* offset) {
@@ skipping 59 matching lines @@
     static const int kGMHeight      = 512;
 
     typedef GM INHERITED;
 };
 
 //////////////////////////////////////////////////////////////////////////////
 
 DEF_GM( return SkNEW(ConvexLineOnlyPathsGM); )
 
 }