1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
// Copyright 2017 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/heap/invalidated-slots.h"
#include "src/base/logging.h"
#include "src/heap/invalidated-slots-inl.h"
#include "src/heap/memory-chunk.h"
#include "src/heap/spaces.h"
#include "src/objects/objects-inl.h"
namespace v8 {
namespace internal {
InvalidatedSlotsFilter InvalidatedSlotsFilter::OldToOld(
MemoryChunk* chunk, LivenessCheck liveness_check) {
return InvalidatedSlotsFilter(chunk, chunk->invalidated_slots<OLD_TO_OLD>(),
OLD_TO_OLD, liveness_check);
}
InvalidatedSlotsFilter InvalidatedSlotsFilter::OldToNew(
MemoryChunk* chunk, LivenessCheck liveness_check) {
return InvalidatedSlotsFilter(chunk, chunk->invalidated_slots<OLD_TO_NEW>(),
OLD_TO_NEW, liveness_check);
}
InvalidatedSlotsFilter InvalidatedSlotsFilter::OldToShared(
MemoryChunk* chunk, LivenessCheck liveness_check) {
return InvalidatedSlotsFilter(chunk,
chunk->invalidated_slots<OLD_TO_SHARED>(),
OLD_TO_SHARED, liveness_check);
}
InvalidatedSlotsFilter::InvalidatedSlotsFilter(
MemoryChunk* chunk, InvalidatedSlots* invalidated_slots,
RememberedSetType remembered_set_type, LivenessCheck liveness_check) {
USE(remembered_set_type);
invalidated_slots = invalidated_slots ? invalidated_slots : &empty_;
iterator_ = invalidated_slots->begin();
iterator_end_ = invalidated_slots->end();
sentinel_ = chunk->area_end();
if (liveness_check == LivenessCheck::kYes) {
marking_state_ =
chunk->heap()->mark_compact_collector()->non_atomic_marking_state();
} else {
DCHECK_EQ(LivenessCheck::kNo, liveness_check);
marking_state_ = nullptr;
}
// Invoke NextInvalidatedObject twice, to initialize
// invalidated_start_ to the first invalidated object and
// next_invalidated_object_ to the second one.
NextInvalidatedObject();
NextInvalidatedObject();
#ifdef DEBUG
last_slot_ = chunk->area_start();
remembered_set_type_ = remembered_set_type;
#endif
}
InvalidatedSlotsCleanup InvalidatedSlotsCleanup::OldToNew(MemoryChunk* chunk) {
return InvalidatedSlotsCleanup(chunk, chunk->invalidated_slots<OLD_TO_NEW>());
}
InvalidatedSlotsCleanup InvalidatedSlotsCleanup::OldToShared(
MemoryChunk* chunk) {
return InvalidatedSlotsCleanup(chunk,
chunk->invalidated_slots<OLD_TO_SHARED>());
}
InvalidatedSlotsCleanup InvalidatedSlotsCleanup::NoCleanup(MemoryChunk* chunk) {
return InvalidatedSlotsCleanup(chunk, nullptr);
}
InvalidatedSlotsCleanup::InvalidatedSlotsCleanup(
MemoryChunk* chunk, InvalidatedSlots* invalidated_slots) {
invalidated_slots_ = invalidated_slots ? invalidated_slots : &empty_;
iterator_ = invalidated_slots_->begin();
iterator_end_ = invalidated_slots_->end();
sentinel_ = chunk->area_end();
NextInvalidatedObject();
#ifdef DEBUG
last_free_ = chunk->area_start();
#endif
}
} // namespace internal
} // namespace v8
|
