blob: bdf072b6b75cc471f5f8692f49292d39464db1d8 [file] [log] [blame]
herbc782b2a2015-06-29 13:46:55 -07001/*
2 * Copyright 2015 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
8#include "SkSharedMutex.h"
9#include "SkTaskGroup.h"
10
11#include "Test.h"
12
13DEF_TEST(SkSharedMutexBasic, r) {
14 SkSharedMutex sm;
15 sm.acquire();
herbab42ec72015-08-19 13:40:12 -070016 sm.assertHeld();
herbc782b2a2015-06-29 13:46:55 -070017 sm.release();
18 sm.acquireShared();
herbab42ec72015-08-19 13:40:12 -070019 sm.assertHeldShared();
herbc782b2a2015-06-29 13:46:55 -070020 sm.releaseShared();
21}
22
23DEF_TEST(SkSharedMutexMultiThreaded, r) {
24 SkSharedMutex sm;
25 static const int kSharedSize = 10;
26 int shared[kSharedSize];
27 int value = 0;
28 for (int i = 0; i < kSharedSize; ++i) {
29 shared[i] = 0;
30 }
31 sk_parallel_for(8, [&](int threadIndex) {
32 if (threadIndex % 4 != 0) {
33 for (int c = 0; c < 100000; ++c) {
34 sm.acquireShared();
herbab42ec72015-08-19 13:40:12 -070035 sm.assertHeldShared();
herbc782b2a2015-06-29 13:46:55 -070036 int v = shared[0];
37 for (int i = 1; i < kSharedSize; ++i) {
38 REPORTER_ASSERT(r, v == shared[i]);
39 }
40 sm.releaseShared();
41 }
42 } else {
43 for (int c = 0; c < 100000; ++c) {
44 sm.acquire();
herbab42ec72015-08-19 13:40:12 -070045 sm.assertHeld();
herbc782b2a2015-06-29 13:46:55 -070046 value += 1;
47 for (int i = 0; i < kSharedSize; ++i) {
48 shared[i] = value;
49 }
50 sm.release();
51 }
52 }
53 });
54}