ArrayBuffer.cpp 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120
  1. /*
  2. * Copyright (c) 2020-2023, Linus Groh <linusg@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <LibJS/Runtime/AbstractOperations.h>
  7. #include <LibJS/Runtime/ArrayBuffer.h>
  8. #include <LibJS/Runtime/ArrayBufferConstructor.h>
  9. #include <LibJS/Runtime/GlobalObject.h>
  10. namespace JS {
  11. ThrowCompletionOr<NonnullGCPtr<ArrayBuffer>> ArrayBuffer::create(Realm& realm, size_t byte_length)
  12. {
  13. auto buffer = ByteBuffer::create_zeroed(byte_length);
  14. if (buffer.is_error())
  15. return realm.vm().throw_completion<RangeError>(ErrorType::NotEnoughMemoryToAllocate, byte_length);
  16. return MUST_OR_THROW_OOM(realm.heap().allocate<ArrayBuffer>(realm, buffer.release_value(), realm.intrinsics().array_buffer_prototype()));
  17. }
  18. NonnullGCPtr<ArrayBuffer> ArrayBuffer::create(Realm& realm, ByteBuffer buffer)
  19. {
  20. return realm.heap().allocate<ArrayBuffer>(realm, move(buffer), realm.intrinsics().array_buffer_prototype()).release_allocated_value_but_fixme_should_propagate_errors();
  21. }
  22. NonnullGCPtr<ArrayBuffer> ArrayBuffer::create(Realm& realm, ByteBuffer* buffer)
  23. {
  24. return realm.heap().allocate<ArrayBuffer>(realm, buffer, realm.intrinsics().array_buffer_prototype()).release_allocated_value_but_fixme_should_propagate_errors();
  25. }
  26. ArrayBuffer::ArrayBuffer(ByteBuffer buffer, Object& prototype)
  27. : Object(ConstructWithPrototypeTag::Tag, prototype)
  28. , m_buffer(move(buffer))
  29. , m_detach_key(js_undefined())
  30. {
  31. }
  32. ArrayBuffer::ArrayBuffer(ByteBuffer* buffer, Object& prototype)
  33. : Object(ConstructWithPrototypeTag::Tag, prototype)
  34. , m_buffer(buffer)
  35. , m_detach_key(js_undefined())
  36. {
  37. }
  38. void ArrayBuffer::visit_edges(Cell::Visitor& visitor)
  39. {
  40. Base::visit_edges(visitor);
  41. visitor.visit(m_detach_key);
  42. }
  43. // 25.1.2.1 AllocateArrayBuffer ( constructor, byteLength ), https://tc39.es/ecma262/#sec-allocatearraybuffer
  44. ThrowCompletionOr<ArrayBuffer*> allocate_array_buffer(VM& vm, FunctionObject& constructor, size_t byte_length)
  45. {
  46. // 1. Let obj be ? OrdinaryCreateFromConstructor(constructor, "%ArrayBuffer.prototype%", « [[ArrayBufferData]], [[ArrayBufferByteLength]], [[ArrayBufferDetachKey]] »).
  47. auto obj = TRY(ordinary_create_from_constructor<ArrayBuffer>(vm, constructor, &Intrinsics::array_buffer_prototype, nullptr));
  48. // 2. Let block be ? CreateByteDataBlock(byteLength).
  49. auto block = ByteBuffer::create_zeroed(byte_length);
  50. if (block.is_error())
  51. return vm.throw_completion<RangeError>(ErrorType::NotEnoughMemoryToAllocate, byte_length);
  52. // 3. Set obj.[[ArrayBufferData]] to block.
  53. obj->set_buffer(block.release_value());
  54. // 4. Set obj.[[ArrayBufferByteLength]] to byteLength.
  55. // 5. Return obj.
  56. return obj.ptr();
  57. }
  58. // 25.1.2.3 DetachArrayBuffer ( arrayBuffer [ , key ] ), https://tc39.es/ecma262/#sec-detacharraybuffer
  59. ThrowCompletionOr<void> detach_array_buffer(VM& vm, ArrayBuffer& array_buffer, Optional<Value> key)
  60. {
  61. // 1. Assert: IsSharedArrayBuffer(arrayBuffer) is false.
  62. // FIXME: Check for shared buffer
  63. // 2. If key is not present, set key to undefined.
  64. if (!key.has_value())
  65. key = js_undefined();
  66. // 3. If SameValue(arrayBuffer.[[ArrayBufferDetachKey]], key) is false, throw a TypeError exception.
  67. if (!same_value(array_buffer.detach_key(), *key))
  68. return vm.throw_completion<TypeError>(ErrorType::DetachKeyMismatch, *key, array_buffer.detach_key());
  69. // 4. Set arrayBuffer.[[ArrayBufferData]] to null.
  70. // 5. Set arrayBuffer.[[ArrayBufferByteLength]] to 0.
  71. array_buffer.detach_buffer();
  72. // 6. Return unused.
  73. return {};
  74. }
  75. // 25.1.2.4 CloneArrayBuffer ( srcBuffer, srcByteOffset, srcLength, cloneConstructor ), https://tc39.es/ecma262/#sec-clonearraybuffer
  76. ThrowCompletionOr<ArrayBuffer*> clone_array_buffer(VM& vm, ArrayBuffer& source_buffer, size_t source_byte_offset, size_t source_length)
  77. {
  78. auto& realm = *vm.current_realm();
  79. // 1. Assert: IsDetachedBuffer(srcBuffer) is false.
  80. VERIFY(!source_buffer.is_detached());
  81. // 2. Let targetBuffer be ? AllocateArrayBuffer(%ArrayBuffer%, srcLength).
  82. auto* target_buffer = TRY(allocate_array_buffer(vm, realm.intrinsics().array_buffer_constructor(), source_length));
  83. // 3. Let srcBlock be srcBuffer.[[ArrayBufferData]].
  84. auto& source_block = source_buffer.buffer();
  85. // 4. Let targetBlock be targetBuffer.[[ArrayBufferData]].
  86. auto& target_block = target_buffer->buffer();
  87. // 5. Perform CopyDataBlockBytes(targetBlock, 0, srcBlock, srcByteOffset, srcLength).
  88. // FIXME: This is only correct for ArrayBuffers, once SharedArrayBuffer is implemented, the AO has to be implemented
  89. target_block.overwrite(0, source_block.offset_pointer(source_byte_offset), source_length);
  90. // 6. Return targetBuffer.
  91. return target_buffer;
  92. }
  93. }