/art/runtime/gc/collector/ |
D | immune_region.h | 57 end_ = end; in SetEnd() 66 return end_; in End() 75 size_ = reinterpret_cast<uintptr_t>(end_) - reinterpret_cast<uintptr_t>(begin_); in UpdateSize() 79 mirror::Object* end_; variable
|
D | mark_sweep.cc | 819 end_(end), in CardScanTask() 826 uint8_t* const end_; member in art::gc::collector::CardScanTask 838 ? card_table->Scan<true>(bitmap_, begin_, end_, visitor, minimum_age_) in Run() 839 : card_table->Scan<false>(bitmap_, begin_, end_, visitor, minimum_age_); in Run() 841 << reinterpret_cast<void*>(end_) << " = " << cards_scanned; in Run() 980 end_(end) {} in RecursiveMarkTask() 985 const uintptr_t end_; member in art::gc::collector::RecursiveMarkTask 994 bitmap_->VisitMarkedRange(begin_, end_, visitor); in Run()
|
D | immune_spaces_test.cc | 35 end_ = end; in DummyOatFile()
|
/art/runtime/ |
D | mapping_table.h | 69 table_(table), element_(element), end_(table_->DexToPcSize()), encoded_table_ptr_(nullptr), in DexToPcIterator() 72 if (end_ > 0) { in DexToPcIterator() 90 if (element_ != end_) { // Avoid reading beyond the end of the table. 108 const uint32_t end_; // Equal to table_->DexToPcSize(). variable 146 table_(table), element_(element), end_(table_->PcToDexSize()), encoded_table_ptr_(nullptr), in PcToDexIterator() 149 if (end_ > 0) { in PcToDexIterator() 167 if (element_ != end_) { // Avoid reading beyond the end of the table. 185 const uint32_t end_; // Equal to table_->PcToDexSize(). variable
|
D | oat_file.cc | 125 end_ = end; in SetEnd() 189 end_ = FindDynamicSymbolAddress("oatlastword", &symbol_error_msg); in ComputeFields() 190 if (end_ == nullptr) { in ComputeFields() 197 end_ += sizeof(uint32_t); in ComputeFields() 1039 end_(nullptr), in OatFile() 1061 CHECK(end_ != nullptr); in End() 1062 return end_; in End()
|
D | oat_file.h | 280 const uint8_t* end_; variable
|
/art/runtime/jdwp/ |
D | jdwp_request.cc | 30 end_ = bytes + byte_count_; in Request() 47 if (p_ < end_) { in CheckConsumed() 48 CHECK(p_ == end_) << "read too few bytes: " << (end_ - p_); in CheckConsumed() 49 } else if (p_ > end_) { in CheckConsumed() 50 CHECK(p_ == end_) << "read too many bytes: " << (p_ - end_); in CheckConsumed()
|
D | jdwp.h | 472 size_t size() { return end_ - p_; } in size() 493 const uint8_t* end_; variable
|
/art/cmdline/ |
D | token_range.h | 43 end_(token_list_->end()) in TokenRange() 51 end_(token_list_->end()) in TokenRange() 61 end_(token_list_->end()) { 71 end_(token_list_->end()) in TokenRange() 78 end_(token_list_->end()) in TokenRange() 87 end_(it_end) { in TokenRange() 102 end_(token_list_->end()) in TokenRange() 150 return end_; in end() 155 return std::distance(begin_, end_); in Size() 395 for (auto it = begin_; it != end_; ++it) { in RemoveIf() [all …]
|
/art/runtime/gc/space/ |
D | bump_pointer_space-inl.h | 48 uint8_t* end = end_.LoadRelaxed(); in AllocThreadUnsafe() 53 end_.StoreRelaxed(end + num_bytes); in AllocThreadUnsafe() 70 old_end = end_.LoadRelaxed(); in AllocNonvirtualWithoutAccounting() 76 } while (!end_.CompareExchangeWeakSequentiallyConsistent(old_end, new_end)); in AllocNonvirtualWithoutAccounting()
|
D | region_space.h | 237 begin_(nullptr), top_(nullptr), end_(nullptr), in Region() 243 : idx_(idx), begin_(begin), top_(begin), end_(end), in Region() 267 memset(begin_, 0, end_ - begin_); in Clear() 269 madvise(begin_, end_ - begin_, MADV_DONTNEED); in Clear() 445 return end_; in End() 449 return begin_ <= reinterpret_cast<uint8_t*>(ref) && reinterpret_cast<uint8_t*>(ref) < end_; in Contains() 457 DCHECK_EQ(top_, end_); in RecordThreadLocalAllocations() 460 DCHECK_EQ(top_, end_); in RecordThreadLocalAllocations() 468 uint8_t* end_; // The end address of the region. variable
|
D | space.h | 276 return end_.LoadRelaxed(); in End() 287 end_.StoreRelaxed(end); in SetEnd() 327 Space(name, gc_retention_policy), begin_(begin), end_(end), limit_(limit) { in ContinuousSpace() 334 Atomic<uint8_t*> end_; variable
|
D | large_object_space.cc | 113 total_objects_allocated_(0), begin_(begin), end_(end) { in LargeObjectSpace() 160 if (end_ == nullptr || obj_end > end_) { in Alloc() 161 end_ = obj_end; in Alloc() 385 const uintptr_t free_end_start = reinterpret_cast<uintptr_t>(end_) - free_end_; in Walk() 423 uintptr_t free_end_start = reinterpret_cast<uintptr_t>(end_) - free_end_; in Free() 541 uintptr_t free_end_start = reinterpret_cast<uintptr_t>(end_) - free_end_; in Dump() 571 uintptr_t free_end_start = reinterpret_cast<uintptr_t>(end_) - free_end_; in SetAllLargeObjectsAsZygoteObjects()
|
D | region_space-inl.h | 125 if (UNLIKELY(new_top > end_)) { in Alloc() 130 DCHECK_LE(atomic_top->LoadRelaxed(), end_); in Alloc() 131 DCHECK_LT(old_top, end_); in Alloc() 132 DCHECK_LE(new_top, end_); in Alloc()
|
D | large_object_space.h | 87 return end_; in End() 118 uint8_t* end_; variable
|
D | region_space.cc | 412 << "-" << reinterpret_cast<void*>(end_) in Dump()
|
/art/runtime/base/ |
D | arena_allocator.cc | 305 end_(nullptr), in ArenaAllocator() 325 if (UNLIKELY(rounded_bytes > static_cast<size_t>(end_ - ptr_))) { in AllocWithMemoryTool() 331 noaccess_end = end_; in AllocWithMemoryTool() 360 if (static_cast<size_t>(end_ - ptr_) > new_arena->Size() - bytes) { in AllocFromNewArena() 374 end_ = new_arena->End(); in AllocFromNewArena() 380 if (ptr >= begin_ && ptr < end_) { in Contains() 407 (arena_head_ == nullptr) ? 0 : (end_ - ptr_) - arena_head_->RemainingSpace(); in GetMemStats()
|
D | arena_allocator.h | 309 if (UNLIKELY(bytes > static_cast<size_t>(end_ - ptr_))) { 328 const size_t remain = end_ - ptr_; 375 uint8_t* end_; variable
|
/art/runtime/gc/accounting/ |
D | space_bitmap_test.cc | 46 end_(end) {} in BitmapVerify() 50 EXPECT_TRUE(obj <= end_); in operator ()() 56 const mirror::Object* end_; member in art::gc::accounting::BitmapVerify
|
/art/compiler/optimizing/ |
D | ssa_liveness_analysis.h | 60 LiveRange(size_t start, size_t end, LiveRange* next) : start_(start), end_(end), next_(next) { in LiveRange() 66 size_t GetEnd() const { return end_; } in GetEnd() 70 return (start_ >= other.start_ && start_ < other.end_) in IntersectsWith() 71 || (other.start_ >= start_ && other.start_ < end_); in IntersectsWith() 75 return end_ <= other.start_; in IsBefore() 79 stream << "[" << start_ << "," << end_ << ")"; in Dump() 84 start_, end_, next_ == nullptr ? nullptr : next_->Dup(allocator)); in Dup() 93 size_t end_; variable 290 first_range_->end_ = position; 382 first_range_->end_ = end; in AddLoopRange()
|
/art/compiler/driver/ |
D | compiler_driver.cc | 1929 end_(end), in ForAllClosure() 1935 if (UNLIKELY(index >= end_)) { in Run() 1949 const size_t end_; member in art::ParallelCompilationManager::ForAllClosure
|