OLD | NEW |
---|---|
1 /* | 1 /* |
2 * Copyright 2011 Google Inc. | 2 * Copyright 2011 Google Inc. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
6 */ | 6 */ |
7 | 7 |
8 #include "SkData.h" | 8 #include "SkData.h" |
9 #include "SkDataTable.h" | 9 #include "SkDataTable.h" |
10 #include "SkOSFile.h" | 10 #include "SkOSFile.h" |
(...skipping 227 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
238 | 238 |
239 const char gABC[] = "abcdefghijklmnopqrstuvwxyz"; | 239 const char gABC[] = "abcdefghijklmnopqrstuvwxyz"; |
240 | 240 |
241 static void check_abcs(skiatest::Reporter* reporter, const char buffer[], size_t size) { | 241 static void check_abcs(skiatest::Reporter* reporter, const char buffer[], size_t size) { |
242 REPORTER_ASSERT(reporter, size % 26 == 0); | 242 REPORTER_ASSERT(reporter, size % 26 == 0); |
243 for (size_t offset = 0; offset < size; offset += 26) { | 243 for (size_t offset = 0; offset < size; offset += 26) { |
244 REPORTER_ASSERT(reporter, !memcmp(&buffer[offset], gABC, 26)); | 244 REPORTER_ASSERT(reporter, !memcmp(&buffer[offset], gABC, 26)); |
245 } | 245 } |
246 } | 246 } |
247 | 247 |
248 // stream should contains an integral number of copies of gABC. | 248 // stream should contain an integral number of copies of gABC. |
249 static void check_alphabet_stream(skiatest::Reporter* reporter, SkStream* stream ) { | 249 static void check_alphabet_stream(skiatest::Reporter* reporter, SkStream* stream ) { |
250 REPORTER_ASSERT(reporter, stream->hasLength()); | 250 REPORTER_ASSERT(reporter, stream->hasLength()); |
251 size_t size = stream->getLength(); | 251 size_t size = stream->getLength(); |
252 REPORTER_ASSERT(reporter, size % 26 == 0); | 252 REPORTER_ASSERT(reporter, size % 26 == 0); |
253 | 253 |
254 SkAutoTMalloc<char> storage(size); | 254 SkAutoTMalloc<char> storage(size); |
255 char* array = storage.get(); | 255 char* array = storage.get(); |
256 size_t bytesRead = stream->read(array, size); | 256 size_t bytesRead = stream->read(array, size); |
257 REPORTER_ASSERT(reporter, bytesRead == size); | 257 REPORTER_ASSERT(reporter, bytesRead == size); |
258 check_abcs(reporter, array, size); | 258 check_abcs(reporter, array, size); |
(...skipping 18 matching lines...) Expand all Loading... | |
277 size_t offset = 0; | 277 size_t offset = 0; |
278 do { | 278 do { |
279 SkASSERT(offset + iter.size() <= size); | 279 SkASSERT(offset + iter.size() <= size); |
280 memcpy(storage.get() + offset, iter.data(), iter.size()); | 280 memcpy(storage.get() + offset, iter.data(), iter.size()); |
281 offset += iter.size(); | 281 offset += iter.size(); |
282 } while (iter.next()); | 282 } while (iter.next()); |
283 REPORTER_ASSERT(reporter, offset == size); | 283 REPORTER_ASSERT(reporter, offset == size); |
284 check_abcs(reporter, storage.get(), size); | 284 check_abcs(reporter, storage.get(), size); |
285 } | 285 } |
286 | 286 |
287 #include "SkTaskGroup.h" | |
288 | |
287 DEF_TEST(RWBuffer, reporter) { | 289 DEF_TEST(RWBuffer, reporter) { |
288 // Knowing that the default capacity is 4096, choose N large enough so we fo rce it to use | 290 // Knowing that the default capacity is 4096, choose N large enough so we fo rce it to use |
289 // multiple buffers internally. | 291 // multiple buffers internally. |
290 const int N = 1000; | 292 const int N = 1000; |
291 SkROBuffer* readers[N]; | 293 SkROBuffer* readers[N]; |
292 SkStream* streams[N]; | 294 SkStream* streams[N]; |
293 | 295 |
294 { | 296 { |
297 // Declaring this SkTaskGroup inside this block ensures that all tasks w ill | |
mtklein
2016/04/08 17:13:49
You may just want to call .wait() instead of havin
scroggo
2016/04/11 16:24:42
Done.
| |
298 // finish before testing again, down below. (This is necessary because t he | |
299 // streams need to be rewound to be read again.) | |
300 SkTaskGroup tasks; | |
295 SkRWBuffer buffer; | 301 SkRWBuffer buffer; |
296 for (int i = 0; i < N; ++i) { | 302 for (int i = 0; i < N; ++i) { |
297 if (0 == (i & 1)) { | 303 if (0 == (i & 1)) { |
298 buffer.append(gABC, 26); | 304 buffer.append(gABC, 26); |
299 } else { | 305 } else { |
300 memcpy(buffer.append(26), gABC, 26); | 306 memcpy(buffer.append(26), gABC, 26); |
301 } | 307 } |
302 readers[i] = buffer.newRBufferSnapshot(); | 308 readers[i] = buffer.newRBufferSnapshot(); |
303 streams[i] = buffer.newStreamSnapshot(); | 309 streams[i] = buffer.newStreamSnapshot(); |
310 REPORTER_ASSERT(reporter, readers[i]->size() == buffer.size()); | |
311 REPORTER_ASSERT(reporter, streams[i]->getLength() == buffer.size()); | |
312 | |
313 tasks.add([reporter, i, readers, streams] { | |
scroggo
2016/04/08 16:15:29
DM will put this whole test in a task, and it will
mtklein
2016/04/08 17:13:49
The tasks this tests spawns can run in parallel wi
scroggo
2016/04/11 16:24:42
I have a different issue. It is perfectly safe to
| |
314 REPORTER_ASSERT(reporter, (i + 1) * 26U == readers[i]->size()); | |
315 REPORTER_ASSERT(reporter, streams[i]->getLength() == readers[i]- >size()); | |
316 check_alphabet_buffer(reporter, readers[i]); | |
317 check_alphabet_stream(reporter, streams[i]); | |
318 REPORTER_ASSERT(reporter, streams[i]->rewind()); | |
319 }); | |
304 } | 320 } |
305 REPORTER_ASSERT(reporter, N*26 == buffer.size()); | 321 REPORTER_ASSERT(reporter, N*26 == buffer.size()); |
306 } | 322 } |
307 | 323 |
324 // Test again, to verify that the snapshots work even after the SkRWBuffer i s gone. | |
308 for (int i = 0; i < N; ++i) { | 325 for (int i = 0; i < N; ++i) { |
309 REPORTER_ASSERT(reporter, (i + 1) * 26U == readers[i]->size()); | 326 REPORTER_ASSERT(reporter, (i + 1) * 26U == readers[i]->size()); |
327 REPORTER_ASSERT(reporter, streams[i]->getLength() == readers[i]->size()) ; | |
310 check_alphabet_buffer(reporter, readers[i]); | 328 check_alphabet_buffer(reporter, readers[i]); |
311 check_alphabet_stream(reporter, streams[i]); | 329 check_alphabet_stream(reporter, streams[i]); |
312 readers[i]->unref(); | 330 readers[i]->unref(); |
313 delete streams[i]; | 331 delete streams[i]; |
314 } | 332 } |
315 } | 333 } |
316 | 334 |
317 // Tests that it is safe to call SkROBuffer::Iter::size() when exhausted. | 335 // Tests that it is safe to call SkROBuffer::Iter::size() when exhausted. |
318 DEF_TEST(RWBuffer_size, r) { | 336 DEF_TEST(RWBuffer_size, r) { |
319 SkRWBuffer buffer; | 337 SkRWBuffer buffer; |
320 buffer.append(gABC, 26); | 338 buffer.append(gABC, 26); |
321 | 339 |
322 SkAutoTUnref<SkROBuffer> roBuffer(buffer.newRBufferSnapshot()); | 340 SkAutoTUnref<SkROBuffer> roBuffer(buffer.newRBufferSnapshot()); |
323 SkROBuffer::Iter iter(roBuffer); | 341 SkROBuffer::Iter iter(roBuffer); |
324 REPORTER_ASSERT(r, iter.data()); | 342 REPORTER_ASSERT(r, iter.data()); |
325 REPORTER_ASSERT(r, iter.size() == 26); | 343 REPORTER_ASSERT(r, iter.size() == 26); |
326 | 344 |
327 // There is only one block in this buffer. | 345 // There is only one block in this buffer. |
328 REPORTER_ASSERT(r, !iter.next()); | 346 REPORTER_ASSERT(r, !iter.next()); |
329 REPORTER_ASSERT(r, 0 == iter.size()); | 347 REPORTER_ASSERT(r, 0 == iter.size()); |
330 } | 348 } |
331 | 349 |
332 // Tests that it is safe to destruct an SkRWBuffer without appending | 350 // Tests that operations (including the destructor) are safe on an SkRWBuffer |
333 // anything to it. | 351 // without any data appended. |
334 DEF_TEST(RWBuffer_noAppend, r) { | 352 DEF_TEST(RWBuffer_noAppend, r) { |
335 SkRWBuffer buffer; | 353 SkRWBuffer buffer; |
336 REPORTER_ASSERT(r, 0 == buffer.size()); | 354 REPORTER_ASSERT(r, 0 == buffer.size()); |
355 | |
356 sk_sp<SkROBuffer> roBuffer = sk_sp<SkROBuffer>(buffer.newRBufferSnapshot()); | |
357 REPORTER_ASSERT(r, roBuffer); | |
358 if (roBuffer) { | |
359 REPORTER_ASSERT(r, roBuffer->size() == 0); | |
360 SkROBuffer::Iter iter(roBuffer.get()); | |
361 REPORTER_ASSERT(r, iter.size() == 0); | |
362 REPORTER_ASSERT(r, !iter.data()); | |
363 REPORTER_ASSERT(r, !iter.next()); | |
364 } | |
365 | |
366 SkAutoTDelete<SkStream> stream(buffer.newStreamSnapshot()); | |
367 REPORTER_ASSERT(r, stream); | |
368 if (stream) { | |
369 REPORTER_ASSERT(r, stream->hasLength()); | |
370 REPORTER_ASSERT(r, stream->getLength() == 0); | |
371 REPORTER_ASSERT(r, stream->skip(10) == 0); | |
372 } | |
337 } | 373 } |
OLD | NEW |