| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (c) 2014 The WebRTC project authors. All Rights Reserved. | 2 * Copyright (c) 2014 The WebRTC project authors. All Rights Reserved. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license | 4 * Use of this source code is governed by a BSD-style license |
| 5 * that can be found in the LICENSE file in the root of the source | 5 * that can be found in the LICENSE file in the root of the source |
| 6 * tree. An additional intellectual property rights grant can be found | 6 * tree. An additional intellectual property rights grant can be found |
| 7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
| 8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
| 9 */ | 9 */ |
| 10 | 10 |
| 11 #include "webrtc/system_wrappers/interface/aligned_array.h" | 11 #include "webrtc/system_wrappers/interface/aligned_array.h" |
| 12 | 12 |
| 13 #include <stdint.h> | 13 #include <stdint.h> |
| 14 | 14 |
| 15 #include "testing/gtest/include/gtest/gtest.h" | 15 #include "testing/gtest/include/gtest/gtest.h" |
| 16 | 16 |
| 17 namespace { | 17 namespace { |
| 18 | 18 |
| 19 bool IsAligned(const void* ptr, int alignment) { | 19 bool IsAligned(const void* ptr, size_t alignment) { |
| 20 return reinterpret_cast<uintptr_t>(ptr) % alignment == 0; | 20 return reinterpret_cast<uintptr_t>(ptr) % alignment == 0; |
| 21 } | 21 } |
| 22 | 22 |
| 23 } // namespace | 23 } // namespace |
| 24 | 24 |
| 25 namespace webrtc { | 25 namespace webrtc { |
| 26 | 26 |
| 27 TEST(AlignedArrayTest, CheckAlignment) { | 27 TEST(AlignedArrayTest, CheckAlignment) { |
| 28 AlignedArray<bool> arr(10, 7, 128); | 28 AlignedArray<bool> arr(10, 7, 128); |
| 29 ASSERT_TRUE(IsAligned(arr.Array(), 128)); | 29 ASSERT_TRUE(IsAligned(arr.Array(), 128)); |
| 30 for (int i = 0; i < 10; ++i) { | 30 for (size_t i = 0; i < 10; ++i) { |
| 31 ASSERT_TRUE(IsAligned(arr.Row(i), 128)); | 31 ASSERT_TRUE(IsAligned(arr.Row(i), 128)); |
| 32 ASSERT_EQ(arr.Row(i), arr.Array()[i]); | 32 ASSERT_EQ(arr.Row(i), arr.Array()[i]); |
| 33 } | 33 } |
| 34 } | 34 } |
| 35 | 35 |
| 36 TEST(AlignedArrayTest, CheckOverlap) { | 36 TEST(AlignedArrayTest, CheckOverlap) { |
| 37 AlignedArray<size_t> arr(10, 7, 128); | 37 AlignedArray<size_t> arr(10, 7, 128); |
| 38 | 38 |
| 39 for (int i = 0; i < 10; ++i) { | 39 for (size_t i = 0; i < 10; ++i) { |
| 40 for (size_t j = 0; j < 7; ++j) { | 40 for (size_t j = 0; j < 7; ++j) { |
| 41 arr.At(i, j) = 20 * i + j; | 41 arr.At(i, j) = 20 * i + j; |
| 42 } | 42 } |
| 43 } | 43 } |
| 44 | 44 |
| 45 for (int i = 0; i < 10; ++i) { | 45 for (size_t i = 0; i < 10; ++i) { |
| 46 for (size_t j = 0; j < 7; ++j) { | 46 for (size_t j = 0; j < 7; ++j) { |
| 47 ASSERT_EQ(arr.At(i, j), 20 * i + j); | 47 ASSERT_EQ(arr.At(i, j), 20 * i + j); |
| 48 ASSERT_EQ(arr.Row(i)[j], 20 * i + j); | 48 ASSERT_EQ(arr.Row(i)[j], 20 * i + j); |
| 49 ASSERT_EQ(arr.Array()[i][j], 20 * i + j); | 49 ASSERT_EQ(arr.Array()[i][j], 20 * i + j); |
| 50 } | 50 } |
| 51 } | 51 } |
| 52 } | 52 } |
| 53 | 53 |
| 54 TEST(AlignedArrayTest, CheckRowsCols) { | 54 TEST(AlignedArrayTest, CheckRowsCols) { |
| 55 AlignedArray<bool> arr(10, 7, 128); | 55 AlignedArray<bool> arr(10, 7, 128); |
| 56 ASSERT_EQ(arr.rows(), 10); | 56 ASSERT_EQ(arr.rows(), 10u); |
| 57 ASSERT_EQ(arr.cols(), 7u); | 57 ASSERT_EQ(arr.cols(), 7u); |
| 58 } | 58 } |
| 59 | 59 |
| 60 } // namespace webrtc | 60 } // namespace webrtc |
| OLD | NEW |