DataRefTest.cpp 12 KB

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