OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2012 Google Inc. | 2 * Copyright 2012 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 "Test.h" | |
9 #include "SkThread.h" | 8 #include "SkThread.h" |
10 #include "SkThreadUtils.h" | 9 #include "SkThreadUtils.h" |
11 #include "SkTypes.h" | 10 #include "SkTypes.h" |
| 11 #include "Test.h" |
12 | 12 |
13 struct AddInfo { | 13 struct AddInfo { |
14 int32_t valueToAdd; | 14 int32_t valueToAdd; |
15 int timesToAdd; | 15 int timesToAdd; |
16 unsigned int processorAffinity; | 16 unsigned int processorAffinity; |
17 }; | 17 }; |
18 | 18 |
19 static int32_t base = 0; | 19 static int32_t base = 0; |
20 | 20 |
21 static AddInfo gAdds[] = { | 21 static AddInfo gAdds[] = { |
(...skipping 26 matching lines...) Expand all Loading... |
48 for (size_t i = 0; i < SK_ARRAY_COUNT(gAdds); i++) { | 48 for (size_t i = 0; i < SK_ARRAY_COUNT(gAdds); i++) { |
49 threads[i]->join(); | 49 threads[i]->join(); |
50 delete threads[i]; | 50 delete threads[i]; |
51 } | 51 } |
52 REPORTER_ASSERT(reporter, total == base); | 52 REPORTER_ASSERT(reporter, total == base); |
53 // Ensure that the returned value from sk_atomic_add is correct. | 53 // Ensure that the returned value from sk_atomic_add is correct. |
54 int32_t valueToModify = 3; | 54 int32_t valueToModify = 3; |
55 const int32_t originalValue = valueToModify; | 55 const int32_t originalValue = valueToModify; |
56 REPORTER_ASSERT(reporter, originalValue == sk_atomic_add(&valueToModify, 7))
; | 56 REPORTER_ASSERT(reporter, originalValue == sk_atomic_add(&valueToModify, 7))
; |
57 } | 57 } |
OLD | NEW |