2020-12-02 20:49:31 +00:00
|
|
|
/*
|
2022-05-02 20:54:39 +02:00
|
|
|
* Copyright (c) 2020-2022, Linus Groh <linusg@serenityos.org>
|
2020-12-02 20:49:31 +00:00
|
|
|
*
|
2021-04-22 01:24:48 -07:00
|
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
2020-12-02 20:49:31 +00:00
|
|
|
*/
|
|
|
|
|
2021-10-09 12:31:13 +01:00
|
|
|
#include <LibJS/Runtime/AbstractOperations.h>
|
2020-12-02 20:49:31 +00:00
|
|
|
#include <LibJS/Runtime/ArrayBuffer.h>
|
2022-04-15 11:39:17 -04:00
|
|
|
#include <LibJS/Runtime/ArrayBufferConstructor.h>
|
2020-12-02 20:49:31 +00:00
|
|
|
#include <LibJS/Runtime/GlobalObject.h>
|
|
|
|
|
|
|
|
namespace JS {
|
|
|
|
|
2022-08-16 00:20:49 +01:00
|
|
|
ThrowCompletionOr<ArrayBuffer*> ArrayBuffer::create(Realm& realm, size_t byte_length)
|
2020-12-02 20:49:31 +00:00
|
|
|
{
|
2021-10-09 12:31:13 +01:00
|
|
|
auto buffer = ByteBuffer::create_zeroed(byte_length);
|
2022-02-07 13:34:32 +01:00
|
|
|
if (buffer.is_error())
|
2022-08-16 20:33:17 +01:00
|
|
|
return realm.vm().throw_completion<RangeError>(ErrorType::NotEnoughMemoryToAllocate, byte_length);
|
2022-02-07 13:34:32 +01:00
|
|
|
|
2022-08-16 00:20:50 +01:00
|
|
|
return realm.heap().allocate<ArrayBuffer>(realm, buffer.release_value(), *realm.global_object().array_buffer_prototype());
|
2020-12-02 20:49:31 +00:00
|
|
|
}
|
|
|
|
|
2022-08-16 00:20:49 +01:00
|
|
|
ArrayBuffer* ArrayBuffer::create(Realm& realm, ByteBuffer buffer)
|
2021-12-13 22:05:42 +00:00
|
|
|
{
|
2022-08-16 00:20:50 +01:00
|
|
|
return realm.heap().allocate<ArrayBuffer>(realm, move(buffer), *realm.global_object().array_buffer_prototype());
|
2021-12-13 22:05:42 +00:00
|
|
|
}
|
|
|
|
|
2022-08-16 00:20:49 +01:00
|
|
|
ArrayBuffer* ArrayBuffer::create(Realm& realm, ByteBuffer* buffer)
|
2021-05-17 21:39:31 +04:30
|
|
|
{
|
2022-08-16 00:20:50 +01:00
|
|
|
return realm.heap().allocate<ArrayBuffer>(realm, buffer, *realm.global_object().array_buffer_prototype());
|
2021-05-17 21:39:31 +04:30
|
|
|
}
|
|
|
|
|
2021-09-05 14:43:15 +04:30
|
|
|
ArrayBuffer::ArrayBuffer(ByteBuffer buffer, Object& prototype)
|
2020-12-02 20:49:31 +00:00
|
|
|
: Object(prototype)
|
2021-09-05 14:43:15 +04:30
|
|
|
, m_buffer(move(buffer))
|
2021-06-10 22:44:17 +03:00
|
|
|
, m_detach_key(js_undefined())
|
2020-12-02 20:49:31 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2021-05-17 21:39:31 +04:30
|
|
|
ArrayBuffer::ArrayBuffer(ByteBuffer* buffer, Object& prototype)
|
|
|
|
: Object(prototype)
|
|
|
|
, m_buffer(buffer)
|
2021-06-10 22:44:17 +03:00
|
|
|
, m_detach_key(js_undefined())
|
2021-05-17 21:39:31 +04:30
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2021-06-11 00:59:24 +03:00
|
|
|
void ArrayBuffer::visit_edges(Cell::Visitor& visitor)
|
|
|
|
{
|
2021-09-11 14:05:12 +02:00
|
|
|
Base::visit_edges(visitor);
|
2021-06-11 00:59:24 +03:00
|
|
|
visitor.visit(m_detach_key);
|
|
|
|
}
|
|
|
|
|
2021-10-09 12:31:13 +01:00
|
|
|
// 25.1.2.1 AllocateArrayBuffer ( constructor, byteLength ), https://tc39.es/ecma262/#sec-allocatearraybuffer
|
2022-08-21 17:25:31 +01:00
|
|
|
ThrowCompletionOr<ArrayBuffer*> allocate_array_buffer(VM& vm, FunctionObject& constructor, size_t byte_length)
|
2021-10-09 12:31:13 +01:00
|
|
|
{
|
2022-07-06 14:19:20 +02:00
|
|
|
// 1. Let obj be ? OrdinaryCreateFromConstructor(constructor, "%ArrayBuffer.prototype%", « [[ArrayBufferData]], [[ArrayBufferByteLength]], [[ArrayBufferDetachKey]] »).
|
2022-08-21 19:24:32 +01:00
|
|
|
auto* obj = TRY(ordinary_create_from_constructor<ArrayBuffer>(vm, constructor, &GlobalObject::array_buffer_prototype, nullptr));
|
2021-10-09 12:31:13 +01:00
|
|
|
|
2022-07-06 14:19:20 +02:00
|
|
|
// 2. Let block be ? CreateByteDataBlock(byteLength).
|
2021-10-09 12:31:13 +01:00
|
|
|
auto block = ByteBuffer::create_zeroed(byte_length);
|
2022-01-20 17:47:39 +00:00
|
|
|
if (block.is_error())
|
2022-08-21 17:25:31 +01:00
|
|
|
return vm.throw_completion<RangeError>(ErrorType::NotEnoughMemoryToAllocate, byte_length);
|
2021-10-09 12:31:13 +01:00
|
|
|
|
2022-07-06 14:19:20 +02:00
|
|
|
// 3. Set obj.[[ArrayBufferData]] to block.
|
2022-01-20 17:47:39 +00:00
|
|
|
obj->set_buffer(block.release_value());
|
2021-10-09 12:31:13 +01:00
|
|
|
|
2022-07-06 14:19:20 +02:00
|
|
|
// 4. Set obj.[[ArrayBufferByteLength]] to byteLength.
|
2021-10-09 12:31:13 +01:00
|
|
|
|
2022-07-06 14:19:20 +02:00
|
|
|
// 5. Return obj.
|
2021-10-09 12:31:13 +01:00
|
|
|
return obj;
|
|
|
|
}
|
|
|
|
|
2022-04-07 13:03:08 -04:00
|
|
|
// 25.1.2.3 DetachArrayBuffer ( arrayBuffer [ , key ] ), https://tc39.es/ecma262/#sec-detacharraybuffer
|
2022-08-21 17:25:31 +01:00
|
|
|
ThrowCompletionOr<void> detach_array_buffer(VM& vm, ArrayBuffer& array_buffer, Optional<Value> key)
|
2022-04-07 13:03:08 -04:00
|
|
|
{
|
|
|
|
// 1. Assert: IsSharedArrayBuffer(arrayBuffer) is false.
|
|
|
|
// FIXME: Check for shared buffer
|
|
|
|
|
|
|
|
// 2. If key is not present, set key to undefined.
|
|
|
|
if (!key.has_value())
|
|
|
|
key = js_undefined();
|
|
|
|
|
|
|
|
// 3. If SameValue(arrayBuffer.[[ArrayBufferDetachKey]], key) is false, throw a TypeError exception.
|
|
|
|
if (!same_value(array_buffer.detach_key(), *key))
|
2022-08-16 20:33:17 +01:00
|
|
|
return vm.throw_completion<TypeError>(ErrorType::DetachKeyMismatch, *key, array_buffer.detach_key());
|
2022-04-07 13:03:08 -04:00
|
|
|
|
|
|
|
// 4. Set arrayBuffer.[[ArrayBufferData]] to null.
|
|
|
|
// 5. Set arrayBuffer.[[ArrayBufferByteLength]] to 0.
|
|
|
|
array_buffer.detach_buffer();
|
|
|
|
|
|
|
|
// 6. Return unused.
|
2022-05-02 20:54:39 +02:00
|
|
|
return {};
|
2022-04-07 13:03:08 -04:00
|
|
|
}
|
|
|
|
|
2022-02-08 21:36:48 +02:00
|
|
|
// 25.1.2.4 CloneArrayBuffer ( srcBuffer, srcByteOffset, srcLength, cloneConstructor ), https://tc39.es/ecma262/#sec-clonearraybuffer
|
2022-08-21 17:25:31 +01:00
|
|
|
ThrowCompletionOr<ArrayBuffer*> clone_array_buffer(VM& vm, ArrayBuffer& source_buffer, size_t source_byte_offset, size_t source_length)
|
2022-02-08 21:36:48 +02:00
|
|
|
{
|
2022-08-21 17:25:31 +01:00
|
|
|
auto& realm = *vm.current_realm();
|
|
|
|
|
2022-04-15 11:39:17 -04:00
|
|
|
// 1. Assert: IsDetachedBuffer(srcBuffer) is false.
|
|
|
|
VERIFY(!source_buffer.is_detached());
|
2022-02-08 21:36:48 +02:00
|
|
|
|
2022-04-15 11:39:17 -04:00
|
|
|
// 2. Let targetBuffer be ? AllocateArrayBuffer(%ArrayBuffer%, srcLength).
|
2022-08-21 17:25:31 +01:00
|
|
|
auto* target_buffer = TRY(allocate_array_buffer(vm, *realm.global_object().array_buffer_constructor(), source_length));
|
2022-02-08 21:36:48 +02:00
|
|
|
|
|
|
|
// 3. Let srcBlock be srcBuffer.[[ArrayBufferData]].
|
|
|
|
auto& source_block = source_buffer.buffer();
|
|
|
|
|
|
|
|
// 4. Let targetBlock be targetBuffer.[[ArrayBufferData]].
|
|
|
|
auto& target_block = target_buffer->buffer();
|
|
|
|
|
|
|
|
// 5. Perform CopyDataBlockBytes(targetBlock, 0, srcBlock, srcByteOffset, srcLength).
|
|
|
|
// FIXME: This is only correct for ArrayBuffers, once SharedArrayBuffer is implemented, the AO has to be implemented
|
|
|
|
target_block.overwrite(0, source_block.offset_pointer(source_byte_offset), source_length);
|
|
|
|
|
|
|
|
// 6. Return targetBuffer.
|
|
|
|
return target_buffer;
|
|
|
|
}
|
|
|
|
|
2020-12-02 20:49:31 +00:00
|
|
|
}
|