OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2011 Google Inc. | 2 * Copyright 2011 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 "SkColorPriv.h" | 8 #include "SkColorPriv.h" |
10 #include "SkEndian.h" | 9 #include "SkEndian.h" |
11 #include "SkFloatBits.h" | 10 #include "SkFloatBits.h" |
12 #include "SkFloatingPoint.h" | 11 #include "SkFloatingPoint.h" |
13 #include "SkMathPriv.h" | 12 #include "SkMathPriv.h" |
14 #include "SkPoint.h" | 13 #include "SkPoint.h" |
15 #include "SkRandom.h" | 14 #include "SkRandom.h" |
| 15 #include "Test.h" |
16 | 16 |
17 static void test_clz(skiatest::Reporter* reporter) { | 17 static void test_clz(skiatest::Reporter* reporter) { |
18 REPORTER_ASSERT(reporter, 32 == SkCLZ(0)); | 18 REPORTER_ASSERT(reporter, 32 == SkCLZ(0)); |
19 REPORTER_ASSERT(reporter, 31 == SkCLZ(1)); | 19 REPORTER_ASSERT(reporter, 31 == SkCLZ(1)); |
20 REPORTER_ASSERT(reporter, 1 == SkCLZ(1 << 30)); | 20 REPORTER_ASSERT(reporter, 1 == SkCLZ(1 << 30)); |
21 REPORTER_ASSERT(reporter, 0 == SkCLZ(~0U)); | 21 REPORTER_ASSERT(reporter, 0 == SkCLZ(~0U)); |
22 | 22 |
23 SkRandom rand; | 23 SkRandom rand; |
24 for (int i = 0; i < 1000; ++i) { | 24 for (int i = 0; i < 1000; ++i) { |
25 uint32_t mask = rand.nextU(); | 25 uint32_t mask = rand.nextU(); |
(...skipping 570 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
596 test_divmod<int16_t>(r); | 596 test_divmod<int16_t>(r); |
597 } | 597 } |
598 | 598 |
599 DEF_TEST(divmod_s32, r) { | 599 DEF_TEST(divmod_s32, r) { |
600 test_divmod<int32_t>(r); | 600 test_divmod<int32_t>(r); |
601 } | 601 } |
602 | 602 |
603 DEF_TEST(divmod_s64, r) { | 603 DEF_TEST(divmod_s64, r) { |
604 test_divmod<int64_t>(r); | 604 test_divmod<int64_t>(r); |
605 } | 605 } |
OLD | NEW |