Home | History | Annotate | Download | only in src 
      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 
     36 Address StoreBuffer::TopAddress() {
     37   return reinterpret_cast<Address>(heap_->store_buffer_top_address());
     38 }
     39 
     40 
     41 void StoreBuffer::Mark(Address addr) {
     42   ASSERT(!heap_->cell_space()->Contains(addr));
     43   ASSERT(!heap_->code_space()->Contains(addr));
     44   Address* top = reinterpret_cast<Address*>(heap_->store_buffer_top());
     45   *top++ = addr;
     46   heap_->public_set_store_buffer_top(top);
     47   if ((reinterpret_cast<uintptr_t>(top) & kStoreBufferOverflowBit) != 0) {
     48     ASSERT(top == limit_);
     49     Compact();
     50   } else {
     51     ASSERT(top < limit_);
     52   }
     53 }
     54 
     55 
     56 void StoreBuffer::EnterDirectlyIntoStoreBuffer(Address addr) {
     57   if (store_buffer_rebuilding_enabled_) {
     58     SLOW_ASSERT(!heap_->cell_space()->Contains(addr) &&
     59                 !heap_->code_space()->Contains(addr) &&
     60                 !heap_->old_data_space()->Contains(addr) &&
     61                 !heap_->new_space()->Contains(addr));
     62     Address* top = old_top_;
     63     *top++ = addr;
     64     old_top_ = top;
     65     old_buffer_is_sorted_ = false;
     66     old_buffer_is_filtered_ = false;
     67     if (top >= old_limit_) {
     68       ASSERT(callback_ != NULL);
     69       (*callback_)(heap_,
     70                    MemoryChunk::FromAnyPointerAddress(addr),
     71                    kStoreBufferFullEvent);
     72     }
     73   }
     74 }
     75 
     76 
     77 void StoreBuffer::ClearDeadObject(HeapObject* object) {
     78   Address& map_field = Memory::Address_at(object->address());
     79   if (heap_->map_space()->Contains(map_field)) {
     80     map_field = NULL;
     81   }
     82 }
     83 
     84 
     85 } }  // namespace v8::internal
     86 
     87 #endif  // V8_STORE_BUFFER_INL_H_
     88