1 // Copyright 2011 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
4 // met:
5 //
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
15 //
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
28 #ifndef V8_STORE_BUFFER_INL_H_
29 #define V8_STORE_BUFFER_INL_H_
30
31 #include "store-buffer.h"
32
33 namespace v8 {
34 namespace internal {
35
TopAddress()36 Address StoreBuffer::TopAddress() {
37 return reinterpret_cast<Address>(heap_->store_buffer_top_address());
38 }
39
40
Mark(Address addr)41 void StoreBuffer::Mark(Address addr) {
42 ASSERT(!heap_->cell_space()->Contains(addr));
43 ASSERT(!heap_->code_space()->Contains(addr));
44 ASSERT(!heap_->old_data_space()->Contains(addr));
45 Address* top = reinterpret_cast<Address*>(heap_->store_buffer_top());
46 *top++ = addr;
47 heap_->public_set_store_buffer_top(top);
48 if ((reinterpret_cast<uintptr_t>(top) & kStoreBufferOverflowBit) != 0) {
49 ASSERT(top == limit_);
50 Compact();
51 } else {
52 ASSERT(top < limit_);
53 }
54 }
55
56
EnterDirectlyIntoStoreBuffer(Address addr)57 void StoreBuffer::EnterDirectlyIntoStoreBuffer(Address addr) {
58 if (store_buffer_rebuilding_enabled_) {
59 SLOW_ASSERT(!heap_->cell_space()->Contains(addr) &&
60 !heap_->code_space()->Contains(addr) &&
61 !heap_->old_data_space()->Contains(addr) &&
62 !heap_->new_space()->Contains(addr));
63 Address* top = old_top_;
64 *top++ = addr;
65 old_top_ = top;
66 old_buffer_is_sorted_ = false;
67 old_buffer_is_filtered_ = false;
68 if (top >= old_limit_) {
69 ASSERT(callback_ != NULL);
70 (*callback_)(heap_,
71 MemoryChunk::FromAnyPointerAddress(heap_, addr),
72 kStoreBufferFullEvent);
73 }
74 }
75 }
76
77
ClearDeadObject(HeapObject * object)78 void StoreBuffer::ClearDeadObject(HeapObject* object) {
79 Address& map_field = Memory::Address_at(object->address());
80 if (heap_->map_space()->Contains(map_field)) {
81 map_field = NULL;
82 }
83 }
84
85
86 } } // namespace v8::internal
87
88 #endif // V8_STORE_BUFFER_INL_H_
89