| /art/runtime/gc/space/ |
| D | malloc_space.cc | 50 CHECK(IsAligned<kGcCardSize>(reinterpret_cast<uintptr_t>(mem_map->End()))); in MallocSpace()
132 uint8_t* original_end = End(); in MoreCore()
166 SetEnd(reinterpret_cast<uint8_t*>(RoundUp(reinterpret_cast<uintptr_t>(End()), kPageSize))); in CreateZygoteSpace()
168 DCHECK(IsAligned<accounting::CardTable::kCardSize>(End())); in CreateZygoteSpace()
170 DCHECK(IsAligned<kPageSize>(End())); in CreateZygoteSpace()
179 << "End " << reinterpret_cast<const void*>(End()) << "\n" in CreateZygoteSpace()
192 std::unique_ptr<MemMap> mem_map(GetMemMap()->RemapAtEnd(End(), alloc_space_name, in CreateZygoteSpace()
195 void* allocator = CreateAllocator(End(), starting_size_, initial_size_, capacity, in CreateZygoteSpace()
202 *out_malloc_space = CreateInstance(mem_map.release(), alloc_space_name, allocator, End(), end, in CreateZygoteSpace()
204 SetLimit(End()); in CreateZygoteSpace()
[all …]
|
| D | zygote_space.cc | 52 reinterpret_cast<uintptr_t>(mem_map->End()), visitor); in Create()
67 : ContinuousMemMapAllocSpace(name, mem_map, mem_map->Begin(), mem_map->End(), mem_map->End(), in ZygoteSpace()
75 << ",end=" << reinterpret_cast<void*>(End()) in Dump()
|
| D | region_space.cc | 48 : ContinuousMemMapAllocSpace(name, mem_map, mem_map->Begin(), mem_map->End(), mem_map->End(), in RegionSpace()
66 CHECK_EQ(static_cast<size_t>(regions_[i].End() - regions_[i].Begin()), kRegionSize); in RegionSpace()
68 CHECK_EQ(regions_[i].End(), regions_[i + 1].Begin()); in RegionSpace()
71 CHECK_EQ(regions_[num_regions_ - 1].End(), Limit()); in RegionSpace()
197 rb_table->Clear(r->Begin(), r->End()); in SetFromSpace()
234 if (current_region_->End() - current_region_->Top() > 0) { in LogFragmentationAllocFailure()
235 max_contiguous_allocation = current_region_->End() - current_region_->Top(); in LogFragmentationAllocFailure()
349 r->SetTop(r->End()); in AllocNewTlab()
352 self->SetTlab(r->Begin(), r->End()); in AllocNewTlab()
|
| D | bump_pointer_space.cc | 57 : ContinuousMemMapAllocSpace(name, mem_map, mem_map->Begin(), mem_map->Begin(), mem_map->End(), in BumpPointerSpace()
59 growth_end_(mem_map->End()), in BumpPointerSpace()
87 << reinterpret_cast<void*>(Begin()) << "-" << reinterpret_cast<void*>(End()) << " - " in Dump()
158 uint8_t* end = End(); in Walk()
196 CHECK_LE(reinterpret_cast<const uint8_t*>(end_obj), End()); in Walk()
268 size_t max_contiguous_allocation = Limit() - End(); in LogFragmentationAllocFailure()
|
| D | large_object_space.cc | 146 auto* obj_end = reinterpret_cast<mirror::Object*>(mem_map->End()); in Alloc()
230 callback(mem_map->Begin(), mem_map->End(), mem_map->Size(), arg); in Walk()
328 DCHECK_LT(info, reinterpret_cast<AllocationInfo*>(allocation_info_map_->End())); in GetSlotIndexForAllocationInfo()
355 return new FreeListSpace(name, mem_map, mem_map->Begin(), mem_map->End()); in Create()
407 << reinterpret_cast<void*>(End()); in Free()
502 new_info = GetAllocationInfoForAddress(reinterpret_cast<uintptr_t>(End()) - free_end_); in Alloc()
535 << " end: " << reinterpret_cast<void*>(End()) << "\n"; in Dump()
594 if (Begin() >= End()) { in Sweep()
605 reinterpret_cast<uintptr_t>(End()), SweepCallback, &scc); in Sweep()
|
| D | large_object_space.h | 86 uint8_t* End() const { in End() function
91 return End() - Begin(); in Size()
96 return Begin() <= byte_obj && byte_obj < End(); in Contains()
|
| D | bump_pointer_space.h | 116 return Begin() == End(); in IsEmpty()
125 return byte_obj >= Begin() && byte_obj < End(); in Contains()
|
| /art/runtime/ |
| D | oat_file.cc | 389 if (oat > End()) { in Setup()
395 if (oat > End()) { in Setup()
399 End()); in Setup()
413 if (UNLIKELY(oat > End())) { in Setup()
421 if (UNLIKELY(oat > End())) { in Setup()
433 if (UNLIKELY(oat > End())) { in Setup()
453 if (UNLIKELY(oat > End())) { in Setup()
477 if (UNLIKELY(oat > End())) { in Setup()
515 const uint8_t* OatFile::End() const { in End() function in art::OatFile
632 CHECK_LT(oat_class_pointer, oat_file_->End()) << oat_file_->GetLocation(); in GetOatClass()
[all …]
|
| D | mem_map.h | 120 uint8_t* End() const { in End() function
137 return Begin() <= addr && addr < End(); in HasAddress()
|
| D | elf_file_impl.h | 64 uint8_t* End() const { in End() function
65 return map_->End(); in End()
|
| D | elf_file.h | 59 uint8_t* End() const;
|
| /art/compiler/utils/ |
| D | swap_space.cc | 177 CHECK_LE(prev->End(), chunk.Start()); in Free()
178 if (prev->End() == chunk.Start()) { in Free()
189 CHECK_LE(chunk.End(), it->Start()); in Free()
190 if (chunk.End() == it->Start()) { in Free()
|
| /art/runtime/gc/accounting/ |
| D | atomic_stack.h | 167 StackReference<T>* End() const { in End() function
185 std::sort(Begin(), End(), ObjectComparator()); in Sort()
195 return std::binary_search(Begin(), End(), value, ObjectComparator()); in ContainsSorted()
199 for (auto cur = Begin(), end = End(); cur != end; ++cur) { in Contains()
|
| D | read_barrier_table.h | 74 p < reinterpret_cast<uint32_t*>(mem_map_->End()); ++p) { in IsAllCleared()
108 uint8_t* end = mem_map_->End(); in IsValidEntry()
|
| D | card_table.cc | 101 uint8_t* card_end = CardFromAddr(space->End()); // Make sure to round up. in ClearSpaceCards()
137 uint8_t* end = mem_map_->End(); in CheckAddrIsInCardTable()
|
| D | card_table-inl.h | 214 << " end: " << reinterpret_cast<void*>(mem_map_->End()); in AddrFromCard()
229 uint8_t* end = mem_map_->End(); in IsValidCard()
237 << " end: " << reinterpret_cast<void*>(mem_map_->End()); in CheckCardValid()
|
| D | mod_union_table.cc | 162 card_table->ModifyCardsAtomic(space_->Begin(), space_->End(), AgeCardVisitor(), visitor); in ClearCards()
399 card_table->ModifyCardsAtomic(space_->Begin(), space_->End(), AgeCardVisitor(), visitor); in ClearCards()
417 for (uint8_t* addr = space_->Begin(); addr < AlignUp(space_->End(), CardTable::kCardSize); in Dump()
429 for (uint8_t* addr = space_->Begin(); addr < AlignUp(space_->End(), CardTable::kCardSize); in SetCards()
440 for (uint8_t* addr = space_->Begin(); addr < AlignUp(space_->End(), CardTable::kCardSize); in SetCards()
|
| /art/compiler/dex/ |
| D | bb_optimizations.h | 137 void End(PassDataHolder* data) const { in End() function
192 void End(PassDataHolder* data) const { in End() function
223 void End(PassDataHolder* data) const { in End() function
258 void End(PassDataHolder* data) const OVERRIDE { in End() function
292 void End(PassDataHolder* data) const OVERRIDE { in End() function
413 void End(PassDataHolder* data) const { in End() function
|
| D | pass.h | 75 virtual void End(PassDataHolder* data) const { in End() function
|
| D | post_opt_passes.h | 139 void End(PassDataHolder* data) const { in End() function
291 void End(PassDataHolder* data) const { in End() function
308 void End(PassDataHolder* data) const { in End() function
|
| /art/test/701-easy-div-rem/ |
| D | expected.txt | 8 End
|
| /art/runtime/base/ |
| D | scoped_arena_allocator.cc | 70 top_end_ = top_arena_->End(); in AllocateFromNextArena()
142 mark_end_ = arena_stack_->top_end_ = mark_arena_->End(); in DoReset()
|
| /art/runtime/gc/collector/ |
| D | mark_compact.cc | 125 reinterpret_cast<uintptr_t>(space_->End()), in CalculateObjectForwardingAddresses()
275 std::vector<StackReference<Object>> temp(mark_stack_->Begin(), mark_stack_->End()); in ResizeMarkStack()
398 reinterpret_cast<uintptr_t>(space->End()), in UpdateReferences()
410 reinterpret_cast<uintptr_t>(space_->End()), in UpdateReferences()
423 int64_t bytes_freed = reinterpret_cast<int64_t>(space_->End()) - in Compact()
562 reinterpret_cast<uintptr_t>(space_->End()), in MoveObjects()
|
| D | immune_region.h | 63 mirror::Object* End() { in End() function
|
| /art/runtime/gc/allocator/ |
| D | rosalloc.cc | 164 … if (it != free_page_runs_.rend() && (last_free_page_run = *it)->End(this) == base_ + footprint_) { in AllocPages()
192 DCHECK_EQ(last_free_page_run->End(this), base_ + new_footprint); in AllocPages()
356 << std::hex << reinterpret_cast<uintptr_t>(fpr->End(this)) << " [" << std::dec in FreePages()
357 … << (fpr->End(this) == End() ? page_map_size_ : ToPageMapIndex(fpr->End(this))) << "]"; in FreePages()
367 << std::hex << reinterpret_cast<uintptr_t>(h->End(this)) << " [" << std::dec in FreePages()
368 … << (h->End(this) == End() ? page_map_size_ : ToPageMapIndex(h->End(this))) << "]"; in FreePages()
370 if (fpr->End(this) == h->Begin()) { in FreePages()
409 << std::hex << reinterpret_cast<uintptr_t>(l->End(this)) << " [" << std::dec in FreePages()
410 … << (l->End(this) == End() ? page_map_size_ : ToPageMapIndex(l->End(this))) << "]"; in FreePages()
412 if (l->End(this) == fpr->Begin()) { in FreePages()
[all …]
|