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
|
/*
* Copyright (C) 2009, 2015 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef WeakGCMap_h
#define WeakGCMap_h
#include "Weak.h"
#include "WeakInlines.h"
#include <wtf/HashMap.h>
namespace JSC {
// A HashMap with Weak<JSCell> values, which automatically removes values once they're garbage collected.
template<typename KeyArg, typename ValueArg, typename HashArg = typename DefaultHash<KeyArg>::Hash,
typename KeyTraitsArg = HashTraits<KeyArg>>
class WeakGCMap {
WTF_MAKE_FAST_ALLOCATED;
typedef Weak<ValueArg> ValueType;
typedef HashMap<KeyArg, ValueType, HashArg, KeyTraitsArg> HashMapType;
public:
typedef typename HashMapType::KeyType KeyType;
typedef typename HashMapType::AddResult AddResult;
typedef typename HashMapType::iterator iterator;
typedef typename HashMapType::const_iterator const_iterator;
explicit WeakGCMap(VM&);
~WeakGCMap();
ValueArg* get(const KeyType& key) const
{
return m_map.get(key);
}
AddResult set(const KeyType& key, ValueType value)
{
return m_map.set(key, WTFMove(value));
}
bool remove(const KeyType& key)
{
return m_map.remove(key);
}
void clear()
{
m_map.clear();
}
bool isEmpty() const
{
const_iterator it = m_map.begin();
const_iterator end = m_map.end();
while (it != end) {
if (it->value)
return true;
}
return false;
}
iterator find(const KeyType& key)
{
iterator it = m_map.find(key);
iterator end = m_map.end();
if (it != end && !it->value) // Found a zombie value.
return end;
return it;
}
const_iterator find(const KeyType& key) const
{
return const_cast<WeakGCMap*>(this)->find(key);
}
template<typename Functor>
void forEach(Functor functor)
{
for (auto& pair : m_map) {
if (pair.value)
functor(pair.key, pair.value.get());
}
}
bool contains(const KeyType& key) const
{
return find(key) != m_map.end();
}
void pruneStaleEntries();
private:
HashMapType m_map;
VM& m_vm;
};
} // namespace JSC
#endif // WeakGCMap_h
|
