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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
// Copyright 2014 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "Config.h"
#include "Edge.h"
#include "RecordInfo.h"
TracingStatus Value::NeedsTracing(NeedsTracingOption option) {
return value_->NeedsTracing(option);
}
bool Value::NeedsFinalization() { return value_->NeedsFinalization(); }
bool Collection::NeedsFinalization() { return info_->NeedsFinalization(); }
bool Collection::IsSTDCollection() {
return Config::IsSTDCollection(info_->name());
}
std::string Collection::GetCollectionName() const {
return info_->name();
}
TracingStatus Collection::NeedsTracing(NeedsTracingOption) {
if (on_heap_) {
return TracingStatus::Needed();
}
// This will be handled by matchers.
if (IsSTDCollection()) {
if ((GetCollectionName() == "array") && !members_.empty()) {
Edge* type = members_.at(0);
if (type->IsMember() || type->IsWeakMember() ||
type->IsTraceWrapperV8Reference()) {
return TracingStatus::Needed();
}
}
return TracingStatus::Unknown();
}
// For off-heap collections, determine tracing status of members.
TracingStatus status = TracingStatus::Unneeded();
for (Members::iterator it = members_.begin(); it != members_.end(); ++it) {
// Do a non-recursive test here since members could equal the holder.
status = status.LUB((*it)->NeedsTracing(kNonRecursive));
}
return status;
}
void RecursiveEdgeVisitor::AtValue(Value*) {}
void RecursiveEdgeVisitor::AtRawPtr(RawPtr*) {}
void RecursiveEdgeVisitor::AtRefPtr(RefPtr*) {}
void RecursiveEdgeVisitor::AtUniquePtr(UniquePtr*) {}
void RecursiveEdgeVisitor::AtMember(Member*) {}
void RecursiveEdgeVisitor::AtWeakMember(WeakMember*) {}
void RecursiveEdgeVisitor::AtPersistent(Persistent*) {}
void RecursiveEdgeVisitor::AtCrossThreadPersistent(CrossThreadPersistent*) {}
void RecursiveEdgeVisitor::AtCollection(Collection*) {}
void RecursiveEdgeVisitor::AtIterator(Iterator*) {}
void RecursiveEdgeVisitor::AtTraceWrapperV8Reference(TraceWrapperV8Reference*) {
}
void RecursiveEdgeVisitor::AtArrayEdge(ArrayEdge*) {}
void RecursiveEdgeVisitor::VisitValue(Value* e) {
AtValue(e);
}
void RecursiveEdgeVisitor::VisitRawPtr(RawPtr* e) {
AtRawPtr(e);
Enter(e);
e->ptr()->Accept(this);
Leave();
}
void RecursiveEdgeVisitor::VisitRefPtr(RefPtr* e) {
AtRefPtr(e);
Enter(e);
e->ptr()->Accept(this);
Leave();
}
void RecursiveEdgeVisitor::VisitUniquePtr(UniquePtr* e) {
AtUniquePtr(e);
Enter(e);
e->ptr()->Accept(this);
Leave();
}
void RecursiveEdgeVisitor::VisitMember(Member* e) {
AtMember(e);
Enter(e);
e->ptr()->Accept(this);
Leave();
}
void RecursiveEdgeVisitor::VisitWeakMember(WeakMember* e) {
AtWeakMember(e);
Enter(e);
e->ptr()->Accept(this);
Leave();
}
void RecursiveEdgeVisitor::VisitPersistent(Persistent* e) {
AtPersistent(e);
Enter(e);
e->ptr()->Accept(this);
Leave();
}
void RecursiveEdgeVisitor::VisitCrossThreadPersistent(
CrossThreadPersistent* e) {
AtCrossThreadPersistent(e);
Enter(e);
e->ptr()->Accept(this);
Leave();
}
void RecursiveEdgeVisitor::VisitCollection(Collection* e) {
AtCollection(e);
Enter(e);
e->AcceptMembers(this);
Leave();
}
void RecursiveEdgeVisitor::VisitIterator(Iterator* e) {
AtIterator(e);
}
void RecursiveEdgeVisitor::VisitTraceWrapperV8Reference(
TraceWrapperV8Reference* e) {
AtTraceWrapperV8Reference(e);
Enter(e);
e->ptr()->Accept(this);
Leave();
}
void RecursiveEdgeVisitor::VisitArrayEdge(ArrayEdge* e) {
AtArrayEdge(e);
}
|
