2 * Copyright 2012 Google Inc.
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
9 #include "SkTRefArray.h"
10 #include "SkThreadUtils.h"
12 #include "SkWeakRefCnt.h"
15 class InstCounterClass {
17 InstCounterClass() { fCount = gInstCounter++; }
18 InstCounterClass(const InstCounterClass& src) {
22 virtual ~InstCounterClass() { gInstCounter -= 1; }
24 static int gInstCounter;
28 int InstCounterClass::gInstCounter;
30 static void test_refarray(skiatest::Reporter* reporter) {
31 REPORTER_ASSERT(reporter, 0 == InstCounterClass::gInstCounter);
34 SkTRefArray<InstCounterClass>* array = SkTRefArray<InstCounterClass>::Create(N);
36 REPORTER_ASSERT(reporter, 1 == array->getRefCnt());
37 REPORTER_ASSERT(reporter, N == array->count());
39 REPORTER_ASSERT(reporter, N == InstCounterClass::gInstCounter);
41 REPORTER_ASSERT(reporter, 0 == InstCounterClass::gInstCounter);
43 // Now test the copy factory
46 InstCounterClass* src = new InstCounterClass[N];
47 REPORTER_ASSERT(reporter, N == InstCounterClass::gInstCounter);
48 for (i = 0; i < N; ++i) {
49 REPORTER_ASSERT(reporter, i == src[i].fCount);
52 array = SkTRefArray<InstCounterClass>::Create(src, N);
53 REPORTER_ASSERT(reporter, 1 == array->getRefCnt());
54 REPORTER_ASSERT(reporter, N == array->count());
56 REPORTER_ASSERT(reporter, 2*N == InstCounterClass::gInstCounter);
57 for (i = 0; i < N; ++i) {
58 REPORTER_ASSERT(reporter, i == (*array)[i].fCount);
62 REPORTER_ASSERT(reporter, N == InstCounterClass::gInstCounter);
64 for (i = 0; i < N; ++i) {
65 REPORTER_ASSERT(reporter, i == (*array)[i].fCount);
68 REPORTER_ASSERT(reporter, 0 == InstCounterClass::gInstCounter);
71 static void bounce_ref(void* data) {
72 SkRefCnt* ref = static_cast<SkRefCnt*>(data);
73 for (int i = 0; i < 100000; ++i) {
79 static void test_refCnt(skiatest::Reporter* reporter) {
80 SkRefCnt* ref = new SkRefCnt();
82 SkThread thing1(bounce_ref, ref);
83 SkThread thing2(bounce_ref, ref);
85 thing1.setProcessorAffinity(0);
86 thing2.setProcessorAffinity(23);
88 SkASSERT(thing1.start());
89 SkASSERT(thing2.start());
94 REPORTER_ASSERT(reporter, ref->getRefCnt() == 1);
98 static void bounce_weak_ref(void* data) {
99 SkWeakRefCnt* ref = static_cast<SkWeakRefCnt*>(data);
100 for (int i = 0; i < 100000; ++i) {
101 if (ref->try_ref()) {
107 static void bounce_weak_weak_ref(void* data) {
108 SkWeakRefCnt* ref = static_cast<SkWeakRefCnt*>(data);
109 for (int i = 0; i < 100000; ++i) {
115 static void test_weakRefCnt(skiatest::Reporter* reporter) {
116 SkWeakRefCnt* ref = new SkWeakRefCnt();
118 SkThread thing1(bounce_ref, ref);
119 SkThread thing2(bounce_ref, ref);
120 SkThread thing3(bounce_weak_ref, ref);
121 SkThread thing4(bounce_weak_weak_ref, ref);
123 thing1.setProcessorAffinity(0);
124 thing2.setProcessorAffinity(23);
125 thing3.setProcessorAffinity(2);
126 thing4.setProcessorAffinity(17);
128 SkASSERT(thing1.start());
129 SkASSERT(thing2.start());
130 SkASSERT(thing3.start());
131 SkASSERT(thing4.start());
138 REPORTER_ASSERT(reporter, ref->getRefCnt() == 1);
139 REPORTER_ASSERT(reporter, ref->getWeakCnt() == 1);
143 DEF_TEST(RefCnt, reporter) {
144 test_refCnt(reporter);
145 test_weakRefCnt(reporter);
146 test_refarray(reporter);