| // Copyright 2012 the V8 project authors. All rights reserved. |
| // Redistribution and use in source and binary forms, with or without |
| // modification, are permitted provided that the following conditions are |
| // met: |
| // |
| // * Redistributions of source code must retain the above copyright |
| // notice, this list of conditions and the following disclaimer. |
| // * Redistributions in binary form must reproduce the above |
| // copyright notice, this list of conditions and the following |
| // disclaimer in the documentation and/or other materials provided |
| // with the distribution. |
| // * Neither the name of Google Inc. nor the names of its |
| // contributors may be used to endorse or promote products derived |
| // from this software without specific prior written permission. |
| // |
| // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| |
| #ifndef V8_INCREMENTAL_MARKING_INL_H_ |
| #define V8_INCREMENTAL_MARKING_INL_H_ |
| |
| #include "incremental-marking.h" |
| |
| namespace v8 { |
| namespace internal { |
| |
| |
| bool IncrementalMarking::BaseRecordWrite(HeapObject* obj, |
| Object** slot, |
| Object* value) { |
| HeapObject* value_heap_obj = HeapObject::cast(value); |
| MarkBit value_bit = Marking::MarkBitFrom(value_heap_obj); |
| if (Marking::IsWhite(value_bit)) { |
| MarkBit obj_bit = Marking::MarkBitFrom(obj); |
| if (Marking::IsBlack(obj_bit)) { |
| MemoryChunk* chunk = MemoryChunk::FromAddress(obj->address()); |
| if (chunk->IsFlagSet(MemoryChunk::HAS_PROGRESS_BAR)) { |
| WhiteToGreyAndPush(value_heap_obj, value_bit); |
| RestartIfNotMarking(); |
| } else { |
| BlackToGreyAndUnshift(obj, obj_bit); |
| RestartIfNotMarking(); |
| return false; |
| } |
| } else { |
| return false; |
| } |
| } |
| if (!is_compacting_) return false; |
| MarkBit obj_bit = Marking::MarkBitFrom(obj); |
| return Marking::IsBlack(obj_bit); |
| } |
| |
| |
| void IncrementalMarking::RecordWrite(HeapObject* obj, |
| Object** slot, |
| Object* value) { |
| if (IsMarking() && value->NonFailureIsHeapObject()) { |
| RecordWriteSlow(obj, slot, value); |
| } |
| } |
| |
| |
| void IncrementalMarking::RecordWriteOfCodeEntry(JSFunction* host, |
| Object** slot, |
| Code* value) { |
| if (IsMarking()) RecordWriteOfCodeEntrySlow(host, slot, value); |
| } |
| |
| |
| void IncrementalMarking::RecordWriteIntoCode(HeapObject* obj, |
| RelocInfo* rinfo, |
| Object* value) { |
| if (IsMarking() && value->NonFailureIsHeapObject()) { |
| RecordWriteIntoCodeSlow(obj, rinfo, value); |
| } |
| } |
| |
| |
| void IncrementalMarking::RecordWrites(HeapObject* obj) { |
| if (IsMarking()) { |
| MarkBit obj_bit = Marking::MarkBitFrom(obj); |
| if (Marking::IsBlack(obj_bit)) { |
| MemoryChunk* chunk = MemoryChunk::FromAddress(obj->address()); |
| if (chunk->IsFlagSet(MemoryChunk::HAS_PROGRESS_BAR)) { |
| chunk->set_progress_bar(0); |
| } |
| BlackToGreyAndUnshift(obj, obj_bit); |
| RestartIfNotMarking(); |
| } |
| } |
| } |
| |
| |
| void IncrementalMarking::BlackToGreyAndUnshift(HeapObject* obj, |
| MarkBit mark_bit) { |
| ASSERT(Marking::MarkBitFrom(obj) == mark_bit); |
| ASSERT(obj->Size() >= 2*kPointerSize); |
| ASSERT(IsMarking()); |
| Marking::BlackToGrey(mark_bit); |
| int obj_size = obj->Size(); |
| MemoryChunk::IncrementLiveBytesFromGC(obj->address(), -obj_size); |
| bytes_scanned_ -= obj_size; |
| int64_t old_bytes_rescanned = bytes_rescanned_; |
| bytes_rescanned_ = old_bytes_rescanned + obj_size; |
| if ((bytes_rescanned_ >> 20) != (old_bytes_rescanned >> 20)) { |
| if (bytes_rescanned_ > 2 * heap_->PromotedSpaceSizeOfObjects()) { |
| // If we have queued twice the heap size for rescanning then we are |
| // going around in circles, scanning the same objects again and again |
| // as the program mutates the heap faster than we can incrementally |
| // trace it. In this case we switch to non-incremental marking in |
| // order to finish off this marking phase. |
| if (FLAG_trace_gc) { |
| PrintPID("Hurrying incremental marking because of lack of progress\n"); |
| } |
| marking_speed_ = kMaxMarkingSpeed; |
| } |
| } |
| |
| marking_deque_.UnshiftGrey(obj); |
| } |
| |
| |
| void IncrementalMarking::WhiteToGreyAndPush(HeapObject* obj, MarkBit mark_bit) { |
| Marking::WhiteToGrey(mark_bit); |
| marking_deque_.PushGrey(obj); |
| } |
| |
| |
| } } // namespace v8::internal |
| |
| #endif // V8_INCREMENTAL_MARKING_INL_H_ |