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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
/* Private maps (hashtables). */
#include "mozilla/MathAlgorithms.h"
#include "mozilla/MemoryReporting.h"
#include "xpcprivate.h"
#include "js/HashTable.h"
using namespace mozilla;
/***************************************************************************/
// static shared...
// Note this is returning the hash of the bit pattern of the first part of the
// nsID, not the hash of the pointer to the nsID.
static PLDHashNumber HashIIDPtrKey(const void* key) {
uintptr_t v;
memcpy(&v, key, sizeof(v));
return HashGeneric(v);
}
static bool MatchIIDPtrKey(const PLDHashEntryHdr* entry, const void* key) {
return ((const nsID*)key)
->Equals(*((const nsID*)((PLDHashEntryStub*)entry)->key));
}
static PLDHashNumber HashNativeKey(const void* data) {
return static_cast<const XPCNativeSetKey*>(data)->Hash();
}
/***************************************************************************/
// implement JSObject2WrappedJSMap...
void JSObject2WrappedJSMap::UpdateWeakPointersAfterGC() {
// Check all wrappers and update their JSObject pointer if it has been
// moved. Release any wrappers whose weakly held JSObject has died.
nsTArray<RefPtr<nsXPCWrappedJS>> dying;
for (auto iter = mTable.modIter(); !iter.done(); iter.next()) {
nsXPCWrappedJS* wrapper = iter.get().value();
MOZ_ASSERT(wrapper, "found a null JS wrapper!");
// Walk the wrapper chain and update all JSObjects.
while (wrapper) {
if (wrapper->IsSubjectToFinalization()) {
wrapper->UpdateObjectPointerAfterGC();
if (!wrapper->GetJSObjectPreserveColor()) {
dying.AppendElement(dont_AddRef(wrapper));
}
}
wrapper = wrapper->GetNextWrapper();
}
// Remove or update the JSObject key in the table if necessary.
JSObject* obj = iter.get().key().unbarrieredGet();
JS_UpdateWeakPointerAfterGCUnbarriered(&obj);
if (!obj) {
iter.remove();
} else {
iter.get().mutableKey() = obj;
}
}
}
void JSObject2WrappedJSMap::ShutdownMarker() {
for (auto iter = mTable.iter(); !iter.done(); iter.next()) {
nsXPCWrappedJS* wrapper = iter.get().value();
MOZ_ASSERT(wrapper, "found a null JS wrapper!");
MOZ_ASSERT(wrapper->IsValid(), "found an invalid JS wrapper!");
wrapper->SystemIsBeingShutDown();
}
}
size_t JSObject2WrappedJSMap::SizeOfIncludingThis(
mozilla::MallocSizeOf mallocSizeOf) const {
size_t n = mallocSizeOf(this);
n += mTable.shallowSizeOfExcludingThis(mallocSizeOf);
return n;
}
size_t JSObject2WrappedJSMap::SizeOfWrappedJS(
mozilla::MallocSizeOf mallocSizeOf) const {
size_t n = 0;
for (auto iter = mTable.iter(); !iter.done(); iter.next()) {
n += iter.get().value()->SizeOfIncludingThis(mallocSizeOf);
}
return n;
}
/***************************************************************************/
// implement Native2WrappedNativeMap...
Native2WrappedNativeMap::Native2WrappedNativeMap()
: mTable(PLDHashTable::StubOps(), sizeof(Entry), XPC_NATIVE_MAP_LENGTH) {}
size_t Native2WrappedNativeMap::SizeOfIncludingThis(
mozilla::MallocSizeOf mallocSizeOf) const {
size_t n = mallocSizeOf(this);
n += mTable.ShallowSizeOfExcludingThis(mallocSizeOf);
for (auto iter = mTable.ConstIter(); !iter.Done(); iter.Next()) {
auto entry = static_cast<Native2WrappedNativeMap::Entry*>(iter.Get());
n += mallocSizeOf(entry->value);
}
return n;
}
/***************************************************************************/
// implement IID2NativeInterfaceMap...
const struct PLDHashTableOps IID2NativeInterfaceMap::Entry::sOps = {
HashIIDPtrKey, MatchIIDPtrKey, PLDHashTable::MoveEntryStub,
PLDHashTable::ClearEntryStub};
IID2NativeInterfaceMap::IID2NativeInterfaceMap()
: mTable(&Entry::sOps, sizeof(Entry), XPC_NATIVE_INTERFACE_MAP_LENGTH) {}
size_t IID2NativeInterfaceMap::SizeOfIncludingThis(
mozilla::MallocSizeOf mallocSizeOf) const {
size_t n = mallocSizeOf(this);
n += mTable.ShallowSizeOfExcludingThis(mallocSizeOf);
for (auto iter = mTable.ConstIter(); !iter.Done(); iter.Next()) {
auto entry = static_cast<IID2NativeInterfaceMap::Entry*>(iter.Get());
n += entry->value->SizeOfIncludingThis(mallocSizeOf);
}
return n;
}
/***************************************************************************/
// implement ClassInfo2NativeSetMap...
// static
bool ClassInfo2NativeSetMap::Entry::Match(const PLDHashEntryHdr* aEntry,
const void* aKey) {
return static_cast<const Entry*>(aEntry)->key == aKey;
}
// static
void ClassInfo2NativeSetMap::Entry::Clear(PLDHashTable* aTable,
PLDHashEntryHdr* aEntry) {
auto entry = static_cast<Entry*>(aEntry);
NS_RELEASE(entry->value);
entry->key = nullptr;
entry->value = nullptr;
}
const PLDHashTableOps ClassInfo2NativeSetMap::Entry::sOps = {
PLDHashTable::HashVoidPtrKeyStub, Match, PLDHashTable::MoveEntryStub, Clear,
nullptr};
ClassInfo2NativeSetMap::ClassInfo2NativeSetMap()
: mTable(&ClassInfo2NativeSetMap::Entry::sOps, sizeof(Entry),
XPC_NATIVE_SET_MAP_LENGTH) {}
size_t ClassInfo2NativeSetMap::ShallowSizeOfIncludingThis(
mozilla::MallocSizeOf mallocSizeOf) {
size_t n = mallocSizeOf(this);
n += mTable.ShallowSizeOfExcludingThis(mallocSizeOf);
return n;
}
/***************************************************************************/
// implement ClassInfo2WrappedNativeProtoMap...
ClassInfo2WrappedNativeProtoMap::ClassInfo2WrappedNativeProtoMap()
: mTable(PLDHashTable::StubOps(), sizeof(Entry),
XPC_NATIVE_PROTO_MAP_LENGTH) {}
size_t ClassInfo2WrappedNativeProtoMap::SizeOfIncludingThis(
mozilla::MallocSizeOf mallocSizeOf) const {
size_t n = mallocSizeOf(this);
n += mTable.ShallowSizeOfExcludingThis(mallocSizeOf);
for (auto iter = mTable.ConstIter(); !iter.Done(); iter.Next()) {
auto entry =
static_cast<ClassInfo2WrappedNativeProtoMap::Entry*>(iter.Get());
n += mallocSizeOf(entry->value);
}
return n;
}
/***************************************************************************/
// implement NativeSetMap...
bool NativeSetMap::Entry::Match(const PLDHashEntryHdr* entry, const void* key) {
auto Key = static_cast<const XPCNativeSetKey*>(key);
XPCNativeSet* SetInTable = ((Entry*)entry)->key_value;
XPCNativeSet* Set = Key->GetBaseSet();
XPCNativeInterface* Addition = Key->GetAddition();
if (!Set) {
// This is a special case to deal with the invariant that says:
// "All sets have exactly one nsISupports interface and it comes first."
// See XPCNativeSet::NewInstance for details.
//
// Though we might have a key that represents only one interface, we
// know that if that one interface were contructed into a set then
// it would end up really being a set with two interfaces (except for
// the case where the one interface happened to be nsISupports).
return (SetInTable->GetInterfaceCount() == 1 &&
SetInTable->GetInterfaceAt(0) == Addition) ||
(SetInTable->GetInterfaceCount() == 2 &&
SetInTable->GetInterfaceAt(1) == Addition);
}
if (!Addition && Set == SetInTable) {
return true;
}
uint16_t count = Set->GetInterfaceCount();
if (count + (Addition ? 1 : 0) != SetInTable->GetInterfaceCount()) {
return false;
}
XPCNativeInterface** CurrentInTable = SetInTable->GetInterfaceArray();
XPCNativeInterface** Current = Set->GetInterfaceArray();
for (uint16_t i = 0; i < count; i++) {
if (*(Current++) != *(CurrentInTable++)) {
return false;
}
}
return !Addition || Addition == *(CurrentInTable++);
}
const struct PLDHashTableOps NativeSetMap::Entry::sOps = {
HashNativeKey, Match, PLDHashTable::MoveEntryStub,
PLDHashTable::ClearEntryStub};
NativeSetMap::NativeSetMap()
: mTable(&Entry::sOps, sizeof(Entry), XPC_NATIVE_SET_MAP_LENGTH) {}
size_t NativeSetMap::SizeOfIncludingThis(
mozilla::MallocSizeOf mallocSizeOf) const {
size_t n = mallocSizeOf(this);
n += mTable.ShallowSizeOfExcludingThis(mallocSizeOf);
for (auto iter = mTable.ConstIter(); !iter.Done(); iter.Next()) {
auto entry = static_cast<NativeSetMap::Entry*>(iter.Get());
n += entry->key_value->SizeOfIncludingThis(mallocSizeOf);
}
return n;
}
/***************************************************************************/
// implement XPCWrappedNativeProtoMap...
XPCWrappedNativeProtoMap::XPCWrappedNativeProtoMap()
: mTable(PLDHashTable::StubOps(), sizeof(PLDHashEntryStub),
XPC_DYING_NATIVE_PROTO_MAP_LENGTH) {}
/***************************************************************************/
|
