Start to vectorize SkTileGrid.

src/core/SkTileGrid.h

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkTileGrid_DEFINED
 #define SkTileGrid_DEFINED
 
+#include "Sk4x.h"
 #include "SkBBHFactory.h"
 #include "SkBBoxHierarchy.h"
 
 /**
  * Subclass of SkBBoxHierarchy that stores elements in buckets that correspond
  * to tile regions, disposed in a regular grid.  This is useful when the tile
  * structure that will be use in search() calls is known prior to insertion.
  */
 class SkTileGrid : public SkBBoxHierarchy {
 public:
@@ skipping 15 matching lines @@
      */
     virtual void search(const SkRect& query, SkTDArray<unsigned>* results) const SK_OVERRIDE;
 
     // For testing.
     int tileCount(int x, int y) { return fTiles[y * fXTiles + x].count(); }
 
     virtual void reserve(unsigned opCount) SK_OVERRIDE;
     virtual void flushDeferredInserts() SK_OVERRIDE;
 
 private:
-    void commonAdjust(SkRect*) const;
-    void userToGrid(const SkRect&, SkIRect* grid) const;
+    void userToGrid(const Sk4f&, SkIRect*) const;
+    bool intersectsGrid(const Sk4f&) const;
 
-    const int fXTiles, fYTiles;
-    const SkScalar fInvWidth, fInvHeight;
-    const SkScalar fMarginWidth, fMarginHeight;
-    const SkPoint fOffset;
-    const SkRect  fGridBounds;
+    const int fXTiles,    // Number of tiles in a single row.
+              fNumTiles;  // Total number of tiles.
 
-    // (fXTiles * fYTiles) SkTDArrays, each listing ops overlapping that tile in order.
+    const SkRect fGridBounds;  // Only used for intersectsGrid().  Remove if that's removed.
+    const Sk4f fMargin, fOffset, fUserToGrid, fGridHigh;
+
+    // fNumTiles SkTDArrays, each listing ops overlapping that tile in order.
     SkTDArray<unsigned>* fTiles;
 
     typedef SkBBoxHierarchy INHERITED;
 };
 
 #endif