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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
|
/*
* Copyright (C) 2012 Google 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:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 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 THE COPYRIGHT
* OWNER OR 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 DOMWrapperMap_h
#define DOMWrapperMap_h
#include "bindings/core/v8/WrapperTypeInfo.h"
#include "platform/ScriptForbiddenScope.h"
#include "wtf/HashMap.h"
#include <v8-util.h>
#include <v8.h>
namespace blink {
template<class KeyType>
class DOMWrapperMap {
public:
explicit DOMWrapperMap(v8::Isolate* isolate)
: m_isolate(isolate)
, m_map(isolate)
{
}
v8::Handle<v8::Object> newLocal(KeyType* key, v8::Isolate* isolate)
{
return m_map.Get(key);
}
bool setReturnValueFrom(v8::ReturnValue<v8::Value> returnValue, KeyType* key)
{
return m_map.SetReturnValue(key, returnValue);
}
void setReference(const v8::Persistent<v8::Object>& parent, KeyType* key, v8::Isolate* isolate)
{
m_map.SetReference(key, parent);
}
bool containsKey(KeyType* key)
{
return m_map.Contains(key);
}
void set(KeyType* key, v8::Handle<v8::Object> wrapper, const WrapperTypeInfo* wrapperTypeInfo)
{
ASSERT((getInternalField<KeyType, v8DOMWrapperObjectIndex>(wrapper)) == key);
RELEASE_ASSERT(!containsKey(key)); // See crbug.com/368095
v8::UniquePersistent<v8::Object> unique(m_isolate, wrapper);
wrapperTypeInfo->configureWrapper(&unique);
m_map.Set(key, unique.Pass());
}
void clear()
{
m_map.Clear();
}
void removeAndDispose(KeyType* key)
{
ASSERT(containsKey(key));
m_map.Remove(key);
}
private:
class PersistentValueMapTraits {
public:
// Map traits:
typedef HashMap<KeyType*, v8::PersistentContainerValue> Impl;
typedef typename Impl::iterator Iterator;
static size_t Size(const Impl* impl) { return impl->size(); }
static bool Empty(Impl* impl) { return impl->isEmpty(); }
static void Swap(Impl& impl, Impl& other) { impl.swap(other); }
static Iterator Begin(Impl* impl) { return impl->begin(); }
static Iterator End(Impl* impl) { return impl->end(); }
static v8::PersistentContainerValue Value(Iterator& iter)
{
return iter->value;
}
static KeyType* Key(Iterator& iter) { return iter->key; }
static v8::PersistentContainerValue Set(
Impl* impl, KeyType* key, v8::PersistentContainerValue value)
{
v8::PersistentContainerValue oldValue = Get(impl, key);
impl->set(key, value);
return oldValue;
}
static v8::PersistentContainerValue Get(const Impl* impl, KeyType* key)
{
return impl->get(key);
}
static v8::PersistentContainerValue Remove(Impl* impl, KeyType* key)
{
return impl->take(key);
}
// Weak traits:
static const v8::PersistentContainerCallbackType kCallbackType = v8::kWeak;
typedef v8::PersistentValueMap<KeyType*, v8::Object, PersistentValueMapTraits> MapType;
typedef MapType WeakCallbackDataType;
static WeakCallbackDataType* WeakCallbackParameter(MapType* map, KeyType* key, v8::Local<v8::Object>& value)
{
return map;
}
static void DisposeCallbackData(WeakCallbackDataType* callbackData) { }
static MapType* MapFromWeakCallbackData(
const v8::WeakCallbackData<v8::Object, WeakCallbackDataType>& data)
{
return data.GetParameter();
}
static KeyType* KeyFromWeakCallbackData(
const v8::WeakCallbackData<v8::Object, WeakCallbackDataType>& data)
{
return getInternalField<KeyType, v8DOMWrapperObjectIndex>(data.GetValue());
}
static void Dispose(v8::Isolate* isolate, v8::UniquePersistent<v8::Object> value, KeyType* key) { }
};
v8::Isolate* m_isolate;
typename PersistentValueMapTraits::MapType m_map;
};
} // namespace blink
#endif // DOMWrapperMap_h
|
