blob: 33850c09816d6973fad37f001f48f8cd87075af8 (
plain)
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
|
// Copyright 2014 The Chromium 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 "Config.h"
#include "Edge.h"
#include "RecordInfo.h"
TracingStatus Value::NeedsTracing(NeedsTracingOption option) {
return value_->NeedsTracing(option);
}
void RecursiveEdgeVisitor::AtValue(Value*) {}
void RecursiveEdgeVisitor::AtRawPtr(RawPtr*) {}
void RecursiveEdgeVisitor::AtRefPtr(RefPtr*) {}
void RecursiveEdgeVisitor::AtOwnPtr(OwnPtr*) {}
void RecursiveEdgeVisitor::AtMember(Member*) {}
void RecursiveEdgeVisitor::AtWeakMember(WeakMember*) {}
void RecursiveEdgeVisitor::AtPersistent(Persistent*) {}
void RecursiveEdgeVisitor::AtCollection(Collection*) {}
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::VisitOwnPtr(OwnPtr* e) {
AtOwnPtr(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::VisitCollection(Collection* e) {
AtCollection(e);
Enter(e);
for (Collection::Members::iterator it = e->members().begin();
it != e->members().end();
++it) {
(*it)->Accept(this);
}
Leave();
}
|
