blob: 187c699547d1b1a9c58a8e1625ccba5c14ead108 [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
Mike Kleinc0bd9f92019-04-23 12:05:21 -05008#include "include/core/SkData.h"
9#include "include/core/SkDataTable.h"
10#include "include/core/SkRWBuffer.h"
11#include "include/core/SkRefCnt.h"
12#include "include/core/SkStream.h"
13#include "include/core/SkString.h"
14#include "include/core/SkTypes.h"
15#include "include/private/SkTArray.h"
16#include "include/private/SkTemplates.h"
17#include "src/core/SkOSFile.h"
18#include "src/core/SkTaskGroup.h"
19#include "src/utils/SkOSPath.h"
20#include "tests/Test.h"
reed@google.com91bd4592012-07-11 17:24:49 +000021
Ben Wagnerd90cd3b2018-05-22 10:48:08 -040022#include <cstdio>
23#include <cstring>
24#include <memory>
Ben Wagnerd90cd3b2018-05-22 10:48:08 -040025
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000026static void test_is_equal(skiatest::Reporter* reporter,
27 const SkDataTable* a, const SkDataTable* b) {
28 REPORTER_ASSERT(reporter, a->count() == b->count());
29 for (int i = 0; i < a->count(); ++i) {
30 size_t sizea, sizeb;
31 const void* mema = a->at(i, &sizea);
32 const void* memb = b->at(i, &sizeb);
33 REPORTER_ASSERT(reporter, sizea == sizeb);
34 REPORTER_ASSERT(reporter, !memcmp(mema, memb, sizea));
35 }
36}
37
bungemanfeb3c1a2016-08-05 06:51:50 -070038static void test_datatable_is_empty(skiatest::Reporter* reporter, SkDataTable* table) {
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000039 REPORTER_ASSERT(reporter, table->isEmpty());
40 REPORTER_ASSERT(reporter, 0 == table->count());
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000041}
42
43static void test_emptytable(skiatest::Reporter* reporter) {
bungemanfeb3c1a2016-08-05 06:51:50 -070044 sk_sp<SkDataTable> table0(SkDataTable::MakeEmpty());
45 sk_sp<SkDataTable> table1(SkDataTable::MakeCopyArrays(nullptr, nullptr, 0));
46 sk_sp<SkDataTable> table2(SkDataTable::MakeCopyArray(nullptr, 0, 0));
47 sk_sp<SkDataTable> table3(SkDataTable::MakeArrayProc(nullptr, 0, 0, nullptr, nullptr));
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000048
bungemanfeb3c1a2016-08-05 06:51:50 -070049 test_datatable_is_empty(reporter, table0.get());
50 test_datatable_is_empty(reporter, table1.get());
51 test_datatable_is_empty(reporter, table2.get());
52 test_datatable_is_empty(reporter, table3.get());
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000053
bungemanfeb3c1a2016-08-05 06:51:50 -070054 test_is_equal(reporter, table0.get(), table1.get());
55 test_is_equal(reporter, table0.get(), table2.get());
56 test_is_equal(reporter, table0.get(), table3.get());
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000057}
58
reed@google.com8c5c7a92013-04-19 20:16:01 +000059static void test_simpletable(skiatest::Reporter* reporter) {
60 const int idata[] = { 1, 4, 9, 16, 25, 63 };
61 int icount = SK_ARRAY_COUNT(idata);
bungemanfeb3c1a2016-08-05 06:51:50 -070062 sk_sp<SkDataTable> itable(SkDataTable::MakeCopyArray(idata, sizeof(idata[0]), icount));
reed@google.com8c5c7a92013-04-19 20:16:01 +000063 REPORTER_ASSERT(reporter, itable->count() == icount);
64 for (int i = 0; i < icount; ++i) {
65 size_t size;
66 REPORTER_ASSERT(reporter, sizeof(int) == itable->atSize(i));
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000067 REPORTER_ASSERT(reporter, *itable->atT<int>(i, &size) == idata[i]);
reed@google.com8c5c7a92013-04-19 20:16:01 +000068 REPORTER_ASSERT(reporter, sizeof(int) == size);
69 }
70}
71
72static void test_vartable(skiatest::Reporter* reporter) {
73 const char* str[] = {
74 "", "a", "be", "see", "deigh", "ef", "ggggggggggggggggggggggggggg"
75 };
76 int count = SK_ARRAY_COUNT(str);
77 size_t sizes[SK_ARRAY_COUNT(str)];
78 for (int i = 0; i < count; ++i) {
79 sizes[i] = strlen(str[i]) + 1;
80 }
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000081
bungemanfeb3c1a2016-08-05 06:51:50 -070082 sk_sp<SkDataTable> table(SkDataTable::MakeCopyArrays((const void*const*)str, sizes, count));
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000083
reed@google.com8c5c7a92013-04-19 20:16:01 +000084 REPORTER_ASSERT(reporter, table->count() == count);
85 for (int i = 0; i < count; ++i) {
86 size_t size;
87 REPORTER_ASSERT(reporter, table->atSize(i) == sizes[i]);
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000088 REPORTER_ASSERT(reporter, !strcmp(table->atT<const char>(i, &size),
reed@google.com8c5c7a92013-04-19 20:16:01 +000089 str[i]));
90 REPORTER_ASSERT(reporter, size == sizes[i]);
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000091
reed@google.com8c5c7a92013-04-19 20:16:01 +000092 const char* s = table->atStr(i);
93 REPORTER_ASSERT(reporter, strlen(s) == strlen(str[i]));
94 }
95}
96
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000097static void test_globaltable(skiatest::Reporter* reporter) {
98 static const int gData[] = {
99 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
100 };
101 int count = SK_ARRAY_COUNT(gData);
102
bungemanfeb3c1a2016-08-05 06:51:50 -0700103 sk_sp<SkDataTable> table(
104 SkDataTable::MakeArrayProc(gData, sizeof(gData[0]), count, nullptr, nullptr));
rmistry@google.comc9f3b382013-04-22 12:45:30 +0000105
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000106 REPORTER_ASSERT(reporter, table->count() == count);
107 for (int i = 0; i < count; ++i) {
108 size_t size;
109 REPORTER_ASSERT(reporter, table->atSize(i) == sizeof(int));
110 REPORTER_ASSERT(reporter, *table->atT<const char>(i, &size) == i);
111 REPORTER_ASSERT(reporter, sizeof(int) == size);
112 }
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000113}
114
tfarina@chromium.orge4fafb12013-12-12 21:11:12 +0000115DEF_TEST(DataTable, reporter) {
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000116 test_emptytable(reporter);
reed@google.com8c5c7a92013-04-19 20:16:01 +0000117 test_simpletable(reporter);
118 test_vartable(reporter);
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000119 test_globaltable(reporter);
reed@google.com8c5c7a92013-04-19 20:16:01 +0000120}
121
reed@google.com1622c992011-06-14 19:22:21 +0000122static void* gGlobal;
123
reed6b7f34e2015-06-17 09:58:24 -0700124static void delete_int_proc(const void* ptr, void* context) {
reed@google.com1622c992011-06-14 19:22:21 +0000125 int* data = (int*)ptr;
126 SkASSERT(context == gGlobal);
127 delete[] data;
128}
129
bungeman38d909e2016-08-02 14:40:46 -0700130static void assert_len(skiatest::Reporter* reporter, const sk_sp<SkData>& ref, size_t len) {
reed@google.com1622c992011-06-14 19:22:21 +0000131 REPORTER_ASSERT(reporter, ref->size() == len);
132}
133
bungeman38d909e2016-08-02 14:40:46 -0700134static void assert_data(skiatest::Reporter* reporter, const sk_sp<SkData>& ref,
reed@google.com1622c992011-06-14 19:22:21 +0000135 const void* data, size_t len) {
136 REPORTER_ASSERT(reporter, ref->size() == len);
137 REPORTER_ASSERT(reporter, !memcmp(ref->data(), data, len));
138}
139
reed@google.comdbc936d2012-06-28 15:40:09 +0000140static void test_cstring(skiatest::Reporter* reporter) {
141 const char str[] = "Hello world";
142 size_t len = strlen(str);
143
bungeman38d909e2016-08-02 14:40:46 -0700144 sk_sp<SkData> r0(SkData::MakeWithCopy(str, len + 1));
145 sk_sp<SkData> r1(SkData::MakeWithCString(str));
reed@google.comdbc936d2012-06-28 15:40:09 +0000146
bungeman38d909e2016-08-02 14:40:46 -0700147 REPORTER_ASSERT(reporter, r0->equals(r1.get()));
reed@google.comdbc936d2012-06-28 15:40:09 +0000148
bungeman38d909e2016-08-02 14:40:46 -0700149 sk_sp<SkData> r2(SkData::MakeWithCString(nullptr));
reed@google.coma63a8512012-07-02 20:29:00 +0000150 REPORTER_ASSERT(reporter, 1 == r2->size());
151 REPORTER_ASSERT(reporter, 0 == *r2->bytes());
reed@google.comdbc936d2012-06-28 15:40:09 +0000152}
153
bungeman@google.com11c9a552013-06-03 17:10:35 +0000154static void test_files(skiatest::Reporter* reporter) {
halcanary87f3ba42015-01-20 09:30:20 -0800155 SkString tmpDir = skiatest::GetTmpDir();
scroggo@google.com99d43ff2013-06-07 14:30:36 +0000156 if (tmpDir.isEmpty()) {
bungeman@google.com11c9a552013-06-03 17:10:35 +0000157 return;
158 }
skia.committer@gmail.com11f2b442013-06-04 07:00:53 +0000159
tfarinaa8e2e152014-07-28 19:26:58 -0700160 SkString path = SkOSPath::Join(tmpDir.c_str(), "data_test");
skia.committer@gmail.com11f2b442013-06-04 07:00:53 +0000161
bungeman@google.com11c9a552013-06-03 17:10:35 +0000162 const char s[] = "abcdefghijklmnopqrstuvwxyz";
163 {
164 SkFILEWStream writer(path.c_str());
165 if (!writer.isValid()) {
halcanary@google.coma9325fa2014-01-10 14:58:10 +0000166 ERRORF(reporter, "Failed to create tmp file %s\n", path.c_str());
bungeman@google.com11c9a552013-06-03 17:10:35 +0000167 return;
168 }
169 writer.write(s, 26);
170 }
171
halcanaryd76be9c2015-11-20 13:47:49 -0800172 FILE* file = sk_fopen(path.c_str(), kRead_SkFILE_Flag);
bungeman38d909e2016-08-02 14:40:46 -0700173 sk_sp<SkData> r1(SkData::MakeFromFILE(file));
halcanary96fcdcc2015-08-27 07:41:13 -0700174 REPORTER_ASSERT(reporter, r1.get() != nullptr);
bungeman@google.com11c9a552013-06-03 17:10:35 +0000175 REPORTER_ASSERT(reporter, r1->size() == 26);
176 REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r1->data()), s, 26) == 0);
skia.committer@gmail.com11f2b442013-06-04 07:00:53 +0000177
bungeman@google.com11c9a552013-06-03 17:10:35 +0000178 int fd = sk_fileno(file);
bungeman38d909e2016-08-02 14:40:46 -0700179 sk_sp<SkData> r2(SkData::MakeFromFD(fd));
halcanary96fcdcc2015-08-27 07:41:13 -0700180 REPORTER_ASSERT(reporter, r2.get() != nullptr);
bungeman@google.com11c9a552013-06-03 17:10:35 +0000181 REPORTER_ASSERT(reporter, r2->size() == 26);
182 REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r2->data()), s, 26) == 0);
183}
184
tfarina@chromium.orge4fafb12013-12-12 21:11:12 +0000185DEF_TEST(Data, reporter) {
reed@google.com1622c992011-06-14 19:22:21 +0000186 const char* str = "We the people, in order to form a more perfect union.";
187 const int N = 10;
188
bungeman38d909e2016-08-02 14:40:46 -0700189 sk_sp<SkData> r0(SkData::MakeEmpty());
190 sk_sp<SkData> r1(SkData::MakeWithCopy(str, strlen(str)));
191 sk_sp<SkData> r2(SkData::MakeWithProc(new int[N], N*sizeof(int), delete_int_proc, gGlobal));
192 sk_sp<SkData> r3(SkData::MakeSubset(r1.get(), 7, 6));
reed@google.com1622c992011-06-14 19:22:21 +0000193
reed@google.com1622c992011-06-14 19:22:21 +0000194 assert_len(reporter, r0, 0);
195 assert_len(reporter, r1, strlen(str));
196 assert_len(reporter, r2, N * sizeof(int));
197 assert_len(reporter, r3, 6);
rmistry@google.comd6176b02012-08-23 18:14:13 +0000198
reed@google.com1622c992011-06-14 19:22:21 +0000199 assert_data(reporter, r1, str, strlen(str));
200 assert_data(reporter, r3, "people", 6);
201
bungeman38d909e2016-08-02 14:40:46 -0700202 sk_sp<SkData> tmp(SkData::MakeSubset(r1.get(), strlen(str), 10));
reed@google.com1622c992011-06-14 19:22:21 +0000203 assert_len(reporter, tmp, 0);
bungeman38d909e2016-08-02 14:40:46 -0700204 tmp = SkData::MakeSubset(r1.get(), 0, 0);
reed@google.com1622c992011-06-14 19:22:21 +0000205 assert_len(reporter, tmp, 0);
rmistry@google.comd6176b02012-08-23 18:14:13 +0000206
reed@google.comdbc936d2012-06-28 15:40:09 +0000207 test_cstring(reporter);
bungeman@google.com11c9a552013-06-03 17:10:35 +0000208 test_files(reporter);
reed@google.com1622c992011-06-14 19:22:21 +0000209}
reed5b6db072015-04-28 17:50:31 -0700210
211///////////////////////////////////////////////////////////////////////////////////////////////////
reed5b6db072015-04-28 17:50:31 -0700212
213const char gABC[] = "abcdefghijklmnopqrstuvwxyz";
214
215static void check_abcs(skiatest::Reporter* reporter, const char buffer[], size_t size) {
216 REPORTER_ASSERT(reporter, size % 26 == 0);
217 for (size_t offset = 0; offset < size; offset += 26) {
218 REPORTER_ASSERT(reporter, !memcmp(&buffer[offset], gABC, 26));
219 }
220}
221
scroggo63516402016-04-22 06:59:01 -0700222// stream should contain an integral number of copies of gABC.
reed5b6db072015-04-28 17:50:31 -0700223static void check_alphabet_stream(skiatest::Reporter* reporter, SkStream* stream) {
224 REPORTER_ASSERT(reporter, stream->hasLength());
225 size_t size = stream->getLength();
226 REPORTER_ASSERT(reporter, size % 26 == 0);
227
228 SkAutoTMalloc<char> storage(size);
229 char* array = storage.get();
230 size_t bytesRead = stream->read(array, size);
231 REPORTER_ASSERT(reporter, bytesRead == size);
232 check_abcs(reporter, array, size);
233
234 // try checking backwards
235 for (size_t offset = size; offset > 0; offset -= 26) {
236 REPORTER_ASSERT(reporter, stream->seek(offset - 26));
237 REPORTER_ASSERT(reporter, stream->getPosition() == offset - 26);
238 REPORTER_ASSERT(reporter, stream->read(array, 26) == 26);
239 check_abcs(reporter, array, 26);
240 REPORTER_ASSERT(reporter, stream->getPosition() == offset);
241 }
242}
243
244// reader should contains an integral number of copies of gABC.
245static void check_alphabet_buffer(skiatest::Reporter* reporter, const SkROBuffer* reader) {
246 size_t size = reader->size();
247 REPORTER_ASSERT(reporter, size % 26 == 0);
halcanary9d524f22016-03-29 09:03:52 -0700248
reed5b6db072015-04-28 17:50:31 -0700249 SkAutoTMalloc<char> storage(size);
250 SkROBuffer::Iter iter(reader);
251 size_t offset = 0;
252 do {
253 SkASSERT(offset + iter.size() <= size);
254 memcpy(storage.get() + offset, iter.data(), iter.size());
255 offset += iter.size();
256 } while (iter.next());
257 REPORTER_ASSERT(reporter, offset == size);
258 check_abcs(reporter, storage.get(), size);
259}
260
261DEF_TEST(RWBuffer, reporter) {
262 // Knowing that the default capacity is 4096, choose N large enough so we force it to use
263 // multiple buffers internally.
Florin Malita69270fb2017-06-01 09:43:01 -0400264 static constexpr int N = 1000;
265 SkSTArray<N, sk_sp<SkROBuffer>> readers;
266 SkSTArray<N, std::unique_ptr<SkStream>> streams;
reed5b6db072015-04-28 17:50:31 -0700267
268 {
269 SkRWBuffer buffer;
270 for (int i = 0; i < N; ++i) {
reed377add72016-04-08 12:47:14 -0700271 buffer.append(gABC, 26);
Florin Malita69270fb2017-06-01 09:43:01 -0400272 readers.push_back(buffer.makeROBufferSnapshot());
273 streams.push_back(buffer.makeStreamSnapshot());
reed5b6db072015-04-28 17:50:31 -0700274 }
275 REPORTER_ASSERT(reporter, N*26 == buffer.size());
276 }
277
scroggo63516402016-04-22 06:59:01 -0700278 // Verify that although the SkRWBuffer's destructor has run, the readers are still valid.
reed5b6db072015-04-28 17:50:31 -0700279 for (int i = 0; i < N; ++i) {
280 REPORTER_ASSERT(reporter, (i + 1) * 26U == readers[i]->size());
Florin Malita69270fb2017-06-01 09:43:01 -0400281 check_alphabet_buffer(reporter, readers[i].get());
282 check_alphabet_stream(reporter, streams[i].get());
reed5b6db072015-04-28 17:50:31 -0700283 }
284}
scroggob512aaa2016-01-11 06:38:00 -0800285
scroggo63516402016-04-22 06:59:01 -0700286DEF_TEST(RWBuffer_threaded, reporter) {
287 // Knowing that the default capacity is 4096, choose N large enough so we force it to use
288 // multiple buffers internally.
289 const int N = 1000;
290 SkTaskGroup tasks;
291 SkRWBuffer buffer;
292 for (int i = 0; i < N; ++i) {
293 buffer.append(gABC, 26);
Florin Malita69270fb2017-06-01 09:43:01 -0400294 sk_sp<SkROBuffer> reader = buffer.makeROBufferSnapshot();
295 SkStream* stream = buffer.makeStreamSnapshot().release();
scroggo63516402016-04-22 06:59:01 -0700296 REPORTER_ASSERT(reporter, reader->size() == buffer.size());
297 REPORTER_ASSERT(reporter, stream->getLength() == buffer.size());
298
299 // reader's copy constructor will ref the SkROBuffer, which will be unreffed
300 // when the task ends.
301 // Ownership of stream is passed to the task, which will delete it.
302 tasks.add([reporter, i, reader, stream] {
303 REPORTER_ASSERT(reporter, (i + 1) * 26U == reader->size());
304 REPORTER_ASSERT(reporter, stream->getLength() == reader->size());
305 check_alphabet_buffer(reporter, reader.get());
306 check_alphabet_stream(reporter, stream);
307 REPORTER_ASSERT(reporter, stream->rewind());
308 delete stream;
309 });
310 }
311 REPORTER_ASSERT(reporter, N*26 == buffer.size());
312 tasks.wait();
313}
314
scroggob512aaa2016-01-11 06:38:00 -0800315// Tests that it is safe to call SkROBuffer::Iter::size() when exhausted.
316DEF_TEST(RWBuffer_size, r) {
317 SkRWBuffer buffer;
318 buffer.append(gABC, 26);
319
Florin Malita69270fb2017-06-01 09:43:01 -0400320 sk_sp<SkROBuffer> roBuffer(buffer.makeROBufferSnapshot());
Hal Canary342b7ac2016-11-04 11:49:42 -0400321 SkROBuffer::Iter iter(roBuffer.get());
scroggob512aaa2016-01-11 06:38:00 -0800322 REPORTER_ASSERT(r, iter.data());
323 REPORTER_ASSERT(r, iter.size() == 26);
324
325 // There is only one block in this buffer.
326 REPORTER_ASSERT(r, !iter.next());
327 REPORTER_ASSERT(r, 0 == iter.size());
328}
scroggo9dec5d22016-02-16 06:59:18 -0800329
scroggo63516402016-04-22 06:59:01 -0700330// Tests that operations (including the destructor) are safe on an SkRWBuffer
331// without any data appended.
scroggo9dec5d22016-02-16 06:59:18 -0800332DEF_TEST(RWBuffer_noAppend, r) {
333 SkRWBuffer buffer;
334 REPORTER_ASSERT(r, 0 == buffer.size());
scroggo63516402016-04-22 06:59:01 -0700335
Florin Malita69270fb2017-06-01 09:43:01 -0400336 sk_sp<SkROBuffer> roBuffer = buffer.makeROBufferSnapshot();
scroggo63516402016-04-22 06:59:01 -0700337 REPORTER_ASSERT(r, roBuffer);
338 if (roBuffer) {
339 REPORTER_ASSERT(r, roBuffer->size() == 0);
340 SkROBuffer::Iter iter(roBuffer.get());
341 REPORTER_ASSERT(r, iter.size() == 0);
342 REPORTER_ASSERT(r, !iter.data());
343 REPORTER_ASSERT(r, !iter.next());
344 }
345
Florin Malita69270fb2017-06-01 09:43:01 -0400346 std::unique_ptr<SkStream> stream(buffer.makeStreamSnapshot());
scroggo63516402016-04-22 06:59:01 -0700347 REPORTER_ASSERT(r, stream);
348 if (stream) {
349 REPORTER_ASSERT(r, stream->hasLength());
350 REPORTER_ASSERT(r, stream->getLength() == 0);
351 REPORTER_ASSERT(r, stream->skip(10) == 0);
352 }
scroggo9dec5d22016-02-16 06:59:18 -0800353}