blob: 8f06a1892e827b4b63016308c923ff4e8844469a [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
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000028static void test_datatable_is_empty(skiatest::Reporter* reporter,
29 SkDataTable* table) {
30 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) {
35 SkAutoTUnref<SkDataTable> table0(SkDataTable::NewEmpty());
36 SkAutoTUnref<SkDataTable> table1(SkDataTable::NewCopyArrays(NULL, NULL, 0));
mike@reedtribe.org9ca81a72013-04-21 01:43:09 +000037 SkAutoTUnref<SkDataTable> table2(SkDataTable::NewCopyArray(NULL, 0, 0));
38 SkAutoTUnref<SkDataTable> table3(SkDataTable::NewArrayProc(NULL, 0, 0,
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000039 NULL, NULL));
40
41 test_datatable_is_empty(reporter, table0);
42 test_datatable_is_empty(reporter, table1);
43 test_datatable_is_empty(reporter, table2);
44 test_datatable_is_empty(reporter, table3);
45
46 test_is_equal(reporter, table0, table1);
47 test_is_equal(reporter, table0, table2);
48 test_is_equal(reporter, table0, table3);
49}
50
reed@google.com8c5c7a92013-04-19 20:16:01 +000051static void test_simpletable(skiatest::Reporter* reporter) {
52 const int idata[] = { 1, 4, 9, 16, 25, 63 };
53 int icount = SK_ARRAY_COUNT(idata);
54 SkAutoTUnref<SkDataTable> itable(SkDataTable::NewCopyArray(idata,
55 sizeof(idata[0]),
56 icount));
57 REPORTER_ASSERT(reporter, itable->count() == icount);
58 for (int i = 0; i < icount; ++i) {
59 size_t size;
60 REPORTER_ASSERT(reporter, sizeof(int) == itable->atSize(i));
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000061 REPORTER_ASSERT(reporter, *itable->atT<int>(i, &size) == idata[i]);
reed@google.com8c5c7a92013-04-19 20:16:01 +000062 REPORTER_ASSERT(reporter, sizeof(int) == size);
63 }
64}
65
66static void test_vartable(skiatest::Reporter* reporter) {
67 const char* str[] = {
68 "", "a", "be", "see", "deigh", "ef", "ggggggggggggggggggggggggggg"
69 };
70 int count = SK_ARRAY_COUNT(str);
71 size_t sizes[SK_ARRAY_COUNT(str)];
72 for (int i = 0; i < count; ++i) {
73 sizes[i] = strlen(str[i]) + 1;
74 }
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000075
reed@google.com8c5c7a92013-04-19 20:16:01 +000076 SkAutoTUnref<SkDataTable> table(SkDataTable::NewCopyArrays(
77 (const void*const*)str, sizes, count));
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000078
reed@google.com8c5c7a92013-04-19 20:16:01 +000079 REPORTER_ASSERT(reporter, table->count() == count);
80 for (int i = 0; i < count; ++i) {
81 size_t size;
82 REPORTER_ASSERT(reporter, table->atSize(i) == sizes[i]);
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +000083 REPORTER_ASSERT(reporter, !strcmp(table->atT<const char>(i, &size),
reed@google.com8c5c7a92013-04-19 20:16:01 +000084 str[i]));
85 REPORTER_ASSERT(reporter, size == sizes[i]);
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000086
reed@google.com8c5c7a92013-04-19 20:16:01 +000087 const char* s = table->atStr(i);
88 REPORTER_ASSERT(reporter, strlen(s) == strlen(str[i]));
89 }
90}
91
92static void test_tablebuilder(skiatest::Reporter* reporter) {
93 const char* str[] = {
94 "", "a", "be", "see", "deigh", "ef", "ggggggggggggggggggggggggggg"
95 };
96 int count = SK_ARRAY_COUNT(str);
97
98 SkDataTableBuilder builder(16);
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +000099
reed@google.com8c5c7a92013-04-19 20:16:01 +0000100 for (int i = 0; i < count; ++i) {
101 builder.append(str[i], strlen(str[i]) + 1);
102 }
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000103 SkAutoTUnref<SkDataTable> table(builder.detachDataTable());
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +0000104
reed@google.com8c5c7a92013-04-19 20:16:01 +0000105 REPORTER_ASSERT(reporter, table->count() == count);
106 for (int i = 0; i < count; ++i) {
107 size_t size;
108 REPORTER_ASSERT(reporter, table->atSize(i) == strlen(str[i]) + 1);
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000109 REPORTER_ASSERT(reporter, !strcmp(table->atT<const char>(i, &size),
reed@google.com8c5c7a92013-04-19 20:16:01 +0000110 str[i]));
111 REPORTER_ASSERT(reporter, size == strlen(str[i]) + 1);
skia.committer@gmail.com64b682c2013-04-20 07:01:07 +0000112
reed@google.com8c5c7a92013-04-19 20:16:01 +0000113 const char* s = table->atStr(i);
114 REPORTER_ASSERT(reporter, strlen(s) == strlen(str[i]));
115 }
116}
117
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000118static void test_globaltable(skiatest::Reporter* reporter) {
119 static const int gData[] = {
120 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
121 };
122 int count = SK_ARRAY_COUNT(gData);
123
124 SkAutoTUnref<SkDataTable> table(SkDataTable::NewArrayProc(gData,
125 sizeof(gData[0]), count, NULL, NULL));
rmistry@google.comc9f3b382013-04-22 12:45:30 +0000126
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000127 REPORTER_ASSERT(reporter, table->count() == count);
128 for (int i = 0; i < count; ++i) {
129 size_t size;
130 REPORTER_ASSERT(reporter, table->atSize(i) == sizeof(int));
131 REPORTER_ASSERT(reporter, *table->atT<const char>(i, &size) == i);
132 REPORTER_ASSERT(reporter, sizeof(int) == size);
133 }
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000134}
135
tfarina@chromium.orge4fafb12013-12-12 21:11:12 +0000136DEF_TEST(DataTable, reporter) {
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000137 test_emptytable(reporter);
reed@google.com8c5c7a92013-04-19 20:16:01 +0000138 test_simpletable(reporter);
139 test_vartable(reporter);
140 test_tablebuilder(reporter);
mike@reedtribe.orgcac3ae32013-04-21 01:37:46 +0000141 test_globaltable(reporter);
reed@google.com8c5c7a92013-04-19 20:16:01 +0000142}
143
reed@google.com1622c992011-06-14 19:22:21 +0000144static void* gGlobal;
145
reed6b7f34e2015-06-17 09:58:24 -0700146static void delete_int_proc(const void* ptr, void* context) {
reed@google.com1622c992011-06-14 19:22:21 +0000147 int* data = (int*)ptr;
148 SkASSERT(context == gGlobal);
149 delete[] data;
150}
151
reed@google.com8d0b5772011-06-24 13:07:31 +0000152static void assert_len(skiatest::Reporter* reporter, SkData* ref, size_t len) {
reed@google.com1622c992011-06-14 19:22:21 +0000153 REPORTER_ASSERT(reporter, ref->size() == len);
154}
155
reed@google.com8d0b5772011-06-24 13:07:31 +0000156static void assert_data(skiatest::Reporter* reporter, SkData* ref,
reed@google.com1622c992011-06-14 19:22:21 +0000157 const void* data, size_t len) {
158 REPORTER_ASSERT(reporter, ref->size() == len);
159 REPORTER_ASSERT(reporter, !memcmp(ref->data(), data, len));
160}
161
reed@google.comdbc936d2012-06-28 15:40:09 +0000162static void test_cstring(skiatest::Reporter* reporter) {
163 const char str[] = "Hello world";
164 size_t len = strlen(str);
165
reed@google.coma63a8512012-07-02 20:29:00 +0000166 SkAutoTUnref<SkData> r0(SkData::NewWithCopy(str, len + 1));
reed@google.comdbc936d2012-06-28 15:40:09 +0000167 SkAutoTUnref<SkData> r1(SkData::NewWithCString(str));
168
169 REPORTER_ASSERT(reporter, r0->equals(r1));
170
171 SkAutoTUnref<SkData> r2(SkData::NewWithCString(NULL));
reed@google.coma63a8512012-07-02 20:29:00 +0000172 REPORTER_ASSERT(reporter, 1 == r2->size());
173 REPORTER_ASSERT(reporter, 0 == *r2->bytes());
reed@google.comdbc936d2012-06-28 15:40:09 +0000174}
175
bungeman@google.com11c9a552013-06-03 17:10:35 +0000176static void test_files(skiatest::Reporter* reporter) {
halcanary87f3ba42015-01-20 09:30:20 -0800177 SkString tmpDir = skiatest::GetTmpDir();
scroggo@google.com99d43ff2013-06-07 14:30:36 +0000178 if (tmpDir.isEmpty()) {
bungeman@google.com11c9a552013-06-03 17:10:35 +0000179 return;
180 }
skia.committer@gmail.com11f2b442013-06-04 07:00:53 +0000181
tfarinaa8e2e152014-07-28 19:26:58 -0700182 SkString path = SkOSPath::Join(tmpDir.c_str(), "data_test");
skia.committer@gmail.com11f2b442013-06-04 07:00:53 +0000183
bungeman@google.com11c9a552013-06-03 17:10:35 +0000184 const char s[] = "abcdefghijklmnopqrstuvwxyz";
185 {
186 SkFILEWStream writer(path.c_str());
187 if (!writer.isValid()) {
halcanary@google.coma9325fa2014-01-10 14:58:10 +0000188 ERRORF(reporter, "Failed to create tmp file %s\n", path.c_str());
bungeman@google.com11c9a552013-06-03 17:10:35 +0000189 return;
190 }
191 writer.write(s, 26);
192 }
193
194 SkFILE* file = sk_fopen(path.c_str(), kRead_SkFILE_Flag);
195 SkAutoTUnref<SkData> r1(SkData::NewFromFILE(file));
196 REPORTER_ASSERT(reporter, r1.get() != NULL);
197 REPORTER_ASSERT(reporter, r1->size() == 26);
198 REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r1->data()), s, 26) == 0);
skia.committer@gmail.com11f2b442013-06-04 07:00:53 +0000199
bungeman@google.com11c9a552013-06-03 17:10:35 +0000200 int fd = sk_fileno(file);
201 SkAutoTUnref<SkData> r2(SkData::NewFromFD(fd));
202 REPORTER_ASSERT(reporter, r2.get() != NULL);
203 REPORTER_ASSERT(reporter, r2->size() == 26);
204 REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r2->data()), s, 26) == 0);
205}
206
tfarina@chromium.orge4fafb12013-12-12 21:11:12 +0000207DEF_TEST(Data, reporter) {
reed@google.com1622c992011-06-14 19:22:21 +0000208 const char* str = "We the people, in order to form a more perfect union.";
209 const int N = 10;
210
reed@google.comdbc936d2012-06-28 15:40:09 +0000211 SkAutoTUnref<SkData> r0(SkData::NewEmpty());
212 SkAutoTUnref<SkData> r1(SkData::NewWithCopy(str, strlen(str)));
213 SkAutoTUnref<SkData> r2(SkData::NewWithProc(new int[N], N*sizeof(int),
214 delete_int_proc, gGlobal));
215 SkAutoTUnref<SkData> r3(SkData::NewSubset(r1, 7, 6));
reed@google.com1622c992011-06-14 19:22:21 +0000216
reed@google.com1622c992011-06-14 19:22:21 +0000217 assert_len(reporter, r0, 0);
218 assert_len(reporter, r1, strlen(str));
219 assert_len(reporter, r2, N * sizeof(int));
220 assert_len(reporter, r3, 6);
rmistry@google.comd6176b02012-08-23 18:14:13 +0000221
reed@google.com1622c992011-06-14 19:22:21 +0000222 assert_data(reporter, r1, str, strlen(str));
223 assert_data(reporter, r3, "people", 6);
224
reed@google.com8d0b5772011-06-24 13:07:31 +0000225 SkData* tmp = SkData::NewSubset(r1, strlen(str), 10);
reed@google.com1622c992011-06-14 19:22:21 +0000226 assert_len(reporter, tmp, 0);
227 tmp->unref();
reed@google.com8d0b5772011-06-24 13:07:31 +0000228 tmp = SkData::NewSubset(r1, 0, 0);
reed@google.com1622c992011-06-14 19:22:21 +0000229 assert_len(reporter, tmp, 0);
230 tmp->unref();
rmistry@google.comd6176b02012-08-23 18:14:13 +0000231
reed@google.comdbc936d2012-06-28 15:40:09 +0000232 test_cstring(reporter);
bungeman@google.com11c9a552013-06-03 17:10:35 +0000233 test_files(reporter);
reed@google.com1622c992011-06-14 19:22:21 +0000234}
reed5b6db072015-04-28 17:50:31 -0700235
236///////////////////////////////////////////////////////////////////////////////////////////////////
237#include "SkRWBuffer.h"
238
239const char gABC[] = "abcdefghijklmnopqrstuvwxyz";
240
241static void check_abcs(skiatest::Reporter* reporter, const char buffer[], size_t size) {
242 REPORTER_ASSERT(reporter, size % 26 == 0);
243 for (size_t offset = 0; offset < size; offset += 26) {
244 REPORTER_ASSERT(reporter, !memcmp(&buffer[offset], gABC, 26));
245 }
246}
247
248// stream should contains an integral number of copies of gABC.
249static void check_alphabet_stream(skiatest::Reporter* reporter, SkStream* stream) {
250 REPORTER_ASSERT(reporter, stream->hasLength());
251 size_t size = stream->getLength();
252 REPORTER_ASSERT(reporter, size % 26 == 0);
253
254 SkAutoTMalloc<char> storage(size);
255 char* array = storage.get();
256 size_t bytesRead = stream->read(array, size);
257 REPORTER_ASSERT(reporter, bytesRead == size);
258 check_abcs(reporter, array, size);
259
260 // try checking backwards
261 for (size_t offset = size; offset > 0; offset -= 26) {
262 REPORTER_ASSERT(reporter, stream->seek(offset - 26));
263 REPORTER_ASSERT(reporter, stream->getPosition() == offset - 26);
264 REPORTER_ASSERT(reporter, stream->read(array, 26) == 26);
265 check_abcs(reporter, array, 26);
266 REPORTER_ASSERT(reporter, stream->getPosition() == offset);
267 }
268}
269
270// reader should contains an integral number of copies of gABC.
271static void check_alphabet_buffer(skiatest::Reporter* reporter, const SkROBuffer* reader) {
272 size_t size = reader->size();
273 REPORTER_ASSERT(reporter, size % 26 == 0);
274
275 SkAutoTMalloc<char> storage(size);
276 SkROBuffer::Iter iter(reader);
277 size_t offset = 0;
278 do {
279 SkASSERT(offset + iter.size() <= size);
280 memcpy(storage.get() + offset, iter.data(), iter.size());
281 offset += iter.size();
282 } while (iter.next());
283 REPORTER_ASSERT(reporter, offset == size);
284 check_abcs(reporter, storage.get(), size);
285}
286
287DEF_TEST(RWBuffer, 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 SkROBuffer* readers[N];
292 SkStream* streams[N];
293
294 {
295 SkRWBuffer buffer;
296 for (int i = 0; i < N; ++i) {
297 if (0 == (i & 1)) {
298 buffer.append(gABC, 26);
299 } else {
300 memcpy(buffer.append(26), gABC, 26);
301 }
302 readers[i] = buffer.newRBufferSnapshot();
303 streams[i] = buffer.newStreamSnapshot();
304 }
305 REPORTER_ASSERT(reporter, N*26 == buffer.size());
306 }
307
308 for (int i = 0; i < N; ++i) {
309 REPORTER_ASSERT(reporter, (i + 1) * 26U == readers[i]->size());
310 check_alphabet_buffer(reporter, readers[i]);
311 check_alphabet_stream(reporter, streams[i]);
312 readers[i]->unref();
313 SkDELETE(streams[i]);
314 }
315}