FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
WebKit/Source/JavaScriptCore/runtime/ArrayBufferView.h at main · WebKit/WebKit · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
WebKit
/
WebKit
Public
Notifications
You must be signed in to change notification settings
Fork
2.1k
Star
10.1k
Code
Pull requests
2.6k
Actions
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
WebKit
/
Source
/
JavaScriptCore
/
runtime
/
ArrayBufferView.h
Copy path
More file actions
More file actions
Latest commit
History
History
History
273 lines (226 loc) · 9.47 KB
Breadcrumbs
WebKit
/
Source
/
JavaScriptCore
/
runtime
/
ArrayBufferView.h
Copy path
File metadata and controls
273 lines (226 loc) · 9.47 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
/*
* Copyright (C) 2009-2021 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
<
JavaScriptCore/ArrayBuffer.h
>
#
include
<
JavaScriptCore/TypedArrayType.h
>
#
include
<
algorithm
>
#
include
<
limits.h
>
#
include
<
wtf/CheckedArithmetic.h
>
#
include
<
wtf/NoVirtualDestructorBase.h
>
#
include
<
wtf/RefCounted.h
>
#
include
<
wtf/RefPtr.h
>
WTF_ALLOW_UNSAFE_BUFFER_USAGE_BEGIN
namespace
JSC
{
class
JSArrayBufferView
;
class
JSGlobalObject
;
class
CallFrame
;
class
ArrayBufferView
:
public
RefCounted
<ArrayBufferView>, public NoVirtualDestructorBase {
public:
TypedArrayType
getType
()
const
{
return
m_type; }
bool
isDetached
()
const
{
return
!m_buffer || m_buffer->
isDetached
();
}
RefPtr<ArrayBuffer>
possiblySharedBuffer
()
const
{
if
(
isDetached
())
return
nullptr
;
return
m_buffer;
}
RefPtr<ArrayBuffer>
unsharedBuffer
()
const
{
RefPtr<ArrayBuffer> result =
possiblySharedBuffer
();
RELEASE_ASSERT
(!result->
isShared
());
return
result;
}
bool
isShared
()
const
{
if
(
isDetached
())
return
false
;
return
m_buffer->
isShared
();
}
void
*
baseAddress
()
const
LIFETIME_BOUND
{
if
(
isDetached
())
return
nullptr
;
return
m_baseAddress.
getMayBeNull
();
}
void
*
data
()
const
LIFETIME_BOUND {
return
baseAddress
(); }
std::span<
const
uint8_t
>
span
()
const
LIFETIME_BOUND {
return
{
static_cast
<
const
uint8_t
*>(
data
()),
byteLength
() }; }
std::span<
uint8_t
>
mutableSpan
()
const
LIFETIME_BOUND {
return
{
static_cast
<
uint8_t
*>(
data
()),
byteLength
() }; }
Vector<
uint8_t
>
toVector
()
const
{
return
span
(); }
size_t
byteOffsetRaw
()
const
{
return
m_byteOffset; }
size_t
byteOffset
()
const
{
if
(
isDetached
())
[[unlikely]]
return
0
;
if
(!
isResizableOrGrowableShared
())
[[likely]]
return
byteOffsetRaw
();
size_t
bufferByteLength = m_buffer->
byteLength
(std::memory_order_seq_cst);
size_t
byteOffsetStart =
byteOffsetRaw
();
size_t
byteOffsetEnd =
0
;
if
(
isAutoLength
())
byteOffsetEnd = bufferByteLength;
else
byteOffsetEnd = byteOffsetStart +
byteLengthRaw
();
if
(byteOffsetStart > bufferByteLength || byteOffsetEnd > bufferByteLength)
[[unlikely]]
return
0
;
return
byteOffsetRaw
();
}
size_t
byteLengthRaw
()
const
{
return
m_byteLength; }
size_t
byteLength
()
const
{
if
(
isDetached
())
[[unlikely]]
return
0
;
if
(!
isResizableOrGrowableShared
())
[[likely]]
return
byteLengthRaw
();
size_t
bufferByteLength = m_buffer->
byteLength
(std::memory_order_seq_cst);
size_t
byteOffsetStart =
byteOffsetRaw
();
size_t
byteOffsetEnd =
0
;
if
(
isAutoLength
())
byteOffsetEnd = bufferByteLength;
else
byteOffsetEnd = byteOffsetStart +
byteLengthRaw
();
if
(byteOffsetStart > bufferByteLength || byteOffsetEnd > bufferByteLength)
[[unlikely]]
return
0
;
if
(!
isAutoLength
())
return
byteLengthRaw
();
return
roundDownToMultipleOf
(
JSC::elementSize
(m_type), bufferByteLength - byteOffsetStart);
}
JS_EXPORT_PRIVATE
void
NODELETE
setDetachable
(
bool
);
bool
isDetachable
()
const
{
return
m_isDetachable; }
bool
isResizableOrGrowableShared
()
const
{
return
m_isResizableNonShared || m_isGrowableShared; }
bool
isResizableNonShared
()
const
{
return
m_isResizableNonShared; }
bool
isGrowableShared
()
const
{
return
m_isGrowableShared; }
bool
isAutoLength
()
const
{
return
m_isAutoLength; }
inline
~ArrayBufferView
();
//
Helper to verify byte offset is size aligned.
static
bool
verifyByteOffsetAlignment
(
size_t
byteOffset,
size_t
elementSize)
{
return
!(byteOffset & (elementSize -
1
));
}
//
Helper to verify that a given sub-range of an ArrayBuffer is within range.
static
bool
verifySubRangeLength
(
size_t
byteLength,
size_t
byteOffset,
size_t
numElements,
unsigned
elementSize)
{
if
(byteOffset > byteLength)
return
false
;
size_t
remainingElements = (byteLength - byteOffset) /
static_cast
<
size_t
>(elementSize);
if
(numElements > remainingElements)
return
false
;
return
true
;
}
JS_EXPORT_PRIVATE
JSArrayBufferView*
wrap
(JSGlobalObject* lexicalGlobalObject, JSGlobalObject* globalObject);
JS_EXPORT_PRIVATE
void
operator
delete
(ArrayBufferView*, std::
destroying_delete_t
);
protected:
JS_EXPORT_PRIVATE
ArrayBufferView
(TypedArrayType, RefPtr<ArrayBuffer>&&,
size_t
byteOffset, std::optional<
size_t
> byteLength);
inline
bool
setImpl
(ArrayBufferView*,
size_t
byteOffset);
inline
bool
setRangeImpl
(
const
void
* data,
size_t
dataByteLength,
size_t
byteOffset);
inline
bool
getRangeImpl
(
void
* destination,
size_t
dataByteLength,
size_t
byteOffset);
inline
bool
zeroRangeImpl
(
size_t
byteOffset,
size_t
rangeByteLength);
//
Input offset is in number of elements from this array's view;
//
output offset is in number of bytes from the underlying buffer's view.
template
<
typename
T>
static
void
clampOffsetAndNumElements
(
const
ArrayBuffer& buffer,
size_t
arrayByteOffset,
size_t
*offset,
size_t
*numElements)
{
size_t
byteLength = buffer.
byteLength
();
size_t
maxOffset = (std::numeric_limits<
size_t
>::
max
() - arrayByteOffset) /
sizeof
(T);
if
(*offset > maxOffset) {
*offset = byteLength;
*numElements =
0
;
return
;
}
CheckedSize adjustedOffset = *offset;
adjustedOffset *=
sizeof
(T);
adjustedOffset += arrayByteOffset;
if
(adjustedOffset.
hasOverflowed
() || adjustedOffset.
value
() > byteLength)
*offset = byteLength;
else
*offset = adjustedOffset.
value
();
size_t
remainingElements = (byteLength - *offset) /
sizeof
(T);
*numElements =
std::min
(remainingElements, *numElements);
}
TypedArrayType m_type { TypedArrayType::NotTypedArray };
bool
m_isDetachable {
true
};
bool
m_isResizableNonShared :
1
{
false
};
bool
m_isGrowableShared :
1
{
false
};
bool
m_isAutoLength :
1
{
false
};
size_t
m_byteOffset;
size_t
m_byteLength;
using
BaseAddress = CagedPtr<Gigacage::Primitive,
void
>;
//
This is the address of the ArrayBuffer's storage, plus the byte offset.
BaseAddress m_baseAddress;
private:
friend
class
ArrayBuffer
;
template
<
typename
Visitor>
constexpr
decltype
(
auto
) visitDerived(Visitor&&);
template
<
typename
Visitor>
constexpr
decltype
(
auto
) visitDerived(Visitor&&)
const
;
RefPtr<ArrayBuffer> m_buffer;
};
ArrayBufferView::~ArrayBufferView
()
{
if
(!m_isDetachable)
m_buffer->
unpin
();
}
bool
ArrayBufferView::setImpl
(ArrayBufferView* array,
size_t
byteOffset)
{
size_t
byteLength =
this
->
byteLength
();
size_t
arrayByteLength = array->
byteLength
();
if
(!
isSumSmallerThanOrEqual
(byteOffset, arrayByteLength, byteLength))
return
false
;
uint8_t
* base =
static_cast
<
uint8_t
*>(
baseAddress
());
memmove
(base + byteOffset, array->
baseAddress
(), arrayByteLength);
return
true
;
}
bool
ArrayBufferView::setRangeImpl
(
const
void
* data,
size_t
dataByteLength,
size_t
byteOffset)
{
size_t
byteLength =
this
->
byteLength
();
if
(!
isSumSmallerThanOrEqual
(byteOffset, dataByteLength, byteLength))
return
false
;
uint8_t
* base =
static_cast
<
uint8_t
*>(
baseAddress
());
memmove
(base + byteOffset, data, dataByteLength);
return
true
;
}
bool
ArrayBufferView::getRangeImpl
(
void
* destination,
size_t
dataByteLength,
size_t
byteOffset)
{
if
(!
isSumSmallerThanOrEqual
(byteOffset, dataByteLength,
byteLength
()))
return
false
;
const
uint8_t
* base =
static_cast
<
const
uint8_t
*>(
baseAddress
());
memmove
(destination, base + byteOffset, dataByteLength);
return
true
;
}
bool
ArrayBufferView::zeroRangeImpl
(
size_t
byteOffset,
size_t
rangeByteLength)
{
if
(!
isSumSmallerThanOrEqual
(byteOffset, rangeByteLength,
byteLength
()))
return
false
;
uint8_t
* base =
static_cast
<
uint8_t
*>(
baseAddress
());
memset
(base + byteOffset,
0
, rangeByteLength);
return
true
;
}
}
//
namespace JSC
using
JSC
::ArrayBufferView;
WTF_ALLOW_UNSAFE_BUFFER_USAGE_END
Back
|
FazBrowse Home
|
New Git URL