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" |
| 18 | |
Evgenii Stepanov | 1e13374 | 2015-05-20 12:30:59 -0700 | [diff] [blame] | 19 | #include "base/memory_tool.h" |
Christopher Ferris | 943af7d | 2014-01-16 12:41:46 -0800 | [diff] [blame] | 20 | #include <backtrace/BacktraceMap.h> |
Ian Rogers | c7dd295 | 2014-10-21 23:31:19 -0700 | [diff] [blame] | 21 | #include <inttypes.h> |
Josh Gao | 0389cd5 | 2015-09-16 16:27:00 -0700 | [diff] [blame] | 22 | #include <stdlib.h> |
Ian Rogers | c7dd295 | 2014-10-21 23:31:19 -0700 | [diff] [blame] | 23 | |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 24 | #include <memory> |
Ian Rogers | c7dd295 | 2014-10-21 23:31:19 -0700 | [diff] [blame] | 25 | #include <sstream> |
Elliott Hughes | ecd3a6f | 2012-06-06 18:16:37 -0700 | [diff] [blame] | 26 | |
Andreas Gampe | 46ee31b | 2016-12-14 10:11:49 -0800 | [diff] [blame] | 27 | #include "android-base/stringprintf.h" |
| 28 | |
Andreas Gampe | 43e10b0 | 2016-07-15 17:17:34 -0700 | [diff] [blame] | 29 | #include "base/unix_file/fd_file.h" |
| 30 | #include "os.h" |
Ian Rogers | c7dd295 | 2014-10-21 23:31:19 -0700 | [diff] [blame] | 31 | #include "thread-inl.h" |
Elliott Hughes | e222ee0 | 2012-12-13 14:41:43 -0800 | [diff] [blame] | 32 | #include "utils.h" |
| 33 | |
Elliott Hughes | 6c9c06d | 2011-11-07 16:43:47 -0800 | [diff] [blame] | 34 | #include <cutils/ashmem.h> |
Nicolas Geoffray | a25dce9 | 2016-01-12 16:41:10 +0000 | [diff] [blame] | 35 | |
Ian Rogers | 997f0f9 | 2014-06-21 22:58:05 -0700 | [diff] [blame] | 36 | #ifndef ANDROID_OS |
| 37 | #include <sys/resource.h> |
| 38 | #endif |
Elliott Hughes | 6c9c06d | 2011-11-07 16:43:47 -0800 | [diff] [blame] | 39 | |
Ian Rogers | d6b6865 | 2014-06-23 14:07:03 -0700 | [diff] [blame] | 40 | #ifndef MAP_ANONYMOUS |
| 41 | #define MAP_ANONYMOUS MAP_ANON |
| 42 | #endif |
| 43 | |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 44 | namespace art { |
| 45 | |
Andreas Gampe | 46ee31b | 2016-12-14 10:11:49 -0800 | [diff] [blame] | 46 | using android::base::StringPrintf; |
| 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 | |
Mathieu Chartier | bad0267 | 2014-08-25 13:08:22 -0700 | [diff] [blame] | 62 | std::ostream& operator<<(std::ostream& os, const MemMap::Maps& mem_maps) { |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 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 | |
David Sehr | 1b14fb8 | 2017-02-01 10:42:11 -0800 | [diff] [blame] | 73 | std::mutex* MemMap::mem_maps_lock_ = nullptr; |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 74 | MemMap::Maps* MemMap::maps_ = nullptr; |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 75 | |
Ian Rogers | c3ccc10 | 2014-06-25 11:52:14 -0700 | [diff] [blame] | 76 | #if USE_ART_LOW_4G_ALLOCATOR |
Andreas Gampe | d8f26db | 2014-05-19 17:01:13 -0700 | [diff] [blame] | 77 | // Handling mem_map in 32b address range for 64b architectures that do not support MAP_32BIT. |
| 78 | |
| 79 | // 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] | 80 | static constexpr uintptr_t LOW_MEM_START = 64 * KB; |
Andreas Gampe | 7104cbf | 2014-03-21 11:44:43 -0700 | [diff] [blame] | 81 | |
Andreas Gampe | d8f26db | 2014-05-19 17:01:13 -0700 | [diff] [blame] | 82 | // Generate random starting position. |
| 83 | // To not interfere with image position, take the image's address and only place it below. Current |
| 84 | // formula (sketch): |
| 85 | // |
| 86 | // ART_BASE_ADDR = 0001XXXXXXXXXXXXXXX |
| 87 | // ---------------------------------------- |
| 88 | // = 0000111111111111111 |
| 89 | // & ~(kPageSize - 1) =~0000000000000001111 |
| 90 | // ---------------------------------------- |
| 91 | // mask = 0000111111111110000 |
| 92 | // & random data = YYYYYYYYYYYYYYYYYYY |
| 93 | // ----------------------------------- |
| 94 | // tmp = 0000YYYYYYYYYYY0000 |
| 95 | // + LOW_MEM_START = 0000000000001000000 |
| 96 | // -------------------------------------- |
| 97 | // start |
| 98 | // |
Josh Gao | 0389cd5 | 2015-09-16 16:27:00 -0700 | [diff] [blame] | 99 | // arc4random as an entropy source is exposed in Bionic, but not in glibc. When we |
Andreas Gampe | d8f26db | 2014-05-19 17:01:13 -0700 | [diff] [blame] | 100 | // do not have Bionic, simply start with LOW_MEM_START. |
| 101 | |
| 102 | // Function is standalone so it can be tested somewhat in mem_map_test.cc. |
| 103 | #ifdef __BIONIC__ |
| 104 | uintptr_t CreateStartPos(uint64_t input) { |
| 105 | CHECK_NE(0, ART_BASE_ADDRESS); |
| 106 | |
| 107 | // Start with all bits below highest bit in ART_BASE_ADDRESS. |
| 108 | constexpr size_t leading_zeros = CLZ(static_cast<uint32_t>(ART_BASE_ADDRESS)); |
| 109 | constexpr uintptr_t mask_ones = (1 << (31 - leading_zeros)) - 1; |
| 110 | |
| 111 | // Lowest (usually 12) bits are not used, as aligned by page size. |
| 112 | constexpr uintptr_t mask = mask_ones & ~(kPageSize - 1); |
| 113 | |
| 114 | // Mask input data. |
| 115 | return (input & mask) + LOW_MEM_START; |
| 116 | } |
| 117 | #endif |
| 118 | |
| 119 | static uintptr_t GenerateNextMemPos() { |
| 120 | #ifdef __BIONIC__ |
Josh Gao | 0389cd5 | 2015-09-16 16:27:00 -0700 | [diff] [blame] | 121 | uint64_t random_data; |
| 122 | arc4random_buf(&random_data, sizeof(random_data)); |
| 123 | return CreateStartPos(random_data); |
Andreas Gampe | d8f26db | 2014-05-19 17:01:13 -0700 | [diff] [blame] | 124 | #else |
Josh Gao | 0389cd5 | 2015-09-16 16:27:00 -0700 | [diff] [blame] | 125 | // No arc4random on host, see above. |
Andreas Gampe | d8f26db | 2014-05-19 17:01:13 -0700 | [diff] [blame] | 126 | return LOW_MEM_START; |
| 127 | #endif |
| 128 | } |
| 129 | |
| 130 | // Initialize linear scan to random position. |
| 131 | uintptr_t MemMap::next_mem_pos_ = GenerateNextMemPos(); |
Stuart Monteith | 8dba5aa | 2014-03-12 12:44:01 +0000 | [diff] [blame] | 132 | #endif |
| 133 | |
Mathieu Chartier | 24a0fc8 | 2015-10-13 16:38:52 -0700 | [diff] [blame] | 134 | // Return true if the address range is contained in a single memory map by either reading |
| 135 | // the maps_ variable or the /proc/self/map entry. |
Mathieu Chartier | e58991b | 2015-10-13 07:59:34 -0700 | [diff] [blame] | 136 | bool MemMap::ContainedWithinExistingMap(uint8_t* ptr, size_t size, std::string* error_msg) { |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 137 | uintptr_t begin = reinterpret_cast<uintptr_t>(ptr); |
| 138 | uintptr_t end = begin + size; |
Mathieu Chartier | e58991b | 2015-10-13 07:59:34 -0700 | [diff] [blame] | 139 | |
Mathieu Chartier | 24a0fc8 | 2015-10-13 16:38:52 -0700 | [diff] [blame] | 140 | // There is a suspicion that BacktraceMap::Create is occasionally missing maps. TODO: Investigate |
| 141 | // further. |
Mathieu Chartier | e58991b | 2015-10-13 07:59:34 -0700 | [diff] [blame] | 142 | { |
David Sehr | 1b14fb8 | 2017-02-01 10:42:11 -0800 | [diff] [blame] | 143 | std::lock_guard<std::mutex> mu(*mem_maps_lock_); |
Mathieu Chartier | 24a0fc8 | 2015-10-13 16:38:52 -0700 | [diff] [blame] | 144 | for (auto& pair : *maps_) { |
Mathieu Chartier | e58991b | 2015-10-13 07:59:34 -0700 | [diff] [blame] | 145 | MemMap* const map = pair.second; |
| 146 | if (begin >= reinterpret_cast<uintptr_t>(map->Begin()) && |
| 147 | end <= reinterpret_cast<uintptr_t>(map->End())) { |
| 148 | return true; |
| 149 | } |
| 150 | } |
| 151 | } |
| 152 | |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 153 | std::unique_ptr<BacktraceMap> map(BacktraceMap::Create(getpid(), true)); |
Mathieu Chartier | ebe2dfc | 2015-11-24 13:47:52 -0800 | [diff] [blame] | 154 | if (map == nullptr) { |
| 155 | if (error_msg != nullptr) { |
| 156 | *error_msg = StringPrintf("Failed to build process map"); |
| 157 | } |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 158 | return false; |
| 159 | } |
Christopher Ferris | 56f8b56 | 2016-06-16 23:19:36 -0700 | [diff] [blame] | 160 | |
| 161 | ScopedBacktraceMapIteratorLock lock(map.get()); |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 162 | for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { |
| 163 | if ((begin >= it->start && begin < it->end) // start of new within old |
| 164 | && (end > it->start && end <= it->end)) { // end of new within old |
| 165 | return true; |
| 166 | } |
| 167 | } |
Mathieu Chartier | ebe2dfc | 2015-11-24 13:47:52 -0800 | [diff] [blame] | 168 | if (error_msg != nullptr) { |
| 169 | PrintFileToLog("/proc/self/maps", LogSeverity::ERROR); |
| 170 | *error_msg = StringPrintf("Requested region 0x%08" PRIxPTR "-0x%08" PRIxPTR " does not overlap " |
| 171 | "any existing map. See process maps in the log.", begin, end); |
| 172 | } |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 173 | return false; |
| 174 | } |
| 175 | |
| 176 | // Return true if the address range does not conflict with any /proc/self/maps entry. |
| 177 | static bool CheckNonOverlapping(uintptr_t begin, |
| 178 | uintptr_t end, |
| 179 | std::string* error_msg) { |
| 180 | std::unique_ptr<BacktraceMap> map(BacktraceMap::Create(getpid(), true)); |
Christopher Ferris | 836572a | 2014-08-05 15:43:13 -0700 | [diff] [blame] | 181 | if (map.get() == nullptr) { |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 182 | *error_msg = StringPrintf("Failed to build process map"); |
| 183 | return false; |
| 184 | } |
Christopher Ferris | 56f8b56 | 2016-06-16 23:19:36 -0700 | [diff] [blame] | 185 | ScopedBacktraceMapIteratorLock(map.get()); |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 186 | for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { |
| 187 | if ((begin >= it->start && begin < it->end) // start of new within old |
| 188 | || (end > it->start && end < it->end) // end of new within old |
| 189 | || (begin <= it->start && end > it->end)) { // start/end of new includes all of old |
| 190 | std::ostringstream map_info; |
| 191 | map_info << std::make_pair(it, map->end()); |
| 192 | *error_msg = StringPrintf("Requested region 0x%08" PRIxPTR "-0x%08" PRIxPTR " overlaps with " |
| 193 | "existing map 0x%08" PRIxPTR "-0x%08" PRIxPTR " (%s)\n%s", |
| 194 | begin, end, |
| 195 | static_cast<uintptr_t>(it->start), static_cast<uintptr_t>(it->end), |
| 196 | it->name.c_str(), |
| 197 | map_info.str().c_str()); |
| 198 | return false; |
| 199 | } |
| 200 | } |
| 201 | return true; |
| 202 | } |
| 203 | |
| 204 | // CheckMapRequest to validate a non-MAP_FAILED mmap result based on |
| 205 | // the expected value, calling munmap if validation fails, giving the |
| 206 | // reason in error_msg. |
| 207 | // |
Mathieu Chartier | 2cebb24 | 2015-04-21 16:50:40 -0700 | [diff] [blame] | 208 | // If the expected_ptr is null, nothing is checked beyond the fact |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 209 | // that the actual_ptr is not MAP_FAILED. However, if expected_ptr is |
| 210 | // non-null, we check that pointer is the actual_ptr == expected_ptr, |
| 211 | // and if not, report in error_msg what the conflict mapping was if |
| 212 | // found, or a generic error in other cases. |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 213 | static bool CheckMapRequest(uint8_t* expected_ptr, void* actual_ptr, size_t byte_count, |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 214 | std::string* error_msg) { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 215 | // Handled first by caller for more specific error messages. |
| 216 | CHECK(actual_ptr != MAP_FAILED); |
| 217 | |
| 218 | if (expected_ptr == nullptr) { |
| 219 | return true; |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 220 | } |
Elliott Hughes | ecd3a6f | 2012-06-06 18:16:37 -0700 | [diff] [blame] | 221 | |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 222 | uintptr_t actual = reinterpret_cast<uintptr_t>(actual_ptr); |
| 223 | uintptr_t expected = reinterpret_cast<uintptr_t>(expected_ptr); |
| 224 | uintptr_t limit = expected + byte_count; |
| 225 | |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 226 | if (expected_ptr == actual_ptr) { |
| 227 | return true; |
| 228 | } |
| 229 | |
| 230 | // We asked for an address but didn't get what we wanted, all paths below here should fail. |
| 231 | int result = munmap(actual_ptr, byte_count); |
| 232 | if (result == -1) { |
| 233 | PLOG(WARNING) << StringPrintf("munmap(%p, %zd) failed", actual_ptr, byte_count); |
| 234 | } |
| 235 | |
Mathieu Chartier | ebe2dfc | 2015-11-24 13:47:52 -0800 | [diff] [blame] | 236 | if (error_msg != nullptr) { |
Mathieu Chartier | 83723ae | 2016-02-24 10:09:23 -0800 | [diff] [blame] | 237 | // We call this here so that we can try and generate a full error |
| 238 | // message with the overlapping mapping. There's no guarantee that |
| 239 | // that there will be an overlap though, since |
| 240 | // - The kernel is not *required* to honor expected_ptr unless MAP_FIXED is |
| 241 | // true, even if there is no overlap |
| 242 | // - There might have been an overlap at the point of mmap, but the |
| 243 | // overlapping region has since been unmapped. |
| 244 | std::string error_detail; |
| 245 | CheckNonOverlapping(expected, limit, &error_detail); |
Mathieu Chartier | ebe2dfc | 2015-11-24 13:47:52 -0800 | [diff] [blame] | 246 | std::ostringstream os; |
| 247 | os << StringPrintf("Failed to mmap at expected address, mapped at " |
| 248 | "0x%08" PRIxPTR " instead of 0x%08" PRIxPTR, |
| 249 | actual, expected); |
| 250 | if (!error_detail.empty()) { |
| 251 | os << " : " << error_detail; |
| 252 | } |
| 253 | *error_msg = os.str(); |
Christopher Ferris | 943af7d | 2014-01-16 12:41:46 -0800 | [diff] [blame] | 254 | } |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 255 | return false; |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 256 | } |
| 257 | |
Mathieu Chartier | 38c8221 | 2015-06-04 16:22:41 -0700 | [diff] [blame] | 258 | #if USE_ART_LOW_4G_ALLOCATOR |
Mathieu Chartier | 42bddce | 2015-11-09 15:16:56 -0800 | [diff] [blame] | 259 | static inline void* TryMemMapLow4GB(void* ptr, |
| 260 | size_t page_aligned_byte_count, |
| 261 | int prot, |
| 262 | int flags, |
| 263 | int fd, |
| 264 | off_t offset) { |
| 265 | void* actual = mmap(ptr, page_aligned_byte_count, prot, flags, fd, offset); |
Mathieu Chartier | 38c8221 | 2015-06-04 16:22:41 -0700 | [diff] [blame] | 266 | if (actual != MAP_FAILED) { |
| 267 | // Since we didn't use MAP_FIXED the kernel may have mapped it somewhere not in the low |
| 268 | // 4GB. If this is the case, unmap and retry. |
| 269 | if (reinterpret_cast<uintptr_t>(actual) + page_aligned_byte_count >= 4 * GB) { |
| 270 | munmap(actual, page_aligned_byte_count); |
| 271 | actual = MAP_FAILED; |
| 272 | } |
| 273 | } |
| 274 | return actual; |
| 275 | } |
| 276 | #endif |
| 277 | |
Mathieu Chartier | 42bddce | 2015-11-09 15:16:56 -0800 | [diff] [blame] | 278 | MemMap* MemMap::MapAnonymous(const char* name, |
| 279 | uint8_t* expected_ptr, |
| 280 | size_t byte_count, |
| 281 | int prot, |
| 282 | bool low_4gb, |
| 283 | bool reuse, |
Nicolas Geoffray | a25dce9 | 2016-01-12 16:41:10 +0000 | [diff] [blame] | 284 | std::string* error_msg, |
| 285 | bool use_ashmem) { |
Ian Rogers | 6a3c1fc | 2014-10-31 00:33:20 -0700 | [diff] [blame] | 286 | #ifndef __LP64__ |
| 287 | UNUSED(low_4gb); |
| 288 | #endif |
Nicolas Geoffray | 58a73d2 | 2016-11-29 21:49:43 +0000 | [diff] [blame] | 289 | use_ashmem = use_ashmem && !kIsTargetLinux; |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 290 | if (byte_count == 0) { |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 291 | return new MemMap(name, nullptr, 0, nullptr, 0, prot, false); |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 292 | } |
Elliott Hughes | ecd3a6f | 2012-06-06 18:16:37 -0700 | [diff] [blame] | 293 | size_t page_aligned_byte_count = RoundUp(byte_count, kPageSize); |
Elliott Hughes | 6c9c06d | 2011-11-07 16:43:47 -0800 | [diff] [blame] | 294 | |
Elliott Hughes | 6c9c06d | 2011-11-07 16:43:47 -0800 | [diff] [blame] | 295 | int flags = MAP_PRIVATE | MAP_ANONYMOUS; |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 296 | if (reuse) { |
| 297 | // reuse means it is okay that it overlaps an existing page mapping. |
| 298 | // Only use this if you actually made the page reservation yourself. |
| 299 | CHECK(expected_ptr != nullptr); |
| 300 | |
Vladimir Marko | b550582 | 2015-05-08 11:10:16 +0100 | [diff] [blame] | 301 | DCHECK(ContainedWithinExistingMap(expected_ptr, byte_count, error_msg)) << *error_msg; |
Vladimir Marko | 5c42c29 | 2015-02-25 12:02:49 +0000 | [diff] [blame] | 302 | flags |= MAP_FIXED; |
| 303 | } |
| 304 | |
Andreas Gampe | 43e10b0 | 2016-07-15 17:17:34 -0700 | [diff] [blame] | 305 | File fd; |
Ian Rogers | 997f0f9 | 2014-06-21 22:58:05 -0700 | [diff] [blame] | 306 | |
Nicolas Geoffray | a25dce9 | 2016-01-12 16:41:10 +0000 | [diff] [blame] | 307 | if (use_ashmem) { |
| 308 | if (!kIsTargetBuild) { |
Bilyan Borisov | 3071f80 | 2016-03-31 17:15:53 +0100 | [diff] [blame] | 309 | // When not on Android (either host or assuming a linux target) ashmem is faked using |
| 310 | // files in /tmp. Ensure that such files won't fail due to ulimit restrictions. If they |
| 311 | // will then use a regular mmap. |
Nicolas Geoffray | a25dce9 | 2016-01-12 16:41:10 +0000 | [diff] [blame] | 312 | struct rlimit rlimit_fsize; |
| 313 | CHECK_EQ(getrlimit(RLIMIT_FSIZE, &rlimit_fsize), 0); |
| 314 | use_ashmem = (rlimit_fsize.rlim_cur == RLIM_INFINITY) || |
| 315 | (page_aligned_byte_count < rlimit_fsize.rlim_cur); |
| 316 | } |
| 317 | } |
| 318 | |
Ian Rogers | 997f0f9 | 2014-06-21 22:58:05 -0700 | [diff] [blame] | 319 | if (use_ashmem) { |
| 320 | // android_os_Debug.cpp read_mapinfo assumes all ashmem regions associated with the VM are |
| 321 | // prefixed "dalvik-". |
| 322 | std::string debug_friendly_name("dalvik-"); |
| 323 | debug_friendly_name += name; |
Andreas Gampe | 43e10b0 | 2016-07-15 17:17:34 -0700 | [diff] [blame] | 324 | fd.Reset(ashmem_create_region(debug_friendly_name.c_str(), page_aligned_byte_count), |
| 325 | /* check_usage */ false); |
Richard Uhler | a5c61bf | 2016-10-24 15:54:44 +0100 | [diff] [blame] | 326 | |
Andreas Gampe | 43e10b0 | 2016-07-15 17:17:34 -0700 | [diff] [blame] | 327 | if (fd.Fd() == -1) { |
Richard Uhler | a5c61bf | 2016-10-24 15:54:44 +0100 | [diff] [blame] | 328 | // We failed to create the ashmem region. Print a warning, but continue |
| 329 | // anyway by creating a true anonymous mmap with an fd of -1. It is |
| 330 | // better to use an unlabelled anonymous map than to fail to create a |
| 331 | // map at all. |
| 332 | PLOG(WARNING) << "ashmem_create_region failed for '" << name << "'"; |
| 333 | } else { |
| 334 | // We succeeded in creating the ashmem region. Use the created ashmem |
| 335 | // region as backing for the mmap. |
| 336 | flags &= ~MAP_ANONYMOUS; |
Ian Rogers | 997f0f9 | 2014-06-21 22:58:05 -0700 | [diff] [blame] | 337 | } |
Ian Rogers | 997f0f9 | 2014-06-21 22:58:05 -0700 | [diff] [blame] | 338 | } |
Stuart Monteith | 8dba5aa | 2014-03-12 12:44:01 +0000 | [diff] [blame] | 339 | |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 340 | // We need to store and potentially set an error number for pretty printing of errors |
| 341 | int saved_errno = 0; |
| 342 | |
Mathieu Chartier | 42bddce | 2015-11-09 15:16:56 -0800 | [diff] [blame] | 343 | void* actual = MapInternal(expected_ptr, |
| 344 | page_aligned_byte_count, |
| 345 | prot, |
| 346 | flags, |
Andreas Gampe | 43e10b0 | 2016-07-15 17:17:34 -0700 | [diff] [blame] | 347 | fd.Fd(), |
Mathieu Chartier | 42bddce | 2015-11-09 15:16:56 -0800 | [diff] [blame] | 348 | 0, |
| 349 | low_4gb); |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 350 | saved_errno = errno; |
Stuart Monteith | 8dba5aa | 2014-03-12 12:44:01 +0000 | [diff] [blame] | 351 | |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 352 | if (actual == MAP_FAILED) { |
Mathieu Chartier | 83723ae | 2016-02-24 10:09:23 -0800 | [diff] [blame] | 353 | if (error_msg != nullptr) { |
Andreas Gampe | 7fa5578 | 2016-06-15 17:45:01 -0700 | [diff] [blame] | 354 | if (kIsDebugBuild || VLOG_IS_ON(oat)) { |
| 355 | PrintFileToLog("/proc/self/maps", LogSeverity::WARNING); |
| 356 | } |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 357 | |
Mathieu Chartier | 83723ae | 2016-02-24 10:09:23 -0800 | [diff] [blame] | 358 | *error_msg = StringPrintf("Failed anonymous mmap(%p, %zd, 0x%x, 0x%x, %d, 0): %s. " |
| 359 | "See process maps in the log.", |
| 360 | expected_ptr, |
| 361 | page_aligned_byte_count, |
| 362 | prot, |
| 363 | flags, |
Andreas Gampe | 43e10b0 | 2016-07-15 17:17:34 -0700 | [diff] [blame] | 364 | fd.Fd(), |
Mathieu Chartier | 83723ae | 2016-02-24 10:09:23 -0800 | [diff] [blame] | 365 | strerror(saved_errno)); |
| 366 | } |
Ian Rogers | 8d31bbd | 2013-10-13 10:44:14 -0700 | [diff] [blame] | 367 | return nullptr; |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 368 | } |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 369 | if (!CheckMapRequest(expected_ptr, actual, page_aligned_byte_count, error_msg)) { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 370 | return nullptr; |
| 371 | } |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 372 | return new MemMap(name, reinterpret_cast<uint8_t*>(actual), byte_count, actual, |
Mathieu Chartier | 01d4b50 | 2015-06-12 17:32:31 -0700 | [diff] [blame] | 373 | page_aligned_byte_count, prot, reuse); |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 374 | } |
| 375 | |
David Srbecky | 1baabf0 | 2015-06-16 17:12:34 +0000 | [diff] [blame] | 376 | MemMap* MemMap::MapDummy(const char* name, uint8_t* addr, size_t byte_count) { |
| 377 | if (byte_count == 0) { |
| 378 | return new MemMap(name, nullptr, 0, nullptr, 0, 0, false); |
| 379 | } |
| 380 | const size_t page_aligned_byte_count = RoundUp(byte_count, kPageSize); |
| 381 | return new MemMap(name, addr, byte_count, addr, page_aligned_byte_count, 0, true /* reuse */); |
| 382 | } |
| 383 | |
Mathieu Chartier | 42bddce | 2015-11-09 15:16:56 -0800 | [diff] [blame] | 384 | MemMap* MemMap::MapFileAtAddress(uint8_t* expected_ptr, |
| 385 | size_t byte_count, |
| 386 | int prot, |
| 387 | int flags, |
| 388 | int fd, |
| 389 | off_t start, |
| 390 | bool low_4gb, |
| 391 | bool reuse, |
| 392 | const char* filename, |
Ian Rogers | 8d31bbd | 2013-10-13 10:44:14 -0700 | [diff] [blame] | 393 | std::string* error_msg) { |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 394 | CHECK_NE(0, prot); |
| 395 | CHECK_NE(0, flags & (MAP_SHARED | MAP_PRIVATE)); |
Narayan Kamath | b89c3da | 2014-08-21 17:38:09 +0100 | [diff] [blame] | 396 | |
| 397 | // Note that we do not allow MAP_FIXED unless reuse == true, i.e we |
| 398 | // expect his mapping to be contained within an existing map. |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 399 | if (reuse) { |
| 400 | // reuse means it is okay that it overlaps an existing page mapping. |
| 401 | // Only use this if you actually made the page reservation yourself. |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 402 | CHECK(expected_ptr != nullptr); |
Mathieu Chartier | 66b1d57 | 2017-02-10 18:41:39 -0800 | [diff] [blame] | 403 | DCHECK(error_msg != nullptr); |
Mathieu Chartier | ebe2dfc | 2015-11-24 13:47:52 -0800 | [diff] [blame] | 404 | DCHECK(ContainedWithinExistingMap(expected_ptr, byte_count, error_msg)) |
| 405 | << ((error_msg != nullptr) ? *error_msg : std::string()); |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 406 | flags |= MAP_FIXED; |
| 407 | } else { |
| 408 | CHECK_EQ(0, flags & MAP_FIXED); |
Narayan Kamath | b89c3da | 2014-08-21 17:38:09 +0100 | [diff] [blame] | 409 | // Don't bother checking for an overlapping region here. We'll |
| 410 | // check this if required after the fact inside CheckMapRequest. |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 411 | } |
| 412 | |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 413 | if (byte_count == 0) { |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 414 | return new MemMap(filename, nullptr, 0, nullptr, 0, prot, false); |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 415 | } |
Ian Rogers | f8adc60 | 2013-04-18 17:06:19 -0700 | [diff] [blame] | 416 | // Adjust 'offset' to be page-aligned as required by mmap. |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 417 | int page_offset = start % kPageSize; |
| 418 | off_t page_aligned_offset = start - page_offset; |
Ian Rogers | f8adc60 | 2013-04-18 17:06:19 -0700 | [diff] [blame] | 419 | // 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] | 420 | size_t page_aligned_byte_count = RoundUp(byte_count + page_offset, kPageSize); |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 421 | // The 'expected_ptr' is modified (if specified, ie non-null) to be page aligned to the file but |
| 422 | // not necessarily to virtual memory. mmap will page align 'expected' for us. |
Mathieu Chartier | 2cebb24 | 2015-04-21 16:50:40 -0700 | [diff] [blame] | 423 | uint8_t* page_aligned_expected = |
| 424 | (expected_ptr == nullptr) ? nullptr : (expected_ptr - page_offset); |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 425 | |
Evgenii Stepanov | 1e13374 | 2015-05-20 12:30:59 -0700 | [diff] [blame] | 426 | size_t redzone_size = 0; |
| 427 | if (RUNNING_ON_MEMORY_TOOL && kMemoryToolAddsRedzones && expected_ptr == nullptr) { |
| 428 | redzone_size = kPageSize; |
| 429 | page_aligned_byte_count += redzone_size; |
| 430 | } |
| 431 | |
Mathieu Chartier | 42bddce | 2015-11-09 15:16:56 -0800 | [diff] [blame] | 432 | uint8_t* actual = reinterpret_cast<uint8_t*>(MapInternal(page_aligned_expected, |
| 433 | page_aligned_byte_count, |
| 434 | prot, |
| 435 | flags, |
| 436 | fd, |
| 437 | page_aligned_offset, |
| 438 | low_4gb)); |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 439 | if (actual == MAP_FAILED) { |
Mathieu Chartier | ebe2dfc | 2015-11-24 13:47:52 -0800 | [diff] [blame] | 440 | if (error_msg != nullptr) { |
| 441 | auto saved_errno = errno; |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 442 | |
Andreas Gampe | 7ec0904 | 2016-04-01 17:20:49 -0700 | [diff] [blame] | 443 | if (kIsDebugBuild || VLOG_IS_ON(oat)) { |
| 444 | PrintFileToLog("/proc/self/maps", LogSeverity::WARNING); |
| 445 | } |
Brian Carlstrom | aa94cf3 | 2014-03-23 23:47:25 -0700 | [diff] [blame] | 446 | |
Mathieu Chartier | ebe2dfc | 2015-11-24 13:47:52 -0800 | [diff] [blame] | 447 | *error_msg = StringPrintf("mmap(%p, %zd, 0x%x, 0x%x, %d, %" PRId64 |
| 448 | ") of file '%s' failed: %s. See process maps in the log.", |
| 449 | page_aligned_expected, page_aligned_byte_count, prot, flags, fd, |
| 450 | static_cast<int64_t>(page_aligned_offset), filename, |
| 451 | strerror(saved_errno)); |
| 452 | } |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 453 | return nullptr; |
| 454 | } |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 455 | if (!CheckMapRequest(expected_ptr, actual, page_aligned_byte_count, error_msg)) { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 456 | return nullptr; |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 457 | } |
Evgenii Stepanov | 1e13374 | 2015-05-20 12:30:59 -0700 | [diff] [blame] | 458 | if (redzone_size != 0) { |
| 459 | const uint8_t *real_start = actual + page_offset; |
| 460 | const uint8_t *real_end = actual + page_offset + byte_count; |
| 461 | const uint8_t *mapping_end = actual + page_aligned_byte_count; |
| 462 | |
| 463 | MEMORY_TOOL_MAKE_NOACCESS(actual, real_start - actual); |
| 464 | MEMORY_TOOL_MAKE_NOACCESS(real_end, mapping_end - real_end); |
| 465 | page_aligned_byte_count -= redzone_size; |
| 466 | } |
| 467 | |
Brian Carlstrom | 0d6adac | 2014-02-05 17:39:16 -0800 | [diff] [blame] | 468 | return new MemMap(filename, actual + page_offset, byte_count, actual, page_aligned_byte_count, |
Evgenii Stepanov | 1e13374 | 2015-05-20 12:30:59 -0700 | [diff] [blame] | 469 | prot, reuse, redzone_size); |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 470 | } |
| 471 | |
| 472 | MemMap::~MemMap() { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 473 | if (base_begin_ == nullptr && base_size_ == 0) { |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 474 | return; |
| 475 | } |
Evgenii Stepanov | 1e13374 | 2015-05-20 12:30:59 -0700 | [diff] [blame] | 476 | |
| 477 | // Unlike Valgrind, AddressSanitizer requires that all manually poisoned memory is unpoisoned |
| 478 | // before it is returned to the system. |
| 479 | if (redzone_size_ != 0) { |
| 480 | MEMORY_TOOL_MAKE_UNDEFINED( |
| 481 | reinterpret_cast<char*>(base_begin_) + base_size_ - redzone_size_, |
| 482 | redzone_size_); |
| 483 | } |
| 484 | |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 485 | if (!reuse_) { |
Evgenii Stepanov | 1e13374 | 2015-05-20 12:30:59 -0700 | [diff] [blame] | 486 | MEMORY_TOOL_MAKE_UNDEFINED(base_begin_, base_size_); |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 487 | int result = munmap(base_begin_, base_size_); |
| 488 | if (result == -1) { |
| 489 | PLOG(FATAL) << "munmap failed"; |
| 490 | } |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 491 | } |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 492 | |
| 493 | // Remove it from maps_. |
David Sehr | 1b14fb8 | 2017-02-01 10:42:11 -0800 | [diff] [blame] | 494 | std::lock_guard<std::mutex> mu(*mem_maps_lock_); |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 495 | bool found = false; |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 496 | DCHECK(maps_ != nullptr); |
| 497 | for (auto it = maps_->lower_bound(base_begin_), end = maps_->end(); |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 498 | it != end && it->first == base_begin_; ++it) { |
| 499 | if (it->second == this) { |
| 500 | found = true; |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 501 | maps_->erase(it); |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 502 | break; |
| 503 | } |
| 504 | } |
| 505 | CHECK(found) << "MemMap not found"; |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 506 | } |
| 507 | |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 508 | MemMap::MemMap(const std::string& name, uint8_t* begin, size_t size, void* base_begin, |
Evgenii Stepanov | 1e13374 | 2015-05-20 12:30:59 -0700 | [diff] [blame] | 509 | size_t base_size, int prot, bool reuse, size_t redzone_size) |
Mathieu Chartier | 1c23e1e | 2012-10-12 14:14:11 -0700 | [diff] [blame] | 510 | : name_(name), begin_(begin), size_(size), base_begin_(base_begin), base_size_(base_size), |
Evgenii Stepanov | 1e13374 | 2015-05-20 12:30:59 -0700 | [diff] [blame] | 511 | prot_(prot), reuse_(reuse), redzone_size_(redzone_size) { |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 512 | if (size_ == 0) { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 513 | CHECK(begin_ == nullptr); |
| 514 | CHECK(base_begin_ == nullptr); |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 515 | CHECK_EQ(base_size_, 0U); |
| 516 | } else { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 517 | CHECK(begin_ != nullptr); |
| 518 | CHECK(base_begin_ != nullptr); |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 519 | CHECK_NE(base_size_, 0U); |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 520 | |
| 521 | // Add it to maps_. |
David Sehr | 1b14fb8 | 2017-02-01 10:42:11 -0800 | [diff] [blame] | 522 | std::lock_guard<std::mutex> mu(*mem_maps_lock_); |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 523 | DCHECK(maps_ != nullptr); |
| 524 | maps_->insert(std::make_pair(base_begin_, this)); |
Brian Carlstrom | 9004cb6 | 2013-07-26 15:48:31 -0700 | [diff] [blame] | 525 | } |
Andreas Gampe | c8ccf68 | 2014-09-29 20:07:43 -0700 | [diff] [blame] | 526 | } |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 527 | |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 528 | MemMap* MemMap::RemapAtEnd(uint8_t* new_end, const char* tail_name, int tail_prot, |
Nicolas Geoffray | a25dce9 | 2016-01-12 16:41:10 +0000 | [diff] [blame] | 529 | std::string* error_msg, bool use_ashmem) { |
Nicolas Geoffray | 58a73d2 | 2016-11-29 21:49:43 +0000 | [diff] [blame] | 530 | use_ashmem = use_ashmem && !kIsTargetLinux; |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 531 | DCHECK_GE(new_end, Begin()); |
| 532 | DCHECK_LE(new_end, End()); |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 533 | DCHECK_LE(begin_ + size_, reinterpret_cast<uint8_t*>(base_begin_) + base_size_); |
Roland Levillain | 14d9057 | 2015-07-16 10:52:26 +0100 | [diff] [blame] | 534 | DCHECK_ALIGNED(begin_, kPageSize); |
| 535 | DCHECK_ALIGNED(base_begin_, kPageSize); |
| 536 | DCHECK_ALIGNED(reinterpret_cast<uint8_t*>(base_begin_) + base_size_, kPageSize); |
| 537 | DCHECK_ALIGNED(new_end, kPageSize); |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 538 | uint8_t* old_end = begin_ + size_; |
| 539 | uint8_t* old_base_end = reinterpret_cast<uint8_t*>(base_begin_) + base_size_; |
| 540 | uint8_t* new_base_end = new_end; |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 541 | DCHECK_LE(new_base_end, old_base_end); |
| 542 | if (new_base_end == old_base_end) { |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 543 | return new MemMap(tail_name, nullptr, 0, nullptr, 0, tail_prot, false); |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 544 | } |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 545 | size_ = new_end - reinterpret_cast<uint8_t*>(begin_); |
| 546 | base_size_ = new_base_end - reinterpret_cast<uint8_t*>(base_begin_); |
| 547 | DCHECK_LE(begin_ + size_, reinterpret_cast<uint8_t*>(base_begin_) + base_size_); |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 548 | size_t tail_size = old_end - new_end; |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 549 | uint8_t* tail_base_begin = new_base_end; |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 550 | size_t tail_base_size = old_base_end - new_base_end; |
| 551 | DCHECK_EQ(tail_base_begin + tail_base_size, old_base_end); |
Roland Levillain | 14d9057 | 2015-07-16 10:52:26 +0100 | [diff] [blame] | 552 | DCHECK_ALIGNED(tail_base_size, kPageSize); |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 553 | |
Nicolas Geoffray | a25dce9 | 2016-01-12 16:41:10 +0000 | [diff] [blame] | 554 | int int_fd = -1; |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 555 | int flags = MAP_PRIVATE | MAP_ANONYMOUS; |
Nicolas Geoffray | a25dce9 | 2016-01-12 16:41:10 +0000 | [diff] [blame] | 556 | if (use_ashmem) { |
| 557 | // android_os_Debug.cpp read_mapinfo assumes all ashmem regions associated with the VM are |
| 558 | // prefixed "dalvik-". |
| 559 | std::string debug_friendly_name("dalvik-"); |
| 560 | debug_friendly_name += tail_name; |
| 561 | int_fd = ashmem_create_region(debug_friendly_name.c_str(), tail_base_size); |
| 562 | flags = MAP_PRIVATE | MAP_FIXED; |
| 563 | if (int_fd == -1) { |
| 564 | *error_msg = StringPrintf("ashmem_create_region failed for '%s': %s", |
| 565 | tail_name, strerror(errno)); |
| 566 | return nullptr; |
| 567 | } |
| 568 | } |
Andreas Gampe | 43e10b0 | 2016-07-15 17:17:34 -0700 | [diff] [blame] | 569 | File fd(int_fd, /* check_usage */ false); |
Evgenii Stepanov | 1e13374 | 2015-05-20 12:30:59 -0700 | [diff] [blame] | 570 | |
| 571 | MEMORY_TOOL_MAKE_UNDEFINED(tail_base_begin, tail_base_size); |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 572 | // Unmap/map the tail region. |
| 573 | int result = munmap(tail_base_begin, tail_base_size); |
| 574 | if (result == -1) { |
Andreas Gampe | a6dfdae | 2015-02-24 15:50:19 -0800 | [diff] [blame] | 575 | PrintFileToLog("/proc/self/maps", LogSeverity::WARNING); |
| 576 | *error_msg = StringPrintf("munmap(%p, %zd) failed for '%s'. See process maps in the log.", |
| 577 | tail_base_begin, tail_base_size, name_.c_str()); |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 578 | return nullptr; |
| 579 | } |
| 580 | // Don't cause memory allocation between the munmap and the mmap |
| 581 | // calls. Otherwise, libc (or something else) might take this memory |
| 582 | // region. Note this isn't perfect as there's no way to prevent |
| 583 | // other threads to try to take this memory region here. |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 584 | uint8_t* actual = reinterpret_cast<uint8_t*>(mmap(tail_base_begin, tail_base_size, tail_prot, |
Andreas Gampe | 43e10b0 | 2016-07-15 17:17:34 -0700 | [diff] [blame] | 585 | flags, fd.Fd(), 0)); |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 586 | if (actual == MAP_FAILED) { |
Andreas Gampe | a6dfdae | 2015-02-24 15:50:19 -0800 | [diff] [blame] | 587 | PrintFileToLog("/proc/self/maps", LogSeverity::WARNING); |
| 588 | *error_msg = StringPrintf("anonymous mmap(%p, %zd, 0x%x, 0x%x, %d, 0) failed. See process " |
| 589 | "maps in the log.", tail_base_begin, tail_base_size, tail_prot, flags, |
Andreas Gampe | 43e10b0 | 2016-07-15 17:17:34 -0700 | [diff] [blame] | 590 | fd.Fd()); |
Hiroshi Yamauchi | fd7e7f1 | 2013-10-22 14:17:48 -0700 | [diff] [blame] | 591 | return nullptr; |
| 592 | } |
Jim_Guo | a62a588 | 2014-04-28 11:11:57 +0800 | [diff] [blame] | 593 | 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] | 594 | } |
Logan Chien | d88fa26 | 2012-06-06 15:23:32 +0800 | [diff] [blame] | 595 | |
Ian Rogers | c5f1773 | 2014-06-05 20:48:42 -0700 | [diff] [blame] | 596 | void MemMap::MadviseDontNeedAndZero() { |
| 597 | if (base_begin_ != nullptr || base_size_ != 0) { |
| 598 | if (!kMadviseZeroes) { |
| 599 | memset(base_begin_, 0, base_size_); |
| 600 | } |
| 601 | int result = madvise(base_begin_, base_size_, MADV_DONTNEED); |
| 602 | if (result == -1) { |
| 603 | PLOG(WARNING) << "madvise failed"; |
| 604 | } |
| 605 | } |
| 606 | } |
| 607 | |
Vladimir Marko | 9bdf108 | 2016-01-21 12:15:52 +0000 | [diff] [blame] | 608 | bool MemMap::Sync() { |
Hiroshi Yamauchi | 29ab360 | 2016-03-08 15:17:21 -0800 | [diff] [blame] | 609 | bool result; |
| 610 | if (redzone_size_ != 0) { |
| 611 | // To avoid valgrind errors, temporarily lift the lower-end noaccess protection before passing |
| 612 | // it to msync() as it only accepts page-aligned base address, and exclude the higher-end |
| 613 | // noaccess protection from the msync range. b/27552451. |
| 614 | uint8_t* base_begin = reinterpret_cast<uint8_t*>(base_begin_); |
| 615 | MEMORY_TOOL_MAKE_DEFINED(base_begin, begin_ - base_begin); |
| 616 | result = msync(BaseBegin(), End() - base_begin, MS_SYNC) == 0; |
| 617 | MEMORY_TOOL_MAKE_NOACCESS(base_begin, begin_ - base_begin); |
| 618 | } else { |
| 619 | result = msync(BaseBegin(), BaseSize(), MS_SYNC) == 0; |
| 620 | } |
| 621 | return result; |
Vladimir Marko | 9bdf108 | 2016-01-21 12:15:52 +0000 | [diff] [blame] | 622 | } |
| 623 | |
Logan Chien | d88fa26 | 2012-06-06 15:23:32 +0800 | [diff] [blame] | 624 | bool MemMap::Protect(int prot) { |
Hiroshi Yamauchi | 4fb5df8 | 2014-03-13 15:10:27 -0700 | [diff] [blame] | 625 | if (base_begin_ == nullptr && base_size_ == 0) { |
Ian Rogers | 1c849e5 | 2012-06-28 14:00:33 -0700 | [diff] [blame] | 626 | prot_ = prot; |
Logan Chien | d88fa26 | 2012-06-06 15:23:32 +0800 | [diff] [blame] | 627 | return true; |
| 628 | } |
| 629 | |
| 630 | if (mprotect(base_begin_, base_size_, prot) == 0) { |
Ian Rogers | 1c849e5 | 2012-06-28 14:00:33 -0700 | [diff] [blame] | 631 | prot_ = prot; |
Logan Chien | d88fa26 | 2012-06-06 15:23:32 +0800 | [diff] [blame] | 632 | return true; |
| 633 | } |
| 634 | |
Shih-wei Liao | a060ed9 | 2012-06-07 09:25:28 -0700 | [diff] [blame] | 635 | PLOG(ERROR) << "mprotect(" << reinterpret_cast<void*>(base_begin_) << ", " << base_size_ << ", " |
| 636 | << prot << ") failed"; |
Logan Chien | d88fa26 | 2012-06-06 15:23:32 +0800 | [diff] [blame] | 637 | return false; |
| 638 | } |
| 639 | |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 640 | bool MemMap::CheckNoGaps(MemMap* begin_map, MemMap* end_map) { |
David Sehr | 1b14fb8 | 2017-02-01 10:42:11 -0800 | [diff] [blame] | 641 | std::lock_guard<std::mutex> mu(*mem_maps_lock_); |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 642 | CHECK(begin_map != nullptr); |
| 643 | CHECK(end_map != nullptr); |
| 644 | CHECK(HasMemMap(begin_map)); |
| 645 | CHECK(HasMemMap(end_map)); |
| 646 | CHECK_LE(begin_map->BaseBegin(), end_map->BaseBegin()); |
| 647 | MemMap* map = begin_map; |
| 648 | while (map->BaseBegin() != end_map->BaseBegin()) { |
| 649 | MemMap* next_map = GetLargestMemMapAt(map->BaseEnd()); |
| 650 | if (next_map == nullptr) { |
| 651 | // Found a gap. |
| 652 | return false; |
| 653 | } |
| 654 | map = next_map; |
| 655 | } |
| 656 | return true; |
| 657 | } |
| 658 | |
Vladimir Marko | 17a924a | 2015-05-08 15:17:32 +0100 | [diff] [blame] | 659 | void MemMap::DumpMaps(std::ostream& os, bool terse) { |
David Sehr | 1b14fb8 | 2017-02-01 10:42:11 -0800 | [diff] [blame] | 660 | std::lock_guard<std::mutex> mu(*mem_maps_lock_); |
Vladimir Marko | 17a924a | 2015-05-08 15:17:32 +0100 | [diff] [blame] | 661 | DumpMapsLocked(os, terse); |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 662 | } |
| 663 | |
Vladimir Marko | 17a924a | 2015-05-08 15:17:32 +0100 | [diff] [blame] | 664 | void MemMap::DumpMapsLocked(std::ostream& os, bool terse) { |
| 665 | const auto& mem_maps = *maps_; |
| 666 | if (!terse) { |
| 667 | os << mem_maps; |
| 668 | return; |
| 669 | } |
| 670 | |
| 671 | // Terse output example: |
| 672 | // [MemMap: 0x409be000+0x20P~0x11dP+0x20P~0x61cP+0x20P prot=0x3 LinearAlloc] |
| 673 | // [MemMap: 0x451d6000+0x6bP(3) prot=0x3 large object space allocation] |
| 674 | // The details: |
| 675 | // "+0x20P" means 0x20 pages taken by a single mapping, |
| 676 | // "~0x11dP" means a gap of 0x11d pages, |
| 677 | // "+0x6bP(3)" means 3 mappings one after another, together taking 0x6b pages. |
| 678 | os << "MemMap:" << std::endl; |
| 679 | for (auto it = mem_maps.begin(), maps_end = mem_maps.end(); it != maps_end;) { |
| 680 | MemMap* map = it->second; |
| 681 | void* base = it->first; |
| 682 | CHECK_EQ(base, map->BaseBegin()); |
| 683 | os << "[MemMap: " << base; |
| 684 | ++it; |
| 685 | // Merge consecutive maps with the same protect flags and name. |
| 686 | constexpr size_t kMaxGaps = 9; |
| 687 | size_t num_gaps = 0; |
| 688 | size_t num = 1u; |
| 689 | size_t size = map->BaseSize(); |
Roland Levillain | 14d9057 | 2015-07-16 10:52:26 +0100 | [diff] [blame] | 690 | CHECK_ALIGNED(size, kPageSize); |
Vladimir Marko | 17a924a | 2015-05-08 15:17:32 +0100 | [diff] [blame] | 691 | void* end = map->BaseEnd(); |
| 692 | while (it != maps_end && |
| 693 | it->second->GetProtect() == map->GetProtect() && |
| 694 | it->second->GetName() == map->GetName() && |
| 695 | (it->second->BaseBegin() == end || num_gaps < kMaxGaps)) { |
| 696 | if (it->second->BaseBegin() != end) { |
| 697 | ++num_gaps; |
| 698 | os << "+0x" << std::hex << (size / kPageSize) << "P"; |
| 699 | if (num != 1u) { |
| 700 | os << "(" << std::dec << num << ")"; |
| 701 | } |
| 702 | size_t gap = |
| 703 | reinterpret_cast<uintptr_t>(it->second->BaseBegin()) - reinterpret_cast<uintptr_t>(end); |
Roland Levillain | 14d9057 | 2015-07-16 10:52:26 +0100 | [diff] [blame] | 704 | CHECK_ALIGNED(gap, kPageSize); |
Vladimir Marko | 17a924a | 2015-05-08 15:17:32 +0100 | [diff] [blame] | 705 | os << "~0x" << std::hex << (gap / kPageSize) << "P"; |
| 706 | num = 0u; |
| 707 | size = 0u; |
| 708 | } |
Roland Levillain | 14d9057 | 2015-07-16 10:52:26 +0100 | [diff] [blame] | 709 | CHECK_ALIGNED(it->second->BaseSize(), kPageSize); |
Vladimir Marko | 17a924a | 2015-05-08 15:17:32 +0100 | [diff] [blame] | 710 | ++num; |
| 711 | size += it->second->BaseSize(); |
| 712 | end = it->second->BaseEnd(); |
| 713 | ++it; |
| 714 | } |
| 715 | os << "+0x" << std::hex << (size / kPageSize) << "P"; |
| 716 | if (num != 1u) { |
| 717 | os << "(" << std::dec << num << ")"; |
| 718 | } |
| 719 | os << " prot=0x" << std::hex << map->GetProtect() << " " << map->GetName() << "]" << std::endl; |
| 720 | } |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 721 | } |
| 722 | |
| 723 | bool MemMap::HasMemMap(MemMap* map) { |
| 724 | void* base_begin = map->BaseBegin(); |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 725 | for (auto it = maps_->lower_bound(base_begin), end = maps_->end(); |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 726 | it != end && it->first == base_begin; ++it) { |
| 727 | if (it->second == map) { |
| 728 | return true; |
| 729 | } |
| 730 | } |
| 731 | return false; |
| 732 | } |
| 733 | |
| 734 | MemMap* MemMap::GetLargestMemMapAt(void* address) { |
| 735 | size_t largest_size = 0; |
| 736 | MemMap* largest_map = nullptr; |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 737 | DCHECK(maps_ != nullptr); |
| 738 | for (auto it = maps_->lower_bound(address), end = maps_->end(); |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 739 | it != end && it->first == address; ++it) { |
| 740 | MemMap* map = it->second; |
| 741 | CHECK(map != nullptr); |
| 742 | if (largest_size < map->BaseSize()) { |
| 743 | largest_size = map->BaseSize(); |
| 744 | largest_map = map; |
| 745 | } |
| 746 | } |
| 747 | return largest_map; |
| 748 | } |
| 749 | |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 750 | void MemMap::Init() { |
David Sehr | 1b14fb8 | 2017-02-01 10:42:11 -0800 | [diff] [blame] | 751 | if (mem_maps_lock_ != nullptr) { |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 752 | // dex2oat calls MemMap::Init twice since its needed before the runtime is created. |
David Sehr | 1b14fb8 | 2017-02-01 10:42:11 -0800 | [diff] [blame] | 753 | return; |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 754 | } |
David Sehr | 1b14fb8 | 2017-02-01 10:42:11 -0800 | [diff] [blame] | 755 | mem_maps_lock_ = new std::mutex(); |
| 756 | // Not for thread safety, but for the annotation that maps_ is GUARDED_BY(mem_maps_lock_). |
| 757 | std::lock_guard<std::mutex> mu(*mem_maps_lock_); |
| 758 | DCHECK(maps_ == nullptr); |
| 759 | maps_ = new Maps; |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 760 | } |
| 761 | |
| 762 | void MemMap::Shutdown() { |
David Sehr | 1b14fb8 | 2017-02-01 10:42:11 -0800 | [diff] [blame] | 763 | if (mem_maps_lock_ == nullptr) { |
| 764 | // If MemMap::Shutdown is called more than once, there is no effect. |
| 765 | return; |
| 766 | } |
| 767 | { |
| 768 | // Not for thread safety, but for the annotation that maps_ is GUARDED_BY(mem_maps_lock_). |
| 769 | std::lock_guard<std::mutex> mu(*mem_maps_lock_); |
| 770 | DCHECK(maps_ != nullptr); |
| 771 | delete maps_; |
| 772 | maps_ = nullptr; |
| 773 | } |
| 774 | delete mem_maps_lock_; |
| 775 | mem_maps_lock_ = nullptr; |
Mathieu Chartier | 6e88ef6 | 2014-10-14 15:01:24 -0700 | [diff] [blame] | 776 | } |
| 777 | |
Mathieu Chartier | 379d09f | 2015-01-08 11:28:13 -0800 | [diff] [blame] | 778 | void MemMap::SetSize(size_t new_size) { |
| 779 | if (new_size == base_size_) { |
| 780 | return; |
| 781 | } |
| 782 | CHECK_ALIGNED(new_size, kPageSize); |
| 783 | CHECK_EQ(base_size_, size_) << "Unsupported"; |
| 784 | CHECK_LE(new_size, base_size_); |
Evgenii Stepanov | 1e13374 | 2015-05-20 12:30:59 -0700 | [diff] [blame] | 785 | MEMORY_TOOL_MAKE_UNDEFINED( |
| 786 | reinterpret_cast<void*>(reinterpret_cast<uintptr_t>(BaseBegin()) + |
| 787 | new_size), |
| 788 | base_size_ - new_size); |
Mathieu Chartier | 379d09f | 2015-01-08 11:28:13 -0800 | [diff] [blame] | 789 | CHECK_EQ(munmap(reinterpret_cast<void*>(reinterpret_cast<uintptr_t>(BaseBegin()) + new_size), |
| 790 | base_size_ - new_size), 0) << new_size << " " << base_size_; |
| 791 | base_size_ = new_size; |
| 792 | size_ = new_size; |
| 793 | } |
| 794 | |
Mathieu Chartier | 42bddce | 2015-11-09 15:16:56 -0800 | [diff] [blame] | 795 | void* MemMap::MapInternal(void* addr, |
| 796 | size_t length, |
| 797 | int prot, |
| 798 | int flags, |
| 799 | int fd, |
| 800 | off_t offset, |
| 801 | bool low_4gb) { |
| 802 | #ifdef __LP64__ |
Mathieu Chartier | 42bddce | 2015-11-09 15:16:56 -0800 | [diff] [blame] | 803 | // When requesting low_4g memory and having an expectation, the requested range should fit into |
| 804 | // 4GB. |
| 805 | if (low_4gb && ( |
| 806 | // Start out of bounds. |
| 807 | (reinterpret_cast<uintptr_t>(addr) >> 32) != 0 || |
| 808 | // End out of bounds. For simplicity, this will fail for the last page of memory. |
| 809 | ((reinterpret_cast<uintptr_t>(addr) + length) >> 32) != 0)) { |
| 810 | LOG(ERROR) << "The requested address space (" << addr << ", " |
| 811 | << reinterpret_cast<void*>(reinterpret_cast<uintptr_t>(addr) + length) |
| 812 | << ") cannot fit in low_4gb"; |
| 813 | return MAP_FAILED; |
| 814 | } |
| 815 | #else |
| 816 | UNUSED(low_4gb); |
| 817 | #endif |
| 818 | DCHECK_ALIGNED(length, kPageSize); |
| 819 | if (low_4gb) { |
| 820 | DCHECK_EQ(flags & MAP_FIXED, 0); |
| 821 | } |
| 822 | // TODO: |
| 823 | // A page allocator would be a useful abstraction here, as |
| 824 | // 1) It is doubtful that MAP_32BIT on x86_64 is doing the right job for us |
| 825 | void* actual = MAP_FAILED; |
| 826 | #if USE_ART_LOW_4G_ALLOCATOR |
| 827 | // MAP_32BIT only available on x86_64. |
| 828 | if (low_4gb && addr == nullptr) { |
| 829 | bool first_run = true; |
| 830 | |
David Sehr | 1b14fb8 | 2017-02-01 10:42:11 -0800 | [diff] [blame] | 831 | std::lock_guard<std::mutex> mu(*mem_maps_lock_); |
Mathieu Chartier | 42bddce | 2015-11-09 15:16:56 -0800 | [diff] [blame] | 832 | for (uintptr_t ptr = next_mem_pos_; ptr < 4 * GB; ptr += kPageSize) { |
| 833 | // Use maps_ as an optimization to skip over large maps. |
| 834 | // Find the first map which is address > ptr. |
| 835 | auto it = maps_->upper_bound(reinterpret_cast<void*>(ptr)); |
| 836 | if (it != maps_->begin()) { |
| 837 | auto before_it = it; |
| 838 | --before_it; |
| 839 | // Start at the end of the map before the upper bound. |
| 840 | ptr = std::max(ptr, reinterpret_cast<uintptr_t>(before_it->second->BaseEnd())); |
| 841 | CHECK_ALIGNED(ptr, kPageSize); |
| 842 | } |
| 843 | while (it != maps_->end()) { |
| 844 | // How much space do we have until the next map? |
| 845 | size_t delta = reinterpret_cast<uintptr_t>(it->first) - ptr; |
| 846 | // If the space may be sufficient, break out of the loop. |
| 847 | if (delta >= length) { |
| 848 | break; |
| 849 | } |
| 850 | // Otherwise, skip to the end of the map. |
| 851 | ptr = reinterpret_cast<uintptr_t>(it->second->BaseEnd()); |
| 852 | CHECK_ALIGNED(ptr, kPageSize); |
| 853 | ++it; |
| 854 | } |
| 855 | |
| 856 | // Try to see if we get lucky with this address since none of the ART maps overlap. |
| 857 | actual = TryMemMapLow4GB(reinterpret_cast<void*>(ptr), length, prot, flags, fd, offset); |
| 858 | if (actual != MAP_FAILED) { |
| 859 | next_mem_pos_ = reinterpret_cast<uintptr_t>(actual) + length; |
| 860 | return actual; |
| 861 | } |
| 862 | |
| 863 | if (4U * GB - ptr < length) { |
| 864 | // Not enough memory until 4GB. |
| 865 | if (first_run) { |
| 866 | // Try another time from the bottom; |
| 867 | ptr = LOW_MEM_START - kPageSize; |
| 868 | first_run = false; |
| 869 | continue; |
| 870 | } else { |
| 871 | // Second try failed. |
| 872 | break; |
| 873 | } |
| 874 | } |
| 875 | |
| 876 | uintptr_t tail_ptr; |
| 877 | |
| 878 | // Check pages are free. |
| 879 | bool safe = true; |
| 880 | for (tail_ptr = ptr; tail_ptr < ptr + length; tail_ptr += kPageSize) { |
| 881 | if (msync(reinterpret_cast<void*>(tail_ptr), kPageSize, 0) == 0) { |
| 882 | safe = false; |
| 883 | break; |
| 884 | } else { |
| 885 | DCHECK_EQ(errno, ENOMEM); |
| 886 | } |
| 887 | } |
| 888 | |
| 889 | next_mem_pos_ = tail_ptr; // update early, as we break out when we found and mapped a region |
| 890 | |
| 891 | if (safe == true) { |
| 892 | actual = TryMemMapLow4GB(reinterpret_cast<void*>(ptr), length, prot, flags, fd, offset); |
| 893 | if (actual != MAP_FAILED) { |
| 894 | return actual; |
| 895 | } |
| 896 | } else { |
| 897 | // Skip over last page. |
| 898 | ptr = tail_ptr; |
| 899 | } |
| 900 | } |
| 901 | |
| 902 | if (actual == MAP_FAILED) { |
| 903 | LOG(ERROR) << "Could not find contiguous low-memory space."; |
| 904 | errno = ENOMEM; |
| 905 | } |
| 906 | } else { |
| 907 | actual = mmap(addr, length, prot, flags, fd, offset); |
| 908 | } |
| 909 | |
| 910 | #else |
| 911 | #if defined(__LP64__) |
| 912 | if (low_4gb && addr == nullptr) { |
| 913 | flags |= MAP_32BIT; |
| 914 | } |
| 915 | #endif |
| 916 | actual = mmap(addr, length, prot, flags, fd, offset); |
| 917 | #endif |
| 918 | return actual; |
| 919 | } |
| 920 | |
Brian Carlstrom | 0d6adac | 2014-02-05 17:39:16 -0800 | [diff] [blame] | 921 | std::ostream& operator<<(std::ostream& os, const MemMap& mem_map) { |
Hiroshi Yamauchi | 3eed93d | 2014-06-04 11:43:59 -0700 | [diff] [blame] | 922 | os << StringPrintf("[MemMap: %p-%p prot=0x%x %s]", |
| 923 | mem_map.BaseBegin(), mem_map.BaseEnd(), mem_map.GetProtect(), |
| 924 | mem_map.GetName().c_str()); |
Brian Carlstrom | 0d6adac | 2014-02-05 17:39:16 -0800 | [diff] [blame] | 925 | return os; |
| 926 | } |
| 927 | |
Hiroshi Yamauchi | 6edb9ae | 2016-02-08 14:18:21 -0800 | [diff] [blame] | 928 | void MemMap::TryReadable() { |
| 929 | if (base_begin_ == nullptr && base_size_ == 0) { |
| 930 | return; |
| 931 | } |
| 932 | CHECK_NE(prot_ & PROT_READ, 0); |
| 933 | volatile uint8_t* begin = reinterpret_cast<volatile uint8_t*>(base_begin_); |
| 934 | volatile uint8_t* end = begin + base_size_; |
| 935 | DCHECK(IsAligned<kPageSize>(begin)); |
| 936 | DCHECK(IsAligned<kPageSize>(end)); |
| 937 | // Read the first byte of each page. Use volatile to prevent the compiler from optimizing away the |
| 938 | // reads. |
| 939 | for (volatile uint8_t* ptr = begin; ptr < end; ptr += kPageSize) { |
| 940 | // This read could fault if protection wasn't set correctly. |
| 941 | uint8_t value = *ptr; |
| 942 | UNUSED(value); |
| 943 | } |
| 944 | } |
| 945 | |
Mathieu Chartier | 6e6078a | 2016-10-24 15:45:41 -0700 | [diff] [blame] | 946 | void ZeroAndReleasePages(void* address, size_t length) { |
| 947 | uint8_t* const mem_begin = reinterpret_cast<uint8_t*>(address); |
| 948 | uint8_t* const mem_end = mem_begin + length; |
| 949 | uint8_t* const page_begin = AlignUp(mem_begin, kPageSize); |
| 950 | uint8_t* const page_end = AlignDown(mem_end, kPageSize); |
| 951 | if (!kMadviseZeroes || page_begin >= page_end) { |
| 952 | // No possible area to madvise. |
| 953 | std::fill(mem_begin, mem_end, 0); |
| 954 | } else { |
| 955 | // Spans one or more pages. |
| 956 | DCHECK_LE(mem_begin, page_begin); |
| 957 | DCHECK_LE(page_begin, page_end); |
| 958 | DCHECK_LE(page_end, mem_end); |
| 959 | std::fill(mem_begin, page_begin, 0); |
| 960 | CHECK_NE(madvise(page_begin, page_end - page_begin, MADV_DONTNEED), -1) << "madvise failed"; |
| 961 | std::fill(page_end, mem_end, 0); |
| 962 | } |
| 963 | } |
| 964 | |
Hiroshi Yamauchi | 3c3c4a1 | 2017-02-21 16:49:59 -0800 | [diff] [blame] | 965 | void MemMap::AlignBy(size_t size) { |
| 966 | CHECK_EQ(begin_, base_begin_) << "Unsupported"; |
| 967 | CHECK_EQ(size_, base_size_) << "Unsupported"; |
| 968 | CHECK_GT(size, static_cast<size_t>(kPageSize)); |
| 969 | CHECK_ALIGNED(size, kPageSize); |
| 970 | if (IsAlignedParam(reinterpret_cast<uintptr_t>(base_begin_), size) && |
| 971 | IsAlignedParam(base_size_, size)) { |
| 972 | // Already aligned. |
| 973 | return; |
| 974 | } |
| 975 | uint8_t* base_begin = reinterpret_cast<uint8_t*>(base_begin_); |
| 976 | uint8_t* base_end = base_begin + base_size_; |
| 977 | uint8_t* aligned_base_begin = AlignUp(base_begin, size); |
| 978 | uint8_t* aligned_base_end = AlignDown(base_end, size); |
| 979 | CHECK_LE(base_begin, aligned_base_begin); |
| 980 | CHECK_LE(aligned_base_end, base_end); |
| 981 | size_t aligned_base_size = aligned_base_end - aligned_base_begin; |
| 982 | CHECK_LT(aligned_base_begin, aligned_base_end) |
| 983 | << "base_begin = " << reinterpret_cast<void*>(base_begin) |
| 984 | << " base_end = " << reinterpret_cast<void*>(base_end); |
| 985 | CHECK_GE(aligned_base_size, size); |
| 986 | // Unmap the unaligned parts. |
| 987 | if (base_begin < aligned_base_begin) { |
| 988 | MEMORY_TOOL_MAKE_UNDEFINED(base_begin, aligned_base_begin - base_begin); |
| 989 | CHECK_EQ(munmap(base_begin, aligned_base_begin - base_begin), 0) |
| 990 | << "base_begin=" << reinterpret_cast<void*>(base_begin) |
| 991 | << " aligned_base_begin=" << reinterpret_cast<void*>(aligned_base_begin); |
| 992 | } |
| 993 | if (aligned_base_end < base_end) { |
| 994 | MEMORY_TOOL_MAKE_UNDEFINED(aligned_base_end, base_end - aligned_base_end); |
| 995 | CHECK_EQ(munmap(aligned_base_end, base_end - aligned_base_end), 0) |
| 996 | << "base_end=" << reinterpret_cast<void*>(base_end) |
| 997 | << " aligned_base_end=" << reinterpret_cast<void*>(aligned_base_end); |
| 998 | } |
| 999 | std::lock_guard<std::mutex> mu(*mem_maps_lock_); |
| 1000 | base_begin_ = aligned_base_begin; |
| 1001 | base_size_ = aligned_base_size; |
| 1002 | begin_ = aligned_base_begin; |
| 1003 | size_ = aligned_base_size; |
| 1004 | DCHECK(maps_ != nullptr); |
| 1005 | if (base_begin < aligned_base_begin) { |
| 1006 | auto it = maps_->find(base_begin); |
| 1007 | CHECK(it != maps_->end()) << "MemMap not found"; |
| 1008 | maps_->erase(it); |
| 1009 | maps_->insert(std::make_pair(base_begin_, this)); |
| 1010 | } |
| 1011 | } |
| 1012 | |
Brian Carlstrom | 27ec961 | 2011-09-19 20:20:38 -0700 | [diff] [blame] | 1013 | } // namespace art |