OLD | NEW |
1 #ifndef DMTileGridTask_DEFINED | 1 #ifndef DMQuiltTask_DEFINED |
2 #define DMTileGridTask_DEFINED | 2 #define DMQuiltTask_DEFINED |
3 | 3 |
4 #include "DMTask.h" | 4 #include "DMTask.h" |
5 #include "SkBitmap.h" | 5 #include "SkBitmap.h" |
6 #include "SkString.h" | 6 #include "SkString.h" |
7 #include "SkTemplates.h" | 7 #include "SkTemplates.h" |
8 #include "gm.h" | 8 #include "gm.h" |
9 | 9 |
10 // Records a GM through an SkPicture, draws it in tiles, and compares against th
e reference bitmap. | 10 // Records a GM through an SkPicture, draws it in tiles, and compares against th
e reference bitmap. |
11 | 11 |
12 namespace DM { | 12 namespace DM { |
13 | 13 |
14 class TileGridTask : public CpuTask { | 14 class QuiltTask : public CpuTask { |
15 | 15 |
16 public: | 16 public: |
17 TileGridTask(const Task& parent, // TileGridTask must be a child task. Pas
s its parent here. | 17 QuiltTask(const Task& parent, // QuiltTask must be a child task. Pass its
parent here. |
18 skiagm::GM*, // GM to run through a picture. Takes own
ership. | 18 skiagm::GM*, // GM to run through a picture. Takes own
ership. |
19 SkBitmap reference, // Bitmap to compare picture replay result
s to. | 19 SkBitmap reference); // Bitmap to compare picture replay result
s to. |
20 SkISize tileSize); // Tile size to use. | |
21 | 20 |
22 virtual void draw() SK_OVERRIDE; | 21 virtual void draw() SK_OVERRIDE; |
23 virtual bool shouldSkip() const SK_OVERRIDE; | 22 virtual bool shouldSkip() const SK_OVERRIDE; |
24 virtual SkString name() const SK_OVERRIDE { return fName; } | 23 virtual SkString name() const SK_OVERRIDE { return fName; } |
25 | 24 |
26 private: | 25 private: |
27 const SkString fName; | 26 const SkString fName; |
28 SkAutoTDelete<skiagm::GM> fGM; | 27 SkAutoTDelete<skiagm::GM> fGM; |
29 const SkBitmap fReference; | 28 const SkBitmap fReference; |
30 const SkISize fTileSize; | |
31 }; | 29 }; |
32 | 30 |
33 } // namespace DM | 31 } // namespace DM |
34 | 32 |
35 #endif // DMReplayTask_DEFINED | 33 #endif // DMReplayTask_DEFINED |
OLD | NEW |