ArrayBuffer.cpp 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  1. /*
  2. * Copyright (c) 2020-2021, Linus Groh <linusg@serenityos.org>
  3. * Copyright (c) 2022, the SerenityOS developers.
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include <LibJS/Runtime/AbstractOperations.h>
  8. #include <LibJS/Runtime/ArrayBuffer.h>
  9. #include <LibJS/Runtime/GlobalObject.h>
  10. namespace JS {
  11. ThrowCompletionOr<ArrayBuffer*> ArrayBuffer::create(GlobalObject& global_object, size_t byte_length)
  12. {
  13. auto buffer = ByteBuffer::create_zeroed(byte_length);
  14. if (buffer.is_error())
  15. return global_object.vm().throw_completion<RangeError>(global_object, ErrorType::NotEnoughMemoryToAllocate, byte_length);
  16. return global_object.heap().allocate<ArrayBuffer>(global_object, buffer.release_value(), *global_object.array_buffer_prototype());
  17. }
  18. ArrayBuffer* ArrayBuffer::create(GlobalObject& global_object, ByteBuffer buffer)
  19. {
  20. return global_object.heap().allocate<ArrayBuffer>(global_object, move(buffer), *global_object.array_buffer_prototype());
  21. }
  22. ArrayBuffer* ArrayBuffer::create(GlobalObject& global_object, ByteBuffer* buffer)
  23. {
  24. return global_object.heap().allocate<ArrayBuffer>(global_object, buffer, *global_object.array_buffer_prototype());
  25. }
  26. ArrayBuffer::ArrayBuffer(ByteBuffer buffer, Object& prototype)
  27. : Object(prototype)
  28. , m_buffer(move(buffer))
  29. , m_detach_key(js_undefined())
  30. {
  31. }
  32. ArrayBuffer::ArrayBuffer(ByteBuffer* buffer, Object& prototype)
  33. : Object(prototype)
  34. , m_buffer(buffer)
  35. , m_detach_key(js_undefined())
  36. {
  37. }
  38. // 1.1.5 IsResizableArrayBuffer ( arrayBuffer ), https://tc39.es/proposal-resizablearraybuffer/#sec-isresizablearraybuffer
  39. bool ArrayBuffer::is_resizable_array_buffer() const
  40. {
  41. // 1. Assert: Type(arrayBuffer) is Object and arrayBuffer has an [[ArrayBufferData]] internal slot.
  42. // 2. If buffer has an [[ArrayBufferMaxByteLength]] internal slot, return true.
  43. // 3. Return false.
  44. return m_max_byte_length.has_value();
  45. }
  46. void ArrayBuffer::visit_edges(Cell::Visitor& visitor)
  47. {
  48. Base::visit_edges(visitor);
  49. visitor.visit(m_detach_key);
  50. }
  51. // 25.1.2.1 AllocateArrayBuffer ( constructor, byteLength ), https://tc39.es/ecma262/#sec-allocatearraybuffer
  52. // 1.1.2 AllocateArrayBuffer ( constructor, byteLength [, maxByteLength ] ), https://tc39.es/proposal-resizablearraybuffer/#sec-allocatearraybuffer
  53. ThrowCompletionOr<ArrayBuffer*> allocate_array_buffer(GlobalObject& global_object, FunctionObject& constructor, size_t byte_length, Optional<size_t> max_byte_length)
  54. {
  55. // 1. Let slots be « [[ArrayBufferData]], [[ArrayBufferByteLength]], [[ArrayBufferDetachKey]] ».
  56. // 2. If maxByteLength is present, append [[ArrayBufferMaxByteLength]] to slots.
  57. // 3. Let obj be ? OrdinaryCreateFromConstructor(constructor, "%ArrayBuffer.prototype%", slots).
  58. auto* obj = TRY(ordinary_create_from_constructor<ArrayBuffer>(global_object, constructor, &GlobalObject::array_buffer_prototype, nullptr));
  59. // 4. Let block be ? CreateByteDataBlock(byteLength).
  60. auto block = ByteBuffer::create_zeroed(byte_length);
  61. if (block.is_error())
  62. return global_object.vm().throw_completion<RangeError>(global_object, ErrorType::NotEnoughMemoryToAllocate, byte_length);
  63. // 5. Set obj.[[ArrayBufferData]] to block.
  64. obj->set_buffer(block.release_value());
  65. // 6. Set obj.[[ArrayBufferByteLength]] to byteLength.
  66. // 7. If maxByteLength is present, then
  67. if (max_byte_length.has_value()) {
  68. // a. Assert: byteLength ≤ maxByteLength.
  69. VERIFY(byte_length <= *max_byte_length);
  70. // b. If it is not possible to create a Data Block block consisting of maxByteLength bytes, throw a RangeError exception.
  71. // c. NOTE: Resizable ArrayBuffers are designed to be implementable with in-place growth. Implementations reserve the right to throw if, for example, virtual memory cannot be reserved up front.
  72. // d. Set obj.[[ArrayBufferMaxByteLength]] to maxByteLength.
  73. obj->set_max_byte_length(*max_byte_length);
  74. }
  75. // 8. Return obj.
  76. return obj;
  77. }
  78. // 25.1.2.4 CloneArrayBuffer ( srcBuffer, srcByteOffset, srcLength, cloneConstructor ), https://tc39.es/ecma262/#sec-clonearraybuffer
  79. ThrowCompletionOr<ArrayBuffer*> clone_array_buffer(GlobalObject& global_object, ArrayBuffer& source_buffer, size_t source_byte_offset, size_t source_length, FunctionObject& clone_constructor)
  80. {
  81. auto& vm = global_object.vm();
  82. // 1. Let targetBuffer be ? AllocateArrayBuffer(cloneConstructor, srcLength).
  83. auto* target_buffer = TRY(allocate_array_buffer(global_object, clone_constructor, source_length));
  84. // 2. If IsDetachedBuffer(srcBuffer) is true, throw a TypeError exception.
  85. if (source_buffer.is_detached())
  86. return vm.throw_completion<TypeError>(global_object, ErrorType::DetachedArrayBuffer);
  87. // 3. Let srcBlock be srcBuffer.[[ArrayBufferData]].
  88. auto& source_block = source_buffer.buffer();
  89. // 4. Let targetBlock be targetBuffer.[[ArrayBufferData]].
  90. auto& target_block = target_buffer->buffer();
  91. // 5. Perform CopyDataBlockBytes(targetBlock, 0, srcBlock, srcByteOffset, srcLength).
  92. // FIXME: This is only correct for ArrayBuffers, once SharedArrayBuffer is implemented, the AO has to be implemented
  93. target_block.overwrite(0, source_block.offset_pointer(source_byte_offset), source_length);
  94. // 6. Return targetBuffer.
  95. return target_buffer;
  96. }
  97. }