| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright 2014 Google Inc. | 2 * Copyright 2014 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 "Test.h" | 8 #include "Test.h" |
| 9 #include "RecordTestUtils.h" | 9 #include "RecordTestUtils.h" |
| 10 | 10 |
| (...skipping 105 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 116 setMatrix = assert_type<SkRecords::SetMatrix>(r, translateRecord, 0); | 116 setMatrix = assert_type<SkRecords::SetMatrix>(r, translateRecord, 0); |
| 117 REPORTER_ASSERT(r, setMatrix->matrix == translate); | 117 REPORTER_ASSERT(r, setMatrix->matrix == translate); |
| 118 | 118 |
| 119 setMatrix = assert_type<SkRecords::SetMatrix>(r, translateRecord, 2); | 119 setMatrix = assert_type<SkRecords::SetMatrix>(r, translateRecord, 2); |
| 120 SkMatrix expected = scale; | 120 SkMatrix expected = scale; |
| 121 expected.postConcat(translate); | 121 expected.postConcat(translate); |
| 122 REPORTER_ASSERT(r, setMatrix->matrix == expected); | 122 REPORTER_ASSERT(r, setMatrix->matrix == expected); |
| 123 } | 123 } |
| 124 | 124 |
| 125 struct TestBBH : public SkBBoxHierarchy { | 125 struct TestBBH : public SkBBoxHierarchy { |
| 126 void insert(SkAutoTMalloc<SkRect>* boundsArray, int N) SK_OVERRIDE { | 126 void insert(const SkRect boundsArray[], int N) SK_OVERRIDE { |
| 127 fEntries.setCount(N); | 127 fEntries.setCount(N); |
| 128 for (int i = 0; i < N; i++) { | 128 for (int i = 0; i < N; i++) { |
| 129 Entry e = { (unsigned)i, (*boundsArray)[i] }; | 129 Entry e = { (unsigned)i, boundsArray[i] }; |
| 130 fEntries[i] = e; | 130 fEntries[i] = e; |
| 131 } | 131 } |
| 132 } | 132 } |
| 133 | 133 |
| 134 void search(const SkRect& query, SkTDArray<unsigned>* results) const SK_OVER
RIDE {} | 134 void search(const SkRect& query, SkTDArray<unsigned>* results) const SK_OVER
RIDE {} |
| 135 size_t bytesUsed() const SK_OVERRIDE { return 0; } | 135 size_t bytesUsed() const SK_OVERRIDE { return 0; } |
| 136 | 136 |
| 137 struct Entry { | 137 struct Entry { |
| 138 unsigned opIndex; | 138 unsigned opIndex; |
| 139 SkRect bounds; | 139 SkRect bounds; |
| (...skipping 183 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 323 | 323 |
| 324 { | 324 { |
| 325 SkRecord record; | 325 SkRecord record; |
| 326 SkRecorder recorder(&record, 10, 10); | 326 SkRecorder recorder(&record, 10, 10); |
| 327 recorder.drawImageRect(image, 0, SkRect::MakeWH(10, 10)); | 327 recorder.drawImageRect(image, 0, SkRect::MakeWH(10, 10)); |
| 328 SkRecordDraw(record, &canvas, NULL, NULL, 0, NULL, 0); | 328 SkRecordDraw(record, &canvas, NULL, NULL, 0, NULL, 0); |
| 329 } | 329 } |
| 330 REPORTER_ASSERT(r, canvas.fDrawImageRectCalled); | 330 REPORTER_ASSERT(r, canvas.fDrawImageRectCalled); |
| 331 | 331 |
| 332 } | 332 } |
| OLD | NEW |