Avi Drissman | e4622aa | 2022-09-08 20:36:06 | [diff] [blame] | 1 | // Copyright 2012 The Chromium Authors |
[email protected] | cd924d6 | 2012-02-23 17:52:20 | [diff] [blame] | 2 | // Use of this source code is governed by a BSD-style license that can be |
| 3 | // found in the LICENSE file. |
| 4 | |
| 5 | #include "base/memory/aligned_memory.h" |
dcheng | 093de9b | 2016-04-04 21:25:51 | [diff] [blame] | 6 | |
Tom Sepez | e29ac69 | 2023-10-30 23:38:23 | [diff] [blame^] | 7 | #include <string.h> |
| 8 | |
dcheng | 093de9b | 2016-04-04 21:25:51 | [diff] [blame] | 9 | #include <memory> |
| 10 | |
avi | 9beac25 | 2015-12-24 08:44:47 | [diff] [blame] | 11 | #include "build/build_config.h" |
[email protected] | cd924d6 | 2012-02-23 17:52:20 | [diff] [blame] | 12 | #include "testing/gtest/include/gtest/gtest.h" |
| 13 | |
brettw | 16289b3e | 2017-06-13 21:58:40 | [diff] [blame] | 14 | namespace base { |
[email protected] | cd924d6 | 2012-02-23 17:52:20 | [diff] [blame] | 15 | |
[email protected] | 9f01b02 | 2012-07-26 02:22:39 | [diff] [blame] | 16 | TEST(AlignedMemoryTest, DynamicAllocation) { |
brettw | 16289b3e | 2017-06-13 21:58:40 | [diff] [blame] | 17 | void* p = AlignedAlloc(8, 8); |
Tom Sepez | e29ac69 | 2023-10-30 23:38:23 | [diff] [blame^] | 18 | ASSERT_TRUE(p); |
Brian Geffon | ae8ef4dd | 2020-04-06 19:48:41 | [diff] [blame] | 19 | EXPECT_TRUE(IsAligned(p, 8)); |
Tom Sepez | e29ac69 | 2023-10-30 23:38:23 | [diff] [blame^] | 20 | memset(p, 0, 8); // Fill to check allocated size under ASAN. |
brettw | 16289b3e | 2017-06-13 21:58:40 | [diff] [blame] | 21 | AlignedFree(p); |
[email protected] | 9f01b02 | 2012-07-26 02:22:39 | [diff] [blame] | 22 | |
brettw | 16289b3e | 2017-06-13 21:58:40 | [diff] [blame] | 23 | p = AlignedAlloc(8, 16); |
Tom Sepez | e29ac69 | 2023-10-30 23:38:23 | [diff] [blame^] | 24 | ASSERT_TRUE(p); |
Brian Geffon | ae8ef4dd | 2020-04-06 19:48:41 | [diff] [blame] | 25 | EXPECT_TRUE(IsAligned(p, 16)); |
Tom Sepez | e29ac69 | 2023-10-30 23:38:23 | [diff] [blame^] | 26 | memset(p, 0, 8); // Fill to check allocated size under ASAN. |
brettw | 16289b3e | 2017-06-13 21:58:40 | [diff] [blame] | 27 | AlignedFree(p); |
[email protected] | 9f01b02 | 2012-07-26 02:22:39 | [diff] [blame] | 28 | |
brettw | 16289b3e | 2017-06-13 21:58:40 | [diff] [blame] | 29 | p = AlignedAlloc(8, 256); |
Tom Sepez | e29ac69 | 2023-10-30 23:38:23 | [diff] [blame^] | 30 | ASSERT_TRUE(p); |
Brian Geffon | ae8ef4dd | 2020-04-06 19:48:41 | [diff] [blame] | 31 | EXPECT_TRUE(IsAligned(p, 256)); |
Tom Sepez | e29ac69 | 2023-10-30 23:38:23 | [diff] [blame^] | 32 | memset(p, 0, 8); // Fill to check allocated size under ASAN. |
brettw | 16289b3e | 2017-06-13 21:58:40 | [diff] [blame] | 33 | AlignedFree(p); |
[email protected] | 9f01b02 | 2012-07-26 02:22:39 | [diff] [blame] | 34 | |
brettw | 16289b3e | 2017-06-13 21:58:40 | [diff] [blame] | 35 | p = AlignedAlloc(8, 4096); |
Tom Sepez | e29ac69 | 2023-10-30 23:38:23 | [diff] [blame^] | 36 | ASSERT_TRUE(p); |
Brian Geffon | ae8ef4dd | 2020-04-06 19:48:41 | [diff] [blame] | 37 | EXPECT_TRUE(IsAligned(p, 4096)); |
Tom Sepez | e29ac69 | 2023-10-30 23:38:23 | [diff] [blame^] | 38 | memset(p, 0, 8); // Fill to check allocated size under ASAN. |
brettw | 16289b3e | 2017-06-13 21:58:40 | [diff] [blame] | 39 | AlignedFree(p); |
[email protected] | 9f01b02 | 2012-07-26 02:22:39 | [diff] [blame] | 40 | } |
| 41 | |
| 42 | TEST(AlignedMemoryTest, ScopedDynamicAllocation) { |
brettw | 16289b3e | 2017-06-13 21:58:40 | [diff] [blame] | 43 | std::unique_ptr<float, AlignedFreeDeleter> p( |
| 44 | static_cast<float*>(AlignedAlloc(8, 8))); |
[email protected] | 9f01b02 | 2012-07-26 02:22:39 | [diff] [blame] | 45 | EXPECT_TRUE(p.get()); |
Brian Geffon | ae8ef4dd | 2020-04-06 19:48:41 | [diff] [blame] | 46 | EXPECT_TRUE(IsAligned(p.get(), 8)); |
Lei Zhang | df4345c7 | 2020-06-15 22:07:00 | [diff] [blame] | 47 | |
| 48 | // Make sure IsAligned() can check const pointers as well. |
| 49 | const float* const_p = p.get(); |
| 50 | EXPECT_TRUE(IsAligned(const_p, 8)); |
Brian Geffon | ae8ef4dd | 2020-04-06 19:48:41 | [diff] [blame] | 51 | } |
| 52 | |
| 53 | TEST(AlignedMemoryTest, IsAligned) { |
| 54 | // Check alignment around powers of two. |
| 55 | for (int i = 0; i < 64; ++i) { |
| 56 | const uint64_t n = static_cast<uint64_t>(1) << i; |
| 57 | |
| 58 | // Walk back down all lower powers of two checking alignment. |
| 59 | for (int j = i - 1; j >= 0; --j) { |
| 60 | // n is aligned on all powers of two less than or equal to 2^i. |
| 61 | EXPECT_TRUE(IsAligned(n, n >> j)) |
| 62 | << "Expected " << n << " to be " << (n >> j) << " aligned"; |
| 63 | |
| 64 | // Also, n - 1 should not be aligned on ANY lower power of two except 1 |
| 65 | // (but since we're starting from i - 1 we don't test that case here. |
| 66 | EXPECT_FALSE(IsAligned(n - 1, n >> j)) |
| 67 | << "Expected " << (n - 1) << " to NOT be " << (n >> j) << " aligned"; |
| 68 | } |
| 69 | } |
| 70 | |
| 71 | // And a few hard coded smoke tests for completeness: |
| 72 | EXPECT_TRUE(IsAligned(4, 2)); |
| 73 | EXPECT_TRUE(IsAligned(8, 4)); |
| 74 | EXPECT_TRUE(IsAligned(8, 2)); |
| 75 | EXPECT_TRUE(IsAligned(0x1000, 4 << 10)); |
| 76 | EXPECT_TRUE(IsAligned(0x2000, 8 << 10)); |
| 77 | EXPECT_TRUE(IsAligned(1, 1)); |
| 78 | EXPECT_TRUE(IsAligned(7, 1)); |
| 79 | EXPECT_TRUE(IsAligned(reinterpret_cast<void*>(0x1000), 4 << 10)); |
| 80 | EXPECT_TRUE(IsAligned(reinterpret_cast<int*>(0x1000), 4 << 10)); |
| 81 | |
| 82 | EXPECT_FALSE(IsAligned(3, 2)); |
| 83 | EXPECT_FALSE(IsAligned(7, 4)); |
| 84 | EXPECT_FALSE(IsAligned(7, 2)); |
| 85 | EXPECT_FALSE(IsAligned(0x1001, 4 << 10)); |
| 86 | EXPECT_FALSE(IsAligned(0x999, 8 << 10)); |
| 87 | EXPECT_FALSE(IsAligned(7, 8)); |
[email protected] | 9f01b02 | 2012-07-26 02:22:39 | [diff] [blame] | 88 | } |
| 89 | |
brettw | 16289b3e | 2017-06-13 21:58:40 | [diff] [blame] | 90 | } // namespace base |