Home
last modified time | relevance | path

Searched refs:new_index (Results 1 – 3 of 3) sorted by relevance

/art/runtime/gc/accounting/
Datomic_stack.h104 int32_t new_index; in AtomicBumpBack() local
107 new_index = index + num_slots; in AtomicBumpBack()
108 if (UNLIKELY(static_cast<size_t>(new_index) >= growth_limit_)) { in AtomicBumpBack()
112 } while (!back_index_.CompareAndSetWeakRelaxed(index, new_index)); in AtomicBumpBack()
114 *end_address = begin_ + new_index; in AtomicBumpBack()
117 for (int32_t i = index; i < new_index; ++i) { in AtomicBumpBack()
119 << "i=" << i << " index=" << index << " new_index=" << new_index; in AtomicBumpBack()
144 const int32_t new_index = index + num_slots; in BumpBack() local
145 if (UNLIKELY(static_cast<size_t>(new_index) >= growth_limit_)) { in BumpBack()
149 back_index_.store(new_index, std::memory_order_relaxed); in BumpBack()
[all …]
/art/runtime/mirror/
Ddex_cache.cc239 uint32_t new_index = current_method.GetDexMethodIndex(); in SetResolvedType() local
240 if (new_index != previous_method_index) { in SetResolvedType()
241 resolved_methods->Set(new_index, &current_method); in SetResolvedType()
242 previous_method_index = new_index; in SetResolvedType()
/art/compiler/optimizing/
Dgvn.cc176 size_t new_index = BucketIndex(node->GetHashCode()); in PopulateFromInternal() local
177 buckets_[new_index] = node->Dup(allocator_, buckets_[new_index]); in PopulateFromInternal()