| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 11 matching lines...) Expand all Loading... |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #ifndef V8_WRITE_BARRIER_INL_H_ | 28 #ifndef V8_WRITE_BARRIER_INL_H_ |
| 29 #define V8_WRITE_BARRIER_INL_H_ | 29 #define V8_WRITE_BARRIER_INL_H_ |
| 30 | 30 |
| 31 #include "v8.h" | 31 #include "v8.h" |
| 32 #include "write-buffer.h" | 32 #include "store-buffer.h" |
| 33 | 33 |
| 34 namespace v8 { | 34 namespace v8 { |
| 35 namespace internal { | 35 namespace internal { |
| 36 | 36 |
| 37 Address WriteBuffer::TopAddress() { | 37 Address StoreBuffer::TopAddress() { |
| 38 return reinterpret_cast<Address>(Heap::write_buffer_top_address()); | 38 return reinterpret_cast<Address>(Heap::store_buffer_top_address()); |
| 39 } | 39 } |
| 40 | 40 |
| 41 | 41 |
| 42 void WriteBuffer::Mark(Address addr) { | 42 void StoreBuffer::Mark(Address addr) { |
| 43 Address* top = reinterpret_cast<Address*>(Heap::write_buffer_top()); | 43 Address* top = reinterpret_cast<Address*>(Heap::store_buffer_top()); |
| 44 *top++ = addr; | 44 *top++ = addr; |
| 45 Heap::public_set_write_buffer_top(top); | 45 Heap::public_set_store_buffer_top(top); |
| 46 if ((reinterpret_cast<uintptr_t>(top) & kWriteBufferOverflowBit) != 0) { | 46 if ((reinterpret_cast<uintptr_t>(top) & kStoreBufferOverflowBit) != 0) { |
| 47 ASSERT(top == limit_); | 47 ASSERT(top == limit_); |
| 48 Compact(); | 48 Compact(); |
| 49 } else { | 49 } else { |
| 50 ASSERT(top < limit_); | 50 ASSERT(top < limit_); |
| 51 } | 51 } |
| 52 } | 52 } |
| 53 | 53 |
| 54 } } // namespace v8::internal | 54 } } // namespace v8::internal |
| 55 | 55 |
| 56 #endif // V8_WRITE_BARRIER_INL_H_ | 56 #endif // V8_WRITE_BARRIER_INL_H_ |
| OLD | NEW |