blob: 892e7f4acde0996c28fffcf306b5d8abee38bc50 [file] [log] [blame]
Brian Carlstrom27ec9612011-09-19 20:20:38 -07001/*
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
Ian Rogersdebeb3a2014-01-23 16:54:52 -080019#include <inttypes.h>
Christopher Ferris943af7d2014-01-16 12:41:46 -080020#include <backtrace/BacktraceMap.h>
Ian Rogers700a4022014-05-19 16:49:03 -070021#include <memory>
Elliott Hughesecd3a6f2012-06-06 18:16:37 -070022
Andreas Gamped8f26db2014-05-19 17:01:13 -070023// See CreateStartPos below.
24#ifdef __BIONIC__
25#include <sys/auxv.h>
26#endif
27
Elliott Hughese222ee02012-12-13 14:41:43 -080028#include "base/stringprintf.h"
29#include "ScopedFd.h"
30#include "utils.h"
31
Elliott Hughes6c9c06d2011-11-07 16:43:47 -080032#define USE_ASHMEM 1
33
34#ifdef USE_ASHMEM
35#include <cutils/ashmem.h>
36#endif
37
Brian Carlstrom27ec9612011-09-19 20:20:38 -070038namespace art {
39
Christopher Ferris943af7d2014-01-16 12:41:46 -080040static std::ostream& operator<<(
41 std::ostream& os,
42 std::pair<BacktraceMap::const_iterator, BacktraceMap::const_iterator> iters) {
43 for (BacktraceMap::const_iterator it = iters.first; it != iters.second; ++it) {
44 os << StringPrintf("0x%08x-0x%08x %c%c%c %s\n",
45 static_cast<uint32_t>(it->start),
46 static_cast<uint32_t>(it->end),
47 (it->flags & PROT_READ) ? 'r' : '-',
48 (it->flags & PROT_WRITE) ? 'w' : '-',
49 (it->flags & PROT_EXEC) ? 'x' : '-', it->name.c_str());
Elliott Hughesecd3a6f2012-06-06 18:16:37 -070050 }
51 return os;
Brian Carlstrom27ec9612011-09-19 20:20:38 -070052}
53
Stuart Monteith8dba5aa2014-03-12 12:44:01 +000054#if defined(__LP64__) && !defined(__x86_64__)
Andreas Gamped8f26db2014-05-19 17:01:13 -070055// Handling mem_map in 32b address range for 64b architectures that do not support MAP_32BIT.
56
57// The regular start of memory allocations. The first 64KB is protected by SELinux.
Andreas Gampe6bd621a2014-05-16 17:28:58 -070058static constexpr uintptr_t LOW_MEM_START = 64 * KB;
Andreas Gampe7104cbf2014-03-21 11:44:43 -070059
Andreas Gamped8f26db2014-05-19 17:01:13 -070060// Generate random starting position.
61// To not interfere with image position, take the image's address and only place it below. Current
62// formula (sketch):
63//
64// ART_BASE_ADDR = 0001XXXXXXXXXXXXXXX
65// ----------------------------------------
66// = 0000111111111111111
67// & ~(kPageSize - 1) =~0000000000000001111
68// ----------------------------------------
69// mask = 0000111111111110000
70// & random data = YYYYYYYYYYYYYYYYYYY
71// -----------------------------------
72// tmp = 0000YYYYYYYYYYY0000
73// + LOW_MEM_START = 0000000000001000000
74// --------------------------------------
75// start
76//
77// getauxval as an entropy source is exposed in Bionic, but not in glibc before 2.16. When we
78// do not have Bionic, simply start with LOW_MEM_START.
79
80// Function is standalone so it can be tested somewhat in mem_map_test.cc.
81#ifdef __BIONIC__
82uintptr_t CreateStartPos(uint64_t input) {
83 CHECK_NE(0, ART_BASE_ADDRESS);
84
85 // Start with all bits below highest bit in ART_BASE_ADDRESS.
86 constexpr size_t leading_zeros = CLZ(static_cast<uint32_t>(ART_BASE_ADDRESS));
87 constexpr uintptr_t mask_ones = (1 << (31 - leading_zeros)) - 1;
88
89 // Lowest (usually 12) bits are not used, as aligned by page size.
90 constexpr uintptr_t mask = mask_ones & ~(kPageSize - 1);
91
92 // Mask input data.
93 return (input & mask) + LOW_MEM_START;
94}
95#endif
96
97static uintptr_t GenerateNextMemPos() {
98#ifdef __BIONIC__
99 uint8_t* random_data = reinterpret_cast<uint8_t*>(getauxval(AT_RANDOM));
100 // The lower 8B are taken for the stack guard. Use the upper 8B (with mask).
101 return CreateStartPos(*reinterpret_cast<uintptr_t*>(random_data + 8));
102#else
103 // No auxv on host, see above.
104 return LOW_MEM_START;
105#endif
106}
107
108// Initialize linear scan to random position.
109uintptr_t MemMap::next_mem_pos_ = GenerateNextMemPos();
Stuart Monteith8dba5aa2014-03-12 12:44:01 +0000110#endif
111
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700112static bool CheckMapRequest(byte* expected_ptr, void* actual_ptr, size_t byte_count,
113 std::ostringstream* error_msg) {
114 // Handled first by caller for more specific error messages.
115 CHECK(actual_ptr != MAP_FAILED);
116
117 if (expected_ptr == nullptr) {
118 return true;
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700119 }
Elliott Hughesecd3a6f2012-06-06 18:16:37 -0700120
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700121 if (expected_ptr == actual_ptr) {
122 return true;
123 }
124
125 // We asked for an address but didn't get what we wanted, all paths below here should fail.
126 int result = munmap(actual_ptr, byte_count);
127 if (result == -1) {
128 PLOG(WARNING) << StringPrintf("munmap(%p, %zd) failed", actual_ptr, byte_count);
129 }
130
131 uintptr_t actual = reinterpret_cast<uintptr_t>(actual_ptr);
132 uintptr_t expected = reinterpret_cast<uintptr_t>(expected_ptr);
133 uintptr_t limit = expected + byte_count;
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700134
Ian Rogers700a4022014-05-19 16:49:03 -0700135 std::unique_ptr<BacktraceMap> map(BacktraceMap::Create(getpid()));
Christopher Ferriscaf22ac2014-01-27 18:32:14 -0800136 if (!map->Build()) {
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700137 *error_msg << StringPrintf("Failed to build process map to determine why mmap returned "
138 "0x%08" PRIxPTR " instead of 0x%08" PRIxPTR, actual, expected);
139
140 return false;
Christopher Ferris943af7d2014-01-16 12:41:46 -0800141 }
Christopher Ferriscaf22ac2014-01-27 18:32:14 -0800142 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) {
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700143 if ((expected >= it->start && expected < it->end) // start of new within old
144 || (limit > it->start && limit < it->end) // end of new within old
145 || (expected <= it->start && limit > it->end)) { // start/end of new includes all of old
146 *error_msg
147 << StringPrintf("Requested region 0x%08" PRIxPTR "-0x%08" PRIxPTR " overlaps with "
148 "existing map 0x%08" PRIxPTR "-0x%08" PRIxPTR " (%s)\n",
149 expected, limit,
150 static_cast<uintptr_t>(it->start), static_cast<uintptr_t>(it->end),
151 it->name.c_str())
152 << std::make_pair(it, map->end());
153 return false;
154 }
Elliott Hughes96970cd2012-03-13 15:46:31 -0700155 }
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700156 *error_msg << StringPrintf("Failed to mmap at expected address, mapped at "
157 "0x%08" PRIxPTR " instead of 0x%08" PRIxPTR, actual, expected);
158 return false;
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700159}
160
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700161MemMap* MemMap::MapAnonymous(const char* name, byte* expected, size_t byte_count, int prot,
Ian Rogersef7d42f2014-01-06 12:55:46 -0800162 bool low_4gb, std::string* error_msg) {
Brian Carlstrom9004cb62013-07-26 15:48:31 -0700163 if (byte_count == 0) {
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700164 return new MemMap(name, nullptr, 0, nullptr, 0, prot);
Brian Carlstrom9004cb62013-07-26 15:48:31 -0700165 }
Elliott Hughesecd3a6f2012-06-06 18:16:37 -0700166 size_t page_aligned_byte_count = RoundUp(byte_count, kPageSize);
Elliott Hughes6c9c06d2011-11-07 16:43:47 -0800167
168#ifdef USE_ASHMEM
Ian Rogersa40307e2013-02-22 11:32:44 -0800169 // android_os_Debug.cpp read_mapinfo assumes all ashmem regions associated with the VM are
170 // prefixed "dalvik-".
171 std::string debug_friendly_name("dalvik-");
172 debug_friendly_name += name;
173 ScopedFd fd(ashmem_create_region(debug_friendly_name.c_str(), page_aligned_byte_count));
Elliott Hughes6c9c06d2011-11-07 16:43:47 -0800174 if (fd.get() == -1) {
Ian Rogers8d31bbd2013-10-13 10:44:14 -0700175 *error_msg = StringPrintf("ashmem_create_region failed for '%s': %s", name, strerror(errno));
176 return nullptr;
Elliott Hughes6c9c06d2011-11-07 16:43:47 -0800177 }
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700178 int flags = MAP_PRIVATE;
Elliott Hughes6c9c06d2011-11-07 16:43:47 -0800179#else
180 ScopedFd fd(-1);
181 int flags = MAP_PRIVATE | MAP_ANONYMOUS;
182#endif
Stuart Monteith8dba5aa2014-03-12 12:44:01 +0000183
Brian Carlstromaa94cf32014-03-23 23:47:25 -0700184 // We need to store and potentially set an error number for pretty printing of errors
185 int saved_errno = 0;
186
Qiming Shi84d49cc2014-04-24 15:38:41 +0800187#ifdef __LP64__
188 // When requesting low_4g memory and having an expectation, the requested range should fit into
189 // 4GB.
190 if (low_4gb && (
191 // Start out of bounds.
192 (reinterpret_cast<uintptr_t>(expected) >> 32) != 0 ||
193 // End out of bounds. For simplicity, this will fail for the last page of memory.
194 (reinterpret_cast<uintptr_t>(expected + page_aligned_byte_count) >> 32) != 0)) {
195 *error_msg = StringPrintf("The requested address space (%p, %p) cannot fit in low_4gb",
196 expected, expected + page_aligned_byte_count);
197 return nullptr;
198 }
199#endif
200
Stuart Monteith8dba5aa2014-03-12 12:44:01 +0000201 // TODO:
202 // A page allocator would be a useful abstraction here, as
203 // 1) It is doubtful that MAP_32BIT on x86_64 is doing the right job for us
204 // 2) The linear scheme, even with simple saving of the last known position, is very crude
205#if defined(__LP64__) && !defined(__x86_64__)
206 // MAP_32BIT only available on x86_64.
207 void* actual = MAP_FAILED;
Stuart Monteith8dba5aa2014-03-12 12:44:01 +0000208 if (low_4gb && expected == nullptr) {
Andreas Gampe7104cbf2014-03-21 11:44:43 -0700209 bool first_run = true;
210
Andreas Gampe71a3eba2014-03-17 12:57:08 -0700211 for (uintptr_t ptr = next_mem_pos_; ptr < 4 * GB; ptr += kPageSize) {
Andreas Gampe7104cbf2014-03-21 11:44:43 -0700212 if (4U * GB - ptr < page_aligned_byte_count) {
213 // Not enough memory until 4GB.
214 if (first_run) {
215 // Try another time from the bottom;
Andreas Gampe9de65ff2014-03-21 17:25:57 -0700216 ptr = LOW_MEM_START - kPageSize;
Andreas Gampe7104cbf2014-03-21 11:44:43 -0700217 first_run = false;
218 continue;
219 } else {
220 // Second try failed.
221 break;
222 }
223 }
224
Stuart Monteith8dba5aa2014-03-12 12:44:01 +0000225 uintptr_t tail_ptr;
226
227 // Check pages are free.
228 bool safe = true;
229 for (tail_ptr = ptr; tail_ptr < ptr + page_aligned_byte_count; tail_ptr += kPageSize) {
230 if (msync(reinterpret_cast<void*>(tail_ptr), kPageSize, 0) == 0) {
231 safe = false;
232 break;
233 } else {
234 DCHECK_EQ(errno, ENOMEM);
235 }
236 }
237
238 next_mem_pos_ = tail_ptr; // update early, as we break out when we found and mapped a region
239
240 if (safe == true) {
241 actual = mmap(reinterpret_cast<void*>(ptr), page_aligned_byte_count, prot, flags, fd.get(),
242 0);
243 if (actual != MAP_FAILED) {
Mathieu Chartierc355a2a2014-05-30 13:02:46 -0700244 // Since we didn't use MAP_FIXED the kernel may have mapped it somewhere not in the low
245 // 4GB. If this is the case, unmap and retry.
246 if (reinterpret_cast<uintptr_t>(actual) + page_aligned_byte_count < 4 * GB) {
247 break;
248 } else {
249 munmap(actual, page_aligned_byte_count);
250 actual = MAP_FAILED;
251 }
Stuart Monteith8dba5aa2014-03-12 12:44:01 +0000252 }
253 } else {
254 // Skip over last page.
255 ptr = tail_ptr;
256 }
257 }
258
259 if (actual == MAP_FAILED) {
Brian Carlstromaa94cf32014-03-23 23:47:25 -0700260 LOG(ERROR) << "Could not find contiguous low-memory space.";
261 saved_errno = ENOMEM;
Stuart Monteith8dba5aa2014-03-12 12:44:01 +0000262 }
263 } else {
264 actual = mmap(expected, page_aligned_byte_count, prot, flags, fd.get(), 0);
Brian Carlstromaa94cf32014-03-23 23:47:25 -0700265 saved_errno = errno;
Stuart Monteith8dba5aa2014-03-12 12:44:01 +0000266 }
267
268#else
269#ifdef __x86_64__
Qiming Shi84d49cc2014-04-24 15:38:41 +0800270 if (low_4gb && expected == nullptr) {
Ian Rogersef7d42f2014-01-06 12:55:46 -0800271 flags |= MAP_32BIT;
272 }
273#endif
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700274
275 void* actual = mmap(expected, page_aligned_byte_count, prot, flags, fd.get(), 0);
Brian Carlstromaa94cf32014-03-23 23:47:25 -0700276 saved_errno = errno;
Stuart Monteith8dba5aa2014-03-12 12:44:01 +0000277#endif
278
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700279 if (actual == MAP_FAILED) {
jeffhao8161c032012-10-31 15:50:00 -0700280 std::string maps;
281 ReadFileToString("/proc/self/maps", &maps);
Brian Carlstromaa94cf32014-03-23 23:47:25 -0700282
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700283 *error_msg = StringPrintf("Failed anonymous mmap(%p, %zd, 0x%x, 0x%x, %d, 0): %s\n%s",
284 expected, page_aligned_byte_count, prot, flags, fd.get(),
Brian Carlstromaa94cf32014-03-23 23:47:25 -0700285 strerror(saved_errno), maps.c_str());
Ian Rogers8d31bbd2013-10-13 10:44:14 -0700286 return nullptr;
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700287 }
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700288 std::ostringstream check_map_request_error_msg;
289 if (!CheckMapRequest(expected, actual, page_aligned_byte_count, &check_map_request_error_msg)) {
290 *error_msg = check_map_request_error_msg.str();
291 return nullptr;
292 }
293 return new MemMap(name, reinterpret_cast<byte*>(actual), byte_count, actual,
294 page_aligned_byte_count, prot);
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700295}
296
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700297MemMap* MemMap::MapFileAtAddress(byte* expected, size_t byte_count, int prot, int flags, int fd,
Ian Rogers8d31bbd2013-10-13 10:44:14 -0700298 off_t start, bool reuse, const char* filename,
299 std::string* error_msg) {
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700300 CHECK_NE(0, prot);
301 CHECK_NE(0, flags & (MAP_SHARED | MAP_PRIVATE));
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700302 if (reuse) {
303 // reuse means it is okay that it overlaps an existing page mapping.
304 // Only use this if you actually made the page reservation yourself.
305 CHECK(expected != nullptr);
306 flags |= MAP_FIXED;
307 } else {
308 CHECK_EQ(0, flags & MAP_FIXED);
309 }
310
Brian Carlstrom9004cb62013-07-26 15:48:31 -0700311 if (byte_count == 0) {
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700312 return new MemMap(filename, nullptr, 0, nullptr, 0, prot);
Brian Carlstrom9004cb62013-07-26 15:48:31 -0700313 }
Ian Rogersf8adc602013-04-18 17:06:19 -0700314 // Adjust 'offset' to be page-aligned as required by mmap.
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700315 int page_offset = start % kPageSize;
316 off_t page_aligned_offset = start - page_offset;
Ian Rogersf8adc602013-04-18 17:06:19 -0700317 // Adjust 'byte_count' to be page-aligned as we will map this anyway.
Elliott Hughesecd3a6f2012-06-06 18:16:37 -0700318 size_t page_aligned_byte_count = RoundUp(byte_count + page_offset, kPageSize);
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700319 // The 'expected' is modified (if specified, ie non-null) to be page aligned to the file but not
320 // necessarily to virtual memory. mmap will page align 'expected' for us.
321 byte* page_aligned_expected = (expected == nullptr) ? nullptr : (expected - page_offset);
322
323 byte* actual = reinterpret_cast<byte*>(mmap(page_aligned_expected,
Elliott Hughesecd3a6f2012-06-06 18:16:37 -0700324 page_aligned_byte_count,
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700325 prot,
326 flags,
327 fd,
328 page_aligned_offset));
329 if (actual == MAP_FAILED) {
Brian Carlstromaa94cf32014-03-23 23:47:25 -0700330 auto saved_errno = errno;
331
jeffhao8161c032012-10-31 15:50:00 -0700332 std::string maps;
333 ReadFileToString("/proc/self/maps", &maps);
Brian Carlstromaa94cf32014-03-23 23:47:25 -0700334
Mathieu Chartierc7cb1902014-03-05 14:41:03 -0800335 *error_msg = StringPrintf("mmap(%p, %zd, 0x%x, 0x%x, %d, %" PRId64
336 ") of file '%s' failed: %s\n%s",
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700337 page_aligned_expected, page_aligned_byte_count, prot, flags, fd,
Brian Carlstromaa94cf32014-03-23 23:47:25 -0700338 static_cast<int64_t>(page_aligned_offset), filename,
339 strerror(saved_errno), maps.c_str());
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700340 return nullptr;
341 }
342 std::ostringstream check_map_request_error_msg;
343 if (!CheckMapRequest(expected, actual, page_aligned_byte_count, &check_map_request_error_msg)) {
344 *error_msg = check_map_request_error_msg.str();
345 return nullptr;
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700346 }
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800347 return new MemMap(filename, actual + page_offset, byte_count, actual, page_aligned_byte_count,
Mathieu Chartier1c23e1e2012-10-12 14:14:11 -0700348 prot);
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700349}
350
351MemMap::~MemMap() {
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700352 if (base_begin_ == nullptr && base_size_ == 0) {
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700353 return;
354 }
Ian Rogers30fab402012-01-23 15:43:46 -0800355 int result = munmap(base_begin_, base_size_);
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700356 if (result == -1) {
357 PLOG(FATAL) << "munmap failed";
358 }
359}
360
Mathieu Chartier1c23e1e2012-10-12 14:14:11 -0700361MemMap::MemMap(const std::string& name, byte* begin, size_t size, void* base_begin,
362 size_t base_size, int prot)
363 : name_(name), begin_(begin), size_(size), base_begin_(base_begin), base_size_(base_size),
364 prot_(prot) {
Brian Carlstrom9004cb62013-07-26 15:48:31 -0700365 if (size_ == 0) {
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700366 CHECK(begin_ == nullptr);
367 CHECK(base_begin_ == nullptr);
Brian Carlstrom9004cb62013-07-26 15:48:31 -0700368 CHECK_EQ(base_size_, 0U);
369 } else {
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700370 CHECK(begin_ != nullptr);
371 CHECK(base_begin_ != nullptr);
Brian Carlstrom9004cb62013-07-26 15:48:31 -0700372 CHECK_NE(base_size_, 0U);
373 }
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700374};
375
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700376MemMap* MemMap::RemapAtEnd(byte* new_end, const char* tail_name, int tail_prot,
377 std::string* error_msg) {
Mathieu Chartiercc236d72012-07-20 10:29:05 -0700378 DCHECK_GE(new_end, Begin());
379 DCHECK_LE(new_end, End());
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700380 DCHECK_LE(begin_ + size_, reinterpret_cast<byte*>(base_begin_) + base_size_);
381 DCHECK(IsAligned<kPageSize>(begin_));
382 DCHECK(IsAligned<kPageSize>(base_begin_));
383 DCHECK(IsAligned<kPageSize>(reinterpret_cast<byte*>(base_begin_) + base_size_));
384 DCHECK(IsAligned<kPageSize>(new_end));
385 byte* old_end = begin_ + size_;
386 byte* old_base_end = reinterpret_cast<byte*>(base_begin_) + base_size_;
387 byte* new_base_end = new_end;
388 DCHECK_LE(new_base_end, old_base_end);
389 if (new_base_end == old_base_end) {
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700390 return new MemMap(tail_name, nullptr, 0, nullptr, 0, tail_prot);
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700391 }
392 size_ = new_end - reinterpret_cast<byte*>(begin_);
393 base_size_ = new_base_end - reinterpret_cast<byte*>(base_begin_);
394 DCHECK_LE(begin_ + size_, reinterpret_cast<byte*>(base_begin_) + base_size_);
395 size_t tail_size = old_end - new_end;
396 byte* tail_base_begin = new_base_end;
397 size_t tail_base_size = old_base_end - new_base_end;
398 DCHECK_EQ(tail_base_begin + tail_base_size, old_base_end);
399 DCHECK(IsAligned<kPageSize>(tail_base_size));
400
401#ifdef USE_ASHMEM
402 // android_os_Debug.cpp read_mapinfo assumes all ashmem regions associated with the VM are
403 // prefixed "dalvik-".
404 std::string debug_friendly_name("dalvik-");
405 debug_friendly_name += tail_name;
406 ScopedFd fd(ashmem_create_region(debug_friendly_name.c_str(), tail_base_size));
Stuart Monteith8dba5aa2014-03-12 12:44:01 +0000407 int flags = MAP_PRIVATE | MAP_FIXED;
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700408 if (fd.get() == -1) {
409 *error_msg = StringPrintf("ashmem_create_region failed for '%s': %s",
410 tail_name, strerror(errno));
411 return nullptr;
412 }
413#else
414 ScopedFd fd(-1);
415 int flags = MAP_PRIVATE | MAP_ANONYMOUS;
416#endif
417
418 // Unmap/map the tail region.
419 int result = munmap(tail_base_begin, tail_base_size);
420 if (result == -1) {
421 std::string maps;
422 ReadFileToString("/proc/self/maps", &maps);
423 *error_msg = StringPrintf("munmap(%p, %zd) failed for '%s'\n%s",
424 tail_base_begin, tail_base_size, name_.c_str(),
425 maps.c_str());
426 return nullptr;
427 }
428 // Don't cause memory allocation between the munmap and the mmap
429 // calls. Otherwise, libc (or something else) might take this memory
430 // region. Note this isn't perfect as there's no way to prevent
431 // other threads to try to take this memory region here.
432 byte* actual = reinterpret_cast<byte*>(mmap(tail_base_begin, tail_base_size, tail_prot,
433 flags, fd.get(), 0));
434 if (actual == MAP_FAILED) {
435 std::string maps;
436 ReadFileToString("/proc/self/maps", &maps);
Mathieu Chartierc7cb1902014-03-05 14:41:03 -0800437 *error_msg = StringPrintf("anonymous mmap(%p, %zd, 0x%x, 0x%x, %d, 0) failed\n%s",
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700438 tail_base_begin, tail_base_size, tail_prot, flags, fd.get(),
439 maps.c_str());
440 return nullptr;
441 }
442 return new MemMap(tail_name, actual, tail_size, actual, tail_base_size, tail_prot);
Mathieu Chartiercc236d72012-07-20 10:29:05 -0700443}
Logan Chiend88fa262012-06-06 15:23:32 +0800444
445bool MemMap::Protect(int prot) {
Hiroshi Yamauchi4fb5df82014-03-13 15:10:27 -0700446 if (base_begin_ == nullptr && base_size_ == 0) {
Ian Rogers1c849e52012-06-28 14:00:33 -0700447 prot_ = prot;
Logan Chiend88fa262012-06-06 15:23:32 +0800448 return true;
449 }
450
451 if (mprotect(base_begin_, base_size_, prot) == 0) {
Ian Rogers1c849e52012-06-28 14:00:33 -0700452 prot_ = prot;
Logan Chiend88fa262012-06-06 15:23:32 +0800453 return true;
454 }
455
Shih-wei Liaoa060ed92012-06-07 09:25:28 -0700456 PLOG(ERROR) << "mprotect(" << reinterpret_cast<void*>(base_begin_) << ", " << base_size_ << ", "
457 << prot << ") failed";
Logan Chiend88fa262012-06-06 15:23:32 +0800458 return false;
459}
460
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800461std::ostream& operator<<(std::ostream& os, const MemMap& mem_map) {
Mathieu Chartierc7cb1902014-03-05 14:41:03 -0800462 os << StringPrintf("[MemMap: %s prot=0x%x %p-%p]",
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800463 mem_map.GetName().c_str(), mem_map.GetProtect(),
464 mem_map.BaseBegin(), mem_map.BaseEnd());
465 return os;
466}
467
Brian Carlstrom27ec9612011-09-19 20:20:38 -0700468} // namespace art