Swap iteration order in TileGrid::insert().

src/core/SkTileGrid.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 "SkTileGrid.h"
 
 SkTileGrid::SkTileGrid(int xTiles, int yTiles, const SkTileGridFactory::TileGridInfo& info)
@@ skipping 34 matching lines @@
     // Note: SkIRects are non-inclusive of the right() column and bottom() row,
     // hence the "-1"s in the computations of maxX and maxY.
     int minX = SkMax32(0, SkMin32(dilatedBounds.left() / fInfo.fTileInterval.width(), fXTiles - 1));
     int minY = SkMax32(0, SkMin32(dilatedBounds.top() / fInfo.fTileInterval.height(), fYTiles - 1));
     int maxX = SkMax32(0, SkMin32((dilatedBounds.right()  - 1) / fInfo.fTileInterval.width(),
                                   fXTiles - 1));
     int maxY = SkMax32(0, SkMin32((dilatedBounds.bottom() - 1) / fInfo.fTileInterval.height(),
                                   fYTiles - 1));
 
     Entry entry = { fCount++, data };
-    for (int x = minX; x <= maxX; x++) {
-        for (int y = minY; y <= maxY; y++) {
+    for (int y = minY; y <= maxY; y++) {
+        for (int x = minX; x <= maxX; x++) {
             fTiles[y * fXTiles + x].push(entry);
         }
     }
 }
 
 static int divide_ceil(int x, int y) {
     return (x + y - 1) / y;
 }
 
 // Number of tiles for which data is allocated on the stack in
@@ skipping 93 matching lines @@
 }
 
 void SkTileGrid::rewindInserts() {
     SkASSERT(fClient);
     for (int i = 0; i < fXTiles * fYTiles; i++) {
         while (!fTiles[i].isEmpty() && fClient->shouldRewind(fTiles[i].top().data)) {
             fTiles[i].pop();
         }
     }
 }