Searched refs:it (Results 51 - 75 of 154) sorted by relevance

1234567

/art/compiler/optimizing/
H A Dreference_type_propagation.cc132 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
133 HBasicBlock* block = it.Current();
167 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
168 VisitBasicBlock(it.Current());
178 for (HInstructionIterator it(block->GetPhis()); !it
[all...]
H A Dgraph_checker.cc54 for (auto it = sorted_predecessors.begin(), end = sorted_predecessors.end(); it != end; ) {
55 HBasicBlock* p = *it++;
57 for (; it != end && *it == p; ++it) {
77 for (auto it = sorted_successors.begin(), end = sorted_successors.end(); it != end; ) {
78 HBasicBlock* s = *it++;
80 for (; it !
[all...]
H A Dinduction_var_analysis.cc127 for (HInstructionIterator it(loop_block->GetPhis()); !it.Done(); it.Advance()) {
128 HInstruction* instruction = it.Current();
133 for (HInstructionIterator it(loop_block->GetInstructions()); !it.Done(); it.Advance()) {
134 HInstruction* instruction = it.Current();
205 auto it = map_.find(instruction); local
206 return it
526 auto it = cycle_.find(x); local
562 auto it = cycle_.find(conversion->GetInput()); local
804 auto it = induction_.find(loop); local
816 auto it = induction_.find(loop); local
[all...]
H A Dgraph_visualizer.cc237 // because it does not handle reference types (that is kPrimNot).
497 for (HInputIterator it(instruction); !it.Done(); it.Advance()) {
498 inputs.NewEntryStream() << GetTypeId(it.Current()->GetType()) << it.Current()->GetId();
596 auto it = disasm_info_->GetInstructionIntervals().find(instruction); local
597 if (it != disasm_info_->GetInstructionIntervals().end()
598 && it->second.start != it
[all...]
H A Dregister_allocator.cc79 // TODO: compute it instead.
116 for (HLinearOrderIterator it(*codegen_->GetGraph()); !it.Done(); it.Advance()) {
117 HBasicBlock* block = it.Current();
171 for (HLinearPostOrderIterator it(*codegen_->GetGraph()); !it.Done(); it.Advance()) {
172 HBasicBlock* block = it.Current();
404 // Don't add directly to `unhandled`, it need
[all...]
H A Dinstruction_simplifier_arm64.cc152 // Merge a bitfield move instruction into its uses if it can be merged in all of them.
174 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) {
175 HInstruction* user = it->GetUser();
176 // Increment `it` now because `*it` will disappear thanks to MergeIntoShifterOperand().
177 ++it;
/art/runtime/
H A Dintern_table.cc284 // cleared after SweepSystemWeaks has completed. This is why we need to wait until it is
433 auto it = table.Find(GcRoot<mirror::String>(s)); local
434 if (it != table.end()) {
435 table.Erase(it);
445 auto it = table.Find(GcRoot<mirror::String>(s)); local
446 if (it != table.end()) {
447 return it->Read();
456 auto it = table.Find(string); local
457 if (it != table.end()) {
458 return it
[all...]
H A Ddex_file_test.cc238 ClassDataItemIterator it(*raw, class_data);
240 EXPECT_EQ(1u, it.NumDirectMethods());
244 ASSERT_EQ(1U, it.NumDirectMethods());
245 const DexFile::MethodId& method_id = raw->GetMethodId(it.GetMemberIndex());
253 ASSERT_EQ(2U, it.NumVirtualMethods());
255 it.Next();
256 const DexFile::MethodId& method_id = raw->GetMethodId(it.GetMemberIndex());
266 it.Next();
267 const DexFile::MethodId& method_id = raw->GetMethodId(it.GetMemberIndex());
H A Ddex_file_verifier.cc329 0, // Unaligned, spec doesn't talk about it, even though size
505 // Check that it's the right class.
516 // Check that it falls into the right class-data list.
546 // Check that it's the right class.
557 // Check that it's not defined as both direct and virtual.
833 bool DexFileVerifier::CheckIntraClassDataItemFields(ClassDataItemIterator* it, argument
837 DCHECK(it != nullptr);
840 for (; kStatic ? it->HasNextStaticField() : it->HasNextInstanceField(); it
866 CheckIntraClassDataItemMethods( ClassDataItemIterator* it, std::unordered_set<uint32_t>* direct_method_indexes, bool* have_class, uint16_t* class_type_index, uint32_t* class_access_flags) argument
1642 auto it = offset_to_type_map_.Find(offset); local
[all...]
H A Dutils.cc91 // (On Mac OS 10.7, it's the end.)
170 // Print the rest of the buffer, if it exists.
648 * It's a multibyte encoded character. Decode it and analyze. We
674 // It's only valid if it's above the ISO-8859-1 high space (0xa0).
779 * If we're looking at an array of some sort, then it doesn't
782 * treat it as such.
789 * We are looking for a descriptor. Either validate it as a
839 * and that it doesn't end with an empty component
1134 // Try to run it to see whether we have it
1618 auto it = dex_pc_to_node_id.find(dex_pc); local
1752 auto it = handled_targets.find(handler_pc); local
[all...]
/art/runtime/jit/
H A Ddebugger_interface.cc54 // To prevent GCC from inlining or removing it we place noinline attribute
77 // Make a copy of the buffer. We want to shrink it anyway.
146 const auto& it = g_jit_code_entries.find(address); local
147 if (it == g_jit_code_entries.end()) {
150 DeleteJITCodeEntryInternal(it->second);
151 g_jit_code_entries.erase(it);
H A Dprofile_saver.cc145 // If we didn't save to disk it may be because we didn't have enough new methods.
168 // Unlikely to overflow but if it happens,
241 for (const auto& it : tracked_dex_base_locations_) {
243 const std::string& filename = it.first;
244 const std::set<std::string>& locations = it.second;
283 for (const auto& it : tracked_locations) {
287 const std::string& filename = it.first;
288 const std::set<std::string>& locations = it.second;
373 // Profile it with the hope that the background dexopt will get us back into
381 << "Skip profiling oat file because it'
489 auto it = tracked_dex_base_locations_.find(output_filename); local
[all...]
/art/runtime/base/
H A Dvariant_map.h43 // Since the key is strongly typed at compile-time, it is impossible to accidentally
76 // Allocate a unique counter value each time it's called.
231 // Lookup the value from the key. If it was not set in the map, return the default value.
240 // TODO: move to detail, or make it more generic like a ScopeGuard(function)
253 // Release the value from the key. If it was not set in the map, returns the default value.
254 // If the key was set, it is removed as a side effect.
302 auto&& it = GetKeyValueIterator(key); local
303 if (it != storage_map_.end()) {
304 key.ValueDelete(it->second);
305 delete it
434 auto&& it = GetKeyValueIterator(key); local
[all...]
/art/runtime/interpreter/mterp/arm/
H A Dop_const_string_jumbo.S12 bne MterpPossibleException @ let reference interpreter deal with it.
/art/compiler/dex/
H A Dverified_method.cc71 auto it = devirt_map_.find(dex_pc); local
72 return (it != devirt_map_.end()) ? &it->second : nullptr;
77 auto it = dequicken_map_.find(dex_pc); local
78 return (it != dequicken_map_.end()) ? &it->second : nullptr;
102 // It can be null if the line wasn't verified since it was unreachable.
115 // It can be null if the line wasn't verified since it was unreachable.
176 // If the method is not found in the cache this means that it was never found
223 // Do not attempt to quicken this instruction, it'
[all...]
/art/runtime/arch/
H A Dinstruction_set_features.cc223 for (auto it = features.begin(); it != features.end();) {
228 std::string feature = Trim(*it);
247 ++it;
249 it = features.erase(it);
/art/compiler/utils/
H A Ddedupe_set-inl.h72 auto it = keys_.Find(hashed_in_key); variable
73 if (it != keys_.end()) {
74 DCHECK(it->Key() != nullptr);
75 return it->Key();
93 auto it = stats.find(key.Hash()); variable
94 if (it == stats.end()) {
97 ++it->second;
/art/compiler/driver/
H A Dcompiler_driver.cc239 // Indicate that a method of the given type was unresolved at compile time as it was in an
586 // for example, relies on it.
629 // NOTE: if compiler declines to compile this method, it will return null.
727 // just grab a reference to it that we use without holding the mutex.
833 ClassDataItemIterator it(*dex_file, class_data);
835 while (it.HasNextStaticField()) {
836 it.Next();
838 while (it.HasNextInstanceField()) {
839 it.Next();
852 while (it
2752 auto it = compiled_methods_.find(method_ref); local
2765 ClassTable::const_iterator it = compiled_classes_.find(ref); local
2775 auto it = compiled_classes_.find(ref); local
2802 MethodTable::const_iterator it = compiled_methods_.find(ref); local
2854 auto it = requires_constructor_barrier_.find(class_ref); local
[all...]
/art/oatdump/
H A Doatdump.cc91 auto it = opened_dex_files.find(oat_dex_file); local
92 if (it != opened_dex_files.end()) {
93 return it->second.get();
214 // Note: even if this is an interface or a native class, we still have to walk it, as there
216 ClassDataItemIterator it(dex_file, class_data);
218 for (; it.HasNextStaticField(); it.Next()) { /* skip */ }
219 for (; it.HasNextInstanceField(); it.Next()) { /* skip */ }
220 for (; it
479 auto it = offsets_.upper_bound(begin_offset); local
717 SkipAllFields(ClassDataItemIterator& it) argument
1718 auto it = state->dex_caches_.find(obj); local
1947 SizeAndCountTable::iterator it = sizes_and_counts.find(descriptor); local
[all...]
/art/compiler/debug/
H A Delf_debug_loc_writer.h123 for (auto it = stack_maps.begin(); it != stack_maps.end(); it++) {
124 const uint32_t low_pc = it->first;
125 const uint32_t stack_map_index = it->second;
127 auto next_it = it;
174 // The dex register might be valid only at some points and it might
218 // The stack offset is relative to SP. Make it relative to CFA.
314 // Simple de-duplication - check whether this entry is same as the last one (or tail of it).
H A Delf_debug_writer.cc187 for (const auto& it : trampolines) {
188 if (it.second != 0) {
190 info.trampoline_name = it.first;
193 info.code_address = it.second - header.GetExecutableOffset();
/art/compiler/dex/quick/
H A Ddex_file_method_inliner.cc692 auto it = inline_methods_.find(method_index); local
693 if (it != inline_methods_.end()) {
694 DCHECK_NE(it->second.flags & (kInlineIntrinsic | kInlineSpecial), 0);
695 return it->second.flags;
703 auto it = inline_methods_.find(method_index); local
704 bool res = (it != inline_methods_.end() && (it->second.flags & kInlineIntrinsic) != 0);
706 *intrinsic = it->second;
713 auto it = inline_methods_.find(method_index); local
714 return it !
848 auto it = inline_methods_.find(method_index); local
859 auto it = inline_methods_.find(method_index); local
[all...]
/art/runtime/gc/space/
H A Dlarge_object_space.cc178 auto it = large_objects_.find(obj); local
179 CHECK(it != large_objects_.end());
180 return it->second.is_zygote;
192 auto it = large_objects_.find(ptr); local
193 if (UNLIKELY(it == large_objects_.end())) {
198 MemMap* mem_map = it->second.mem_map;
205 large_objects_.erase(it);
211 auto it = large_objects_.find(obj); local
212 CHECK(it != large_objects_.end()) << "Attempted to get size of a large object which is not live";
213 size_t alloc_size = it
403 auto it = free_blocks_.lower_bound(info); local
488 auto it = free_blocks_.lower_bound(&temp_info); local
[all...]
/art/compiler/
H A Dimage_writer.cc155 // This needs to happen after CalculateNewObjectOffsets since it relies on intern_table_bytes_ and
198 // Empty the file in case it already exists.
317 // The header is uncompressed since it contains whether the image is compressed or not.
401 // No hash, don't need to save it.
421 auto it = dex_file_oat_index_map_.find(dex_file); local
422 DCHECK(it != dex_file_oat_index_map_.end()) << dex_file->GetLocation();
423 ImageInfo& image_info = GetImageInfo(it->second);
517 // Since these arrays are huge, most pages do not overlap other objects and it's not
558 // If the class's static fields are all final, put it into a separate bin
559 // since it'
793 auto it = visited->find(klass); local
1110 auto it = native_object_relocations_.find(cur_fields); local
1157 auto it = native_object_relocations_.find(array); local
1429 auto it = dex_file_oat_index_map_.find(dex_file); local
1669 auto it = native_object_relocations_.find(method); local
1865 auto it = native_object_relocations_.find(elem); local
1908 const auto it = saved_hashcode_map_.find(obj); local
1971 auto it = native_object_relocations_.find(obj); local
1995 auto it = native_object_relocations_.find(obj); local
2051 auto it = pointer_arrays_.find(down_cast<mirror::PointerArray*>(orig)); local
2067 auto it = native_object_relocations_.find(src_method); local
2363 auto it = oat_index_map_.find(obj); local
2372 auto it = dex_file_oat_index_map_.find(dex_file); local
[all...]
H A Doat_writer.cc172 // class_def_method_index. If 0, it means the corresponding
331 // The file is open for reading, not writing, so it's OK to let the File destructor
332 // close it without checking for explicit Close(), so pass checkUsage = false.
456 // Do a bulk checksum update for Dex[] and TypeLookupTable[]. Doing it piece by
547 virtual bool VisitMethod(size_t class_def_method_index, const ClassDataItemIterator& it) = 0;
621 const ClassDataItemIterator& it) {
626 uint32_t method_idx = it.GetMemberIndex();
678 bool VisitMethod(size_t class_def_method_index, const ClassDataItemIterator& it)
693 MethodReference method_ref(dex_file_, it.GetMemberIndex());
700 quick_code_offset = NewQuickCodeOffset(compiled_method, it, thumb_offse
[all...]

Completed in 498 milliseconds

1234567