Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 1 | /* |
| 2 | * Copyright 2019 Google LLC |
| 3 | * |
| 4 | * Use of this source code is governed by a BSD-style license that can be |
| 5 | * found in the LICENSE file. |
| 6 | */ |
| 7 | |
| 8 | #include "tests/Test.h" |
| 9 | |
| 10 | #include "src/gpu/geometry/GrQuadBuffer.h" |
| 11 | |
| 12 | #include <vector> |
| 13 | |
| 14 | #define ASSERT(cond) REPORTER_ASSERT(r, cond) |
| 15 | #define ASSERTF(cond, ...) REPORTER_ASSERT(r, cond, __VA_ARGS__) |
| 16 | #define TEST(name) DEF_TEST(GrQuadBuffer##name, r) |
| 17 | |
| 18 | struct TestData { |
| 19 | int fItem1; |
| 20 | float fItem2; |
| 21 | }; |
| 22 | |
| 23 | static void assert_quad_eq(skiatest::Reporter* r, const GrQuad& expected, const GrQuad& actual) { |
| 24 | ASSERTF(expected.quadType() == actual.quadType(), "Expected type %d, got %d", |
| 25 | (int) expected.quadType(), (int) actual.quadType()); |
| 26 | for (int i = 0; i < 4; ++i) { |
Adlai Holler | 684838f | 2020-05-12 10:41:04 -0400 | [diff] [blame] | 27 | ASSERTF(expected.x(i) == actual.x(i), "Expected x(%d) = %f, got %f", |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 28 | i, expected.x(i), actual.x(i)); |
Adlai Holler | 684838f | 2020-05-12 10:41:04 -0400 | [diff] [blame] | 29 | ASSERTF(expected.y(i) == actual.y(i), "Expected y(%d) = %f, got %f", |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 30 | i, expected.y(i), actual.y(i)); |
Adlai Holler | 684838f | 2020-05-12 10:41:04 -0400 | [diff] [blame] | 31 | ASSERTF(expected.w(i) == actual.w(i), "Expected w(%d) = %f, got %f", |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 32 | i, expected.w(i), actual.w(i)); |
| 33 | } |
| 34 | } |
| 35 | |
| 36 | static void assert_metadata_eq(skiatest::Reporter* r, const TestData& expected, |
| 37 | const TestData& actual) { |
| 38 | ASSERTF(expected.fItem1 == actual.fItem1 && expected.fItem2 == actual.fItem2, |
| 39 | "Expected { %d, %f } for metadata, got: { %d %f }", |
| 40 | expected.fItem1, expected.fItem2, actual.fItem1, actual.fItem2); |
| 41 | } |
| 42 | |
| 43 | static std::vector<GrQuad> generate_quads(float seed, int cnt, const GrQuad::Type types[]) { |
| 44 | // For convenience use matrix to derive each quad type, rely on different seed values to |
| 45 | // differentiate between quads of the same type |
| 46 | SkMatrix rotate; |
| 47 | rotate.setRotate(45.f); |
| 48 | SkMatrix skew; |
| 49 | skew.setSkew(0.5f, 0.5f); |
| 50 | SkMatrix perspective; |
| 51 | perspective.setPerspX(0.01f); |
| 52 | perspective.setPerspY(0.001f); |
| 53 | |
| 54 | std::vector<GrQuad> quads; |
| 55 | SkRect rect = SkRect::MakeXYWH(seed, 2.f * seed, 2.f * seed, seed); |
| 56 | for (int i = 0; i < cnt; ++i) { |
| 57 | GrQuad quad; |
| 58 | switch(types[i]) { |
| 59 | case GrQuad::Type::kAxisAligned: |
| 60 | quad = GrQuad(rect); |
| 61 | break; |
| 62 | case GrQuad::Type::kRectilinear: |
| 63 | quad = GrQuad::MakeFromRect(rect, rotate); |
| 64 | break; |
| 65 | case GrQuad::Type::kGeneral: |
| 66 | quad = GrQuad::MakeFromRect(rect, skew); |
| 67 | break; |
| 68 | default: |
| 69 | SkASSERT(types[i] == GrQuad::Type::kPerspective); |
| 70 | quad = GrQuad::MakeFromRect(rect, perspective); |
| 71 | break; |
| 72 | } |
| 73 | |
| 74 | SkASSERT(quad.quadType() == types[i]); // sanity check |
| 75 | quads.push_back(quad); |
| 76 | } |
| 77 | return quads; |
| 78 | } |
| 79 | |
| 80 | TEST(Append) { |
| 81 | // Generate test data, which includes all quad types out of enum-order and duplicates |
| 82 | static const int kQuadCount = 6; |
| 83 | static const GrQuad::Type kDeviceTypes[] = { |
| 84 | GrQuad::Type::kAxisAligned, GrQuad::Type::kRectilinear, GrQuad::Type::kGeneral, |
| 85 | GrQuad::Type::kPerspective, GrQuad::Type::kRectilinear, GrQuad::Type::kAxisAligned |
| 86 | }; |
| 87 | // Odd indexed quads will be ignored and not stored in the buffer |
| 88 | static const GrQuad::Type kLocalTypes[] = { |
| 89 | GrQuad::Type::kGeneral, GrQuad::Type::kGeneral, GrQuad::Type::kRectilinear, |
| 90 | GrQuad::Type::kRectilinear, GrQuad::Type::kAxisAligned, GrQuad::Type::kAxisAligned |
| 91 | }; |
| 92 | static_assert(SK_ARRAY_COUNT(kDeviceTypes) == kQuadCount, "device quad count"); |
| 93 | static_assert(SK_ARRAY_COUNT(kLocalTypes) == kQuadCount, "local quad count"); |
| 94 | |
| 95 | std::vector<GrQuad> expectedDeviceQuads = generate_quads(1.f, kQuadCount, kDeviceTypes); |
| 96 | std::vector<GrQuad> expectedLocalQuads = generate_quads(2.f, kQuadCount, kLocalTypes); |
| 97 | |
| 98 | // Fill in the buffer with the device quads, and a local quad if the index is even |
| 99 | GrQuadBuffer<TestData> buffer; |
| 100 | for (int i = 0; i < kQuadCount; ++i) { |
| 101 | buffer.append(expectedDeviceQuads[i], // device quad |
| 102 | { 2 * i, 3.f * i }, // metadata |
| 103 | i % 2 == 0 ? &expectedLocalQuads[i] : nullptr); // optional local quad |
| 104 | } |
| 105 | |
| 106 | // Confirm the state of the buffer |
| 107 | ASSERT(kQuadCount == buffer.count()); |
| 108 | ASSERT(GrQuad::Type::kPerspective == buffer.deviceQuadType()); |
| 109 | ASSERT(GrQuad::Type::kGeneral == buffer.localQuadType()); |
| 110 | |
| 111 | int i = 0; |
| 112 | auto iter = buffer.iterator(); |
| 113 | while(iter.next()) { |
| 114 | // Each entry always has the device quad |
Michael Ludwig | 704d540 | 2019-11-25 09:43:37 -0500 | [diff] [blame] | 115 | assert_quad_eq(r, expectedDeviceQuads[i], *iter.deviceQuad()); |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 116 | assert_metadata_eq(r, {2 * i, 3.f * i}, iter.metadata()); |
| 117 | |
| 118 | if (i % 2 == 0) { |
| 119 | // Confirm local quads included on even entries |
| 120 | ASSERT(iter.isLocalValid()); |
Michael Ludwig | 704d540 | 2019-11-25 09:43:37 -0500 | [diff] [blame] | 121 | assert_quad_eq(r, expectedLocalQuads[i], *iter.localQuad()); |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 122 | } else { |
| 123 | // Should not have locals |
| 124 | ASSERT(!iter.isLocalValid()); |
Michael Ludwig | 704d540 | 2019-11-25 09:43:37 -0500 | [diff] [blame] | 125 | ASSERT(!iter.localQuad()); |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 126 | } |
| 127 | |
| 128 | i++; |
| 129 | } |
| 130 | ASSERTF(i == kQuadCount, "Expected %d iterations, got: %d", kQuadCount, i); |
| 131 | } |
| 132 | |
| 133 | TEST(Concat) { |
| 134 | static const int kQuadCount = 2; |
| 135 | static const GrQuad::Type kTypesA[] = { GrQuad::Type::kAxisAligned, GrQuad::Type::kRectilinear }; |
| 136 | static const GrQuad::Type kTypesB[] = { GrQuad::Type::kGeneral, GrQuad::Type::kPerspective }; |
| 137 | static_assert(SK_ARRAY_COUNT(kTypesA) == kQuadCount, "quadsA count"); |
| 138 | static_assert(SK_ARRAY_COUNT(kTypesB) == kQuadCount, "quadsB count"); |
| 139 | |
| 140 | std::vector<GrQuad> quadsA = generate_quads(1.f, kQuadCount, kTypesA); |
| 141 | std::vector<GrQuad> quadsB = generate_quads(2.f, kQuadCount, kTypesB); |
| 142 | // Make two buffers, the first uses 'quadsA' for device quads and 'quadsB' for local quads |
| 143 | // on even indices. The second uses 'quadsB' for device quads and 'quadsA' for local quads |
| 144 | // on odd indices. |
| 145 | GrQuadBuffer<TestData> buffer1; |
| 146 | GrQuadBuffer<TestData> buffer2; |
| 147 | for (int i = 0; i < kQuadCount; ++i) { |
| 148 | buffer1.append(quadsA[i], {i, 2.f * i}, i % 2 == 0 ? &quadsB[i] : nullptr); |
| 149 | buffer2.append(quadsB[i], {2 * i, 0.5f * i}, i % 2 == 0 ? nullptr : &quadsA[i]); |
| 150 | } |
| 151 | |
| 152 | // Sanity check |
| 153 | ASSERT(kQuadCount == buffer1.count()); |
| 154 | ASSERT(kQuadCount == buffer2.count()); |
| 155 | |
| 156 | // Perform the concatenation and then confirm the new state of buffer1 |
| 157 | buffer1.concat(buffer2); |
| 158 | |
| 159 | ASSERT(2 * kQuadCount == buffer1.count()); |
| 160 | int i = 0; |
| 161 | auto iter = buffer1.iterator(); |
| 162 | while(iter.next()) { |
| 163 | if (i < kQuadCount) { |
| 164 | // First half should match original buffer1 |
Michael Ludwig | 704d540 | 2019-11-25 09:43:37 -0500 | [diff] [blame] | 165 | assert_quad_eq(r, quadsA[i], *iter.deviceQuad()); |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 166 | assert_metadata_eq(r, {i, 2.f * i}, iter.metadata()); |
| 167 | if (i % 2 == 0) { |
| 168 | ASSERT(iter.isLocalValid()); |
Michael Ludwig | 704d540 | 2019-11-25 09:43:37 -0500 | [diff] [blame] | 169 | assert_quad_eq(r, quadsB[i], *iter.localQuad()); |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 170 | } else { |
| 171 | ASSERT(!iter.isLocalValid()); |
Michael Ludwig | 704d540 | 2019-11-25 09:43:37 -0500 | [diff] [blame] | 172 | ASSERT(!iter.localQuad()); |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 173 | } |
| 174 | |
| 175 | } else { |
| 176 | // Second half should match buffer2 |
| 177 | int j = i - kQuadCount; |
Michael Ludwig | 704d540 | 2019-11-25 09:43:37 -0500 | [diff] [blame] | 178 | assert_quad_eq(r, quadsB[j], *iter.deviceQuad()); |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 179 | assert_metadata_eq(r, {2 * j, 0.5f * j}, iter.metadata()); |
| 180 | if (j % 2 == 0) { |
| 181 | ASSERT(!iter.isLocalValid()); |
Michael Ludwig | 704d540 | 2019-11-25 09:43:37 -0500 | [diff] [blame] | 182 | ASSERT(!iter.localQuad()); |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 183 | } else { |
| 184 | ASSERT(iter.isLocalValid()); |
Michael Ludwig | 704d540 | 2019-11-25 09:43:37 -0500 | [diff] [blame] | 185 | assert_quad_eq(r, quadsA[j], *iter.localQuad()); |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 186 | } |
| 187 | } |
| 188 | |
| 189 | i++; |
| 190 | } |
| 191 | ASSERTF(i == 2 * kQuadCount, "Expected %d iterations, got: %d",2 * kQuadCount, i); |
| 192 | } |
| 193 | |
| 194 | TEST(Metadata) { |
| 195 | static const int kQuadCount = 3; |
| 196 | |
| 197 | // This test doesn't really care about the quad coordinates (except that they aren't modified |
| 198 | // when mutating the metadata) |
| 199 | GrQuad quad(SkRect::MakeLTRB(1.f, 2.f, 3.f, 4.f)); |
| 200 | |
| 201 | GrQuadBuffer<TestData> buffer; |
| 202 | for (int i = 0; i < kQuadCount; ++i) { |
| 203 | buffer.append(quad, {i, 2.f * i}, i % 2 == 0 ? &quad : nullptr); |
| 204 | } |
| 205 | |
| 206 | // Iterate once using the metadata iterator, confirm the test data and rewrite |
| 207 | int i = 0; |
| 208 | auto meta = buffer.metadata(); |
| 209 | while(meta.next()) { |
| 210 | // Confirm initial state |
| 211 | assert_metadata_eq(r, {i, 2.f * i}, *meta); |
| 212 | // Rewrite |
| 213 | *meta = {2 * i, 0.5f * i}; |
| 214 | i++; |
| 215 | } |
| 216 | ASSERTF(i == kQuadCount, "Expected %d iterations, got: %d", kQuadCount, i); |
| 217 | |
| 218 | // Now that all metadata has been touched, read with regular iterator and confirm updated state |
| 219 | // and that no quad coordinates have been changed. |
| 220 | i = 0; |
| 221 | auto iter = buffer.iterator(); |
| 222 | while(iter.next()) { |
| 223 | // New metadata |
| 224 | assert_metadata_eq(r, {2 * i, 0.5f * i}, iter.metadata()); |
| 225 | |
| 226 | // Quad coordinates are unchanged |
Michael Ludwig | 704d540 | 2019-11-25 09:43:37 -0500 | [diff] [blame] | 227 | assert_quad_eq(r, quad, *iter.deviceQuad()); |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 228 | if (i % 2 == 0) { |
| 229 | ASSERT(iter.isLocalValid()); |
Michael Ludwig | 704d540 | 2019-11-25 09:43:37 -0500 | [diff] [blame] | 230 | assert_quad_eq(r, quad, *iter.localQuad()); |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 231 | } else { |
| 232 | ASSERT(!iter.isLocalValid()); |
Michael Ludwig | 704d540 | 2019-11-25 09:43:37 -0500 | [diff] [blame] | 233 | ASSERT(!iter.localQuad()); |
Michael Ludwig | 425eb45 | 2019-06-27 10:13:27 -0400 | [diff] [blame] | 234 | } |
| 235 | i++; |
| 236 | } |
| 237 | ASSERTF(i == kQuadCount, "Expected %d iterations, got: %d", kQuadCount, i); |
| 238 | } |