OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2015 Google Inc. | 2 * Copyright 2015 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 "SkSharedMutex.h" | 8 #include "SkSharedMutex.h" |
9 #include "SkTaskGroup.h" | 9 #include "SkTaskGroup.h" |
10 | 10 |
(...skipping 10 matching lines...) Expand all Loading... |
21 } | 21 } |
22 | 22 |
23 DEF_TEST(SkSharedMutexMultiThreaded, r) { | 23 DEF_TEST(SkSharedMutexMultiThreaded, r) { |
24 SkSharedMutex sm; | 24 SkSharedMutex sm; |
25 static const int kSharedSize = 10; | 25 static const int kSharedSize = 10; |
26 int shared[kSharedSize]; | 26 int shared[kSharedSize]; |
27 int value = 0; | 27 int value = 0; |
28 for (int i = 0; i < kSharedSize; ++i) { | 28 for (int i = 0; i < kSharedSize; ++i) { |
29 shared[i] = 0; | 29 shared[i] = 0; |
30 } | 30 } |
31 sk_parallel_for(8, [&](int threadIndex) { | 31 SkTaskGroup().batch(8, [&](int threadIndex) { |
32 if (threadIndex % 4 != 0) { | 32 if (threadIndex % 4 != 0) { |
33 for (int c = 0; c < 100000; ++c) { | 33 for (int c = 0; c < 100000; ++c) { |
34 sm.acquireShared(); | 34 sm.acquireShared(); |
35 sm.assertHeldShared(); | 35 sm.assertHeldShared(); |
36 int v = shared[0]; | 36 int v = shared[0]; |
37 for (int i = 1; i < kSharedSize; ++i) { | 37 for (int i = 1; i < kSharedSize; ++i) { |
38 REPORTER_ASSERT(r, v == shared[i]); | 38 REPORTER_ASSERT(r, v == shared[i]); |
39 } | 39 } |
40 sm.releaseShared(); | 40 sm.releaseShared(); |
41 } | 41 } |
42 } else { | 42 } else { |
43 for (int c = 0; c < 100000; ++c) { | 43 for (int c = 0; c < 100000; ++c) { |
44 sm.acquire(); | 44 sm.acquire(); |
45 sm.assertHeld(); | 45 sm.assertHeld(); |
46 value += 1; | 46 value += 1; |
47 for (int i = 0; i < kSharedSize; ++i) { | 47 for (int i = 0; i < kSharedSize; ++i) { |
48 shared[i] = value; | 48 shared[i] = value; |
49 } | 49 } |
50 sm.release(); | 50 sm.release(); |
51 } | 51 } |
52 } | 52 } |
53 }); | 53 }); |
54 } | 54 } |
OLD | NEW |