blob: 1606465a094d02411d4bed3b1a14c307121996c9 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
// Copyright 2011 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef V8_STORE_BUFFER_INL_H_
#define V8_STORE_BUFFER_INL_H_
#include "src/heap/store-buffer.h"
namespace v8 {
namespace internal {
Address StoreBuffer::TopAddress() {
return reinterpret_cast<Address>(heap_->store_buffer_top_address());
}
void StoreBuffer::Mark(Address addr) {
DCHECK(!heap_->cell_space()->Contains(addr));
DCHECK(!heap_->code_space()->Contains(addr));
DCHECK(!heap_->old_data_space()->Contains(addr));
Address* top = reinterpret_cast<Address*>(heap_->store_buffer_top());
*top++ = addr;
heap_->public_set_store_buffer_top(top);
if ((reinterpret_cast<uintptr_t>(top) & kStoreBufferOverflowBit) != 0) {
DCHECK(top == limit_);
Compact();
} else {
DCHECK(top < limit_);
}
}
void StoreBuffer::EnterDirectlyIntoStoreBuffer(Address addr) {
if (store_buffer_rebuilding_enabled_) {
SLOW_DCHECK(!heap_->cell_space()->Contains(addr) &&
!heap_->code_space()->Contains(addr) &&
!heap_->old_data_space()->Contains(addr) &&
!heap_->new_space()->Contains(addr));
Address* top = old_top_;
*top++ = addr;
old_top_ = top;
old_buffer_is_sorted_ = false;
old_buffer_is_filtered_ = false;
if (top >= old_limit_) {
DCHECK(callback_ != NULL);
(*callback_)(heap_, MemoryChunk::FromAnyPointerAddress(heap_, addr),
kStoreBufferFullEvent);
}
}
}
void StoreBuffer::ClearDeadObject(HeapObject* object) {
Address& map_field = Memory::Address_at(object->address());
if (heap_->map_space()->Contains(map_field)) {
map_field = NULL;
}
}
}
} // namespace v8::internal
#endif // V8_STORE_BUFFER_INL_H_
|
