Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2013 The Android Open Source Project |
| 3 | * |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | * you may not use this file except in compliance with the License. |
| 6 | * You may obtain a copy of the License at |
| 7 | * |
| 8 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | * |
| 10 | * Unless required by applicable law or agreed to in writing, software |
| 11 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | * See the License for the specific language governing permissions and |
| 14 | * limitations under the License. |
| 15 | */ |
| 16 | |
| 17 | #include "mem_map.h" |
| 18 | |
Andreas Gampe | d490129 | 2017-05-30 18:41:34 -0700 | [diff] [blame] | 19 | #include <sys/mman.h> |
| 20 | |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 21 | #include <memory> |
Alex Light | ca97ada | 2018-02-02 09:25:31 -0800 | [diff] [blame] | 22 | #include <random> |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 23 | |
David Sehr | d5f8de8 | 2018-04-27 14:12:03 -0700 | [diff] [blame] | 24 | #include "base/common_art_test.h" |
| 25 | #include "common_runtime_test.h" // For TEST_DISABLED_FOR_MIPS |
David Sehr | 1979c64 | 2018-04-26 14:41:18 -0700 | [diff] [blame] | 26 | #include "memory_tool.h" |
| 27 | #include "unix_file/fd_file.h" |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 28 | |
| 29 | namespace art { |
| 30 | |
David Sehr | d5f8de8 | 2018-04-27 14:12:03 -0700 | [diff] [blame] | 31 | class MemMapTest : public CommonArtTest { |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 32 | public: |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 33 | static uint8_t* BaseBegin(MemMap* mem_map) { |
| 34 | return reinterpret_cast<uint8_t*>(mem_map->base_begin_); |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 35 | } |
Mathieu Chartier | 16d29f8 | 2015-11-10 10:32:52 -0800 | [diff] [blame] | 36 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 37 | static size_t BaseSize(MemMap* mem_map) { |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 38 | return mem_map->base_size_; |
| 39 | } |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 40 | |
Alex Light | ca97ada | 2018-02-02 09:25:31 -0800 | [diff] [blame] | 41 | static bool IsAddressMapped(void* addr) { |
| 42 | bool res = msync(addr, 1, MS_SYNC) == 0; |
| 43 | if (!res && errno != ENOMEM) { |
| 44 | PLOG(FATAL) << "Unexpected error occurred on msync"; |
| 45 | } |
| 46 | return res; |
| 47 | } |
| 48 | |
| 49 | static std::vector<uint8_t> RandomData(size_t size) { |
| 50 | std::random_device rd; |
| 51 | std::uniform_int_distribution<uint8_t> dist; |
| 52 | std::vector<uint8_t> res; |
| 53 | res.resize(size); |
| 54 | for (size_t i = 0; i < size; i++) { |
| 55 | res[i] = dist(rd); |
| 56 | } |
| 57 | return res; |
| 58 | } |
| 59 | |
Mathieu Chartier | 16d29f8 | 2015-11-10 10:32:52 -0800 | [diff] [blame] | 60 | static uint8_t* GetValidMapAddress(size_t size, bool low_4gb) { |
| 61 | // Find a valid map address and unmap it before returning. |
| 62 | std::string error_msg; |
| 63 | std::unique_ptr<MemMap> map(MemMap::MapAnonymous("temp", |
| 64 | nullptr, |
| 65 | size, |
| 66 | PROT_READ, |
| 67 | low_4gb, |
| 68 | false, |
| 69 | &error_msg)); |
| 70 | CHECK(map != nullptr); |
| 71 | return map->Begin(); |
| 72 | } |
| 73 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 74 | static void RemapAtEndTest(bool low_4gb) { |
| 75 | std::string error_msg; |
| 76 | // Cast the page size to size_t. |
| 77 | const size_t page_size = static_cast<size_t>(kPageSize); |
| 78 | // Map a two-page memory region. |
| 79 | MemMap* m0 = MemMap::MapAnonymous("MemMapTest_RemapAtEndTest_map0", |
| 80 | nullptr, |
| 81 | 2 * page_size, |
| 82 | PROT_READ | PROT_WRITE, |
| 83 | low_4gb, |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 84 | false, |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 85 | &error_msg); |
| 86 | // Check its state and write to it. |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 87 | uint8_t* base0 = m0->Begin(); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 88 | ASSERT_TRUE(base0 != nullptr) << error_msg; |
| 89 | size_t size0 = m0->Size(); |
| 90 | EXPECT_EQ(m0->Size(), 2 * page_size); |
| 91 | EXPECT_EQ(BaseBegin(m0), base0); |
| 92 | EXPECT_EQ(BaseSize(m0), size0); |
| 93 | memset(base0, 42, 2 * page_size); |
| 94 | // Remap the latter half into a second MemMap. |
| 95 | MemMap* m1 = m0->RemapAtEnd(base0 + page_size, |
| 96 | "MemMapTest_RemapAtEndTest_map1", |
| 97 | PROT_READ | PROT_WRITE, |
| 98 | &error_msg); |
| 99 | // Check the states of the two maps. |
| 100 | EXPECT_EQ(m0->Begin(), base0) << error_msg; |
| 101 | EXPECT_EQ(m0->Size(), page_size); |
| 102 | EXPECT_EQ(BaseBegin(m0), base0); |
| 103 | EXPECT_EQ(BaseSize(m0), page_size); |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 104 | uint8_t* base1 = m1->Begin(); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 105 | size_t size1 = m1->Size(); |
| 106 | EXPECT_EQ(base1, base0 + page_size); |
| 107 | EXPECT_EQ(size1, page_size); |
| 108 | EXPECT_EQ(BaseBegin(m1), base1); |
| 109 | EXPECT_EQ(BaseSize(m1), size1); |
| 110 | // Write to the second region. |
| 111 | memset(base1, 43, page_size); |
| 112 | // Check the contents of the two regions. |
| 113 | for (size_t i = 0; i < page_size; ++i) { |
| 114 | EXPECT_EQ(base0[i], 42); |
| 115 | } |
| 116 | for (size_t i = 0; i < page_size; ++i) { |
| 117 | EXPECT_EQ(base1[i], 43); |
| 118 | } |
| 119 | // Unmap the first region. |
| 120 | delete m0; |
| 121 | // Make sure the second region is still accessible after the first |
| 122 | // region is unmapped. |
| 123 | for (size_t i = 0; i < page_size; ++i) { |
| 124 | EXPECT_EQ(base1[i], 43); |
| 125 | } |
| 126 | delete m1; |
| 127 | } |
Andreas Gampe | d8f26db | 2014-05-19 17:01:13 -0700 | [diff] [blame] | 128 | |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 129 | void CommonInit() { |
| 130 | MemMap::Init(); |
| 131 | } |
| 132 | |
Andreas Gampe | d8f26db | 2014-05-19 17:01:13 -0700 | [diff] [blame] | 133 | #if defined(__LP64__) && !defined(__x86_64__) |
| 134 | static uintptr_t GetLinearScanPos() { |
| 135 | return MemMap::next_mem_pos_; |
| 136 | } |
| 137 | #endif |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 138 | }; |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 139 | |
Andreas Gampe | d8f26db | 2014-05-19 17:01:13 -0700 | [diff] [blame] | 140 | #if defined(__LP64__) && !defined(__x86_64__) |
| 141 | |
| 142 | #ifdef __BIONIC__ |
| 143 | extern uintptr_t CreateStartPos(uint64_t input); |
| 144 | #endif |
| 145 | |
| 146 | TEST_F(MemMapTest, Start) { |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 147 | CommonInit(); |
Andreas Gampe | d8f26db | 2014-05-19 17:01:13 -0700 | [diff] [blame] | 148 | uintptr_t start = GetLinearScanPos(); |
| 149 | EXPECT_LE(64 * KB, start); |
| 150 | EXPECT_LT(start, static_cast<uintptr_t>(ART_BASE_ADDRESS)); |
Andreas Gampe | d8f26db | 2014-05-19 17:01:13 -0700 | [diff] [blame] | 151 | #ifdef __BIONIC__ |
| 152 | // Test a couple of values. Make sure they are different. |
| 153 | uintptr_t last = 0; |
| 154 | for (size_t i = 0; i < 100; ++i) { |
| 155 | uintptr_t random_start = CreateStartPos(i * kPageSize); |
| 156 | EXPECT_NE(last, random_start); |
| 157 | last = random_start; |
| 158 | } |
| 159 | |
| 160 | // Even on max, should be below ART_BASE_ADDRESS. |
| 161 | EXPECT_LT(CreateStartPos(~0), static_cast<uintptr_t>(ART_BASE_ADDRESS)); |
| 162 | #endif |
| 163 | // End of test. |
| 164 | } |
| 165 | #endif |
| 166 | |
Alex Light | ca97ada | 2018-02-02 09:25:31 -0800 | [diff] [blame] | 167 | // We need mremap to be able to test ReplaceMapping at all |
| 168 | #if HAVE_MREMAP_SYSCALL |
| 169 | TEST_F(MemMapTest, ReplaceMapping_SameSize) { |
| 170 | std::string error_msg; |
| 171 | std::unique_ptr<MemMap> dest(MemMap::MapAnonymous("MapAnonymousEmpty-atomic-replace-dest", |
| 172 | nullptr, |
| 173 | kPageSize, |
| 174 | PROT_READ, |
| 175 | false, |
| 176 | false, |
| 177 | &error_msg)); |
| 178 | ASSERT_TRUE(dest != nullptr); |
| 179 | MemMap* source = MemMap::MapAnonymous("MapAnonymous-atomic-replace-source", |
| 180 | nullptr, |
| 181 | kPageSize, |
| 182 | PROT_WRITE | PROT_READ, |
| 183 | false, |
| 184 | false, |
| 185 | &error_msg); |
| 186 | ASSERT_TRUE(source != nullptr); |
| 187 | void* source_addr = source->Begin(); |
| 188 | void* dest_addr = dest->Begin(); |
| 189 | ASSERT_TRUE(IsAddressMapped(source_addr)); |
| 190 | ASSERT_TRUE(IsAddressMapped(dest_addr)); |
| 191 | |
| 192 | std::vector<uint8_t> data = RandomData(kPageSize); |
| 193 | memcpy(source->Begin(), data.data(), data.size()); |
| 194 | |
| 195 | ASSERT_TRUE(dest->ReplaceWith(&source, &error_msg)) << error_msg; |
| 196 | |
| 197 | ASSERT_FALSE(IsAddressMapped(source_addr)); |
| 198 | ASSERT_TRUE(IsAddressMapped(dest_addr)); |
| 199 | ASSERT_TRUE(source == nullptr); |
| 200 | |
| 201 | ASSERT_EQ(dest->Size(), static_cast<size_t>(kPageSize)); |
| 202 | |
| 203 | ASSERT_EQ(memcmp(dest->Begin(), data.data(), dest->Size()), 0); |
| 204 | } |
| 205 | |
| 206 | TEST_F(MemMapTest, ReplaceMapping_MakeLarger) { |
| 207 | std::string error_msg; |
| 208 | std::unique_ptr<MemMap> dest(MemMap::MapAnonymous("MapAnonymousEmpty-atomic-replace-dest", |
| 209 | nullptr, |
| 210 | 5 * kPageSize, // Need to make it larger |
| 211 | // initially so we know |
| 212 | // there won't be mappings |
| 213 | // in the way we we move |
| 214 | // source. |
| 215 | PROT_READ, |
| 216 | false, |
| 217 | false, |
| 218 | &error_msg)); |
| 219 | ASSERT_TRUE(dest != nullptr); |
| 220 | MemMap* source = MemMap::MapAnonymous("MapAnonymous-atomic-replace-source", |
| 221 | nullptr, |
| 222 | 3 * kPageSize, |
| 223 | PROT_WRITE | PROT_READ, |
| 224 | false, |
| 225 | false, |
| 226 | &error_msg); |
| 227 | ASSERT_TRUE(source != nullptr); |
| 228 | uint8_t* source_addr = source->Begin(); |
| 229 | uint8_t* dest_addr = dest->Begin(); |
| 230 | ASSERT_TRUE(IsAddressMapped(source_addr)); |
| 231 | |
| 232 | // Fill the source with random data. |
| 233 | std::vector<uint8_t> data = RandomData(3 * kPageSize); |
| 234 | memcpy(source->Begin(), data.data(), data.size()); |
| 235 | |
| 236 | // Make the dest smaller so that we know we'll have space. |
| 237 | dest->SetSize(kPageSize); |
| 238 | |
| 239 | ASSERT_TRUE(IsAddressMapped(dest_addr)); |
| 240 | ASSERT_FALSE(IsAddressMapped(dest_addr + 2 * kPageSize)); |
| 241 | ASSERT_EQ(dest->Size(), static_cast<size_t>(kPageSize)); |
| 242 | |
| 243 | ASSERT_TRUE(dest->ReplaceWith(&source, &error_msg)) << error_msg; |
| 244 | |
| 245 | ASSERT_FALSE(IsAddressMapped(source_addr)); |
| 246 | ASSERT_EQ(dest->Size(), static_cast<size_t>(3 * kPageSize)); |
| 247 | ASSERT_TRUE(IsAddressMapped(dest_addr)); |
| 248 | ASSERT_TRUE(IsAddressMapped(dest_addr + 2 * kPageSize)); |
| 249 | ASSERT_TRUE(source == nullptr); |
| 250 | |
| 251 | ASSERT_EQ(memcmp(dest->Begin(), data.data(), dest->Size()), 0); |
| 252 | } |
| 253 | |
| 254 | TEST_F(MemMapTest, ReplaceMapping_MakeSmaller) { |
| 255 | std::string error_msg; |
| 256 | std::unique_ptr<MemMap> dest(MemMap::MapAnonymous("MapAnonymousEmpty-atomic-replace-dest", |
| 257 | nullptr, |
| 258 | 3 * kPageSize, |
| 259 | PROT_READ, |
| 260 | false, |
| 261 | false, |
| 262 | &error_msg)); |
| 263 | ASSERT_TRUE(dest != nullptr); |
| 264 | MemMap* source = MemMap::MapAnonymous("MapAnonymous-atomic-replace-source", |
| 265 | nullptr, |
| 266 | kPageSize, |
| 267 | PROT_WRITE | PROT_READ, |
| 268 | false, |
| 269 | false, |
| 270 | &error_msg); |
| 271 | ASSERT_TRUE(source != nullptr); |
| 272 | uint8_t* source_addr = source->Begin(); |
| 273 | uint8_t* dest_addr = dest->Begin(); |
| 274 | ASSERT_TRUE(IsAddressMapped(source_addr)); |
| 275 | ASSERT_TRUE(IsAddressMapped(dest_addr)); |
| 276 | ASSERT_TRUE(IsAddressMapped(dest_addr + 2 * kPageSize)); |
| 277 | ASSERT_EQ(dest->Size(), static_cast<size_t>(3 * kPageSize)); |
| 278 | |
| 279 | std::vector<uint8_t> data = RandomData(kPageSize); |
| 280 | memcpy(source->Begin(), data.data(), kPageSize); |
| 281 | |
| 282 | ASSERT_TRUE(dest->ReplaceWith(&source, &error_msg)) << error_msg; |
| 283 | |
| 284 | ASSERT_FALSE(IsAddressMapped(source_addr)); |
| 285 | ASSERT_EQ(dest->Size(), static_cast<size_t>(kPageSize)); |
| 286 | ASSERT_TRUE(IsAddressMapped(dest_addr)); |
| 287 | ASSERT_FALSE(IsAddressMapped(dest_addr + 2 * kPageSize)); |
| 288 | ASSERT_TRUE(source == nullptr); |
| 289 | |
| 290 | ASSERT_EQ(memcmp(dest->Begin(), data.data(), dest->Size()), 0); |
| 291 | } |
| 292 | |
| 293 | TEST_F(MemMapTest, ReplaceMapping_FailureOverlap) { |
| 294 | std::string error_msg; |
| 295 | std::unique_ptr<MemMap> dest( |
| 296 | MemMap::MapAnonymous( |
| 297 | "MapAnonymousEmpty-atomic-replace-dest", |
| 298 | nullptr, |
| 299 | 3 * kPageSize, // Need to make it larger initially so we know there won't be mappings in |
| 300 | // the way we we move source. |
| 301 | PROT_READ | PROT_WRITE, |
| 302 | false, |
| 303 | false, |
| 304 | &error_msg)); |
| 305 | ASSERT_TRUE(dest != nullptr); |
| 306 | // Resize down to 1 page so we can remap the rest. |
| 307 | dest->SetSize(kPageSize); |
| 308 | // Create source from the last 2 pages |
| 309 | MemMap* source = MemMap::MapAnonymous("MapAnonymous-atomic-replace-source", |
| 310 | dest->Begin() + kPageSize, |
| 311 | 2 * kPageSize, |
| 312 | PROT_WRITE | PROT_READ, |
| 313 | false, |
| 314 | false, |
| 315 | &error_msg); |
| 316 | ASSERT_TRUE(source != nullptr); |
| 317 | MemMap* orig_source = source; |
| 318 | ASSERT_EQ(dest->Begin() + kPageSize, source->Begin()); |
| 319 | uint8_t* source_addr = source->Begin(); |
| 320 | uint8_t* dest_addr = dest->Begin(); |
| 321 | ASSERT_TRUE(IsAddressMapped(source_addr)); |
| 322 | |
| 323 | // Fill the source and dest with random data. |
| 324 | std::vector<uint8_t> data = RandomData(2 * kPageSize); |
| 325 | memcpy(source->Begin(), data.data(), data.size()); |
| 326 | std::vector<uint8_t> dest_data = RandomData(kPageSize); |
| 327 | memcpy(dest->Begin(), dest_data.data(), dest_data.size()); |
| 328 | |
| 329 | ASSERT_TRUE(IsAddressMapped(dest_addr)); |
| 330 | ASSERT_EQ(dest->Size(), static_cast<size_t>(kPageSize)); |
| 331 | |
| 332 | ASSERT_FALSE(dest->ReplaceWith(&source, &error_msg)) << error_msg; |
| 333 | |
| 334 | ASSERT_TRUE(source == orig_source); |
| 335 | ASSERT_TRUE(IsAddressMapped(source_addr)); |
| 336 | ASSERT_TRUE(IsAddressMapped(dest_addr)); |
| 337 | ASSERT_EQ(source->Size(), data.size()); |
| 338 | ASSERT_EQ(dest->Size(), dest_data.size()); |
| 339 | |
| 340 | ASSERT_EQ(memcmp(source->Begin(), data.data(), data.size()), 0); |
| 341 | ASSERT_EQ(memcmp(dest->Begin(), dest_data.data(), dest_data.size()), 0); |
| 342 | |
| 343 | delete source; |
| 344 | } |
| 345 | #endif // HAVE_MREMAP_SYSCALL |
| 346 | |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 347 | TEST_F(MemMapTest, MapAnonymousEmpty) { |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 348 | CommonInit(); |
Ian Rogers | 8d31bbd | 2013-10-13 10:44:14 -0700 | [diff] [blame] | 349 | std::string error_msg; |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 350 | std::unique_ptr<MemMap> map(MemMap::MapAnonymous("MapAnonymousEmpty", |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 351 | nullptr, |
| 352 | 0, |
| 353 | PROT_READ, |
| 354 | false, |
| 355 | false, |
| 356 | &error_msg)); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 357 | ASSERT_TRUE(map.get() != nullptr) << error_msg; |
| 358 | ASSERT_TRUE(error_msg.empty()); |
| 359 | map.reset(MemMap::MapAnonymous("MapAnonymousEmpty", |
| 360 | nullptr, |
| 361 | kPageSize, |
| 362 | PROT_READ | PROT_WRITE, |
| 363 | false, |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 364 | false, |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 365 | &error_msg)); |
| 366 | ASSERT_TRUE(map.get() != nullptr) << error_msg; |
Ian Rogers | 8d31bbd | 2013-10-13 10:44:14 -0700 | [diff] [blame] | 367 | ASSERT_TRUE(error_msg.empty()); |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 368 | } |
| 369 | |
Mathieu Chartier | 486932a | 2016-02-24 10:09:23 -0800 | [diff] [blame] | 370 | TEST_F(MemMapTest, MapAnonymousFailNullError) { |
| 371 | CommonInit(); |
| 372 | // Test that we don't crash with a null error_str when mapping at an invalid location. |
| 373 | std::unique_ptr<MemMap> map(MemMap::MapAnonymous("MapAnonymousInvalid", |
| 374 | reinterpret_cast<uint8_t*>(kPageSize), |
| 375 | 0x20000, |
| 376 | PROT_READ | PROT_WRITE, |
| 377 | false, |
| 378 | false, |
| 379 | nullptr)); |
| 380 | ASSERT_EQ(nullptr, map.get()); |
| 381 | } |
| 382 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 383 | #ifdef __LP64__ |
| 384 | TEST_F(MemMapTest, MapAnonymousEmpty32bit) { |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 385 | CommonInit(); |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 386 | std::string error_msg; |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 387 | std::unique_ptr<MemMap> map(MemMap::MapAnonymous("MapAnonymousEmpty", |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 388 | nullptr, |
| 389 | kPageSize, |
| 390 | PROT_READ | PROT_WRITE, |
| 391 | true, |
| 392 | false, |
| 393 | &error_msg)); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 394 | ASSERT_TRUE(map.get() != nullptr) << error_msg; |
| 395 | ASSERT_TRUE(error_msg.empty()); |
| 396 | ASSERT_LT(reinterpret_cast<uintptr_t>(BaseBegin(map.get())), 1ULL << 32); |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 397 | } |
Mathieu Chartier | 42bddce | 2015-11-09 15:16:56 -0800 | [diff] [blame] | 398 | TEST_F(MemMapTest, MapFile32Bit) { |
| 399 | CommonInit(); |
| 400 | std::string error_msg; |
| 401 | ScratchFile scratch_file; |
| 402 | constexpr size_t kMapSize = kPageSize; |
| 403 | std::unique_ptr<uint8_t[]> data(new uint8_t[kMapSize]()); |
| 404 | ASSERT_TRUE(scratch_file.GetFile()->WriteFully(&data[0], kMapSize)); |
| 405 | std::unique_ptr<MemMap> map(MemMap::MapFile(/*byte_count*/kMapSize, |
| 406 | PROT_READ, |
| 407 | MAP_PRIVATE, |
| 408 | scratch_file.GetFd(), |
| 409 | /*start*/0, |
| 410 | /*low_4gb*/true, |
| 411 | scratch_file.GetFilename().c_str(), |
| 412 | &error_msg)); |
| 413 | ASSERT_TRUE(map != nullptr) << error_msg; |
| 414 | ASSERT_TRUE(error_msg.empty()); |
| 415 | ASSERT_EQ(map->Size(), kMapSize); |
| 416 | ASSERT_LT(reinterpret_cast<uintptr_t>(BaseBegin(map.get())), 1ULL << 32); |
| 417 | } |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 418 | #endif |
| 419 | |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 420 | TEST_F(MemMapTest, MapAnonymousExactAddr) { |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 421 | CommonInit(); |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 422 | std::string error_msg; |
Mathieu Chartier | 16d29f8 | 2015-11-10 10:32:52 -0800 | [diff] [blame] | 423 | // Find a valid address. |
| 424 | uint8_t* valid_address = GetValidMapAddress(kPageSize, /*low_4gb*/false); |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 425 | // Map at an address that should work, which should succeed. |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 426 | std::unique_ptr<MemMap> map0(MemMap::MapAnonymous("MapAnonymous0", |
Mathieu Chartier | 16d29f8 | 2015-11-10 10:32:52 -0800 | [diff] [blame] | 427 | valid_address, |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 428 | kPageSize, |
| 429 | PROT_READ | PROT_WRITE, |
| 430 | false, |
| 431 | false, |
| 432 | &error_msg)); |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 433 | ASSERT_TRUE(map0.get() != nullptr) << error_msg; |
| 434 | ASSERT_TRUE(error_msg.empty()); |
Mathieu Chartier | 16d29f8 | 2015-11-10 10:32:52 -0800 | [diff] [blame] | 435 | ASSERT_TRUE(map0->BaseBegin() == valid_address); |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 436 | // Map at an unspecified address, which should succeed. |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 437 | std::unique_ptr<MemMap> map1(MemMap::MapAnonymous("MapAnonymous1", |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 438 | nullptr, |
| 439 | kPageSize, |
| 440 | PROT_READ | PROT_WRITE, |
| 441 | false, |
| 442 | false, |
| 443 | &error_msg)); |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 444 | ASSERT_TRUE(map1.get() != nullptr) << error_msg; |
| 445 | ASSERT_TRUE(error_msg.empty()); |
| 446 | ASSERT_TRUE(map1->BaseBegin() != nullptr); |
| 447 | // Attempt to map at the same address, which should fail. |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 448 | std::unique_ptr<MemMap> map2(MemMap::MapAnonymous("MapAnonymous2", |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 449 | reinterpret_cast<uint8_t*>(map1->BaseBegin()), |
| 450 | kPageSize, |
| 451 | PROT_READ | PROT_WRITE, |
| 452 | false, |
| 453 | false, |
| 454 | &error_msg)); |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 455 | ASSERT_TRUE(map2.get() == nullptr) << error_msg; |
| 456 | ASSERT_TRUE(!error_msg.empty()); |
| 457 | } |
| 458 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 459 | TEST_F(MemMapTest, RemapAtEnd) { |
| 460 | RemapAtEndTest(false); |
| 461 | } |
| 462 | |
| 463 | #ifdef __LP64__ |
| 464 | TEST_F(MemMapTest, RemapAtEnd32bit) { |
| 465 | RemapAtEndTest(true); |
| 466 | } |
| 467 | #endif |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 468 | |
Qiming Shi | 84d49cc | 2014-04-24 15:38:41 +0800 | [diff] [blame] | 469 | TEST_F(MemMapTest, MapAnonymousExactAddr32bitHighAddr) { |
Roland Levillain | 14306b8 | 2016-01-20 12:13:57 +0000 | [diff] [blame] | 470 | // Some MIPS32 hardware (namely the Creator Ci20 development board) |
| 471 | // cannot allocate in the 2GB-4GB region. |
| 472 | TEST_DISABLED_FOR_MIPS(); |
| 473 | |
Roland Levillain | 0b0d3b4 | 2018-06-14 13:55:49 +0100 | [diff] [blame^] | 474 | // This test does not work under AddressSanitizer. |
| 475 | // Historical note: This test did not work under Valgrind either. |
Roland Levillain | 05e34f4 | 2018-05-24 13:19:05 +0000 | [diff] [blame] | 476 | TEST_DISABLED_FOR_MEMORY_TOOL(); |
| 477 | |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 478 | CommonInit(); |
Roland Levillain | 05e34f4 | 2018-05-24 13:19:05 +0000 | [diff] [blame] | 479 | constexpr size_t size = 0x100000; |
| 480 | // Try all addresses starting from 2GB to 4GB. |
| 481 | size_t start_addr = 2 * GB; |
| 482 | std::string error_msg; |
| 483 | std::unique_ptr<MemMap> map; |
| 484 | for (; start_addr <= std::numeric_limits<uint32_t>::max() - size; start_addr += size) { |
| 485 | map.reset(MemMap::MapAnonymous("MapAnonymousExactAddr32bitHighAddr", |
| 486 | reinterpret_cast<uint8_t*>(start_addr), |
| 487 | size, |
| 488 | PROT_READ | PROT_WRITE, |
| 489 | /*low_4gb*/true, |
| 490 | false, |
| 491 | &error_msg)); |
| 492 | if (map != nullptr) { |
| 493 | break; |
Mathieu Chartier | 16d29f8 | 2015-11-10 10:32:52 -0800 | [diff] [blame] | 494 | } |
Andreas Gampe | 928f72b | 2014-09-09 19:53:48 -0700 | [diff] [blame] | 495 | } |
Roland Levillain | 05e34f4 | 2018-05-24 13:19:05 +0000 | [diff] [blame] | 496 | ASSERT_TRUE(map.get() != nullptr) << error_msg; |
| 497 | ASSERT_GE(reinterpret_cast<uintptr_t>(map->End()), 2u * GB); |
| 498 | ASSERT_TRUE(error_msg.empty()); |
| 499 | ASSERT_EQ(BaseBegin(map.get()), reinterpret_cast<void*>(start_addr)); |
Qiming Shi | 84d49cc | 2014-04-24 15:38:41 +0800 | [diff] [blame] | 500 | } |
| 501 | |
| 502 | TEST_F(MemMapTest, MapAnonymousOverflow) { |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 503 | CommonInit(); |
Qiming Shi | 84d49cc | 2014-04-24 15:38:41 +0800 | [diff] [blame] | 504 | std::string error_msg; |
| 505 | uintptr_t ptr = 0; |
| 506 | ptr -= kPageSize; // Now it's close to the top. |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 507 | std::unique_ptr<MemMap> map(MemMap::MapAnonymous("MapAnonymousOverflow", |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 508 | reinterpret_cast<uint8_t*>(ptr), |
| 509 | 2 * kPageSize, // brings it over the top. |
| 510 | PROT_READ | PROT_WRITE, |
| 511 | false, |
| 512 | false, |
| 513 | &error_msg)); |
Qiming Shi | 84d49cc | 2014-04-24 15:38:41 +0800 | [diff] [blame] | 514 | ASSERT_EQ(nullptr, map.get()); |
| 515 | ASSERT_FALSE(error_msg.empty()); |
| 516 | } |
| 517 | |
| 518 | #ifdef __LP64__ |
| 519 | TEST_F(MemMapTest, MapAnonymousLow4GBExpectedTooHigh) { |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 520 | CommonInit(); |
Qiming Shi | 84d49cc | 2014-04-24 15:38:41 +0800 | [diff] [blame] | 521 | std::string error_msg; |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 522 | std::unique_ptr<MemMap> map( |
| 523 | MemMap::MapAnonymous("MapAnonymousLow4GBExpectedTooHigh", |
| 524 | reinterpret_cast<uint8_t*>(UINT64_C(0x100000000)), |
| 525 | kPageSize, |
| 526 | PROT_READ | PROT_WRITE, |
| 527 | true, |
| 528 | false, |
| 529 | &error_msg)); |
Qiming Shi | 84d49cc | 2014-04-24 15:38:41 +0800 | [diff] [blame] | 530 | ASSERT_EQ(nullptr, map.get()); |
| 531 | ASSERT_FALSE(error_msg.empty()); |
| 532 | } |
| 533 | |
| 534 | TEST_F(MemMapTest, MapAnonymousLow4GBRangeTooHigh) { |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 535 | CommonInit(); |
Qiming Shi | 84d49cc | 2014-04-24 15:38:41 +0800 | [diff] [blame] | 536 | std::string error_msg; |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 537 | std::unique_ptr<MemMap> map(MemMap::MapAnonymous("MapAnonymousLow4GBRangeTooHigh", |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 538 | reinterpret_cast<uint8_t*>(0xF0000000), |
| 539 | 0x20000000, |
| 540 | PROT_READ | PROT_WRITE, |
| 541 | true, |
| 542 | false, |
| 543 | &error_msg)); |
Qiming Shi | 84d49cc | 2014-04-24 15:38:41 +0800 | [diff] [blame] | 544 | ASSERT_EQ(nullptr, map.get()); |
| 545 | ASSERT_FALSE(error_msg.empty()); |
| 546 | } |
| 547 | #endif |
| 548 | |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 549 | TEST_F(MemMapTest, MapAnonymousReuse) { |
| 550 | CommonInit(); |
| 551 | std::string error_msg; |
| 552 | std::unique_ptr<MemMap> map(MemMap::MapAnonymous("MapAnonymousReserve", |
| 553 | nullptr, |
| 554 | 0x20000, |
| 555 | PROT_READ | PROT_WRITE, |
| 556 | false, |
| 557 | false, |
| 558 | &error_msg)); |
| 559 | ASSERT_NE(nullptr, map.get()); |
| 560 | ASSERT_TRUE(error_msg.empty()); |
| 561 | std::unique_ptr<MemMap> map2(MemMap::MapAnonymous("MapAnonymousReused", |
| 562 | reinterpret_cast<uint8_t*>(map->BaseBegin()), |
| 563 | 0x10000, |
| 564 | PROT_READ | PROT_WRITE, |
| 565 | false, |
| 566 | true, |
| 567 | &error_msg)); |
| 568 | ASSERT_NE(nullptr, map2.get()); |
| 569 | ASSERT_TRUE(error_msg.empty()); |
| 570 | } |
| 571 | |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 572 | TEST_F(MemMapTest, CheckNoGaps) { |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 573 | CommonInit(); |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 574 | std::string error_msg; |
| 575 | constexpr size_t kNumPages = 3; |
| 576 | // Map a 3-page mem map. |
| 577 | std::unique_ptr<MemMap> map(MemMap::MapAnonymous("MapAnonymous0", |
| 578 | nullptr, |
| 579 | kPageSize * kNumPages, |
| 580 | PROT_READ | PROT_WRITE, |
| 581 | false, |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 582 | false, |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 583 | &error_msg)); |
| 584 | ASSERT_TRUE(map.get() != nullptr) << error_msg; |
| 585 | ASSERT_TRUE(error_msg.empty()); |
| 586 | // Record the base address. |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 587 | uint8_t* map_base = reinterpret_cast<uint8_t*>(map->BaseBegin()); |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 588 | // Unmap it. |
| 589 | map.reset(); |
| 590 | |
| 591 | // Map at the same address, but in page-sized separate mem maps, |
| 592 | // assuming the space at the address is still available. |
| 593 | std::unique_ptr<MemMap> map0(MemMap::MapAnonymous("MapAnonymous0", |
| 594 | map_base, |
| 595 | kPageSize, |
| 596 | PROT_READ | PROT_WRITE, |
| 597 | false, |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 598 | false, |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 599 | &error_msg)); |
| 600 | ASSERT_TRUE(map0.get() != nullptr) << error_msg; |
| 601 | ASSERT_TRUE(error_msg.empty()); |
| 602 | std::unique_ptr<MemMap> map1(MemMap::MapAnonymous("MapAnonymous1", |
| 603 | map_base + kPageSize, |
| 604 | kPageSize, |
| 605 | PROT_READ | PROT_WRITE, |
| 606 | false, |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 607 | false, |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 608 | &error_msg)); |
| 609 | ASSERT_TRUE(map1.get() != nullptr) << error_msg; |
| 610 | ASSERT_TRUE(error_msg.empty()); |
| 611 | std::unique_ptr<MemMap> map2(MemMap::MapAnonymous("MapAnonymous2", |
| 612 | map_base + kPageSize * 2, |
| 613 | kPageSize, |
| 614 | PROT_READ | PROT_WRITE, |
| 615 | false, |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 616 | false, |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 617 | &error_msg)); |
| 618 | ASSERT_TRUE(map2.get() != nullptr) << error_msg; |
| 619 | ASSERT_TRUE(error_msg.empty()); |
| 620 | |
| 621 | // One-map cases. |
| 622 | ASSERT_TRUE(MemMap::CheckNoGaps(map0.get(), map0.get())); |
| 623 | ASSERT_TRUE(MemMap::CheckNoGaps(map1.get(), map1.get())); |
| 624 | ASSERT_TRUE(MemMap::CheckNoGaps(map2.get(), map2.get())); |
| 625 | |
| 626 | // Two or three-map cases. |
| 627 | ASSERT_TRUE(MemMap::CheckNoGaps(map0.get(), map1.get())); |
| 628 | ASSERT_TRUE(MemMap::CheckNoGaps(map1.get(), map2.get())); |
| 629 | ASSERT_TRUE(MemMap::CheckNoGaps(map0.get(), map2.get())); |
| 630 | |
| 631 | // Unmap the middle one. |
| 632 | map1.reset(); |
| 633 | |
| 634 | // Should return false now that there's a gap in the middle. |
| 635 | ASSERT_FALSE(MemMap::CheckNoGaps(map0.get(), map2.get())); |
| 636 | } |
| 637 | |
Hiroshi Yamauchi | 3c3c4a1 | 2017-02-21 16:49:59 -0800 | [diff] [blame] | 638 | TEST_F(MemMapTest, AlignBy) { |
| 639 | CommonInit(); |
| 640 | std::string error_msg; |
| 641 | // Cast the page size to size_t. |
| 642 | const size_t page_size = static_cast<size_t>(kPageSize); |
| 643 | // Map a region. |
| 644 | std::unique_ptr<MemMap> m0(MemMap::MapAnonymous("MemMapTest_AlignByTest_map0", |
| 645 | nullptr, |
| 646 | 14 * page_size, |
| 647 | PROT_READ | PROT_WRITE, |
| 648 | false, |
| 649 | false, |
| 650 | &error_msg)); |
| 651 | uint8_t* base0 = m0->Begin(); |
| 652 | ASSERT_TRUE(base0 != nullptr) << error_msg; |
| 653 | ASSERT_EQ(m0->Size(), 14 * page_size); |
| 654 | ASSERT_EQ(BaseBegin(m0.get()), base0); |
| 655 | ASSERT_EQ(BaseSize(m0.get()), m0->Size()); |
| 656 | |
| 657 | // Break it into several regions by using RemapAtEnd. |
| 658 | std::unique_ptr<MemMap> m1(m0->RemapAtEnd(base0 + 3 * page_size, |
| 659 | "MemMapTest_AlignByTest_map1", |
| 660 | PROT_READ | PROT_WRITE, |
| 661 | &error_msg)); |
| 662 | uint8_t* base1 = m1->Begin(); |
| 663 | ASSERT_TRUE(base1 != nullptr) << error_msg; |
| 664 | ASSERT_EQ(base1, base0 + 3 * page_size); |
| 665 | ASSERT_EQ(m0->Size(), 3 * page_size); |
| 666 | |
| 667 | std::unique_ptr<MemMap> m2(m1->RemapAtEnd(base1 + 4 * page_size, |
| 668 | "MemMapTest_AlignByTest_map2", |
| 669 | PROT_READ | PROT_WRITE, |
| 670 | &error_msg)); |
| 671 | uint8_t* base2 = m2->Begin(); |
| 672 | ASSERT_TRUE(base2 != nullptr) << error_msg; |
| 673 | ASSERT_EQ(base2, base1 + 4 * page_size); |
| 674 | ASSERT_EQ(m1->Size(), 4 * page_size); |
| 675 | |
| 676 | std::unique_ptr<MemMap> m3(m2->RemapAtEnd(base2 + 3 * page_size, |
| 677 | "MemMapTest_AlignByTest_map1", |
| 678 | PROT_READ | PROT_WRITE, |
| 679 | &error_msg)); |
| 680 | uint8_t* base3 = m3->Begin(); |
| 681 | ASSERT_TRUE(base3 != nullptr) << error_msg; |
| 682 | ASSERT_EQ(base3, base2 + 3 * page_size); |
| 683 | ASSERT_EQ(m2->Size(), 3 * page_size); |
| 684 | ASSERT_EQ(m3->Size(), 4 * page_size); |
| 685 | |
| 686 | uint8_t* end0 = base0 + m0->Size(); |
| 687 | uint8_t* end1 = base1 + m1->Size(); |
| 688 | uint8_t* end2 = base2 + m2->Size(); |
| 689 | uint8_t* end3 = base3 + m3->Size(); |
| 690 | |
| 691 | ASSERT_EQ(static_cast<size_t>(end3 - base0), 14 * page_size); |
| 692 | |
| 693 | if (IsAlignedParam(base0, 2 * page_size)) { |
| 694 | ASSERT_FALSE(IsAlignedParam(base1, 2 * page_size)); |
| 695 | ASSERT_FALSE(IsAlignedParam(base2, 2 * page_size)); |
| 696 | ASSERT_TRUE(IsAlignedParam(base3, 2 * page_size)); |
| 697 | ASSERT_TRUE(IsAlignedParam(end3, 2 * page_size)); |
| 698 | } else { |
| 699 | ASSERT_TRUE(IsAlignedParam(base1, 2 * page_size)); |
| 700 | ASSERT_TRUE(IsAlignedParam(base2, 2 * page_size)); |
| 701 | ASSERT_FALSE(IsAlignedParam(base3, 2 * page_size)); |
| 702 | ASSERT_FALSE(IsAlignedParam(end3, 2 * page_size)); |
| 703 | } |
| 704 | |
| 705 | // Align by 2 * page_size; |
| 706 | m0->AlignBy(2 * page_size); |
| 707 | m1->AlignBy(2 * page_size); |
| 708 | m2->AlignBy(2 * page_size); |
| 709 | m3->AlignBy(2 * page_size); |
| 710 | |
| 711 | EXPECT_TRUE(IsAlignedParam(m0->Begin(), 2 * page_size)); |
| 712 | EXPECT_TRUE(IsAlignedParam(m1->Begin(), 2 * page_size)); |
| 713 | EXPECT_TRUE(IsAlignedParam(m2->Begin(), 2 * page_size)); |
| 714 | EXPECT_TRUE(IsAlignedParam(m3->Begin(), 2 * page_size)); |
| 715 | |
| 716 | EXPECT_TRUE(IsAlignedParam(m0->Begin() + m0->Size(), 2 * page_size)); |
| 717 | EXPECT_TRUE(IsAlignedParam(m1->Begin() + m1->Size(), 2 * page_size)); |
| 718 | EXPECT_TRUE(IsAlignedParam(m2->Begin() + m2->Size(), 2 * page_size)); |
| 719 | EXPECT_TRUE(IsAlignedParam(m3->Begin() + m3->Size(), 2 * page_size)); |
| 720 | |
| 721 | if (IsAlignedParam(base0, 2 * page_size)) { |
| 722 | EXPECT_EQ(m0->Begin(), base0); |
| 723 | EXPECT_EQ(m0->Begin() + m0->Size(), end0 - page_size); |
| 724 | EXPECT_EQ(m1->Begin(), base1 + page_size); |
| 725 | EXPECT_EQ(m1->Begin() + m1->Size(), end1 - page_size); |
| 726 | EXPECT_EQ(m2->Begin(), base2 + page_size); |
| 727 | EXPECT_EQ(m2->Begin() + m2->Size(), end2); |
| 728 | EXPECT_EQ(m3->Begin(), base3); |
| 729 | EXPECT_EQ(m3->Begin() + m3->Size(), end3); |
| 730 | } else { |
| 731 | EXPECT_EQ(m0->Begin(), base0 + page_size); |
| 732 | EXPECT_EQ(m0->Begin() + m0->Size(), end0); |
| 733 | EXPECT_EQ(m1->Begin(), base1); |
| 734 | EXPECT_EQ(m1->Begin() + m1->Size(), end1); |
| 735 | EXPECT_EQ(m2->Begin(), base2); |
| 736 | EXPECT_EQ(m2->Begin() + m2->Size(), end2 - page_size); |
| 737 | EXPECT_EQ(m3->Begin(), base3 + page_size); |
| 738 | EXPECT_EQ(m3->Begin() + m3->Size(), end3 - page_size); |
| 739 | } |
| 740 | } |
| 741 | |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 742 | } // namespace art |