| /art/libartbase/base/ |
| D | memory_type_table.h | 45 uintptr_t Limit() const { in Limit() function
50 uintptr_t Size() const { return Limit() - Start(); } in Size()
57 return address >= Start() && address < Limit(); in Contains()
61 bool disjoint = Limit() <= other.Start() || Start() >= other.Limit(); in Overlaps()
66 return other.Start() == Limit() || other.Limit() == Start(); in Adjoins()
103 } else if (address >= ranges_[m].Limit()) { in Lookup()
167 return (lhs.Start() == rhs.Start() && lhs.Limit() == rhs.Limit() && lhs.Type() == rhs.Type());
179 << reinterpret_cast<void*>(range.Limit())
200 succ = ranges_.lower_bound(range.Limit()); in Add()
216 DCHECK_GE(succ->second.Limit(), range.Start()); in Add()
[all …]
|
| D | memory_type_table_test.cc | 28 EXPECT_EQ(r.Limit(), 0x2000u); in TEST()
46 MemoryTypeRange<int> b(a.Limit(), a.Limit() + a.Size(), kMemoryType); in TEST()
53 MemoryTypeRange<int> c(a.Limit() + a.Size(), a.Limit() + 2 * a.Size(), kMemoryType); in TEST()
61 MemoryTypeRange<int> d(a.Start() + a.Size() / 4, a.Limit() - a.Size() / 4, kMemoryType); in TEST()
77 MemoryTypeRange<int> f(a.Start() + a.Size() / 2, a.Limit(), kMemoryType); in TEST()
85 MemoryTypeRange<int> g(a.Start() + a.Size() / 2, a.Limit() + a.Size() / 2, kMemoryType); in TEST()
97 MemoryTypeRange<int> b(a.Limit(), a.Limit() + a.Size(), kMemoryType); in TEST()
104 MemoryTypeRange<int> c(a.Limit() + a.Size(), a.Limit() + 2 * a.Size(), kMemoryType); in TEST()
112 MemoryTypeRange<int> d(a.Start() + a.Size() / 2, a.Limit() + a.Size() / 2, kMemoryType); in TEST()
155 MemoryTypeRange<int> b(a.Start(), a.Limit(), a.Type()); in TEST()
[all …]
|
| /art/runtime/gc/collector/ |
| D | immune_spaces_test.cc | 172 DummySpace b(a.Limit(), a.Limit() + 813 * KB); in TEST_F()
181 EXPECT_EQ(reinterpret_cast<uint8_t*>(spaces.GetLargestImmuneRegion().End()), b.Limit()); in TEST_F()
226 image_space->Limit()); in TEST_F()
228 EXPECT_NE(image_space->Limit(), space.Begin()); in TEST_F()
240 EXPECT_EQ(reinterpret_cast<uint8_t*>(spaces.GetLargestImmuneRegion().End()), space.Limit()); in TEST_F()
308 space2->Limit()); in TEST_F()
319 space3->Limit()); in TEST_F()
360 space3->Limit()); in TEST_F()
397 EXPECT_EQ(reinterpret_cast<uint8_t*>(spaces.GetLargestImmuneRegion().End()), space5->Limit()); in TEST_F()
|
| D | immune_spaces.cc | 47 uintptr_t space_end = reinterpret_cast<uintptr_t>(space->Limit()); in CreateLargestImmuneRegion()
|
| D | concurrent_copying.cc | 305 region_space_->Limit() - region_space_->Begin())); in CreateInterRegionRefBitmaps()
313 heap_->non_moving_space_->Limit() - heap_->non_moving_space_->Begin())); in CreateInterRegionRefBitmaps()
352 heap_->GetCardTable()->ClearCardRange(space->Begin(), space->Limit()); in BindBitmaps()
378 << reinterpret_cast<void*>(region_space_->Limit()); in InitializePhase()
645 reinterpret_cast<uintptr_t>(space->Limit()), in VerifyGrayImmuneObjects()
1340 space->Limit(), in MarkingPhase()
1512 space->Limit(), in CopyingPhase()
2546 DCHECK(IsAligned<kPageSize>(region_space_->Limit())); in CaptureRssAtPeak()
2547 gc_ranges.emplace_back(range_t(region_space_->Begin(), region_space_->Limit())); in CaptureRssAtPeak()
2553 DCHECK(IsAligned<kPageSize>(heap_->non_moving_space_->Limit())); in CaptureRssAtPeak()
[all …]
|
| /art/runtime/gc/space/ |
| D | bump_pointer_space.cc | 78 memset(Begin(), 0, Limit() - Begin()); in Clear()
80 CHECK_NE(madvise(Begin(), Limit() - Begin(), MADV_DONTNEED), -1) << "madvise failed"; in Clear()
86 growth_end_ = Limit(); in Clear()
97 << reinterpret_cast<void*>(Limit()); in Dump()
225 size_t max_contiguous_allocation = Limit() - End(); in LogFragmentationAllocFailure()
|
| D | space.h | 279 uint8_t* Limit() const { in Limit() function
303 return Limit() - Begin(); in Capacity()
310 return byte_ptr >= Begin() && byte_ptr < Limit(); in HasAddress()
|
| D | region_space.cc | 139 CHECK_EQ(regions_[num_regions_ - 1].End(), Limit()); in RegionSpace()
320 if (kIsDebugBuild && end_addr < Limit()) { in ZeroLiveBytesForLargeObject()
796 SetEnd(Limit()); in ClampGrowthLimit()
804 << reinterpret_cast<void*>(Begin()) << "-" << reinterpret_cast<void*>(Limit()); in Dump()
|
| D | bump_pointer_space.h | 86 growth_end_ = Limit(); in ClearGrowthLimit()
|
| D | malloc_space.cc | 252 << ",limit=" << reinterpret_cast<void*>(Limit()) in Dump()
|
| D | region_space-inl.h | 487 if (kIsDebugBuild && end_addr < Limit()) { in FreeLarge()
|
| D | region_space.h | 199 return byte_obj >= Begin() && byte_obj < Limit(); in Contains()
|
| /art/test/530-checker-peel-unroll/smali/ |
| D | PeelUnroll.smali | 25 ## CHECK-DAG: <<Limit:i\d+>> IntConstant 4094 loop:none
29 ## CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop>> outer_…
47 ## CHECK-DAG: <<Limit:i\d+>> IntConstant 4094 loop:none
51 ## CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop>> outer_…
61 ## CHECK-DAG: <<CheckA:z\d+>> GreaterThanOrEqual [<<AddI>>,<<Limit>>] loop:<<Loop>> outer_…
131 ## CHECK-DAG: <<Limit:i\d+>> IntConstant 4094 loop:none
135 ## CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop>> outer_…
153 ## CHECK-DAG: <<Limit:i\d+>> IntConstant 4094 loop:none
157 ## CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop>> outer_…
167 ## CHECK-DAG: <<CheckA:z\d+>> GreaterThanOrEqual [<<AddI>>,<<Limit>>] loop:<<Loop>> outer_…
|
| /art/ |
| D | CPPLINT.cfg | 23 # Limit line length.
|
| /art/runtime/gc/accounting/ |
| D | read_barrier_table.h | 52 uint8_t* entry_end = EntryFromAddr(space->Limit()); in ClearForSpace()
|
| D | remembered_set.cc | 181 DCHECK_LE(end, space_->Limit()); in AssertAllDirtyCardsAreWithinSpace()
|
| D | mod_union_table.cc | 488 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(space->Limit()), CardTable::kCardSize); in ModUnionTableCardCache()
492 RoundUp(reinterpret_cast<uintptr_t>(space->Limit()), CardTable::kCardSize))); in ModUnionTableCardCache()
|
| /art/runtime/gc/ |
| D | heap.cc | 578 uint8_t* heap_end = continuous_spaces_.back()->Limit(); in Heap()
2466 non_moving_space_->Limit()); in PreZygoteFork()
2514 non_moving_space_->SetLimit(target_space.Limit()); in PreZygoteFork()
2554 reinterpret_cast<uintptr_t>(zygote_space_->Limit()), in PreZygoteFork()
|
| /art/dex2oat/linker/ |
| D | image_writer.cc | 2379 reinterpret_cast<uintptr_t>(space->Limit()), in CalculateNewObjectOffsets()
|