| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright 2012 Google Inc. | 2 * Copyright 2012 Google Inc. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
| 5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
| 6 */ | 6 */ |
| 7 | 7 |
| 8 #include "SkTileGrid.h" | 8 #include "SkTileGrid.h" |
| 9 | 9 |
| 10 SkTileGrid::SkTileGrid(int xTiles, int yTiles, const SkTileGridFactory::TileGrid
Info& info) | 10 SkTileGrid::SkTileGrid(int xTiles, int yTiles, const SkTileGridFactory::TileGrid
Info& info) |
| (...skipping 157 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 168 // We did find an earliest op. Output it, and step forward every tile th
at contains it. | 168 // We did find an earliest op. Output it, and step forward every tile th
at contains it. |
| 169 results->push(earliest); | 169 results->push(earliest); |
| 170 for (int i = 0; i < starts.count(); i++) { | 170 for (int i = 0; i < starts.count(); i++) { |
| 171 if (starts[i] < ends[i] && *starts[i] == earliest) { | 171 if (starts[i] < ends[i] && *starts[i] == earliest) { |
| 172 starts[i]++; | 172 starts[i]++; |
| 173 } | 173 } |
| 174 } | 174 } |
| 175 } | 175 } |
| 176 } | 176 } |
| 177 | 177 |
| 178 size_t SkTileGrid::bytesUsed() const { |
| 179 size_t byteCount = sizeof(SkTileGrid); |
| 180 |
| 181 size_t opCount = 0; |
| 182 for (int i = 0; i < fXTiles * fYTiles; i++) { |
| 183 opCount += fTiles[i].reserved(); |
| 184 } |
| 185 byteCount += opCount * sizeof(unsigned); |
| 186 |
| 187 return byteCount; |
| 188 } |
| OLD | NEW |