Chromium Code Reviews| 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 for (int i = 0; i < fXTiles * fYTiles; i++) { | |
|
chrishtr
2014/11/17 21:34:21
Will this be slow? Overall, what asymptotic runtim
tomhudson
2014/11/17 22:12:15
If the tile grid just spans a screen on the Nexus
| |
| 182 byteCount = fTiles[i].reserved() * sizeof(unsigned); | |
|
mtklein
2014/11/17 23:15:33
I think you want += here?
While you're at it, can
| |
| 183 } | |
| 184 | |
| 185 return byteCount; | |
| 186 } | |
| OLD | NEW |