blob: 391124e840c97fb7fb6048c7fcaf6c165b617d0d [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"
commit-bot@chromium.org8b0e8ac2014-01-30 18:58:24 +000011#include "SkReadBuffer.h"
12#include "SkWriteBuffer.h"
bungeman@google.com11c9a552013-06-03 17:10:35 +000013#include "SkStream.h"
tfarina@chromium.org8f6884a2014-01-24 20:56:26 +000014#include "Test.h"
reed@google.com91bd4592012-07-11 17:24:49 +000015
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000016static void test_is_equal(skiatest::Reporter* reporter,
17 const SkDataTable* a, const SkDataTable* b) {
18 REPORTER_ASSERT(reporter, a->count() == b->count());
19 for (int i = 0; i < a->count(); ++i) {
20 size_t sizea, sizeb;
21 const void* mema = a->at(i, &sizea);
22 const void* memb = b->at(i, &sizeb);
23 REPORTER_ASSERT(reporter, sizea == sizeb);
24 REPORTER_ASSERT(reporter, !memcmp(mema, memb, sizea));
25 }
26}
27
bungemanfeb3c1a2016-08-05 06:51:50 -070028static void test_datatable_is_empty(skiatest::Reporter* reporter, SkDataTable* table) {
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000029 REPORTER_ASSERT(reporter, table->isEmpty());
30 REPORTER_ASSERT(reporter, 0 == table->count());
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000031}
32
33static void test_emptytable(skiatest::Reporter* reporter) {
bungemanfeb3c1a2016-08-05 06:51:50 -070034 sk_sp<SkDataTable> table0(SkDataTable::MakeEmpty());
35 sk_sp<SkDataTable> table1(SkDataTable::MakeCopyArrays(nullptr, nullptr, 0));
36 sk_sp<SkDataTable> table2(SkDataTable::MakeCopyArray(nullptr, 0, 0));
37 sk_sp<SkDataTable> table3(SkDataTable::MakeArrayProc(nullptr, 0, 0, nullptr, nullptr));
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000038
bungemanfeb3c1a2016-08-05 06:51:50 -070039 test_datatable_is_empty(reporter, table0.get());
40 test_datatable_is_empty(reporter, table1.get());
41 test_datatable_is_empty(reporter, table2.get());
42 test_datatable_is_empty(reporter, table3.get());
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000043
bungemanfeb3c1a2016-08-05 06:51:50 -070044 test_is_equal(reporter, table0.get(), table1.get());
45 test_is_equal(reporter, table0.get(), table2.get());
46 test_is_equal(reporter, table0.get(), table3.get());
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000047}
48
reed@google.com8c5c7a92013-04-19 20:16:01 +000049static void test_simpletable(skiatest::Reporter* reporter) {
50 const int idata[] = { 1, 4, 9, 16, 25, 63 };
51 int icount = SK_ARRAY_COUNT(idata);
bungemanfeb3c1a2016-08-05 06:51:50 -070052 sk_sp<SkDataTable> itable(SkDataTable::MakeCopyArray(idata, sizeof(idata[0]), icount));
reed@google.com8c5c7a92013-04-19 20:16:01 +000053 REPORTER_ASSERT(reporter, itable->count() == icount);
54 for (int i = 0; i < icount; ++i) {
55 size_t size;
56 REPORTER_ASSERT(reporter, sizeof(int) == itable->atSize(i));
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000057 REPORTER_ASSERT(reporter, *itable->atT<int>(i, &size) == idata[i]);
reed@google.com8c5c7a92013-04-19 20:16:01 +000058 REPORTER_ASSERT(reporter, sizeof(int) == size);
59 }
60}
61
62static void test_vartable(skiatest::Reporter* reporter) {
63 const char* str[] = {
64 "", "a", "be", "see", "deigh", "ef", "ggggggggggggggggggggggggggg"
65 };
66 int count = SK_ARRAY_COUNT(str);
67 size_t sizes[SK_ARRAY_COUNT(str)];
68 for (int i = 0; i < count; ++i) {
69 sizes[i] = strlen(str[i]) + 1;
70 }
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000071
bungemanfeb3c1a2016-08-05 06:51:50 -070072 sk_sp<SkDataTable> table(SkDataTable::MakeCopyArrays((const void*const*)str, sizes, count));
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000073
reed@google.com8c5c7a92013-04-19 20:16:01 +000074 REPORTER_ASSERT(reporter, table->count() == count);
75 for (int i = 0; i < count; ++i) {
76 size_t size;
77 REPORTER_ASSERT(reporter, table->atSize(i) == sizes[i]);
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000078 REPORTER_ASSERT(reporter, !strcmp(table->atT<const char>(i, &size),
reed@google.com8c5c7a92013-04-19 20:16:01 +000079 str[i]));
80 REPORTER_ASSERT(reporter, size == sizes[i]);
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000081
reed@google.com8c5c7a92013-04-19 20:16:01 +000082 const char* s = table->atStr(i);
83 REPORTER_ASSERT(reporter, strlen(s) == strlen(str[i]));
84 }
85}
86
87static void test_tablebuilder(skiatest::Reporter* reporter) {
88 const char* str[] = {
89 "", "a", "be", "see", "deigh", "ef", "ggggggggggggggggggggggggggg"
90 };
91 int count = SK_ARRAY_COUNT(str);
92
93 SkDataTableBuilder builder(16);
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000094
reed@google.com8c5c7a92013-04-19 20:16:01 +000095 for (int i = 0; i < count; ++i) {
96 builder.append(str[i], strlen(str[i]) + 1);
97 }
bungemanfeb3c1a2016-08-05 06:51:50 -070098 sk_sp<SkDataTable> table(builder.detachDataTable());
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000099
reed@google.com8c5c7a92013-04-19 20:16:01 +0000100 REPORTER_ASSERT(reporter, table->count() == count);
101 for (int i = 0; i < count; ++i) {
102 size_t size;
103 REPORTER_ASSERT(reporter, table->atSize(i) == strlen(str[i]) + 1);
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000104 REPORTER_ASSERT(reporter, !strcmp(table->atT<const char>(i, &size),
reed@google.com8c5c7a92013-04-19 20:16:01 +0000105 str[i]));
106 REPORTER_ASSERT(reporter, size == strlen(str[i]) + 1);
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +0000107
reed@google.com8c5c7a92013-04-19 20:16:01 +0000108 const char* s = table->atStr(i);
109 REPORTER_ASSERT(reporter, strlen(s) == strlen(str[i]));
110 }
111}
112
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000113static void test_globaltable(skiatest::Reporter* reporter) {
114 static const int gData[] = {
115 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
116 };
117 int count = SK_ARRAY_COUNT(gData);
118
bungemanfeb3c1a2016-08-05 06:51:50 -0700119 sk_sp<SkDataTable> table(
120 SkDataTable::MakeArrayProc(gData, sizeof(gData[0]), count, nullptr, nullptr));
rmistry@google.comc9f3b382013-04-22 12:45:30 +0000121
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000122 REPORTER_ASSERT(reporter, table->count() == count);
123 for (int i = 0; i < count; ++i) {
124 size_t size;
125 REPORTER_ASSERT(reporter, table->atSize(i) == sizeof(int));
126 REPORTER_ASSERT(reporter, *table->atT<const char>(i, &size) == i);
127 REPORTER_ASSERT(reporter, sizeof(int) == size);
128 }
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000129}
130
tfarina@chromium.orge4fafb12013-12-12 21:11:12 +0000131DEF_TEST(DataTable, reporter) {
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000132 test_emptytable(reporter);
reed@google.com8c5c7a92013-04-19 20:16:01 +0000133 test_simpletable(reporter);
134 test_vartable(reporter);
135 test_tablebuilder(reporter);
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000136 test_globaltable(reporter);
reed@google.com8c5c7a92013-04-19 20:16:01 +0000137}
138
reed@google.com1622c992011-06-14 19:22:21 +0000139static void* gGlobal;
140
reed6b7f34e2015-06-17 09:58:24 -0700141static void delete_int_proc(const void* ptr, void* context) {
reed@google.com1622c992011-06-14 19:22:21 +0000142 int* data = (int*)ptr;
143 SkASSERT(context == gGlobal);
144 delete[] data;
145}
146
bungeman38d909e2016-08-02 14:40:46 -0700147static void assert_len(skiatest::Reporter* reporter, const sk_sp<SkData>& ref, size_t len) {
reed@google.com1622c992011-06-14 19:22:21 +0000148 REPORTER_ASSERT(reporter, ref->size() == len);
149}
150
bungeman38d909e2016-08-02 14:40:46 -0700151static void assert_data(skiatest::Reporter* reporter, const sk_sp<SkData>& ref,
reed@google.com1622c992011-06-14 19:22:21 +0000152 const void* data, size_t len) {
153 REPORTER_ASSERT(reporter, ref->size() == len);
154 REPORTER_ASSERT(reporter, !memcmp(ref->data(), data, len));
155}
156
reed@google.comdbc936d2012-06-28 15:40:09 +0000157static void test_cstring(skiatest::Reporter* reporter) {
158 const char str[] = "Hello world";
159 size_t len = strlen(str);
160
bungeman38d909e2016-08-02 14:40:46 -0700161 sk_sp<SkData> r0(SkData::MakeWithCopy(str, len + 1));
162 sk_sp<SkData> r1(SkData::MakeWithCString(str));
reed@google.comdbc936d2012-06-28 15:40:09 +0000163
bungeman38d909e2016-08-02 14:40:46 -0700164 REPORTER_ASSERT(reporter, r0->equals(r1.get()));
reed@google.comdbc936d2012-06-28 15:40:09 +0000165
bungeman38d909e2016-08-02 14:40:46 -0700166 sk_sp<SkData> r2(SkData::MakeWithCString(nullptr));
reed@google.coma63a8512012-07-02 20:29:00 +0000167 REPORTER_ASSERT(reporter, 1 == r2->size());
168 REPORTER_ASSERT(reporter, 0 == *r2->bytes());
reed@google.comdbc936d2012-06-28 15:40:09 +0000169}
170
bungeman@google.com11c9a552013-06-03 17:10:35 +0000171static void test_files(skiatest::Reporter* reporter) {
halcanary87f3ba42015-01-20 09:30:20 -0800172 SkString tmpDir = skiatest::GetTmpDir();
scroggo@google.com99d43ff2013-06-07 14:30:36 +0000173 if (tmpDir.isEmpty()) {
bungeman@google.com11c9a552013-06-03 17:10:35 +0000174 return;
175 }
skia.committer@gmail.com11f2b442013-06-04 07:00:53 +0000176
tfarinaa8e2e152014-07-28 19:26:58 -0700177 SkString path = SkOSPath::Join(tmpDir.c_str(), "data_test");
skia.committer@gmail.com11f2b442013-06-04 07:00:53 +0000178
bungeman@google.com11c9a552013-06-03 17:10:35 +0000179 const char s[] = "abcdefghijklmnopqrstuvwxyz";
180 {
181 SkFILEWStream writer(path.c_str());
182 if (!writer.isValid()) {
halcanary@google.coma9325fa2014-01-10 14:58:10 +0000183 ERRORF(reporter, "Failed to create tmp file %s\n", path.c_str());
bungeman@google.com11c9a552013-06-03 17:10:35 +0000184 return;
185 }
186 writer.write(s, 26);
187 }
188
halcanaryd76be9c2015-11-20 13:47:49 -0800189 FILE* file = sk_fopen(path.c_str(), kRead_SkFILE_Flag);
bungeman38d909e2016-08-02 14:40:46 -0700190 sk_sp<SkData> r1(SkData::MakeFromFILE(file));
halcanary96fcdcc2015-08-27 07:41:13 -0700191 REPORTER_ASSERT(reporter, r1.get() != nullptr);
bungeman@google.com11c9a552013-06-03 17:10:35 +0000192 REPORTER_ASSERT(reporter, r1->size() == 26);
193 REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r1->data()), s, 26) == 0);
skia.committer@gmail.com11f2b442013-06-04 07:00:53 +0000194
bungeman@google.com11c9a552013-06-03 17:10:35 +0000195 int fd = sk_fileno(file);
bungeman38d909e2016-08-02 14:40:46 -0700196 sk_sp<SkData> r2(SkData::MakeFromFD(fd));
halcanary96fcdcc2015-08-27 07:41:13 -0700197 REPORTER_ASSERT(reporter, r2.get() != nullptr);
bungeman@google.com11c9a552013-06-03 17:10:35 +0000198 REPORTER_ASSERT(reporter, r2->size() == 26);
199 REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r2->data()), s, 26) == 0);
200}
201
tfarina@chromium.orge4fafb12013-12-12 21:11:12 +0000202DEF_TEST(Data, reporter) {
reed@google.com1622c992011-06-14 19:22:21 +0000203 const char* str = "We the people, in order to form a more perfect union.";
204 const int N = 10;
205
bungeman38d909e2016-08-02 14:40:46 -0700206 sk_sp<SkData> r0(SkData::MakeEmpty());
207 sk_sp<SkData> r1(SkData::MakeWithCopy(str, strlen(str)));
208 sk_sp<SkData> r2(SkData::MakeWithProc(new int[N], N*sizeof(int), delete_int_proc, gGlobal));
209 sk_sp<SkData> r3(SkData::MakeSubset(r1.get(), 7, 6));
reed@google.com1622c992011-06-14 19:22:21 +0000210
reed@google.com1622c992011-06-14 19:22:21 +0000211 assert_len(reporter, r0, 0);
212 assert_len(reporter, r1, strlen(str));
213 assert_len(reporter, r2, N * sizeof(int));
214 assert_len(reporter, r3, 6);
rmistry@google.comd6176b02012-08-23 18:14:13 +0000215
reed@google.com1622c992011-06-14 19:22:21 +0000216 assert_data(reporter, r1, str, strlen(str));
217 assert_data(reporter, r3, "people", 6);
218
bungeman38d909e2016-08-02 14:40:46 -0700219 sk_sp<SkData> tmp(SkData::MakeSubset(r1.get(), strlen(str), 10));
reed@google.com1622c992011-06-14 19:22:21 +0000220 assert_len(reporter, tmp, 0);
bungeman38d909e2016-08-02 14:40:46 -0700221 tmp = SkData::MakeSubset(r1.get(), 0, 0);
reed@google.com1622c992011-06-14 19:22:21 +0000222 assert_len(reporter, tmp, 0);
rmistry@google.comd6176b02012-08-23 18:14:13 +0000223
reed@google.comdbc936d2012-06-28 15:40:09 +0000224 test_cstring(reporter);
bungeman@google.com11c9a552013-06-03 17:10:35 +0000225 test_files(reporter);
reed@google.com1622c992011-06-14 19:22:21 +0000226}
reed5b6db072015-04-28 17:50:31 -0700227
228///////////////////////////////////////////////////////////////////////////////////////////////////
229#include "SkRWBuffer.h"
230
231const char gABC[] = "abcdefghijklmnopqrstuvwxyz";
232
233static void check_abcs(skiatest::Reporter* reporter, const char buffer[], size_t size) {
234 REPORTER_ASSERT(reporter, size % 26 == 0);
235 for (size_t offset = 0; offset < size; offset += 26) {
236 REPORTER_ASSERT(reporter, !memcmp(&buffer[offset], gABC, 26));
237 }
238}
239
scroggo63516402016-04-22 06:59:01 -0700240// stream should contain an integral number of copies of gABC.
reed5b6db072015-04-28 17:50:31 -0700241static void check_alphabet_stream(skiatest::Reporter* reporter, SkStream* stream) {
242 REPORTER_ASSERT(reporter, stream->hasLength());
243 size_t size = stream->getLength();
244 REPORTER_ASSERT(reporter, size % 26 == 0);
245
246 SkAutoTMalloc<char> storage(size);
247 char* array = storage.get();
248 size_t bytesRead = stream->read(array, size);
249 REPORTER_ASSERT(reporter, bytesRead == size);
250 check_abcs(reporter, array, size);
251
252 // try checking backwards
253 for (size_t offset = size; offset > 0; offset -= 26) {
254 REPORTER_ASSERT(reporter, stream->seek(offset - 26));
255 REPORTER_ASSERT(reporter, stream->getPosition() == offset - 26);
256 REPORTER_ASSERT(reporter, stream->read(array, 26) == 26);
257 check_abcs(reporter, array, 26);
258 REPORTER_ASSERT(reporter, stream->getPosition() == offset);
259 }
260}
261
262// reader should contains an integral number of copies of gABC.
263static void check_alphabet_buffer(skiatest::Reporter* reporter, const SkROBuffer* reader) {
264 size_t size = reader->size();
265 REPORTER_ASSERT(reporter, size % 26 == 0);
halcanary9d524f22016-03-29 09:03:52 -0700266
reed5b6db072015-04-28 17:50:31 -0700267 SkAutoTMalloc<char> storage(size);
268 SkROBuffer::Iter iter(reader);
269 size_t offset = 0;
270 do {
271 SkASSERT(offset + iter.size() <= size);
272 memcpy(storage.get() + offset, iter.data(), iter.size());
273 offset += iter.size();
274 } while (iter.next());
275 REPORTER_ASSERT(reporter, offset == size);
276 check_abcs(reporter, storage.get(), size);
277}
278
scroggo63516402016-04-22 06:59:01 -0700279#include "SkTaskGroup.h"
280
reed5b6db072015-04-28 17:50:31 -0700281DEF_TEST(RWBuffer, reporter) {
282 // Knowing that the default capacity is 4096, choose N large enough so we force it to use
283 // multiple buffers internally.
284 const int N = 1000;
285 SkROBuffer* readers[N];
286 SkStream* streams[N];
287
288 {
289 SkRWBuffer buffer;
290 for (int i = 0; i < N; ++i) {
reed377add72016-04-08 12:47:14 -0700291 buffer.append(gABC, 26);
reed5b6db072015-04-28 17:50:31 -0700292 readers[i] = buffer.newRBufferSnapshot();
293 streams[i] = buffer.newStreamSnapshot();
294 }
295 REPORTER_ASSERT(reporter, N*26 == buffer.size());
296 }
297
scroggo63516402016-04-22 06:59:01 -0700298 // Verify that although the SkRWBuffer's destructor has run, the readers are still valid.
reed5b6db072015-04-28 17:50:31 -0700299 for (int i = 0; i < N; ++i) {
300 REPORTER_ASSERT(reporter, (i + 1) * 26U == readers[i]->size());
301 check_alphabet_buffer(reporter, readers[i]);
302 check_alphabet_stream(reporter, streams[i]);
303 readers[i]->unref();
halcanary385fe4d2015-08-26 13:07:48 -0700304 delete streams[i];
reed5b6db072015-04-28 17:50:31 -0700305 }
306}
scroggob512aaa2016-01-11 06:38:00 -0800307
scroggo63516402016-04-22 06:59:01 -0700308DEF_TEST(RWBuffer_threaded, reporter) {
309 // Knowing that the default capacity is 4096, choose N large enough so we force it to use
310 // multiple buffers internally.
311 const int N = 1000;
312 SkTaskGroup tasks;
313 SkRWBuffer buffer;
314 for (int i = 0; i < N; ++i) {
315 buffer.append(gABC, 26);
316 sk_sp<SkROBuffer> reader = sk_sp<SkROBuffer>(buffer.newRBufferSnapshot());
317 SkStream* stream = buffer.newStreamSnapshot();
318 REPORTER_ASSERT(reporter, reader->size() == buffer.size());
319 REPORTER_ASSERT(reporter, stream->getLength() == buffer.size());
320
321 // reader's copy constructor will ref the SkROBuffer, which will be unreffed
322 // when the task ends.
323 // Ownership of stream is passed to the task, which will delete it.
324 tasks.add([reporter, i, reader, stream] {
325 REPORTER_ASSERT(reporter, (i + 1) * 26U == reader->size());
326 REPORTER_ASSERT(reporter, stream->getLength() == reader->size());
327 check_alphabet_buffer(reporter, reader.get());
328 check_alphabet_stream(reporter, stream);
329 REPORTER_ASSERT(reporter, stream->rewind());
330 delete stream;
331 });
332 }
333 REPORTER_ASSERT(reporter, N*26 == buffer.size());
334 tasks.wait();
335}
336
scroggob512aaa2016-01-11 06:38:00 -0800337// Tests that it is safe to call SkROBuffer::Iter::size() when exhausted.
338DEF_TEST(RWBuffer_size, r) {
339 SkRWBuffer buffer;
340 buffer.append(gABC, 26);
341
342 SkAutoTUnref<SkROBuffer> roBuffer(buffer.newRBufferSnapshot());
343 SkROBuffer::Iter iter(roBuffer);
344 REPORTER_ASSERT(r, iter.data());
345 REPORTER_ASSERT(r, iter.size() == 26);
346
347 // There is only one block in this buffer.
348 REPORTER_ASSERT(r, !iter.next());
349 REPORTER_ASSERT(r, 0 == iter.size());
350}
scroggo9dec5d22016-02-16 06:59:18 -0800351
scroggo63516402016-04-22 06:59:01 -0700352// Tests that operations (including the destructor) are safe on an SkRWBuffer
353// without any data appended.
scroggo9dec5d22016-02-16 06:59:18 -0800354DEF_TEST(RWBuffer_noAppend, r) {
355 SkRWBuffer buffer;
356 REPORTER_ASSERT(r, 0 == buffer.size());
scroggo63516402016-04-22 06:59:01 -0700357
358 sk_sp<SkROBuffer> roBuffer = sk_sp<SkROBuffer>(buffer.newRBufferSnapshot());
359 REPORTER_ASSERT(r, roBuffer);
360 if (roBuffer) {
361 REPORTER_ASSERT(r, roBuffer->size() == 0);
362 SkROBuffer::Iter iter(roBuffer.get());
363 REPORTER_ASSERT(r, iter.size() == 0);
364 REPORTER_ASSERT(r, !iter.data());
365 REPORTER_ASSERT(r, !iter.next());
366 }
367
368 SkAutoTDelete<SkStream> stream(buffer.newStreamSnapshot());
369 REPORTER_ASSERT(r, stream);
370 if (stream) {
371 REPORTER_ASSERT(r, stream->hasLength());
372 REPORTER_ASSERT(r, stream->getLength() == 0);
373 REPORTER_ASSERT(r, stream->skip(10) == 0);
374 }
scroggo9dec5d22016-02-16 06:59:18 -0800375}