1 /*
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 */
7
8 #include "SkData.h"
9 #include "SkDataTable.h"
10 #include "SkOSFile.h"
11 #include "SkOSPath.h"
12 #include "SkRWBuffer.h"
13 #include "SkRefCnt.h"
14 #include "SkStream.h"
15 #include "SkString.h"
16 #include "SkTArray.h"
17 #include "SkTaskGroup.h"
18 #include "SkTemplates.h"
19 #include "SkTypes.h"
20 #include "Test.h"
21
22 #include <cstdio>
23 #include <cstring>
24 #include <memory>
25 #include <utility>
26
test_is_equal(skiatest::Reporter * reporter,const SkDataTable * a,const SkDataTable * b)27 static void test_is_equal(skiatest::Reporter* reporter,
28 const SkDataTable* a, const SkDataTable* b) {
29 REPORTER_ASSERT(reporter, a->count() == b->count());
30 for (int i = 0; i < a->count(); ++i) {
31 size_t sizea, sizeb;
32 const void* mema = a->at(i, &sizea);
33 const void* memb = b->at(i, &sizeb);
34 REPORTER_ASSERT(reporter, sizea == sizeb);
35 REPORTER_ASSERT(reporter, !memcmp(mema, memb, sizea));
36 }
37 }
38
test_datatable_is_empty(skiatest::Reporter * reporter,SkDataTable * table)39 static void test_datatable_is_empty(skiatest::Reporter* reporter, SkDataTable* table) {
40 REPORTER_ASSERT(reporter, table->isEmpty());
41 REPORTER_ASSERT(reporter, 0 == table->count());
42 }
43
test_emptytable(skiatest::Reporter * reporter)44 static void test_emptytable(skiatest::Reporter* reporter) {
45 sk_sp<SkDataTable> table0(SkDataTable::MakeEmpty());
46 sk_sp<SkDataTable> table1(SkDataTable::MakeCopyArrays(nullptr, nullptr, 0));
47 sk_sp<SkDataTable> table2(SkDataTable::MakeCopyArray(nullptr, 0, 0));
48 sk_sp<SkDataTable> table3(SkDataTable::MakeArrayProc(nullptr, 0, 0, nullptr, nullptr));
49
50 test_datatable_is_empty(reporter, table0.get());
51 test_datatable_is_empty(reporter, table1.get());
52 test_datatable_is_empty(reporter, table2.get());
53 test_datatable_is_empty(reporter, table3.get());
54
55 test_is_equal(reporter, table0.get(), table1.get());
56 test_is_equal(reporter, table0.get(), table2.get());
57 test_is_equal(reporter, table0.get(), table3.get());
58 }
59
test_simpletable(skiatest::Reporter * reporter)60 static void test_simpletable(skiatest::Reporter* reporter) {
61 const int idata[] = { 1, 4, 9, 16, 25, 63 };
62 int icount = SK_ARRAY_COUNT(idata);
63 sk_sp<SkDataTable> itable(SkDataTable::MakeCopyArray(idata, sizeof(idata[0]), icount));
64 REPORTER_ASSERT(reporter, itable->count() == icount);
65 for (int i = 0; i < icount; ++i) {
66 size_t size;
67 REPORTER_ASSERT(reporter, sizeof(int) == itable->atSize(i));
68 REPORTER_ASSERT(reporter, *itable->atT<int>(i, &size) == idata[i]);
69 REPORTER_ASSERT(reporter, sizeof(int) == size);
70 }
71 }
72
test_vartable(skiatest::Reporter * reporter)73 static void test_vartable(skiatest::Reporter* reporter) {
74 const char* str[] = {
75 "", "a", "be", "see", "deigh", "ef", "ggggggggggggggggggggggggggg"
76 };
77 int count = SK_ARRAY_COUNT(str);
78 size_t sizes[SK_ARRAY_COUNT(str)];
79 for (int i = 0; i < count; ++i) {
80 sizes[i] = strlen(str[i]) + 1;
81 }
82
83 sk_sp<SkDataTable> table(SkDataTable::MakeCopyArrays((const void*const*)str, sizes, count));
84
85 REPORTER_ASSERT(reporter, table->count() == count);
86 for (int i = 0; i < count; ++i) {
87 size_t size;
88 REPORTER_ASSERT(reporter, table->atSize(i) == sizes[i]);
89 REPORTER_ASSERT(reporter, !strcmp(table->atT<const char>(i, &size),
90 str[i]));
91 REPORTER_ASSERT(reporter, size == sizes[i]);
92
93 const char* s = table->atStr(i);
94 REPORTER_ASSERT(reporter, strlen(s) == strlen(str[i]));
95 }
96 }
97
test_globaltable(skiatest::Reporter * reporter)98 static void test_globaltable(skiatest::Reporter* reporter) {
99 static const int gData[] = {
100 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
101 };
102 int count = SK_ARRAY_COUNT(gData);
103
104 sk_sp<SkDataTable> table(
105 SkDataTable::MakeArrayProc(gData, sizeof(gData[0]), count, nullptr, nullptr));
106
107 REPORTER_ASSERT(reporter, table->count() == count);
108 for (int i = 0; i < count; ++i) {
109 size_t size;
110 REPORTER_ASSERT(reporter, table->atSize(i) == sizeof(int));
111 REPORTER_ASSERT(reporter, *table->atT<const char>(i, &size) == i);
112 REPORTER_ASSERT(reporter, sizeof(int) == size);
113 }
114 }
115
DEF_TEST(DataTable,reporter)116 DEF_TEST(DataTable, reporter) {
117 test_emptytable(reporter);
118 test_simpletable(reporter);
119 test_vartable(reporter);
120 test_globaltable(reporter);
121 }
122
123 static void* gGlobal;
124
delete_int_proc(const void * ptr,void * context)125 static void delete_int_proc(const void* ptr, void* context) {
126 int* data = (int*)ptr;
127 SkASSERT(context == gGlobal);
128 delete[] data;
129 }
130
assert_len(skiatest::Reporter * reporter,const sk_sp<SkData> & ref,size_t len)131 static void assert_len(skiatest::Reporter* reporter, const sk_sp<SkData>& ref, size_t len) {
132 REPORTER_ASSERT(reporter, ref->size() == len);
133 }
134
assert_data(skiatest::Reporter * reporter,const sk_sp<SkData> & ref,const void * data,size_t len)135 static void assert_data(skiatest::Reporter* reporter, const sk_sp<SkData>& ref,
136 const void* data, size_t len) {
137 REPORTER_ASSERT(reporter, ref->size() == len);
138 REPORTER_ASSERT(reporter, !memcmp(ref->data(), data, len));
139 }
140
test_cstring(skiatest::Reporter * reporter)141 static void test_cstring(skiatest::Reporter* reporter) {
142 const char str[] = "Hello world";
143 size_t len = strlen(str);
144
145 sk_sp<SkData> r0(SkData::MakeWithCopy(str, len + 1));
146 sk_sp<SkData> r1(SkData::MakeWithCString(str));
147
148 REPORTER_ASSERT(reporter, r0->equals(r1.get()));
149
150 sk_sp<SkData> r2(SkData::MakeWithCString(nullptr));
151 REPORTER_ASSERT(reporter, 1 == r2->size());
152 REPORTER_ASSERT(reporter, 0 == *r2->bytes());
153 }
154
test_files(skiatest::Reporter * reporter)155 static void test_files(skiatest::Reporter* reporter) {
156 SkString tmpDir = skiatest::GetTmpDir();
157 if (tmpDir.isEmpty()) {
158 return;
159 }
160
161 SkString path = SkOSPath::Join(tmpDir.c_str(), "data_test");
162
163 const char s[] = "abcdefghijklmnopqrstuvwxyz";
164 {
165 SkFILEWStream writer(path.c_str());
166 if (!writer.isValid()) {
167 ERRORF(reporter, "Failed to create tmp file %s\n", path.c_str());
168 return;
169 }
170 writer.write(s, 26);
171 }
172
173 FILE* file = sk_fopen(path.c_str(), kRead_SkFILE_Flag);
174 sk_sp<SkData> r1(SkData::MakeFromFILE(file));
175 REPORTER_ASSERT(reporter, r1.get() != nullptr);
176 REPORTER_ASSERT(reporter, r1->size() == 26);
177 REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r1->data()), s, 26) == 0);
178
179 int fd = sk_fileno(file);
180 sk_sp<SkData> r2(SkData::MakeFromFD(fd));
181 REPORTER_ASSERT(reporter, r2.get() != nullptr);
182 REPORTER_ASSERT(reporter, r2->size() == 26);
183 REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r2->data()), s, 26) == 0);
184 }
185
DEF_TEST(Data,reporter)186 DEF_TEST(Data, reporter) {
187 const char* str = "We the people, in order to form a more perfect union.";
188 const int N = 10;
189
190 sk_sp<SkData> r0(SkData::MakeEmpty());
191 sk_sp<SkData> r1(SkData::MakeWithCopy(str, strlen(str)));
192 sk_sp<SkData> r2(SkData::MakeWithProc(new int[N], N*sizeof(int), delete_int_proc, gGlobal));
193 sk_sp<SkData> r3(SkData::MakeSubset(r1.get(), 7, 6));
194
195 assert_len(reporter, r0, 0);
196 assert_len(reporter, r1, strlen(str));
197 assert_len(reporter, r2, N * sizeof(int));
198 assert_len(reporter, r3, 6);
199
200 assert_data(reporter, r1, str, strlen(str));
201 assert_data(reporter, r3, "people", 6);
202
203 sk_sp<SkData> tmp(SkData::MakeSubset(r1.get(), strlen(str), 10));
204 assert_len(reporter, tmp, 0);
205 tmp = SkData::MakeSubset(r1.get(), 0, 0);
206 assert_len(reporter, tmp, 0);
207
208 test_cstring(reporter);
209 test_files(reporter);
210 }
211
212 ///////////////////////////////////////////////////////////////////////////////////////////////////
213
214 const char gABC[] = "abcdefghijklmnopqrstuvwxyz";
215
check_abcs(skiatest::Reporter * reporter,const char buffer[],size_t size)216 static void check_abcs(skiatest::Reporter* reporter, const char buffer[], size_t size) {
217 REPORTER_ASSERT(reporter, size % 26 == 0);
218 for (size_t offset = 0; offset < size; offset += 26) {
219 REPORTER_ASSERT(reporter, !memcmp(&buffer[offset], gABC, 26));
220 }
221 }
222
223 // stream should contain an integral number of copies of gABC.
check_alphabet_stream(skiatest::Reporter * reporter,SkStream * stream)224 static void check_alphabet_stream(skiatest::Reporter* reporter, SkStream* stream) {
225 REPORTER_ASSERT(reporter, stream->hasLength());
226 size_t size = stream->getLength();
227 REPORTER_ASSERT(reporter, size % 26 == 0);
228
229 SkAutoTMalloc<char> storage(size);
230 char* array = storage.get();
231 size_t bytesRead = stream->read(array, size);
232 REPORTER_ASSERT(reporter, bytesRead == size);
233 check_abcs(reporter, array, size);
234
235 // try checking backwards
236 for (size_t offset = size; offset > 0; offset -= 26) {
237 REPORTER_ASSERT(reporter, stream->seek(offset - 26));
238 REPORTER_ASSERT(reporter, stream->getPosition() == offset - 26);
239 REPORTER_ASSERT(reporter, stream->read(array, 26) == 26);
240 check_abcs(reporter, array, 26);
241 REPORTER_ASSERT(reporter, stream->getPosition() == offset);
242 }
243 }
244
245 // reader should contains an integral number of copies of gABC.
check_alphabet_buffer(skiatest::Reporter * reporter,const SkROBuffer * reader)246 static void check_alphabet_buffer(skiatest::Reporter* reporter, const SkROBuffer* reader) {
247 size_t size = reader->size();
248 REPORTER_ASSERT(reporter, size % 26 == 0);
249
250 SkAutoTMalloc<char> storage(size);
251 SkROBuffer::Iter iter(reader);
252 size_t offset = 0;
253 do {
254 SkASSERT(offset + iter.size() <= size);
255 memcpy(storage.get() + offset, iter.data(), iter.size());
256 offset += iter.size();
257 } while (iter.next());
258 REPORTER_ASSERT(reporter, offset == size);
259 check_abcs(reporter, storage.get(), size);
260 }
261
DEF_TEST(RWBuffer,reporter)262 DEF_TEST(RWBuffer, reporter) {
263 // Knowing that the default capacity is 4096, choose N large enough so we force it to use
264 // multiple buffers internally.
265 static constexpr int N = 1000;
266 SkSTArray<N, sk_sp<SkROBuffer>> readers;
267 SkSTArray<N, std::unique_ptr<SkStream>> streams;
268
269 {
270 SkRWBuffer buffer;
271 for (int i = 0; i < N; ++i) {
272 buffer.append(gABC, 26);
273 readers.push_back(buffer.makeROBufferSnapshot());
274 streams.push_back(buffer.makeStreamSnapshot());
275 }
276 REPORTER_ASSERT(reporter, N*26 == buffer.size());
277 }
278
279 // Verify that although the SkRWBuffer's destructor has run, the readers are still valid.
280 for (int i = 0; i < N; ++i) {
281 REPORTER_ASSERT(reporter, (i + 1) * 26U == readers[i]->size());
282 check_alphabet_buffer(reporter, readers[i].get());
283 check_alphabet_stream(reporter, streams[i].get());
284 }
285 }
286
DEF_TEST(RWBuffer_threaded,reporter)287 DEF_TEST(RWBuffer_threaded, reporter) {
288 // Knowing that the default capacity is 4096, choose N large enough so we force it to use
289 // multiple buffers internally.
290 const int N = 1000;
291 SkTaskGroup tasks;
292 SkRWBuffer buffer;
293 for (int i = 0; i < N; ++i) {
294 buffer.append(gABC, 26);
295 sk_sp<SkROBuffer> reader = buffer.makeROBufferSnapshot();
296 SkStream* stream = buffer.makeStreamSnapshot().release();
297 REPORTER_ASSERT(reporter, reader->size() == buffer.size());
298 REPORTER_ASSERT(reporter, stream->getLength() == buffer.size());
299
300 // reader's copy constructor will ref the SkROBuffer, which will be unreffed
301 // when the task ends.
302 // Ownership of stream is passed to the task, which will delete it.
303 tasks.add([reporter, i, reader, stream] {
304 REPORTER_ASSERT(reporter, (i + 1) * 26U == reader->size());
305 REPORTER_ASSERT(reporter, stream->getLength() == reader->size());
306 check_alphabet_buffer(reporter, reader.get());
307 check_alphabet_stream(reporter, stream);
308 REPORTER_ASSERT(reporter, stream->rewind());
309 delete stream;
310 });
311 }
312 REPORTER_ASSERT(reporter, N*26 == buffer.size());
313 tasks.wait();
314 }
315
316 // Tests that it is safe to call SkROBuffer::Iter::size() when exhausted.
DEF_TEST(RWBuffer_size,r)317 DEF_TEST(RWBuffer_size, r) {
318 SkRWBuffer buffer;
319 buffer.append(gABC, 26);
320
321 sk_sp<SkROBuffer> roBuffer(buffer.makeROBufferSnapshot());
322 SkROBuffer::Iter iter(roBuffer.get());
323 REPORTER_ASSERT(r, iter.data());
324 REPORTER_ASSERT(r, iter.size() == 26);
325
326 // There is only one block in this buffer.
327 REPORTER_ASSERT(r, !iter.next());
328 REPORTER_ASSERT(r, 0 == iter.size());
329 }
330
331 // Tests that operations (including the destructor) are safe on an SkRWBuffer
332 // without any data appended.
DEF_TEST(RWBuffer_noAppend,r)333 DEF_TEST(RWBuffer_noAppend, r) {
334 SkRWBuffer buffer;
335 REPORTER_ASSERT(r, 0 == buffer.size());
336
337 sk_sp<SkROBuffer> roBuffer = buffer.makeROBufferSnapshot();
338 REPORTER_ASSERT(r, roBuffer);
339 if (roBuffer) {
340 REPORTER_ASSERT(r, roBuffer->size() == 0);
341 SkROBuffer::Iter iter(roBuffer.get());
342 REPORTER_ASSERT(r, iter.size() == 0);
343 REPORTER_ASSERT(r, !iter.data());
344 REPORTER_ASSERT(r, !iter.next());
345 }
346
347 std::unique_ptr<SkStream> stream(buffer.makeStreamSnapshot());
348 REPORTER_ASSERT(r, stream);
349 if (stream) {
350 REPORTER_ASSERT(r, stream->hasLength());
351 REPORTER_ASSERT(r, stream->getLength() == 0);
352 REPORTER_ASSERT(r, stream->skip(10) == 0);
353 }
354 }
355