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
|
// Copyright 2016 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef FIELDS_ILLEGAL_TRACING_H_
#define FIELDS_ILLEGAL_TRACING_H_
#include "heap/stubs.h"
namespace blink {
namespace bar {
// check that (only) std::unique_ptr<> is reported
// as an illegal smart pointer type.
template<typename T> class unique_ptr {
public:
~unique_ptr() { }
operator T*() const { return 0; }
T* operator->() { return 0; }
void Trace(Visitor* visitor) const {}
};
}
class HeapObject;
class PartObject;
class PartObjectWithTrace {
DISALLOW_NEW();
public:
void Trace(Visitor*) const;
private:
scoped_refptr<HeapObject> m_obj2;
bar::unique_ptr<HeapObject> m_obj3;
std::unique_ptr<HeapObject> m_obj4;
Vector<int>::iterator m_iterator1;
HeapVector<Member<HeapObject>>::iterator m_iterator2;
HeapHashSet<PartObject>::const_iterator m_iterator3;
};
class PartObject {
DISALLOW_NEW();
};
class HeapObject : public GarbageCollected<HeapObject> {
public:
void Trace(Visitor*) const;
private:
PartObject m_part;
scoped_refptr<HeapObject> m_obj2;
bar::unique_ptr<HeapObject> m_obj3;
std::unique_ptr<HeapObject> m_obj4;
HeapHashMap<int, Member<HeapObject>>::reverse_iterator m_iterator3;
HeapDeque<Member<HeapObject>>::const_reverse_iterator m_iterator4;
HeapLinkedHashSet<Member<HeapObject>>::const_iterator m_iterator6;
};
class StackAllocatedObject {
STACK_ALLOCATED();
private:
scoped_refptr<HeapObject> m_obj2;
bar::unique_ptr<HeapObject> m_obj3;
std::unique_ptr<HeapObject> m_obj4;
Vector<int>::iterator m_iterator1;
HeapVector<Member<HeapObject>>::iterator m_iterator2;
HeapHashSet<PartObject>::const_iterator m_iterator3;
};
} // namespace blink
#endif
|
