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

1234

/art/runtime/interpreter/
H A Dlock_count_data.cc53 auto it = std::find(monitors_->begin(), monitors_->end(), obj); local
54 if (it != monitors_->end()) {
55 monitors_->erase(it);
82 // There may be an exception pending, if the method is terminating abruptly. Clear it.
/art/dex2oat/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.h51 // GetOffset() and an error indication in WriteThunks(). Additionally, it must be
52 // page-aligned, so that it does not skew alignment calculations, say arm64 ADRP.
57 auto it = method_offset_map_.map.find(method_ref); local
58 return (it != method_offset_map_.map.end()) ? it->second - adjustment_ : 0u;
/art/openjdkjvmti/
H A Dtransform.cc11 * 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
105 // lock/unlock (which it wasn't) on all architectures we care about.
107 auto it = std::find_if(uninitialized_class_definitions_.begin(), variable
110 if (it != uninitialized_class_definitions_.end()) {
111 res = *it;
113 uninitialized_class_definitions_.erase(it);
114 // Put it in the initializing list
117 // Wait for the ptr to be initialized (if it i
155 auto it = std::find(uninitialized_class_definitions_.begin(), variable
[all...]
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
147 auto it = tagged_objects_.find(art::GcRoot<art::mirror::Object>(obj)); local
148 if (it != tagged_objects_.end()) {
149 *result = it->second;
H A Dti_breakpoint.cc11 * 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
76 auto it = env->breakpoints.find(b); local
77 DCHECK(it != env->breakpoints.end());
78 env->breakpoints.erase(it);
107 // Didn't get inserted because it's already present!
/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/runtime/
H A Dindex_bss_mapping.cc59 auto it = std::partition_point( local
65 if (it == mapping->end()) {
68 const IndexBssMappingEntry& entry = *it;
/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/profman/
H A Dboot_image_profile.cc83 ClassDataItemIterator it(*dex_file, class_data);
84 while (it.HasNextStaticField()) {
85 const uint32_t flags = it.GetFieldAccessFlags();
91 it.Next();
93 it.SkipInstanceFields();
94 while (it.HasNextMethod()) {
95 const uint32_t flags = it.GetMethodAccessFlags();
106 it.Next();
113 auto it = inferred_classes.find(std::make_pair(profile.get(), ref.TypeIndex())); local
114 if (it !
[all...]
/art/compiler/dex/
H A Dverification_results.cc70 auto it = verified_methods_.find(ref); local
71 inserted = it == verified_methods_.end();
76 existing = it->second;
84 // TODO: Investigate why are we doing the work again for this method and try to avoid it.
95 // registered. It is unsafe to replace the existing one since the JIT may be using it to
106 auto it = verified_methods_.find(ref); local
107 return (it != verified_methods_.end()) ? it->second : nullptr;
156 for (auto it = verified_methods_.begin(); it !
[all...]
/art/compiler/utils/
H A Datomic_dex_ref_map-inl.h34 // TODO: Use specialization for this? Not sure if worth it.
106 auto it = arrays_.find(dex_file); local
107 return (it != arrays_.end()) ? &it->second : nullptr;
113 auto it = arrays_.find(dex_file); local
114 return (it != arrays_.end()) ? &it->second : nullptr;
130 for (auto& it : arrays_) {
131 for (auto& element : it.second) {
H A Dswap_space.cc114 auto it = free_by_start_.empty() local
117 if (it != free_by_size_.end()) {
118 auto entry = it->free_by_start_entry;
121 RemoveChunk(it);
128 it->free_by_start_entry->ptr += size;
129 it->free_by_start_entry->size -= size;
134 if (it == free_by_size_.begin()) {
135 it->size -= size;
137 auto prev = it;
141 it
200 auto it = free_by_start_.lower_bound(chunk); local
[all...]
H A Ddedupe_set-inl.h74 auto it = keys_.Find(hashed_in_key); variable
75 if (it != keys_.end()) {
76 DCHECK(it->Key() != nullptr);
77 return it->Key();
95 auto it = stats.find(key.Hash()); variable
96 if (it == stats.end()) {
99 ++it->second;
/art/libartbase/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.h34 // For hash_[multi]set, it is important that this deletes behind the iterator
35 // because the hash_set may call the hash function on the iterator when it is
68 // in the case it's given a null pointer.
94 auto it = std::find(container.begin(), container.end(), value); local
95 DCHECK(it != container.end()); // Must exist.
96 return std::distance(container.begin(), it);
102 auto it = std::find(container.begin(), container.end(), value); local
103 DCHECK(it != container.end()); // Must exist.
104 container.erase(it);
110 auto it local
121 auto it = std::find(start, container.end(), value); local
[all...]
H A Dstride_iterator.h123 const StrideIterator<T>& it) {
124 return it + dist;
122 operator +(typename StrideIterator<T>::difference_type dist, const StrideIterator<T>& it) argument
/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/verifier/
H A Dregister_line-inl.h35 // The register index was validated during the static pass, so we don't need to check it here.
170 // precise than the subtype in vsrc so leave it for reference types. For primitive types
208 auto it = reg_to_lock_depths_.find(reg); local
209 DCHECK(it != reg_to_lock_depths_.end());
210 uint32_t depths = it->second ^ (1 << depth);
212 it->second = depths;
214 reg_to_lock_depths_.erase(it);
H A Dregister_line.h94 // The register index was validated during the static pass, so we don't need to check it here.
96 // LockOp::kClear should be used by default; it will clear the lock levels associated with the
187 * The "this" argument to <init> uses code offset kUninitThisArgAddr, which puts it at the start
188 * of the list in slot 0. If we see a register with an uninitialized slot 0 reference, we know it
212 * caller can decide whether it needs the reference to be initialized or not. (Can also return
377 auto it = reg_to_lock_depths_.find(src); local
378 if (it != reg_to_lock_depths_.end()) {
379 reg_to_lock_depths_.Put(dst, it->second);
384 auto it = reg_to_lock_depths_.find(reg); local
385 if (it !
397 auto it = reg_to_lock_depths_.find(reg); local
[all...]
/art/compiler/debug/
H A Delf_debug_line_writer.h91 // It would confuse the debugger and the DWARF specification forbids it.
128 // However, the debugger is more clever and it will ask us for line-number
135 // (the debugger would trust us that the PC is valid; it might try to set
194 auto it = directories_map.find(package_name); local
195 if (it == directories_map.end()) {
200 directory_index = it->second;
/art/compiler/linker/
H A Drelative_patcher_test.h256 auto it = map.find(ref); variable
257 if (it == map.end()) {
260 return std::pair<bool, uint32_t>(true, it->second);

Completed in 6264 milliseconds

1234