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
|
/*
* Copyright (C) 2017 Yusuke Suzuki <utatane.tea@gmail.com>.
*
* 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. ``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
* 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.
*/
#pragma once
#include "HashMapImplInlines.h"
#include "WeakMapImpl.h"
namespace JSC {
ALWAYS_INLINE uint32_t jsWeakMapHash(JSObject* key)
{
return wangsInt64Hash(JSValue::encode(key));
}
ALWAYS_INLINE uint32_t nextCapacityAfterBatchRemoval(uint32_t capacity, uint32_t keyCount)
{
while (shouldShrink(capacity, keyCount))
capacity = nextCapacity(capacity, keyCount);
return capacity;
}
template <typename WeakMapBucket>
ALWAYS_INLINE void WeakMapImpl<WeakMapBucket>::add(VM& vm, JSObject* key, JSValue value)
{
DisallowGC disallowGC;
add(vm, key, value, jsWeakMapHash(key));
}
template <typename WeakMapBucket>
ALWAYS_INLINE void WeakMapImpl<WeakMapBucket>::add(VM& vm, JSObject* key, JSValue value, uint32_t hash)
{
DisallowGC disallowGC;
ASSERT_WITH_MESSAGE(jsWeakMapHash(key) == hash, "We expect hash value is what we expect.");
addInternal(vm, key, value, hash);
if (shouldRehashAfterAdd())
rehash();
}
// Note that this function can be executed in parallel as long as the mutator stops.
template<typename WeakMapBucket>
void WeakMapImpl<WeakMapBucket>::finalizeUnconditionally(VM& vm)
{
auto* buffer = this->buffer();
for (uint32_t index = 0; index < m_capacity; ++index) {
auto* bucket = buffer + index;
if (bucket->isEmpty() || bucket->isDeleted())
continue;
if (vm.heap.isMarked(bucket->key()))
continue;
bucket->makeDeleted();
++m_deleteCount;
RELEASE_ASSERT(m_keyCount > 0);
--m_keyCount;
}
if (shouldShrink())
rehash(RehashMode::RemoveBatching);
}
template<typename WeakMapBucket>
void WeakMapImpl<WeakMapBucket>::rehash(RehashMode mode)
{
// Since shrinking is done just after GC runs (finalizeUnconditionally), WeakMapImpl::rehash()
// function must not touch any GC related features. This is why we do not allocate WeakMapBuffer
// in auxiliary buffer.
// This rehash modifies m_buffer which is not GC-managed buffer. But m_buffer can be touched in
// visitOutputConstraints. Thus, we should guard it with cellLock.
Locker locker { cellLock() };
uint32_t oldCapacity = m_capacity;
MallocPtr<WeakMapBufferType, JSValueMalloc> oldBuffer = WTFMove(m_buffer);
uint32_t capacity = m_capacity;
if (mode == RehashMode::RemoveBatching) {
ASSERT(shouldShrink());
capacity = nextCapacityAfterBatchRemoval(capacity, m_keyCount);
} else
capacity = nextCapacity(capacity, m_keyCount);
makeAndSetNewBuffer(locker, capacity);
auto* buffer = this->buffer();
const uint32_t mask = m_capacity - 1;
for (uint32_t oldIndex = 0; oldIndex < oldCapacity; ++oldIndex) {
auto* entry = oldBuffer->buffer() + oldIndex;
if (entry->isEmpty() || entry->isDeleted())
continue;
uint32_t index = jsWeakMapHash(entry->key()) & mask;
WeakMapBucket* bucket = buffer + index;
while (!bucket->isEmpty()) {
index = (index + 1) & mask;
bucket = buffer + index;
}
bucket->copyFrom(*entry);
}
m_deleteCount = 0;
checkConsistency();
}
template<typename WeakMapBucket>
ALWAYS_INLINE uint32_t WeakMapImpl<WeakMapBucket>::shouldRehashAfterAdd() const
{
return JSC::shouldRehashAfterAdd(m_capacity, m_keyCount, m_deleteCount);
}
} // namespace JSC
|
