Searched defs:it (Results 1 - 25 of 82) sorted by relevance

1234

/art/compiler/linker/
H A Dmulti_oat_relative_patcher.cc64 auto it = map.find(ref); local
65 if (it == map.end()) {
68 return std::pair<bool, uint32_t>(true, it->second);
H A Dmulti_oat_relative_patcher.h52 // GetOffset() and an error indication in WriteThunks(). Additionally, it must be
53 // page-aligned, so that it does not skew alignment calculations, say arm64 ADRP.
58 auto it = method_offset_map_.map.find(method_ref); local
59 return (it != method_offset_map_.map.end()) ? it->second - adjustment_ : 0u;
H A Drelative_patcher_test.h258 auto it = map.find(ref); variable
259 if (it == map.end()) {
262 return std::pair<bool, uint32_t>(true, it->second);
/art/runtime/gc/accounting/
H A Dheap_bitmap.cc28 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), local
30 CHECK(it != continuous_space_bitmaps_.end()) << " continuous space bitmap " << old_bitmap
32 *it = new_bitmap;
37 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), old_bitmap); local
38 CHECK(it != large_object_bitmaps_.end()) << " large object bitmap " << old_bitmap
40 *it = new_bitmap;
57 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), bitmap); local
58 DCHECK(it != continuous_space_bitmaps_.end());
59 continuous_space_bitmaps_.erase(it);
69 auto it local
[all...]
/art/test/548-checker-inlining-and-dce/src/
H A DMain.java21 private void inlinedForNull(Iterable it) { argument
22 if (it != null) {
28 private void inlinedForFalse(boolean value, Iterable it) { argument
42 public void testInlinedForFalseInlined(Iterable it) { argument
43 inlinedForFalse(false, it);
52 public void testInlinedForFalseNotInlined(Iterable it) { argument
53 inlinedForFalse(true, it);
63 public void testInlinedForNullInlined(Iterable it) { argument
73 public void testInlinedForNullNotInlined(Iterable it) { argument
74 inlinedForNull(it);
[all...]
/art/compiler/debug/dwarf/
H A Ddebug_abbrev_writer.h69 auto it = abbrev_codes_.insert(std::make_pair(std::move(current_abbrev_), NextAbbrevCode())); local
70 uint32_t abbrev_code = it.first->second;
71 if (UNLIKELY(it.second)) { // Inserted new entry.
72 const Vector& abbrev = it.first->first;
/art/compiler/utils/
H A Datomic_method_ref_map-inl.h59 auto it = arrays_.find(dex_file); local
60 return (it != arrays_.end()) ? &it->second : nullptr;
66 auto it = arrays_.find(dex_file); local
67 return (it != arrays_.end()) ? &it->second : nullptr;
83 for (auto& it : arrays_) {
84 for (auto& element : it.second) {
H A Dswap_space.cc113 auto it = free_by_start_.empty() local
116 if (it != free_by_size_.end()) {
117 auto entry = it->free_by_start_entry;
120 RemoveChunk(it);
127 it->free_by_start_entry->ptr += size;
128 it->free_by_start_entry->size -= size;
133 if (it == free_by_size_.begin()) {
134 it->size -= size;
136 auto prev = it;
140 it
199 auto it = free_by_start_.lower_bound(chunk); local
[all...]
H A Ddedupe_set-inl.h73 auto it = keys_.Find(hashed_in_key); variable
74 if (it != keys_.end()) {
75 DCHECK(it->Key() != nullptr);
76 return it->Key();
94 auto it = stats.find(key.Hash()); variable
95 if (it == stats.end()) {
98 ++it->second;
/art/runtime/openjdkjvmti/
H A Djvmti_weak_table.h11 * This code is free software; you can redistribute it and/or modify it
17 * This code is distributed in the hope that it will be useful, but WITHOUT
143 auto it = tagged_objects_.find(art::GcRoot<art::mirror::Object>(obj)); local
144 if (it != tagged_objects_.end()) {
145 *result = it->second;
/art/compiler/dex/
H A Dverification_results.cc68 auto it = verified_methods_.find(ref); local
69 inserted = it == verified_methods_.end();
74 existing = it->second;
82 // TODO: Investigate why are we doing the work again for this method and try to avoid it.
88 // registered. It is unsafe to replace the existing one since the JIT may be using it to
99 auto it = verified_methods_.find(ref); local
100 return (it != verified_methods_.end()) ? it->second : nullptr;
147 for (auto it = verified_methods_.begin(); it !
[all...]
/art/runtime/base/
H A Diteration_range.h53 inline IterationRange<Iter> MakeEmptyIterationRange(const Iter& it) { argument
54 return IterationRange<Iter>(it, it);
H A Dtransform_iterator_test.cc136 auto it = MakeTransformIterator(input.begin(), add1); local
137 decltype(MakeTransformIterator(input.cbegin(), add1)) cit = it;
138 static_assert(!std::is_same<decltype(it), decltype(cit)>::value, "Types must be different");
139 ASSERT_EQ(it, cit);
204 auto it = MakeTransformIterator(input.begin(), sub1); local
205 decltype(MakeTransformIterator(input.cbegin(), sub1)) cit = it;
206 static_assert(!std::is_same<decltype(it), decltype(cit)>::value, "Types must be different");
207 ASSERT_EQ(it, cit);
242 auto it = MakeTransformIterator(input.begin(), mul3); local
243 decltype(MakeTransformIterator(input.cbegin(), mul3)) cit = it;
502 auto it = MakeTransformIterator(input.begin(), ref); local
[all...]
H A Dstl_util.h41 // For hash_[multi]set, it is important that this deletes behind the iterator
42 // because the hash_set may call the hash function on the iterator when it is
75 // in the case it's given a null pointer.
122 auto it = std::find(container.begin(), container.end(), value); local
123 DCHECK(it != container.end()); // Must exist.
124 return std::distance(container.begin(), it);
130 auto it = std::find(container.begin(), container.end(), value); local
131 DCHECK(it != container.end()); // Must exist.
132 container.erase(it);
138 auto it local
149 auto it = std::find(start, container.end(), value); local
[all...]
H A Dhash_set_test.cc72 auto it = hash_set.Find(test_string); local
73 ASSERT_EQ(*it, test_string);
74 auto after_it = hash_set.Erase(it);
78 it = hash_set.Find(test_string);
79 ASSERT_TRUE(it == hash_set.end());
90 auto it = hash_set.Find(strings[i]); local
91 ASSERT_TRUE(it != hash_set.end());
92 ASSERT_EQ(*it, strings[i]);
97 auto it = hash_set.Find(strings[i]); local
98 ASSERT_TRUE(it !
104 auto it = hash_set.Find(strings[i]); local
108 auto it = hash_set.Find(strings[i]); local
274 auto it = hash_map.Find(std::string("abcd")); local
[all...]
H A Dtiming_logger.cc97 auto it = histograms_.find(&dummy); local
98 if (it == histograms_.end()) {
104 histogram = *it;
123 // We don't expect DumpHistogram to be called often, so it is not performance critical.
/art/test/923-monitors/src/art/
H A DTest923.java143 Iterator<String> it = output.iterator();
149 String s = it.next();
166 expect("Lock", it, output);
167 expect("Notify", it, output);
168 expect("Unlock", it, output);
171 expect("Awakened", it, output);
172 expect("Unlock", it, output);
175 expect("Lock", it, output);
176 expect("NotifyAll", it, output);
177 expect("Unlock", it, outpu
207 expect(String s, Iterator<String> it, List<String> output) argument
[all...]
/art/runtime/jdwp/
H A Dobject_registry.cc111 // This object isn't in the registry yet, so add it.
133 for (auto it = object_to_entry_.lower_bound(identity_hash_code), end = object_to_entry_.end();
134 it != end && it->first == identity_hash_code; ++it) {
135 ObjectRegistryEntry* entry = it->second;
182 auto it = id_to_entry_.find(id); local
183 if (it == id_to_entry_.end()) {
187 ObjectRegistryEntry& entry = *it->second;
198 auto it local
207 auto it = id_to_entry_.find(id); local
215 auto it = id_to_entry_.find(id); local
245 auto it = id_to_entry_.find(id); local
259 auto it = id_to_entry_.find(id); 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);
/art/runtime/verifier/
H A Dregister_line.h92 // The register index was validated during the static pass, so we don't need to check it here.
94 // LockOp::kClear should be used by default; it will clear the lock levels associated with the
185 * The "this" argument to <init> uses code offset kUninitThisArgAddr, which puts it at the start
186 * of the list in slot 0. If we see a register with an uninitialized slot 0 reference, we know it
210 * caller can decide whether it needs the reference to be initialized or not. (Can also return
358 auto it = reg_to_lock_depths_.find(src); local
359 if (it != reg_to_lock_depths_.end()) {
360 reg_to_lock_depths_.Put(dst, it->second);
365 auto it = reg_to_lock_depths_.find(reg); local
366 if (it !
378 auto it = reg_to_lock_depths_.find(reg); local
390 auto it = reg_to_lock_depths_.find(reg); local
[all...]
/art/compiler/debug/
H A Delf_debug_line_writer.h90 // It would confuse the debugger and the DWARF specification forbids it.
127 // However, the debugger is more clever and it will ask us for line-number
134 // (the debugger would trust us that the PC is valid; it might try to set
191 auto it = directories_map.find(package_name); local
192 if (it == directories_map.end()) {
197 directory_index = it->second;
/art/compiler/
H A Doat_writer.cc185 // class_def_method_index. If 0, it means the corresponding
359 // The file is open for reading, not writing, so it's OK to let the File destructor
360 // close it without checking for explicit Close(), so pass checkUsage = false.
530 // Do a bulk checksum update for Dex[]. Doing it piece by piece would be
624 virtual bool VisitMethod(size_t class_def_method_index, const ClassDataItemIterator& it) = 0;
698 const ClassDataItemIterator& it) {
703 uint32_t method_idx = it.GetMemberIndex();
759 bool VisitMethod(size_t class_def_method_index, const ClassDataItemIterator& it)
764 if (it.GetMethodCodeItem() != nullptr) {
777 MethodReference method_ref(dex_file_, it
929 NewQuickCodeOffset(CompiledMethod* compiled_method, const ClassDataItemIterator& it, uint32_t thumb_offset) argument
[all...]
/art/dexdump/
H A Ddexdump_cfg.cc168 auto it = dex_pc_to_node_id.find(dex_pc); local
169 if (it != dex_pc_to_node_id.end()) {
189 last_node_id = it->second;
274 // Finish up the last block, if it had common exceptions.
302 auto it = handled_targets.find(handler_pc); local
303 if (it == handled_targets.end()) {
375 ClassDataItemIterator it(*dex_file, class_data);
377 while (it.HasNextStaticField() || it.HasNextInstanceField()) {
378 it
[all...]
/art/runtime/
H A Dcha.cc34 auto it = cha_dependency_map_.find(method); local
35 if (it == cha_dependency_map_.end()) {
38 it = cha_dependency_map_.find(method);
40 DCHECK(it->second != nullptr);
42 it->second->push_back(std::make_pair(dependent_method, dependent_header));
47 auto it = cha_dependency_map_.find(method); local
48 if (it != cha_dependency_map_.end()) {
49 DCHECK(it->second != nullptr);
50 return it->second;
56 auto it local
72 auto it = std::find(method_headers.begin(), method_headers.end(), method_header); local
123 auto it = std::find(method_headers_.begin(), method_headers_.end(), method_header); local
[all...]
H A Dclass_table.cc39 auto it = class_set.Find(slot); local
40 if (it != class_set.end()) {
41 return it->Read() == klass;
51 auto it = class_set.Find(slot); local
52 if (it != class_set.end()) {
53 return it->Read();
135 auto it = class_set.FindWithHash(pair, hash); local
136 if (it != class_set.end()) {
137 return it->Read();
147 auto it local
189 auto it = class_set.Find(pair); local
[all...]

Completed in 900 milliseconds

1234