blob: d6e994cb652740cb446384b3fb3e17923bb8fd2e [file] [log] [blame]
epoger@google.comec3ed6a2011-07-28 14:26:00 +00001/*
2 * Copyright 2011 Google Inc.
3 *
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
6 */
tfarina@chromium.orge4fafb12013-12-12 21:11:12 +00007
reed@google.com8d0b5772011-06-24 13:07:31 +00008#include "SkData.h"
reed@google.com8c5c7a92013-04-19 20:16:01 +00009#include "SkDataTable.h"
tfarina@chromium.org8f6884a2014-01-24 20:56:26 +000010#include "SkOSFile.h"
Ben Wagnerbf111d72016-11-07 18:05:29 -050011#include "SkOSPath.h"
commit-bot@chromium.org8b0e8ac2014-01-30 18:58:24 +000012#include "SkReadBuffer.h"
13#include "SkWriteBuffer.h"
bungeman@google.com11c9a552013-06-03 17:10:35 +000014#include "SkStream.h"
tfarina@chromium.org8f6884a2014-01-24 20:56:26 +000015#include "Test.h"
reed@google.com91bd4592012-07-11 17:24:49 +000016
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000017static void test_is_equal(skiatest::Reporter* reporter,
18 const SkDataTable* a, const SkDataTable* b) {
19 REPORTER_ASSERT(reporter, a->count() == b->count());
20 for (int i = 0; i < a->count(); ++i) {
21 size_t sizea, sizeb;
22 const void* mema = a->at(i, &sizea);
23 const void* memb = b->at(i, &sizeb);
24 REPORTER_ASSERT(reporter, sizea == sizeb);
25 REPORTER_ASSERT(reporter, !memcmp(mema, memb, sizea));
26 }
27}
28
bungemanfeb3c1a2016-08-05 06:51:50 -070029static void test_datatable_is_empty(skiatest::Reporter* reporter, SkDataTable* table) {
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000030 REPORTER_ASSERT(reporter, table->isEmpty());
31 REPORTER_ASSERT(reporter, 0 == table->count());
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000032}
33
34static void test_emptytable(skiatest::Reporter* reporter) {
bungemanfeb3c1a2016-08-05 06:51:50 -070035 sk_sp<SkDataTable> table0(SkDataTable::MakeEmpty());
36 sk_sp<SkDataTable> table1(SkDataTable::MakeCopyArrays(nullptr, nullptr, 0));
37 sk_sp<SkDataTable> table2(SkDataTable::MakeCopyArray(nullptr, 0, 0));
38 sk_sp<SkDataTable> table3(SkDataTable::MakeArrayProc(nullptr, 0, 0, nullptr, nullptr));
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000039
bungemanfeb3c1a2016-08-05 06:51:50 -070040 test_datatable_is_empty(reporter, table0.get());
41 test_datatable_is_empty(reporter, table1.get());
42 test_datatable_is_empty(reporter, table2.get());
43 test_datatable_is_empty(reporter, table3.get());
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000044
bungemanfeb3c1a2016-08-05 06:51:50 -070045 test_is_equal(reporter, table0.get(), table1.get());
46 test_is_equal(reporter, table0.get(), table2.get());
47 test_is_equal(reporter, table0.get(), table3.get());
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000048}
49
reed@google.com8c5c7a92013-04-19 20:16:01 +000050static void test_simpletable(skiatest::Reporter* reporter) {
51 const int idata[] = { 1, 4, 9, 16, 25, 63 };
52 int icount = SK_ARRAY_COUNT(idata);
bungemanfeb3c1a2016-08-05 06:51:50 -070053 sk_sp<SkDataTable> itable(SkDataTable::MakeCopyArray(idata, sizeof(idata[0]), icount));
reed@google.com8c5c7a92013-04-19 20:16:01 +000054 REPORTER_ASSERT(reporter, itable->count() == icount);
55 for (int i = 0; i < icount; ++i) {
56 size_t size;
57 REPORTER_ASSERT(reporter, sizeof(int) == itable->atSize(i));
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000058 REPORTER_ASSERT(reporter, *itable->atT<int>(i, &size) == idata[i]);
reed@google.com8c5c7a92013-04-19 20:16:01 +000059 REPORTER_ASSERT(reporter, sizeof(int) == size);
60 }
61}
62
63static void test_vartable(skiatest::Reporter* reporter) {
64 const char* str[] = {
65 "", "a", "be", "see", "deigh", "ef", "ggggggggggggggggggggggggggg"
66 };
67 int count = SK_ARRAY_COUNT(str);
68 size_t sizes[SK_ARRAY_COUNT(str)];
69 for (int i = 0; i < count; ++i) {
70 sizes[i] = strlen(str[i]) + 1;
71 }
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000072
bungemanfeb3c1a2016-08-05 06:51:50 -070073 sk_sp<SkDataTable> table(SkDataTable::MakeCopyArrays((const void*const*)str, sizes, count));
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000074
reed@google.com8c5c7a92013-04-19 20:16:01 +000075 REPORTER_ASSERT(reporter, table->count() == count);
76 for (int i = 0; i < count; ++i) {
77 size_t size;
78 REPORTER_ASSERT(reporter, table->atSize(i) == sizes[i]);
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000079 REPORTER_ASSERT(reporter, !strcmp(table->atT<const char>(i, &size),
reed@google.com8c5c7a92013-04-19 20:16:01 +000080 str[i]));
81 REPORTER_ASSERT(reporter, size == sizes[i]);
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000082
reed@google.com8c5c7a92013-04-19 20:16:01 +000083 const char* s = table->atStr(i);
84 REPORTER_ASSERT(reporter, strlen(s) == strlen(str[i]));
85 }
86}
87
88static void test_tablebuilder(skiatest::Reporter* reporter) {
89 const char* str[] = {
90 "", "a", "be", "see", "deigh", "ef", "ggggggggggggggggggggggggggg"
91 };
92 int count = SK_ARRAY_COUNT(str);
93
94 SkDataTableBuilder builder(16);
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000095
reed@google.com8c5c7a92013-04-19 20:16:01 +000096 for (int i = 0; i < count; ++i) {
97 builder.append(str[i], strlen(str[i]) + 1);
98 }
bungemanfeb3c1a2016-08-05 06:51:50 -070099 sk_sp<SkDataTable> table(builder.detachDataTable());
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +0000100
reed@google.com8c5c7a92013-04-19 20:16:01 +0000101 REPORTER_ASSERT(reporter, table->count() == count);
102 for (int i = 0; i < count; ++i) {
103 size_t size;
104 REPORTER_ASSERT(reporter, table->atSize(i) == strlen(str[i]) + 1);
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000105 REPORTER_ASSERT(reporter, !strcmp(table->atT<const char>(i, &size),
reed@google.com8c5c7a92013-04-19 20:16:01 +0000106 str[i]));
107 REPORTER_ASSERT(reporter, size == strlen(str[i]) + 1);
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +0000108
reed@google.com8c5c7a92013-04-19 20:16:01 +0000109 const char* s = table->atStr(i);
110 REPORTER_ASSERT(reporter, strlen(s) == strlen(str[i]));
111 }
112}
113
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000114static void test_globaltable(skiatest::Reporter* reporter) {
115 static const int gData[] = {
116 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
117 };
118 int count = SK_ARRAY_COUNT(gData);
119
bungemanfeb3c1a2016-08-05 06:51:50 -0700120 sk_sp<SkDataTable> table(
121 SkDataTable::MakeArrayProc(gData, sizeof(gData[0]), count, nullptr, nullptr));
rmistry@google.comc9f3b382013-04-22 12:45:30 +0000122
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000123 REPORTER_ASSERT(reporter, table->count() == count);
124 for (int i = 0; i < count; ++i) {
125 size_t size;
126 REPORTER_ASSERT(reporter, table->atSize(i) == sizeof(int));
127 REPORTER_ASSERT(reporter, *table->atT<const char>(i, &size) == i);
128 REPORTER_ASSERT(reporter, sizeof(int) == size);
129 }
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000130}
131
tfarina@chromium.orge4fafb12013-12-12 21:11:12 +0000132DEF_TEST(DataTable, reporter) {
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000133 test_emptytable(reporter);
reed@google.com8c5c7a92013-04-19 20:16:01 +0000134 test_simpletable(reporter);
135 test_vartable(reporter);
136 test_tablebuilder(reporter);
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000137 test_globaltable(reporter);
reed@google.com8c5c7a92013-04-19 20:16:01 +0000138}
139
reed@google.com1622c992011-06-14 19:22:21 +0000140static void* gGlobal;
141
reed6b7f34e2015-06-17 09:58:24 -0700142static void delete_int_proc(const void* ptr, void* context) {
reed@google.com1622c992011-06-14 19:22:21 +0000143 int* data = (int*)ptr;
144 SkASSERT(context == gGlobal);
145 delete[] data;
146}
147
bungeman38d909e2016-08-02 14:40:46 -0700148static void assert_len(skiatest::Reporter* reporter, const sk_sp<SkData>& ref, size_t len) {
reed@google.com1622c992011-06-14 19:22:21 +0000149 REPORTER_ASSERT(reporter, ref->size() == len);
150}
151
bungeman38d909e2016-08-02 14:40:46 -0700152static void assert_data(skiatest::Reporter* reporter, const sk_sp<SkData>& ref,
reed@google.com1622c992011-06-14 19:22:21 +0000153 const void* data, size_t len) {
154 REPORTER_ASSERT(reporter, ref->size() == len);
155 REPORTER_ASSERT(reporter, !memcmp(ref->data(), data, len));
156}
157
reed@google.comdbc936d2012-06-28 15:40:09 +0000158static void test_cstring(skiatest::Reporter* reporter) {
159 const char str[] = "Hello world";
160 size_t len = strlen(str);
161
bungeman38d909e2016-08-02 14:40:46 -0700162 sk_sp<SkData> r0(SkData::MakeWithCopy(str, len + 1));
163 sk_sp<SkData> r1(SkData::MakeWithCString(str));
reed@google.comdbc936d2012-06-28 15:40:09 +0000164
bungeman38d909e2016-08-02 14:40:46 -0700165 REPORTER_ASSERT(reporter, r0->equals(r1.get()));
reed@google.comdbc936d2012-06-28 15:40:09 +0000166
bungeman38d909e2016-08-02 14:40:46 -0700167 sk_sp<SkData> r2(SkData::MakeWithCString(nullptr));
reed@google.coma63a8512012-07-02 20:29:00 +0000168 REPORTER_ASSERT(reporter, 1 == r2->size());
169 REPORTER_ASSERT(reporter, 0 == *r2->bytes());
reed@google.comdbc936d2012-06-28 15:40:09 +0000170}
171
bungeman@google.com11c9a552013-06-03 17:10:35 +0000172static void test_files(skiatest::Reporter* reporter) {
halcanary87f3ba42015-01-20 09:30:20 -0800173 SkString tmpDir = skiatest::GetTmpDir();
scroggo@google.com99d43ff2013-06-07 14:30:36 +0000174 if (tmpDir.isEmpty()) {
bungeman@google.com11c9a552013-06-03 17:10:35 +0000175 return;
176 }
skia.committer@gmail.com11f2b442013-06-04 07:00:53 +0000177
tfarinaa8e2e152014-07-28 19:26:58 -0700178 SkString path = SkOSPath::Join(tmpDir.c_str(), "data_test");
skia.committer@gmail.com11f2b442013-06-04 07:00:53 +0000179
bungeman@google.com11c9a552013-06-03 17:10:35 +0000180 const char s[] = "abcdefghijklmnopqrstuvwxyz";
181 {
182 SkFILEWStream writer(path.c_str());
183 if (!writer.isValid()) {
halcanary@google.coma9325fa2014-01-10 14:58:10 +0000184 ERRORF(reporter, "Failed to create tmp file %s\n", path.c_str());
bungeman@google.com11c9a552013-06-03 17:10:35 +0000185 return;
186 }
187 writer.write(s, 26);
188 }
189
halcanaryd76be9c2015-11-20 13:47:49 -0800190 FILE* file = sk_fopen(path.c_str(), kRead_SkFILE_Flag);
bungeman38d909e2016-08-02 14:40:46 -0700191 sk_sp<SkData> r1(SkData::MakeFromFILE(file));
halcanary96fcdcc2015-08-27 07:41:13 -0700192 REPORTER_ASSERT(reporter, r1.get() != nullptr);
bungeman@google.com11c9a552013-06-03 17:10:35 +0000193 REPORTER_ASSERT(reporter, r1->size() == 26);
194 REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r1->data()), s, 26) == 0);
skia.committer@gmail.com11f2b442013-06-04 07:00:53 +0000195
bungeman@google.com11c9a552013-06-03 17:10:35 +0000196 int fd = sk_fileno(file);
bungeman38d909e2016-08-02 14:40:46 -0700197 sk_sp<SkData> r2(SkData::MakeFromFD(fd));
halcanary96fcdcc2015-08-27 07:41:13 -0700198 REPORTER_ASSERT(reporter, r2.get() != nullptr);
bungeman@google.com11c9a552013-06-03 17:10:35 +0000199 REPORTER_ASSERT(reporter, r2->size() == 26);
200 REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r2->data()), s, 26) == 0);
201}
202
tfarina@chromium.orge4fafb12013-12-12 21:11:12 +0000203DEF_TEST(Data, reporter) {
reed@google.com1622c992011-06-14 19:22:21 +0000204 const char* str = "We the people, in order to form a more perfect union.";
205 const int N = 10;
206
bungeman38d909e2016-08-02 14:40:46 -0700207 sk_sp<SkData> r0(SkData::MakeEmpty());
208 sk_sp<SkData> r1(SkData::MakeWithCopy(str, strlen(str)));
209 sk_sp<SkData> r2(SkData::MakeWithProc(new int[N], N*sizeof(int), delete_int_proc, gGlobal));
210 sk_sp<SkData> r3(SkData::MakeSubset(r1.get(), 7, 6));
reed@google.com1622c992011-06-14 19:22:21 +0000211
reed@google.com1622c992011-06-14 19:22:21 +0000212 assert_len(reporter, r0, 0);
213 assert_len(reporter, r1, strlen(str));
214 assert_len(reporter, r2, N * sizeof(int));
215 assert_len(reporter, r3, 6);
rmistry@google.comd6176b02012-08-23 18:14:13 +0000216
reed@google.com1622c992011-06-14 19:22:21 +0000217 assert_data(reporter, r1, str, strlen(str));
218 assert_data(reporter, r3, "people", 6);
219
bungeman38d909e2016-08-02 14:40:46 -0700220 sk_sp<SkData> tmp(SkData::MakeSubset(r1.get(), strlen(str), 10));
reed@google.com1622c992011-06-14 19:22:21 +0000221 assert_len(reporter, tmp, 0);
bungeman38d909e2016-08-02 14:40:46 -0700222 tmp = SkData::MakeSubset(r1.get(), 0, 0);
reed@google.com1622c992011-06-14 19:22:21 +0000223 assert_len(reporter, tmp, 0);
rmistry@google.comd6176b02012-08-23 18:14:13 +0000224
reed@google.comdbc936d2012-06-28 15:40:09 +0000225 test_cstring(reporter);
bungeman@google.com11c9a552013-06-03 17:10:35 +0000226 test_files(reporter);
reed@google.com1622c992011-06-14 19:22:21 +0000227}
reed5b6db072015-04-28 17:50:31 -0700228
229///////////////////////////////////////////////////////////////////////////////////////////////////
230#include "SkRWBuffer.h"
231
232const char gABC[] = "abcdefghijklmnopqrstuvwxyz";
233
234static void check_abcs(skiatest::Reporter* reporter, const char buffer[], size_t size) {
235 REPORTER_ASSERT(reporter, size % 26 == 0);
236 for (size_t offset = 0; offset < size; offset += 26) {
237 REPORTER_ASSERT(reporter, !memcmp(&buffer[offset], gABC, 26));
238 }
239}
240
scroggo63516402016-04-22 06:59:01 -0700241// stream should contain an integral number of copies of gABC.
reed5b6db072015-04-28 17:50:31 -0700242static void check_alphabet_stream(skiatest::Reporter* reporter, SkStream* stream) {
243 REPORTER_ASSERT(reporter, stream->hasLength());
244 size_t size = stream->getLength();
245 REPORTER_ASSERT(reporter, size % 26 == 0);
246
247 SkAutoTMalloc<char> storage(size);
248 char* array = storage.get();
249 size_t bytesRead = stream->read(array, size);
250 REPORTER_ASSERT(reporter, bytesRead == size);
251 check_abcs(reporter, array, size);
252
253 // try checking backwards
254 for (size_t offset = size; offset > 0; offset -= 26) {
255 REPORTER_ASSERT(reporter, stream->seek(offset - 26));
256 REPORTER_ASSERT(reporter, stream->getPosition() == offset - 26);
257 REPORTER_ASSERT(reporter, stream->read(array, 26) == 26);
258 check_abcs(reporter, array, 26);
259 REPORTER_ASSERT(reporter, stream->getPosition() == offset);
260 }
261}
262
263// reader should contains an integral number of copies of gABC.
264static void check_alphabet_buffer(skiatest::Reporter* reporter, const SkROBuffer* reader) {
265 size_t size = reader->size();
266 REPORTER_ASSERT(reporter, size % 26 == 0);
halcanary9d524f22016-03-29 09:03:52 -0700267
reed5b6db072015-04-28 17:50:31 -0700268 SkAutoTMalloc<char> storage(size);
269 SkROBuffer::Iter iter(reader);
270 size_t offset = 0;
271 do {
272 SkASSERT(offset + iter.size() <= size);
273 memcpy(storage.get() + offset, iter.data(), iter.size());
274 offset += iter.size();
275 } while (iter.next());
276 REPORTER_ASSERT(reporter, offset == size);
277 check_abcs(reporter, storage.get(), size);
278}
279
scroggo63516402016-04-22 06:59:01 -0700280#include "SkTaskGroup.h"
281
reed5b6db072015-04-28 17:50:31 -0700282DEF_TEST(RWBuffer, reporter) {
283 // Knowing that the default capacity is 4096, choose N large enough so we force it to use
284 // multiple buffers internally.
285 const int N = 1000;
286 SkROBuffer* readers[N];
287 SkStream* streams[N];
288
289 {
290 SkRWBuffer buffer;
291 for (int i = 0; i < N; ++i) {
reed377add72016-04-08 12:47:14 -0700292 buffer.append(gABC, 26);
reed5b6db072015-04-28 17:50:31 -0700293 readers[i] = buffer.newRBufferSnapshot();
294 streams[i] = buffer.newStreamSnapshot();
295 }
296 REPORTER_ASSERT(reporter, N*26 == buffer.size());
297 }
298
scroggo63516402016-04-22 06:59:01 -0700299 // Verify that although the SkRWBuffer's destructor has run, the readers are still valid.
reed5b6db072015-04-28 17:50:31 -0700300 for (int i = 0; i < N; ++i) {
301 REPORTER_ASSERT(reporter, (i + 1) * 26U == readers[i]->size());
302 check_alphabet_buffer(reporter, readers[i]);
303 check_alphabet_stream(reporter, streams[i]);
304 readers[i]->unref();
halcanary385fe4d2015-08-26 13:07:48 -0700305 delete streams[i];
reed5b6db072015-04-28 17:50:31 -0700306 }
307}
scroggob512aaa2016-01-11 06:38:00 -0800308
scroggo63516402016-04-22 06:59:01 -0700309DEF_TEST(RWBuffer_threaded, reporter) {
310 // Knowing that the default capacity is 4096, choose N large enough so we force it to use
311 // multiple buffers internally.
312 const int N = 1000;
313 SkTaskGroup tasks;
314 SkRWBuffer buffer;
315 for (int i = 0; i < N; ++i) {
316 buffer.append(gABC, 26);
317 sk_sp<SkROBuffer> reader = sk_sp<SkROBuffer>(buffer.newRBufferSnapshot());
318 SkStream* stream = buffer.newStreamSnapshot();
319 REPORTER_ASSERT(reporter, reader->size() == buffer.size());
320 REPORTER_ASSERT(reporter, stream->getLength() == buffer.size());
321
322 // reader's copy constructor will ref the SkROBuffer, which will be unreffed
323 // when the task ends.
324 // Ownership of stream is passed to the task, which will delete it.
325 tasks.add([reporter, i, reader, stream] {
326 REPORTER_ASSERT(reporter, (i + 1) * 26U == reader->size());
327 REPORTER_ASSERT(reporter, stream->getLength() == reader->size());
328 check_alphabet_buffer(reporter, reader.get());
329 check_alphabet_stream(reporter, stream);
330 REPORTER_ASSERT(reporter, stream->rewind());
331 delete stream;
332 });
333 }
334 REPORTER_ASSERT(reporter, N*26 == buffer.size());
335 tasks.wait();
336}
337
scroggob512aaa2016-01-11 06:38:00 -0800338// Tests that it is safe to call SkROBuffer::Iter::size() when exhausted.
339DEF_TEST(RWBuffer_size, r) {
340 SkRWBuffer buffer;
341 buffer.append(gABC, 26);
342
Hal Canary342b7ac2016-11-04 11:49:42 -0400343 sk_sp<SkROBuffer> roBuffer(buffer.newRBufferSnapshot());
344 SkROBuffer::Iter iter(roBuffer.get());
scroggob512aaa2016-01-11 06:38:00 -0800345 REPORTER_ASSERT(r, iter.data());
346 REPORTER_ASSERT(r, iter.size() == 26);
347
348 // There is only one block in this buffer.
349 REPORTER_ASSERT(r, !iter.next());
350 REPORTER_ASSERT(r, 0 == iter.size());
351}
scroggo9dec5d22016-02-16 06:59:18 -0800352
scroggo63516402016-04-22 06:59:01 -0700353// Tests that operations (including the destructor) are safe on an SkRWBuffer
354// without any data appended.
scroggo9dec5d22016-02-16 06:59:18 -0800355DEF_TEST(RWBuffer_noAppend, r) {
356 SkRWBuffer buffer;
357 REPORTER_ASSERT(r, 0 == buffer.size());
scroggo63516402016-04-22 06:59:01 -0700358
359 sk_sp<SkROBuffer> roBuffer = sk_sp<SkROBuffer>(buffer.newRBufferSnapshot());
360 REPORTER_ASSERT(r, roBuffer);
361 if (roBuffer) {
362 REPORTER_ASSERT(r, roBuffer->size() == 0);
363 SkROBuffer::Iter iter(roBuffer.get());
364 REPORTER_ASSERT(r, iter.size() == 0);
365 REPORTER_ASSERT(r, !iter.data());
366 REPORTER_ASSERT(r, !iter.next());
367 }
368
Ben Wagner145dbcd2016-11-03 14:40:50 -0400369 std::unique_ptr<SkStream> stream(buffer.newStreamSnapshot());
scroggo63516402016-04-22 06:59:01 -0700370 REPORTER_ASSERT(r, stream);
371 if (stream) {
372 REPORTER_ASSERT(r, stream->hasLength());
373 REPORTER_ASSERT(r, stream->getLength() == 0);
374 REPORTER_ASSERT(r, stream->skip(10) == 0);
375 }
scroggo9dec5d22016-02-16 06:59:18 -0800376}