bump_pointer_space.cc revision fc4c27e4d68707271bd7578ae5c8bef93a3ea66b
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
41590fee9e8972f872301c2d16a575d579ee564beeMathieu ChartierBumpPointerSpace::BumpPointerSpace(const std::string& name, byte* begin, byte* limit)
42590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier    : ContinuousMemMapAllocSpace(name, nullptr, begin, begin, limit,
43590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier                                 kGcRetentionPolicyAlwaysCollect),
44692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      growth_end_(limit),
45692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      objects_allocated_(0), bytes_allocated_(0),
46692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      block_lock_("Block lock"),
47fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier      main_block_size_(0),
48692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      num_blocks_(0) {
49590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier}
50590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier
51590fee9e8972f872301c2d16a575d579ee564beeMathieu ChartierBumpPointerSpace::BumpPointerSpace(const std::string& name, MemMap* mem_map)
52590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier    : ContinuousMemMapAllocSpace(name, mem_map, mem_map->Begin(), mem_map->Begin(), mem_map->End(),
53590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier                                 kGcRetentionPolicyAlwaysCollect),
54692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      growth_end_(mem_map->End()),
55692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      objects_allocated_(0), bytes_allocated_(0),
56692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      block_lock_("Block lock"),
57fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier      main_block_size_(0),
58692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      num_blocks_(0) {
59590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier}
60590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier
61590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartiermirror::Object* BumpPointerSpace::Alloc(Thread*, size_t num_bytes, size_t* bytes_allocated) {
62692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  num_bytes = RoundUp(num_bytes, kAlignment);
63590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  mirror::Object* ret = AllocNonvirtual(num_bytes);
64590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  if (LIKELY(ret != nullptr)) {
65590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier    *bytes_allocated = num_bytes;
66590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  }
67590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  return ret;
68590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier}
69590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier
70ef7d42fca18c16fbaf103822ad16f23246e2905dIan Rogerssize_t BumpPointerSpace::AllocationSize(mirror::Object* obj) {
71590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  return AllocationSizeNonvirtual(obj);
72590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier}
73590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier
74590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartiervoid BumpPointerSpace::Clear() {
75590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  // Release the pages back to the operating system.
76590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  CHECK_NE(madvise(Begin(), Limit() - Begin(), MADV_DONTNEED), -1) << "madvise failed";
77590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  // Reset the end of the space back to the beginning, we move the end forward as we allocate
78590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  // objects.
79fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier  SetEnd(Begin());
80692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  objects_allocated_ = 0;
81692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  bytes_allocated_ = 0;
82590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  growth_end_ = Limit();
83692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  {
84692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    MutexLock mu(Thread::Current(), block_lock_);
85692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    num_blocks_ = 0;
86fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier    main_block_size_ = 0;
87692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  }
88590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier}
89590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier
90590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartiervoid BumpPointerSpace::Dump(std::ostream& os) const {
91590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  os << reinterpret_cast<void*>(Begin()) << "-" << reinterpret_cast<void*>(End()) << " - "
92590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier     << reinterpret_cast<void*>(Limit());
93590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier}
94590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier
95590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartiermirror::Object* BumpPointerSpace::GetNextObject(mirror::Object* obj) {
96590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  const uintptr_t position = reinterpret_cast<uintptr_t>(obj) + obj->SizeOf();
97590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  return reinterpret_cast<mirror::Object*>(RoundUp(position, kAlignment));
98590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier}
99590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier
100692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartiervoid BumpPointerSpace::RevokeThreadLocalBuffers(Thread* thread) {
101692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  MutexLock mu(Thread::Current(), block_lock_);
102692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  RevokeThreadLocalBuffersLocked(thread);
103692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier}
104692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier
105692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartiervoid BumpPointerSpace::RevokeAllThreadLocalBuffers() {
106692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  Thread* self = Thread::Current();
107692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  MutexLock mu(self, *Locks::runtime_shutdown_lock_);
108692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  MutexLock mu2(self, *Locks::thread_list_lock_);
109692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  // TODO: Not do a copy of the thread list?
110692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  std::list<Thread*> thread_list = Runtime::Current()->GetThreadList()->GetList();
111692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  for (Thread* thread : thread_list) {
112692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    RevokeThreadLocalBuffers(thread);
113692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  }
114692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier}
115692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier
116692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartiervoid BumpPointerSpace::UpdateMainBlock() {
117692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  DCHECK_EQ(num_blocks_, 0U);
118fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier  main_block_size_ = Size();
119692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier}
120692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier
121692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier// Returns the start of the storage.
122692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartierbyte* BumpPointerSpace::AllocBlock(size_t bytes) {
123692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  bytes = RoundUp(bytes, kAlignment);
124692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  if (!num_blocks_) {
125692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    UpdateMainBlock();
126692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  }
127692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  byte* storage = reinterpret_cast<byte*>(
128692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      AllocNonvirtualWithoutAccounting(bytes + sizeof(BlockHeader)));
129692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  if (LIKELY(storage != nullptr)) {
130692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    BlockHeader* header = reinterpret_cast<BlockHeader*>(storage);
131692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    header->size_ = bytes;  // Write out the block header.
132692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    storage += sizeof(BlockHeader);
133692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    ++num_blocks_;
134692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  }
135692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  return storage;
136692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier}
137692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier
13883c8ee000d525017ead8753fce6bc1020249b96aMathieu Chartiervoid BumpPointerSpace::Walk(ObjectCallback* callback, void* arg) {
139692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  byte* pos = Begin();
140fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier  byte* main_end = pos;
141692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  {
142692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    MutexLock mu(Thread::Current(), block_lock_);
143692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    // If we have 0 blocks then we need to update the main header since we have bump pointer style
144692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    // allocation into an unbounded region (actually bounded by Capacity()).
145692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    if (num_blocks_ == 0) {
146692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      UpdateMainBlock();
147692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    }
148fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier    main_end += main_block_size_;
149692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  }
150fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier  // Walk all of the objects in the main block first.
151fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier  while (pos < main_end) {
152fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier    mirror::Object* obj = reinterpret_cast<mirror::Object*>(pos);
153fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier    callback(obj, arg);
154fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier    pos = reinterpret_cast<byte*>(GetNextObject(obj));
155fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier  }
156fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier  // Walk the other blocks (currently only TLABs).
157692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  while (pos < End()) {
158692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    BlockHeader* header = reinterpret_cast<BlockHeader*>(pos);
159692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    size_t block_size = header->size_;
160692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    pos += sizeof(BlockHeader);  // Skip the header so that we know where the objects
161692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    mirror::Object* obj = reinterpret_cast<mirror::Object*>(pos);
162692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    const mirror::Object* end = reinterpret_cast<const mirror::Object*>(pos + block_size);
163692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    CHECK_LE(reinterpret_cast<const byte*>(end), End());
164692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    // We don't know how many objects are allocated in the current block. When we hit a null class
165692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    // assume its the end. TODO: Have a thread update the header when it flushes the block?
166692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    while (obj < end && obj->GetClass() != nullptr) {
167692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      callback(obj, arg);
168692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      obj = GetNextObject(obj);
169692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    }
170692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    pos += block_size;
171692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  }
172692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier}
173692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier
174692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartierbool BumpPointerSpace::IsEmpty() const {
175fc4c27e4d68707271bd7578ae5c8bef93a3ea66bMathieu Chartier  return Begin() == End();
176692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier}
177692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier
178692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartieruint64_t BumpPointerSpace::GetBytesAllocated() {
179692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  // Start out pre-determined amount (blocks which are not being allocated into).
180b122a4bbed34ab22b4c1541ee25e5cf22f12a926Ian Rogers  uint64_t total = static_cast<uint64_t>(bytes_allocated_.Load());
181692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  Thread* self = Thread::Current();
182692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  MutexLock mu(self, *Locks::runtime_shutdown_lock_);
183692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  MutexLock mu2(self, *Locks::thread_list_lock_);
184692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  std::list<Thread*> thread_list = Runtime::Current()->GetThreadList()->GetList();
185692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  MutexLock mu3(Thread::Current(), block_lock_);
186692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  // If we don't have any blocks, we don't have any thread local buffers. This check is required
187692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  // since there can exist multiple bump pointer spaces which exist at the same time.
188692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  if (num_blocks_ > 0) {
189692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    for (Thread* thread : thread_list) {
190692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      total += thread->thread_local_pos_ - thread->thread_local_start_;
191692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    }
192692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  }
193692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  return total;
194692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier}
195692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier
196692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartieruint64_t BumpPointerSpace::GetObjectsAllocated() {
197692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  // Start out pre-determined amount (blocks which are not being allocated into).
198b122a4bbed34ab22b4c1541ee25e5cf22f12a926Ian Rogers  uint64_t total = static_cast<uint64_t>(objects_allocated_.Load());
199692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  Thread* self = Thread::Current();
200692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  MutexLock mu(self, *Locks::runtime_shutdown_lock_);
201692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  MutexLock mu2(self, *Locks::thread_list_lock_);
202692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  std::list<Thread*> thread_list = Runtime::Current()->GetThreadList()->GetList();
203692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  MutexLock mu3(Thread::Current(), block_lock_);
204692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  // If we don't have any blocks, we don't have any thread local buffers. This check is required
205692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  // since there can exist multiple bump pointer spaces which exist at the same time.
206692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  if (num_blocks_ > 0) {
207692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    for (Thread* thread : thread_list) {
208692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier      total += thread->thread_local_objects_;
209692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    }
210692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  }
211692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  return total;
212692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier}
213692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier
214692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartiervoid BumpPointerSpace::RevokeThreadLocalBuffersLocked(Thread* thread) {
215b122a4bbed34ab22b4c1541ee25e5cf22f12a926Ian Rogers  objects_allocated_.FetchAndAdd(thread->thread_local_objects_);
216b122a4bbed34ab22b4c1541ee25e5cf22f12a926Ian Rogers  bytes_allocated_.FetchAndAdd(thread->thread_local_pos_ - thread->thread_local_start_);
217e6da9af8dfe0a3e3fbc2be700554f6478380e7b9Mathieu Chartier  thread->SetTlab(nullptr, nullptr);
218692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier}
219692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier
220e6da9af8dfe0a3e3fbc2be700554f6478380e7b9Mathieu Chartierbool BumpPointerSpace::AllocNewTlab(Thread* self, size_t bytes) {
221692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  MutexLock mu(Thread::Current(), block_lock_);
222692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  RevokeThreadLocalBuffersLocked(self);
223692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  byte* start = AllocBlock(bytes);
224692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  if (start == nullptr) {
225692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier    return false;
226692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  }
227e6da9af8dfe0a3e3fbc2be700554f6478380e7b9Mathieu Chartier  self->SetTlab(start, start + bytes);
228692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier  return true;
229692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier}
230692fafd9778141fa6ef0048c9569abd7ee0253bfMathieu Chartier
231590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier}  // namespace space
232590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier}  // namespace gc
233590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier}  // namespace art
234