tests/DataRefTest.cpp - platform/external/skqp - Gitiles

 /*
  * Copyright 2011 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */

 #include "SkData.h"
 #include "SkDataTable.h"
 #include "SkOSFile.h"
 #include "SkOSPath.h"
 #include "SkReadBuffer.h"
 #include "SkWriteBuffer.h"
 #include "SkStream.h"
 #include "Test.h"

 static void test_is_equal(skiatest::Reporter* reporter,
                           const SkDataTable* a, const SkDataTable* b) {
     REPORTER_ASSERT(reporter, a->count() == b->count());
     for (int i = 0; i < a->count(); ++i) {
         size_t sizea, sizeb;
         const void* mema = a->at(i, &sizea);
         const void* memb = b->at(i, &sizeb);
         REPORTER_ASSERT(reporter, sizea == sizeb);
         REPORTER_ASSERT(reporter, !memcmp(mema, memb, sizea));
     }
 }

 static void test_datatable_is_empty(skiatest::Reporter* reporter, SkDataTable* table) {
     REPORTER_ASSERT(reporter, table->isEmpty());
     REPORTER_ASSERT(reporter, 0 == table->count());
 }

 static void test_emptytable(skiatest::Reporter* reporter) {
     sk_sp<SkDataTable> table0(SkDataTable::MakeEmpty());
     sk_sp<SkDataTable> table1(SkDataTable::MakeCopyArrays(nullptr, nullptr, 0));
     sk_sp<SkDataTable> table2(SkDataTable::MakeCopyArray(nullptr, 0, 0));
     sk_sp<SkDataTable> table3(SkDataTable::MakeArrayProc(nullptr, 0, 0, nullptr, nullptr));

     test_datatable_is_empty(reporter, table0.get());
     test_datatable_is_empty(reporter, table1.get());
     test_datatable_is_empty(reporter, table2.get());
     test_datatable_is_empty(reporter, table3.get());

     test_is_equal(reporter, table0.get(), table1.get());
     test_is_equal(reporter, table0.get(), table2.get());
     test_is_equal(reporter, table0.get(), table3.get());
 }

 static void test_simpletable(skiatest::Reporter* reporter) {
     const int idata[] = { 1, 4, 9, 16, 25, 63 };
     int icount = SK_ARRAY_COUNT(idata);
     sk_sp<SkDataTable> itable(SkDataTable::MakeCopyArray(idata, sizeof(idata[0]), icount));
     REPORTER_ASSERT(reporter, itable->count() == icount);
     for (int i = 0; i < icount; ++i) {
         size_t size;
         REPORTER_ASSERT(reporter, sizeof(int) == itable->atSize(i));
         REPORTER_ASSERT(reporter, *itable->atT<int>(i, &size) == idata[i]);
         REPORTER_ASSERT(reporter, sizeof(int) == size);
     }
 }

 static void test_vartable(skiatest::Reporter* reporter) {
     const char* str[] = {
         "", "a", "be", "see", "deigh", "ef", "ggggggggggggggggggggggggggg"
     };
     int count = SK_ARRAY_COUNT(str);
     size_t sizes[SK_ARRAY_COUNT(str)];
     for (int i = 0; i < count; ++i) {
         sizes[i] = strlen(str[i]) + 1;
     }

     sk_sp<SkDataTable> table(SkDataTable::MakeCopyArrays((const void*const*)str, sizes, count));

     REPORTER_ASSERT(reporter, table->count() == count);
     for (int i = 0; i < count; ++i) {
         size_t size;
         REPORTER_ASSERT(reporter, table->atSize(i) == sizes[i]);
         REPORTER_ASSERT(reporter, !strcmp(table->atT<const char>(i, &size),
                                           str[i]));
         REPORTER_ASSERT(reporter, size == sizes[i]);

         const char* s = table->atStr(i);
         REPORTER_ASSERT(reporter, strlen(s) == strlen(str[i]));
     }
 }

 static void test_globaltable(skiatest::Reporter* reporter) {
     static const int gData[] = {
         0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
     };
     int count = SK_ARRAY_COUNT(gData);

     sk_sp<SkDataTable> table(
         SkDataTable::MakeArrayProc(gData, sizeof(gData[0]), count, nullptr, nullptr));

     REPORTER_ASSERT(reporter, table->count() == count);
     for (int i = 0; i < count; ++i) {
         size_t size;
         REPORTER_ASSERT(reporter, table->atSize(i) == sizeof(int));
         REPORTER_ASSERT(reporter, *table->atT<const char>(i, &size) == i);
         REPORTER_ASSERT(reporter, sizeof(int) == size);
     }
 }

 DEF_TEST(DataTable, reporter) {
     test_emptytable(reporter);
     test_simpletable(reporter);
     test_vartable(reporter);
     test_globaltable(reporter);
 }

 static void* gGlobal;

 static void delete_int_proc(const void* ptr, void* context) {
     int* data = (int*)ptr;
     SkASSERT(context == gGlobal);
     delete[] data;
 }

 static void assert_len(skiatest::Reporter* reporter, const sk_sp<SkData>& ref, size_t len) {
     REPORTER_ASSERT(reporter, ref->size() == len);
 }

 static void assert_data(skiatest::Reporter* reporter, const sk_sp<SkData>& ref,
                         const void* data, size_t len) {
     REPORTER_ASSERT(reporter, ref->size() == len);
     REPORTER_ASSERT(reporter, !memcmp(ref->data(), data, len));
 }

 static void test_cstring(skiatest::Reporter* reporter) {
     const char str[] = "Hello world";
     size_t     len = strlen(str);

     sk_sp<SkData> r0(SkData::MakeWithCopy(str, len + 1));
     sk_sp<SkData> r1(SkData::MakeWithCString(str));

     REPORTER_ASSERT(reporter, r0->equals(r1.get()));

     sk_sp<SkData> r2(SkData::MakeWithCString(nullptr));
     REPORTER_ASSERT(reporter, 1 == r2->size());
     REPORTER_ASSERT(reporter, 0 == *r2->bytes());
 }

 static void test_files(skiatest::Reporter* reporter) {
     SkString tmpDir = skiatest::GetTmpDir();
     if (tmpDir.isEmpty()) {
         return;
     }

     SkString path = SkOSPath::Join(tmpDir.c_str(), "data_test");

     const char s[] = "abcdefghijklmnopqrstuvwxyz";
     {
         SkFILEWStream writer(path.c_str());
         if (!writer.isValid()) {
             ERRORF(reporter, "Failed to create tmp file %s\n", path.c_str());
             return;
         }
         writer.write(s, 26);
     }

     FILE* file = sk_fopen(path.c_str(), kRead_SkFILE_Flag);
     sk_sp<SkData> r1(SkData::MakeFromFILE(file));
     REPORTER_ASSERT(reporter, r1.get() != nullptr);
     REPORTER_ASSERT(reporter, r1->size() == 26);
     REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r1->data()), s, 26) == 0);

     int fd = sk_fileno(file);
     sk_sp<SkData> r2(SkData::MakeFromFD(fd));
     REPORTER_ASSERT(reporter, r2.get() != nullptr);
     REPORTER_ASSERT(reporter, r2->size() == 26);
     REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r2->data()), s, 26) == 0);
 }

 DEF_TEST(Data, reporter) {
     const char* str = "We the people, in order to form a more perfect union.";
     const int N = 10;

     sk_sp<SkData> r0(SkData::MakeEmpty());
     sk_sp<SkData> r1(SkData::MakeWithCopy(str, strlen(str)));
     sk_sp<SkData> r2(SkData::MakeWithProc(new int[N], N*sizeof(int), delete_int_proc, gGlobal));
     sk_sp<SkData> r3(SkData::MakeSubset(r1.get(), 7, 6));

     assert_len(reporter, r0, 0);
     assert_len(reporter, r1, strlen(str));
     assert_len(reporter, r2, N * sizeof(int));
     assert_len(reporter, r3, 6);

     assert_data(reporter, r1, str, strlen(str));
     assert_data(reporter, r3, "people", 6);

     sk_sp<SkData> tmp(SkData::MakeSubset(r1.get(), strlen(str), 10));
     assert_len(reporter, tmp, 0);
     tmp = SkData::MakeSubset(r1.get(), 0, 0);
     assert_len(reporter, tmp, 0);

     test_cstring(reporter);
     test_files(reporter);
 }

 ///////////////////////////////////////////////////////////////////////////////////////////////////
 #include "SkRWBuffer.h"

 const char gABC[] = "abcdefghijklmnopqrstuvwxyz";

 static void check_abcs(skiatest::Reporter* reporter, const char buffer[], size_t size) {
     REPORTER_ASSERT(reporter, size % 26 == 0);
     for (size_t offset = 0; offset < size; offset += 26) {
         REPORTER_ASSERT(reporter, !memcmp(&buffer[offset], gABC, 26));
     }
 }

 // stream should contain an integral number of copies of gABC.
 static void check_alphabet_stream(skiatest::Reporter* reporter, SkStream* stream) {
     REPORTER_ASSERT(reporter, stream->hasLength());
     size_t size = stream->getLength();
     REPORTER_ASSERT(reporter, size % 26 == 0);

     SkAutoTMalloc<char> storage(size);
     char* array = storage.get();
     size_t bytesRead = stream->read(array, size);
     REPORTER_ASSERT(reporter, bytesRead == size);
     check_abcs(reporter, array, size);

     // try checking backwards
     for (size_t offset = size; offset > 0; offset -= 26) {
         REPORTER_ASSERT(reporter, stream->seek(offset - 26));
         REPORTER_ASSERT(reporter, stream->getPosition() == offset - 26);
         REPORTER_ASSERT(reporter, stream->read(array, 26) == 26);
         check_abcs(reporter, array, 26);
         REPORTER_ASSERT(reporter, stream->getPosition() == offset);
     }
 }

 // reader should contains an integral number of copies of gABC.
 static void check_alphabet_buffer(skiatest::Reporter* reporter, const SkROBuffer* reader) {
     size_t size = reader->size();
     REPORTER_ASSERT(reporter, size % 26 == 0);

     SkAutoTMalloc<char> storage(size);
     SkROBuffer::Iter iter(reader);
     size_t offset = 0;
     do {
         SkASSERT(offset + iter.size() <= size);
         memcpy(storage.get() + offset, iter.data(), iter.size());
         offset += iter.size();
     } while (iter.next());
     REPORTER_ASSERT(reporter, offset == size);
     check_abcs(reporter, storage.get(), size);
 }

 #include "SkTaskGroup.h"

 DEF_TEST(RWBuffer, reporter) {
     // Knowing that the default capacity is 4096, choose N large enough so we force it to use
     // multiple buffers internally.
     const int N = 1000;
     SkROBuffer* readers[N];
     SkStream* streams[N];

     {
         SkRWBuffer buffer;
         for (int i = 0; i < N; ++i) {
             buffer.append(gABC, 26);
             readers[i] = buffer.newRBufferSnapshot();
             streams[i] = buffer.newStreamSnapshot();
         }
         REPORTER_ASSERT(reporter, N*26 == buffer.size());
     }

     // Verify that although the SkRWBuffer's destructor has run, the readers are still valid.
     for (int i = 0; i < N; ++i) {
         REPORTER_ASSERT(reporter, (i + 1) * 26U == readers[i]->size());
         check_alphabet_buffer(reporter, readers[i]);
         check_alphabet_stream(reporter, streams[i]);
         readers[i]->unref();
         delete streams[i];
     }
 }

 DEF_TEST(RWBuffer_threaded, reporter) {
     // Knowing that the default capacity is 4096, choose N large enough so we force it to use
     // multiple buffers internally.
     const int N = 1000;
     SkTaskGroup tasks;
     SkRWBuffer buffer;
     for (int i = 0; i < N; ++i) {
         buffer.append(gABC, 26);
         sk_sp<SkROBuffer> reader = sk_sp<SkROBuffer>(buffer.newRBufferSnapshot());
         SkStream* stream = buffer.newStreamSnapshot();
         REPORTER_ASSERT(reporter, reader->size() == buffer.size());
         REPORTER_ASSERT(reporter, stream->getLength() == buffer.size());

         // reader's copy constructor will ref the SkROBuffer, which will be unreffed
         // when the task ends.
         // Ownership of stream is passed to the task, which will delete it.
         tasks.add([reporter, i, reader, stream] {
             REPORTER_ASSERT(reporter, (i + 1) * 26U == reader->size());
             REPORTER_ASSERT(reporter, stream->getLength() == reader->size());
             check_alphabet_buffer(reporter, reader.get());
             check_alphabet_stream(reporter, stream);
             REPORTER_ASSERT(reporter, stream->rewind());
             delete stream;
         });
     }
     REPORTER_ASSERT(reporter, N*26 == buffer.size());
     tasks.wait();
 }

 // Tests that it is safe to call SkROBuffer::Iter::size() when exhausted.
 DEF_TEST(RWBuffer_size, r) {
     SkRWBuffer buffer;
     buffer.append(gABC, 26);

     sk_sp<SkROBuffer> roBuffer(buffer.newRBufferSnapshot());
     SkROBuffer::Iter iter(roBuffer.get());
     REPORTER_ASSERT(r, iter.data());
     REPORTER_ASSERT(r, iter.size() == 26);

     // There is only one block in this buffer.
     REPORTER_ASSERT(r, !iter.next());
     REPORTER_ASSERT(r, 0 == iter.size());
 }

 // Tests that operations (including the destructor) are safe on an SkRWBuffer
 // without any data appended.
 DEF_TEST(RWBuffer_noAppend, r) {
     SkRWBuffer buffer;
     REPORTER_ASSERT(r, 0 == buffer.size());

     sk_sp<SkROBuffer> roBuffer = sk_sp<SkROBuffer>(buffer.newRBufferSnapshot());
     REPORTER_ASSERT(r, roBuffer);
     if (roBuffer) {
         REPORTER_ASSERT(r, roBuffer->size() == 0);
         SkROBuffer::Iter iter(roBuffer.get());
         REPORTER_ASSERT(r, iter.size() == 0);
         REPORTER_ASSERT(r, !iter.data());
         REPORTER_ASSERT(r, !iter.next());
     }

     std::unique_ptr<SkStream> stream(buffer.newStreamSnapshot());
     REPORTER_ASSERT(r, stream);
     if (stream) {
         REPORTER_ASSERT(r, stream->hasLength());
         REPORTER_ASSERT(r, stream->getLength() == 0);
         REPORTER_ASSERT(r, stream->skip(10) == 0);
     }
 }
	/*
	* Copyright 2011 Google Inc.
	*
	* Use of this source code is governed by a BSD-style license that can be
	* found in the LICENSE file.
	*/

	#include "SkData.h"
	#include "SkDataTable.h"
	#include "SkOSFile.h"
	#include "SkOSPath.h"
	#include "SkReadBuffer.h"
	#include "SkWriteBuffer.h"
	#include "SkStream.h"
	#include "Test.h"

	static void test_is_equal(skiatest::Reporter* reporter,
	const SkDataTable* a, const SkDataTable* b) {
	REPORTER_ASSERT(reporter, a->count() == b->count());
	for (int i = 0; i < a->count(); ++i) {
	size_t sizea, sizeb;
	const void* mema = a->at(i, &sizea);
	const void* memb = b->at(i, &sizeb);
	REPORTER_ASSERT(reporter, sizea == sizeb);
	REPORTER_ASSERT(reporter, !memcmp(mema, memb, sizea));
	}
	}

	static void test_datatable_is_empty(skiatest::Reporter* reporter, SkDataTable* table) {
	REPORTER_ASSERT(reporter, table->isEmpty());
	REPORTER_ASSERT(reporter, 0 == table->count());
	}

	static void test_emptytable(skiatest::Reporter* reporter) {
	sk_sp<SkDataTable> table0(SkDataTable::MakeEmpty());
	sk_sp<SkDataTable> table1(SkDataTable::MakeCopyArrays(nullptr, nullptr, 0));
	sk_sp<SkDataTable> table2(SkDataTable::MakeCopyArray(nullptr, 0, 0));
	sk_sp<SkDataTable> table3(SkDataTable::MakeArrayProc(nullptr, 0, 0, nullptr, nullptr));

	test_datatable_is_empty(reporter, table0.get());
	test_datatable_is_empty(reporter, table1.get());
	test_datatable_is_empty(reporter, table2.get());
	test_datatable_is_empty(reporter, table3.get());

	test_is_equal(reporter, table0.get(), table1.get());
	test_is_equal(reporter, table0.get(), table2.get());
	test_is_equal(reporter, table0.get(), table3.get());
	}

	static void test_simpletable(skiatest::Reporter* reporter) {
	const int idata[] = { 1, 4, 9, 16, 25, 63 };
	int icount = SK_ARRAY_COUNT(idata);
	sk_sp<SkDataTable> itable(SkDataTable::MakeCopyArray(idata, sizeof(idata[0]), icount));
	REPORTER_ASSERT(reporter, itable->count() == icount);
	for (int i = 0; i < icount; ++i) {
	size_t size;
	REPORTER_ASSERT(reporter, sizeof(int) == itable->atSize(i));
	REPORTER_ASSERT(reporter, *itable->atT<int>(i, &size) == idata[i]);
	REPORTER_ASSERT(reporter, sizeof(int) == size);
	}
	}

	static void test_vartable(skiatest::Reporter* reporter) {
	const char* str[] = {
	"", "a", "be", "see", "deigh", "ef", "ggggggggggggggggggggggggggg"
	};
	int count = SK_ARRAY_COUNT(str);
	size_t sizes[SK_ARRAY_COUNT(str)];
	for (int i = 0; i < count; ++i) {
	sizes[i] = strlen(str[i]) + 1;
	}

	sk_sp<SkDataTable> table(SkDataTable::MakeCopyArrays((const voidconst)str, sizes, count));

	REPORTER_ASSERT(reporter, table->count() == count);
	for (int i = 0; i < count; ++i) {
	size_t size;
	REPORTER_ASSERT(reporter, table->atSize(i) == sizes[i]);
	REPORTER_ASSERT(reporter, !strcmp(table->atT<const char>(i, &size),
	str[i]));
	REPORTER_ASSERT(reporter, size == sizes[i]);

	const char* s = table->atStr(i);
	REPORTER_ASSERT(reporter, strlen(s) == strlen(str[i]));
	}
	}

	static void test_globaltable(skiatest::Reporter* reporter) {
	static const int gData[] = {
	0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
	};
	int count = SK_ARRAY_COUNT(gData);

	sk_sp<SkDataTable> table(
	SkDataTable::MakeArrayProc(gData, sizeof(gData[0]), count, nullptr, nullptr));

	REPORTER_ASSERT(reporter, table->count() == count);
	for (int i = 0; i < count; ++i) {
	size_t size;
	REPORTER_ASSERT(reporter, table->atSize(i) == sizeof(int));
	REPORTER_ASSERT(reporter, *table->atT<const char>(i, &size) == i);
	REPORTER_ASSERT(reporter, sizeof(int) == size);
	}
	}

	DEF_TEST(DataTable, reporter) {
	test_emptytable(reporter);
	test_simpletable(reporter);
	test_vartable(reporter);
	test_globaltable(reporter);
	}

	static void* gGlobal;

	static void delete_int_proc(const void* ptr, void* context) {
	int* data = (int*)ptr;
	SkASSERT(context == gGlobal);
	delete[] data;
	}

	static void assert_len(skiatest::Reporter* reporter, const sk_sp<SkData>& ref, size_t len) {
	REPORTER_ASSERT(reporter, ref->size() == len);
	}

	static void assert_data(skiatest::Reporter* reporter, const sk_sp<SkData>& ref,
	const void* data, size_t len) {
	REPORTER_ASSERT(reporter, ref->size() == len);
	REPORTER_ASSERT(reporter, !memcmp(ref->data(), data, len));
	}

	static void test_cstring(skiatest::Reporter* reporter) {
	const char str[] = "Hello world";
	size_t len = strlen(str);

	sk_sp<SkData> r0(SkData::MakeWithCopy(str, len + 1));
	sk_sp<SkData> r1(SkData::MakeWithCString(str));

	REPORTER_ASSERT(reporter, r0->equals(r1.get()));

	sk_sp<SkData> r2(SkData::MakeWithCString(nullptr));
	REPORTER_ASSERT(reporter, 1 == r2->size());
	REPORTER_ASSERT(reporter, 0 == *r2->bytes());
	}

	static void test_files(skiatest::Reporter* reporter) {
	SkString tmpDir = skiatest::GetTmpDir();
	if (tmpDir.isEmpty()) {
	return;
	}

	SkString path = SkOSPath::Join(tmpDir.c_str(), "data_test");

	const char s[] = "abcdefghijklmnopqrstuvwxyz";
	{
	SkFILEWStream writer(path.c_str());
	if (!writer.isValid()) {
	ERRORF(reporter, "Failed to create tmp file %s\n", path.c_str());
	return;
	}
	writer.write(s, 26);
	}

	FILE* file = sk_fopen(path.c_str(), kRead_SkFILE_Flag);
	sk_sp<SkData> r1(SkData::MakeFromFILE(file));
	REPORTER_ASSERT(reporter, r1.get() != nullptr);
	REPORTER_ASSERT(reporter, r1->size() == 26);
	REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r1->data()), s, 26) == 0);

	int fd = sk_fileno(file);
	sk_sp<SkData> r2(SkData::MakeFromFD(fd));
	REPORTER_ASSERT(reporter, r2.get() != nullptr);
	REPORTER_ASSERT(reporter, r2->size() == 26);
	REPORTER_ASSERT(reporter, strncmp(static_cast<const char*>(r2->data()), s, 26) == 0);
	}

	DEF_TEST(Data, reporter) {
	const char* str = "We the people, in order to form a more perfect union.";
	const int N = 10;

	sk_sp<SkData> r0(SkData::MakeEmpty());
	sk_sp<SkData> r1(SkData::MakeWithCopy(str, strlen(str)));
	sk_sp<SkData> r2(SkData::MakeWithProc(new int[N], N*sizeof(int), delete_int_proc, gGlobal));
	sk_sp<SkData> r3(SkData::MakeSubset(r1.get(), 7, 6));

	assert_len(reporter, r0, 0);
	assert_len(reporter, r1, strlen(str));
	assert_len(reporter, r2, N * sizeof(int));
	assert_len(reporter, r3, 6);

	assert_data(reporter, r1, str, strlen(str));
	assert_data(reporter, r3, "people", 6);

	sk_sp<SkData> tmp(SkData::MakeSubset(r1.get(), strlen(str), 10));
	assert_len(reporter, tmp, 0);
	tmp = SkData::MakeSubset(r1.get(), 0, 0);
	assert_len(reporter, tmp, 0);

	test_cstring(reporter);
	test_files(reporter);
	}

	///////////////////////////////////////////////////////////////////////////////////////////////////
	#include "SkRWBuffer.h"

	const char gABC[] = "abcdefghijklmnopqrstuvwxyz";

	static void check_abcs(skiatest::Reporter* reporter, const char buffer[], size_t size) {
	REPORTER_ASSERT(reporter, size % 26 == 0);
	for (size_t offset = 0; offset < size; offset += 26) {
	REPORTER_ASSERT(reporter, !memcmp(&buffer[offset], gABC, 26));
	}
	}

	// stream should contain an integral number of copies of gABC.
	static void check_alphabet_stream(skiatest::Reporter* reporter, SkStream* stream) {
	REPORTER_ASSERT(reporter, stream->hasLength());
	size_t size = stream->getLength();
	REPORTER_ASSERT(reporter, size % 26 == 0);

	SkAutoTMalloc<char> storage(size);
	char* array = storage.get();
	size_t bytesRead = stream->read(array, size);
	REPORTER_ASSERT(reporter, bytesRead == size);
	check_abcs(reporter, array, size);

	// try checking backwards
	for (size_t offset = size; offset > 0; offset -= 26) {
	REPORTER_ASSERT(reporter, stream->seek(offset - 26));
	REPORTER_ASSERT(reporter, stream->getPosition() == offset - 26);
	REPORTER_ASSERT(reporter, stream->read(array, 26) == 26);
	check_abcs(reporter, array, 26);
	REPORTER_ASSERT(reporter, stream->getPosition() == offset);
	}
	}

	// reader should contains an integral number of copies of gABC.
	static void check_alphabet_buffer(skiatest::Reporter* reporter, const SkROBuffer* reader) {
	size_t size = reader->size();
	REPORTER_ASSERT(reporter, size % 26 == 0);

	SkAutoTMalloc<char> storage(size);
	SkROBuffer::Iter iter(reader);
	size_t offset = 0;
	do {
	SkASSERT(offset + iter.size() <= size);
	memcpy(storage.get() + offset, iter.data(), iter.size());
	offset += iter.size();
	} while (iter.next());
	REPORTER_ASSERT(reporter, offset == size);
	check_abcs(reporter, storage.get(), size);
	}

	#include "SkTaskGroup.h"

	DEF_TEST(RWBuffer, reporter) {
	// Knowing that the default capacity is 4096, choose N large enough so we force it to use
	// multiple buffers internally.
	const int N = 1000;
	SkROBuffer* readers[N];
	SkStream* streams[N];

	{
	SkRWBuffer buffer;
	for (int i = 0; i < N; ++i) {
	buffer.append(gABC, 26);
	readers[i] = buffer.newRBufferSnapshot();
	streams[i] = buffer.newStreamSnapshot();
	}
	REPORTER_ASSERT(reporter, N*26 == buffer.size());
	}

	// Verify that although the SkRWBuffer's destructor has run, the readers are still valid.
	for (int i = 0; i < N; ++i) {
	REPORTER_ASSERT(reporter, (i + 1) * 26U == readers[i]->size());
	check_alphabet_buffer(reporter, readers[i]);
	check_alphabet_stream(reporter, streams[i]);
	readers[i]->unref();
	delete streams[i];
	}
	}

	DEF_TEST(RWBuffer_threaded, reporter) {
	// Knowing that the default capacity is 4096, choose N large enough so we force it to use
	// multiple buffers internally.
	const int N = 1000;
	SkTaskGroup tasks;
	SkRWBuffer buffer;
	for (int i = 0; i < N; ++i) {
	buffer.append(gABC, 26);
	sk_sp<SkROBuffer> reader = sk_sp<SkROBuffer>(buffer.newRBufferSnapshot());
	SkStream* stream = buffer.newStreamSnapshot();
	REPORTER_ASSERT(reporter, reader->size() == buffer.size());
	REPORTER_ASSERT(reporter, stream->getLength() == buffer.size());

	// reader's copy constructor will ref the SkROBuffer, which will be unreffed
	// when the task ends.
	// Ownership of stream is passed to the task, which will delete it.
	tasks.add([reporter, i, reader, stream] {
	REPORTER_ASSERT(reporter, (i + 1) * 26U == reader->size());
	REPORTER_ASSERT(reporter, stream->getLength() == reader->size());
	check_alphabet_buffer(reporter, reader.get());
	check_alphabet_stream(reporter, stream);
	REPORTER_ASSERT(reporter, stream->rewind());
	delete stream;
	});
	}
	REPORTER_ASSERT(reporter, N*26 == buffer.size());
	tasks.wait();
	}

	// Tests that it is safe to call SkROBuffer::Iter::size() when exhausted.
	DEF_TEST(RWBuffer_size, r) {
	SkRWBuffer buffer;
	buffer.append(gABC, 26);

	sk_sp<SkROBuffer> roBuffer(buffer.newRBufferSnapshot());
	SkROBuffer::Iter iter(roBuffer.get());
	REPORTER_ASSERT(r, iter.data());
	REPORTER_ASSERT(r, iter.size() == 26);

	// There is only one block in this buffer.
	REPORTER_ASSERT(r, !iter.next());
	REPORTER_ASSERT(r, 0 == iter.size());
	}

	// Tests that operations (including the destructor) are safe on an SkRWBuffer
	// without any data appended.
	DEF_TEST(RWBuffer_noAppend, r) {
	SkRWBuffer buffer;
	REPORTER_ASSERT(r, 0 == buffer.size());

	sk_sp<SkROBuffer> roBuffer = sk_sp<SkROBuffer>(buffer.newRBufferSnapshot());
	REPORTER_ASSERT(r, roBuffer);
	if (roBuffer) {
	REPORTER_ASSERT(r, roBuffer->size() == 0);
	SkROBuffer::Iter iter(roBuffer.get());
	REPORTER_ASSERT(r, iter.size() == 0);
	REPORTER_ASSERT(r, !iter.data());
	REPORTER_ASSERT(r, !iter.next());
	}

	std::unique_ptr<SkStream> stream(buffer.newStreamSnapshot());
	REPORTER_ASSERT(r, stream);
	if (stream) {
	REPORTER_ASSERT(r, stream->hasLength());
	REPORTER_ASSERT(r, stream->getLength() == 0);
	REPORTER_ASSERT(r, stream->skip(10) == 0);
	}
	}