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