v8  3.14.5(node0.10.28)
V8 is Google's open source JavaScript engine
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
incremental-marking-inl.h
Go to the documentation of this file.
1 // Copyright 2012 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_INCREMENTAL_MARKING_INL_H_
29 #define V8_INCREMENTAL_MARKING_INL_H_
30 
31 #include "incremental-marking.h"
32 
33 namespace v8 {
34 namespace internal {
35 
36 
37 bool IncrementalMarking::BaseRecordWrite(HeapObject* obj,
38  Object** slot,
39  Object* value) {
40  MarkBit value_bit = Marking::MarkBitFrom(HeapObject::cast(value));
41  if (Marking::IsWhite(value_bit)) {
42  MarkBit obj_bit = Marking::MarkBitFrom(obj);
43  if (Marking::IsBlack(obj_bit)) {
44  BlackToGreyAndUnshift(obj, obj_bit);
46  }
47 
48  // Object is either grey or white. It will be scanned if survives.
49  return false;
50  }
51  if (!is_compacting_) return false;
52  MarkBit obj_bit = Marking::MarkBitFrom(obj);
53  return Marking::IsBlack(obj_bit);
54 }
55 
56 
57 void IncrementalMarking::RecordWrite(HeapObject* obj,
58  Object** slot,
59  Object* value) {
60  if (IsMarking() && value->NonFailureIsHeapObject()) {
61  RecordWriteSlow(obj, slot, value);
62  }
63 }
64 
65 
66 void IncrementalMarking::RecordWriteOfCodeEntry(JSFunction* host,
67  Object** slot,
68  Code* value) {
69  if (IsMarking()) RecordWriteOfCodeEntrySlow(host, slot, value);
70 }
71 
72 
73 void IncrementalMarking::RecordWriteIntoCode(HeapObject* obj,
74  RelocInfo* rinfo,
75  Object* value) {
76  if (IsMarking() && value->NonFailureIsHeapObject()) {
77  RecordWriteIntoCodeSlow(obj, rinfo, value);
78  }
79 }
80 
81 
83  if (IsMarking()) {
84  MarkBit obj_bit = Marking::MarkBitFrom(obj);
85  if (Marking::IsBlack(obj_bit)) {
86  BlackToGreyAndUnshift(obj, obj_bit);
88  }
89  }
90 }
91 
92 
94  MarkBit mark_bit) {
95  ASSERT(Marking::MarkBitFrom(obj) == mark_bit);
96  ASSERT(obj->Size() >= 2*kPointerSize);
97  ASSERT(IsMarking());
98  Marking::BlackToGrey(mark_bit);
99  int obj_size = obj->Size();
101  bytes_scanned_ -= obj_size;
102  int64_t old_bytes_rescanned = bytes_rescanned_;
103  bytes_rescanned_ = old_bytes_rescanned + obj_size;
104  if ((bytes_rescanned_ >> 20) != (old_bytes_rescanned >> 20)) {
105  if (bytes_rescanned_ > 2 * heap_->PromotedSpaceSizeOfObjects()) {
106  // If we have queued twice the heap size for rescanning then we are
107  // going around in circles, scanning the same objects again and again
108  // as the program mutates the heap faster than we can incrementally
109  // trace it. In this case we switch to non-incremental marking in
110  // order to finish off this marking phase.
111  if (FLAG_trace_gc) {
112  PrintPID("Hurrying incremental marking because of lack of progress\n");
113  }
114  marking_speed_ = kMaxMarkingSpeed;
115  }
116  }
117 
118  marking_deque_.UnshiftGrey(obj);
119 }
120 
121 
123  Marking::WhiteToGrey(mark_bit);
124  marking_deque_.PushGrey(obj);
125 }
126 
127 
128 } } // namespace v8::internal
129 
130 #endif // V8_INCREMENTAL_MARKING_INL_H_
static bool IsBlack(MarkBit mark_bit)
Definition: mark-compact.h:70
static void WhiteToGrey(MarkBit markbit)
Definition: mark-compact.h:95
static HeapObject * cast(Object *obj)
static void BlackToGrey(MarkBit markbit)
Definition: mark-compact.h:91
#define ASSERT(condition)
Definition: checks.h:270
void RecordWriteIntoCodeSlow(HeapObject *obj, RelocInfo *rinfo, Object *value)
static void IncrementLiveBytesFromGC(Address address, int by)
Definition: spaces.h:484
static bool IsWhite(MarkBit mark_bit)
Definition: mark-compact.h:76
static const intptr_t kMaxMarkingSpeed
static MarkBit MarkBitFrom(Address addr)
const int kPointerSize
Definition: globals.h:220
void RecordWriteOfCodeEntrySlow(JSFunction *host, Object **slot, Code *value)
void WhiteToGreyAndPush(HeapObject *obj, MarkBit mark_bit)
void PrintPID(const char *format,...)
Definition: v8utils.cc:56
void RecordWriteSlow(HeapObject *obj, Object **slot, Object *value)
intptr_t PromotedSpaceSizeOfObjects()
Definition: heap.cc:5947
void PushGrey(HeapObject *object)
Definition: mark-compact.h:209
void UnshiftGrey(HeapObject *object)
Definition: mark-compact.h:227
void BlackToGreyAndUnshift(HeapObject *obj, MarkBit mark_bit)