ArrayBuffer.h 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231
  1. /*
  2. * Copyright (c) 2020-2022, Linus Groh <linusg@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #pragma once
  7. #include <AK/ByteBuffer.h>
  8. #include <AK/Function.h>
  9. #include <AK/Variant.h>
  10. #include <LibJS/Runtime/Completion.h>
  11. #include <LibJS/Runtime/GlobalObject.h>
  12. #include <LibJS/Runtime/Object.h>
  13. namespace JS {
  14. struct ClampedU8 {
  15. };
  16. // 25.1.1 Notation (read-modify-write modification function), https://tc39.es/ecma262/#sec-arraybuffer-notation
  17. using ReadWriteModifyFunction = Function<ByteBuffer(ByteBuffer, ByteBuffer)>;
  18. class ArrayBuffer : public Object {
  19. JS_OBJECT(ArrayBuffer, Object);
  20. public:
  21. static ThrowCompletionOr<ArrayBuffer*> create(Realm&, size_t);
  22. static ArrayBuffer* create(Realm&, ByteBuffer);
  23. static ArrayBuffer* create(Realm&, ByteBuffer*);
  24. ArrayBuffer(ByteBuffer buffer, Object& prototype);
  25. ArrayBuffer(ByteBuffer* buffer, Object& prototype);
  26. virtual ~ArrayBuffer() override = default;
  27. size_t byte_length() const { return buffer_impl().size(); }
  28. ByteBuffer& buffer() { return buffer_impl(); }
  29. ByteBuffer const& buffer() const { return buffer_impl(); }
  30. // Used by allocate_array_buffer() to attach the data block after construction
  31. void set_buffer(ByteBuffer buffer) { m_buffer = move(buffer); }
  32. Value detach_key() const { return m_detach_key; }
  33. void set_detach_key(Value detach_key) { m_detach_key = detach_key; }
  34. void detach_buffer() { m_buffer = Empty {}; }
  35. bool is_detached() const { return m_buffer.has<Empty>(); }
  36. enum Order {
  37. SeqCst,
  38. Unordered
  39. };
  40. template<typename type>
  41. Value get_value(size_t byte_index, bool is_typed_array, Order, bool is_little_endian = true);
  42. template<typename type>
  43. void set_value(size_t byte_index, Value value, bool is_typed_array, Order, bool is_little_endian = true);
  44. template<typename T>
  45. Value get_modify_set_value(size_t byte_index, Value value, ReadWriteModifyFunction operation, bool is_little_endian = true);
  46. private:
  47. virtual void visit_edges(Visitor&) override;
  48. ByteBuffer& buffer_impl()
  49. {
  50. ByteBuffer* ptr { nullptr };
  51. m_buffer.visit([&](Empty) { VERIFY_NOT_REACHED(); }, [&](auto* pointer) { ptr = pointer; }, [&](auto& value) { ptr = &value; });
  52. return *ptr;
  53. }
  54. ByteBuffer const& buffer_impl() const { return const_cast<ArrayBuffer*>(this)->buffer_impl(); }
  55. Variant<Empty, ByteBuffer, ByteBuffer*> m_buffer;
  56. // The various detach related members of ArrayBuffer are not used by any ECMA262 functionality,
  57. // but are required to be available for the use of various harnesses like the Test262 test runner.
  58. Value m_detach_key;
  59. };
  60. ThrowCompletionOr<ArrayBuffer*> allocate_array_buffer(VM&, FunctionObject& constructor, size_t byte_length);
  61. ThrowCompletionOr<void> detach_array_buffer(VM&, ArrayBuffer& array_buffer, Optional<Value> key = {});
  62. ThrowCompletionOr<ArrayBuffer*> clone_array_buffer(VM&, ArrayBuffer& source_buffer, size_t source_byte_offset, size_t source_length);
  63. // 25.1.2.9 RawBytesToNumeric ( type, rawBytes, isLittleEndian ), https://tc39.es/ecma262/#sec-rawbytestonumeric
  64. template<typename T>
  65. static Value raw_bytes_to_numeric(VM& vm, ByteBuffer raw_value, bool is_little_endian)
  66. {
  67. if (!is_little_endian) {
  68. VERIFY(raw_value.size() % 2 == 0);
  69. for (size_t i = 0; i < raw_value.size() / 2; ++i)
  70. swap(raw_value[i], raw_value[raw_value.size() - 1 - i]);
  71. }
  72. using UnderlyingBufferDataType = Conditional<IsSame<ClampedU8, T>, u8, T>;
  73. if constexpr (IsSame<UnderlyingBufferDataType, float>) {
  74. float value;
  75. raw_value.span().copy_to({ &value, sizeof(float) });
  76. if (isnan(value))
  77. return js_nan();
  78. return Value(value);
  79. }
  80. if constexpr (IsSame<UnderlyingBufferDataType, double>) {
  81. double value;
  82. raw_value.span().copy_to({ &value, sizeof(double) });
  83. if (isnan(value))
  84. return js_nan();
  85. return Value(value);
  86. }
  87. if constexpr (!IsIntegral<UnderlyingBufferDataType>)
  88. VERIFY_NOT_REACHED();
  89. UnderlyingBufferDataType int_value = 0;
  90. raw_value.span().copy_to({ &int_value, sizeof(UnderlyingBufferDataType) });
  91. if constexpr (sizeof(UnderlyingBufferDataType) == 8) {
  92. if constexpr (IsSigned<UnderlyingBufferDataType>)
  93. return js_bigint(vm, Crypto::SignedBigInteger::create_from(int_value));
  94. else
  95. return js_bigint(vm, Crypto::SignedBigInteger { Crypto::UnsignedBigInteger::create_from(int_value) });
  96. } else {
  97. return Value(int_value);
  98. }
  99. }
  100. // Implementation for 25.1.2.10 GetValueFromBuffer, used in TypedArray<T>::get_value_from_buffer().
  101. template<typename T>
  102. Value ArrayBuffer::get_value(size_t byte_index, [[maybe_unused]] bool is_typed_array, Order, bool is_little_endian)
  103. {
  104. auto& vm = this->vm();
  105. auto element_size = sizeof(T);
  106. // FIXME: Check for shared buffer
  107. // FIXME: Propagate errors.
  108. auto raw_value = MUST(buffer_impl().slice(byte_index, element_size));
  109. return raw_bytes_to_numeric<T>(vm, move(raw_value), is_little_endian);
  110. }
  111. // 25.1.2.11 NumericToRawBytes ( type, value, isLittleEndian ), https://tc39.es/ecma262/#sec-numerictorawbytes
  112. template<typename T>
  113. static ByteBuffer numeric_to_raw_bytes(VM& vm, Value value, bool is_little_endian)
  114. {
  115. VERIFY(value.is_number() || value.is_bigint());
  116. using UnderlyingBufferDataType = Conditional<IsSame<ClampedU8, T>, u8, T>;
  117. ByteBuffer raw_bytes = ByteBuffer::create_uninitialized(sizeof(UnderlyingBufferDataType)).release_value_but_fixme_should_propagate_errors(); // FIXME: Handle possible OOM situation.
  118. auto flip_if_needed = [&]() {
  119. if (is_little_endian)
  120. return;
  121. VERIFY(sizeof(UnderlyingBufferDataType) % 2 == 0);
  122. for (size_t i = 0; i < sizeof(UnderlyingBufferDataType) / 2; ++i)
  123. swap(raw_bytes[i], raw_bytes[sizeof(UnderlyingBufferDataType) - 1 - i]);
  124. };
  125. if constexpr (IsSame<UnderlyingBufferDataType, float>) {
  126. float raw_value = MUST(value.to_double(vm));
  127. ReadonlyBytes { &raw_value, sizeof(float) }.copy_to(raw_bytes);
  128. flip_if_needed();
  129. return raw_bytes;
  130. }
  131. if constexpr (IsSame<UnderlyingBufferDataType, double>) {
  132. double raw_value = MUST(value.to_double(vm));
  133. ReadonlyBytes { &raw_value, sizeof(double) }.copy_to(raw_bytes);
  134. flip_if_needed();
  135. return raw_bytes;
  136. }
  137. if constexpr (!IsIntegral<UnderlyingBufferDataType>)
  138. VERIFY_NOT_REACHED();
  139. if constexpr (sizeof(UnderlyingBufferDataType) == 8) {
  140. UnderlyingBufferDataType int_value;
  141. if constexpr (IsSigned<UnderlyingBufferDataType>)
  142. int_value = MUST(value.to_bigint_int64(vm));
  143. else
  144. int_value = MUST(value.to_bigint_uint64(vm));
  145. ReadonlyBytes { &int_value, sizeof(UnderlyingBufferDataType) }.copy_to(raw_bytes);
  146. flip_if_needed();
  147. return raw_bytes;
  148. } else {
  149. UnderlyingBufferDataType int_value;
  150. if constexpr (IsSigned<UnderlyingBufferDataType>) {
  151. if constexpr (sizeof(UnderlyingBufferDataType) == 4)
  152. int_value = MUST(value.to_i32(vm));
  153. else if constexpr (sizeof(UnderlyingBufferDataType) == 2)
  154. int_value = MUST(value.to_i16(vm));
  155. else
  156. int_value = MUST(value.to_i8(vm));
  157. } else {
  158. if constexpr (sizeof(UnderlyingBufferDataType) == 4)
  159. int_value = MUST(value.to_u32(vm));
  160. else if constexpr (sizeof(UnderlyingBufferDataType) == 2)
  161. int_value = MUST(value.to_u16(vm));
  162. else if constexpr (!IsSame<T, ClampedU8>)
  163. int_value = MUST(value.to_u8(vm));
  164. else
  165. int_value = MUST(value.to_u8_clamp(vm));
  166. }
  167. ReadonlyBytes { &int_value, sizeof(UnderlyingBufferDataType) }.copy_to(raw_bytes);
  168. if constexpr (sizeof(UnderlyingBufferDataType) % 2 == 0)
  169. flip_if_needed();
  170. return raw_bytes;
  171. }
  172. }
  173. // 25.1.2.12 SetValueInBuffer ( arrayBuffer, byteIndex, type, value, isTypedArray, order [ , isLittleEndian ] ), https://tc39.es/ecma262/#sec-setvalueinbuffer
  174. template<typename T>
  175. void ArrayBuffer::set_value(size_t byte_index, Value value, [[maybe_unused]] bool is_typed_array, Order, bool is_little_endian)
  176. {
  177. auto& vm = this->vm();
  178. auto raw_bytes = numeric_to_raw_bytes<T>(vm, value, is_little_endian);
  179. // FIXME: Check for shared buffer
  180. raw_bytes.span().copy_to(buffer_impl().span().slice(byte_index));
  181. }
  182. // 25.1.2.13 GetModifySetValueInBuffer ( arrayBuffer, byteIndex, type, value, op [ , isLittleEndian ] ), https://tc39.es/ecma262/#sec-getmodifysetvalueinbuffer
  183. template<typename T>
  184. Value ArrayBuffer::get_modify_set_value(size_t byte_index, Value value, ReadWriteModifyFunction operation, bool is_little_endian)
  185. {
  186. auto& vm = this->vm();
  187. auto raw_bytes = numeric_to_raw_bytes<T>(vm, value, is_little_endian);
  188. // FIXME: Check for shared buffer
  189. // FIXME: Propagate errors.
  190. auto raw_bytes_read = MUST(buffer_impl().slice(byte_index, sizeof(T)));
  191. auto raw_bytes_modified = operation(raw_bytes_read, raw_bytes);
  192. raw_bytes_modified.span().copy_to(buffer_impl().span().slice(byte_index));
  193. return raw_bytes_to_numeric<T>(vm, raw_bytes_read, is_little_endian);
  194. }
  195. }