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
|
/*
* Copyright (C) 2018-2023 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. ``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 "MetadataTable.h"
#include "UnlinkedMetadataTable.h"
#include <wtf/FastMalloc.h>
WTF_ALLOW_UNSAFE_BUFFER_USAGE_BEGIN
namespace JSC {
ALWAYS_INLINE UnlinkedMetadataTable::UnlinkedMetadataTable()
: m_hasMetadata(false)
, m_isFinalized(false)
, m_isLinked(false)
, m_is32Bit(false)
, m_rawBuffer(static_cast<uint8_t*>(MetadataTableMalloc::zeroedMalloc(s_offset32TableSize)))
{
}
ALWAYS_INLINE UnlinkedMetadataTable::UnlinkedMetadataTable(bool is32Bit, unsigned numValueProfiles, unsigned lastOffset)
: m_hasMetadata(true)
, m_isFinalized(false)
, m_isLinked(false)
, m_is32Bit(is32Bit)
, m_numValueProfiles(numValueProfiles)
, m_rawBuffer(static_cast<uint8_t*>(MetadataTableMalloc::zeroedMalloc((sizeof(ValueProfile) * numValueProfiles) + sizeof(LinkingData) + lastOffset)))
{
}
ALWAYS_INLINE UnlinkedMetadataTable::UnlinkedMetadataTable(EmptyTag)
: m_hasMetadata(false)
, m_isFinalized(true)
, m_isLinked(false)
, m_is32Bit(false)
, m_rawBuffer(nullptr)
{
}
ALWAYS_INLINE unsigned UnlinkedMetadataTable::addEntry(OpcodeID opcodeID)
{
ASSERT(!m_isFinalized && opcodeID < s_offsetTableEntries - 1);
m_hasMetadata = true;
return preprocessBuffer()[opcodeID]++;
}
ALWAYS_INLINE unsigned UnlinkedMetadataTable::addValueProfile()
{
ASSERT(!m_isFinalized);
m_hasMetadata = true;
// Preinecrement because we want the first value profile's offset to be 1, since it's negative indexed.
return ++m_numValueProfiles;
}
template <typename Bytecode>
ALWAYS_INLINE unsigned UnlinkedMetadataTable::numEntries()
{
constexpr auto opcodeID = Bytecode::opcodeID;
ASSERT(!m_isFinalized && opcodeID < s_offsetTableEntries - 1);
return preprocessBuffer()[opcodeID];
}
ALWAYS_INLINE size_t UnlinkedMetadataTable::sizeInBytesForGC()
{
if (m_isFinalized && !m_hasMetadata)
return 0;
if (m_is32Bit)
return s_offset16TableSize + s_offset32TableSize;
return s_offset16TableSize;
}
ALWAYS_INLINE size_t UnlinkedMetadataTable::sizeInBytesForGC(MetadataTable& metadataTable)
{
ASSERT(m_isFinalized);
// In this case, we return the size of the table minus the offset table,
// which was already accounted for in the UnlinkedCodeBlock.
// Be careful not to touch m_rawBuffer if this metadataTable is not owning it.
// It is possible that, m_rawBuffer is realloced in the other thread while we are accessing here.
size_t result = metadataTable.totalSize();
if (metadataTable.buffer() == buffer()) {
ASSERT(m_isLinked);
if (m_is32Bit)
return result - (s_offset16TableSize + s_offset32TableSize);
return result - s_offset16TableSize;
}
return result;
}
ALWAYS_INLINE RefPtr<MetadataTable> UnlinkedMetadataTable::link()
{
ASSERT(m_isFinalized);
if (!m_hasMetadata)
return nullptr;
unsigned totalSize = this->totalSize();
unsigned offsetTableSize = this->offsetTableSize();
unsigned valueProfileSize = m_numValueProfiles * sizeof(ValueProfile);
uint8_t* buffer;
if (!m_isLinked) {
m_isLinked = true;
buffer = m_rawBuffer;
} else {
#if ENABLE(METADATA_STATISTICS)
MetadataStatistics::numberOfCopiesFromLinking++;
MetadataStatistics::linkingCopyMemory += sizeof(LinkingData) + totalSize;
#endif
buffer = static_cast<uint8_t*>(MetadataTableMalloc::malloc(sizeof(LinkingData) + totalSize));
memcpy(buffer + valueProfileSize + sizeof(LinkingData), m_rawBuffer + valueProfileSize + sizeof(LinkingData), offsetTableSize);
}
// FIXME: Is this needed since we'll clear the data in the CodeBlock Constructor... Plus I could see caching value profiles being profitable.
memset(buffer, 0, valueProfileSize);
memset(buffer + valueProfileSize + sizeof(LinkingData) + offsetTableSize, 0, totalSize - offsetTableSize - valueProfileSize);
return adoptRef(*new (buffer + valueProfileSize + sizeof(LinkingData)) MetadataTable(*this));
}
ALWAYS_INLINE void UnlinkedMetadataTable::unlink(MetadataTable& metadataTable)
{
ASSERT(m_isFinalized);
if (!m_hasMetadata)
return;
if (metadataTable.buffer() == buffer()) {
ASSERT(m_isLinked);
m_isLinked = false;
return;
}
MetadataTableMalloc::free(metadataTable.valueProfilesEnd() + -static_cast<ptrdiff_t>(numValueProfiles()));
}
} // namespace JSC
WTF_ALLOW_UNSAFE_BUFFER_USAGE_END
|
