blob: acd508997dfdf32014e32df852989da01f0755ad [file] [log] [blame]
Elliott Hughes2faa5f12012-01-30 14:42:07 -08001/*
2 * Copyright (C) 2011 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 */
Brian Carlstrom3320cf42011-10-04 14:58:28 -070016
Mathieu Chartier193bad92013-08-29 18:46:00 -070017#ifndef ART_COMPILER_COMPILED_METHOD_H_
18#define ART_COMPILER_COMPILED_METHOD_H_
Brian Carlstrom3320cf42011-10-04 14:58:28 -070019
Ian Rogers700a4022014-05-19 16:49:03 -070020#include <memory>
Vladimir Markocac5a7e2016-02-22 10:39:50 +000021#include <iosfwd>
Brian Carlstrom265091e2013-01-30 14:08:26 -080022#include <string>
Brian Carlstrom3320cf42011-10-04 14:58:28 -070023#include <vector>
24
Ian Rogersd582fa42014-11-05 23:46:43 -080025#include "arch/instruction_set.h"
Vladimir Marko80afd022015-05-19 18:08:00 +010026#include "base/bit_utils.h"
Alex Lighte64300b2015-12-15 15:02:47 -080027#include "base/length_prefixed_array.h"
Vladimir Markof4da6752014-08-01 19:04:18 +010028#include "method_reference.h"
Vladimir Markof4da6752014-08-01 19:04:18 +010029#include "utils/array_ref.h"
Brian Carlstrom3320cf42011-10-04 14:58:28 -070030
31namespace art {
32
Mathieu Chartier193bad92013-08-29 18:46:00 -070033class CompilerDriver;
Vladimir Marko35831e82015-09-11 11:59:18 +010034class CompiledMethodStorage;
Mathieu Chartier193bad92013-08-29 18:46:00 -070035
Logan Chien598c5132012-04-28 22:00:44 +080036class CompiledCode {
37 public:
Brian Carlstrom265091e2013-01-30 14:08:26 -080038 // For Quick to supply an code blob
Mathieu Chartier193bad92013-08-29 18:46:00 -070039 CompiledCode(CompilerDriver* compiler_driver, InstructionSet instruction_set,
Vladimir Marko35831e82015-09-11 11:59:18 +010040 const ArrayRef<const uint8_t>& quick_code);
Mathieu Chartiere5f13e52015-02-24 09:37:21 -080041
42 virtual ~CompiledCode();
Logan Chien598c5132012-04-28 22:00:44 +080043
Logan Chien598c5132012-04-28 22:00:44 +080044 InstructionSet GetInstructionSet() const {
45 return instruction_set_;
46 }
47
Vladimir Marko35831e82015-09-11 11:59:18 +010048 ArrayRef<const uint8_t> GetQuickCode() const {
49 return GetArray(quick_code_);
Logan Chien598c5132012-04-28 22:00:44 +080050 }
51
Ian Rogersef7d42f2014-01-06 12:55:46 -080052 bool operator==(const CompiledCode& rhs) const;
53
Logan Chien598c5132012-04-28 22:00:44 +080054 // To align an offset from a page-aligned value to make it suitable
55 // for code storage. For example on ARM, to ensure that PC relative
56 // valu computations work out as expected.
Mathieu Chartiere5f13e52015-02-24 09:37:21 -080057 size_t AlignCode(size_t offset) const;
58 static size_t AlignCode(size_t offset, InstructionSet instruction_set);
Logan Chien598c5132012-04-28 22:00:44 +080059
60 // returns the difference between the code address and a usable PC.
61 // mainly to cope with kThumb2 where the lower bit must be set.
62 size_t CodeDelta() const;
Dave Allison50abf0a2014-06-23 13:19:59 -070063 static size_t CodeDelta(InstructionSet instruction_set);
Logan Chien598c5132012-04-28 22:00:44 +080064
65 // Returns a pointer suitable for invoking the code at the argument
66 // code_pointer address. Mainly to cope with kThumb2 where the
67 // lower bit must be set to indicate Thumb mode.
68 static const void* CodePointer(const void* code_pointer,
69 InstructionSet instruction_set);
70
Vladimir Marko35831e82015-09-11 11:59:18 +010071 protected:
72 template <typename T>
73 static ArrayRef<const T> GetArray(const LengthPrefixedArray<T>* array) {
74 if (array == nullptr) {
75 return ArrayRef<const T>();
76 }
77 DCHECK_NE(array->size(), 0u);
78 return ArrayRef<const T>(&array->At(0), array->size());
79 }
80
81 CompilerDriver* GetCompilerDriver() {
82 return compiler_driver_;
83 }
Brian Carlstrom265091e2013-01-30 14:08:26 -080084
Logan Chien598c5132012-04-28 22:00:44 +080085 private:
Ian Rogersef7d42f2014-01-06 12:55:46 -080086 CompilerDriver* const compiler_driver_;
Mathieu Chartier193bad92013-08-29 18:46:00 -070087
Logan Chien598c5132012-04-28 22:00:44 +080088 const InstructionSet instruction_set_;
Brian Carlstrom8227cc12013-03-06 14:26:48 -080089
Ian Rogersef7d42f2014-01-06 12:55:46 -080090 // Used to store the PIC code for Quick.
Vladimir Marko35831e82015-09-11 11:59:18 +010091 const LengthPrefixedArray<uint8_t>* const quick_code_;
Logan Chien598c5132012-04-28 22:00:44 +080092};
93
Yevgeny Roubane3ea8382014-08-08 16:29:38 +070094class SrcMapElem {
95 public:
96 uint32_t from_;
97 int32_t to_;
Yevgeny Roubane3ea8382014-08-08 16:29:38 +070098};
99
Vladimir Marko35831e82015-09-11 11:59:18 +0100100inline bool operator<(const SrcMapElem& lhs, const SrcMapElem& rhs) {
101 if (lhs.from_ != rhs.from_) {
102 return lhs.from_ < rhs.from_;
103 }
104 return lhs.to_ < rhs.to_;
105}
106
107inline bool operator==(const SrcMapElem& lhs, const SrcMapElem& rhs) {
108 return lhs.from_ == rhs.from_ && lhs.to_ == rhs.to_;
109}
110
Andreas Gampee21dc3d2014-12-08 16:59:43 -0800111template <class Allocator>
112class SrcMap FINAL : public std::vector<SrcMapElem, Allocator> {
Yevgeny Roubane3ea8382014-08-08 16:29:38 +0700113 public:
Andreas Gampee21dc3d2014-12-08 16:59:43 -0800114 using std::vector<SrcMapElem, Allocator>::begin;
115 using typename std::vector<SrcMapElem, Allocator>::const_iterator;
116 using std::vector<SrcMapElem, Allocator>::empty;
117 using std::vector<SrcMapElem, Allocator>::end;
118 using std::vector<SrcMapElem, Allocator>::resize;
119 using std::vector<SrcMapElem, Allocator>::shrink_to_fit;
120 using std::vector<SrcMapElem, Allocator>::size;
121
122 explicit SrcMap() {}
Mathieu Chartiere5f13e52015-02-24 09:37:21 -0800123 explicit SrcMap(const Allocator& alloc) : std::vector<SrcMapElem, Allocator>(alloc) {}
Andreas Gampee21dc3d2014-12-08 16:59:43 -0800124
125 template <class InputIt>
126 SrcMap(InputIt first, InputIt last, const Allocator& alloc)
127 : std::vector<SrcMapElem, Allocator>(first, last, alloc) {}
128
David Srbecky6f715892015-03-30 14:21:42 +0100129 void push_back(const SrcMapElem& elem) {
Yevgeny Roubane3ea8382014-08-08 16:29:38 +0700130 if (!empty()) {
David Srbecky6f715892015-03-30 14:21:42 +0100131 // Check that the addresses are inserted in sorted order.
132 DCHECK_GE(elem.from_, this->back().from_);
133 // If two consequitive entries map to the same value, ignore the later.
134 // E.g. for map {{0, 1}, {4, 1}, {8, 2}}, all values in [0,8) map to 1.
135 if (elem.to_ == this->back().to_) {
136 return;
137 }
Yevgeny Roubane3ea8382014-08-08 16:29:38 +0700138 }
David Srbecky6f715892015-03-30 14:21:42 +0100139 std::vector<SrcMapElem, Allocator>::push_back(elem);
Yevgeny Roubane3ea8382014-08-08 16:29:38 +0700140 }
141
David Srbecky6f715892015-03-30 14:21:42 +0100142 // Returns true and the corresponding "to" value if the mapping is found.
143 // Oterwise returns false and 0.
144 std::pair<bool, int32_t> Find(uint32_t from) const {
145 // Finds first mapping such that lb.from_ >= from.
146 auto lb = std::lower_bound(begin(), end(), SrcMapElem {from, INT32_MIN});
147 if (lb != end() && lb->from_ == from) {
148 // Found exact match.
149 return std::make_pair(true, lb->to_);
150 } else if (lb != begin()) {
151 // The previous mapping is still in effect.
152 return std::make_pair(true, (--lb)->to_);
153 } else {
154 // Not found because 'from' is smaller than first entry in the map.
155 return std::make_pair(false, 0);
Yevgeny Roubane3ea8382014-08-08 16:29:38 +0700156 }
157 }
158};
159
Andreas Gampee21dc3d2014-12-08 16:59:43 -0800160using DefaultSrcMap = SrcMap<std::allocator<SrcMapElem>>;
Andreas Gampee21dc3d2014-12-08 16:59:43 -0800161
162
Vladimir Markof4da6752014-08-01 19:04:18 +0100163enum LinkerPatchType {
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000164 kLinkerPatchRecordPosition, // Just record patch position for patchoat.
Vladimir Markof4da6752014-08-01 19:04:18 +0100165 kLinkerPatchMethod,
166 kLinkerPatchCall,
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000167 kLinkerPatchCallRelative, // NOTE: Actual patching is instruction_set-dependent.
Vladimir Markof4da6752014-08-01 19:04:18 +0100168 kLinkerPatchType,
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000169 kLinkerPatchString,
170 kLinkerPatchStringRelative, // NOTE: Actual patching is instruction_set-dependent.
171 kLinkerPatchDexCacheArray, // NOTE: Actual patching is instruction_set-dependent.
Vladimir Markof4da6752014-08-01 19:04:18 +0100172};
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000173std::ostream& operator<<(std::ostream& os, const LinkerPatchType& type);
Vladimir Markof4da6752014-08-01 19:04:18 +0100174
175class LinkerPatch {
176 public:
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000177 static LinkerPatch RecordPosition(size_t literal_offset) {
178 return LinkerPatch(literal_offset, kLinkerPatchRecordPosition, /* target_dex_file */ nullptr);
179 }
180
Vladimir Markof4da6752014-08-01 19:04:18 +0100181 static LinkerPatch MethodPatch(size_t literal_offset,
182 const DexFile* target_dex_file,
183 uint32_t target_method_idx) {
Vladimir Marko20f85592015-03-19 10:07:02 +0000184 LinkerPatch patch(literal_offset, kLinkerPatchMethod, target_dex_file);
185 patch.method_idx_ = target_method_idx;
186 return patch;
Vladimir Markof4da6752014-08-01 19:04:18 +0100187 }
188
189 static LinkerPatch CodePatch(size_t literal_offset,
190 const DexFile* target_dex_file,
191 uint32_t target_method_idx) {
Vladimir Marko20f85592015-03-19 10:07:02 +0000192 LinkerPatch patch(literal_offset, kLinkerPatchCall, target_dex_file);
193 patch.method_idx_ = target_method_idx;
194 return patch;
Vladimir Markof4da6752014-08-01 19:04:18 +0100195 }
196
197 static LinkerPatch RelativeCodePatch(size_t literal_offset,
198 const DexFile* target_dex_file,
199 uint32_t target_method_idx) {
Vladimir Marko20f85592015-03-19 10:07:02 +0000200 LinkerPatch patch(literal_offset, kLinkerPatchCallRelative, target_dex_file);
201 patch.method_idx_ = target_method_idx;
202 return patch;
Vladimir Markof4da6752014-08-01 19:04:18 +0100203 }
204
205 static LinkerPatch TypePatch(size_t literal_offset,
206 const DexFile* target_dex_file,
207 uint32_t target_type_idx) {
Vladimir Marko20f85592015-03-19 10:07:02 +0000208 LinkerPatch patch(literal_offset, kLinkerPatchType, target_dex_file);
209 patch.type_idx_ = target_type_idx;
210 return patch;
211 }
212
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000213 static LinkerPatch StringPatch(size_t literal_offset,
214 const DexFile* target_dex_file,
215 uint32_t target_string_idx) {
216 LinkerPatch patch(literal_offset, kLinkerPatchString, target_dex_file);
217 patch.string_idx_ = target_string_idx;
218 return patch;
219 }
220
221 static LinkerPatch RelativeStringPatch(size_t literal_offset,
222 const DexFile* target_dex_file,
223 uint32_t pc_insn_offset,
224 uint32_t target_string_idx) {
225 LinkerPatch patch(literal_offset, kLinkerPatchStringRelative, target_dex_file);
226 patch.string_idx_ = target_string_idx;
227 patch.pc_insn_offset_ = pc_insn_offset;
228 return patch;
229 }
230
Vladimir Marko20f85592015-03-19 10:07:02 +0000231 static LinkerPatch DexCacheArrayPatch(size_t literal_offset,
232 const DexFile* target_dex_file,
233 uint32_t pc_insn_offset,
234 size_t element_offset) {
235 DCHECK(IsUint<32>(element_offset));
236 LinkerPatch patch(literal_offset, kLinkerPatchDexCacheArray, target_dex_file);
237 patch.pc_insn_offset_ = pc_insn_offset;
238 patch.element_offset_ = element_offset;
239 return patch;
Vladimir Markof4da6752014-08-01 19:04:18 +0100240 }
241
242 LinkerPatch(const LinkerPatch& other) = default;
243 LinkerPatch& operator=(const LinkerPatch& other) = default;
244
245 size_t LiteralOffset() const {
246 return literal_offset_;
247 }
248
249 LinkerPatchType Type() const {
250 return patch_type_;
251 }
252
Vladimir Marko20f85592015-03-19 10:07:02 +0000253 bool IsPcRelative() const {
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000254 switch (Type()) {
255 case kLinkerPatchCallRelative:
256 case kLinkerPatchStringRelative:
257 case kLinkerPatchDexCacheArray:
258 return true;
259 default:
260 return false;
261 }
Vladimir Marko20f85592015-03-19 10:07:02 +0000262 }
263
Vladimir Markof4da6752014-08-01 19:04:18 +0100264 MethodReference TargetMethod() const {
265 DCHECK(patch_type_ == kLinkerPatchMethod ||
266 patch_type_ == kLinkerPatchCall || patch_type_ == kLinkerPatchCallRelative);
Vladimir Marko20f85592015-03-19 10:07:02 +0000267 return MethodReference(target_dex_file_, method_idx_);
Vladimir Markof4da6752014-08-01 19:04:18 +0100268 }
269
270 const DexFile* TargetTypeDexFile() const {
271 DCHECK(patch_type_ == kLinkerPatchType);
272 return target_dex_file_;
273 }
274
275 uint32_t TargetTypeIndex() const {
276 DCHECK(patch_type_ == kLinkerPatchType);
Vladimir Marko20f85592015-03-19 10:07:02 +0000277 return type_idx_;
278 }
279
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000280 const DexFile* TargetStringDexFile() const {
281 DCHECK(patch_type_ == kLinkerPatchString || patch_type_ == kLinkerPatchStringRelative);
282 return target_dex_file_;
283 }
284
285 uint32_t TargetStringIndex() const {
286 DCHECK(patch_type_ == kLinkerPatchString || patch_type_ == kLinkerPatchStringRelative);
287 return string_idx_;
288 }
289
Vladimir Marko20f85592015-03-19 10:07:02 +0000290 const DexFile* TargetDexCacheDexFile() const {
291 DCHECK(patch_type_ == kLinkerPatchDexCacheArray);
292 return target_dex_file_;
293 }
294
295 size_t TargetDexCacheElementOffset() const {
296 DCHECK(patch_type_ == kLinkerPatchDexCacheArray);
297 return element_offset_;
298 }
299
300 uint32_t PcInsnOffset() const {
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000301 DCHECK(patch_type_ == kLinkerPatchStringRelative || patch_type_ == kLinkerPatchDexCacheArray);
Vladimir Marko20f85592015-03-19 10:07:02 +0000302 return pc_insn_offset_;
Vladimir Markof4da6752014-08-01 19:04:18 +0100303 }
304
305 private:
Vladimir Marko20f85592015-03-19 10:07:02 +0000306 LinkerPatch(size_t literal_offset, LinkerPatchType patch_type, const DexFile* target_dex_file)
307 : target_dex_file_(target_dex_file),
308 literal_offset_(literal_offset),
309 patch_type_(patch_type) {
310 cmp1_ = 0u;
311 cmp2_ = 0u;
312 // The compiler rejects methods that are too big, so the compiled code
313 // of a single method really shouln't be anywhere close to 16MiB.
314 DCHECK(IsUint<24>(literal_offset));
Vladimir Markof4da6752014-08-01 19:04:18 +0100315 }
316
Vladimir Markof4da6752014-08-01 19:04:18 +0100317 const DexFile* target_dex_file_;
Vladimir Marko20f85592015-03-19 10:07:02 +0000318 uint32_t literal_offset_ : 24; // Method code size up to 16MiB.
319 LinkerPatchType patch_type_ : 8;
320 union {
321 uint32_t cmp1_; // Used for relational operators.
322 uint32_t method_idx_; // Method index for Call/Method patches.
323 uint32_t type_idx_; // Type index for Type patches.
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000324 uint32_t string_idx_; // String index for String patches.
Vladimir Marko20f85592015-03-19 10:07:02 +0000325 uint32_t element_offset_; // Element offset in the dex cache arrays.
Vladimir Marko35831e82015-09-11 11:59:18 +0100326 static_assert(sizeof(method_idx_) == sizeof(cmp1_), "needed by relational operators");
327 static_assert(sizeof(type_idx_) == sizeof(cmp1_), "needed by relational operators");
Vladimir Markocac5a7e2016-02-22 10:39:50 +0000328 static_assert(sizeof(string_idx_) == sizeof(cmp1_), "needed by relational operators");
Vladimir Marko35831e82015-09-11 11:59:18 +0100329 static_assert(sizeof(element_offset_) == sizeof(cmp1_), "needed by relational operators");
Vladimir Marko20f85592015-03-19 10:07:02 +0000330 };
331 union {
Vladimir Marko34ed3af2016-02-04 20:01:32 +0000332 // Note: To avoid uninitialized padding on 64-bit systems, we use `size_t` for `cmp2_`.
333 // This allows a hashing function to treat an array of linker patches as raw memory.
334 size_t cmp2_; // Used for relational operators.
Vladimir Marko20f85592015-03-19 10:07:02 +0000335 // Literal offset of the insn loading PC (same as literal_offset if it's the same insn,
336 // may be different if the PC-relative addressing needs multiple insns).
337 uint32_t pc_insn_offset_;
Vladimir Marko34ed3af2016-02-04 20:01:32 +0000338 static_assert(sizeof(pc_insn_offset_) <= sizeof(cmp2_), "needed by relational operators");
Vladimir Marko20f85592015-03-19 10:07:02 +0000339 };
Vladimir Markof4da6752014-08-01 19:04:18 +0100340
341 friend bool operator==(const LinkerPatch& lhs, const LinkerPatch& rhs);
342 friend bool operator<(const LinkerPatch& lhs, const LinkerPatch& rhs);
343};
344
345inline bool operator==(const LinkerPatch& lhs, const LinkerPatch& rhs) {
346 return lhs.literal_offset_ == rhs.literal_offset_ &&
347 lhs.patch_type_ == rhs.patch_type_ &&
Vladimir Marko20f85592015-03-19 10:07:02 +0000348 lhs.target_dex_file_ == rhs.target_dex_file_ &&
349 lhs.cmp1_ == rhs.cmp1_ &&
350 lhs.cmp2_ == rhs.cmp2_;
Vladimir Markof4da6752014-08-01 19:04:18 +0100351}
352
353inline bool operator<(const LinkerPatch& lhs, const LinkerPatch& rhs) {
354 return (lhs.literal_offset_ != rhs.literal_offset_) ? lhs.literal_offset_ < rhs.literal_offset_
355 : (lhs.patch_type_ != rhs.patch_type_) ? lhs.patch_type_ < rhs.patch_type_
Vladimir Marko20f85592015-03-19 10:07:02 +0000356 : (lhs.target_dex_file_ != rhs.target_dex_file_) ? lhs.target_dex_file_ < rhs.target_dex_file_
357 : (lhs.cmp1_ != rhs.cmp1_) ? lhs.cmp1_ < rhs.cmp1_
358 : lhs.cmp2_ < rhs.cmp2_;
Vladimir Markof4da6752014-08-01 19:04:18 +0100359}
360
Yevgeny Roubane3ea8382014-08-08 16:29:38 +0700361class CompiledMethod FINAL : public CompiledCode {
Brian Carlstrom3320cf42011-10-04 14:58:28 -0700362 public:
Andreas Gampee21dc3d2014-12-08 16:59:43 -0800363 // Constructs a CompiledMethod.
364 // Note: Consider using the static allocation methods below that will allocate the CompiledMethod
365 // in the swap space.
Ian Rogers72d32622014-05-06 16:20:11 -0700366 CompiledMethod(CompilerDriver* driver,
Mathieu Chartier193bad92013-08-29 18:46:00 -0700367 InstructionSet instruction_set,
Andreas Gampee21dc3d2014-12-08 16:59:43 -0800368 const ArrayRef<const uint8_t>& quick_code,
Brian Carlstrom3320cf42011-10-04 14:58:28 -0700369 const size_t frame_size_in_bytes,
Brian Carlstrom3320cf42011-10-04 14:58:28 -0700370 const uint32_t core_spill_mask,
371 const uint32_t fp_spill_mask,
Vladimir Marko35831e82015-09-11 11:59:18 +0100372 const ArrayRef<const SrcMapElem>& src_mapping_table,
Andreas Gampee21dc3d2014-12-08 16:59:43 -0800373 const ArrayRef<const uint8_t>& mapping_table,
374 const ArrayRef<const uint8_t>& vmap_table,
375 const ArrayRef<const uint8_t>& native_gc_map,
376 const ArrayRef<const uint8_t>& cfi_info,
David Srbeckyc6b4dd82015-04-07 20:32:43 +0100377 const ArrayRef<const LinkerPatch>& patches);
Brian Carlstrom3320cf42011-10-04 14:58:28 -0700378
Mathieu Chartiere5f13e52015-02-24 09:37:21 -0800379 virtual ~CompiledMethod();
Brian Carlstrom3320cf42011-10-04 14:58:28 -0700380
Andreas Gampee21dc3d2014-12-08 16:59:43 -0800381 static CompiledMethod* SwapAllocCompiledMethod(
382 CompilerDriver* driver,
383 InstructionSet instruction_set,
384 const ArrayRef<const uint8_t>& quick_code,
385 const size_t frame_size_in_bytes,
386 const uint32_t core_spill_mask,
387 const uint32_t fp_spill_mask,
Vladimir Marko35831e82015-09-11 11:59:18 +0100388 const ArrayRef<const SrcMapElem>& src_mapping_table,
Andreas Gampee21dc3d2014-12-08 16:59:43 -0800389 const ArrayRef<const uint8_t>& mapping_table,
390 const ArrayRef<const uint8_t>& vmap_table,
391 const ArrayRef<const uint8_t>& native_gc_map,
392 const ArrayRef<const uint8_t>& cfi_info,
David Srbeckyc6b4dd82015-04-07 20:32:43 +0100393 const ArrayRef<const LinkerPatch>& patches);
Andreas Gampee21dc3d2014-12-08 16:59:43 -0800394
395 static void ReleaseSwapAllocatedCompiledMethod(CompilerDriver* driver, CompiledMethod* m);
396
Ian Rogers0c7abda2012-09-19 13:33:42 -0700397 size_t GetFrameSizeInBytes() const {
398 return frame_size_in_bytes_;
Logan Chien110bcba2012-04-16 19:11:28 +0800399 }
Ian Rogers0c7abda2012-09-19 13:33:42 -0700400
401 uint32_t GetCoreSpillMask() const {
402 return core_spill_mask_;
403 }
404
405 uint32_t GetFpSpillMask() const {
406 return fp_spill_mask_;
407 }
408
Vladimir Marko35831e82015-09-11 11:59:18 +0100409 ArrayRef<const SrcMapElem> GetSrcMappingTable() const {
410 return GetArray(src_mapping_table_);
Yevgeny Roubane3ea8382014-08-08 16:29:38 +0700411 }
412
Vladimir Marko35831e82015-09-11 11:59:18 +0100413 ArrayRef<const uint8_t> GetMappingTable() const {
414 return GetArray(mapping_table_);
Ian Rogers0c7abda2012-09-19 13:33:42 -0700415 }
416
Vladimir Marko35831e82015-09-11 11:59:18 +0100417 ArrayRef<const uint8_t> GetVmapTable() const {
418 return GetArray(vmap_table_);
Ian Rogers0c7abda2012-09-19 13:33:42 -0700419 }
420
Vladimir Marko35831e82015-09-11 11:59:18 +0100421 ArrayRef<const uint8_t> GetGcMap() const {
422 return GetArray(gc_map_);
Ian Rogers0c7abda2012-09-19 13:33:42 -0700423 }
Logan Chien110bcba2012-04-16 19:11:28 +0800424
Vladimir Marko35831e82015-09-11 11:59:18 +0100425 ArrayRef<const uint8_t> GetCFIInfo() const {
426 return GetArray(cfi_info_);
Mark Mendellae9fd932014-02-10 16:14:35 -0800427 }
428
Vladimir Markob207e142015-04-02 21:25:21 +0100429 ArrayRef<const LinkerPatch> GetPatches() const {
Vladimir Marko35831e82015-09-11 11:59:18 +0100430 return GetArray(patches_);
Vladimir Markof4da6752014-08-01 19:04:18 +0100431 }
432
Brian Carlstrom3320cf42011-10-04 14:58:28 -0700433 private:
Ian Rogersa1827042013-04-18 16:36:43 -0700434 // For quick code, the size of the activation used by the code.
Ian Rogers0c7abda2012-09-19 13:33:42 -0700435 const size_t frame_size_in_bytes_;
Ian Rogersa1827042013-04-18 16:36:43 -0700436 // For quick code, a bit mask describing spilled GPR callee-save registers.
Ian Rogers169c9a72011-11-13 20:13:17 -0800437 const uint32_t core_spill_mask_;
Ian Rogersa1827042013-04-18 16:36:43 -0700438 // For quick code, a bit mask describing spilled FPR callee-save registers.
Ian Rogers169c9a72011-11-13 20:13:17 -0800439 const uint32_t fp_spill_mask_;
David Srbecky6f715892015-03-30 14:21:42 +0100440 // For quick code, a set of pairs (PC, DEX) mapping from native PC offset to DEX offset.
Vladimir Marko35831e82015-09-11 11:59:18 +0100441 const LengthPrefixedArray<SrcMapElem>* const src_mapping_table_;
Ian Rogers96faf5b2013-08-09 22:05:32 -0700442 // For quick code, a uleb128 encoded map from native PC offset to dex PC aswell as dex PC to
443 // native PC offset. Size prefixed.
Vladimir Marko35831e82015-09-11 11:59:18 +0100444 const LengthPrefixedArray<uint8_t>* const mapping_table_;
Ian Rogers96faf5b2013-08-09 22:05:32 -0700445 // For quick code, a uleb128 encoded map from GPR/FPR register to dex register. Size prefixed.
Vladimir Marko35831e82015-09-11 11:59:18 +0100446 const LengthPrefixedArray<uint8_t>* const vmap_table_;
Ian Rogersa1827042013-04-18 16:36:43 -0700447 // For quick code, a map keyed by native PC indices to bitmaps describing what dalvik registers
Elliott Hughes956af0f2014-12-11 14:34:28 -0800448 // are live.
Vladimir Marko35831e82015-09-11 11:59:18 +0100449 const LengthPrefixedArray<uint8_t>* const gc_map_;
Mark Mendellae9fd932014-02-10 16:14:35 -0800450 // For quick code, a FDE entry for the debug_frame section.
Vladimir Marko35831e82015-09-11 11:59:18 +0100451 const LengthPrefixedArray<uint8_t>* const cfi_info_;
Vladimir Markof4da6752014-08-01 19:04:18 +0100452 // For quick code, linker patches needed by the method.
Vladimir Marko35831e82015-09-11 11:59:18 +0100453 const LengthPrefixedArray<LinkerPatch>* const patches_;
Brian Carlstrom3320cf42011-10-04 14:58:28 -0700454};
455
Brian Carlstrom3320cf42011-10-04 14:58:28 -0700456} // namespace art
457
Mathieu Chartier193bad92013-08-29 18:46:00 -0700458#endif // ART_COMPILER_COMPILED_METHOD_H_