Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +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 "verified_method.h" |
| 18 | |
| 19 | #include <algorithm> |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 20 | #include <memory> |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 21 | #include <vector> |
| 22 | |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 23 | #include "art_method-inl.h" |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 24 | #include "base/logging.h" |
| 25 | #include "base/stl_util.h" |
| 26 | #include "dex_file.h" |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 27 | #include "dex_instruction-inl.h" |
Mathieu Chartier | e5f13e5 | 2015-02-24 09:37:21 -0800 | [diff] [blame] | 28 | #include "dex_instruction_utils.h" |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 29 | #include "mirror/class-inl.h" |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 30 | #include "mirror/dex_cache-inl.h" |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 31 | #include "mirror/object-inl.h" |
Andreas Gampe | 0b9203e | 2015-01-22 20:39:27 -0800 | [diff] [blame] | 32 | #include "utils.h" |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 33 | #include "verifier/dex_gc_map.h" |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 34 | #include "verifier/method_verifier-inl.h" |
Ian Rogers | 7b078e8 | 2014-09-10 14:44:24 -0700 | [diff] [blame] | 35 | #include "verifier/reg_type-inl.h" |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 36 | #include "verifier/register_line-inl.h" |
| 37 | |
| 38 | namespace art { |
| 39 | |
| 40 | const VerifiedMethod* VerifiedMethod::Create(verifier::MethodVerifier* method_verifier, |
| 41 | bool compile) { |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 42 | std::unique_ptr<VerifiedMethod> verified_method(new VerifiedMethod); |
Calin Juravle | f1c6d9e | 2015-04-13 18:42:21 +0100 | [diff] [blame] | 43 | verified_method->has_verification_failures_ = method_verifier->HasFailures(); |
Nicolas Geoffray | 4824c27 | 2015-06-24 15:53:03 +0100 | [diff] [blame] | 44 | verified_method->has_runtime_throw_ = method_verifier->HasInstructionThatWillThrow(); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 45 | if (compile) { |
| 46 | /* Generate a register map. */ |
| 47 | if (!verified_method->GenerateGcMap(method_verifier)) { |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 48 | return nullptr; // Not a real failure, but a failure to encode. |
| 49 | } |
| 50 | if (kIsDebugBuild) { |
| 51 | VerifyGcMap(method_verifier, verified_method->dex_gc_map_); |
| 52 | } |
| 53 | |
| 54 | // TODO: move this out when DEX-to-DEX supports devirtualization. |
| 55 | if (method_verifier->HasVirtualOrInterfaceInvokes()) { |
| 56 | verified_method->GenerateDevirtMap(method_verifier); |
| 57 | } |
Mathieu Chartier | e5f13e5 | 2015-02-24 09:37:21 -0800 | [diff] [blame] | 58 | |
| 59 | // Only need dequicken info for JIT so far. |
Mathieu Chartier | 091d238 | 2015-03-06 10:59:06 -0800 | [diff] [blame] | 60 | if (Runtime::Current()->UseJit() && !verified_method->GenerateDequickenMap(method_verifier)) { |
| 61 | return nullptr; |
Mathieu Chartier | e5f13e5 | 2015-02-24 09:37:21 -0800 | [diff] [blame] | 62 | } |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 63 | } |
| 64 | |
| 65 | if (method_verifier->HasCheckCasts()) { |
| 66 | verified_method->GenerateSafeCastSet(method_verifier); |
| 67 | } |
Jeff Hao | 848f70a | 2014-01-15 13:49:50 -0800 | [diff] [blame] | 68 | |
| 69 | verified_method->SetStringInitPcRegMap(method_verifier->GetStringInitPcRegMap()); |
| 70 | |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 71 | return verified_method.release(); |
| 72 | } |
| 73 | |
| 74 | const MethodReference* VerifiedMethod::GetDevirtTarget(uint32_t dex_pc) const { |
| 75 | auto it = devirt_map_.find(dex_pc); |
| 76 | return (it != devirt_map_.end()) ? &it->second : nullptr; |
| 77 | } |
| 78 | |
Mathieu Chartier | e5f13e5 | 2015-02-24 09:37:21 -0800 | [diff] [blame] | 79 | const DexFileReference* VerifiedMethod::GetDequickenIndex(uint32_t dex_pc) const { |
| 80 | DCHECK(Runtime::Current()->UseJit()); |
| 81 | auto it = dequicken_map_.find(dex_pc); |
| 82 | return (it != dequicken_map_.end()) ? &it->second : nullptr; |
| 83 | } |
| 84 | |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 85 | bool VerifiedMethod::IsSafeCast(uint32_t pc) const { |
| 86 | return std::binary_search(safe_cast_set_.begin(), safe_cast_set_.end(), pc); |
| 87 | } |
| 88 | |
| 89 | bool VerifiedMethod::GenerateGcMap(verifier::MethodVerifier* method_verifier) { |
| 90 | DCHECK(dex_gc_map_.empty()); |
| 91 | size_t num_entries, ref_bitmap_bits, pc_bits; |
| 92 | ComputeGcMapSizes(method_verifier, &num_entries, &ref_bitmap_bits, &pc_bits); |
Mathieu Chartier | f8da196 | 2015-06-19 13:55:27 -0700 | [diff] [blame] | 93 | const size_t ref_bitmap_bytes = RoundUp(ref_bitmap_bits, kBitsPerByte) / kBitsPerByte; |
| 94 | static constexpr size_t kFormatBits = 3; |
| 95 | // We have 16 - kFormatBits available for the ref_bitmap_bytes. |
| 96 | if ((ref_bitmap_bytes >> (16u - kFormatBits)) != 0) { |
Andreas Gampe | 6c170c9 | 2014-12-17 14:35:46 -0800 | [diff] [blame] | 97 | LOG(WARNING) << "Cannot encode GC map for method with " << ref_bitmap_bits << " registers: " |
| 98 | << PrettyMethod(method_verifier->GetMethodReference().dex_method_index, |
| 99 | *method_verifier->GetMethodReference().dex_file); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 100 | return false; |
| 101 | } |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 102 | // There are 2 bytes to encode the number of entries. |
Igor Murashkin | c449e8b | 2015-06-10 15:56:42 -0700 | [diff] [blame] | 103 | if (num_entries > std::numeric_limits<uint16_t>::max()) { |
Andreas Gampe | 6c170c9 | 2014-12-17 14:35:46 -0800 | [diff] [blame] | 104 | LOG(WARNING) << "Cannot encode GC map for method with " << num_entries << " entries: " |
| 105 | << PrettyMethod(method_verifier->GetMethodReference().dex_method_index, |
| 106 | *method_verifier->GetMethodReference().dex_file); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 107 | return false; |
| 108 | } |
| 109 | size_t pc_bytes; |
| 110 | verifier::RegisterMapFormat format; |
Mathieu Chartier | 36b58f5 | 2014-12-10 12:06:45 -0800 | [diff] [blame] | 111 | if (pc_bits <= kBitsPerByte) { |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 112 | format = verifier::kRegMapFormatCompact8; |
| 113 | pc_bytes = 1; |
Mathieu Chartier | 36b58f5 | 2014-12-10 12:06:45 -0800 | [diff] [blame] | 114 | } else if (pc_bits <= kBitsPerByte * 2) { |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 115 | format = verifier::kRegMapFormatCompact16; |
| 116 | pc_bytes = 2; |
| 117 | } else { |
Andreas Gampe | 6c170c9 | 2014-12-17 14:35:46 -0800 | [diff] [blame] | 118 | LOG(WARNING) << "Cannot encode GC map for method with " |
| 119 | << (1 << pc_bits) << " instructions (number is rounded up to nearest power of 2): " |
| 120 | << PrettyMethod(method_verifier->GetMethodReference().dex_method_index, |
| 121 | *method_verifier->GetMethodReference().dex_file); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 122 | return false; |
| 123 | } |
| 124 | size_t table_size = ((pc_bytes + ref_bitmap_bytes) * num_entries) + 4; |
| 125 | dex_gc_map_.reserve(table_size); |
| 126 | // Write table header. |
Mathieu Chartier | f8da196 | 2015-06-19 13:55:27 -0700 | [diff] [blame] | 127 | dex_gc_map_.push_back(format | ((ref_bitmap_bytes & ~0xFF) >> (kBitsPerByte - kFormatBits))); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 128 | dex_gc_map_.push_back(ref_bitmap_bytes & 0xFF); |
| 129 | dex_gc_map_.push_back(num_entries & 0xFF); |
| 130 | dex_gc_map_.push_back((num_entries >> 8) & 0xFF); |
| 131 | // Write table data. |
| 132 | const DexFile::CodeItem* code_item = method_verifier->CodeItem(); |
| 133 | for (size_t i = 0; i < code_item->insns_size_in_code_units_; i++) { |
| 134 | if (method_verifier->GetInstructionFlags(i).IsCompileTimeInfoPoint()) { |
| 135 | dex_gc_map_.push_back(i & 0xFF); |
| 136 | if (pc_bytes == 2) { |
| 137 | dex_gc_map_.push_back((i >> 8) & 0xFF); |
| 138 | } |
| 139 | verifier::RegisterLine* line = method_verifier->GetRegLine(i); |
Ian Rogers | 7b078e8 | 2014-09-10 14:44:24 -0700 | [diff] [blame] | 140 | line->WriteReferenceBitMap(method_verifier, &dex_gc_map_, ref_bitmap_bytes); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 141 | } |
| 142 | } |
| 143 | DCHECK_EQ(dex_gc_map_.size(), table_size); |
| 144 | return true; |
| 145 | } |
| 146 | |
| 147 | void VerifiedMethod::VerifyGcMap(verifier::MethodVerifier* method_verifier, |
| 148 | const std::vector<uint8_t>& data) { |
| 149 | // Check that for every GC point there is a map entry, there aren't entries for non-GC points, |
| 150 | // that the table data is well formed and all references are marked (or not) in the bitmap. |
| 151 | verifier::DexPcToReferenceMap map(&data[0]); |
Mathieu Chartier | f8da196 | 2015-06-19 13:55:27 -0700 | [diff] [blame] | 152 | CHECK_EQ(data.size(), map.RawSize()) << map.NumEntries() << " " << map.RegWidth(); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 153 | size_t map_index = 0; |
| 154 | const DexFile::CodeItem* code_item = method_verifier->CodeItem(); |
| 155 | for (size_t i = 0; i < code_item->insns_size_in_code_units_; i++) { |
| 156 | const uint8_t* reg_bitmap = map.FindBitMap(i, false); |
| 157 | if (method_verifier->GetInstructionFlags(i).IsCompileTimeInfoPoint()) { |
| 158 | DCHECK_LT(map_index, map.NumEntries()); |
| 159 | DCHECK_EQ(map.GetDexPc(map_index), i); |
| 160 | DCHECK_EQ(map.GetBitMap(map_index), reg_bitmap); |
| 161 | map_index++; |
| 162 | verifier::RegisterLine* line = method_verifier->GetRegLine(i); |
| 163 | for (size_t j = 0; j < code_item->registers_size_; j++) { |
Ian Rogers | 7b078e8 | 2014-09-10 14:44:24 -0700 | [diff] [blame] | 164 | if (line->GetRegisterType(method_verifier, j).IsNonZeroReferenceTypes()) { |
Mathieu Chartier | 36b58f5 | 2014-12-10 12:06:45 -0800 | [diff] [blame] | 165 | DCHECK_LT(j / kBitsPerByte, map.RegWidth()); |
| 166 | DCHECK_EQ((reg_bitmap[j / kBitsPerByte] >> (j % kBitsPerByte)) & 1, 1); |
| 167 | } else if ((j / kBitsPerByte) < map.RegWidth()) { |
| 168 | DCHECK_EQ((reg_bitmap[j / kBitsPerByte] >> (j % kBitsPerByte)) & 1, 0); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 169 | } else { |
| 170 | // If a register doesn't contain a reference then the bitmap may be shorter than the line. |
| 171 | } |
| 172 | } |
| 173 | } else { |
Mathieu Chartier | 2cebb24 | 2015-04-21 16:50:40 -0700 | [diff] [blame] | 174 | DCHECK(i >= 65536 || reg_bitmap == nullptr); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 175 | } |
| 176 | } |
| 177 | } |
| 178 | |
| 179 | void VerifiedMethod::ComputeGcMapSizes(verifier::MethodVerifier* method_verifier, |
| 180 | size_t* gc_points, size_t* ref_bitmap_bits, |
| 181 | size_t* log2_max_gc_pc) { |
| 182 | size_t local_gc_points = 0; |
| 183 | size_t max_insn = 0; |
| 184 | size_t max_ref_reg = -1; |
| 185 | const DexFile::CodeItem* code_item = method_verifier->CodeItem(); |
| 186 | for (size_t i = 0; i < code_item->insns_size_in_code_units_; i++) { |
| 187 | if (method_verifier->GetInstructionFlags(i).IsCompileTimeInfoPoint()) { |
| 188 | local_gc_points++; |
| 189 | max_insn = i; |
| 190 | verifier::RegisterLine* line = method_verifier->GetRegLine(i); |
Ian Rogers | 7b078e8 | 2014-09-10 14:44:24 -0700 | [diff] [blame] | 191 | max_ref_reg = line->GetMaxNonZeroReferenceReg(method_verifier, max_ref_reg); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 192 | } |
| 193 | } |
| 194 | *gc_points = local_gc_points; |
| 195 | *ref_bitmap_bits = max_ref_reg + 1; // If max register is 0 we need 1 bit to encode (ie +1). |
| 196 | size_t i = 0; |
| 197 | while ((1U << i) <= max_insn) { |
| 198 | i++; |
| 199 | } |
| 200 | *log2_max_gc_pc = i; |
| 201 | } |
| 202 | |
Mathieu Chartier | 091d238 | 2015-03-06 10:59:06 -0800 | [diff] [blame] | 203 | bool VerifiedMethod::GenerateDequickenMap(verifier::MethodVerifier* method_verifier) { |
Mathieu Chartier | 36b58f5 | 2014-12-10 12:06:45 -0800 | [diff] [blame] | 204 | if (method_verifier->HasFailures()) { |
Mathieu Chartier | 091d238 | 2015-03-06 10:59:06 -0800 | [diff] [blame] | 205 | return false; |
Mathieu Chartier | 36b58f5 | 2014-12-10 12:06:45 -0800 | [diff] [blame] | 206 | } |
| 207 | const DexFile::CodeItem* code_item = method_verifier->CodeItem(); |
| 208 | const uint16_t* insns = code_item->insns_; |
| 209 | const Instruction* inst = Instruction::At(insns); |
| 210 | const Instruction* end = Instruction::At(insns + code_item->insns_size_in_code_units_); |
| 211 | for (; inst < end; inst = inst->Next()) { |
| 212 | const bool is_virtual_quick = inst->Opcode() == Instruction::INVOKE_VIRTUAL_QUICK; |
| 213 | const bool is_range_quick = inst->Opcode() == Instruction::INVOKE_VIRTUAL_RANGE_QUICK; |
| 214 | if (is_virtual_quick || is_range_quick) { |
| 215 | uint32_t dex_pc = inst->GetDexPc(insns); |
| 216 | verifier::RegisterLine* line = method_verifier->GetRegLine(dex_pc); |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 217 | ArtMethod* method = |
Mathieu Chartier | 091d238 | 2015-03-06 10:59:06 -0800 | [diff] [blame] | 218 | method_verifier->GetQuickInvokedMethod(inst, line, is_range_quick, true); |
| 219 | if (method == nullptr) { |
| 220 | // It can be null if the line wasn't verified since it was unreachable. |
| 221 | return false; |
| 222 | } |
Mathieu Chartier | 36b58f5 | 2014-12-10 12:06:45 -0800 | [diff] [blame] | 223 | // The verifier must know what the type of the object was or else we would have gotten a |
| 224 | // failure. Put the dex method index in the dequicken map since we need this to get number of |
| 225 | // arguments in the compiler. |
Mathieu Chartier | e5f13e5 | 2015-02-24 09:37:21 -0800 | [diff] [blame] | 226 | dequicken_map_.Put(dex_pc, DexFileReference(method->GetDexFile(), |
| 227 | method->GetDexMethodIndex())); |
| 228 | } else if (IsInstructionIGetQuickOrIPutQuick(inst->Opcode())) { |
| 229 | uint32_t dex_pc = inst->GetDexPc(insns); |
| 230 | verifier::RegisterLine* line = method_verifier->GetRegLine(dex_pc); |
Mathieu Chartier | c785344 | 2015-03-27 14:35:38 -0700 | [diff] [blame] | 231 | ArtField* field = method_verifier->GetQuickFieldAccess(inst, line); |
Mathieu Chartier | 091d238 | 2015-03-06 10:59:06 -0800 | [diff] [blame] | 232 | if (field == nullptr) { |
| 233 | // It can be null if the line wasn't verified since it was unreachable. |
| 234 | return false; |
| 235 | } |
Mathieu Chartier | e5f13e5 | 2015-02-24 09:37:21 -0800 | [diff] [blame] | 236 | // The verifier must know what the type of the field was or else we would have gotten a |
| 237 | // failure. Put the dex field index in the dequicken map since we need this for lowering |
| 238 | // in the compiler. |
| 239 | // TODO: Putting a field index in a method reference is gross. |
| 240 | dequicken_map_.Put(dex_pc, DexFileReference(field->GetDexFile(), field->GetDexFieldIndex())); |
Mathieu Chartier | 36b58f5 | 2014-12-10 12:06:45 -0800 | [diff] [blame] | 241 | } |
| 242 | } |
Mathieu Chartier | 091d238 | 2015-03-06 10:59:06 -0800 | [diff] [blame] | 243 | return true; |
Mathieu Chartier | 36b58f5 | 2014-12-10 12:06:45 -0800 | [diff] [blame] | 244 | } |
| 245 | |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 246 | void VerifiedMethod::GenerateDevirtMap(verifier::MethodVerifier* method_verifier) { |
| 247 | // It is risky to rely on reg_types for sharpening in cases of soft |
| 248 | // verification, we might end up sharpening to a wrong implementation. Just abort. |
| 249 | if (method_verifier->HasFailures()) { |
| 250 | return; |
| 251 | } |
| 252 | |
| 253 | const DexFile::CodeItem* code_item = method_verifier->CodeItem(); |
| 254 | const uint16_t* insns = code_item->insns_; |
| 255 | const Instruction* inst = Instruction::At(insns); |
| 256 | const Instruction* end = Instruction::At(insns + code_item->insns_size_in_code_units_); |
| 257 | |
| 258 | for (; inst < end; inst = inst->Next()) { |
Mathieu Chartier | 36b58f5 | 2014-12-10 12:06:45 -0800 | [diff] [blame] | 259 | const bool is_virtual = inst->Opcode() == Instruction::INVOKE_VIRTUAL || |
| 260 | inst->Opcode() == Instruction::INVOKE_VIRTUAL_RANGE; |
| 261 | const bool is_interface = inst->Opcode() == Instruction::INVOKE_INTERFACE || |
| 262 | inst->Opcode() == Instruction::INVOKE_INTERFACE_RANGE; |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 263 | |
| 264 | if (!is_interface && !is_virtual) { |
| 265 | continue; |
| 266 | } |
| 267 | // Get reg type for register holding the reference to the object that will be dispatched upon. |
| 268 | uint32_t dex_pc = inst->GetDexPc(insns); |
| 269 | verifier::RegisterLine* line = method_verifier->GetRegLine(dex_pc); |
Mathieu Chartier | 36b58f5 | 2014-12-10 12:06:45 -0800 | [diff] [blame] | 270 | const bool is_range = inst->Opcode() == Instruction::INVOKE_VIRTUAL_RANGE || |
| 271 | inst->Opcode() == Instruction::INVOKE_INTERFACE_RANGE; |
Ian Rogers | d8f69b0 | 2014-09-10 21:43:52 +0000 | [diff] [blame] | 272 | const verifier::RegType& |
Ian Rogers | 7b078e8 | 2014-09-10 14:44:24 -0700 | [diff] [blame] | 273 | reg_type(line->GetRegisterType(method_verifier, |
| 274 | is_range ? inst->VRegC_3rc() : inst->VRegC_35c())); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 275 | |
| 276 | if (!reg_type.HasClass()) { |
| 277 | // We will compute devirtualization information only when we know the Class of the reg type. |
| 278 | continue; |
| 279 | } |
| 280 | mirror::Class* reg_class = reg_type.GetClass(); |
| 281 | if (reg_class->IsInterface()) { |
| 282 | // We can't devirtualize when the known type of the register is an interface. |
| 283 | continue; |
| 284 | } |
| 285 | if (reg_class->IsAbstract() && !reg_class->IsArrayClass()) { |
| 286 | // We can't devirtualize abstract classes except on arrays of abstract classes. |
| 287 | continue; |
| 288 | } |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 289 | auto* cl = Runtime::Current()->GetClassLinker(); |
| 290 | size_t pointer_size = cl->GetImagePointerSize(); |
| 291 | ArtMethod* abstract_method = method_verifier->GetDexCache()->GetResolvedMethod( |
| 292 | is_range ? inst->VRegB_3rc() : inst->VRegB_35c(), pointer_size); |
Mathieu Chartier | 2cebb24 | 2015-04-21 16:50:40 -0700 | [diff] [blame] | 293 | if (abstract_method == nullptr) { |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 294 | // If the method is not found in the cache this means that it was never found |
| 295 | // by ResolveMethodAndCheckAccess() called when verifying invoke_*. |
| 296 | continue; |
| 297 | } |
| 298 | // Find the concrete method. |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 299 | ArtMethod* concrete_method = nullptr; |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 300 | if (is_interface) { |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 301 | concrete_method = reg_type.GetClass()->FindVirtualMethodForInterface( |
| 302 | abstract_method, pointer_size); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 303 | } |
| 304 | if (is_virtual) { |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 305 | concrete_method = reg_type.GetClass()->FindVirtualMethodForVirtual( |
| 306 | abstract_method, pointer_size); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 307 | } |
Mathieu Chartier | 36b58f5 | 2014-12-10 12:06:45 -0800 | [diff] [blame] | 308 | if (concrete_method == nullptr || concrete_method->IsAbstract()) { |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 309 | // In cases where concrete_method is not found, or is abstract, continue to the next invoke. |
| 310 | continue; |
| 311 | } |
| 312 | if (reg_type.IsPreciseReference() || concrete_method->IsFinal() || |
| 313 | concrete_method->GetDeclaringClass()->IsFinal()) { |
| 314 | // If we knew exactly the class being dispatched upon, or if the target method cannot be |
| 315 | // overridden record the target to be used in the compiler driver. |
Mathieu Chartier | 36b58f5 | 2014-12-10 12:06:45 -0800 | [diff] [blame] | 316 | devirt_map_.Put(dex_pc, concrete_method->ToMethodReference()); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 317 | } |
| 318 | } |
| 319 | } |
| 320 | |
| 321 | void VerifiedMethod::GenerateSafeCastSet(verifier::MethodVerifier* method_verifier) { |
| 322 | /* |
| 323 | * Walks over the method code and adds any cast instructions in which |
| 324 | * the type cast is implicit to a set, which is used in the code generation |
| 325 | * to elide these casts. |
| 326 | */ |
| 327 | if (method_verifier->HasFailures()) { |
| 328 | return; |
| 329 | } |
| 330 | const DexFile::CodeItem* code_item = method_verifier->CodeItem(); |
| 331 | const Instruction* inst = Instruction::At(code_item->insns_); |
| 332 | const Instruction* end = Instruction::At(code_item->insns_ + |
| 333 | code_item->insns_size_in_code_units_); |
| 334 | |
| 335 | for (; inst < end; inst = inst->Next()) { |
| 336 | Instruction::Code code = inst->Opcode(); |
| 337 | if ((code == Instruction::CHECK_CAST) || (code == Instruction::APUT_OBJECT)) { |
| 338 | uint32_t dex_pc = inst->GetDexPc(code_item->insns_); |
Stephen Kyle | 40d3518 | 2014-10-03 13:47:56 +0100 | [diff] [blame] | 339 | if (!method_verifier->GetInstructionFlags(dex_pc).IsVisited()) { |
| 340 | // Do not attempt to quicken this instruction, it's unreachable anyway. |
| 341 | continue; |
| 342 | } |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 343 | const verifier::RegisterLine* line = method_verifier->GetRegLine(dex_pc); |
| 344 | bool is_safe_cast = false; |
| 345 | if (code == Instruction::CHECK_CAST) { |
Ian Rogers | 7b078e8 | 2014-09-10 14:44:24 -0700 | [diff] [blame] | 346 | const verifier::RegType& reg_type(line->GetRegisterType(method_verifier, |
| 347 | inst->VRegA_21c())); |
Ian Rogers | d8f69b0 | 2014-09-10 21:43:52 +0000 | [diff] [blame] | 348 | const verifier::RegType& cast_type = |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 349 | method_verifier->ResolveCheckedClass(inst->VRegB_21c()); |
| 350 | is_safe_cast = cast_type.IsStrictlyAssignableFrom(reg_type); |
| 351 | } else { |
Ian Rogers | 7b078e8 | 2014-09-10 14:44:24 -0700 | [diff] [blame] | 352 | const verifier::RegType& array_type(line->GetRegisterType(method_verifier, |
| 353 | inst->VRegB_23x())); |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 354 | // We only know its safe to assign to an array if the array type is precise. For example, |
| 355 | // an Object[] can have any type of object stored in it, but it may also be assigned a |
| 356 | // String[] in which case the stores need to be of Strings. |
| 357 | if (array_type.IsPreciseReference()) { |
Ian Rogers | 7b078e8 | 2014-09-10 14:44:24 -0700 | [diff] [blame] | 358 | const verifier::RegType& value_type(line->GetRegisterType(method_verifier, |
| 359 | inst->VRegA_23x())); |
Ian Rogers | d8f69b0 | 2014-09-10 21:43:52 +0000 | [diff] [blame] | 360 | const verifier::RegType& component_type = method_verifier->GetRegTypeCache() |
Vladimir Marko | c7f8320 | 2014-01-24 17:55:18 +0000 | [diff] [blame] | 361 | ->GetComponentType(array_type, method_verifier->GetClassLoader()); |
| 362 | is_safe_cast = component_type.IsStrictlyAssignableFrom(value_type); |
| 363 | } |
| 364 | } |
| 365 | if (is_safe_cast) { |
| 366 | // Verify ordering for push_back() to the sorted vector. |
| 367 | DCHECK(safe_cast_set_.empty() || safe_cast_set_.back() < dex_pc); |
| 368 | safe_cast_set_.push_back(dex_pc); |
| 369 | } |
| 370 | } |
| 371 | } |
| 372 | } |
| 373 | |
| 374 | } // namespace art |