void SkBitmapHeapEntry::addReferences(int count) {
if (0 == fRefCount) {
// If there are no current owners then the heap manager
// will be the only one able to modify it, so it does not
// need to be an atomic operation.
fRefCount = count;
} else {
sk_atomic_add(&fRefCount, count);
}
}
static void test_atomicAddTests(skiatest::Reporter* reporter) {
int32_t total = base;
SkThread* threads[SK_ARRAY_COUNT(gAdds)];
for (size_t i = 0; i < SK_ARRAY_COUNT(gAdds); i++) {
total += gAdds[i].valueToAdd * gAdds[i].timesToAdd;
}
// Start the threads
for (size_t i = 0; i < SK_ARRAY_COUNT(gAdds); i++) {
threads[i] = new SkThread(addABunchOfTimes, &gAdds[i]);
threads[i]->setProcessorAffinity(gAdds[i].processorAffinity);
threads[i]->start();
}
// Now end the threads
for (size_t i = 0; i < SK_ARRAY_COUNT(gAdds); i++) {
threads[i]->join();
delete threads[i];
}
REPORTER_ASSERT(reporter, total == base);
// Ensure that the returned value from sk_atomic_add is correct.
int32_t valueToModify = 3;
const int32_t originalValue = valueToModify;
REPORTER_ASSERT(reporter, originalValue == sk_atomic_add(&valueToModify, 7));
}
static void addABunchOfTimes(void* data) {
AddInfo* addInfo = static_cast<AddInfo*>(data);
for (int i = 0; i < addInfo->timesToAdd; i++) {
sk_atomic_add(&base, addInfo->valueToAdd);
}
}
