blob: d8908ad60363aafb0f333e17ac5996bb605b8125 [file] [log] [blame]
Brian Carlstromdb4d5402011-08-09 12:18:28 -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
Brian Carlstromfc0e3212013-07-17 14:40:12 -070017#ifndef ART_RUNTIME_MEM_MAP_H_
18#define ART_RUNTIME_MEM_MAP_H_
Brian Carlstromdb4d5402011-08-09 12:18:28 -070019
Brian Carlstrom27ec9612011-09-19 20:20:38 -070020#include <stddef.h>
21#include <sys/types.h>
Brian Carlstromdb4d5402011-08-09 12:18:28 -070022
Andreas Gampe0dfc3152017-04-24 07:58:06 -070023#include <map>
24#include <mutex>
25#include <string>
26
27#include "android-base/thread_annotations.h"
David Sehrd1dbb742017-07-17 11:20:38 -070028#include "android-base/unique_fd.h"
Brian Carlstromdb4d5402011-08-09 12:18:28 -070029
30namespace art {
31
Andreas Gampe651ba592017-06-14 14:41:33 -070032#if defined(__LP64__) && (defined(__aarch64__) || defined(__mips__) || defined(__APPLE__))
Ian Rogersc3ccc102014-06-25 11:52:14 -070033#define USE_ART_LOW_4G_ALLOCATOR 1
34#else
Andreas Gampe651ba592017-06-14 14:41:33 -070035#if defined(__LP64__) && !defined(__x86_64__)
36#error "Unrecognized 64-bit architecture."
37#endif
Ian Rogersc3ccc102014-06-25 11:52:14 -070038#define USE_ART_LOW_4G_ALLOCATOR 0
39#endif
40
David Sehrd1dbb742017-07-17 11:20:38 -070041using android::base::unique_fd;
42
Ian Rogersc5f17732014-06-05 20:48:42 -070043#ifdef __linux__
44static constexpr bool kMadviseZeroes = true;
45#else
46static constexpr bool kMadviseZeroes = false;
47#endif
48
Brian Carlstromdb4d5402011-08-09 12:18:28 -070049// Used to keep track of mmap segments.
Andreas Gamped8f26db2014-05-19 17:01:13 -070050//
51// On 64b systems not supporting MAP_32BIT, the implementation of MemMap will do a linear scan
52// for free pages. For security, the start of this scan should be randomized. This requires a
53// dynamic initializer.
54// For this to work, it is paramount that there are no other static initializers that access MemMap.
55// Otherwise, calls might see uninitialized values.
Brian Carlstromdb4d5402011-08-09 12:18:28 -070056class MemMap {
57 public:
Elliott Hughesecd3a6f2012-06-06 18:16:37 -070058 // Request an anonymous region of length 'byte_count' and a requested base address.
Mathieu Chartier2cebb242015-04-21 16:50:40 -070059 // Use null as the requested base address if you don't care.
Vladimir Marko5c42c292015-02-25 12:02:49 +000060 // "reuse" allows re-mapping an address range from an existing mapping.
Elliott Hughes6c9c06d2011-11-07 16:43:47 -080061 //
62 // The word "anonymous" in this context means "not backed by a file". The supplied
Nicolas Geoffraya25dce92016-01-12 16:41:10 +000063 // 'name' will be used -- on systems that support it -- to give the mapping
Elliott Hughes6c9c06d2011-11-07 16:43:47 -080064 // a name.
Brian Carlstrom4a289ed2011-08-16 17:17:49 -070065 //
Mathieu Chartier2cebb242015-04-21 16:50:40 -070066 // On success, returns returns a MemMap instance. On failure, returns null.
Nicolas Geoffraya25dce92016-01-12 16:41:10 +000067 static MemMap* MapAnonymous(const char* name,
Mathieu Chartier42bddce2015-11-09 15:16:56 -080068 uint8_t* addr,
69 size_t byte_count,
70 int prot,
71 bool low_4gb,
72 bool reuse,
Nicolas Geoffraya25dce92016-01-12 16:41:10 +000073 std::string* error_msg,
Nicolas Geoffray58a73d22016-11-29 21:49:43 +000074 bool use_ashmem = true);
Brian Carlstromdb4d5402011-08-09 12:18:28 -070075
David Srbecky1baabf02015-06-16 17:12:34 +000076 // Create placeholder for a region allocated by direct call to mmap.
77 // This is useful when we do not have control over the code calling mmap,
78 // but when we still want to keep track of it in the list.
79 // The region is not considered to be owned and will not be unmmaped.
80 static MemMap* MapDummy(const char* name, uint8_t* addr, size_t byte_count);
81
Brian Carlstromdb4d5402011-08-09 12:18:28 -070082 // Map part of a file, taking care of non-page aligned offsets. The
83 // "start" offset is absolute, not relative.
84 //
Mathieu Chartier2cebb242015-04-21 16:50:40 -070085 // On success, returns returns a MemMap instance. On failure, returns null.
Mathieu Chartier42bddce2015-11-09 15:16:56 -080086 static MemMap* MapFile(size_t byte_count,
87 int prot,
88 int flags,
89 int fd,
90 off_t start,
91 bool low_4gb,
92 const char* filename,
93 std::string* error_msg) {
94 return MapFileAtAddress(nullptr,
95 byte_count,
96 prot,
97 flags,
98 fd,
99 start,
100 /*low_4gb*/low_4gb,
101 /*reuse*/false,
102 filename,
103 error_msg);
Brian Carlstrom4a289ed2011-08-16 17:17:49 -0700104 }
105
Mathieu Chartierebe2dfc2015-11-24 13:47:52 -0800106 // Map part of a file, taking care of non-page aligned offsets. The "start" offset is absolute,
107 // not relative. This version allows requesting a specific address for the base of the mapping.
108 // "reuse" allows us to create a view into an existing mapping where we do not take ownership of
109 // the memory. If error_msg is null then we do not print /proc/maps to the log if
110 // MapFileAtAddress fails. This helps improve performance of the fail case since reading and
111 // printing /proc/maps takes several milliseconds in the worst case.
Brian Carlstrom4a289ed2011-08-16 17:17:49 -0700112 //
Mathieu Chartier2cebb242015-04-21 16:50:40 -0700113 // On success, returns returns a MemMap instance. On failure, returns null.
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800114 static MemMap* MapFileAtAddress(uint8_t* addr,
115 size_t byte_count,
116 int prot,
117 int flags,
118 int fd,
119 off_t start,
120 bool low_4gb,
121 bool reuse,
122 const char* filename,
Ian Rogers8d31bbd2013-10-13 10:44:14 -0700123 std::string* error_msg);
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700124
Mathieu Chartier2cebb242015-04-21 16:50:40 -0700125 // Releases the memory mapping.
David Sehr1b14fb82017-02-01 10:42:11 -0800126 ~MemMap() REQUIRES(!MemMap::mem_maps_lock_);
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700127
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800128 const std::string& GetName() const {
129 return name_;
130 }
131
Vladimir Marko9bdf1082016-01-21 12:15:52 +0000132 bool Sync();
133
Logan Chiend88fa262012-06-06 15:23:32 +0800134 bool Protect(int prot);
135
Ian Rogersc5f17732014-06-05 20:48:42 -0700136 void MadviseDontNeedAndZero();
137
Ian Rogers1c849e52012-06-28 14:00:33 -0700138 int GetProtect() const {
139 return prot_;
140 }
141
Ian Rogers13735952014-10-08 12:43:28 -0700142 uint8_t* Begin() const {
Ian Rogers30fab402012-01-23 15:43:46 -0800143 return begin_;
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700144 }
145
Ian Rogers30fab402012-01-23 15:43:46 -0800146 size_t Size() const {
147 return size_;
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700148 }
149
Mathieu Chartier379d09f2015-01-08 11:28:13 -0800150 // Resize the mem-map by unmapping pages at the end. Currently only supports shrinking.
151 void SetSize(size_t new_size);
152
Ian Rogers13735952014-10-08 12:43:28 -0700153 uint8_t* End() const {
Mathieu Chartier2fde5332012-09-14 14:51:54 -0700154 return Begin() + Size();
155 }
156
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800157 void* BaseBegin() const {
158 return base_begin_;
159 }
160
161 size_t BaseSize() const {
162 return base_size_;
163 }
164
165 void* BaseEnd() const {
Ian Rogers13735952014-10-08 12:43:28 -0700166 return reinterpret_cast<uint8_t*>(BaseBegin()) + BaseSize();
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800167 }
168
Mathieu Chartier2fde5332012-09-14 14:51:54 -0700169 bool HasAddress(const void* addr) const {
170 return Begin() <= addr && addr < End();
Brian Carlstromb765be02011-08-17 23:54:10 -0700171 }
172
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700173 // Unmap the pages at end and remap them to create another memory map.
David Sehrd1dbb742017-07-17 11:20:38 -0700174 // sharing_flags should be either MAP_PRIVATE or MAP_SHARED.
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800175 MemMap* RemapAtEnd(uint8_t* new_end,
176 const char* tail_name,
177 int tail_prot,
David Sehrd1dbb742017-07-17 11:20:38 -0700178 int sharing_flags,
Nicolas Geoffraya25dce92016-01-12 16:41:10 +0000179 std::string* error_msg,
David Sehrd1dbb742017-07-17 11:20:38 -0700180 bool use_ashmem = true,
181 unique_fd* shmem_fd = nullptr);
Mathieu Chartiercc236d72012-07-20 10:29:05 -0700182
Hiroshi Yamauchi3eed93d2014-06-04 11:43:59 -0700183 static bool CheckNoGaps(MemMap* begin_map, MemMap* end_map)
David Sehr1b14fb82017-02-01 10:42:11 -0800184 REQUIRES(!MemMap::mem_maps_lock_);
Vladimir Marko17a924a2015-05-08 15:17:32 +0100185 static void DumpMaps(std::ostream& os, bool terse = false)
David Sehr1b14fb82017-02-01 10:42:11 -0800186 REQUIRES(!MemMap::mem_maps_lock_);
Hiroshi Yamauchi3eed93d2014-06-04 11:43:59 -0700187
David Sehr1b14fb82017-02-01 10:42:11 -0800188 // Init and Shutdown are NOT thread safe.
189 // Both may be called multiple times and MemMap objects may be created any
190 // time after the first call to Init and before the first call to Shutodwn.
191 static void Init() REQUIRES(!MemMap::mem_maps_lock_);
192 static void Shutdown() REQUIRES(!MemMap::mem_maps_lock_);
Mathieu Chartier6e88ef62014-10-14 15:01:24 -0700193
Hiroshi Yamauchi6edb9ae2016-02-08 14:18:21 -0800194 // If the map is PROT_READ, try to read each page of the map to check it is in fact readable (not
195 // faulting). This is used to diagnose a bug b/19894268 where mprotect doesn't seem to be working
196 // intermittently.
197 void TryReadable();
198
Hiroshi Yamauchi3c3c4a12017-02-21 16:49:59 -0800199 // Align the map by unmapping the unaligned parts at the lower and the higher ends.
200 void AlignBy(size_t size);
201
Andreas Gampe0dfc3152017-04-24 07:58:06 -0700202 // For annotation reasons.
203 static std::mutex* GetMemMapsLock() RETURN_CAPABILITY(mem_maps_lock_) {
204 return nullptr;
205 }
206
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700207 private:
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800208 MemMap(const std::string& name,
209 uint8_t* begin,
210 size_t size,
211 void* base_begin,
212 size_t base_size,
213 int prot,
214 bool reuse,
David Sehr1b14fb82017-02-01 10:42:11 -0800215 size_t redzone_size = 0) REQUIRES(!MemMap::mem_maps_lock_);
Hiroshi Yamauchi3eed93d2014-06-04 11:43:59 -0700216
Vladimir Marko17a924a2015-05-08 15:17:32 +0100217 static void DumpMapsLocked(std::ostream& os, bool terse)
David Sehr1b14fb82017-02-01 10:42:11 -0800218 REQUIRES(MemMap::mem_maps_lock_);
Hiroshi Yamauchi3eed93d2014-06-04 11:43:59 -0700219 static bool HasMemMap(MemMap* map)
David Sehr1b14fb82017-02-01 10:42:11 -0800220 REQUIRES(MemMap::mem_maps_lock_);
Hiroshi Yamauchi3eed93d2014-06-04 11:43:59 -0700221 static MemMap* GetLargestMemMapAt(void* address)
David Sehr1b14fb82017-02-01 10:42:11 -0800222 REQUIRES(MemMap::mem_maps_lock_);
Mathieu Chartiere58991b2015-10-13 07:59:34 -0700223 static bool ContainedWithinExistingMap(uint8_t* ptr, size_t size, std::string* error_msg)
David Sehr1b14fb82017-02-01 10:42:11 -0800224 REQUIRES(!MemMap::mem_maps_lock_);
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700225
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800226 // Internal version of mmap that supports low 4gb emulation.
227 static void* MapInternal(void* addr,
228 size_t length,
229 int prot,
230 int flags,
231 int fd,
232 off_t offset,
Andreas Gampe651ba592017-06-14 14:41:33 -0700233 bool low_4gb)
234 REQUIRES(!MemMap::mem_maps_lock_);
235 static void* MapInternalArtLow4GBAllocator(size_t length,
236 int prot,
237 int flags,
238 int fd,
239 off_t offset)
240 REQUIRES(!MemMap::mem_maps_lock_);
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800241
Jim_Guoa62a5882014-04-28 11:11:57 +0800242 const std::string name_;
Hiroshi Yamauchi3c3c4a12017-02-21 16:49:59 -0800243 uint8_t* begin_; // Start of data. May be changed by AlignBy.
Mathieu Chartiercc236d72012-07-20 10:29:05 -0700244 size_t size_; // Length of data.
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700245
Hiroshi Yamauchi3c3c4a12017-02-21 16:49:59 -0800246 void* base_begin_; // Page-aligned base address. May be changed by AlignBy.
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700247 size_t base_size_; // Length of mapping. May be changed by RemapAtEnd (ie Zygote).
Ian Rogers1c849e52012-06-28 14:00:33 -0700248 int prot_; // Protection of the map.
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700249
Jim_Guoa62a5882014-04-28 11:11:57 +0800250 // When reuse_ is true, this is just a view of an existing mapping
251 // and we do not take ownership and are not responsible for
252 // unmapping.
253 const bool reuse_;
254
Evgenii Stepanov1e133742015-05-20 12:30:59 -0700255 const size_t redzone_size_;
256
Ian Rogersc3ccc102014-06-25 11:52:14 -0700257#if USE_ART_LOW_4G_ALLOCATOR
258 static uintptr_t next_mem_pos_; // Next memory location to check for low_4g extent.
Stuart Monteith8dba5aa2014-03-12 12:44:01 +0000259#endif
260
David Sehr1b14fb82017-02-01 10:42:11 -0800261 static std::mutex* mem_maps_lock_;
262
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700263 friend class MemMapTest; // To allow access to base_begin_ and base_size_.
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700264};
Mathieu Chartier6e6078a2016-10-24 15:45:41 -0700265
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800266std::ostream& operator<<(std::ostream& os, const MemMap& mem_map);
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700267
Mathieu Chartier6e6078a2016-10-24 15:45:41 -0700268// Zero and release pages if possible, no requirements on alignments.
269void ZeroAndReleasePages(void* address, size_t length);
270
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700271} // namespace art
272
Brian Carlstromfc0e3212013-07-17 14:40:12 -0700273#endif // ART_RUNTIME_MEM_MAP_H_