blob: 525fade9c1f49ce407f55c4c8ba93c1a99476343 [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
David Sehr79e26072018-04-06 17:58:50 -070017#ifndef ART_LIBARTBASE_BASE_MEM_MAP_H_
18#define ART_LIBARTBASE_BASE_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>
Igor Murashkin5573c372017-11-16 13:34:30 -080024#include <mutex>
Andreas Gampe0dfc3152017-04-24 07:58:06 -070025#include <string>
26
27#include "android-base/thread_annotations.h"
David Sehr1979c642018-04-26 14:41:18 -070028#include "macros.h"
Brian Carlstromdb4d5402011-08-09 12:18:28 -070029
30namespace art {
31
Steve Austin882ed6b2018-06-08 11:40:38 -070032#if defined(__LP64__) && !defined(__Fuchsia__) && \
33 (defined(__aarch64__) || defined(__mips__) || defined(__APPLE__))
Ian Rogersc3ccc102014-06-25 11:52:14 -070034#define USE_ART_LOW_4G_ALLOCATOR 1
35#else
Steve Austin882ed6b2018-06-08 11:40:38 -070036#if defined(__LP64__) && !defined(__Fuchsia__) && !defined(__x86_64__)
Andreas Gampe651ba592017-06-14 14:41:33 -070037#error "Unrecognized 64-bit architecture."
38#endif
Ian Rogersc3ccc102014-06-25 11:52:14 -070039#define USE_ART_LOW_4G_ALLOCATOR 0
40#endif
41
Ian Rogersc5f17732014-06-05 20:48:42 -070042#ifdef __linux__
43static constexpr bool kMadviseZeroes = true;
Alex Lightca97ada2018-02-02 09:25:31 -080044#define HAVE_MREMAP_SYSCALL true
Ian Rogersc5f17732014-06-05 20:48:42 -070045#else
46static constexpr bool kMadviseZeroes = false;
Alex Lightca97ada2018-02-02 09:25:31 -080047// We cannot ever perform MemMap::ReplaceWith on non-linux hosts since the syscall is not
48// present.
49#define HAVE_MREMAP_SYSCALL false
Ian Rogersc5f17732014-06-05 20:48:42 -070050#endif
51
Brian Carlstromdb4d5402011-08-09 12:18:28 -070052// Used to keep track of mmap segments.
Andreas Gamped8f26db2014-05-19 17:01:13 -070053//
54// On 64b systems not supporting MAP_32BIT, the implementation of MemMap will do a linear scan
55// for free pages. For security, the start of this scan should be randomized. This requires a
56// dynamic initializer.
57// For this to work, it is paramount that there are no other static initializers that access MemMap.
58// Otherwise, calls might see uninitialized values.
Brian Carlstromdb4d5402011-08-09 12:18:28 -070059class MemMap {
60 public:
Alex Lightca97ada2018-02-02 09:25:31 -080061 static constexpr bool kCanReplaceMapping = HAVE_MREMAP_SYSCALL;
62
Vladimir Markoc34bebf2018-08-16 16:12:49 +010063 // Creates an invalid mapping.
64 MemMap() {}
65
66 // Creates an invalid mapping. Used when we want to be more explicit than MemMap().
67 static MemMap Invalid() {
68 return MemMap();
69 }
70
71 MemMap(MemMap&& other) REQUIRES(!MemMap::mem_maps_lock_);
72 MemMap& operator=(MemMap&& other) REQUIRES(!MemMap::mem_maps_lock_) {
73 Reset();
74 swap(other);
75 return *this;
76 }
77
78 // Releases the memory mapping.
79 ~MemMap() REQUIRES(!MemMap::mem_maps_lock_);
80
81 // Swap two MemMaps.
82 void swap(MemMap& other);
83
84 void Reset() {
85 if (IsValid()) {
86 DoReset();
87 }
88 }
89
90 bool IsValid() const {
91 return base_size_ != 0u;
92 }
93
Alex Lightca97ada2018-02-02 09:25:31 -080094 // Replace the data in this memmmap with the data in the memmap pointed to by source. The caller
95 // relinquishes ownership of the source mmap.
96 //
97 // For the call to be successful:
98 // * The range [dest->Begin, dest->Begin() + source->Size()] must not overlap with
99 // [source->Begin(), source->End()].
100 // * Neither source nor dest may be 'reused' mappings (they must own all the pages associated
101 // with them.
102 // * kCanReplaceMapping must be true.
103 // * Neither source nor dest may use manual redzones.
104 // * Both source and dest must have the same offset from the nearest page boundary.
105 // * mremap must succeed when called on the mappings.
106 //
107 // If this call succeeds it will return true and:
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100108 // * Invalidate *source
Alex Lightca97ada2018-02-02 09:25:31 -0800109 // * The protection of this will remain the same.
110 // * The size of this will be the size of the source
111 // * The data in this will be the data from source.
112 //
113 // If this call fails it will return false and make no changes to *source or this. The ownership
114 // of the source mmap is returned to the caller.
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100115 bool ReplaceWith(/*in-out*/MemMap* source, /*out*/std::string* error);
Alex Lightca97ada2018-02-02 09:25:31 -0800116
Elliott Hughesecd3a6f2012-06-06 18:16:37 -0700117 // Request an anonymous region of length 'byte_count' and a requested base address.
Mathieu Chartier2cebb242015-04-21 16:50:40 -0700118 // Use null as the requested base address if you don't care.
Vladimir Marko5c42c292015-02-25 12:02:49 +0000119 // "reuse" allows re-mapping an address range from an existing mapping.
Elliott Hughes6c9c06d2011-11-07 16:43:47 -0800120 //
121 // The word "anonymous" in this context means "not backed by a file". The supplied
Nicolas Geoffraya25dce92016-01-12 16:41:10 +0000122 // 'name' will be used -- on systems that support it -- to give the mapping
Elliott Hughes6c9c06d2011-11-07 16:43:47 -0800123 // a name.
Brian Carlstrom4a289ed2011-08-16 17:17:49 -0700124 //
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100125 // On success, returns returns a valid MemMap. On failure, returns an invalid MemMap.
126 static MemMap MapAnonymous(const char* name,
127 uint8_t* addr,
128 size_t byte_count,
129 int prot,
130 bool low_4gb,
131 bool reuse,
132 std::string* error_msg,
133 bool use_ashmem = true);
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700134
David Srbecky1baabf02015-06-16 17:12:34 +0000135 // Create placeholder for a region allocated by direct call to mmap.
136 // This is useful when we do not have control over the code calling mmap,
137 // but when we still want to keep track of it in the list.
138 // The region is not considered to be owned and will not be unmmaped.
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100139 static MemMap MapDummy(const char* name, uint8_t* addr, size_t byte_count);
David Srbecky1baabf02015-06-16 17:12:34 +0000140
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700141 // Map part of a file, taking care of non-page aligned offsets. The
142 // "start" offset is absolute, not relative.
143 //
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100144 // On success, returns returns a valid MemMap. On failure, returns an invalid MemMap.
145 static MemMap MapFile(size_t byte_count,
146 int prot,
147 int flags,
148 int fd,
149 off_t start,
150 bool low_4gb,
151 const char* filename,
152 std::string* error_msg) {
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800153 return MapFileAtAddress(nullptr,
154 byte_count,
155 prot,
156 flags,
157 fd,
158 start,
159 /*low_4gb*/low_4gb,
160 /*reuse*/false,
161 filename,
162 error_msg);
Brian Carlstrom4a289ed2011-08-16 17:17:49 -0700163 }
164
Mathieu Chartierebe2dfc2015-11-24 13:47:52 -0800165 // Map part of a file, taking care of non-page aligned offsets. The "start" offset is absolute,
166 // not relative. This version allows requesting a specific address for the base of the mapping.
167 // "reuse" allows us to create a view into an existing mapping where we do not take ownership of
168 // the memory. If error_msg is null then we do not print /proc/maps to the log if
169 // MapFileAtAddress fails. This helps improve performance of the fail case since reading and
170 // printing /proc/maps takes several milliseconds in the worst case.
Brian Carlstrom4a289ed2011-08-16 17:17:49 -0700171 //
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100172 // On success, returns returns a valid MemMap. On failure, returns an invalid MemMap.
173 static MemMap MapFileAtAddress(uint8_t* addr,
174 size_t byte_count,
175 int prot,
176 int flags,
177 int fd,
178 off_t start,
179 bool low_4gb,
180 bool reuse,
181 const char* filename,
182 std::string* error_msg);
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700183
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800184 const std::string& GetName() const {
185 return name_;
186 }
187
Vladimir Marko9bdf1082016-01-21 12:15:52 +0000188 bool Sync();
189
Logan Chiend88fa262012-06-06 15:23:32 +0800190 bool Protect(int prot);
191
Ian Rogersc5f17732014-06-05 20:48:42 -0700192 void MadviseDontNeedAndZero();
193
Ian Rogers1c849e52012-06-28 14:00:33 -0700194 int GetProtect() const {
195 return prot_;
196 }
197
Ian Rogers13735952014-10-08 12:43:28 -0700198 uint8_t* Begin() const {
Ian Rogers30fab402012-01-23 15:43:46 -0800199 return begin_;
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700200 }
201
Ian Rogers30fab402012-01-23 15:43:46 -0800202 size_t Size() const {
203 return size_;
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700204 }
205
Mathieu Chartier379d09f2015-01-08 11:28:13 -0800206 // Resize the mem-map by unmapping pages at the end. Currently only supports shrinking.
207 void SetSize(size_t new_size);
208
Ian Rogers13735952014-10-08 12:43:28 -0700209 uint8_t* End() const {
Mathieu Chartier2fde5332012-09-14 14:51:54 -0700210 return Begin() + Size();
211 }
212
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800213 void* BaseBegin() const {
214 return base_begin_;
215 }
216
217 size_t BaseSize() const {
218 return base_size_;
219 }
220
221 void* BaseEnd() const {
Ian Rogers13735952014-10-08 12:43:28 -0700222 return reinterpret_cast<uint8_t*>(BaseBegin()) + BaseSize();
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800223 }
224
Mathieu Chartier2fde5332012-09-14 14:51:54 -0700225 bool HasAddress(const void* addr) const {
226 return Begin() <= addr && addr < End();
Brian Carlstromb765be02011-08-17 23:54:10 -0700227 }
228
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700229 // Unmap the pages at end and remap them to create another memory map.
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100230 MemMap RemapAtEnd(uint8_t* new_end,
231 const char* tail_name,
232 int tail_prot,
233 std::string* error_msg,
234 bool use_ashmem = true);
Mathieu Chartiercc236d72012-07-20 10:29:05 -0700235
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100236 static bool CheckNoGaps(MemMap& begin_map, MemMap& end_map)
David Sehr1b14fb82017-02-01 10:42:11 -0800237 REQUIRES(!MemMap::mem_maps_lock_);
Vladimir Marko17a924a2015-05-08 15:17:32 +0100238 static void DumpMaps(std::ostream& os, bool terse = false)
David Sehr1b14fb82017-02-01 10:42:11 -0800239 REQUIRES(!MemMap::mem_maps_lock_);
Hiroshi Yamauchi3eed93d2014-06-04 11:43:59 -0700240
David Sehr1b14fb82017-02-01 10:42:11 -0800241 // Init and Shutdown are NOT thread safe.
242 // Both may be called multiple times and MemMap objects may be created any
243 // time after the first call to Init and before the first call to Shutodwn.
244 static void Init() REQUIRES(!MemMap::mem_maps_lock_);
245 static void Shutdown() REQUIRES(!MemMap::mem_maps_lock_);
Mathieu Chartier6e88ef62014-10-14 15:01:24 -0700246
Hiroshi Yamauchi6edb9ae2016-02-08 14:18:21 -0800247 // If the map is PROT_READ, try to read each page of the map to check it is in fact readable (not
248 // faulting). This is used to diagnose a bug b/19894268 where mprotect doesn't seem to be working
249 // intermittently.
250 void TryReadable();
251
Hiroshi Yamauchi3c3c4a12017-02-21 16:49:59 -0800252 // Align the map by unmapping the unaligned parts at the lower and the higher ends.
253 void AlignBy(size_t size);
254
Andreas Gampe0dfc3152017-04-24 07:58:06 -0700255 // For annotation reasons.
256 static std::mutex* GetMemMapsLock() RETURN_CAPABILITY(mem_maps_lock_) {
257 return nullptr;
258 }
259
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700260 private:
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800261 MemMap(const std::string& name,
262 uint8_t* begin,
263 size_t size,
264 void* base_begin,
265 size_t base_size,
266 int prot,
267 bool reuse,
David Sehr1b14fb82017-02-01 10:42:11 -0800268 size_t redzone_size = 0) REQUIRES(!MemMap::mem_maps_lock_);
Hiroshi Yamauchi3eed93d2014-06-04 11:43:59 -0700269
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100270 void DoReset();
271 void Invalidate();
272 void SwapMembers(MemMap& other);
273
Vladimir Marko17a924a2015-05-08 15:17:32 +0100274 static void DumpMapsLocked(std::ostream& os, bool terse)
David Sehr1b14fb82017-02-01 10:42:11 -0800275 REQUIRES(MemMap::mem_maps_lock_);
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100276 static bool HasMemMap(MemMap& map)
David Sehr1b14fb82017-02-01 10:42:11 -0800277 REQUIRES(MemMap::mem_maps_lock_);
Hiroshi Yamauchi3eed93d2014-06-04 11:43:59 -0700278 static MemMap* GetLargestMemMapAt(void* address)
David Sehr1b14fb82017-02-01 10:42:11 -0800279 REQUIRES(MemMap::mem_maps_lock_);
Mathieu Chartiere58991b2015-10-13 07:59:34 -0700280 static bool ContainedWithinExistingMap(uint8_t* ptr, size_t size, std::string* error_msg)
David Sehr1b14fb82017-02-01 10:42:11 -0800281 REQUIRES(!MemMap::mem_maps_lock_);
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700282
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800283 // Internal version of mmap that supports low 4gb emulation.
284 static void* MapInternal(void* addr,
285 size_t length,
286 int prot,
287 int flags,
288 int fd,
289 off_t offset,
Andreas Gampe651ba592017-06-14 14:41:33 -0700290 bool low_4gb)
291 REQUIRES(!MemMap::mem_maps_lock_);
292 static void* MapInternalArtLow4GBAllocator(size_t length,
293 int prot,
294 int flags,
295 int fd,
296 off_t offset)
297 REQUIRES(!MemMap::mem_maps_lock_);
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800298
Steve Austin882ed6b2018-06-08 11:40:38 -0700299 // member function to access real_munmap
300 static bool CheckMapRequest(uint8_t* expected_ptr,
301 void* actual_ptr,
302 size_t byte_count,
303 std::string* error_msg);
304
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100305 std::string name_;
306 uint8_t* begin_ = nullptr; // Start of data. May be changed by AlignBy.
307 size_t size_ = 0u; // Length of data.
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700308
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100309 void* base_begin_ = nullptr; // Page-aligned base address. May be changed by AlignBy.
310 size_t base_size_ = 0u; // Length of mapping. May be changed by RemapAtEnd (ie Zygote).
311 int prot_ = 0; // Protection of the map.
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700312
Jim_Guoa62a5882014-04-28 11:11:57 +0800313 // When reuse_ is true, this is just a view of an existing mapping
314 // and we do not take ownership and are not responsible for
315 // unmapping.
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100316 bool reuse_ = false;
Jim_Guoa62a5882014-04-28 11:11:57 +0800317
Alex Lightca97ada2018-02-02 09:25:31 -0800318 // When already_unmapped_ is true the destructor will not call munmap.
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100319 bool already_unmapped_ = false;
Alex Lightca97ada2018-02-02 09:25:31 -0800320
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100321 size_t redzone_size_ = 0u;
Evgenii Stepanov1e133742015-05-20 12:30:59 -0700322
Ian Rogersc3ccc102014-06-25 11:52:14 -0700323#if USE_ART_LOW_4G_ALLOCATOR
324 static uintptr_t next_mem_pos_; // Next memory location to check for low_4g extent.
Steve Austin882ed6b2018-06-08 11:40:38 -0700325
326 static void* TryMemMapLow4GB(void* ptr,
327 size_t page_aligned_byte_count,
328 int prot,
329 int flags,
330 int fd,
331 off_t offset);
Stuart Monteith8dba5aa2014-03-12 12:44:01 +0000332#endif
333
Steve Austin882ed6b2018-06-08 11:40:38 -0700334 static void TargetMMapInit();
335 static void* TargetMMap(void* start, size_t len, int prot, int flags, int fd, off_t fd_off);
336 static int TargetMUnmap(void* start, size_t len);
337
David Sehr1b14fb82017-02-01 10:42:11 -0800338 static std::mutex* mem_maps_lock_;
339
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700340 friend class MemMapTest; // To allow access to base_begin_ and base_size_.
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700341};
Mathieu Chartier6e6078a2016-10-24 15:45:41 -0700342
Vladimir Markoc34bebf2018-08-16 16:12:49 +0100343inline void swap(MemMap& lhs, MemMap& rhs) {
344 lhs.swap(rhs);
345}
346
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800347std::ostream& operator<<(std::ostream& os, const MemMap& mem_map);
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700348
Mathieu Chartier6e6078a2016-10-24 15:45:41 -0700349// Zero and release pages if possible, no requirements on alignments.
350void ZeroAndReleasePages(void* address, size_t length);
351
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700352} // namespace art
353
David Sehr79e26072018-04-06 17:58:50 -0700354#endif // ART_LIBARTBASE_BASE_MEM_MAP_H_