Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2008 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" |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 18 | #include "thread-inl.h" |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 19 | |
Ian Rogers | debeb3a | 2014-01-23 16:54:52 -0800 | [diff] [blame] | 20 | #include <inttypes.h> |
Christopher Ferris | 943af7d | 2014-01-16 12:41:46 -0800 | [diff] [blame] | 21 | #include <backtrace/BacktraceMap.h> |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 22 | #include <memory> |
Elliott Hughes | ecd3a6f | 2012-06-06 18:16:37 -0700 | [diff] [blame] | 23 | |
Andreas Gampe | d8f26db | 2014-05-19 17:01:13 -0700 | [diff] [blame] | 24 | // See CreateStartPos below. |
| 25 | #ifdef __BIONIC__ |
| 26 | #include <sys/auxv.h> |
| 27 | #endif |
| 28 | |
Elliott Hughes | e222ee0 | 2012-12-13 14:41:43 -0800 | [diff] [blame] | 29 | #include "base/stringprintf.h" |
| 30 | #include "ScopedFd.h" |
| 31 | #include "utils.h" |
| 32 | |
Elliott Hughes | 6c9c06d | 2011-11-07 16:43:47 -0800 | [diff] [blame] | 33 | #define USE_ASHMEM 1 |
| 34 | |
| 35 | #ifdef USE_ASHMEM |
| 36 | #include <cutils/ashmem.h> |
Ian Rogers | 997f0f9 | 2014-06-21 22:58:05 -0700 | [diff] [blame] | 37 | #ifndef ANDROID_OS |
| 38 | #include <sys/resource.h> |
| 39 | #endif |
Elliott Hughes | 6c9c06d | 2011-11-07 16:43:47 -0800 | [diff] [blame] | 40 | #endif |
| 41 | |
Ian Rogers | d6b6865 | 2014-06-23 14:07:03 -0700 | [diff] [blame] | 42 | #ifndef MAP_ANONYMOUS |
| 43 | #define MAP_ANONYMOUS MAP_ANON |
| 44 | #endif |
| 45 | |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 46 | namespace art { |
| 47 | |
Christopher Ferris | 943af7d | 2014-01-16 12:41:46 -0800 | [diff] [blame] | 48 | static std::ostream& operator<<( |
| 49 | std::ostream& os, |
| 50 | std::pair<BacktraceMap::const_iterator, BacktraceMap::const_iterator> iters) { |
| 51 | for (BacktraceMap::const_iterator it = iters.first; it != iters.second; ++it) { |
| 52 | os << StringPrintf("0x%08x-0x%08x %c%c%c %s\n", |
| 53 | static_cast<uint32_t>(it->start), |
| 54 | static_cast<uint32_t>(it->end), |
| 55 | (it->flags & PROT_READ) ? 'r' : '-', |
| 56 | (it->flags & PROT_WRITE) ? 'w' : '-', |
| 57 | (it->flags & PROT_EXEC) ? 'x' : '-', it->name.c_str()); |
Elliott Hughes | ecd3a6f | 2012-06-06 18:16:37 -0700 | [diff] [blame] | 58 | } |
| 59 | return os; |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 60 | } |
| 61 | |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 62 | std::ostream& operator<<(std::ostream& os, const std::multimap<void*, MemMap*>& mem_maps) { |
| 63 | os << "MemMap:" << std::endl; |
| 64 | for (auto it = mem_maps.begin(); it != mem_maps.end(); ++it) { |
| 65 | void* base = it->first; |
| 66 | MemMap* map = it->second; |
| 67 | CHECK_EQ(base, map->BaseBegin()); |
| 68 | os << *map << std::endl; |
| 69 | } |
| 70 | return os; |
| 71 | } |
| 72 | |
| 73 | std::multimap<void*, MemMap*> MemMap::maps_; |
| 74 | |
Ian Rogers | c3ccc10 | 2014-06-25 11:52:14 -0700 | [diff] [blame] | 75 | #if USE_ART_LOW_4G_ALLOCATOR |
Andreas Gampe | d8f26db | 2014-05-19 17:01:13 -0700 | [diff] [blame] | 76 | // Handling mem_map in 32b address range for 64b architectures that do not support MAP_32BIT. |
| 77 | |
| 78 | // The regular start of memory allocations. The first 64KB is protected by SELinux. |
Andreas Gampe | 6bd621a | 2014-05-16 17:28:58 -0700 | [diff] [blame] | 79 | static constexpr uintptr_t LOW_MEM_START = 64 * KB; |
Andreas Gampe | 7104cbf | 2014-03-21 11:44:43 -0700 | [diff] [blame] | 80 | |
Andreas Gampe | d8f26db | 2014-05-19 17:01:13 -0700 | [diff] [blame] | 81 | // Generate random starting position. |
| 82 | // To not interfere with image position, take the image's address and only place it below. Current |
| 83 | // formula (sketch): |
| 84 | // |
| 85 | // ART_BASE_ADDR = 0001XXXXXXXXXXXXXXX |
| 86 | // ---------------------------------------- |
| 87 | // = 0000111111111111111 |
| 88 | // & ~(kPageSize - 1) =~0000000000000001111 |
| 89 | // ---------------------------------------- |
| 90 | // mask = 0000111111111110000 |
| 91 | // & random data = YYYYYYYYYYYYYYYYYYY |
| 92 | // ----------------------------------- |
| 93 | // tmp = 0000YYYYYYYYYYY0000 |
| 94 | // + LOW_MEM_START = 0000000000001000000 |
| 95 | // -------------------------------------- |
| 96 | // start |
| 97 | // |
| 98 | // getauxval as an entropy source is exposed in Bionic, but not in glibc before 2.16. When we |
| 99 | // do not have Bionic, simply start with LOW_MEM_START. |
| 100 | |
| 101 | // Function is standalone so it can be tested somewhat in mem_map_test.cc. |
| 102 | #ifdef __BIONIC__ |
| 103 | uintptr_t CreateStartPos(uint64_t input) { |
| 104 | CHECK_NE(0, ART_BASE_ADDRESS); |
| 105 | |
| 106 | // Start with all bits below highest bit in ART_BASE_ADDRESS. |
| 107 | constexpr size_t leading_zeros = CLZ(static_cast<uint32_t>(ART_BASE_ADDRESS)); |
| 108 | constexpr uintptr_t mask_ones = (1 << (31 - leading_zeros)) - 1; |
| 109 | |
| 110 | // Lowest (usually 12) bits are not used, as aligned by page size. |
| 111 | constexpr uintptr_t mask = mask_ones & ~(kPageSize - 1); |
| 112 | |
| 113 | // Mask input data. |
| 114 | return (input & mask) + LOW_MEM_START; |
| 115 | } |
| 116 | #endif |
| 117 | |
| 118 | static uintptr_t GenerateNextMemPos() { |
| 119 | #ifdef __BIONIC__ |
| 120 | uint8_t* random_data = reinterpret_cast<uint8_t*>(getauxval(AT_RANDOM)); |
| 121 | // The lower 8B are taken for the stack guard. Use the upper 8B (with mask). |
| 122 | return CreateStartPos(*reinterpret_cast<uintptr_t*>(random_data + 8)); |
| 123 | #else |
| 124 | // No auxv on host, see above. |
| 125 | return LOW_MEM_START; |
| 126 | #endif |
| 127 | } |
| 128 | |
| 129 | // Initialize linear scan to random position. |
| 130 | uintptr_t MemMap::next_mem_pos_ = GenerateNextMemPos(); |
Stuart Monteith | 8dba5aa | 2014-03-12 12:44:01 +0000 | [diff] [blame] | 131 | #endif |
| 132 | |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 133 | // Return true if the address range is contained in a single /proc/self/map entry. |
Narayan Kamath | b89c3da | 2014-08-21 17:38:09 +0100 | [diff] [blame] | 134 | static bool ContainedWithinExistingMap(uintptr_t begin, |
| 135 | uintptr_t end, |
| 136 | std::string* error_msg) { |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 137 | std::unique_ptr<BacktraceMap> map(BacktraceMap::Create(getpid(), true)); |
Christopher Ferris | 836572a | 2014-08-05 15:43:13 -0700 | [diff] [blame] | 138 | if (map.get() == nullptr) { |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 139 | *error_msg = StringPrintf("Failed to build process map"); |
| 140 | return false; |
| 141 | } |
| 142 | for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { |
| 143 | if ((begin >= it->start && begin < it->end) // start of new within old |
| 144 | && (end > it->start && end <= it->end)) { // end of new within old |
| 145 | return true; |
| 146 | } |
| 147 | } |
| 148 | std::string maps; |
| 149 | ReadFileToString("/proc/self/maps", &maps); |
| 150 | *error_msg = StringPrintf("Requested region 0x%08" PRIxPTR "-0x%08" PRIxPTR " does not overlap " |
| 151 | "any existing map:\n%s\n", |
| 152 | begin, end, maps.c_str()); |
| 153 | return false; |
| 154 | } |
| 155 | |
| 156 | // Return true if the address range does not conflict with any /proc/self/maps entry. |
| 157 | static bool CheckNonOverlapping(uintptr_t begin, |
| 158 | uintptr_t end, |
| 159 | std::string* error_msg) { |
| 160 | std::unique_ptr<BacktraceMap> map(BacktraceMap::Create(getpid(), true)); |
Christopher Ferris | 836572a | 2014-08-05 15:43:13 -0700 | [diff] [blame] | 161 | if (map.get() == nullptr) { |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 162 | *error_msg = StringPrintf("Failed to build process map"); |
| 163 | return false; |
| 164 | } |
| 165 | for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { |
| 166 | if ((begin >= it->start && begin < it->end) // start of new within old |
| 167 | || (end > it->start && end < it->end) // end of new within old |
| 168 | || (begin <= it->start && end > it->end)) { // start/end of new includes all of old |
| 169 | std::ostringstream map_info; |
| 170 | map_info << std::make_pair(it, map->end()); |
| 171 | *error_msg = StringPrintf("Requested region 0x%08" PRIxPTR "-0x%08" PRIxPTR " overlaps with " |
| 172 | "existing map 0x%08" PRIxPTR "-0x%08" PRIxPTR " (%s)\n%s", |
| 173 | begin, end, |
| 174 | static_cast<uintptr_t>(it->start), static_cast<uintptr_t>(it->end), |
| 175 | it->name.c_str(), |
| 176 | map_info.str().c_str()); |
| 177 | return false; |
| 178 | } |
| 179 | } |
| 180 | return true; |
| 181 | } |
| 182 | |
| 183 | // CheckMapRequest to validate a non-MAP_FAILED mmap result based on |
| 184 | // the expected value, calling munmap if validation fails, giving the |
| 185 | // reason in error_msg. |
| 186 | // |
| 187 | // If the expected_ptr is nullptr, nothing is checked beyond the fact |
| 188 | // that the actual_ptr is not MAP_FAILED. However, if expected_ptr is |
| 189 | // non-null, we check that pointer is the actual_ptr == expected_ptr, |
| 190 | // and if not, report in error_msg what the conflict mapping was if |
| 191 | // found, or a generic error in other cases. |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 192 | static bool CheckMapRequest(byte* expected_ptr, void* actual_ptr, size_t byte_count, |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 193 | std::string* error_msg) { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 194 | // Handled first by caller for more specific error messages. |
| 195 | CHECK(actual_ptr != MAP_FAILED); |
| 196 | |
| 197 | if (expected_ptr == nullptr) { |
| 198 | return true; |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 199 | } |
Elliott Hughes | ecd3a6f | 2012-06-06 18:16:37 -0700 | [diff] [blame] | 200 | |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 201 | uintptr_t actual = reinterpret_cast<uintptr_t>(actual_ptr); |
| 202 | uintptr_t expected = reinterpret_cast<uintptr_t>(expected_ptr); |
| 203 | uintptr_t limit = expected + byte_count; |
| 204 | |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 205 | if (expected_ptr == actual_ptr) { |
| 206 | return true; |
| 207 | } |
| 208 | |
| 209 | // We asked for an address but didn't get what we wanted, all paths below here should fail. |
| 210 | int result = munmap(actual_ptr, byte_count); |
| 211 | if (result == -1) { |
| 212 | PLOG(WARNING) << StringPrintf("munmap(%p, %zd) failed", actual_ptr, byte_count); |
| 213 | } |
| 214 | |
Narayan Kamath | b89c3da | 2014-08-21 17:38:09 +0100 | [diff] [blame] | 215 | // We call this here so that we can try and generate a full error |
| 216 | // message with the overlapping mapping. There's no guarantee that |
| 217 | // that there will be an overlap though, since |
| 218 | // - The kernel is not *required* to honour expected_ptr unless MAP_FIXED is |
| 219 | // true, even if there is no overlap |
| 220 | // - There might have been an overlap at the point of mmap, but the |
| 221 | // overlapping region has since been unmapped. |
| 222 | std::string error_detail; |
| 223 | CheckNonOverlapping(expected, limit, &error_detail); |
| 224 | |
| 225 | std::ostringstream os; |
| 226 | os << StringPrintf("Failed to mmap at expected address, mapped at " |
| 227 | "0x%08" PRIxPTR " instead of 0x%08" PRIxPTR, |
| 228 | actual, expected); |
| 229 | if (!error_detail.empty()) { |
| 230 | os << " : " << error_detail; |
Christopher Ferris | 943af7d | 2014-01-16 12:41:46 -0800 | [diff] [blame] | 231 | } |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 232 | |
Narayan Kamath | b89c3da | 2014-08-21 17:38:09 +0100 | [diff] [blame] | 233 | *error_msg = os.str(); |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 234 | return false; |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 235 | } |
| 236 | |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 237 | MemMap* MemMap::MapAnonymous(const char* name, byte* expected_ptr, size_t byte_count, int prot, |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 238 | bool low_4gb, std::string* error_msg) { |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 239 | if (byte_count == 0) { |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 240 | return new MemMap(name, nullptr, 0, nullptr, 0, prot, false); |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 241 | } |
Elliott Hughes | ecd3a6f | 2012-06-06 18:16:37 -0700 | [diff] [blame] | 242 | size_t page_aligned_byte_count = RoundUp(byte_count, kPageSize); |
Elliott Hughes | 6c9c06d | 2011-11-07 16:43:47 -0800 | [diff] [blame] | 243 | |
Elliott Hughes | 6c9c06d | 2011-11-07 16:43:47 -0800 | [diff] [blame] | 244 | int flags = MAP_PRIVATE | MAP_ANONYMOUS; |
Ian Rogers | 997f0f9 | 2014-06-21 22:58:05 -0700 | [diff] [blame] | 245 | ScopedFd fd(-1); |
| 246 | |
| 247 | #ifdef USE_ASHMEM |
| 248 | #ifdef HAVE_ANDROID_OS |
| 249 | const bool use_ashmem = true; |
| 250 | #else |
| 251 | // When not on Android ashmem is faked using files in /tmp. Ensure that such files won't |
| 252 | // fail due to ulimit restrictions. If they will then use a regular mmap. |
| 253 | struct rlimit rlimit_fsize; |
| 254 | CHECK_EQ(getrlimit(RLIMIT_FSIZE, &rlimit_fsize), 0); |
| 255 | const bool use_ashmem = (rlimit_fsize.rlim_cur == RLIM_INFINITY) || |
| 256 | (page_aligned_byte_count < rlimit_fsize.rlim_cur); |
| 257 | #endif |
| 258 | if (use_ashmem) { |
| 259 | // android_os_Debug.cpp read_mapinfo assumes all ashmem regions associated with the VM are |
| 260 | // prefixed "dalvik-". |
| 261 | std::string debug_friendly_name("dalvik-"); |
| 262 | debug_friendly_name += name; |
| 263 | fd.reset(ashmem_create_region(debug_friendly_name.c_str(), page_aligned_byte_count)); |
| 264 | if (fd.get() == -1) { |
| 265 | *error_msg = StringPrintf("ashmem_create_region failed for '%s': %s", name, strerror(errno)); |
| 266 | return nullptr; |
| 267 | } |
| 268 | flags = MAP_PRIVATE; |
| 269 | } |
Elliott Hughes | 6c9c06d | 2011-11-07 16:43:47 -0800 | [diff] [blame] | 270 | #endif |
Stuart Monteith | 8dba5aa | 2014-03-12 12:44:01 +0000 | [diff] [blame] | 271 | |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 272 | // We need to store and potentially set an error number for pretty printing of errors |
| 273 | int saved_errno = 0; |
| 274 | |
Qiming Shi | 84d49cc | 2014-04-24 15:38:41 +0800 | [diff] [blame] | 275 | #ifdef __LP64__ |
| 276 | // When requesting low_4g memory and having an expectation, the requested range should fit into |
| 277 | // 4GB. |
| 278 | if (low_4gb && ( |
| 279 | // Start out of bounds. |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 280 | (reinterpret_cast<uintptr_t>(expected_ptr) >> 32) != 0 || |
Qiming Shi | 84d49cc | 2014-04-24 15:38:41 +0800 | [diff] [blame] | 281 | // End out of bounds. For simplicity, this will fail for the last page of memory. |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 282 | (reinterpret_cast<uintptr_t>(expected_ptr + page_aligned_byte_count) >> 32) != 0)) { |
Qiming Shi | 84d49cc | 2014-04-24 15:38:41 +0800 | [diff] [blame] | 283 | *error_msg = StringPrintf("The requested address space (%p, %p) cannot fit in low_4gb", |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 284 | expected_ptr, expected_ptr + page_aligned_byte_count); |
Qiming Shi | 84d49cc | 2014-04-24 15:38:41 +0800 | [diff] [blame] | 285 | return nullptr; |
| 286 | } |
| 287 | #endif |
| 288 | |
Stuart Monteith | 8dba5aa | 2014-03-12 12:44:01 +0000 | [diff] [blame] | 289 | // TODO: |
| 290 | // A page allocator would be a useful abstraction here, as |
| 291 | // 1) It is doubtful that MAP_32BIT on x86_64 is doing the right job for us |
| 292 | // 2) The linear scheme, even with simple saving of the last known position, is very crude |
Ian Rogers | c3ccc10 | 2014-06-25 11:52:14 -0700 | [diff] [blame] | 293 | #if USE_ART_LOW_4G_ALLOCATOR |
Stuart Monteith | 8dba5aa | 2014-03-12 12:44:01 +0000 | [diff] [blame] | 294 | // MAP_32BIT only available on x86_64. |
| 295 | void* actual = MAP_FAILED; |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 296 | if (low_4gb && expected_ptr == nullptr) { |
Andreas Gampe | 7104cbf | 2014-03-21 11:44:43 -0700 | [diff] [blame] | 297 | bool first_run = true; |
| 298 | |
Andreas Gampe | 71a3eba | 2014-03-17 12:57:08 -0700 | [diff] [blame] | 299 | for (uintptr_t ptr = next_mem_pos_; ptr < 4 * GB; ptr += kPageSize) { |
Andreas Gampe | 7104cbf | 2014-03-21 11:44:43 -0700 | [diff] [blame] | 300 | if (4U * GB - ptr < page_aligned_byte_count) { |
| 301 | // Not enough memory until 4GB. |
| 302 | if (first_run) { |
| 303 | // Try another time from the bottom; |
Andreas Gampe | 9de65ff | 2014-03-21 17:25:57 -0700 | [diff] [blame] | 304 | ptr = LOW_MEM_START - kPageSize; |
Andreas Gampe | 7104cbf | 2014-03-21 11:44:43 -0700 | [diff] [blame] | 305 | first_run = false; |
| 306 | continue; |
| 307 | } else { |
| 308 | // Second try failed. |
| 309 | break; |
| 310 | } |
| 311 | } |
| 312 | |
Stuart Monteith | 8dba5aa | 2014-03-12 12:44:01 +0000 | [diff] [blame] | 313 | uintptr_t tail_ptr; |
| 314 | |
| 315 | // Check pages are free. |
| 316 | bool safe = true; |
| 317 | for (tail_ptr = ptr; tail_ptr < ptr + page_aligned_byte_count; tail_ptr += kPageSize) { |
| 318 | if (msync(reinterpret_cast<void*>(tail_ptr), kPageSize, 0) == 0) { |
| 319 | safe = false; |
| 320 | break; |
| 321 | } else { |
| 322 | DCHECK_EQ(errno, ENOMEM); |
| 323 | } |
| 324 | } |
| 325 | |
| 326 | next_mem_pos_ = tail_ptr; // update early, as we break out when we found and mapped a region |
| 327 | |
| 328 | if (safe == true) { |
| 329 | actual = mmap(reinterpret_cast<void*>(ptr), page_aligned_byte_count, prot, flags, fd.get(), |
| 330 | 0); |
| 331 | if (actual != MAP_FAILED) { |
Mathieu Chartier | c355a2a | 2014-05-30 13:02:46 -0700 | [diff] [blame] | 332 | // Since we didn't use MAP_FIXED the kernel may have mapped it somewhere not in the low |
| 333 | // 4GB. If this is the case, unmap and retry. |
| 334 | if (reinterpret_cast<uintptr_t>(actual) + page_aligned_byte_count < 4 * GB) { |
| 335 | break; |
| 336 | } else { |
| 337 | munmap(actual, page_aligned_byte_count); |
| 338 | actual = MAP_FAILED; |
| 339 | } |
Stuart Monteith | 8dba5aa | 2014-03-12 12:44:01 +0000 | [diff] [blame] | 340 | } |
| 341 | } else { |
| 342 | // Skip over last page. |
| 343 | ptr = tail_ptr; |
| 344 | } |
| 345 | } |
| 346 | |
| 347 | if (actual == MAP_FAILED) { |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 348 | LOG(ERROR) << "Could not find contiguous low-memory space."; |
| 349 | saved_errno = ENOMEM; |
Stuart Monteith | 8dba5aa | 2014-03-12 12:44:01 +0000 | [diff] [blame] | 350 | } |
| 351 | } else { |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 352 | actual = mmap(expected_ptr, page_aligned_byte_count, prot, flags, fd.get(), 0); |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 353 | saved_errno = errno; |
Stuart Monteith | 8dba5aa | 2014-03-12 12:44:01 +0000 | [diff] [blame] | 354 | } |
| 355 | |
| 356 | #else |
Ian Rogers | c3ccc10 | 2014-06-25 11:52:14 -0700 | [diff] [blame] | 357 | #if defined(__LP64__) |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 358 | if (low_4gb && expected_ptr == nullptr) { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 359 | flags |= MAP_32BIT; |
| 360 | } |
| 361 | #endif |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 362 | |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 363 | void* actual = mmap(expected_ptr, page_aligned_byte_count, prot, flags, fd.get(), 0); |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 364 | saved_errno = errno; |
Stuart Monteith | 8dba5aa | 2014-03-12 12:44:01 +0000 | [diff] [blame] | 365 | #endif |
| 366 | |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 367 | if (actual == MAP_FAILED) { |
jeffhao | 8161c03 | 2012-10-31 15:50:00 -0700 | [diff] [blame] | 368 | std::string maps; |
| 369 | ReadFileToString("/proc/self/maps", &maps); |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 370 | |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 371 | *error_msg = StringPrintf("Failed anonymous mmap(%p, %zd, 0x%x, 0x%x, %d, 0): %s\n%s", |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 372 | expected_ptr, page_aligned_byte_count, prot, flags, fd.get(), |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 373 | strerror(saved_errno), maps.c_str()); |
Ian Rogers | 8d31bbd | 2013-10-13 10:44:14 -0700 | [diff] [blame] | 374 | return nullptr; |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 375 | } |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 376 | std::ostringstream check_map_request_error_msg; |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 377 | if (!CheckMapRequest(expected_ptr, actual, page_aligned_byte_count, error_msg)) { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 378 | return nullptr; |
| 379 | } |
| 380 | return new MemMap(name, reinterpret_cast<byte*>(actual), byte_count, actual, |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 381 | page_aligned_byte_count, prot, false); |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 382 | } |
| 383 | |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 384 | MemMap* MemMap::MapFileAtAddress(byte* expected_ptr, size_t byte_count, int prot, int flags, int fd, |
Ian Rogers | 8d31bbd | 2013-10-13 10:44:14 -0700 | [diff] [blame] | 385 | off_t start, bool reuse, const char* filename, |
| 386 | std::string* error_msg) { |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 387 | CHECK_NE(0, prot); |
| 388 | CHECK_NE(0, flags & (MAP_SHARED | MAP_PRIVATE)); |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 389 | uintptr_t expected = reinterpret_cast<uintptr_t>(expected_ptr); |
| 390 | uintptr_t limit = expected + byte_count; |
Narayan Kamath | b89c3da | 2014-08-21 17:38:09 +0100 | [diff] [blame] | 391 | |
| 392 | // Note that we do not allow MAP_FIXED unless reuse == true, i.e we |
| 393 | // expect his mapping to be contained within an existing map. |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 394 | if (reuse) { |
| 395 | // reuse means it is okay that it overlaps an existing page mapping. |
| 396 | // Only use this if you actually made the page reservation yourself. |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 397 | CHECK(expected_ptr != nullptr); |
Narayan Kamath | b89c3da | 2014-08-21 17:38:09 +0100 | [diff] [blame] | 398 | |
| 399 | DCHECK(ContainedWithinExistingMap(expected, limit, error_msg)); |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 400 | flags |= MAP_FIXED; |
| 401 | } else { |
| 402 | CHECK_EQ(0, flags & MAP_FIXED); |
Narayan Kamath | b89c3da | 2014-08-21 17:38:09 +0100 | [diff] [blame] | 403 | // Don't bother checking for an overlapping region here. We'll |
| 404 | // check this if required after the fact inside CheckMapRequest. |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 405 | } |
| 406 | |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 407 | if (byte_count == 0) { |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 408 | return new MemMap(filename, nullptr, 0, nullptr, 0, prot, false); |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 409 | } |
Ian Rogers | f8adc60 | 2013-04-18 17:06:19 -0700 | [diff] [blame] | 410 | // Adjust 'offset' to be page-aligned as required by mmap. |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 411 | int page_offset = start % kPageSize; |
| 412 | off_t page_aligned_offset = start - page_offset; |
Ian Rogers | f8adc60 | 2013-04-18 17:06:19 -0700 | [diff] [blame] | 413 | // Adjust 'byte_count' to be page-aligned as we will map this anyway. |
Elliott Hughes | ecd3a6f | 2012-06-06 18:16:37 -0700 | [diff] [blame] | 414 | size_t page_aligned_byte_count = RoundUp(byte_count + page_offset, kPageSize); |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 415 | // The 'expected_ptr' is modified (if specified, ie non-null) to be page aligned to the file but |
| 416 | // not necessarily to virtual memory. mmap will page align 'expected' for us. |
| 417 | byte* page_aligned_expected = (expected_ptr == nullptr) ? nullptr : (expected_ptr - page_offset); |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 418 | |
| 419 | byte* actual = reinterpret_cast<byte*>(mmap(page_aligned_expected, |
Elliott Hughes | ecd3a6f | 2012-06-06 18:16:37 -0700 | [diff] [blame] | 420 | page_aligned_byte_count, |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 421 | prot, |
| 422 | flags, |
| 423 | fd, |
| 424 | page_aligned_offset)); |
| 425 | if (actual == MAP_FAILED) { |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 426 | auto saved_errno = errno; |
| 427 | |
jeffhao | 8161c03 | 2012-10-31 15:50:00 -0700 | [diff] [blame] | 428 | std::string maps; |
| 429 | ReadFileToString("/proc/self/maps", &maps); |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 430 | |
Mathieu Chartier | c7cb190 | 2014-03-05 14:41:03 -0800 | [diff] [blame] | 431 | *error_msg = StringPrintf("mmap(%p, %zd, 0x%x, 0x%x, %d, %" PRId64 |
| 432 | ") of file '%s' failed: %s\n%s", |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 433 | page_aligned_expected, page_aligned_byte_count, prot, flags, fd, |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 434 | static_cast<int64_t>(page_aligned_offset), filename, |
| 435 | strerror(saved_errno), maps.c_str()); |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 436 | return nullptr; |
| 437 | } |
| 438 | std::ostringstream check_map_request_error_msg; |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 439 | if (!CheckMapRequest(expected_ptr, actual, page_aligned_byte_count, error_msg)) { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 440 | return nullptr; |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 441 | } |
Brian Carlstrom | 0d6adac | 2014-02-05 17:39:16 -0800 | [diff] [blame] | 442 | return new MemMap(filename, actual + page_offset, byte_count, actual, page_aligned_byte_count, |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 443 | prot, reuse); |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 444 | } |
| 445 | |
| 446 | MemMap::~MemMap() { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 447 | if (base_begin_ == nullptr && base_size_ == 0) { |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 448 | return; |
| 449 | } |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 450 | if (!reuse_) { |
| 451 | int result = munmap(base_begin_, base_size_); |
| 452 | if (result == -1) { |
| 453 | PLOG(FATAL) << "munmap failed"; |
| 454 | } |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 455 | } |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 456 | |
| 457 | // Remove it from maps_. |
| 458 | MutexLock mu(Thread::Current(), *Locks::mem_maps_lock_); |
| 459 | bool found = false; |
| 460 | for (auto it = maps_.lower_bound(base_begin_), end = maps_.end(); |
| 461 | it != end && it->first == base_begin_; ++it) { |
| 462 | if (it->second == this) { |
| 463 | found = true; |
| 464 | maps_.erase(it); |
| 465 | break; |
| 466 | } |
| 467 | } |
| 468 | CHECK(found) << "MemMap not found"; |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 469 | } |
| 470 | |
Mathieu Chartier | 1c23e1e | 2012-10-12 14:14:11 -0700 | [diff] [blame] | 471 | MemMap::MemMap(const std::string& name, byte* begin, size_t size, void* base_begin, |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 472 | size_t base_size, int prot, bool reuse) |
Mathieu Chartier | 1c23e1e | 2012-10-12 14:14:11 -0700 | [diff] [blame] | 473 | : name_(name), begin_(begin), size_(size), base_begin_(base_begin), base_size_(base_size), |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 474 | prot_(prot), reuse_(reuse) { |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 475 | if (size_ == 0) { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 476 | CHECK(begin_ == nullptr); |
| 477 | CHECK(base_begin_ == nullptr); |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 478 | CHECK_EQ(base_size_, 0U); |
| 479 | } else { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 480 | CHECK(begin_ != nullptr); |
| 481 | CHECK(base_begin_ != nullptr); |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 482 | CHECK_NE(base_size_, 0U); |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 483 | |
| 484 | // Add it to maps_. |
| 485 | MutexLock mu(Thread::Current(), *Locks::mem_maps_lock_); |
| 486 | maps_.insert(std::pair<void*, MemMap*>(base_begin_, this)); |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 487 | } |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 488 | }; |
| 489 | |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 490 | MemMap* MemMap::RemapAtEnd(byte* new_end, const char* tail_name, int tail_prot, |
| 491 | std::string* error_msg) { |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 492 | DCHECK_GE(new_end, Begin()); |
| 493 | DCHECK_LE(new_end, End()); |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 494 | DCHECK_LE(begin_ + size_, reinterpret_cast<byte*>(base_begin_) + base_size_); |
| 495 | DCHECK(IsAligned<kPageSize>(begin_)); |
| 496 | DCHECK(IsAligned<kPageSize>(base_begin_)); |
| 497 | DCHECK(IsAligned<kPageSize>(reinterpret_cast<byte*>(base_begin_) + base_size_)); |
| 498 | DCHECK(IsAligned<kPageSize>(new_end)); |
| 499 | byte* old_end = begin_ + size_; |
| 500 | byte* old_base_end = reinterpret_cast<byte*>(base_begin_) + base_size_; |
| 501 | byte* new_base_end = new_end; |
| 502 | DCHECK_LE(new_base_end, old_base_end); |
| 503 | if (new_base_end == old_base_end) { |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 504 | return new MemMap(tail_name, nullptr, 0, nullptr, 0, tail_prot, false); |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 505 | } |
| 506 | size_ = new_end - reinterpret_cast<byte*>(begin_); |
| 507 | base_size_ = new_base_end - reinterpret_cast<byte*>(base_begin_); |
| 508 | DCHECK_LE(begin_ + size_, reinterpret_cast<byte*>(base_begin_) + base_size_); |
| 509 | size_t tail_size = old_end - new_end; |
| 510 | byte* tail_base_begin = new_base_end; |
| 511 | size_t tail_base_size = old_base_end - new_base_end; |
| 512 | DCHECK_EQ(tail_base_begin + tail_base_size, old_base_end); |
| 513 | DCHECK(IsAligned<kPageSize>(tail_base_size)); |
| 514 | |
| 515 | #ifdef USE_ASHMEM |
| 516 | // android_os_Debug.cpp read_mapinfo assumes all ashmem regions associated with the VM are |
| 517 | // prefixed "dalvik-". |
| 518 | std::string debug_friendly_name("dalvik-"); |
| 519 | debug_friendly_name += tail_name; |
| 520 | ScopedFd fd(ashmem_create_region(debug_friendly_name.c_str(), tail_base_size)); |
Stuart Monteith | 8dba5aa | 2014-03-12 12:44:01 +0000 | [diff] [blame] | 521 | int flags = MAP_PRIVATE | MAP_FIXED; |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 522 | if (fd.get() == -1) { |
| 523 | *error_msg = StringPrintf("ashmem_create_region failed for '%s': %s", |
| 524 | tail_name, strerror(errno)); |
| 525 | return nullptr; |
| 526 | } |
| 527 | #else |
| 528 | ScopedFd fd(-1); |
| 529 | int flags = MAP_PRIVATE | MAP_ANONYMOUS; |
| 530 | #endif |
| 531 | |
| 532 | // Unmap/map the tail region. |
| 533 | int result = munmap(tail_base_begin, tail_base_size); |
| 534 | if (result == -1) { |
| 535 | std::string maps; |
| 536 | ReadFileToString("/proc/self/maps", &maps); |
| 537 | *error_msg = StringPrintf("munmap(%p, %zd) failed for '%s'\n%s", |
| 538 | tail_base_begin, tail_base_size, name_.c_str(), |
| 539 | maps.c_str()); |
| 540 | return nullptr; |
| 541 | } |
| 542 | // Don't cause memory allocation between the munmap and the mmap |
| 543 | // calls. Otherwise, libc (or something else) might take this memory |
| 544 | // region. Note this isn't perfect as there's no way to prevent |
| 545 | // other threads to try to take this memory region here. |
| 546 | byte* actual = reinterpret_cast<byte*>(mmap(tail_base_begin, tail_base_size, tail_prot, |
| 547 | flags, fd.get(), 0)); |
| 548 | if (actual == MAP_FAILED) { |
| 549 | std::string maps; |
| 550 | ReadFileToString("/proc/self/maps", &maps); |
Mathieu Chartier | c7cb190 | 2014-03-05 14:41:03 -0800 | [diff] [blame] | 551 | *error_msg = StringPrintf("anonymous mmap(%p, %zd, 0x%x, 0x%x, %d, 0) failed\n%s", |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 552 | tail_base_begin, tail_base_size, tail_prot, flags, fd.get(), |
| 553 | maps.c_str()); |
| 554 | return nullptr; |
| 555 | } |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 556 | return new MemMap(tail_name, actual, tail_size, actual, tail_base_size, tail_prot, false); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 557 | } |
Logan Chien | d88fa26 | 2012-06-06 15:23:32 +0800 | [diff] [blame] | 558 | |
Ian Rogers | c5f1773 | 2014-06-05 20:48:42 -0700 | [diff] [blame] | 559 | void MemMap::MadviseDontNeedAndZero() { |
| 560 | if (base_begin_ != nullptr || base_size_ != 0) { |
| 561 | if (!kMadviseZeroes) { |
| 562 | memset(base_begin_, 0, base_size_); |
| 563 | } |
| 564 | int result = madvise(base_begin_, base_size_, MADV_DONTNEED); |
| 565 | if (result == -1) { |
| 566 | PLOG(WARNING) << "madvise failed"; |
| 567 | } |
| 568 | } |
| 569 | } |
| 570 | |
Logan Chien | d88fa26 | 2012-06-06 15:23:32 +0800 | [diff] [blame] | 571 | bool MemMap::Protect(int prot) { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 572 | if (base_begin_ == nullptr && base_size_ == 0) { |
Ian Rogers | 1c849e5 | 2012-06-28 14:00:33 -0700 | [diff] [blame] | 573 | prot_ = prot; |
Logan Chien | d88fa26 | 2012-06-06 15:23:32 +0800 | [diff] [blame] | 574 | return true; |
| 575 | } |
| 576 | |
| 577 | if (mprotect(base_begin_, base_size_, prot) == 0) { |
Ian Rogers | 1c849e5 | 2012-06-28 14:00:33 -0700 | [diff] [blame] | 578 | prot_ = prot; |
Logan Chien | d88fa26 | 2012-06-06 15:23:32 +0800 | [diff] [blame] | 579 | return true; |
| 580 | } |
| 581 | |
Shih-wei Liao | a060ed9 | 2012-06-07 09:25:28 -0700 | [diff] [blame] | 582 | PLOG(ERROR) << "mprotect(" << reinterpret_cast<void*>(base_begin_) << ", " << base_size_ << ", " |
| 583 | << prot << ") failed"; |
Logan Chien | d88fa26 | 2012-06-06 15:23:32 +0800 | [diff] [blame] | 584 | return false; |
| 585 | } |
| 586 | |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 587 | bool MemMap::CheckNoGaps(MemMap* begin_map, MemMap* end_map) { |
| 588 | MutexLock mu(Thread::Current(), *Locks::mem_maps_lock_); |
| 589 | CHECK(begin_map != nullptr); |
| 590 | CHECK(end_map != nullptr); |
| 591 | CHECK(HasMemMap(begin_map)); |
| 592 | CHECK(HasMemMap(end_map)); |
| 593 | CHECK_LE(begin_map->BaseBegin(), end_map->BaseBegin()); |
| 594 | MemMap* map = begin_map; |
| 595 | while (map->BaseBegin() != end_map->BaseBegin()) { |
| 596 | MemMap* next_map = GetLargestMemMapAt(map->BaseEnd()); |
| 597 | if (next_map == nullptr) { |
| 598 | // Found a gap. |
| 599 | return false; |
| 600 | } |
| 601 | map = next_map; |
| 602 | } |
| 603 | return true; |
| 604 | } |
| 605 | |
| 606 | void MemMap::DumpMaps(std::ostream& os) { |
| 607 | DumpMaps(os, maps_); |
| 608 | } |
| 609 | |
| 610 | void MemMap::DumpMaps(std::ostream& os, const std::multimap<void*, MemMap*>& mem_maps) { |
| 611 | MutexLock mu(Thread::Current(), *Locks::mem_maps_lock_); |
| 612 | DumpMapsLocked(os, mem_maps); |
| 613 | } |
| 614 | |
| 615 | void MemMap::DumpMapsLocked(std::ostream& os, const std::multimap<void*, MemMap*>& mem_maps) { |
| 616 | os << mem_maps; |
| 617 | } |
| 618 | |
| 619 | bool MemMap::HasMemMap(MemMap* map) { |
| 620 | void* base_begin = map->BaseBegin(); |
| 621 | for (auto it = maps_.lower_bound(base_begin), end = maps_.end(); |
| 622 | it != end && it->first == base_begin; ++it) { |
| 623 | if (it->second == map) { |
| 624 | return true; |
| 625 | } |
| 626 | } |
| 627 | return false; |
| 628 | } |
| 629 | |
| 630 | MemMap* MemMap::GetLargestMemMapAt(void* address) { |
| 631 | size_t largest_size = 0; |
| 632 | MemMap* largest_map = nullptr; |
| 633 | for (auto it = maps_.lower_bound(address), end = maps_.end(); |
| 634 | it != end && it->first == address; ++it) { |
| 635 | MemMap* map = it->second; |
| 636 | CHECK(map != nullptr); |
| 637 | if (largest_size < map->BaseSize()) { |
| 638 | largest_size = map->BaseSize(); |
| 639 | largest_map = map; |
| 640 | } |
| 641 | } |
| 642 | return largest_map; |
| 643 | } |
| 644 | |
Brian Carlstrom | 0d6adac | 2014-02-05 17:39:16 -0800 | [diff] [blame] | 645 | std::ostream& operator<<(std::ostream& os, const MemMap& mem_map) { |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 646 | os << StringPrintf("[MemMap: %p-%p prot=0x%x %s]", |
| 647 | mem_map.BaseBegin(), mem_map.BaseEnd(), mem_map.GetProtect(), |
| 648 | mem_map.GetName().c_str()); |
Brian Carlstrom | 0d6adac | 2014-02-05 17:39:16 -0800 | [diff] [blame] | 649 | return os; |
| 650 | } |
| 651 | |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 652 | } // namespace art |