blob: 0355f116f13679c84799b8223ed3dd455522ce1f [file] [log] [blame]
Vladimir Markoc7f83202014-01-24 17:55:18 +00001/*
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 Rogers700a4022014-05-19 16:49:03 -070020#include <memory>
Vladimir Markoc7f83202014-01-24 17:55:18 +000021#include <vector>
22
Mathieu Chartiere401d142015-04-22 13:56:20 -070023#include "art_method-inl.h"
Vladimir Markoc7f83202014-01-24 17:55:18 +000024#include "base/logging.h"
25#include "base/stl_util.h"
26#include "dex_file.h"
Vladimir Markoc7f83202014-01-24 17:55:18 +000027#include "dex_instruction-inl.h"
Mathieu Chartiere5f13e52015-02-24 09:37:21 -080028#include "dex_instruction_utils.h"
Vladimir Markoc7f83202014-01-24 17:55:18 +000029#include "mirror/class-inl.h"
Vladimir Markoc7f83202014-01-24 17:55:18 +000030#include "mirror/dex_cache-inl.h"
Vladimir Markoc7f83202014-01-24 17:55:18 +000031#include "mirror/object-inl.h"
Andreas Gampe0b9203e2015-01-22 20:39:27 -080032#include "utils.h"
Vladimir Markoc7f83202014-01-24 17:55:18 +000033#include "verifier/dex_gc_map.h"
Vladimir Markoc7f83202014-01-24 17:55:18 +000034#include "verifier/method_verifier-inl.h"
Ian Rogers7b078e82014-09-10 14:44:24 -070035#include "verifier/reg_type-inl.h"
Vladimir Markoc7f83202014-01-24 17:55:18 +000036#include "verifier/register_line-inl.h"
37
38namespace art {
39
Andreas Gampe0760a812015-08-26 17:12:51 -070040VerifiedMethod::VerifiedMethod(uint32_t encountered_error_types,
41 bool has_runtime_throw,
42 const SafeMap<uint32_t, std::set<uint32_t>>& string_init_pc_reg_map)
43 : encountered_error_types_(encountered_error_types),
44 has_runtime_throw_(has_runtime_throw),
45 string_init_pc_reg_map_(string_init_pc_reg_map) {
46}
47
Vladimir Markoc7f83202014-01-24 17:55:18 +000048const VerifiedMethod* VerifiedMethod::Create(verifier::MethodVerifier* method_verifier,
49 bool compile) {
Andreas Gampe0760a812015-08-26 17:12:51 -070050 std::unique_ptr<VerifiedMethod> verified_method(
51 new VerifiedMethod(method_verifier->GetEncounteredFailureTypes(),
52 method_verifier->HasInstructionThatWillThrow(),
53 method_verifier->GetStringInitPcRegMap()));
54
Vladimir Markoc7f83202014-01-24 17:55:18 +000055 if (compile) {
56 /* Generate a register map. */
57 if (!verified_method->GenerateGcMap(method_verifier)) {
Vladimir Markoc7f83202014-01-24 17:55:18 +000058 return nullptr; // Not a real failure, but a failure to encode.
59 }
60 if (kIsDebugBuild) {
61 VerifyGcMap(method_verifier, verified_method->dex_gc_map_);
62 }
63
64 // TODO: move this out when DEX-to-DEX supports devirtualization.
65 if (method_verifier->HasVirtualOrInterfaceInvokes()) {
66 verified_method->GenerateDevirtMap(method_verifier);
67 }
Mathieu Chartiere5f13e52015-02-24 09:37:21 -080068
69 // Only need dequicken info for JIT so far.
Mathieu Chartier091d2382015-03-06 10:59:06 -080070 if (Runtime::Current()->UseJit() && !verified_method->GenerateDequickenMap(method_verifier)) {
71 return nullptr;
Mathieu Chartiere5f13e52015-02-24 09:37:21 -080072 }
Vladimir Markoc7f83202014-01-24 17:55:18 +000073 }
74
75 if (method_verifier->HasCheckCasts()) {
76 verified_method->GenerateSafeCastSet(method_verifier);
77 }
Jeff Hao848f70a2014-01-15 13:49:50 -080078
Vladimir Markoc7f83202014-01-24 17:55:18 +000079 return verified_method.release();
80}
81
82const MethodReference* VerifiedMethod::GetDevirtTarget(uint32_t dex_pc) const {
83 auto it = devirt_map_.find(dex_pc);
84 return (it != devirt_map_.end()) ? &it->second : nullptr;
85}
86
Mathieu Chartiere5f13e52015-02-24 09:37:21 -080087const DexFileReference* VerifiedMethod::GetDequickenIndex(uint32_t dex_pc) const {
88 DCHECK(Runtime::Current()->UseJit());
89 auto it = dequicken_map_.find(dex_pc);
90 return (it != dequicken_map_.end()) ? &it->second : nullptr;
91}
92
Vladimir Markoc7f83202014-01-24 17:55:18 +000093bool VerifiedMethod::IsSafeCast(uint32_t pc) const {
94 return std::binary_search(safe_cast_set_.begin(), safe_cast_set_.end(), pc);
95}
96
97bool VerifiedMethod::GenerateGcMap(verifier::MethodVerifier* method_verifier) {
98 DCHECK(dex_gc_map_.empty());
99 size_t num_entries, ref_bitmap_bits, pc_bits;
100 ComputeGcMapSizes(method_verifier, &num_entries, &ref_bitmap_bits, &pc_bits);
Mathieu Chartierf8da1962015-06-19 13:55:27 -0700101 const size_t ref_bitmap_bytes = RoundUp(ref_bitmap_bits, kBitsPerByte) / kBitsPerByte;
102 static constexpr size_t kFormatBits = 3;
103 // We have 16 - kFormatBits available for the ref_bitmap_bytes.
104 if ((ref_bitmap_bytes >> (16u - kFormatBits)) != 0) {
Andreas Gampe6c170c92014-12-17 14:35:46 -0800105 LOG(WARNING) << "Cannot encode GC map for method with " << ref_bitmap_bits << " registers: "
106 << PrettyMethod(method_verifier->GetMethodReference().dex_method_index,
107 *method_verifier->GetMethodReference().dex_file);
Vladimir Markoc7f83202014-01-24 17:55:18 +0000108 return false;
109 }
Vladimir Markoc7f83202014-01-24 17:55:18 +0000110 // There are 2 bytes to encode the number of entries.
Igor Murashkinc449e8b2015-06-10 15:56:42 -0700111 if (num_entries > std::numeric_limits<uint16_t>::max()) {
Andreas Gampe6c170c92014-12-17 14:35:46 -0800112 LOG(WARNING) << "Cannot encode GC map for method with " << num_entries << " entries: "
113 << PrettyMethod(method_verifier->GetMethodReference().dex_method_index,
114 *method_verifier->GetMethodReference().dex_file);
Vladimir Markoc7f83202014-01-24 17:55:18 +0000115 return false;
116 }
117 size_t pc_bytes;
118 verifier::RegisterMapFormat format;
Mathieu Chartier36b58f52014-12-10 12:06:45 -0800119 if (pc_bits <= kBitsPerByte) {
Vladimir Markoc7f83202014-01-24 17:55:18 +0000120 format = verifier::kRegMapFormatCompact8;
121 pc_bytes = 1;
Mathieu Chartier36b58f52014-12-10 12:06:45 -0800122 } else if (pc_bits <= kBitsPerByte * 2) {
Vladimir Markoc7f83202014-01-24 17:55:18 +0000123 format = verifier::kRegMapFormatCompact16;
124 pc_bytes = 2;
125 } else {
Andreas Gampe6c170c92014-12-17 14:35:46 -0800126 LOG(WARNING) << "Cannot encode GC map for method with "
127 << (1 << pc_bits) << " instructions (number is rounded up to nearest power of 2): "
128 << PrettyMethod(method_verifier->GetMethodReference().dex_method_index,
129 *method_verifier->GetMethodReference().dex_file);
Vladimir Markoc7f83202014-01-24 17:55:18 +0000130 return false;
131 }
132 size_t table_size = ((pc_bytes + ref_bitmap_bytes) * num_entries) + 4;
133 dex_gc_map_.reserve(table_size);
134 // Write table header.
Mathieu Chartierf8da1962015-06-19 13:55:27 -0700135 dex_gc_map_.push_back(format | ((ref_bitmap_bytes & ~0xFF) >> (kBitsPerByte - kFormatBits)));
Vladimir Markoc7f83202014-01-24 17:55:18 +0000136 dex_gc_map_.push_back(ref_bitmap_bytes & 0xFF);
137 dex_gc_map_.push_back(num_entries & 0xFF);
138 dex_gc_map_.push_back((num_entries >> 8) & 0xFF);
139 // Write table data.
140 const DexFile::CodeItem* code_item = method_verifier->CodeItem();
141 for (size_t i = 0; i < code_item->insns_size_in_code_units_; i++) {
142 if (method_verifier->GetInstructionFlags(i).IsCompileTimeInfoPoint()) {
143 dex_gc_map_.push_back(i & 0xFF);
144 if (pc_bytes == 2) {
145 dex_gc_map_.push_back((i >> 8) & 0xFF);
146 }
147 verifier::RegisterLine* line = method_verifier->GetRegLine(i);
Ian Rogers7b078e82014-09-10 14:44:24 -0700148 line->WriteReferenceBitMap(method_verifier, &dex_gc_map_, ref_bitmap_bytes);
Vladimir Markoc7f83202014-01-24 17:55:18 +0000149 }
150 }
151 DCHECK_EQ(dex_gc_map_.size(), table_size);
152 return true;
153}
154
155void VerifiedMethod::VerifyGcMap(verifier::MethodVerifier* method_verifier,
156 const std::vector<uint8_t>& data) {
157 // Check that for every GC point there is a map entry, there aren't entries for non-GC points,
158 // that the table data is well formed and all references are marked (or not) in the bitmap.
159 verifier::DexPcToReferenceMap map(&data[0]);
Mathieu Chartierf8da1962015-06-19 13:55:27 -0700160 CHECK_EQ(data.size(), map.RawSize()) << map.NumEntries() << " " << map.RegWidth();
Vladimir Markoc7f83202014-01-24 17:55:18 +0000161 size_t map_index = 0;
162 const DexFile::CodeItem* code_item = method_verifier->CodeItem();
163 for (size_t i = 0; i < code_item->insns_size_in_code_units_; i++) {
164 const uint8_t* reg_bitmap = map.FindBitMap(i, false);
165 if (method_verifier->GetInstructionFlags(i).IsCompileTimeInfoPoint()) {
166 DCHECK_LT(map_index, map.NumEntries());
167 DCHECK_EQ(map.GetDexPc(map_index), i);
168 DCHECK_EQ(map.GetBitMap(map_index), reg_bitmap);
169 map_index++;
170 verifier::RegisterLine* line = method_verifier->GetRegLine(i);
171 for (size_t j = 0; j < code_item->registers_size_; j++) {
Ian Rogers7b078e82014-09-10 14:44:24 -0700172 if (line->GetRegisterType(method_verifier, j).IsNonZeroReferenceTypes()) {
Mathieu Chartier36b58f52014-12-10 12:06:45 -0800173 DCHECK_LT(j / kBitsPerByte, map.RegWidth());
174 DCHECK_EQ((reg_bitmap[j / kBitsPerByte] >> (j % kBitsPerByte)) & 1, 1);
175 } else if ((j / kBitsPerByte) < map.RegWidth()) {
176 DCHECK_EQ((reg_bitmap[j / kBitsPerByte] >> (j % kBitsPerByte)) & 1, 0);
Vladimir Markoc7f83202014-01-24 17:55:18 +0000177 } else {
178 // If a register doesn't contain a reference then the bitmap may be shorter than the line.
179 }
180 }
181 } else {
Mathieu Chartier2cebb242015-04-21 16:50:40 -0700182 DCHECK(i >= 65536 || reg_bitmap == nullptr);
Vladimir Markoc7f83202014-01-24 17:55:18 +0000183 }
184 }
185}
186
187void VerifiedMethod::ComputeGcMapSizes(verifier::MethodVerifier* method_verifier,
188 size_t* gc_points, size_t* ref_bitmap_bits,
189 size_t* log2_max_gc_pc) {
190 size_t local_gc_points = 0;
191 size_t max_insn = 0;
192 size_t max_ref_reg = -1;
193 const DexFile::CodeItem* code_item = method_verifier->CodeItem();
194 for (size_t i = 0; i < code_item->insns_size_in_code_units_; i++) {
195 if (method_verifier->GetInstructionFlags(i).IsCompileTimeInfoPoint()) {
196 local_gc_points++;
197 max_insn = i;
198 verifier::RegisterLine* line = method_verifier->GetRegLine(i);
Ian Rogers7b078e82014-09-10 14:44:24 -0700199 max_ref_reg = line->GetMaxNonZeroReferenceReg(method_verifier, max_ref_reg);
Vladimir Markoc7f83202014-01-24 17:55:18 +0000200 }
201 }
202 *gc_points = local_gc_points;
203 *ref_bitmap_bits = max_ref_reg + 1; // If max register is 0 we need 1 bit to encode (ie +1).
204 size_t i = 0;
205 while ((1U << i) <= max_insn) {
206 i++;
207 }
208 *log2_max_gc_pc = i;
209}
210
Mathieu Chartier091d2382015-03-06 10:59:06 -0800211bool VerifiedMethod::GenerateDequickenMap(verifier::MethodVerifier* method_verifier) {
Mathieu Chartier36b58f52014-12-10 12:06:45 -0800212 if (method_verifier->HasFailures()) {
Mathieu Chartier091d2382015-03-06 10:59:06 -0800213 return false;
Mathieu Chartier36b58f52014-12-10 12:06:45 -0800214 }
215 const DexFile::CodeItem* code_item = method_verifier->CodeItem();
216 const uint16_t* insns = code_item->insns_;
217 const Instruction* inst = Instruction::At(insns);
218 const Instruction* end = Instruction::At(insns + code_item->insns_size_in_code_units_);
219 for (; inst < end; inst = inst->Next()) {
220 const bool is_virtual_quick = inst->Opcode() == Instruction::INVOKE_VIRTUAL_QUICK;
221 const bool is_range_quick = inst->Opcode() == Instruction::INVOKE_VIRTUAL_RANGE_QUICK;
222 if (is_virtual_quick || is_range_quick) {
223 uint32_t dex_pc = inst->GetDexPc(insns);
224 verifier::RegisterLine* line = method_verifier->GetRegLine(dex_pc);
Mathieu Chartiere401d142015-04-22 13:56:20 -0700225 ArtMethod* method =
Mathieu Chartier091d2382015-03-06 10:59:06 -0800226 method_verifier->GetQuickInvokedMethod(inst, line, is_range_quick, true);
227 if (method == nullptr) {
228 // It can be null if the line wasn't verified since it was unreachable.
229 return false;
230 }
Mathieu Chartier36b58f52014-12-10 12:06:45 -0800231 // The verifier must know what the type of the object was or else we would have gotten a
232 // failure. Put the dex method index in the dequicken map since we need this to get number of
233 // arguments in the compiler.
Mathieu Chartiere5f13e52015-02-24 09:37:21 -0800234 dequicken_map_.Put(dex_pc, DexFileReference(method->GetDexFile(),
235 method->GetDexMethodIndex()));
236 } else if (IsInstructionIGetQuickOrIPutQuick(inst->Opcode())) {
237 uint32_t dex_pc = inst->GetDexPc(insns);
238 verifier::RegisterLine* line = method_verifier->GetRegLine(dex_pc);
Mathieu Chartierc7853442015-03-27 14:35:38 -0700239 ArtField* field = method_verifier->GetQuickFieldAccess(inst, line);
Mathieu Chartier091d2382015-03-06 10:59:06 -0800240 if (field == nullptr) {
241 // It can be null if the line wasn't verified since it was unreachable.
242 return false;
243 }
Mathieu Chartiere5f13e52015-02-24 09:37:21 -0800244 // The verifier must know what the type of the field was or else we would have gotten a
245 // failure. Put the dex field index in the dequicken map since we need this for lowering
246 // in the compiler.
247 // TODO: Putting a field index in a method reference is gross.
248 dequicken_map_.Put(dex_pc, DexFileReference(field->GetDexFile(), field->GetDexFieldIndex()));
Mathieu Chartier36b58f52014-12-10 12:06:45 -0800249 }
250 }
Mathieu Chartier091d2382015-03-06 10:59:06 -0800251 return true;
Mathieu Chartier36b58f52014-12-10 12:06:45 -0800252}
253
Vladimir Markoc7f83202014-01-24 17:55:18 +0000254void VerifiedMethod::GenerateDevirtMap(verifier::MethodVerifier* method_verifier) {
255 // It is risky to rely on reg_types for sharpening in cases of soft
256 // verification, we might end up sharpening to a wrong implementation. Just abort.
257 if (method_verifier->HasFailures()) {
258 return;
259 }
260
261 const DexFile::CodeItem* code_item = method_verifier->CodeItem();
262 const uint16_t* insns = code_item->insns_;
263 const Instruction* inst = Instruction::At(insns);
264 const Instruction* end = Instruction::At(insns + code_item->insns_size_in_code_units_);
265
266 for (; inst < end; inst = inst->Next()) {
Mathieu Chartier36b58f52014-12-10 12:06:45 -0800267 const bool is_virtual = inst->Opcode() == Instruction::INVOKE_VIRTUAL ||
268 inst->Opcode() == Instruction::INVOKE_VIRTUAL_RANGE;
269 const bool is_interface = inst->Opcode() == Instruction::INVOKE_INTERFACE ||
270 inst->Opcode() == Instruction::INVOKE_INTERFACE_RANGE;
Vladimir Markoc7f83202014-01-24 17:55:18 +0000271
272 if (!is_interface && !is_virtual) {
273 continue;
274 }
275 // Get reg type for register holding the reference to the object that will be dispatched upon.
276 uint32_t dex_pc = inst->GetDexPc(insns);
277 verifier::RegisterLine* line = method_verifier->GetRegLine(dex_pc);
Mathieu Chartier36b58f52014-12-10 12:06:45 -0800278 const bool is_range = inst->Opcode() == Instruction::INVOKE_VIRTUAL_RANGE ||
279 inst->Opcode() == Instruction::INVOKE_INTERFACE_RANGE;
Ian Rogersd8f69b02014-09-10 21:43:52 +0000280 const verifier::RegType&
Ian Rogers7b078e82014-09-10 14:44:24 -0700281 reg_type(line->GetRegisterType(method_verifier,
282 is_range ? inst->VRegC_3rc() : inst->VRegC_35c()));
Vladimir Markoc7f83202014-01-24 17:55:18 +0000283
284 if (!reg_type.HasClass()) {
285 // We will compute devirtualization information only when we know the Class of the reg type.
286 continue;
287 }
288 mirror::Class* reg_class = reg_type.GetClass();
289 if (reg_class->IsInterface()) {
290 // We can't devirtualize when the known type of the register is an interface.
291 continue;
292 }
293 if (reg_class->IsAbstract() && !reg_class->IsArrayClass()) {
294 // We can't devirtualize abstract classes except on arrays of abstract classes.
295 continue;
296 }
Mathieu Chartiere401d142015-04-22 13:56:20 -0700297 auto* cl = Runtime::Current()->GetClassLinker();
298 size_t pointer_size = cl->GetImagePointerSize();
299 ArtMethod* abstract_method = method_verifier->GetDexCache()->GetResolvedMethod(
300 is_range ? inst->VRegB_3rc() : inst->VRegB_35c(), pointer_size);
Mathieu Chartier2cebb242015-04-21 16:50:40 -0700301 if (abstract_method == nullptr) {
Vladimir Markoc7f83202014-01-24 17:55:18 +0000302 // If the method is not found in the cache this means that it was never found
303 // by ResolveMethodAndCheckAccess() called when verifying invoke_*.
304 continue;
305 }
306 // Find the concrete method.
Mathieu Chartiere401d142015-04-22 13:56:20 -0700307 ArtMethod* concrete_method = nullptr;
Vladimir Markoc7f83202014-01-24 17:55:18 +0000308 if (is_interface) {
Mathieu Chartiere401d142015-04-22 13:56:20 -0700309 concrete_method = reg_type.GetClass()->FindVirtualMethodForInterface(
310 abstract_method, pointer_size);
Vladimir Markoc7f83202014-01-24 17:55:18 +0000311 }
312 if (is_virtual) {
Mathieu Chartiere401d142015-04-22 13:56:20 -0700313 concrete_method = reg_type.GetClass()->FindVirtualMethodForVirtual(
314 abstract_method, pointer_size);
Vladimir Markoc7f83202014-01-24 17:55:18 +0000315 }
Alex Light9139e002015-10-09 15:59:48 -0700316 if (concrete_method == nullptr || !concrete_method->IsInvokable()) {
317 // In cases where concrete_method is not found, or is not invokable, continue to the next
318 // invoke.
Vladimir Markoc7f83202014-01-24 17:55:18 +0000319 continue;
320 }
321 if (reg_type.IsPreciseReference() || concrete_method->IsFinal() ||
322 concrete_method->GetDeclaringClass()->IsFinal()) {
323 // If we knew exactly the class being dispatched upon, or if the target method cannot be
324 // overridden record the target to be used in the compiler driver.
Mathieu Chartier36b58f52014-12-10 12:06:45 -0800325 devirt_map_.Put(dex_pc, concrete_method->ToMethodReference());
Vladimir Markoc7f83202014-01-24 17:55:18 +0000326 }
327 }
328}
329
330void VerifiedMethod::GenerateSafeCastSet(verifier::MethodVerifier* method_verifier) {
331 /*
332 * Walks over the method code and adds any cast instructions in which
333 * the type cast is implicit to a set, which is used in the code generation
334 * to elide these casts.
335 */
336 if (method_verifier->HasFailures()) {
337 return;
338 }
339 const DexFile::CodeItem* code_item = method_verifier->CodeItem();
340 const Instruction* inst = Instruction::At(code_item->insns_);
341 const Instruction* end = Instruction::At(code_item->insns_ +
342 code_item->insns_size_in_code_units_);
343
344 for (; inst < end; inst = inst->Next()) {
345 Instruction::Code code = inst->Opcode();
346 if ((code == Instruction::CHECK_CAST) || (code == Instruction::APUT_OBJECT)) {
347 uint32_t dex_pc = inst->GetDexPc(code_item->insns_);
Stephen Kyle40d35182014-10-03 13:47:56 +0100348 if (!method_verifier->GetInstructionFlags(dex_pc).IsVisited()) {
349 // Do not attempt to quicken this instruction, it's unreachable anyway.
350 continue;
351 }
Vladimir Markoc7f83202014-01-24 17:55:18 +0000352 const verifier::RegisterLine* line = method_verifier->GetRegLine(dex_pc);
353 bool is_safe_cast = false;
354 if (code == Instruction::CHECK_CAST) {
Ian Rogers7b078e82014-09-10 14:44:24 -0700355 const verifier::RegType& reg_type(line->GetRegisterType(method_verifier,
356 inst->VRegA_21c()));
Ian Rogersd8f69b02014-09-10 21:43:52 +0000357 const verifier::RegType& cast_type =
Vladimir Markoc7f83202014-01-24 17:55:18 +0000358 method_verifier->ResolveCheckedClass(inst->VRegB_21c());
359 is_safe_cast = cast_type.IsStrictlyAssignableFrom(reg_type);
360 } else {
Ian Rogers7b078e82014-09-10 14:44:24 -0700361 const verifier::RegType& array_type(line->GetRegisterType(method_verifier,
362 inst->VRegB_23x()));
Vladimir Markoc7f83202014-01-24 17:55:18 +0000363 // We only know its safe to assign to an array if the array type is precise. For example,
364 // an Object[] can have any type of object stored in it, but it may also be assigned a
365 // String[] in which case the stores need to be of Strings.
366 if (array_type.IsPreciseReference()) {
Ian Rogers7b078e82014-09-10 14:44:24 -0700367 const verifier::RegType& value_type(line->GetRegisterType(method_verifier,
368 inst->VRegA_23x()));
Ian Rogersd8f69b02014-09-10 21:43:52 +0000369 const verifier::RegType& component_type = method_verifier->GetRegTypeCache()
Vladimir Markoc7f83202014-01-24 17:55:18 +0000370 ->GetComponentType(array_type, method_verifier->GetClassLoader());
371 is_safe_cast = component_type.IsStrictlyAssignableFrom(value_type);
372 }
373 }
374 if (is_safe_cast) {
375 // Verify ordering for push_back() to the sorted vector.
376 DCHECK(safe_cast_set_.empty() || safe_cast_set_.back() < dex_pc);
377 safe_cast_set_.push_back(dex_pc);
378 }
379 }
380 }
381}
382
383} // namespace art