Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2014 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 "code_generator.h" |
| 18 | |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 19 | #ifdef ART_ENABLE_CODEGEN_arm |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 20 | #include "code_generator_arm.h" |
Scott Wakeling | fe88546 | 2016-09-22 10:24:38 +0100 | [diff] [blame] | 21 | #include "code_generator_arm_vixl.h" |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 22 | #endif |
| 23 | |
| 24 | #ifdef ART_ENABLE_CODEGEN_arm64 |
Alexandre Rames | 5319def | 2014-10-23 10:03:10 +0100 | [diff] [blame] | 25 | #include "code_generator_arm64.h" |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 26 | #endif |
| 27 | |
| 28 | #ifdef ART_ENABLE_CODEGEN_x86 |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 29 | #include "code_generator_x86.h" |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 30 | #endif |
| 31 | |
| 32 | #ifdef ART_ENABLE_CODEGEN_x86_64 |
Nicolas Geoffray | 9cf3552 | 2014-06-09 18:40:10 +0100 | [diff] [blame] | 33 | #include "code_generator_x86_64.h" |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 34 | #endif |
| 35 | |
Goran Jakovljevic | f652cec | 2015-08-25 16:11:42 +0200 | [diff] [blame] | 36 | #ifdef ART_ENABLE_CODEGEN_mips |
| 37 | #include "code_generator_mips.h" |
| 38 | #endif |
| 39 | |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 40 | #ifdef ART_ENABLE_CODEGEN_mips64 |
Alexey Frunze | 4dda337 | 2015-06-01 18:31:49 -0700 | [diff] [blame] | 41 | #include "code_generator_mips64.h" |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 42 | #endif |
| 43 | |
Andreas Gampe | 5678db5 | 2017-06-08 14:11:18 -0700 | [diff] [blame] | 44 | #include "base/bit_utils.h" |
| 45 | #include "base/bit_utils_iterator.h" |
David Brazdil | 86ea7ee | 2016-02-16 09:26:07 +0000 | [diff] [blame] | 46 | #include "bytecode_utils.h" |
Andreas Gampe | c6ea7d0 | 2017-02-01 16:46:28 -0800 | [diff] [blame] | 47 | #include "class_linker.h" |
Yevgeny Rouban | e3ea838 | 2014-08-08 16:29:38 +0700 | [diff] [blame] | 48 | #include "compiled_method.h" |
Nicolas Geoffray | 92cf83e | 2014-03-18 17:59:20 +0000 | [diff] [blame] | 49 | #include "dex/verified_method.h" |
Nicolas Geoffray | d28b969 | 2015-11-04 14:36:55 +0000 | [diff] [blame] | 50 | #include "driver/compiler_driver.h" |
Alexandre Rames | eb7b739 | 2015-06-19 14:47:01 +0100 | [diff] [blame] | 51 | #include "graph_visualizer.h" |
Andreas Gampe | c15a2f4 | 2017-04-21 12:09:39 -0700 | [diff] [blame] | 52 | #include "intern_table.h" |
Nicolas Geoffray | 5bd05a5 | 2015-10-13 09:48:30 +0100 | [diff] [blame] | 53 | #include "intrinsics.h" |
Nicolas Geoffray | 8ccc3f5 | 2014-03-19 10:34:11 +0000 | [diff] [blame] | 54 | #include "leb128.h" |
Nicolas Geoffray | 19a19cf | 2014-10-22 16:07:05 +0100 | [diff] [blame] | 55 | #include "mirror/array-inl.h" |
| 56 | #include "mirror/object_array-inl.h" |
| 57 | #include "mirror/object_reference.h" |
Andreas Gampe | c6ea7d0 | 2017-02-01 16:46:28 -0800 | [diff] [blame] | 58 | #include "mirror/reference.h" |
Vladimir Marko | dce016e | 2016-04-28 13:10:02 +0100 | [diff] [blame] | 59 | #include "mirror/string.h" |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 60 | #include "parallel_move_resolver.h" |
Nicolas Geoffray | 3c04974 | 2014-09-24 18:10:46 +0100 | [diff] [blame] | 61 | #include "ssa_liveness_analysis.h" |
Andreas Gampe | c6ea7d0 | 2017-02-01 16:46:28 -0800 | [diff] [blame] | 62 | #include "scoped_thread_state_change-inl.h" |
Andreas Gampe | b486a98 | 2017-06-01 13:45:54 -0700 | [diff] [blame] | 63 | #include "thread-current-inl.h" |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 64 | #include "utils/assembler.h" |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 65 | |
| 66 | namespace art { |
| 67 | |
Mathieu Chartier | d776ff0 | 2017-01-17 09:32:18 -0800 | [diff] [blame] | 68 | // If true, we record the static and direct invokes in the invoke infos. |
| 69 | static constexpr bool kEnableDexLayoutOptimizations = false; |
| 70 | |
Alexandre Rames | 88c13cd | 2015-04-14 17:35:39 +0100 | [diff] [blame] | 71 | // Return whether a location is consistent with a type. |
| 72 | static bool CheckType(Primitive::Type type, Location location) { |
| 73 | if (location.IsFpuRegister() |
| 74 | || (location.IsUnallocated() && (location.GetPolicy() == Location::kRequiresFpuRegister))) { |
| 75 | return (type == Primitive::kPrimFloat) || (type == Primitive::kPrimDouble); |
| 76 | } else if (location.IsRegister() || |
| 77 | (location.IsUnallocated() && (location.GetPolicy() == Location::kRequiresRegister))) { |
| 78 | return Primitive::IsIntegralType(type) || (type == Primitive::kPrimNot); |
| 79 | } else if (location.IsRegisterPair()) { |
| 80 | return type == Primitive::kPrimLong; |
| 81 | } else if (location.IsFpuRegisterPair()) { |
| 82 | return type == Primitive::kPrimDouble; |
| 83 | } else if (location.IsStackSlot()) { |
| 84 | return (Primitive::IsIntegralType(type) && type != Primitive::kPrimLong) |
| 85 | || (type == Primitive::kPrimFloat) |
| 86 | || (type == Primitive::kPrimNot); |
| 87 | } else if (location.IsDoubleStackSlot()) { |
| 88 | return (type == Primitive::kPrimLong) || (type == Primitive::kPrimDouble); |
| 89 | } else if (location.IsConstant()) { |
| 90 | if (location.GetConstant()->IsIntConstant()) { |
| 91 | return Primitive::IsIntegralType(type) && (type != Primitive::kPrimLong); |
| 92 | } else if (location.GetConstant()->IsNullConstant()) { |
| 93 | return type == Primitive::kPrimNot; |
| 94 | } else if (location.GetConstant()->IsLongConstant()) { |
| 95 | return type == Primitive::kPrimLong; |
| 96 | } else if (location.GetConstant()->IsFloatConstant()) { |
| 97 | return type == Primitive::kPrimFloat; |
| 98 | } else { |
| 99 | return location.GetConstant()->IsDoubleConstant() |
| 100 | && (type == Primitive::kPrimDouble); |
| 101 | } |
| 102 | } else { |
| 103 | return location.IsInvalid() || (location.GetPolicy() == Location::kAny); |
| 104 | } |
| 105 | } |
| 106 | |
| 107 | // Check that a location summary is consistent with an instruction. |
| 108 | static bool CheckTypeConsistency(HInstruction* instruction) { |
| 109 | LocationSummary* locations = instruction->GetLocations(); |
| 110 | if (locations == nullptr) { |
| 111 | return true; |
| 112 | } |
| 113 | |
| 114 | if (locations->Out().IsUnallocated() |
| 115 | && (locations->Out().GetPolicy() == Location::kSameAsFirstInput)) { |
| 116 | DCHECK(CheckType(instruction->GetType(), locations->InAt(0))) |
| 117 | << instruction->GetType() |
| 118 | << " " << locations->InAt(0); |
| 119 | } else { |
| 120 | DCHECK(CheckType(instruction->GetType(), locations->Out())) |
| 121 | << instruction->GetType() |
| 122 | << " " << locations->Out(); |
| 123 | } |
| 124 | |
Vladimir Marko | e900491 | 2016-06-16 16:50:52 +0100 | [diff] [blame] | 125 | HConstInputsRef inputs = instruction->GetInputs(); |
Vladimir Marko | 372f10e | 2016-05-17 16:30:10 +0100 | [diff] [blame] | 126 | for (size_t i = 0; i < inputs.size(); ++i) { |
| 127 | DCHECK(CheckType(inputs[i]->GetType(), locations->InAt(i))) |
| 128 | << inputs[i]->GetType() << " " << locations->InAt(i); |
Alexandre Rames | 88c13cd | 2015-04-14 17:35:39 +0100 | [diff] [blame] | 129 | } |
| 130 | |
| 131 | HEnvironment* environment = instruction->GetEnvironment(); |
| 132 | for (size_t i = 0; i < instruction->EnvironmentSize(); ++i) { |
| 133 | if (environment->GetInstructionAt(i) != nullptr) { |
| 134 | Primitive::Type type = environment->GetInstructionAt(i)->GetType(); |
Nicolas Geoffray | 0a23d74 | 2015-05-07 11:57:35 +0100 | [diff] [blame] | 135 | DCHECK(CheckType(type, environment->GetLocationAt(i))) |
| 136 | << type << " " << environment->GetLocationAt(i); |
Alexandre Rames | 88c13cd | 2015-04-14 17:35:39 +0100 | [diff] [blame] | 137 | } else { |
Nicolas Geoffray | 0a23d74 | 2015-05-07 11:57:35 +0100 | [diff] [blame] | 138 | DCHECK(environment->GetLocationAt(i).IsInvalid()) |
| 139 | << environment->GetLocationAt(i); |
Alexandre Rames | 88c13cd | 2015-04-14 17:35:39 +0100 | [diff] [blame] | 140 | } |
| 141 | } |
| 142 | return true; |
| 143 | } |
| 144 | |
Nicolas Geoffray | 19a19cf | 2014-10-22 16:07:05 +0100 | [diff] [blame] | 145 | size_t CodeGenerator::GetCacheOffset(uint32_t index) { |
Vladimir Marko | 05792b9 | 2015-08-03 11:56:49 +0100 | [diff] [blame] | 146 | return sizeof(GcRoot<mirror::Object>) * index; |
Nicolas Geoffray | 19a19cf | 2014-10-22 16:07:05 +0100 | [diff] [blame] | 147 | } |
| 148 | |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 149 | size_t CodeGenerator::GetCachePointerOffset(uint32_t index) { |
Vladimir Marko | 7d157fc | 2017-05-10 16:29:23 +0100 | [diff] [blame] | 150 | PointerSize pointer_size = InstructionSetPointerSize(GetInstructionSet()); |
Andreas Gampe | 542451c | 2016-07-26 09:02:02 -0700 | [diff] [blame] | 151 | return static_cast<size_t>(pointer_size) * index; |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 152 | } |
| 153 | |
Vladimir Marko | dce016e | 2016-04-28 13:10:02 +0100 | [diff] [blame] | 154 | uint32_t CodeGenerator::GetArrayLengthOffset(HArrayLength* array_length) { |
| 155 | return array_length->IsStringLength() |
| 156 | ? mirror::String::CountOffset().Uint32Value() |
| 157 | : mirror::Array::LengthOffset().Uint32Value(); |
| 158 | } |
| 159 | |
Vladimir Marko | 87f3fcb | 2016-04-28 15:52:11 +0100 | [diff] [blame] | 160 | uint32_t CodeGenerator::GetArrayDataOffset(HArrayGet* array_get) { |
| 161 | DCHECK(array_get->GetType() == Primitive::kPrimChar || !array_get->IsStringCharAt()); |
| 162 | return array_get->IsStringCharAt() |
| 163 | ? mirror::String::ValueOffset().Uint32Value() |
| 164 | : mirror::Array::DataOffset(Primitive::ComponentSize(array_get->GetType())).Uint32Value(); |
| 165 | } |
| 166 | |
Nicolas Geoffray | dc23d83 | 2015-02-16 11:15:43 +0000 | [diff] [blame] | 167 | bool CodeGenerator::GoesToNextBlock(HBasicBlock* current, HBasicBlock* next) const { |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 168 | DCHECK_EQ((*block_order_)[current_block_index_], current); |
Nicolas Geoffray | dc23d83 | 2015-02-16 11:15:43 +0000 | [diff] [blame] | 169 | return GetNextBlockToEmit() == FirstNonEmptyBlock(next); |
| 170 | } |
| 171 | |
| 172 | HBasicBlock* CodeGenerator::GetNextBlockToEmit() const { |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 173 | for (size_t i = current_block_index_ + 1; i < block_order_->size(); ++i) { |
| 174 | HBasicBlock* block = (*block_order_)[i]; |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 175 | if (!block->IsSingleJump()) { |
Nicolas Geoffray | dc23d83 | 2015-02-16 11:15:43 +0000 | [diff] [blame] | 176 | return block; |
| 177 | } |
| 178 | } |
| 179 | return nullptr; |
| 180 | } |
| 181 | |
| 182 | HBasicBlock* CodeGenerator::FirstNonEmptyBlock(HBasicBlock* block) const { |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 183 | while (block->IsSingleJump()) { |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 184 | block = block->GetSuccessors()[0]; |
Nicolas Geoffray | dc23d83 | 2015-02-16 11:15:43 +0000 | [diff] [blame] | 185 | } |
| 186 | return block; |
| 187 | } |
| 188 | |
Alexandre Rames | eb7b739 | 2015-06-19 14:47:01 +0100 | [diff] [blame] | 189 | class DisassemblyScope { |
| 190 | public: |
| 191 | DisassemblyScope(HInstruction* instruction, const CodeGenerator& codegen) |
| 192 | : codegen_(codegen), instruction_(instruction), start_offset_(static_cast<size_t>(-1)) { |
| 193 | if (codegen_.GetDisassemblyInformation() != nullptr) { |
| 194 | start_offset_ = codegen_.GetAssembler().CodeSize(); |
| 195 | } |
| 196 | } |
| 197 | |
| 198 | ~DisassemblyScope() { |
| 199 | // We avoid building this data when we know it will not be used. |
| 200 | if (codegen_.GetDisassemblyInformation() != nullptr) { |
| 201 | codegen_.GetDisassemblyInformation()->AddInstructionInterval( |
| 202 | instruction_, start_offset_, codegen_.GetAssembler().CodeSize()); |
| 203 | } |
| 204 | } |
| 205 | |
| 206 | private: |
| 207 | const CodeGenerator& codegen_; |
| 208 | HInstruction* instruction_; |
| 209 | size_t start_offset_; |
| 210 | }; |
| 211 | |
| 212 | |
| 213 | void CodeGenerator::GenerateSlowPaths() { |
| 214 | size_t code_start = 0; |
Alexandre Rames | c01a664 | 2016-04-15 11:54:06 +0100 | [diff] [blame] | 215 | for (const std::unique_ptr<SlowPathCode>& slow_path_unique_ptr : slow_paths_) { |
| 216 | SlowPathCode* slow_path = slow_path_unique_ptr.get(); |
Vladimir Marko | 0f7dca4 | 2015-11-02 14:36:43 +0000 | [diff] [blame] | 217 | current_slow_path_ = slow_path; |
Alexandre Rames | eb7b739 | 2015-06-19 14:47:01 +0100 | [diff] [blame] | 218 | if (disasm_info_ != nullptr) { |
| 219 | code_start = GetAssembler()->CodeSize(); |
| 220 | } |
David Srbecky | 9cd6d37 | 2016-02-09 15:24:47 +0000 | [diff] [blame] | 221 | // Record the dex pc at start of slow path (required for java line number mapping). |
David Srbecky | d28f4a0 | 2016-03-14 17:14:24 +0000 | [diff] [blame] | 222 | MaybeRecordNativeDebugInfo(slow_path->GetInstruction(), slow_path->GetDexPc(), slow_path); |
Vladimir Marko | 225b646 | 2015-09-28 12:17:40 +0100 | [diff] [blame] | 223 | slow_path->EmitNativeCode(this); |
Alexandre Rames | eb7b739 | 2015-06-19 14:47:01 +0100 | [diff] [blame] | 224 | if (disasm_info_ != nullptr) { |
Vladimir Marko | 225b646 | 2015-09-28 12:17:40 +0100 | [diff] [blame] | 225 | disasm_info_->AddSlowPathInterval(slow_path, code_start, GetAssembler()->CodeSize()); |
Alexandre Rames | eb7b739 | 2015-06-19 14:47:01 +0100 | [diff] [blame] | 226 | } |
| 227 | } |
Vladimir Marko | 0f7dca4 | 2015-11-02 14:36:43 +0000 | [diff] [blame] | 228 | current_slow_path_ = nullptr; |
Alexandre Rames | eb7b739 | 2015-06-19 14:47:01 +0100 | [diff] [blame] | 229 | } |
| 230 | |
David Brazdil | 58282f4 | 2016-01-14 12:45:10 +0000 | [diff] [blame] | 231 | void CodeGenerator::Compile(CodeAllocator* allocator) { |
| 232 | // The register allocator already called `InitializeCodeGeneration`, |
| 233 | // where the frame size has been computed. |
| 234 | DCHECK(block_order_ != nullptr); |
| 235 | Initialize(); |
| 236 | |
Nicolas Geoffray | 8a16d97 | 2014-09-11 10:30:02 +0100 | [diff] [blame] | 237 | HGraphVisitor* instruction_visitor = GetInstructionVisitor(); |
Nicolas Geoffray | 4c204ba | 2015-02-03 15:12:35 +0000 | [diff] [blame] | 238 | DCHECK_EQ(current_block_index_, 0u); |
Alexandre Rames | eb7b739 | 2015-06-19 14:47:01 +0100 | [diff] [blame] | 239 | |
| 240 | size_t frame_start = GetAssembler()->CodeSize(); |
Nicolas Geoffray | 4c204ba | 2015-02-03 15:12:35 +0000 | [diff] [blame] | 241 | GenerateFrameEntry(); |
David Srbecky | c6b4dd8 | 2015-04-07 20:32:43 +0100 | [diff] [blame] | 242 | DCHECK_EQ(GetAssembler()->cfi().GetCurrentCFAOffset(), static_cast<int>(frame_size_)); |
Alexandre Rames | eb7b739 | 2015-06-19 14:47:01 +0100 | [diff] [blame] | 243 | if (disasm_info_ != nullptr) { |
| 244 | disasm_info_->SetFrameEntryInterval(frame_start, GetAssembler()->CodeSize()); |
| 245 | } |
| 246 | |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 247 | for (size_t e = block_order_->size(); current_block_index_ < e; ++current_block_index_) { |
| 248 | HBasicBlock* block = (*block_order_)[current_block_index_]; |
Nicolas Geoffray | dc23d83 | 2015-02-16 11:15:43 +0000 | [diff] [blame] | 249 | // Don't generate code for an empty block. Its predecessors will branch to its successor |
| 250 | // directly. Also, the label of that block will not be emitted, so this helps catch |
| 251 | // errors where we reference that label. |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 252 | if (block->IsSingleJump()) continue; |
Nicolas Geoffray | 92a73ae | 2014-10-16 11:12:52 +0100 | [diff] [blame] | 253 | Bind(block); |
David Srbecky | c7098ff | 2016-02-09 14:30:11 +0000 | [diff] [blame] | 254 | // This ensures that we have correct native line mapping for all native instructions. |
| 255 | // It is necessary to make stepping over a statement work. Otherwise, any initial |
| 256 | // instructions (e.g. moves) would be assumed to be the start of next statement. |
| 257 | MaybeRecordNativeDebugInfo(nullptr /* instruction */, block->GetDexPc()); |
Nicolas Geoffray | 86dbb9a | 2014-06-04 11:12:39 +0100 | [diff] [blame] | 258 | for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { |
| 259 | HInstruction* current = it.Current(); |
David Srbecky | d28f4a0 | 2016-03-14 17:14:24 +0000 | [diff] [blame] | 260 | if (current->HasEnvironment()) { |
| 261 | // Create stackmap for HNativeDebugInfo or any instruction which calls native code. |
| 262 | // Note that we need correct mapping for the native PC of the call instruction, |
| 263 | // so the runtime's stackmap is not sufficient since it is at PC after the call. |
| 264 | MaybeRecordNativeDebugInfo(current, block->GetDexPc()); |
| 265 | } |
Alexandre Rames | eb7b739 | 2015-06-19 14:47:01 +0100 | [diff] [blame] | 266 | DisassemblyScope disassembly_scope(current, *this); |
Alexandre Rames | 88c13cd | 2015-04-14 17:35:39 +0100 | [diff] [blame] | 267 | DCHECK(CheckTypeConsistency(current)); |
Nicolas Geoffray | 86dbb9a | 2014-06-04 11:12:39 +0100 | [diff] [blame] | 268 | current->Accept(instruction_visitor); |
| 269 | } |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 270 | } |
Nicolas Geoffray | 4c204ba | 2015-02-03 15:12:35 +0000 | [diff] [blame] | 271 | |
Alexandre Rames | eb7b739 | 2015-06-19 14:47:01 +0100 | [diff] [blame] | 272 | GenerateSlowPaths(); |
Nicolas Geoffray | 4c204ba | 2015-02-03 15:12:35 +0000 | [diff] [blame] | 273 | |
David Brazdil | 77a48ae | 2015-09-15 12:34:04 +0000 | [diff] [blame] | 274 | // Emit catch stack maps at the end of the stack map stream as expected by the |
| 275 | // runtime exception handler. |
David Brazdil | 58282f4 | 2016-01-14 12:45:10 +0000 | [diff] [blame] | 276 | if (graph_->HasTryCatch()) { |
David Brazdil | 77a48ae | 2015-09-15 12:34:04 +0000 | [diff] [blame] | 277 | RecordCatchBlockInfo(); |
| 278 | } |
| 279 | |
Nicolas Geoffray | 4c204ba | 2015-02-03 15:12:35 +0000 | [diff] [blame] | 280 | // Finalize instructions in assember; |
Serban Constantinescu | 32f5b4d | 2014-11-25 20:05:46 +0000 | [diff] [blame] | 281 | Finalize(allocator); |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 282 | } |
| 283 | |
Serban Constantinescu | 32f5b4d | 2014-11-25 20:05:46 +0000 | [diff] [blame] | 284 | void CodeGenerator::Finalize(CodeAllocator* allocator) { |
Nicolas Geoffray | 86dbb9a | 2014-06-04 11:12:39 +0100 | [diff] [blame] | 285 | size_t code_size = GetAssembler()->CodeSize(); |
| 286 | uint8_t* buffer = allocator->Allocate(code_size); |
Serban Constantinescu | 32f5b4d | 2014-11-25 20:05:46 +0000 | [diff] [blame] | 287 | |
Nicolas Geoffray | 86dbb9a | 2014-06-04 11:12:39 +0100 | [diff] [blame] | 288 | MemoryRegion code(buffer, code_size); |
| 289 | GetAssembler()->FinalizeInstructions(code); |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 290 | } |
| 291 | |
Vladimir Marko | 5815501 | 2015-08-19 12:49:41 +0000 | [diff] [blame] | 292 | void CodeGenerator::EmitLinkerPatches(ArenaVector<LinkerPatch>* linker_patches ATTRIBUTE_UNUSED) { |
| 293 | // No linker patches by default. |
| 294 | } |
| 295 | |
Nicolas Geoffray | 4c204ba | 2015-02-03 15:12:35 +0000 | [diff] [blame] | 296 | void CodeGenerator::InitializeCodeGeneration(size_t number_of_spill_slots, |
Vladimir Marko | 70e9746 | 2016-08-09 11:04:26 +0100 | [diff] [blame] | 297 | size_t maximum_safepoint_spill_size, |
Nicolas Geoffray | 4c204ba | 2015-02-03 15:12:35 +0000 | [diff] [blame] | 298 | size_t number_of_out_slots, |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 299 | const ArenaVector<HBasicBlock*>& block_order) { |
Nicolas Geoffray | 4c204ba | 2015-02-03 15:12:35 +0000 | [diff] [blame] | 300 | block_order_ = &block_order; |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 301 | DCHECK(!block_order.empty()); |
| 302 | DCHECK(block_order[0] == GetGraph()->GetEntryBlock()); |
Nicolas Geoffray | 4dee636 | 2015-01-23 18:23:14 +0000 | [diff] [blame] | 303 | ComputeSpillMask(); |
Alexandre Rames | 68bd9b9 | 2016-07-15 17:41:13 +0100 | [diff] [blame] | 304 | first_register_slot_in_slow_path_ = RoundUp( |
| 305 | (number_of_out_slots + number_of_spill_slots) * kVRegSize, GetPreferredSlotsAlignment()); |
Nicolas Geoffray | 3bca0df | 2014-09-19 11:01:00 +0100 | [diff] [blame] | 306 | |
Nicolas Geoffray | c0572a4 | 2015-02-06 14:35:25 +0000 | [diff] [blame] | 307 | if (number_of_spill_slots == 0 |
| 308 | && !HasAllocatedCalleeSaveRegisters() |
| 309 | && IsLeafMethod() |
| 310 | && !RequiresCurrentMethod()) { |
Vladimir Marko | 70e9746 | 2016-08-09 11:04:26 +0100 | [diff] [blame] | 311 | DCHECK_EQ(maximum_safepoint_spill_size, 0u); |
Nicolas Geoffray | c0572a4 | 2015-02-06 14:35:25 +0000 | [diff] [blame] | 312 | SetFrameSize(CallPushesPC() ? GetWordSize() : 0); |
| 313 | } else { |
| 314 | SetFrameSize(RoundUp( |
Alexandre Rames | 68bd9b9 | 2016-07-15 17:41:13 +0100 | [diff] [blame] | 315 | first_register_slot_in_slow_path_ |
Vladimir Marko | 70e9746 | 2016-08-09 11:04:26 +0100 | [diff] [blame] | 316 | + maximum_safepoint_spill_size |
Mingyao Yang | 063fc77 | 2016-08-02 11:02:54 -0700 | [diff] [blame] | 317 | + (GetGraph()->HasShouldDeoptimizeFlag() ? kShouldDeoptimizeFlagSize : 0) |
Nicolas Geoffray | c0572a4 | 2015-02-06 14:35:25 +0000 | [diff] [blame] | 318 | + FrameEntrySpillSize(), |
| 319 | kStackAlignment)); |
| 320 | } |
Nicolas Geoffray | ab032bc | 2014-07-15 12:55:21 +0100 | [diff] [blame] | 321 | } |
| 322 | |
Nicolas Geoffray | fd88f16 | 2015-06-03 11:23:52 +0100 | [diff] [blame] | 323 | void CodeGenerator::CreateCommonInvokeLocationSummary( |
Nicolas Geoffray | 4e40c26 | 2015-06-03 12:02:38 +0100 | [diff] [blame] | 324 | HInvoke* invoke, InvokeDexCallingConventionVisitor* visitor) { |
Nicolas Geoffray | fd88f16 | 2015-06-03 11:23:52 +0100 | [diff] [blame] | 325 | ArenaAllocator* allocator = invoke->GetBlock()->GetGraph()->GetArena(); |
Serban Constantinescu | 54ff482 | 2016-07-07 18:03:19 +0100 | [diff] [blame] | 326 | LocationSummary* locations = new (allocator) LocationSummary(invoke, |
| 327 | LocationSummary::kCallOnMainOnly); |
Nicolas Geoffray | fd88f16 | 2015-06-03 11:23:52 +0100 | [diff] [blame] | 328 | |
| 329 | for (size_t i = 0; i < invoke->GetNumberOfArguments(); i++) { |
| 330 | HInstruction* input = invoke->InputAt(i); |
| 331 | locations->SetInAt(i, visitor->GetNextLocation(input->GetType())); |
| 332 | } |
| 333 | |
| 334 | locations->SetOut(visitor->GetReturnLocation(invoke->GetType())); |
Nicolas Geoffray | 94015b9 | 2015-06-04 18:21:04 +0100 | [diff] [blame] | 335 | |
| 336 | if (invoke->IsInvokeStaticOrDirect()) { |
| 337 | HInvokeStaticOrDirect* call = invoke->AsInvokeStaticOrDirect(); |
Vladimir Marko | dc151b2 | 2015-10-15 18:02:30 +0100 | [diff] [blame] | 338 | switch (call->GetMethodLoadKind()) { |
| 339 | case HInvokeStaticOrDirect::MethodLoadKind::kRecursive: |
Vladimir Marko | c53c079 | 2015-11-19 15:48:33 +0000 | [diff] [blame] | 340 | locations->SetInAt(call->GetSpecialInputIndex(), visitor->GetMethodLocation()); |
Vladimir Marko | dc151b2 | 2015-10-15 18:02:30 +0100 | [diff] [blame] | 341 | break; |
Vladimir Marko | e7197bf | 2017-06-02 17:00:23 +0100 | [diff] [blame] | 342 | case HInvokeStaticOrDirect::MethodLoadKind::kRuntimeCall: |
Vladimir Marko | dc151b2 | 2015-10-15 18:02:30 +0100 | [diff] [blame] | 343 | locations->AddTemp(visitor->GetMethodLocation()); |
Vladimir Marko | c53c079 | 2015-11-19 15:48:33 +0000 | [diff] [blame] | 344 | locations->SetInAt(call->GetSpecialInputIndex(), Location::RequiresRegister()); |
Vladimir Marko | dc151b2 | 2015-10-15 18:02:30 +0100 | [diff] [blame] | 345 | break; |
| 346 | default: |
| 347 | locations->AddTemp(visitor->GetMethodLocation()); |
| 348 | break; |
Nicolas Geoffray | 94015b9 | 2015-06-04 18:21:04 +0100 | [diff] [blame] | 349 | } |
| 350 | } else { |
| 351 | locations->AddTemp(visitor->GetMethodLocation()); |
| 352 | } |
Nicolas Geoffray | fd88f16 | 2015-06-03 11:23:52 +0100 | [diff] [blame] | 353 | } |
| 354 | |
Vladimir Marko | e7197bf | 2017-06-02 17:00:23 +0100 | [diff] [blame] | 355 | void CodeGenerator::GenerateInvokeStaticOrDirectRuntimeCall( |
| 356 | HInvokeStaticOrDirect* invoke, Location temp, SlowPathCode* slow_path) { |
| 357 | MoveConstant(temp, invoke->GetDexMethodIndex()); |
| 358 | |
| 359 | // The access check is unnecessary but we do not want to introduce |
| 360 | // extra entrypoints for the codegens that do not support some |
| 361 | // invoke type and fall back to the runtime call. |
| 362 | |
| 363 | // Initialize to anything to silent compiler warnings. |
| 364 | QuickEntrypointEnum entrypoint = kQuickInvokeStaticTrampolineWithAccessCheck; |
| 365 | switch (invoke->GetInvokeType()) { |
| 366 | case kStatic: |
| 367 | entrypoint = kQuickInvokeStaticTrampolineWithAccessCheck; |
| 368 | break; |
| 369 | case kDirect: |
| 370 | entrypoint = kQuickInvokeDirectTrampolineWithAccessCheck; |
| 371 | break; |
| 372 | case kSuper: |
| 373 | entrypoint = kQuickInvokeSuperTrampolineWithAccessCheck; |
| 374 | break; |
| 375 | case kVirtual: |
| 376 | case kInterface: |
| 377 | LOG(FATAL) << "Unexpected invoke type: " << invoke->GetInvokeType(); |
| 378 | UNREACHABLE(); |
| 379 | } |
| 380 | |
| 381 | InvokeRuntime(entrypoint, invoke, invoke->GetDexPc(), slow_path); |
| 382 | } |
Calin Juravle | 175dc73 | 2015-08-25 15:42:32 +0100 | [diff] [blame] | 383 | void CodeGenerator::GenerateInvokeUnresolvedRuntimeCall(HInvokeUnresolved* invoke) { |
| 384 | MoveConstant(invoke->GetLocations()->GetTemp(0), invoke->GetDexMethodIndex()); |
| 385 | |
| 386 | // Initialize to anything to silent compiler warnings. |
| 387 | QuickEntrypointEnum entrypoint = kQuickInvokeStaticTrampolineWithAccessCheck; |
Nicolas Geoffray | 5e4e11e | 2016-09-22 13:17:41 +0100 | [diff] [blame] | 388 | switch (invoke->GetInvokeType()) { |
Calin Juravle | 175dc73 | 2015-08-25 15:42:32 +0100 | [diff] [blame] | 389 | case kStatic: |
| 390 | entrypoint = kQuickInvokeStaticTrampolineWithAccessCheck; |
| 391 | break; |
| 392 | case kDirect: |
| 393 | entrypoint = kQuickInvokeDirectTrampolineWithAccessCheck; |
| 394 | break; |
| 395 | case kVirtual: |
| 396 | entrypoint = kQuickInvokeVirtualTrampolineWithAccessCheck; |
| 397 | break; |
| 398 | case kSuper: |
| 399 | entrypoint = kQuickInvokeSuperTrampolineWithAccessCheck; |
| 400 | break; |
| 401 | case kInterface: |
| 402 | entrypoint = kQuickInvokeInterfaceTrampolineWithAccessCheck; |
| 403 | break; |
| 404 | } |
| 405 | InvokeRuntime(entrypoint, invoke, invoke->GetDexPc(), nullptr); |
| 406 | } |
| 407 | |
Orion Hodson | ac14139 | 2017-01-13 11:53:47 +0000 | [diff] [blame] | 408 | void CodeGenerator::GenerateInvokePolymorphicCall(HInvokePolymorphic* invoke) { |
| 409 | MoveConstant(invoke->GetLocations()->GetTemp(0), static_cast<int32_t>(invoke->GetType())); |
| 410 | QuickEntrypointEnum entrypoint = kQuickInvokePolymorphic; |
| 411 | InvokeRuntime(entrypoint, invoke, invoke->GetDexPc(), nullptr); |
| 412 | } |
| 413 | |
Calin Juravle | e460d1d | 2015-09-29 04:52:17 +0100 | [diff] [blame] | 414 | void CodeGenerator::CreateUnresolvedFieldLocationSummary( |
| 415 | HInstruction* field_access, |
| 416 | Primitive::Type field_type, |
| 417 | const FieldAccessCallingConvention& calling_convention) { |
| 418 | bool is_instance = field_access->IsUnresolvedInstanceFieldGet() |
| 419 | || field_access->IsUnresolvedInstanceFieldSet(); |
| 420 | bool is_get = field_access->IsUnresolvedInstanceFieldGet() |
| 421 | || field_access->IsUnresolvedStaticFieldGet(); |
| 422 | |
| 423 | ArenaAllocator* allocator = field_access->GetBlock()->GetGraph()->GetArena(); |
| 424 | LocationSummary* locations = |
Serban Constantinescu | 54ff482 | 2016-07-07 18:03:19 +0100 | [diff] [blame] | 425 | new (allocator) LocationSummary(field_access, LocationSummary::kCallOnMainOnly); |
Calin Juravle | e460d1d | 2015-09-29 04:52:17 +0100 | [diff] [blame] | 426 | |
| 427 | locations->AddTemp(calling_convention.GetFieldIndexLocation()); |
| 428 | |
| 429 | if (is_instance) { |
| 430 | // Add the `this` object for instance field accesses. |
| 431 | locations->SetInAt(0, calling_convention.GetObjectLocation()); |
| 432 | } |
| 433 | |
| 434 | // Note that pSetXXStatic/pGetXXStatic always takes/returns an int or int64 |
| 435 | // regardless of the the type. Because of that we forced to special case |
| 436 | // the access to floating point values. |
| 437 | if (is_get) { |
| 438 | if (Primitive::IsFloatingPointType(field_type)) { |
| 439 | // The return value will be stored in regular registers while register |
| 440 | // allocator expects it in a floating point register. |
| 441 | // Note We don't need to request additional temps because the return |
| 442 | // register(s) are already blocked due the call and they may overlap with |
| 443 | // the input or field index. |
| 444 | // The transfer between the two will be done at codegen level. |
| 445 | locations->SetOut(calling_convention.GetFpuLocation(field_type)); |
| 446 | } else { |
| 447 | locations->SetOut(calling_convention.GetReturnLocation(field_type)); |
| 448 | } |
| 449 | } else { |
| 450 | size_t set_index = is_instance ? 1 : 0; |
| 451 | if (Primitive::IsFloatingPointType(field_type)) { |
| 452 | // The set value comes from a float location while the calling convention |
| 453 | // expects it in a regular register location. Allocate a temp for it and |
| 454 | // make the transfer at codegen. |
| 455 | AddLocationAsTemp(calling_convention.GetSetValueLocation(field_type, is_instance), locations); |
| 456 | locations->SetInAt(set_index, calling_convention.GetFpuLocation(field_type)); |
| 457 | } else { |
| 458 | locations->SetInAt(set_index, |
| 459 | calling_convention.GetSetValueLocation(field_type, is_instance)); |
| 460 | } |
| 461 | } |
| 462 | } |
| 463 | |
| 464 | void CodeGenerator::GenerateUnresolvedFieldAccess( |
| 465 | HInstruction* field_access, |
| 466 | Primitive::Type field_type, |
| 467 | uint32_t field_index, |
| 468 | uint32_t dex_pc, |
| 469 | const FieldAccessCallingConvention& calling_convention) { |
| 470 | LocationSummary* locations = field_access->GetLocations(); |
| 471 | |
| 472 | MoveConstant(locations->GetTemp(0), field_index); |
| 473 | |
| 474 | bool is_instance = field_access->IsUnresolvedInstanceFieldGet() |
| 475 | || field_access->IsUnresolvedInstanceFieldSet(); |
| 476 | bool is_get = field_access->IsUnresolvedInstanceFieldGet() |
| 477 | || field_access->IsUnresolvedStaticFieldGet(); |
| 478 | |
| 479 | if (!is_get && Primitive::IsFloatingPointType(field_type)) { |
| 480 | // Copy the float value to be set into the calling convention register. |
| 481 | // Note that using directly the temp location is problematic as we don't |
| 482 | // support temp register pairs. To avoid boilerplate conversion code, use |
| 483 | // the location from the calling convention. |
| 484 | MoveLocation(calling_convention.GetSetValueLocation(field_type, is_instance), |
| 485 | locations->InAt(is_instance ? 1 : 0), |
| 486 | (Primitive::Is64BitType(field_type) ? Primitive::kPrimLong : Primitive::kPrimInt)); |
| 487 | } |
| 488 | |
| 489 | QuickEntrypointEnum entrypoint = kQuickSet8Static; // Initialize to anything to avoid warnings. |
| 490 | switch (field_type) { |
| 491 | case Primitive::kPrimBoolean: |
| 492 | entrypoint = is_instance |
| 493 | ? (is_get ? kQuickGetBooleanInstance : kQuickSet8Instance) |
| 494 | : (is_get ? kQuickGetBooleanStatic : kQuickSet8Static); |
| 495 | break; |
| 496 | case Primitive::kPrimByte: |
| 497 | entrypoint = is_instance |
| 498 | ? (is_get ? kQuickGetByteInstance : kQuickSet8Instance) |
| 499 | : (is_get ? kQuickGetByteStatic : kQuickSet8Static); |
| 500 | break; |
| 501 | case Primitive::kPrimShort: |
| 502 | entrypoint = is_instance |
| 503 | ? (is_get ? kQuickGetShortInstance : kQuickSet16Instance) |
| 504 | : (is_get ? kQuickGetShortStatic : kQuickSet16Static); |
| 505 | break; |
| 506 | case Primitive::kPrimChar: |
| 507 | entrypoint = is_instance |
| 508 | ? (is_get ? kQuickGetCharInstance : kQuickSet16Instance) |
| 509 | : (is_get ? kQuickGetCharStatic : kQuickSet16Static); |
| 510 | break; |
| 511 | case Primitive::kPrimInt: |
| 512 | case Primitive::kPrimFloat: |
| 513 | entrypoint = is_instance |
| 514 | ? (is_get ? kQuickGet32Instance : kQuickSet32Instance) |
| 515 | : (is_get ? kQuickGet32Static : kQuickSet32Static); |
| 516 | break; |
| 517 | case Primitive::kPrimNot: |
| 518 | entrypoint = is_instance |
| 519 | ? (is_get ? kQuickGetObjInstance : kQuickSetObjInstance) |
| 520 | : (is_get ? kQuickGetObjStatic : kQuickSetObjStatic); |
| 521 | break; |
| 522 | case Primitive::kPrimLong: |
| 523 | case Primitive::kPrimDouble: |
| 524 | entrypoint = is_instance |
| 525 | ? (is_get ? kQuickGet64Instance : kQuickSet64Instance) |
| 526 | : (is_get ? kQuickGet64Static : kQuickSet64Static); |
| 527 | break; |
| 528 | default: |
| 529 | LOG(FATAL) << "Invalid type " << field_type; |
| 530 | } |
| 531 | InvokeRuntime(entrypoint, field_access, dex_pc, nullptr); |
| 532 | |
| 533 | if (is_get && Primitive::IsFloatingPointType(field_type)) { |
| 534 | MoveLocation(locations->Out(), calling_convention.GetReturnLocation(field_type), field_type); |
| 535 | } |
| 536 | } |
| 537 | |
Vladimir Marko | 4155998 | 2017-01-06 14:04:23 +0000 | [diff] [blame] | 538 | void CodeGenerator::CreateLoadClassRuntimeCallLocationSummary(HLoadClass* cls, |
| 539 | Location runtime_type_index_location, |
| 540 | Location runtime_return_location) { |
Vladimir Marko | 847e6ce | 2017-06-02 13:55:07 +0100 | [diff] [blame] | 541 | DCHECK_EQ(cls->GetLoadKind(), HLoadClass::LoadKind::kRuntimeCall); |
Vladimir Marko | 4155998 | 2017-01-06 14:04:23 +0000 | [diff] [blame] | 542 | DCHECK_EQ(cls->InputCount(), 1u); |
| 543 | LocationSummary* locations = new (cls->GetBlock()->GetGraph()->GetArena()) LocationSummary( |
| 544 | cls, LocationSummary::kCallOnMainOnly); |
| 545 | locations->SetInAt(0, Location::NoLocation()); |
| 546 | locations->AddTemp(runtime_type_index_location); |
| 547 | locations->SetOut(runtime_return_location); |
Calin Juravle | 98893e1 | 2015-10-02 21:05:03 +0100 | [diff] [blame] | 548 | } |
| 549 | |
Vladimir Marko | 4155998 | 2017-01-06 14:04:23 +0000 | [diff] [blame] | 550 | void CodeGenerator::GenerateLoadClassRuntimeCall(HLoadClass* cls) { |
Vladimir Marko | 847e6ce | 2017-06-02 13:55:07 +0100 | [diff] [blame] | 551 | DCHECK_EQ(cls->GetLoadKind(), HLoadClass::LoadKind::kRuntimeCall); |
Vladimir Marko | 4155998 | 2017-01-06 14:04:23 +0000 | [diff] [blame] | 552 | LocationSummary* locations = cls->GetLocations(); |
| 553 | MoveConstant(locations->GetTemp(0), cls->GetTypeIndex().index_); |
| 554 | if (cls->NeedsAccessCheck()) { |
| 555 | CheckEntrypointTypes<kQuickInitializeTypeAndVerifyAccess, void*, uint32_t>(); |
| 556 | InvokeRuntime(kQuickInitializeTypeAndVerifyAccess, cls, cls->GetDexPc()); |
| 557 | } else if (cls->MustGenerateClinitCheck()) { |
| 558 | CheckEntrypointTypes<kQuickInitializeStaticStorage, void*, uint32_t>(); |
| 559 | InvokeRuntime(kQuickInitializeStaticStorage, cls, cls->GetDexPc()); |
| 560 | } else { |
| 561 | CheckEntrypointTypes<kQuickInitializeType, void*, uint32_t>(); |
| 562 | InvokeRuntime(kQuickInitializeType, cls, cls->GetDexPc()); |
| 563 | } |
| 564 | } |
Calin Juravle | 98893e1 | 2015-10-02 21:05:03 +0100 | [diff] [blame] | 565 | |
Mark Mendell | 5f87418 | 2015-03-04 15:42:45 -0500 | [diff] [blame] | 566 | void CodeGenerator::BlockIfInRegister(Location location, bool is_out) const { |
| 567 | // The DCHECKS below check that a register is not specified twice in |
| 568 | // the summary. The out location can overlap with an input, so we need |
| 569 | // to special case it. |
| 570 | if (location.IsRegister()) { |
| 571 | DCHECK(is_out || !blocked_core_registers_[location.reg()]); |
| 572 | blocked_core_registers_[location.reg()] = true; |
| 573 | } else if (location.IsFpuRegister()) { |
| 574 | DCHECK(is_out || !blocked_fpu_registers_[location.reg()]); |
| 575 | blocked_fpu_registers_[location.reg()] = true; |
| 576 | } else if (location.IsFpuRegisterPair()) { |
| 577 | DCHECK(is_out || !blocked_fpu_registers_[location.AsFpuRegisterPairLow<int>()]); |
| 578 | blocked_fpu_registers_[location.AsFpuRegisterPairLow<int>()] = true; |
| 579 | DCHECK(is_out || !blocked_fpu_registers_[location.AsFpuRegisterPairHigh<int>()]); |
| 580 | blocked_fpu_registers_[location.AsFpuRegisterPairHigh<int>()] = true; |
| 581 | } else if (location.IsRegisterPair()) { |
| 582 | DCHECK(is_out || !blocked_core_registers_[location.AsRegisterPairLow<int>()]); |
| 583 | blocked_core_registers_[location.AsRegisterPairLow<int>()] = true; |
| 584 | DCHECK(is_out || !blocked_core_registers_[location.AsRegisterPairHigh<int>()]); |
| 585 | blocked_core_registers_[location.AsRegisterPairHigh<int>()] = true; |
| 586 | } |
| 587 | } |
| 588 | |
Nicolas Geoffray | c0572a4 | 2015-02-06 14:35:25 +0000 | [diff] [blame] | 589 | void CodeGenerator::AllocateLocations(HInstruction* instruction) { |
Vladimir Marko | ec32f64 | 2017-06-02 10:51:55 +0100 | [diff] [blame] | 590 | for (HEnvironment* env = instruction->GetEnvironment(); env != nullptr; env = env->GetParent()) { |
| 591 | env->AllocateLocations(); |
| 592 | } |
Nicolas Geoffray | c0572a4 | 2015-02-06 14:35:25 +0000 | [diff] [blame] | 593 | instruction->Accept(GetLocationBuilder()); |
Alexandre Rames | 88c13cd | 2015-04-14 17:35:39 +0100 | [diff] [blame] | 594 | DCHECK(CheckTypeConsistency(instruction)); |
Nicolas Geoffray | c0572a4 | 2015-02-06 14:35:25 +0000 | [diff] [blame] | 595 | LocationSummary* locations = instruction->GetLocations(); |
| 596 | if (!instruction->IsSuspendCheckEntry()) { |
Aart Bik | d1c4045 | 2016-03-02 16:06:13 -0800 | [diff] [blame] | 597 | if (locations != nullptr) { |
| 598 | if (locations->CanCall()) { |
| 599 | MarkNotLeaf(); |
| 600 | } else if (locations->Intrinsified() && |
| 601 | instruction->IsInvokeStaticOrDirect() && |
| 602 | !instruction->AsInvokeStaticOrDirect()->HasCurrentMethodInput()) { |
| 603 | // A static method call that has been fully intrinsified, and cannot call on the slow |
| 604 | // path or refer to the current method directly, no longer needs current method. |
| 605 | return; |
| 606 | } |
Nicolas Geoffray | c0572a4 | 2015-02-06 14:35:25 +0000 | [diff] [blame] | 607 | } |
| 608 | if (instruction->NeedsCurrentMethod()) { |
| 609 | SetRequiresCurrentMethod(); |
| 610 | } |
| 611 | } |
| 612 | } |
| 613 | |
Serban Constantinescu | ecc4366 | 2015-08-13 13:33:12 +0100 | [diff] [blame] | 614 | void CodeGenerator::MaybeRecordStat(MethodCompilationStat compilation_stat, size_t count) const { |
| 615 | if (stats_ != nullptr) { |
| 616 | stats_->RecordStat(compilation_stat, count); |
| 617 | } |
| 618 | } |
| 619 | |
Vladimir Marko | d58b837 | 2016-04-12 18:51:43 +0100 | [diff] [blame] | 620 | std::unique_ptr<CodeGenerator> CodeGenerator::Create(HGraph* graph, |
| 621 | InstructionSet instruction_set, |
| 622 | const InstructionSetFeatures& isa_features, |
| 623 | const CompilerOptions& compiler_options, |
| 624 | OptimizingCompilerStats* stats) { |
| 625 | ArenaAllocator* arena = graph->GetArena(); |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 626 | switch (instruction_set) { |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 627 | #ifdef ART_ENABLE_CODEGEN_arm |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 628 | case kArm: |
| 629 | case kThumb2: { |
Scott Wakeling | fe88546 | 2016-09-22 10:24:38 +0100 | [diff] [blame] | 630 | if (kArmUseVIXL32) { |
| 631 | return std::unique_ptr<CodeGenerator>( |
| 632 | new (arena) arm::CodeGeneratorARMVIXL(graph, |
| 633 | *isa_features.AsArmInstructionSetFeatures(), |
| 634 | compiler_options, |
| 635 | stats)); |
| 636 | } else { |
| 637 | return std::unique_ptr<CodeGenerator>( |
| 638 | new (arena) arm::CodeGeneratorARM(graph, |
| 639 | *isa_features.AsArmInstructionSetFeatures(), |
| 640 | compiler_options, |
| 641 | stats)); |
| 642 | } |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 643 | } |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 644 | #endif |
| 645 | #ifdef ART_ENABLE_CODEGEN_arm64 |
Alexandre Rames | 5319def | 2014-10-23 10:03:10 +0100 | [diff] [blame] | 646 | case kArm64: { |
Vladimir Marko | d58b837 | 2016-04-12 18:51:43 +0100 | [diff] [blame] | 647 | return std::unique_ptr<CodeGenerator>( |
| 648 | new (arena) arm64::CodeGeneratorARM64(graph, |
| 649 | *isa_features.AsArm64InstructionSetFeatures(), |
| 650 | compiler_options, |
| 651 | stats)); |
Alexandre Rames | 5319def | 2014-10-23 10:03:10 +0100 | [diff] [blame] | 652 | } |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 653 | #endif |
| 654 | #ifdef ART_ENABLE_CODEGEN_mips |
Goran Jakovljevic | f652cec | 2015-08-25 16:11:42 +0200 | [diff] [blame] | 655 | case kMips: { |
Vladimir Marko | d58b837 | 2016-04-12 18:51:43 +0100 | [diff] [blame] | 656 | return std::unique_ptr<CodeGenerator>( |
| 657 | new (arena) mips::CodeGeneratorMIPS(graph, |
| 658 | *isa_features.AsMipsInstructionSetFeatures(), |
| 659 | compiler_options, |
| 660 | stats)); |
Goran Jakovljevic | f652cec | 2015-08-25 16:11:42 +0200 | [diff] [blame] | 661 | } |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 662 | #endif |
| 663 | #ifdef ART_ENABLE_CODEGEN_mips64 |
Alexey Frunze | 4dda337 | 2015-06-01 18:31:49 -0700 | [diff] [blame] | 664 | case kMips64: { |
Vladimir Marko | d58b837 | 2016-04-12 18:51:43 +0100 | [diff] [blame] | 665 | return std::unique_ptr<CodeGenerator>( |
| 666 | new (arena) mips64::CodeGeneratorMIPS64(graph, |
| 667 | *isa_features.AsMips64InstructionSetFeatures(), |
| 668 | compiler_options, |
| 669 | stats)); |
Alexey Frunze | 4dda337 | 2015-06-01 18:31:49 -0700 | [diff] [blame] | 670 | } |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 671 | #endif |
| 672 | #ifdef ART_ENABLE_CODEGEN_x86 |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 673 | case kX86: { |
Vladimir Marko | d58b837 | 2016-04-12 18:51:43 +0100 | [diff] [blame] | 674 | return std::unique_ptr<CodeGenerator>( |
| 675 | new (arena) x86::CodeGeneratorX86(graph, |
| 676 | *isa_features.AsX86InstructionSetFeatures(), |
| 677 | compiler_options, |
| 678 | stats)); |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 679 | } |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 680 | #endif |
| 681 | #ifdef ART_ENABLE_CODEGEN_x86_64 |
Dmitry Petrochenko | 6a58cb1 | 2014-04-02 17:27:59 +0700 | [diff] [blame] | 682 | case kX86_64: { |
Vladimir Marko | d58b837 | 2016-04-12 18:51:43 +0100 | [diff] [blame] | 683 | return std::unique_ptr<CodeGenerator>( |
| 684 | new (arena) x86_64::CodeGeneratorX86_64(graph, |
| 685 | *isa_features.AsX86_64InstructionSetFeatures(), |
| 686 | compiler_options, |
| 687 | stats)); |
Dmitry Petrochenko | 6a58cb1 | 2014-04-02 17:27:59 +0700 | [diff] [blame] | 688 | } |
Alex Light | 50fa993 | 2015-08-10 15:30:07 -0700 | [diff] [blame] | 689 | #endif |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 690 | default: |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 691 | return nullptr; |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 692 | } |
| 693 | } |
| 694 | |
Mathieu Chartier | cbcedbf | 2017-03-12 22:24:50 -0700 | [diff] [blame] | 695 | void CodeGenerator::ComputeStackMapAndMethodInfoSize(size_t* stack_map_size, |
| 696 | size_t* method_info_size) { |
| 697 | DCHECK(stack_map_size != nullptr); |
| 698 | DCHECK(method_info_size != nullptr); |
| 699 | *stack_map_size = stack_map_stream_.PrepareForFillIn(); |
| 700 | *method_info_size = stack_map_stream_.ComputeMethodInfoSize(); |
Nicolas Geoffray | d28b969 | 2015-11-04 14:36:55 +0000 | [diff] [blame] | 701 | } |
| 702 | |
Nicolas Geoffray | b331feb | 2016-02-05 16:51:53 +0000 | [diff] [blame] | 703 | static void CheckCovers(uint32_t dex_pc, |
| 704 | const HGraph& graph, |
| 705 | const CodeInfo& code_info, |
| 706 | const ArenaVector<HSuspendCheck*>& loop_headers, |
| 707 | ArenaVector<size_t>* covered) { |
David Srbecky | 09ed098 | 2016-02-12 21:58:43 +0000 | [diff] [blame] | 708 | CodeInfoEncoding encoding = code_info.ExtractEncoding(); |
Nicolas Geoffray | b331feb | 2016-02-05 16:51:53 +0000 | [diff] [blame] | 709 | for (size_t i = 0; i < loop_headers.size(); ++i) { |
| 710 | if (loop_headers[i]->GetDexPc() == dex_pc) { |
| 711 | if (graph.IsCompilingOsr()) { |
| 712 | DCHECK(code_info.GetOsrStackMapForDexPc(dex_pc, encoding).IsValid()); |
| 713 | } |
| 714 | ++(*covered)[i]; |
| 715 | } |
| 716 | } |
| 717 | } |
| 718 | |
| 719 | // Debug helper to ensure loop entries in compiled code are matched by |
| 720 | // dex branch instructions. |
| 721 | static void CheckLoopEntriesCanBeUsedForOsr(const HGraph& graph, |
| 722 | const CodeInfo& code_info, |
| 723 | const DexFile::CodeItem& code_item) { |
| 724 | if (graph.HasTryCatch()) { |
| 725 | // One can write loops through try/catch, which we do not support for OSR anyway. |
| 726 | return; |
| 727 | } |
| 728 | ArenaVector<HSuspendCheck*> loop_headers(graph.GetArena()->Adapter(kArenaAllocMisc)); |
Vladimir Marko | 2c45bc9 | 2016-10-25 16:54:12 +0100 | [diff] [blame] | 729 | for (HBasicBlock* block : graph.GetReversePostOrder()) { |
| 730 | if (block->IsLoopHeader()) { |
| 731 | HSuspendCheck* suspend_check = block->GetLoopInformation()->GetSuspendCheck(); |
Nicolas Geoffray | b331feb | 2016-02-05 16:51:53 +0000 | [diff] [blame] | 732 | if (!suspend_check->GetEnvironment()->IsFromInlinedInvoke()) { |
| 733 | loop_headers.push_back(suspend_check); |
| 734 | } |
| 735 | } |
| 736 | } |
| 737 | ArenaVector<size_t> covered(loop_headers.size(), 0, graph.GetArena()->Adapter(kArenaAllocMisc)); |
| 738 | const uint16_t* code_ptr = code_item.insns_; |
| 739 | const uint16_t* code_end = code_item.insns_ + code_item.insns_size_in_code_units_; |
| 740 | |
| 741 | size_t dex_pc = 0; |
| 742 | while (code_ptr < code_end) { |
| 743 | const Instruction& instruction = *Instruction::At(code_ptr); |
| 744 | if (instruction.IsBranch()) { |
| 745 | uint32_t target = dex_pc + instruction.GetTargetOffset(); |
| 746 | CheckCovers(target, graph, code_info, loop_headers, &covered); |
| 747 | } else if (instruction.IsSwitch()) { |
David Brazdil | 86ea7ee | 2016-02-16 09:26:07 +0000 | [diff] [blame] | 748 | DexSwitchTable table(instruction, dex_pc); |
Nicolas Geoffray | b331feb | 2016-02-05 16:51:53 +0000 | [diff] [blame] | 749 | uint16_t num_entries = table.GetNumEntries(); |
| 750 | size_t offset = table.GetFirstValueIndex(); |
| 751 | |
| 752 | // Use a larger loop counter type to avoid overflow issues. |
| 753 | for (size_t i = 0; i < num_entries; ++i) { |
| 754 | // The target of the case. |
| 755 | uint32_t target = dex_pc + table.GetEntryAt(i + offset); |
| 756 | CheckCovers(target, graph, code_info, loop_headers, &covered); |
| 757 | } |
| 758 | } |
| 759 | dex_pc += instruction.SizeInCodeUnits(); |
| 760 | code_ptr += instruction.SizeInCodeUnits(); |
| 761 | } |
| 762 | |
| 763 | for (size_t i = 0; i < covered.size(); ++i) { |
| 764 | DCHECK_NE(covered[i], 0u) << "Loop in compiled code has no dex branch equivalent"; |
| 765 | } |
| 766 | } |
| 767 | |
Mathieu Chartier | cbcedbf | 2017-03-12 22:24:50 -0700 | [diff] [blame] | 768 | void CodeGenerator::BuildStackMaps(MemoryRegion stack_map_region, |
| 769 | MemoryRegion method_info_region, |
| 770 | const DexFile::CodeItem& code_item) { |
| 771 | stack_map_stream_.FillInCodeInfo(stack_map_region); |
| 772 | stack_map_stream_.FillInMethodInfo(method_info_region); |
Nicolas Geoffray | b331feb | 2016-02-05 16:51:53 +0000 | [diff] [blame] | 773 | if (kIsDebugBuild) { |
Mathieu Chartier | cbcedbf | 2017-03-12 22:24:50 -0700 | [diff] [blame] | 774 | CheckLoopEntriesCanBeUsedForOsr(*graph_, CodeInfo(stack_map_region), code_item); |
Nicolas Geoffray | b331feb | 2016-02-05 16:51:53 +0000 | [diff] [blame] | 775 | } |
Nicolas Geoffray | 3946844 | 2014-09-02 15:17:15 +0100 | [diff] [blame] | 776 | } |
| 777 | |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 778 | void CodeGenerator::RecordPcInfo(HInstruction* instruction, |
| 779 | uint32_t dex_pc, |
| 780 | SlowPathCode* slow_path) { |
Calin Juravle | d2ec87d | 2014-12-08 14:24:46 +0000 | [diff] [blame] | 781 | if (instruction != nullptr) { |
Roland Levillain | 1693a1f | 2016-03-15 14:57:31 +0000 | [diff] [blame] | 782 | // The code generated for some type conversions |
Alexey Frunze | 4dda337 | 2015-06-01 18:31:49 -0700 | [diff] [blame] | 783 | // may call the runtime, thus normally requiring a subsequent |
| 784 | // call to this method. However, the method verifier does not |
| 785 | // produce PC information for certain instructions, which are |
| 786 | // considered "atomic" (they cannot join a GC). |
Roland Levillain | 624279f | 2014-12-04 11:54:28 +0000 | [diff] [blame] | 787 | // Therefore we do not currently record PC information for such |
| 788 | // instructions. As this may change later, we added this special |
| 789 | // case so that code generators may nevertheless call |
| 790 | // CodeGenerator::RecordPcInfo without triggering an error in |
| 791 | // CodeGenerator::BuildNativeGCMap ("Missing ref for dex pc 0x") |
| 792 | // thereafter. |
Roland Levillain | 1693a1f | 2016-03-15 14:57:31 +0000 | [diff] [blame] | 793 | if (instruction->IsTypeConversion()) { |
Calin Juravle | d2ec87d | 2014-12-08 14:24:46 +0000 | [diff] [blame] | 794 | return; |
| 795 | } |
| 796 | if (instruction->IsRem()) { |
| 797 | Primitive::Type type = instruction->AsRem()->GetResultType(); |
| 798 | if ((type == Primitive::kPrimFloat) || (type == Primitive::kPrimDouble)) { |
| 799 | return; |
| 800 | } |
| 801 | } |
Roland Levillain | 624279f | 2014-12-04 11:54:28 +0000 | [diff] [blame] | 802 | } |
| 803 | |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 804 | uint32_t outer_dex_pc = dex_pc; |
| 805 | uint32_t outer_environment_size = 0; |
| 806 | uint32_t inlining_depth = 0; |
| 807 | if (instruction != nullptr) { |
| 808 | for (HEnvironment* environment = instruction->GetEnvironment(); |
| 809 | environment != nullptr; |
| 810 | environment = environment->GetParent()) { |
| 811 | outer_dex_pc = environment->GetDexPc(); |
| 812 | outer_environment_size = environment->Size(); |
| 813 | if (environment != instruction->GetEnvironment()) { |
| 814 | inlining_depth++; |
| 815 | } |
| 816 | } |
| 817 | } |
| 818 | |
Nicolas Geoffray | 3946844 | 2014-09-02 15:17:15 +0100 | [diff] [blame] | 819 | // Collect PC infos for the mapping table. |
Alexey Frunze | 57eb0f5 | 2016-07-29 22:04:46 -0700 | [diff] [blame] | 820 | uint32_t native_pc = GetAssembler()->CodePosition(); |
Nicolas Geoffray | 3946844 | 2014-09-02 15:17:15 +0100 | [diff] [blame] | 821 | |
Nicolas Geoffray | 3946844 | 2014-09-02 15:17:15 +0100 | [diff] [blame] | 822 | if (instruction == nullptr) { |
David Srbecky | c7098ff | 2016-02-09 14:30:11 +0000 | [diff] [blame] | 823 | // For stack overflow checks and native-debug-info entries without dex register |
| 824 | // mapping (i.e. start of basic block or start of slow path). |
Vladimir Marko | bd8c725 | 2015-06-12 10:06:32 +0100 | [diff] [blame] | 825 | stack_map_stream_.BeginStackMapEntry(outer_dex_pc, native_pc, 0, 0, 0, 0); |
Calin Juravle | 4f46ac5 | 2015-04-23 18:47:21 +0100 | [diff] [blame] | 826 | stack_map_stream_.EndStackMapEntry(); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 827 | return; |
| 828 | } |
| 829 | LocationSummary* locations = instruction->GetLocations(); |
Nicolas Geoffray | 3946844 | 2014-09-02 15:17:15 +0100 | [diff] [blame] | 830 | |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 831 | uint32_t register_mask = locations->GetRegisterMask(); |
Vladimir Marko | 70e9746 | 2016-08-09 11:04:26 +0100 | [diff] [blame] | 832 | DCHECK_EQ(register_mask & ~locations->GetLiveRegisters()->GetCoreRegisters(), 0u); |
| 833 | if (locations->OnlyCallsOnSlowPath()) { |
| 834 | // In case of slow path, we currently set the location of caller-save registers |
| 835 | // to register (instead of their stack location when pushed before the slow-path |
| 836 | // call). Therefore register_mask contains both callee-save and caller-save |
| 837 | // registers that hold objects. We must remove the spilled caller-save from the |
| 838 | // mask, since they will be overwritten by the callee. |
| 839 | uint32_t spills = GetSlowPathSpills(locations, /* core_registers */ true); |
| 840 | register_mask &= ~spills; |
Vladimir Marko | 952dbb1 | 2016-07-28 12:01:51 +0100 | [diff] [blame] | 841 | } else { |
Vladimir Marko | 952dbb1 | 2016-07-28 12:01:51 +0100 | [diff] [blame] | 842 | // The register mask must be a subset of callee-save registers. |
| 843 | DCHECK_EQ(register_mask & core_callee_save_mask_, register_mask); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 844 | } |
Vladimir Marko | bd8c725 | 2015-06-12 10:06:32 +0100 | [diff] [blame] | 845 | stack_map_stream_.BeginStackMapEntry(outer_dex_pc, |
| 846 | native_pc, |
Calin Juravle | 4f46ac5 | 2015-04-23 18:47:21 +0100 | [diff] [blame] | 847 | register_mask, |
| 848 | locations->GetStackMask(), |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 849 | outer_environment_size, |
Calin Juravle | 4f46ac5 | 2015-04-23 18:47:21 +0100 | [diff] [blame] | 850 | inlining_depth); |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 851 | |
Mathieu Chartier | d776ff0 | 2017-01-17 09:32:18 -0800 | [diff] [blame] | 852 | HEnvironment* const environment = instruction->GetEnvironment(); |
| 853 | EmitEnvironment(environment, slow_path); |
| 854 | // Record invoke info, the common case for the trampoline is super and static invokes. Only |
| 855 | // record these to reduce oat file size. |
| 856 | if (kEnableDexLayoutOptimizations) { |
| 857 | if (environment != nullptr && |
| 858 | instruction->IsInvoke() && |
| 859 | instruction->IsInvokeStaticOrDirect()) { |
| 860 | HInvoke* const invoke = instruction->AsInvoke(); |
| 861 | stack_map_stream_.AddInvoke(invoke->GetInvokeType(), invoke->GetDexMethodIndex()); |
| 862 | } |
| 863 | } |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 864 | stack_map_stream_.EndStackMapEntry(); |
Nicolas Geoffray | b331feb | 2016-02-05 16:51:53 +0000 | [diff] [blame] | 865 | |
| 866 | HLoopInformation* info = instruction->GetBlock()->GetLoopInformation(); |
| 867 | if (instruction->IsSuspendCheck() && |
| 868 | (info != nullptr) && |
| 869 | graph_->IsCompilingOsr() && |
| 870 | (inlining_depth == 0)) { |
| 871 | DCHECK_EQ(info->GetSuspendCheck(), instruction); |
| 872 | // We duplicate the stack map as a marker that this stack map can be an OSR entry. |
| 873 | // Duplicating it avoids having the runtime recognize and skip an OSR stack map. |
| 874 | DCHECK(info->IsIrreducible()); |
| 875 | stack_map_stream_.BeginStackMapEntry( |
| 876 | dex_pc, native_pc, register_mask, locations->GetStackMask(), outer_environment_size, 0); |
| 877 | EmitEnvironment(instruction->GetEnvironment(), slow_path); |
| 878 | stack_map_stream_.EndStackMapEntry(); |
| 879 | if (kIsDebugBuild) { |
Nicolas Geoffray | b331feb | 2016-02-05 16:51:53 +0000 | [diff] [blame] | 880 | for (size_t i = 0, environment_size = environment->Size(); i < environment_size; ++i) { |
| 881 | HInstruction* in_environment = environment->GetInstructionAt(i); |
| 882 | if (in_environment != nullptr) { |
| 883 | DCHECK(in_environment->IsPhi() || in_environment->IsConstant()); |
| 884 | Location location = environment->GetLocationAt(i); |
| 885 | DCHECK(location.IsStackSlot() || |
| 886 | location.IsDoubleStackSlot() || |
| 887 | location.IsConstant() || |
| 888 | location.IsInvalid()); |
| 889 | if (location.IsStackSlot() || location.IsDoubleStackSlot()) { |
| 890 | DCHECK_LT(location.GetStackIndex(), static_cast<int32_t>(GetFrameSize())); |
| 891 | } |
| 892 | } |
| 893 | } |
| 894 | } |
| 895 | } else if (kIsDebugBuild) { |
| 896 | // Ensure stack maps are unique, by checking that the native pc in the stack map |
| 897 | // last emitted is different than the native pc of the stack map just emitted. |
| 898 | size_t number_of_stack_maps = stack_map_stream_.GetNumberOfStackMaps(); |
| 899 | if (number_of_stack_maps > 1) { |
Mathieu Chartier | a2f526f | 2017-01-19 14:48:48 -0800 | [diff] [blame] | 900 | DCHECK_NE(stack_map_stream_.GetStackMap(number_of_stack_maps - 1).native_pc_code_offset, |
| 901 | stack_map_stream_.GetStackMap(number_of_stack_maps - 2).native_pc_code_offset); |
Nicolas Geoffray | b331feb | 2016-02-05 16:51:53 +0000 | [diff] [blame] | 902 | } |
| 903 | } |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 904 | } |
| 905 | |
David Srbecky | b7070a2 | 2016-01-08 18:13:53 +0000 | [diff] [blame] | 906 | bool CodeGenerator::HasStackMapAtCurrentPc() { |
| 907 | uint32_t pc = GetAssembler()->CodeSize(); |
| 908 | size_t count = stack_map_stream_.GetNumberOfStackMaps(); |
Andreas Gampe | 0c95c12 | 2017-02-26 14:10:28 -0800 | [diff] [blame] | 909 | if (count == 0) { |
| 910 | return false; |
| 911 | } |
Mathieu Chartier | a2f526f | 2017-01-19 14:48:48 -0800 | [diff] [blame] | 912 | CodeOffset native_pc_offset = stack_map_stream_.GetStackMap(count - 1).native_pc_code_offset; |
Andreas Gampe | 0c95c12 | 2017-02-26 14:10:28 -0800 | [diff] [blame] | 913 | return (native_pc_offset.Uint32Value(GetInstructionSet()) == pc); |
David Srbecky | b7070a2 | 2016-01-08 18:13:53 +0000 | [diff] [blame] | 914 | } |
| 915 | |
David Srbecky | d28f4a0 | 2016-03-14 17:14:24 +0000 | [diff] [blame] | 916 | void CodeGenerator::MaybeRecordNativeDebugInfo(HInstruction* instruction, |
| 917 | uint32_t dex_pc, |
| 918 | SlowPathCode* slow_path) { |
David Srbecky | c7098ff | 2016-02-09 14:30:11 +0000 | [diff] [blame] | 919 | if (GetCompilerOptions().GetNativeDebuggable() && dex_pc != kNoDexPc) { |
| 920 | if (HasStackMapAtCurrentPc()) { |
| 921 | // Ensure that we do not collide with the stack map of the previous instruction. |
| 922 | GenerateNop(); |
| 923 | } |
David Srbecky | d28f4a0 | 2016-03-14 17:14:24 +0000 | [diff] [blame] | 924 | RecordPcInfo(instruction, dex_pc, slow_path); |
David Srbecky | c7098ff | 2016-02-09 14:30:11 +0000 | [diff] [blame] | 925 | } |
| 926 | } |
| 927 | |
David Brazdil | 77a48ae | 2015-09-15 12:34:04 +0000 | [diff] [blame] | 928 | void CodeGenerator::RecordCatchBlockInfo() { |
| 929 | ArenaAllocator* arena = graph_->GetArena(); |
| 930 | |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 931 | for (HBasicBlock* block : *block_order_) { |
David Brazdil | 77a48ae | 2015-09-15 12:34:04 +0000 | [diff] [blame] | 932 | if (!block->IsCatchBlock()) { |
| 933 | continue; |
| 934 | } |
| 935 | |
| 936 | uint32_t dex_pc = block->GetDexPc(); |
| 937 | uint32_t num_vregs = graph_->GetNumberOfVRegs(); |
| 938 | uint32_t inlining_depth = 0; // Inlining of catch blocks is not supported at the moment. |
| 939 | uint32_t native_pc = GetAddressOf(block); |
| 940 | uint32_t register_mask = 0; // Not used. |
| 941 | |
| 942 | // The stack mask is not used, so we leave it empty. |
Vladimir Marko | f6a35de | 2016-03-21 12:01:50 +0000 | [diff] [blame] | 943 | ArenaBitVector* stack_mask = |
| 944 | ArenaBitVector::Create(arena, 0, /* expandable */ true, kArenaAllocCodeGenerator); |
David Brazdil | 77a48ae | 2015-09-15 12:34:04 +0000 | [diff] [blame] | 945 | |
| 946 | stack_map_stream_.BeginStackMapEntry(dex_pc, |
| 947 | native_pc, |
| 948 | register_mask, |
| 949 | stack_mask, |
| 950 | num_vregs, |
| 951 | inlining_depth); |
| 952 | |
| 953 | HInstruction* current_phi = block->GetFirstPhi(); |
| 954 | for (size_t vreg = 0; vreg < num_vregs; ++vreg) { |
| 955 | while (current_phi != nullptr && current_phi->AsPhi()->GetRegNumber() < vreg) { |
| 956 | HInstruction* next_phi = current_phi->GetNext(); |
| 957 | DCHECK(next_phi == nullptr || |
| 958 | current_phi->AsPhi()->GetRegNumber() <= next_phi->AsPhi()->GetRegNumber()) |
| 959 | << "Phis need to be sorted by vreg number to keep this a linear-time loop."; |
| 960 | current_phi = next_phi; |
| 961 | } |
| 962 | |
| 963 | if (current_phi == nullptr || current_phi->AsPhi()->GetRegNumber() != vreg) { |
| 964 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kNone, 0); |
| 965 | } else { |
| 966 | Location location = current_phi->GetLiveInterval()->ToLocation(); |
| 967 | switch (location.GetKind()) { |
| 968 | case Location::kStackSlot: { |
| 969 | stack_map_stream_.AddDexRegisterEntry( |
| 970 | DexRegisterLocation::Kind::kInStack, location.GetStackIndex()); |
| 971 | break; |
| 972 | } |
| 973 | case Location::kDoubleStackSlot: { |
| 974 | stack_map_stream_.AddDexRegisterEntry( |
| 975 | DexRegisterLocation::Kind::kInStack, location.GetStackIndex()); |
| 976 | stack_map_stream_.AddDexRegisterEntry( |
| 977 | DexRegisterLocation::Kind::kInStack, location.GetHighStackIndex(kVRegSize)); |
| 978 | ++vreg; |
| 979 | DCHECK_LT(vreg, num_vregs); |
| 980 | break; |
| 981 | } |
| 982 | default: { |
| 983 | // All catch phis must be allocated to a stack slot. |
| 984 | LOG(FATAL) << "Unexpected kind " << location.GetKind(); |
| 985 | UNREACHABLE(); |
| 986 | } |
| 987 | } |
| 988 | } |
| 989 | } |
| 990 | |
| 991 | stack_map_stream_.EndStackMapEntry(); |
| 992 | } |
| 993 | } |
| 994 | |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 995 | void CodeGenerator::EmitEnvironment(HEnvironment* environment, SlowPathCode* slow_path) { |
| 996 | if (environment == nullptr) return; |
| 997 | |
| 998 | if (environment->GetParent() != nullptr) { |
| 999 | // We emit the parent environment first. |
| 1000 | EmitEnvironment(environment->GetParent(), slow_path); |
Nicolas Geoffray | 5d37c15 | 2017-01-12 13:25:19 +0000 | [diff] [blame] | 1001 | stack_map_stream_.BeginInlineInfoEntry(environment->GetMethod(), |
Nicolas Geoffray | b176d7c | 2015-05-20 18:48:31 +0100 | [diff] [blame] | 1002 | environment->GetDexPc(), |
Nicolas Geoffray | 5d37c15 | 2017-01-12 13:25:19 +0000 | [diff] [blame] | 1003 | environment->Size(), |
| 1004 | &graph_->GetDexFile()); |
Nicolas Geoffray | 0a23d74 | 2015-05-07 11:57:35 +0100 | [diff] [blame] | 1005 | } |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1006 | |
| 1007 | // Walk over the environment, and record the location of dex registers. |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1008 | for (size_t i = 0, environment_size = environment->Size(); i < environment_size; ++i) { |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1009 | HInstruction* current = environment->GetInstructionAt(i); |
| 1010 | if (current == nullptr) { |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1011 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kNone, 0); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1012 | continue; |
Nicolas Geoffray | 3946844 | 2014-09-02 15:17:15 +0100 | [diff] [blame] | 1013 | } |
| 1014 | |
Nicolas Geoffray | 0a23d74 | 2015-05-07 11:57:35 +0100 | [diff] [blame] | 1015 | Location location = environment->GetLocationAt(i); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1016 | switch (location.GetKind()) { |
| 1017 | case Location::kConstant: { |
| 1018 | DCHECK_EQ(current, location.GetConstant()); |
| 1019 | if (current->IsLongConstant()) { |
| 1020 | int64_t value = current->AsLongConstant()->GetValue(); |
| 1021 | stack_map_stream_.AddDexRegisterEntry( |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1022 | DexRegisterLocation::Kind::kConstant, Low32Bits(value)); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1023 | stack_map_stream_.AddDexRegisterEntry( |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1024 | DexRegisterLocation::Kind::kConstant, High32Bits(value)); |
| 1025 | ++i; |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1026 | DCHECK_LT(i, environment_size); |
| 1027 | } else if (current->IsDoubleConstant()) { |
Roland Levillain | da4d79b | 2015-03-24 14:36:11 +0000 | [diff] [blame] | 1028 | int64_t value = bit_cast<int64_t, double>(current->AsDoubleConstant()->GetValue()); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1029 | stack_map_stream_.AddDexRegisterEntry( |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1030 | DexRegisterLocation::Kind::kConstant, Low32Bits(value)); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1031 | stack_map_stream_.AddDexRegisterEntry( |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1032 | DexRegisterLocation::Kind::kConstant, High32Bits(value)); |
| 1033 | ++i; |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1034 | DCHECK_LT(i, environment_size); |
| 1035 | } else if (current->IsIntConstant()) { |
| 1036 | int32_t value = current->AsIntConstant()->GetValue(); |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1037 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kConstant, value); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1038 | } else if (current->IsNullConstant()) { |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1039 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kConstant, 0); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1040 | } else { |
| 1041 | DCHECK(current->IsFloatConstant()) << current->DebugName(); |
Roland Levillain | da4d79b | 2015-03-24 14:36:11 +0000 | [diff] [blame] | 1042 | int32_t value = bit_cast<int32_t, float>(current->AsFloatConstant()->GetValue()); |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1043 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kConstant, value); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1044 | } |
| 1045 | break; |
| 1046 | } |
| 1047 | |
| 1048 | case Location::kStackSlot: { |
| 1049 | stack_map_stream_.AddDexRegisterEntry( |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1050 | DexRegisterLocation::Kind::kInStack, location.GetStackIndex()); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1051 | break; |
| 1052 | } |
| 1053 | |
| 1054 | case Location::kDoubleStackSlot: { |
| 1055 | stack_map_stream_.AddDexRegisterEntry( |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1056 | DexRegisterLocation::Kind::kInStack, location.GetStackIndex()); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1057 | stack_map_stream_.AddDexRegisterEntry( |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1058 | DexRegisterLocation::Kind::kInStack, location.GetHighStackIndex(kVRegSize)); |
| 1059 | ++i; |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1060 | DCHECK_LT(i, environment_size); |
| 1061 | break; |
| 1062 | } |
| 1063 | |
| 1064 | case Location::kRegister : { |
| 1065 | int id = location.reg(); |
| 1066 | if (slow_path != nullptr && slow_path->IsCoreRegisterSaved(id)) { |
| 1067 | uint32_t offset = slow_path->GetStackOffsetOfCoreRegister(id); |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1068 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kInStack, offset); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1069 | if (current->GetType() == Primitive::kPrimLong) { |
| 1070 | stack_map_stream_.AddDexRegisterEntry( |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1071 | DexRegisterLocation::Kind::kInStack, offset + kVRegSize); |
| 1072 | ++i; |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1073 | DCHECK_LT(i, environment_size); |
| 1074 | } |
| 1075 | } else { |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1076 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kInRegister, id); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1077 | if (current->GetType() == Primitive::kPrimLong) { |
David Brazdil | d9cb68e | 2015-08-25 13:52:43 +0100 | [diff] [blame] | 1078 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kInRegisterHigh, id); |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1079 | ++i; |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1080 | DCHECK_LT(i, environment_size); |
| 1081 | } |
| 1082 | } |
| 1083 | break; |
| 1084 | } |
| 1085 | |
| 1086 | case Location::kFpuRegister : { |
| 1087 | int id = location.reg(); |
| 1088 | if (slow_path != nullptr && slow_path->IsFpuRegisterSaved(id)) { |
| 1089 | uint32_t offset = slow_path->GetStackOffsetOfFpuRegister(id); |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1090 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kInStack, offset); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1091 | if (current->GetType() == Primitive::kPrimDouble) { |
| 1092 | stack_map_stream_.AddDexRegisterEntry( |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1093 | DexRegisterLocation::Kind::kInStack, offset + kVRegSize); |
| 1094 | ++i; |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1095 | DCHECK_LT(i, environment_size); |
| 1096 | } |
| 1097 | } else { |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1098 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kInFpuRegister, id); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1099 | if (current->GetType() == Primitive::kPrimDouble) { |
David Brazdil | d9cb68e | 2015-08-25 13:52:43 +0100 | [diff] [blame] | 1100 | stack_map_stream_.AddDexRegisterEntry( |
| 1101 | DexRegisterLocation::Kind::kInFpuRegisterHigh, id); |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1102 | ++i; |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1103 | DCHECK_LT(i, environment_size); |
| 1104 | } |
| 1105 | } |
| 1106 | break; |
| 1107 | } |
| 1108 | |
| 1109 | case Location::kFpuRegisterPair : { |
| 1110 | int low = location.low(); |
| 1111 | int high = location.high(); |
| 1112 | if (slow_path != nullptr && slow_path->IsFpuRegisterSaved(low)) { |
| 1113 | uint32_t offset = slow_path->GetStackOffsetOfFpuRegister(low); |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1114 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kInStack, offset); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1115 | } else { |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1116 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kInFpuRegister, low); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1117 | } |
| 1118 | if (slow_path != nullptr && slow_path->IsFpuRegisterSaved(high)) { |
| 1119 | uint32_t offset = slow_path->GetStackOffsetOfFpuRegister(high); |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1120 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kInStack, offset); |
| 1121 | ++i; |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1122 | } else { |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1123 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kInFpuRegister, high); |
| 1124 | ++i; |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1125 | } |
| 1126 | DCHECK_LT(i, environment_size); |
| 1127 | break; |
| 1128 | } |
| 1129 | |
| 1130 | case Location::kRegisterPair : { |
| 1131 | int low = location.low(); |
| 1132 | int high = location.high(); |
| 1133 | if (slow_path != nullptr && slow_path->IsCoreRegisterSaved(low)) { |
| 1134 | uint32_t offset = slow_path->GetStackOffsetOfCoreRegister(low); |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1135 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kInStack, offset); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1136 | } else { |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1137 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kInRegister, low); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1138 | } |
| 1139 | if (slow_path != nullptr && slow_path->IsCoreRegisterSaved(high)) { |
| 1140 | uint32_t offset = slow_path->GetStackOffsetOfCoreRegister(high); |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1141 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kInStack, offset); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1142 | } else { |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1143 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kInRegister, high); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1144 | } |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1145 | ++i; |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1146 | DCHECK_LT(i, environment_size); |
| 1147 | break; |
| 1148 | } |
| 1149 | |
| 1150 | case Location::kInvalid: { |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1151 | stack_map_stream_.AddDexRegisterEntry(DexRegisterLocation::Kind::kNone, 0); |
Nicolas Geoffray | eeefa12 | 2015-03-13 18:52:59 +0000 | [diff] [blame] | 1152 | break; |
| 1153 | } |
| 1154 | |
| 1155 | default: |
| 1156 | LOG(FATAL) << "Unexpected kind " << location.GetKind(); |
| 1157 | } |
Nicolas Geoffray | 3946844 | 2014-09-02 15:17:15 +0100 | [diff] [blame] | 1158 | } |
Nicolas Geoffray | b1d0f3f | 2015-05-14 12:41:51 +0100 | [diff] [blame] | 1159 | |
| 1160 | if (environment->GetParent() != nullptr) { |
| 1161 | stack_map_stream_.EndInlineInfoEntry(); |
| 1162 | } |
Nicolas Geoffray | 3946844 | 2014-09-02 15:17:15 +0100 | [diff] [blame] | 1163 | } |
| 1164 | |
Calin Juravle | 77520bc | 2015-01-12 18:45:46 +0000 | [diff] [blame] | 1165 | bool CodeGenerator::CanMoveNullCheckToUser(HNullCheck* null_check) { |
| 1166 | HInstruction* first_next_not_move = null_check->GetNextDisregardingMoves(); |
Calin Juravle | 641547a | 2015-04-21 22:08:51 +0100 | [diff] [blame] | 1167 | |
| 1168 | return (first_next_not_move != nullptr) |
| 1169 | && first_next_not_move->CanDoImplicitNullCheckOn(null_check->InputAt(0)); |
Calin Juravle | 77520bc | 2015-01-12 18:45:46 +0000 | [diff] [blame] | 1170 | } |
| 1171 | |
| 1172 | void CodeGenerator::MaybeRecordImplicitNullCheck(HInstruction* instr) { |
Vladimir Marko | 3b7537b | 2016-09-13 11:56:01 +0000 | [diff] [blame] | 1173 | if (!compiler_options_.GetImplicitNullChecks()) { |
| 1174 | return; |
| 1175 | } |
| 1176 | |
Calin Juravle | 77520bc | 2015-01-12 18:45:46 +0000 | [diff] [blame] | 1177 | // If we are from a static path don't record the pc as we can't throw NPE. |
| 1178 | // NB: having the checks here makes the code much less verbose in the arch |
| 1179 | // specific code generators. |
| 1180 | if (instr->IsStaticFieldSet() || instr->IsStaticFieldGet()) { |
| 1181 | return; |
| 1182 | } |
| 1183 | |
Calin Juravle | 641547a | 2015-04-21 22:08:51 +0100 | [diff] [blame] | 1184 | if (!instr->CanDoImplicitNullCheckOn(instr->InputAt(0))) { |
Calin Juravle | 77520bc | 2015-01-12 18:45:46 +0000 | [diff] [blame] | 1185 | return; |
| 1186 | } |
| 1187 | |
| 1188 | // Find the first previous instruction which is not a move. |
| 1189 | HInstruction* first_prev_not_move = instr->GetPreviousDisregardingMoves(); |
| 1190 | |
| 1191 | // If the instruction is a null check it means that `instr` is the first user |
| 1192 | // and needs to record the pc. |
| 1193 | if (first_prev_not_move != nullptr && first_prev_not_move->IsNullCheck()) { |
| 1194 | HNullCheck* null_check = first_prev_not_move->AsNullCheck(); |
Vladimir Marko | 3b7537b | 2016-09-13 11:56:01 +0000 | [diff] [blame] | 1195 | // TODO: The parallel moves modify the environment. Their changes need to be |
| 1196 | // reverted otherwise the stack maps at the throw point will not be correct. |
| 1197 | RecordPcInfo(null_check, null_check->GetDexPc()); |
Calin Juravle | 77520bc | 2015-01-12 18:45:46 +0000 | [diff] [blame] | 1198 | } |
| 1199 | } |
| 1200 | |
Vladimir Marko | 804b03f | 2016-09-14 16:26:36 +0100 | [diff] [blame] | 1201 | LocationSummary* CodeGenerator::CreateThrowingSlowPathLocations(HInstruction* instruction, |
| 1202 | RegisterSet caller_saves) { |
Vladimir Marko | 3b7537b | 2016-09-13 11:56:01 +0000 | [diff] [blame] | 1203 | // Note: Using kNoCall allows the method to be treated as leaf (and eliminate the |
| 1204 | // HSuspendCheck from entry block). However, it will still get a valid stack frame |
| 1205 | // because the HNullCheck needs an environment. |
| 1206 | LocationSummary::CallKind call_kind = LocationSummary::kNoCall; |
| 1207 | // When throwing from a try block, we may need to retrieve dalvik registers from |
| 1208 | // physical registers and we also need to set up stack mask for GC. This is |
| 1209 | // implicitly achieved by passing kCallOnSlowPath to the LocationSummary. |
Vladimir Marko | 804b03f | 2016-09-14 16:26:36 +0100 | [diff] [blame] | 1210 | bool can_throw_into_catch_block = instruction->CanThrowIntoCatchBlock(); |
Vladimir Marko | 3b7537b | 2016-09-13 11:56:01 +0000 | [diff] [blame] | 1211 | if (can_throw_into_catch_block) { |
| 1212 | call_kind = LocationSummary::kCallOnSlowPath; |
| 1213 | } |
Vladimir Marko | 804b03f | 2016-09-14 16:26:36 +0100 | [diff] [blame] | 1214 | LocationSummary* locations = new (GetGraph()->GetArena()) LocationSummary(instruction, call_kind); |
Vladimir Marko | 3b7537b | 2016-09-13 11:56:01 +0000 | [diff] [blame] | 1215 | if (can_throw_into_catch_block && compiler_options_.GetImplicitNullChecks()) { |
Vladimir Marko | 804b03f | 2016-09-14 16:26:36 +0100 | [diff] [blame] | 1216 | locations->SetCustomSlowPathCallerSaves(caller_saves); // Default: no caller-save registers. |
Vladimir Marko | 3b7537b | 2016-09-13 11:56:01 +0000 | [diff] [blame] | 1217 | } |
Vladimir Marko | 804b03f | 2016-09-14 16:26:36 +0100 | [diff] [blame] | 1218 | DCHECK(!instruction->HasUses()); |
Vladimir Marko | 3b7537b | 2016-09-13 11:56:01 +0000 | [diff] [blame] | 1219 | return locations; |
| 1220 | } |
| 1221 | |
Calin Juravle | 2ae4818 | 2016-03-16 14:05:09 +0000 | [diff] [blame] | 1222 | void CodeGenerator::GenerateNullCheck(HNullCheck* instruction) { |
Vladimir Marko | 3b7537b | 2016-09-13 11:56:01 +0000 | [diff] [blame] | 1223 | if (compiler_options_.GetImplicitNullChecks()) { |
Calin Juravle | 2ae4818 | 2016-03-16 14:05:09 +0000 | [diff] [blame] | 1224 | MaybeRecordStat(kImplicitNullCheckGenerated); |
| 1225 | GenerateImplicitNullCheck(instruction); |
| 1226 | } else { |
| 1227 | MaybeRecordStat(kExplicitNullCheckGenerated); |
| 1228 | GenerateExplicitNullCheck(instruction); |
| 1229 | } |
| 1230 | } |
| 1231 | |
Nicolas Geoffray | 3c04974 | 2014-09-24 18:10:46 +0100 | [diff] [blame] | 1232 | void CodeGenerator::ClearSpillSlotsFromLoopPhisInStackMap(HSuspendCheck* suspend_check) const { |
| 1233 | LocationSummary* locations = suspend_check->GetLocations(); |
| 1234 | HBasicBlock* block = suspend_check->GetBlock(); |
| 1235 | DCHECK(block->GetLoopInformation()->GetSuspendCheck() == suspend_check); |
| 1236 | DCHECK(block->IsLoopHeader()); |
| 1237 | |
| 1238 | for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { |
| 1239 | HInstruction* current = it.Current(); |
| 1240 | LiveInterval* interval = current->GetLiveInterval(); |
| 1241 | // We only need to clear bits of loop phis containing objects and allocated in register. |
| 1242 | // Loop phis allocated on stack already have the object in the stack. |
| 1243 | if (current->GetType() == Primitive::kPrimNot |
| 1244 | && interval->HasRegister() |
| 1245 | && interval->HasSpillSlot()) { |
| 1246 | locations->ClearStackBit(interval->GetSpillSlot() / kVRegSize); |
| 1247 | } |
| 1248 | } |
| 1249 | } |
| 1250 | |
Nicolas Geoffray | 9021825 | 2015-04-15 11:56:51 +0100 | [diff] [blame] | 1251 | void CodeGenerator::EmitParallelMoves(Location from1, |
| 1252 | Location to1, |
| 1253 | Primitive::Type type1, |
| 1254 | Location from2, |
| 1255 | Location to2, |
| 1256 | Primitive::Type type2) { |
Nicolas Geoffray | f0e3937 | 2014-11-12 17:50:07 +0000 | [diff] [blame] | 1257 | HParallelMove parallel_move(GetGraph()->GetArena()); |
Nicolas Geoffray | 9021825 | 2015-04-15 11:56:51 +0100 | [diff] [blame] | 1258 | parallel_move.AddMove(from1, to1, type1, nullptr); |
| 1259 | parallel_move.AddMove(from2, to2, type2, nullptr); |
Nicolas Geoffray | f0e3937 | 2014-11-12 17:50:07 +0000 | [diff] [blame] | 1260 | GetMoveResolver()->EmitNativeCode(¶llel_move); |
| 1261 | } |
| 1262 | |
Alexandre Rames | 91a6516 | 2016-09-19 13:54:30 +0100 | [diff] [blame] | 1263 | void CodeGenerator::ValidateInvokeRuntime(QuickEntrypointEnum entrypoint, |
| 1264 | HInstruction* instruction, |
| 1265 | SlowPathCode* slow_path) { |
Alexandre Rames | 78e3ef6 | 2015-08-12 13:43:29 +0100 | [diff] [blame] | 1266 | // Ensure that the call kind indication given to the register allocator is |
Alexandre Rames | 91a6516 | 2016-09-19 13:54:30 +0100 | [diff] [blame] | 1267 | // coherent with the runtime call generated. |
Alexandre Rames | 78e3ef6 | 2015-08-12 13:43:29 +0100 | [diff] [blame] | 1268 | if (slow_path == nullptr) { |
Roland Levillain | 0d5a281 | 2015-11-13 10:07:31 +0000 | [diff] [blame] | 1269 | DCHECK(instruction->GetLocations()->WillCall()) |
| 1270 | << "instruction->DebugName()=" << instruction->DebugName(); |
Alexandre Rames | 78e3ef6 | 2015-08-12 13:43:29 +0100 | [diff] [blame] | 1271 | } else { |
Serban Constantinescu | 806f012 | 2016-03-09 11:10:16 +0000 | [diff] [blame] | 1272 | DCHECK(instruction->GetLocations()->CallsOnSlowPath() || slow_path->IsFatal()) |
Roland Levillain | 0d5a281 | 2015-11-13 10:07:31 +0000 | [diff] [blame] | 1273 | << "instruction->DebugName()=" << instruction->DebugName() |
| 1274 | << " slow_path->GetDescription()=" << slow_path->GetDescription(); |
Alexandre Rames | 91a6516 | 2016-09-19 13:54:30 +0100 | [diff] [blame] | 1275 | } |
| 1276 | |
| 1277 | // Check that the GC side effect is set when required. |
| 1278 | // TODO: Reverse EntrypointCanTriggerGC |
| 1279 | if (EntrypointCanTriggerGC(entrypoint)) { |
| 1280 | if (slow_path == nullptr) { |
| 1281 | DCHECK(instruction->GetSideEffects().Includes(SideEffects::CanTriggerGC())) |
| 1282 | << "instruction->DebugName()=" << instruction->DebugName() |
| 1283 | << " instruction->GetSideEffects().ToString()=" |
| 1284 | << instruction->GetSideEffects().ToString(); |
| 1285 | } else { |
| 1286 | DCHECK(instruction->GetSideEffects().Includes(SideEffects::CanTriggerGC()) || |
| 1287 | // When (non-Baker) read barriers are enabled, some instructions |
| 1288 | // use a slow path to emit a read barrier, which does not trigger |
| 1289 | // GC. |
| 1290 | (kEmitCompilerReadBarrier && |
| 1291 | !kUseBakerReadBarrier && |
| 1292 | (instruction->IsInstanceFieldGet() || |
| 1293 | instruction->IsStaticFieldGet() || |
| 1294 | instruction->IsArrayGet() || |
| 1295 | instruction->IsLoadClass() || |
| 1296 | instruction->IsLoadString() || |
| 1297 | instruction->IsInstanceOf() || |
| 1298 | instruction->IsCheckCast() || |
| 1299 | (instruction->IsInvokeVirtual() && instruction->GetLocations()->Intrinsified())))) |
| 1300 | << "instruction->DebugName()=" << instruction->DebugName() |
| 1301 | << " instruction->GetSideEffects().ToString()=" |
| 1302 | << instruction->GetSideEffects().ToString() |
| 1303 | << " slow_path->GetDescription()=" << slow_path->GetDescription(); |
| 1304 | } |
| 1305 | } else { |
| 1306 | // The GC side effect is not required for the instruction. But the instruction might still have |
| 1307 | // it, for example if it calls other entrypoints requiring it. |
Alexandre Rames | 78e3ef6 | 2015-08-12 13:43:29 +0100 | [diff] [blame] | 1308 | } |
| 1309 | |
| 1310 | // Check the coherency of leaf information. |
| 1311 | DCHECK(instruction->IsSuspendCheck() |
| 1312 | || ((slow_path != nullptr) && slow_path->IsFatal()) |
| 1313 | || instruction->GetLocations()->CanCall() |
Roland Levillain | df3f822 | 2015-08-13 12:31:44 +0100 | [diff] [blame] | 1314 | || !IsLeafMethod()) |
| 1315 | << instruction->DebugName() << ((slow_path != nullptr) ? slow_path->GetDescription() : ""); |
Alexandre Rames | 78e3ef6 | 2015-08-12 13:43:29 +0100 | [diff] [blame] | 1316 | } |
| 1317 | |
Roland Levillain | dec8f63 | 2016-07-22 17:10:06 +0100 | [diff] [blame] | 1318 | void CodeGenerator::ValidateInvokeRuntimeWithoutRecordingPcInfo(HInstruction* instruction, |
| 1319 | SlowPathCode* slow_path) { |
| 1320 | DCHECK(instruction->GetLocations()->OnlyCallsOnSlowPath()) |
| 1321 | << "instruction->DebugName()=" << instruction->DebugName() |
| 1322 | << " slow_path->GetDescription()=" << slow_path->GetDescription(); |
| 1323 | // Only the Baker read barrier marking slow path used by certains |
| 1324 | // instructions is expected to invoke the runtime without recording |
| 1325 | // PC-related information. |
| 1326 | DCHECK(kUseBakerReadBarrier); |
| 1327 | DCHECK(instruction->IsInstanceFieldGet() || |
| 1328 | instruction->IsStaticFieldGet() || |
| 1329 | instruction->IsArrayGet() || |
Roland Levillain | 16d9f94 | 2016-08-25 17:27:56 +0100 | [diff] [blame] | 1330 | instruction->IsArraySet() || |
Roland Levillain | dec8f63 | 2016-07-22 17:10:06 +0100 | [diff] [blame] | 1331 | instruction->IsLoadClass() || |
| 1332 | instruction->IsLoadString() || |
| 1333 | instruction->IsInstanceOf() || |
| 1334 | instruction->IsCheckCast() || |
Roland Levillain | 0b671c0 | 2016-08-19 12:02:34 +0100 | [diff] [blame] | 1335 | (instruction->IsInvokeVirtual() && instruction->GetLocations()->Intrinsified()) || |
| 1336 | (instruction->IsInvokeStaticOrDirect() && instruction->GetLocations()->Intrinsified())) |
Roland Levillain | dec8f63 | 2016-07-22 17:10:06 +0100 | [diff] [blame] | 1337 | << "instruction->DebugName()=" << instruction->DebugName() |
| 1338 | << " slow_path->GetDescription()=" << slow_path->GetDescription(); |
| 1339 | } |
| 1340 | |
Nicolas Geoffray | a8ac913 | 2015-03-13 16:36:36 +0000 | [diff] [blame] | 1341 | void SlowPathCode::SaveLiveRegisters(CodeGenerator* codegen, LocationSummary* locations) { |
Nicolas Geoffray | a8ac913 | 2015-03-13 16:36:36 +0000 | [diff] [blame] | 1342 | size_t stack_offset = codegen->GetFirstRegisterSlotInSlowPath(); |
Roland Levillain | 0d5a281 | 2015-11-13 10:07:31 +0000 | [diff] [blame] | 1343 | |
Vladimir Marko | 70e9746 | 2016-08-09 11:04:26 +0100 | [diff] [blame] | 1344 | const uint32_t core_spills = codegen->GetSlowPathSpills(locations, /* core_registers */ true); |
| 1345 | for (uint32_t i : LowToHighBits(core_spills)) { |
| 1346 | // If the register holds an object, update the stack mask. |
| 1347 | if (locations->RegisterContainsObject(i)) { |
| 1348 | locations->SetStackBit(stack_offset / kVRegSize); |
Nicolas Geoffray | a8ac913 | 2015-03-13 16:36:36 +0000 | [diff] [blame] | 1349 | } |
Vladimir Marko | 70e9746 | 2016-08-09 11:04:26 +0100 | [diff] [blame] | 1350 | DCHECK_LT(stack_offset, codegen->GetFrameSize() - codegen->FrameEntrySpillSize()); |
| 1351 | DCHECK_LT(i, kMaximumNumberOfExpectedRegisters); |
| 1352 | saved_core_stack_offsets_[i] = stack_offset; |
| 1353 | stack_offset += codegen->SaveCoreRegister(stack_offset, i); |
Nicolas Geoffray | a8ac913 | 2015-03-13 16:36:36 +0000 | [diff] [blame] | 1354 | } |
| 1355 | |
Vladimir Marko | 70e9746 | 2016-08-09 11:04:26 +0100 | [diff] [blame] | 1356 | const uint32_t fp_spills = codegen->GetSlowPathSpills(locations, /* core_registers */ false); |
Vladimir Marko | 804b03f | 2016-09-14 16:26:36 +0100 | [diff] [blame] | 1357 | for (uint32_t i : LowToHighBits(fp_spills)) { |
Vladimir Marko | 70e9746 | 2016-08-09 11:04:26 +0100 | [diff] [blame] | 1358 | DCHECK_LT(stack_offset, codegen->GetFrameSize() - codegen->FrameEntrySpillSize()); |
| 1359 | DCHECK_LT(i, kMaximumNumberOfExpectedRegisters); |
| 1360 | saved_fpu_stack_offsets_[i] = stack_offset; |
| 1361 | stack_offset += codegen->SaveFloatingPointRegister(stack_offset, i); |
Nicolas Geoffray | a8ac913 | 2015-03-13 16:36:36 +0000 | [diff] [blame] | 1362 | } |
| 1363 | } |
| 1364 | |
| 1365 | void SlowPathCode::RestoreLiveRegisters(CodeGenerator* codegen, LocationSummary* locations) { |
Nicolas Geoffray | a8ac913 | 2015-03-13 16:36:36 +0000 | [diff] [blame] | 1366 | size_t stack_offset = codegen->GetFirstRegisterSlotInSlowPath(); |
Roland Levillain | 0d5a281 | 2015-11-13 10:07:31 +0000 | [diff] [blame] | 1367 | |
Vladimir Marko | 70e9746 | 2016-08-09 11:04:26 +0100 | [diff] [blame] | 1368 | const uint32_t core_spills = codegen->GetSlowPathSpills(locations, /* core_registers */ true); |
| 1369 | for (uint32_t i : LowToHighBits(core_spills)) { |
| 1370 | DCHECK_LT(stack_offset, codegen->GetFrameSize() - codegen->FrameEntrySpillSize()); |
| 1371 | DCHECK_LT(i, kMaximumNumberOfExpectedRegisters); |
| 1372 | stack_offset += codegen->RestoreCoreRegister(stack_offset, i); |
Nicolas Geoffray | a8ac913 | 2015-03-13 16:36:36 +0000 | [diff] [blame] | 1373 | } |
| 1374 | |
Vladimir Marko | 70e9746 | 2016-08-09 11:04:26 +0100 | [diff] [blame] | 1375 | const uint32_t fp_spills = codegen->GetSlowPathSpills(locations, /* core_registers */ false); |
Vladimir Marko | 804b03f | 2016-09-14 16:26:36 +0100 | [diff] [blame] | 1376 | for (uint32_t i : LowToHighBits(fp_spills)) { |
Vladimir Marko | 70e9746 | 2016-08-09 11:04:26 +0100 | [diff] [blame] | 1377 | DCHECK_LT(stack_offset, codegen->GetFrameSize() - codegen->FrameEntrySpillSize()); |
| 1378 | DCHECK_LT(i, kMaximumNumberOfExpectedRegisters); |
| 1379 | stack_offset += codegen->RestoreFloatingPointRegister(stack_offset, i); |
Nicolas Geoffray | a8ac913 | 2015-03-13 16:36:36 +0000 | [diff] [blame] | 1380 | } |
| 1381 | } |
| 1382 | |
Nicolas Geoffray | 5bd05a5 | 2015-10-13 09:48:30 +0100 | [diff] [blame] | 1383 | void CodeGenerator::CreateSystemArrayCopyLocationSummary(HInvoke* invoke) { |
| 1384 | // Check to see if we have known failures that will cause us to have to bail out |
| 1385 | // to the runtime, and just generate the runtime call directly. |
| 1386 | HIntConstant* src_pos = invoke->InputAt(1)->AsIntConstant(); |
| 1387 | HIntConstant* dest_pos = invoke->InputAt(3)->AsIntConstant(); |
| 1388 | |
| 1389 | // The positions must be non-negative. |
| 1390 | if ((src_pos != nullptr && src_pos->GetValue() < 0) || |
| 1391 | (dest_pos != nullptr && dest_pos->GetValue() < 0)) { |
| 1392 | // We will have to fail anyways. |
| 1393 | return; |
| 1394 | } |
| 1395 | |
| 1396 | // The length must be >= 0. |
| 1397 | HIntConstant* length = invoke->InputAt(4)->AsIntConstant(); |
| 1398 | if (length != nullptr) { |
| 1399 | int32_t len = length->GetValue(); |
| 1400 | if (len < 0) { |
| 1401 | // Just call as normal. |
| 1402 | return; |
| 1403 | } |
| 1404 | } |
| 1405 | |
| 1406 | SystemArrayCopyOptimizations optimizations(invoke); |
| 1407 | |
| 1408 | if (optimizations.GetDestinationIsSource()) { |
| 1409 | if (src_pos != nullptr && dest_pos != nullptr && src_pos->GetValue() < dest_pos->GetValue()) { |
| 1410 | // We only support backward copying if source and destination are the same. |
| 1411 | return; |
| 1412 | } |
| 1413 | } |
| 1414 | |
| 1415 | if (optimizations.GetDestinationIsPrimitiveArray() || optimizations.GetSourceIsPrimitiveArray()) { |
| 1416 | // We currently don't intrinsify primitive copying. |
| 1417 | return; |
| 1418 | } |
| 1419 | |
| 1420 | ArenaAllocator* allocator = invoke->GetBlock()->GetGraph()->GetArena(); |
| 1421 | LocationSummary* locations = new (allocator) LocationSummary(invoke, |
| 1422 | LocationSummary::kCallOnSlowPath, |
| 1423 | kIntrinsified); |
| 1424 | // arraycopy(Object src, int src_pos, Object dest, int dest_pos, int length). |
| 1425 | locations->SetInAt(0, Location::RequiresRegister()); |
| 1426 | locations->SetInAt(1, Location::RegisterOrConstant(invoke->InputAt(1))); |
| 1427 | locations->SetInAt(2, Location::RequiresRegister()); |
| 1428 | locations->SetInAt(3, Location::RegisterOrConstant(invoke->InputAt(3))); |
| 1429 | locations->SetInAt(4, Location::RegisterOrConstant(invoke->InputAt(4))); |
| 1430 | |
| 1431 | locations->AddTemp(Location::RequiresRegister()); |
| 1432 | locations->AddTemp(Location::RequiresRegister()); |
| 1433 | locations->AddTemp(Location::RequiresRegister()); |
| 1434 | } |
| 1435 | |
Nicolas Geoffray | 132d836 | 2016-11-16 09:19:42 +0000 | [diff] [blame] | 1436 | void CodeGenerator::EmitJitRoots(uint8_t* code, |
| 1437 | Handle<mirror::ObjectArray<mirror::Object>> roots, |
Nicolas Geoffray | f0acfe7 | 2017-01-09 20:54:52 +0000 | [diff] [blame] | 1438 | const uint8_t* roots_data) { |
Nicolas Geoffray | 132d836 | 2016-11-16 09:19:42 +0000 | [diff] [blame] | 1439 | DCHECK_EQ(static_cast<size_t>(roots->GetLength()), GetNumberOfJitRoots()); |
Nicolas Geoffray | 132d836 | 2016-11-16 09:19:42 +0000 | [diff] [blame] | 1440 | ClassLinker* class_linker = Runtime::Current()->GetClassLinker(); |
| 1441 | size_t index = 0; |
| 1442 | for (auto& entry : jit_string_roots_) { |
Nicolas Geoffray | f0acfe7 | 2017-01-09 20:54:52 +0000 | [diff] [blame] | 1443 | // Update the `roots` with the string, and replace the address temporarily |
| 1444 | // stored to the index in the table. |
| 1445 | uint64_t address = entry.second; |
| 1446 | roots->Set(index, reinterpret_cast<StackReference<mirror::String>*>(address)->AsMirrorPtr()); |
| 1447 | DCHECK(roots->Get(index) != nullptr); |
| 1448 | entry.second = index; |
Nicolas Geoffray | 132d836 | 2016-11-16 09:19:42 +0000 | [diff] [blame] | 1449 | // Ensure the string is strongly interned. This is a requirement on how the JIT |
| 1450 | // handles strings. b/32995596 |
Nicolas Geoffray | f0acfe7 | 2017-01-09 20:54:52 +0000 | [diff] [blame] | 1451 | class_linker->GetInternTable()->InternStrong( |
| 1452 | reinterpret_cast<mirror::String*>(roots->Get(index))); |
Nicolas Geoffray | 132d836 | 2016-11-16 09:19:42 +0000 | [diff] [blame] | 1453 | ++index; |
| 1454 | } |
Nicolas Geoffray | 22384ae | 2016-12-12 22:33:36 +0000 | [diff] [blame] | 1455 | for (auto& entry : jit_class_roots_) { |
| 1456 | // Update the `roots` with the class, and replace the address temporarily |
| 1457 | // stored to the index in the table. |
| 1458 | uint64_t address = entry.second; |
| 1459 | roots->Set(index, reinterpret_cast<StackReference<mirror::Class>*>(address)->AsMirrorPtr()); |
Nicolas Geoffray | f0acfe7 | 2017-01-09 20:54:52 +0000 | [diff] [blame] | 1460 | DCHECK(roots->Get(index) != nullptr); |
Nicolas Geoffray | 22384ae | 2016-12-12 22:33:36 +0000 | [diff] [blame] | 1461 | entry.second = index; |
| 1462 | ++index; |
| 1463 | } |
Nicolas Geoffray | 132d836 | 2016-11-16 09:19:42 +0000 | [diff] [blame] | 1464 | EmitJitRootPatches(code, roots_data); |
| 1465 | } |
| 1466 | |
Nicolas Geoffray | b048cb7 | 2017-01-23 22:50:24 +0000 | [diff] [blame] | 1467 | QuickEntrypointEnum CodeGenerator::GetArrayAllocationEntrypoint(Handle<mirror::Class> array_klass) { |
| 1468 | ScopedObjectAccess soa(Thread::Current()); |
Andreas Gampe | fa4333d | 2017-02-14 11:10:34 -0800 | [diff] [blame] | 1469 | if (array_klass == nullptr) { |
Nicolas Geoffray | b048cb7 | 2017-01-23 22:50:24 +0000 | [diff] [blame] | 1470 | // This can only happen for non-primitive arrays, as primitive arrays can always |
| 1471 | // be resolved. |
| 1472 | return kQuickAllocArrayResolved32; |
| 1473 | } |
| 1474 | |
| 1475 | switch (array_klass->GetComponentSize()) { |
| 1476 | case 1: return kQuickAllocArrayResolved8; |
| 1477 | case 2: return kQuickAllocArrayResolved16; |
| 1478 | case 4: return kQuickAllocArrayResolved32; |
| 1479 | case 8: return kQuickAllocArrayResolved64; |
| 1480 | } |
| 1481 | LOG(FATAL) << "Unreachable"; |
| 1482 | return kQuickAllocArrayResolved; |
| 1483 | } |
| 1484 | |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 1485 | } // namespace art |