blob: 5603963eacf614c713968bfce5b59bb10cc48361 [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"
Brian Carlstromdb4d5402011-08-09 12:18:28 -070028
29namespace art {
30
Andreas Gampe651ba592017-06-14 14:41:33 -070031#if defined(__LP64__) && (defined(__aarch64__) || defined(__mips__) || defined(__APPLE__))
Ian Rogersc3ccc102014-06-25 11:52:14 -070032#define USE_ART_LOW_4G_ALLOCATOR 1
33#else
Andreas Gampe651ba592017-06-14 14:41:33 -070034#if defined(__LP64__) && !defined(__x86_64__)
35#error "Unrecognized 64-bit architecture."
36#endif
Ian Rogersc3ccc102014-06-25 11:52:14 -070037#define USE_ART_LOW_4G_ALLOCATOR 0
38#endif
39
Ian Rogersc5f17732014-06-05 20:48:42 -070040#ifdef __linux__
41static constexpr bool kMadviseZeroes = true;
42#else
43static constexpr bool kMadviseZeroes = false;
44#endif
45
Brian Carlstromdb4d5402011-08-09 12:18:28 -070046// Used to keep track of mmap segments.
Andreas Gamped8f26db2014-05-19 17:01:13 -070047//
48// On 64b systems not supporting MAP_32BIT, the implementation of MemMap will do a linear scan
49// for free pages. For security, the start of this scan should be randomized. This requires a
50// dynamic initializer.
51// For this to work, it is paramount that there are no other static initializers that access MemMap.
52// Otherwise, calls might see uninitialized values.
Brian Carlstromdb4d5402011-08-09 12:18:28 -070053class MemMap {
54 public:
Elliott Hughesecd3a6f2012-06-06 18:16:37 -070055 // Request an anonymous region of length 'byte_count' and a requested base address.
Mathieu Chartier2cebb242015-04-21 16:50:40 -070056 // Use null as the requested base address if you don't care.
Vladimir Marko5c42c292015-02-25 12:02:49 +000057 // "reuse" allows re-mapping an address range from an existing mapping.
Elliott Hughes6c9c06d2011-11-07 16:43:47 -080058 //
59 // The word "anonymous" in this context means "not backed by a file". The supplied
Nicolas Geoffraya25dce92016-01-12 16:41:10 +000060 // 'name' will be used -- on systems that support it -- to give the mapping
Elliott Hughes6c9c06d2011-11-07 16:43:47 -080061 // a name.
Brian Carlstrom4a289ed2011-08-16 17:17:49 -070062 //
Mathieu Chartier2cebb242015-04-21 16:50:40 -070063 // On success, returns returns a MemMap instance. On failure, returns null.
Nicolas Geoffraya25dce92016-01-12 16:41:10 +000064 static MemMap* MapAnonymous(const char* name,
Mathieu Chartier42bddce2015-11-09 15:16:56 -080065 uint8_t* addr,
66 size_t byte_count,
67 int prot,
68 bool low_4gb,
69 bool reuse,
Nicolas Geoffraya25dce92016-01-12 16:41:10 +000070 std::string* error_msg,
Nicolas Geoffray58a73d22016-11-29 21:49:43 +000071 bool use_ashmem = true);
Brian Carlstromdb4d5402011-08-09 12:18:28 -070072
David Srbecky1baabf02015-06-16 17:12:34 +000073 // Create placeholder for a region allocated by direct call to mmap.
74 // This is useful when we do not have control over the code calling mmap,
75 // but when we still want to keep track of it in the list.
76 // The region is not considered to be owned and will not be unmmaped.
77 static MemMap* MapDummy(const char* name, uint8_t* addr, size_t byte_count);
78
Brian Carlstromdb4d5402011-08-09 12:18:28 -070079 // Map part of a file, taking care of non-page aligned offsets. The
80 // "start" offset is absolute, not relative.
81 //
Mathieu Chartier2cebb242015-04-21 16:50:40 -070082 // On success, returns returns a MemMap instance. On failure, returns null.
Mathieu Chartier42bddce2015-11-09 15:16:56 -080083 static MemMap* MapFile(size_t byte_count,
84 int prot,
85 int flags,
86 int fd,
87 off_t start,
88 bool low_4gb,
89 const char* filename,
90 std::string* error_msg) {
91 return MapFileAtAddress(nullptr,
92 byte_count,
93 prot,
94 flags,
95 fd,
96 start,
97 /*low_4gb*/low_4gb,
98 /*reuse*/false,
99 filename,
100 error_msg);
Brian Carlstrom4a289ed2011-08-16 17:17:49 -0700101 }
102
Mathieu Chartierebe2dfc2015-11-24 13:47:52 -0800103 // Map part of a file, taking care of non-page aligned offsets. The "start" offset is absolute,
104 // not relative. This version allows requesting a specific address for the base of the mapping.
105 // "reuse" allows us to create a view into an existing mapping where we do not take ownership of
106 // the memory. If error_msg is null then we do not print /proc/maps to the log if
107 // MapFileAtAddress fails. This helps improve performance of the fail case since reading and
108 // printing /proc/maps takes several milliseconds in the worst case.
Brian Carlstrom4a289ed2011-08-16 17:17:49 -0700109 //
Mathieu Chartier2cebb242015-04-21 16:50:40 -0700110 // On success, returns returns a MemMap instance. On failure, returns null.
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800111 static MemMap* MapFileAtAddress(uint8_t* addr,
112 size_t byte_count,
113 int prot,
114 int flags,
115 int fd,
116 off_t start,
117 bool low_4gb,
118 bool reuse,
119 const char* filename,
Ian Rogers8d31bbd2013-10-13 10:44:14 -0700120 std::string* error_msg);
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700121
Mathieu Chartier2cebb242015-04-21 16:50:40 -0700122 // Releases the memory mapping.
David Sehr1b14fb82017-02-01 10:42:11 -0800123 ~MemMap() REQUIRES(!MemMap::mem_maps_lock_);
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700124
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800125 const std::string& GetName() const {
126 return name_;
127 }
128
Vladimir Marko9bdf1082016-01-21 12:15:52 +0000129 bool Sync();
130
Logan Chiend88fa262012-06-06 15:23:32 +0800131 bool Protect(int prot);
132
Ian Rogersc5f17732014-06-05 20:48:42 -0700133 void MadviseDontNeedAndZero();
134
Ian Rogers1c849e52012-06-28 14:00:33 -0700135 int GetProtect() const {
136 return prot_;
137 }
138
Ian Rogers13735952014-10-08 12:43:28 -0700139 uint8_t* Begin() const {
Ian Rogers30fab402012-01-23 15:43:46 -0800140 return begin_;
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700141 }
142
Ian Rogers30fab402012-01-23 15:43:46 -0800143 size_t Size() const {
144 return size_;
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700145 }
146
Mathieu Chartier379d09f2015-01-08 11:28:13 -0800147 // Resize the mem-map by unmapping pages at the end. Currently only supports shrinking.
148 void SetSize(size_t new_size);
149
Ian Rogers13735952014-10-08 12:43:28 -0700150 uint8_t* End() const {
Mathieu Chartier2fde5332012-09-14 14:51:54 -0700151 return Begin() + Size();
152 }
153
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800154 void* BaseBegin() const {
155 return base_begin_;
156 }
157
158 size_t BaseSize() const {
159 return base_size_;
160 }
161
162 void* BaseEnd() const {
Ian Rogers13735952014-10-08 12:43:28 -0700163 return reinterpret_cast<uint8_t*>(BaseBegin()) + BaseSize();
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800164 }
165
Mathieu Chartier2fde5332012-09-14 14:51:54 -0700166 bool HasAddress(const void* addr) const {
167 return Begin() <= addr && addr < End();
Brian Carlstromb765be02011-08-17 23:54:10 -0700168 }
169
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700170 // Unmap the pages at end and remap them to create another memory map.
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800171 MemMap* RemapAtEnd(uint8_t* new_end,
172 const char* tail_name,
173 int tail_prot,
Nicolas Geoffraya25dce92016-01-12 16:41:10 +0000174 std::string* error_msg,
Nicolas Geoffray58a73d22016-11-29 21:49:43 +0000175 bool use_ashmem = true);
Mathieu Chartiercc236d72012-07-20 10:29:05 -0700176
Hiroshi Yamauchi3eed93d2014-06-04 11:43:59 -0700177 static bool CheckNoGaps(MemMap* begin_map, MemMap* end_map)
David Sehr1b14fb82017-02-01 10:42:11 -0800178 REQUIRES(!MemMap::mem_maps_lock_);
Vladimir Marko17a924a2015-05-08 15:17:32 +0100179 static void DumpMaps(std::ostream& os, bool terse = false)
David Sehr1b14fb82017-02-01 10:42:11 -0800180 REQUIRES(!MemMap::mem_maps_lock_);
Hiroshi Yamauchi3eed93d2014-06-04 11:43:59 -0700181
David Sehr1b14fb82017-02-01 10:42:11 -0800182 // Init and Shutdown are NOT thread safe.
183 // Both may be called multiple times and MemMap objects may be created any
184 // time after the first call to Init and before the first call to Shutodwn.
185 static void Init() REQUIRES(!MemMap::mem_maps_lock_);
186 static void Shutdown() REQUIRES(!MemMap::mem_maps_lock_);
Mathieu Chartier6e88ef62014-10-14 15:01:24 -0700187
Hiroshi Yamauchi6edb9ae2016-02-08 14:18:21 -0800188 // If the map is PROT_READ, try to read each page of the map to check it is in fact readable (not
189 // faulting). This is used to diagnose a bug b/19894268 where mprotect doesn't seem to be working
190 // intermittently.
191 void TryReadable();
192
Hiroshi Yamauchi3c3c4a12017-02-21 16:49:59 -0800193 // Align the map by unmapping the unaligned parts at the lower and the higher ends.
194 void AlignBy(size_t size);
195
Andreas Gampe0dfc3152017-04-24 07:58:06 -0700196 // For annotation reasons.
197 static std::mutex* GetMemMapsLock() RETURN_CAPABILITY(mem_maps_lock_) {
198 return nullptr;
199 }
200
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700201 private:
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800202 MemMap(const std::string& name,
203 uint8_t* begin,
204 size_t size,
205 void* base_begin,
206 size_t base_size,
207 int prot,
208 bool reuse,
David Sehr1b14fb82017-02-01 10:42:11 -0800209 size_t redzone_size = 0) REQUIRES(!MemMap::mem_maps_lock_);
Hiroshi Yamauchi3eed93d2014-06-04 11:43:59 -0700210
Vladimir Marko17a924a2015-05-08 15:17:32 +0100211 static void DumpMapsLocked(std::ostream& os, bool terse)
David Sehr1b14fb82017-02-01 10:42:11 -0800212 REQUIRES(MemMap::mem_maps_lock_);
Hiroshi Yamauchi3eed93d2014-06-04 11:43:59 -0700213 static bool HasMemMap(MemMap* map)
David Sehr1b14fb82017-02-01 10:42:11 -0800214 REQUIRES(MemMap::mem_maps_lock_);
Hiroshi Yamauchi3eed93d2014-06-04 11:43:59 -0700215 static MemMap* GetLargestMemMapAt(void* address)
David Sehr1b14fb82017-02-01 10:42:11 -0800216 REQUIRES(MemMap::mem_maps_lock_);
Mathieu Chartiere58991b2015-10-13 07:59:34 -0700217 static bool ContainedWithinExistingMap(uint8_t* ptr, size_t size, std::string* error_msg)
David Sehr1b14fb82017-02-01 10:42:11 -0800218 REQUIRES(!MemMap::mem_maps_lock_);
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700219
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800220 // Internal version of mmap that supports low 4gb emulation.
221 static void* MapInternal(void* addr,
222 size_t length,
223 int prot,
224 int flags,
225 int fd,
226 off_t offset,
Andreas Gampe651ba592017-06-14 14:41:33 -0700227 bool low_4gb)
228 REQUIRES(!MemMap::mem_maps_lock_);
229 static void* MapInternalArtLow4GBAllocator(size_t length,
230 int prot,
231 int flags,
232 int fd,
233 off_t offset)
234 REQUIRES(!MemMap::mem_maps_lock_);
Mathieu Chartier42bddce2015-11-09 15:16:56 -0800235
Jim_Guoa62a5882014-04-28 11:11:57 +0800236 const std::string name_;
Hiroshi Yamauchi3c3c4a12017-02-21 16:49:59 -0800237 uint8_t* begin_; // Start of data. May be changed by AlignBy.
Mathieu Chartiercc236d72012-07-20 10:29:05 -0700238 size_t size_; // Length of data.
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700239
Hiroshi Yamauchi3c3c4a12017-02-21 16:49:59 -0800240 void* base_begin_; // Page-aligned base address. May be changed by AlignBy.
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700241 size_t base_size_; // Length of mapping. May be changed by RemapAtEnd (ie Zygote).
Ian Rogers1c849e52012-06-28 14:00:33 -0700242 int prot_; // Protection of the map.
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700243
Jim_Guoa62a5882014-04-28 11:11:57 +0800244 // When reuse_ is true, this is just a view of an existing mapping
245 // and we do not take ownership and are not responsible for
246 // unmapping.
247 const bool reuse_;
248
Evgenii Stepanov1e133742015-05-20 12:30:59 -0700249 const size_t redzone_size_;
250
Ian Rogersc3ccc102014-06-25 11:52:14 -0700251#if USE_ART_LOW_4G_ALLOCATOR
252 static uintptr_t next_mem_pos_; // Next memory location to check for low_4g extent.
Stuart Monteith8dba5aa2014-03-12 12:44:01 +0000253#endif
254
David Sehr1b14fb82017-02-01 10:42:11 -0800255 static std::mutex* mem_maps_lock_;
256
Hiroshi Yamauchifd7e7f12013-10-22 14:17:48 -0700257 friend class MemMapTest; // To allow access to base_begin_ and base_size_.
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700258};
Mathieu Chartier6e6078a2016-10-24 15:45:41 -0700259
Brian Carlstrom0d6adac2014-02-05 17:39:16 -0800260std::ostream& operator<<(std::ostream& os, const MemMap& mem_map);
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700261
Mathieu Chartier6e6078a2016-10-24 15:45:41 -0700262// Zero and release pages if possible, no requirements on alignments.
263void ZeroAndReleasePages(void* address, size_t length);
264
Brian Carlstromdb4d5402011-08-09 12:18:28 -0700265} // namespace art
266
Brian Carlstromfc0e3212013-07-17 14:40:12 -0700267#endif // ART_RUNTIME_MEM_MAP_H_