bump_pointer_space.cc revision 31f441464c0c8f840aba37e236ad133f30308d70
1590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier/* 2590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier * Copyright (C) 2013 The Android Open Source Project 3590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier * 4590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier * Licensed under the Apache License, Version 2.0 (the "License"); 5590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier * you may not use this file except in compliance with the License. 6590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier * You may obtain a copy of the License at 7590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier * 8590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier * http://www.apache.org/licenses/LICENSE-2.0 9590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier * 10590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier * Unless required by applicable law or agreed to in writing, software 11590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier * distributed under the License is distributed on an "AS IS" BASIS, 12590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier * See the License for the specific language governing permissions and 14590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier * limitations under the License. 15590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier */ 16590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier 17590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier#include "bump_pointer_space.h" 18590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier#include "bump_pointer_space-inl.h" 19590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier#include "mirror/object-inl.h" 20590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier#include "mirror/class-inl.h" 21692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier#include "thread_list.h" 22590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier 23590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartiernamespace art { 24590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartiernamespace gc { 25590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartiernamespace space { 26590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier 27590fee9e8972f872301c2d16a575d579ee564beeMathieu ChartierBumpPointerSpace* BumpPointerSpace::Create(const std::string& name, size_t capacity, 28590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier byte* requested_begin) { 29590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier capacity = RoundUp(capacity, kPageSize); 30590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier std::string error_msg; 31590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier UniquePtr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), requested_begin, capacity, 32ef7d42fca18c16fbaf103822ad16f23246e2905dIan Rogers PROT_READ | PROT_WRITE, true, &error_msg)); 33590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier if (mem_map.get() == nullptr) { 34590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier LOG(ERROR) << "Failed to allocate pages for alloc space (" << name << ") of size " 35590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier << PrettySize(capacity) << " with message " << error_msg; 36590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier return nullptr; 37590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier } 38590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier return new BumpPointerSpace(name, mem_map.release()); 39590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier} 40590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier 4131f441464c0c8f840aba37e236ad133f30308d70Mathieu ChartierBumpPointerSpace* BumpPointerSpace::CreateFromMemMap(const std::string& name, MemMap* mem_map) { 4231f441464c0c8f840aba37e236ad133f30308d70Mathieu Chartier return new BumpPointerSpace(name, mem_map); 4331f441464c0c8f840aba37e236ad133f30308d70Mathieu Chartier} 4431f441464c0c8f840aba37e236ad133f30308d70Mathieu Chartier 45590fee9e8972f872301c2d16a575d579ee564beeMathieu ChartierBumpPointerSpace::BumpPointerSpace(const std::string& name, byte* begin, byte* limit) 46590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier : ContinuousMemMapAllocSpace(name, nullptr, begin, begin, limit, 47590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier kGcRetentionPolicyAlwaysCollect), 48692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier growth_end_(limit), 49692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier objects_allocated_(0), bytes_allocated_(0), 50692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier block_lock_("Block lock"), 51fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier main_block_size_(0), 52692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier num_blocks_(0) { 53590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier} 54590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier 55590fee9e8972f872301c2d16a575d579ee564beeMathieu ChartierBumpPointerSpace::BumpPointerSpace(const std::string& name, MemMap* mem_map) 56590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier : ContinuousMemMapAllocSpace(name, mem_map, mem_map->Begin(), mem_map->Begin(), mem_map->End(), 57590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier kGcRetentionPolicyAlwaysCollect), 58692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier growth_end_(mem_map->End()), 59692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier objects_allocated_(0), bytes_allocated_(0), 60692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier block_lock_("Block lock"), 61fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier main_block_size_(0), 62692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier num_blocks_(0) { 63590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier} 64590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier 65590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartiervoid BumpPointerSpace::Clear() { 66590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier // Release the pages back to the operating system. 67590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier CHECK_NE(madvise(Begin(), Limit() - Begin(), MADV_DONTNEED), -1) << "madvise failed"; 68590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier // Reset the end of the space back to the beginning, we move the end forward as we allocate 69590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier // objects. 70fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier SetEnd(Begin()); 71692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier objects_allocated_ = 0; 72692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier bytes_allocated_ = 0; 73590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier growth_end_ = Limit(); 74692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier { 75692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier MutexLock mu(Thread::Current(), block_lock_); 76692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier num_blocks_ = 0; 77fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier main_block_size_ = 0; 78692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier } 79590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier} 80590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier 81590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartiervoid BumpPointerSpace::Dump(std::ostream& os) const { 8215d3402bbf8265eb1165694da2e4117eb128f3bcMathieu Chartier os << GetName() << " " 8315d3402bbf8265eb1165694da2e4117eb128f3bcMathieu Chartier << reinterpret_cast<void*>(Begin()) << "-" << reinterpret_cast<void*>(End()) << " - " 8415d3402bbf8265eb1165694da2e4117eb128f3bcMathieu Chartier << reinterpret_cast<void*>(Limit()); 85590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier} 86590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier 87590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartiermirror::Object* BumpPointerSpace::GetNextObject(mirror::Object* obj) { 88590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier const uintptr_t position = reinterpret_cast<uintptr_t>(obj) + obj->SizeOf(); 89590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier return reinterpret_cast<mirror::Object*>(RoundUp(position, kAlignment)); 90590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier} 91590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier 92692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartiervoid BumpPointerSpace::RevokeThreadLocalBuffers(Thread* thread) { 93692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier MutexLock mu(Thread::Current(), block_lock_); 94692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier RevokeThreadLocalBuffersLocked(thread); 95692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier} 96692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier 97692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartiervoid BumpPointerSpace::RevokeAllThreadLocalBuffers() { 98692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier Thread* self = Thread::Current(); 99692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier MutexLock mu(self, *Locks::runtime_shutdown_lock_); 100692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier MutexLock mu2(self, *Locks::thread_list_lock_); 101692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier // TODO: Not do a copy of the thread list? 102692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier std::list<Thread*> thread_list = Runtime::Current()->GetThreadList()->GetList(); 103692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier for (Thread* thread : thread_list) { 104692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier RevokeThreadLocalBuffers(thread); 105692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier } 106692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier} 107692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier 108c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchivoid BumpPointerSpace::AssertThreadLocalBuffersAreRevoked(Thread* thread) { 109c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi if (kIsDebugBuild) { 110c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi MutexLock mu(Thread::Current(), block_lock_); 111c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi DCHECK(!thread->HasTlab()); 112c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi } 113c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi} 114c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi 115c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchivoid BumpPointerSpace::AssertAllThreadLocalBuffersAreRevoked() { 116c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi if (kIsDebugBuild) { 117c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi Thread* self = Thread::Current(); 118c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi MutexLock mu(self, *Locks::runtime_shutdown_lock_); 119c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi MutexLock mu2(self, *Locks::thread_list_lock_); 120c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi // TODO: Not do a copy of the thread list? 121c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi std::list<Thread*> thread_list = Runtime::Current()->GetThreadList()->GetList(); 122c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi for (Thread* thread : thread_list) { 123c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi AssertThreadLocalBuffersAreRevoked(thread); 124c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi } 125c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi } 126c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi} 127c93c530efc175954160c3834c93961a1a946a35aHiroshi Yamauchi 128692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartiervoid BumpPointerSpace::UpdateMainBlock() { 129692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier DCHECK_EQ(num_blocks_, 0U); 130fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier main_block_size_ = Size(); 131692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier} 132692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier 133692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier// Returns the start of the storage. 134692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartierbyte* BumpPointerSpace::AllocBlock(size_t bytes) { 135692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier bytes = RoundUp(bytes, kAlignment); 136692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier if (!num_blocks_) { 137692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier UpdateMainBlock(); 138692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier } 139692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier byte* storage = reinterpret_cast<byte*>( 140692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier AllocNonvirtualWithoutAccounting(bytes + sizeof(BlockHeader))); 141692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier if (LIKELY(storage != nullptr)) { 142692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier BlockHeader* header = reinterpret_cast<BlockHeader*>(storage); 143692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier header->size_ = bytes; // Write out the block header. 144692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier storage += sizeof(BlockHeader); 145692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier ++num_blocks_; 146692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier } 147692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier return storage; 148692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier} 149692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier 15083c8ee000d525017ead8753fce6bc1020249b96aMathieu Chartiervoid BumpPointerSpace::Walk(ObjectCallback* callback, void* arg) { 151692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier byte* pos = Begin(); 1528544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier byte* end = End(); 153fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier byte* main_end = pos; 154692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier { 155692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier MutexLock mu(Thread::Current(), block_lock_); 156692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier // If we have 0 blocks then we need to update the main header since we have bump pointer style 157692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier // allocation into an unbounded region (actually bounded by Capacity()). 158692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier if (num_blocks_ == 0) { 159692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier UpdateMainBlock(); 160692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier } 1618544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier main_end = Begin() + main_block_size_; 1628544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier if (num_blocks_ == 0) { 1638544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier // We don't have any other blocks, this means someone else may be allocating into the main 1648544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier // block. In this case, we don't want to try and visit the other blocks after the main block 1658544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier // since these could actually be part of the main block. 1668544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier end = main_end; 1678544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier } 168692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier } 169fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier // Walk all of the objects in the main block first. 170fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier while (pos < main_end) { 171fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier mirror::Object* obj = reinterpret_cast<mirror::Object*>(pos); 1728544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier if (obj->GetClass() == nullptr) { 1738544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier // There is a race condition where a thread has just allocated an object but not set the 1748544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier // class. We can't know the size of this object, so we don't visit it and exit the function 1758544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier // since there is guaranteed to be not other blocks. 1768544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier return; 1778544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier } else { 1788544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier callback(obj, arg); 1798544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier pos = reinterpret_cast<byte*>(GetNextObject(obj)); 1808544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier } 181fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier } 182fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier // Walk the other blocks (currently only TLABs). 1838544b462b524a502d2a18efb5a790ef98fa5eb51Mathieu Chartier while (pos < end) { 184692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier BlockHeader* header = reinterpret_cast<BlockHeader*>(pos); 185692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier size_t block_size = header->size_; 186692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier pos += sizeof(BlockHeader); // Skip the header so that we know where the objects 187692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier mirror::Object* obj = reinterpret_cast<mirror::Object*>(pos); 188692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier const mirror::Object* end = reinterpret_cast<const mirror::Object*>(pos + block_size); 189692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier CHECK_LE(reinterpret_cast<const byte*>(end), End()); 190692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier // We don't know how many objects are allocated in the current block. When we hit a null class 191692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier // assume its the end. TODO: Have a thread update the header when it flushes the block? 192692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier while (obj < end && obj->GetClass() != nullptr) { 193692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier callback(obj, arg); 194692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier obj = GetNextObject(obj); 195692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier } 196692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier pos += block_size; 197692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier } 198692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier} 199692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier 2006fac447555dc94a935b78198479cce645c837b89Ian Rogersaccounting::SpaceBitmap::SweepCallback* BumpPointerSpace::GetSweepCallback() { 2016fac447555dc94a935b78198479cce645c837b89Ian Rogers LOG(FATAL) << "Unimplemented"; 2026fac447555dc94a935b78198479cce645c837b89Ian Rogers return nullptr; 203692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier} 204692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier 205692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartieruint64_t BumpPointerSpace::GetBytesAllocated() { 206692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier // Start out pre-determined amount (blocks which are not being allocated into). 207b122a4bbed34ab22b4c1541ee25e5cf22f12a926Ian Rogers uint64_t total = static_cast<uint64_t>(bytes_allocated_.Load()); 208692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier Thread* self = Thread::Current(); 209692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier MutexLock mu(self, *Locks::runtime_shutdown_lock_); 210692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier MutexLock mu2(self, *Locks::thread_list_lock_); 211692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier std::list<Thread*> thread_list = Runtime::Current()->GetThreadList()->GetList(); 212692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier MutexLock mu3(Thread::Current(), block_lock_); 213692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier // If we don't have any blocks, we don't have any thread local buffers. This check is required 214692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier // since there can exist multiple bump pointer spaces which exist at the same time. 215692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier if (num_blocks_ > 0) { 216692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier for (Thread* thread : thread_list) { 217dd7624d2b9e599d57762d12031b10b89defc9807Ian Rogers total += thread->GetThreadLocalBytesAllocated(); 218692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier } 219692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier } 220692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier return total; 221692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier} 222692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier 223692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartieruint64_t BumpPointerSpace::GetObjectsAllocated() { 224692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier // Start out pre-determined amount (blocks which are not being allocated into). 225b122a4bbed34ab22b4c1541ee25e5cf22f12a926Ian Rogers uint64_t total = static_cast<uint64_t>(objects_allocated_.Load()); 226692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier Thread* self = Thread::Current(); 227692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier MutexLock mu(self, *Locks::runtime_shutdown_lock_); 228692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier MutexLock mu2(self, *Locks::thread_list_lock_); 229692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier std::list<Thread*> thread_list = Runtime::Current()->GetThreadList()->GetList(); 230692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier MutexLock mu3(Thread::Current(), block_lock_); 231692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier // If we don't have any blocks, we don't have any thread local buffers. This check is required 232692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier // since there can exist multiple bump pointer spaces which exist at the same time. 233692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier if (num_blocks_ > 0) { 234692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier for (Thread* thread : thread_list) { 235dd7624d2b9e599d57762d12031b10b89defc9807Ian Rogers total += thread->GetThreadLocalObjectsAllocated(); 236692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier } 237692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier } 238692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier return total; 239692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier} 240692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier 241692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartiervoid BumpPointerSpace::RevokeThreadLocalBuffersLocked(Thread* thread) { 242dd7624d2b9e599d57762d12031b10b89defc9807Ian Rogers objects_allocated_.FetchAndAdd(thread->GetThreadLocalObjectsAllocated()); 243dd7624d2b9e599d57762d12031b10b89defc9807Ian Rogers bytes_allocated_.FetchAndAdd(thread->GetThreadLocalBytesAllocated()); 244e6da9af8dfe0a3e3fbc2be700554f6478380e7b9Mathieu Chartier thread->SetTlab(nullptr, nullptr); 245692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier} 246692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier 247e6da9af8dfe0a3e3fbc2be700554f6478380e7b9Mathieu Chartierbool BumpPointerSpace::AllocNewTlab(Thread* self, size_t bytes) { 248692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier MutexLock mu(Thread::Current(), block_lock_); 249692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier RevokeThreadLocalBuffersLocked(self); 250692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier byte* start = AllocBlock(bytes); 251692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier if (start == nullptr) { 252692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier return false; 253692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier } 254e6da9af8dfe0a3e3fbc2be700554f6478380e7b9Mathieu Chartier self->SetTlab(start, start + bytes); 255692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier return true; 256692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier} 257692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier 258590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier} // namespace space 259590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier} // namespace gc 260590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier} // namespace art 261