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 "include/core/SkData.h"
9 #include "include/core/SkDataTable.h"
10 #include "include/core/SkRefCnt.h"
11 #include "include/core/SkStream.h"
12 #include "include/core/SkString.h"
13 #include "include/core/SkTypes.h"
14 #include "include/private/base/SkMalloc.h"
15 #include "src/core/SkOSFile.h"
16 #include "src/utils/SkOSPath.h"
17 #include "tests/Test.h"
18
19 #include <array>
20 #include <cstdio>
21 #include <cstring>
22
test_is_equal(skiatest::Reporter * reporter,const SkDataTable * a,const SkDataTable * b)23 static void test_is_equal(skiatest::Reporter* reporter,
24 const SkDataTable* a, const SkDataTable* b) {
25 REPORTER_ASSERT(reporter, a->count() == b->count());
26 for (int i = 0; i < a->count(); ++i) {
27 size_t sizea, sizeb;
28 const void* mema = a->at(i, &sizea);
29 const void* memb = b->at(i, &sizeb);
30 REPORTER_ASSERT(reporter, sizea == sizeb);
31 REPORTER_ASSERT(reporter, !memcmp(mema, memb, sizea));
32 }
33 }
34
test_datatable_is_empty(skiatest::Reporter * reporter,SkDataTable * table)35 static void test_datatable_is_empty(skiatest::Reporter* reporter, SkDataTable* table) {
36 REPORTER_ASSERT(reporter, table->isEmpty());
37 REPORTER_ASSERT(reporter, 0 == table->count());
38 }
39
test_emptytable(skiatest::Reporter * reporter)40 static void test_emptytable(skiatest::Reporter* reporter) {
41 sk_sp<SkDataTable> table0(SkDataTable::MakeEmpty());
42 sk_sp<SkDataTable> table1(SkDataTable::MakeCopyArrays(nullptr, nullptr, 0));
43 sk_sp<SkDataTable> table2(SkDataTable::MakeCopyArray(nullptr, 0, 0));
44 sk_sp<SkDataTable> table3(SkDataTable::MakeArrayProc(nullptr, 0, 0, nullptr, nullptr));
45
46 test_datatable_is_empty(reporter, table0.get());
47 test_datatable_is_empty(reporter, table1.get());
48 test_datatable_is_empty(reporter, table2.get());
49 test_datatable_is_empty(reporter, table3.get());
50
51 test_is_equal(reporter, table0.get(), table1.get());
52 test_is_equal(reporter, table0.get(), table2.get());
53 test_is_equal(reporter, table0.get(), table3.get());
54 }
55
test_simpletable(skiatest::Reporter * reporter)56 static void test_simpletable(skiatest::Reporter* reporter) {
57 const int idata[] = { 1, 4, 9, 16, 25, 63 };
58 int icount = std::size(idata);
59 sk_sp<SkDataTable> itable(SkDataTable::MakeCopyArray(idata, sizeof(idata[0]), icount));
60 REPORTER_ASSERT(reporter, itable->count() == icount);
61 for (int i = 0; i < icount; ++i) {
62 size_t size;
63 REPORTER_ASSERT(reporter, sizeof(int) == itable->atSize(i));
64 REPORTER_ASSERT(reporter, *itable->atT<int>(i, &size) == idata[i]);
65 REPORTER_ASSERT(reporter, sizeof(int) == size);
66 }
67 }
68
test_vartable(skiatest::Reporter * reporter)69 static void test_vartable(skiatest::Reporter* reporter) {
70 const char* str[] = {
71 "", "a", "be", "see", "deigh", "ef", "ggggggggggggggggggggggggggg"
72 };
73 int count = std::size(str);
74 size_t sizes[std::size(str)];
75 for (int i = 0; i < count; ++i) {
76 sizes[i] = strlen(str[i]) + 1;
77 }
78
79 sk_sp<SkDataTable> table(SkDataTable::MakeCopyArrays((const void*const*)str, sizes, count));
80
81 REPORTER_ASSERT(reporter, table->count() == count);
82 for (int i = 0; i < count; ++i) {
83 size_t size;
84 REPORTER_ASSERT(reporter, table->atSize(i) == sizes[i]);
85 REPORTER_ASSERT(reporter, !strcmp(table->atT<const char>(i, &size),
86 str[i]));
87 REPORTER_ASSERT(reporter, size == sizes[i]);
88
89 const char* s = table->atStr(i);
90 REPORTER_ASSERT(reporter, strlen(s) == strlen(str[i]));
91 }
92 }
93
test_globaltable(skiatest::Reporter * reporter)94 static void test_globaltable(skiatest::Reporter* reporter) {
95 static const int gData[] = {
96 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
97 };
98 int count = std::size(gData);
99
100 sk_sp<SkDataTable> table(
101 SkDataTable::MakeArrayProc(gData, sizeof(gData[0]), count, nullptr, nullptr));
102
103 REPORTER_ASSERT(reporter, table->count() == count);
104 for (int i = 0; i < count; ++i) {
105 size_t size;
106 REPORTER_ASSERT(reporter, table->atSize(i) == sizeof(int));
107 REPORTER_ASSERT(reporter, *table->atT<const char>(i, &size) == i);
108 REPORTER_ASSERT(reporter, sizeof(int) == size);
109 }
110 }
111
DEF_TEST(DataTable,reporter)112 DEF_TEST(DataTable, reporter) {
113 test_emptytable(reporter);
114 test_simpletable(reporter);
115 test_vartable(reporter);
116 test_globaltable(reporter);
117 }
118
119 static void* gGlobal;
120
delete_int_proc(const void * ptr,void * context)121 static void delete_int_proc(const void* ptr, void* context) {
122 const int* data = (const int*)ptr;
123 SkASSERT(context == gGlobal);
124 delete[] data;
125 }
126
assert_len(skiatest::Reporter * reporter,const sk_sp<SkData> & ref,size_t len)127 static void assert_len(skiatest::Reporter* reporter, const sk_sp<SkData>& ref, size_t len) {
128 REPORTER_ASSERT(reporter, ref->size() == len);
129 }
130
assert_data(skiatest::Reporter * reporter,const sk_sp<SkData> & ref,const void * data,size_t len)131 static void assert_data(skiatest::Reporter* reporter, const sk_sp<SkData>& ref,
132 const void* data, size_t len) {
133 REPORTER_ASSERT(reporter, ref->size() == len);
134 REPORTER_ASSERT(reporter, !memcmp(ref->data(), data, len));
135 }
136
test_cstring(skiatest::Reporter * reporter)137 static void test_cstring(skiatest::Reporter* reporter) {
138 const char str[] = "Hello world";
139 size_t len = strlen(str);
140
141 sk_sp<SkData> r0(SkData::MakeWithCopy(str, len + 1));
142 sk_sp<SkData> r1(SkData::MakeWithCString(str));
143
144 REPORTER_ASSERT(reporter, r0->equals(r1.get()));
145
146 sk_sp<SkData> r2(SkData::MakeWithCString(nullptr));
147 REPORTER_ASSERT(reporter, 1 == r2->size());
148 REPORTER_ASSERT(reporter, 0 == *r2->bytes());
149 }
150
test_files(skiatest::Reporter * reporter)151 static void test_files(skiatest::Reporter* reporter) {
152 SkString tmpDir = skiatest::GetTmpDir();
153 if (tmpDir.isEmpty()) {
154 return;
155 }
156
157 SkString path = SkOSPath::Join(tmpDir.c_str(), "data_test");
158
159 const char s[] = "abcdefghijklmnopqrstuvwxyz";
160 {
161 SkFILEWStream writer(path.c_str());
162 if (!writer.isValid()) {
163 ERRORF(reporter, "Failed to create tmp file %s\n", path.c_str());
164 return;
165 }
166 writer.write(s, 26);
167 }
168
169 FILE* file = sk_fopen(path.c_str(), kRead_SkFILE_Flag);
170 sk_sp<SkData> r1(SkData::MakeFromFILE(file));
171 REPORTER_ASSERT(reporter, r1.get() != nullptr);
172 REPORTER_ASSERT(reporter, r1->size() == 26);
173 REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r1->data()), s, 26) == 0);
174
175 int fd = sk_fileno(file);
176 sk_sp<SkData> r2(SkData::MakeFromFD(fd));
177 REPORTER_ASSERT(reporter, r2.get() != nullptr);
178 REPORTER_ASSERT(reporter, r2->size() == 26);
179 REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r2->data()), s, 26) == 0);
180 }
181
DEF_TEST(Data,reporter)182 DEF_TEST(Data, reporter) {
183 const char* str = "We the people, in order to form a more perfect union.";
184 const int N = 10;
185
186 sk_sp<SkData> r0(SkData::MakeEmpty());
187 sk_sp<SkData> r1(SkData::MakeWithCopy(str, strlen(str)));
188 sk_sp<SkData> r2(SkData::MakeWithProc(new int[N], N*sizeof(int), delete_int_proc, gGlobal));
189 sk_sp<SkData> r3(SkData::MakeSubset(r1.get(), 7, 6));
190
191 assert_len(reporter, r0, 0);
192 assert_len(reporter, r1, strlen(str));
193 assert_len(reporter, r2, N * sizeof(int));
194 assert_len(reporter, r3, 6);
195
196 assert_data(reporter, r1, str, strlen(str));
197 assert_data(reporter, r3, "people", 6);
198
199 sk_sp<SkData> tmp(SkData::MakeSubset(r1.get(), strlen(str), 10));
200 assert_len(reporter, tmp, 0);
201 tmp = SkData::MakeSubset(r1.get(), 0, 0);
202 assert_len(reporter, tmp, 0);
203
204 test_cstring(reporter);
205 test_files(reporter);
206 }
207
DEF_TEST(Data_empty,reporter)208 DEF_TEST(Data_empty, reporter) {
209 sk_sp<SkData> array[] = {
210 SkData::MakeEmpty(),
211 SkData::MakeUninitialized(0),
212 SkData::MakeFromMalloc(sk_malloc_throw(0), 0),
213 SkData::MakeWithCopy("", 0),
214 SkData::MakeWithProc(nullptr, 0, [](const void*, void*){}, nullptr),
215 SkData::MakeWithoutCopy(nullptr, 0),
216 };
217 constexpr int N = std::size(array);
218
219 for (int i = 0; i < N; ++i) {
220 REPORTER_ASSERT(reporter, array[i]->size() == 0);
221 for (int j = 0; j < N; ++j) {
222 REPORTER_ASSERT(reporter, array[i]->equals(array[j].get()));
223 }
224 }
225 }
226