CommonImplementations.cpp 39 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849
  1. /*
  2. * Copyright (c) 2021-2023, Andreas Kling <kling@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <LibJS/Bytecode/CommonImplementations.h>
  7. #include <LibJS/Bytecode/Interpreter.h>
  8. #include <LibJS/Bytecode/Op.h>
  9. #include <LibJS/Runtime/Array.h>
  10. #include <LibJS/Runtime/DeclarativeEnvironment.h>
  11. #include <LibJS/Runtime/ECMAScriptFunctionObject.h>
  12. #include <LibJS/Runtime/FunctionEnvironment.h>
  13. #include <LibJS/Runtime/GlobalEnvironment.h>
  14. #include <LibJS/Runtime/NativeFunction.h>
  15. #include <LibJS/Runtime/ObjectEnvironment.h>
  16. #include <LibJS/Runtime/RegExpObject.h>
  17. #include <LibJS/Runtime/TypedArray.h>
  18. #include <LibJS/Runtime/ValueInlines.h>
  19. namespace JS::Bytecode {
  20. // NOTE: This function assumes that the index is valid within the TypedArray,
  21. // and that the TypedArray is not detached.
  22. template<typename T>
  23. inline Value fast_typed_array_get_element(TypedArrayBase& typed_array, u32 index)
  24. {
  25. Checked<u32> offset_into_array_buffer = index;
  26. offset_into_array_buffer *= sizeof(T);
  27. offset_into_array_buffer += typed_array.byte_offset();
  28. if (offset_into_array_buffer.has_overflow()) [[unlikely]] {
  29. return js_undefined();
  30. }
  31. auto const& array_buffer = *typed_array.viewed_array_buffer();
  32. auto const* slot = reinterpret_cast<T const*>(array_buffer.buffer().offset_pointer(offset_into_array_buffer.value()));
  33. return Value { *slot };
  34. }
  35. // NOTE: This function assumes that the index is valid within the TypedArray,
  36. // and that the TypedArray is not detached.
  37. template<typename T>
  38. inline void fast_typed_array_set_element(TypedArrayBase& typed_array, u32 index, T value)
  39. {
  40. Checked<u32> offset_into_array_buffer = index;
  41. offset_into_array_buffer *= sizeof(T);
  42. offset_into_array_buffer += typed_array.byte_offset();
  43. if (offset_into_array_buffer.has_overflow()) [[unlikely]] {
  44. return;
  45. }
  46. auto& array_buffer = *typed_array.viewed_array_buffer();
  47. auto* slot = reinterpret_cast<T*>(array_buffer.buffer().offset_pointer(offset_into_array_buffer.value()));
  48. *slot = value;
  49. }
  50. ThrowCompletionOr<NonnullGCPtr<Object>> base_object_for_get(VM& vm, Value base_value)
  51. {
  52. if (base_value.is_object())
  53. return base_value.as_object();
  54. // OPTIMIZATION: For various primitives we can avoid actually creating a new object for them.
  55. if (base_value.is_string())
  56. return vm.current_realm()->intrinsics().string_prototype();
  57. if (base_value.is_number())
  58. return vm.current_realm()->intrinsics().number_prototype();
  59. if (base_value.is_boolean())
  60. return vm.current_realm()->intrinsics().boolean_prototype();
  61. return base_value.to_object(vm);
  62. }
  63. ThrowCompletionOr<Value> get_by_id(VM& vm, DeprecatedFlyString const& property, Value base_value, Value this_value, PropertyLookupCache& cache)
  64. {
  65. if (base_value.is_string()) {
  66. auto string_value = TRY(base_value.as_string().get(vm, property));
  67. if (string_value.has_value())
  68. return *string_value;
  69. }
  70. auto base_obj = TRY(base_object_for_get(vm, base_value));
  71. // OPTIMIZATION: If the shape of the object hasn't changed, we can use the cached property offset.
  72. auto& shape = base_obj->shape();
  73. if (&shape == cache.shape) {
  74. return base_obj->get_direct(cache.property_offset.value());
  75. }
  76. CacheablePropertyMetadata cacheable_metadata;
  77. auto value = TRY(base_obj->internal_get(property, this_value, &cacheable_metadata));
  78. if (cacheable_metadata.type == CacheablePropertyMetadata::Type::OwnProperty) {
  79. cache.shape = shape;
  80. cache.property_offset = cacheable_metadata.property_offset.value();
  81. }
  82. return value;
  83. }
  84. ThrowCompletionOr<Value> get_by_value(VM& vm, Value base_value, Value property_key_value)
  85. {
  86. // OPTIMIZATION: Fast path for simple Int32 indexes in array-like objects.
  87. if (base_value.is_object() && property_key_value.is_int32() && property_key_value.as_i32() >= 0) {
  88. auto& object = base_value.as_object();
  89. auto index = static_cast<u32>(property_key_value.as_i32());
  90. // For "non-typed arrays":
  91. if (!object.may_interfere_with_indexed_property_access()
  92. && object.indexed_properties().has_index(index)) {
  93. auto value = object.indexed_properties().get(index)->value;
  94. if (!value.is_accessor())
  95. return value;
  96. }
  97. // For typed arrays:
  98. if (object.is_typed_array()) {
  99. auto& typed_array = static_cast<TypedArrayBase&>(object);
  100. auto canonical_index = CanonicalIndex { CanonicalIndex::Type::Index, index };
  101. if (is_valid_integer_index(typed_array, canonical_index)) {
  102. switch (typed_array.kind()) {
  103. case TypedArrayBase::Kind::Uint8Array:
  104. return fast_typed_array_get_element<u8>(typed_array, index);
  105. case TypedArrayBase::Kind::Uint16Array:
  106. return fast_typed_array_get_element<u16>(typed_array, index);
  107. case TypedArrayBase::Kind::Uint32Array:
  108. return fast_typed_array_get_element<u32>(typed_array, index);
  109. case TypedArrayBase::Kind::Int8Array:
  110. return fast_typed_array_get_element<i8>(typed_array, index);
  111. case TypedArrayBase::Kind::Int16Array:
  112. return fast_typed_array_get_element<i16>(typed_array, index);
  113. case TypedArrayBase::Kind::Int32Array:
  114. return fast_typed_array_get_element<i32>(typed_array, index);
  115. case TypedArrayBase::Kind::Uint8ClampedArray:
  116. return fast_typed_array_get_element<u8>(typed_array, index);
  117. default:
  118. // FIXME: Support more TypedArray kinds.
  119. break;
  120. }
  121. }
  122. switch (typed_array.kind()) {
  123. #define __JS_ENUMERATE(ClassName, snake_name, PrototypeName, ConstructorName, Type) \
  124. case TypedArrayBase::Kind::ClassName: \
  125. return typed_array_get_element<Type>(typed_array, canonical_index);
  126. JS_ENUMERATE_TYPED_ARRAYS
  127. #undef __JS_ENUMERATE
  128. }
  129. }
  130. }
  131. auto object = TRY(base_object_for_get(vm, base_value));
  132. auto property_key = TRY(property_key_value.to_property_key(vm));
  133. if (base_value.is_string()) {
  134. auto string_value = TRY(base_value.as_string().get(vm, property_key));
  135. if (string_value.has_value())
  136. return *string_value;
  137. }
  138. return TRY(object->internal_get(property_key, base_value));
  139. }
  140. ThrowCompletionOr<Value> get_global(Bytecode::Interpreter& interpreter, DeprecatedFlyString const& identifier, GlobalVariableCache& cache)
  141. {
  142. auto& vm = interpreter.vm();
  143. auto& realm = *vm.current_realm();
  144. auto& binding_object = realm.global_environment().object_record().binding_object();
  145. auto& declarative_record = realm.global_environment().declarative_record();
  146. // OPTIMIZATION: If the shape of the object hasn't changed, we can use the cached property offset.
  147. auto& shape = binding_object.shape();
  148. if (cache.environment_serial_number == declarative_record.environment_serial_number()
  149. && &shape == cache.shape) {
  150. return binding_object.get_direct(cache.property_offset.value());
  151. }
  152. cache.environment_serial_number = declarative_record.environment_serial_number();
  153. if (vm.running_execution_context().script_or_module.has<NonnullGCPtr<Module>>()) {
  154. // NOTE: GetGlobal is used to access variables stored in the module environment and global environment.
  155. // The module environment is checked first since it precedes the global environment in the environment chain.
  156. auto& module_environment = *vm.running_execution_context().script_or_module.get<NonnullGCPtr<Module>>()->environment();
  157. if (TRY(module_environment.has_binding(identifier))) {
  158. // TODO: Cache offset of binding value
  159. return TRY(module_environment.get_binding_value(vm, identifier, vm.in_strict_mode()));
  160. }
  161. }
  162. if (TRY(declarative_record.has_binding(identifier))) {
  163. // TODO: Cache offset of binding value
  164. return TRY(declarative_record.get_binding_value(vm, identifier, vm.in_strict_mode()));
  165. }
  166. if (TRY(binding_object.has_property(identifier))) {
  167. CacheablePropertyMetadata cacheable_metadata;
  168. auto value = TRY(binding_object.internal_get(identifier, js_undefined(), &cacheable_metadata));
  169. if (cacheable_metadata.type == CacheablePropertyMetadata::Type::OwnProperty) {
  170. cache.shape = shape;
  171. cache.property_offset = cacheable_metadata.property_offset.value();
  172. }
  173. return value;
  174. }
  175. return vm.throw_completion<ReferenceError>(ErrorType::UnknownIdentifier, identifier);
  176. }
  177. ThrowCompletionOr<void> put_by_property_key(VM& vm, Value base, Value this_value, Value value, PropertyKey name, Op::PropertyKind kind, PropertyLookupCache* cache)
  178. {
  179. // Better error message than to_object would give
  180. if (vm.in_strict_mode() && base.is_nullish())
  181. return vm.throw_completion<TypeError>(ErrorType::ReferenceNullishSetProperty, name, base.to_string_without_side_effects());
  182. // a. Let baseObj be ? ToObject(V.[[Base]]).
  183. auto object = TRY(base.to_object(vm));
  184. if (kind == Op::PropertyKind::Getter || kind == Op::PropertyKind::Setter) {
  185. // The generator should only pass us functions for getters and setters.
  186. VERIFY(value.is_function());
  187. }
  188. switch (kind) {
  189. case Op::PropertyKind::Getter: {
  190. auto& function = value.as_function();
  191. if (function.name().is_empty() && is<ECMAScriptFunctionObject>(function))
  192. static_cast<ECMAScriptFunctionObject*>(&function)->set_name(ByteString::formatted("get {}", name));
  193. object->define_direct_accessor(name, &function, nullptr, Attribute::Configurable | Attribute::Enumerable);
  194. break;
  195. }
  196. case Op::PropertyKind::Setter: {
  197. auto& function = value.as_function();
  198. if (function.name().is_empty() && is<ECMAScriptFunctionObject>(function))
  199. static_cast<ECMAScriptFunctionObject*>(&function)->set_name(ByteString::formatted("set {}", name));
  200. object->define_direct_accessor(name, nullptr, &function, Attribute::Configurable | Attribute::Enumerable);
  201. break;
  202. }
  203. case Op::PropertyKind::KeyValue: {
  204. if (cache && cache->shape == &object->shape()) {
  205. object->put_direct(*cache->property_offset, value);
  206. return {};
  207. }
  208. CacheablePropertyMetadata cacheable_metadata;
  209. bool succeeded = TRY(object->internal_set(name, value, this_value, &cacheable_metadata));
  210. if (succeeded && cache && cacheable_metadata.type == CacheablePropertyMetadata::Type::OwnProperty) {
  211. cache->shape = object->shape();
  212. cache->property_offset = cacheable_metadata.property_offset.value();
  213. }
  214. if (!succeeded && vm.in_strict_mode()) {
  215. if (base.is_object())
  216. return vm.throw_completion<TypeError>(ErrorType::ReferenceNullishSetProperty, name, base.to_string_without_side_effects());
  217. return vm.throw_completion<TypeError>(ErrorType::ReferencePrimitiveSetProperty, name, base.typeof(), base.to_string_without_side_effects());
  218. }
  219. break;
  220. }
  221. case Op::PropertyKind::DirectKeyValue:
  222. object->define_direct_property(name, value, Attribute::Enumerable | Attribute::Writable | Attribute::Configurable);
  223. break;
  224. case Op::PropertyKind::Spread:
  225. TRY(object->copy_data_properties(vm, value, {}));
  226. break;
  227. case Op::PropertyKind::ProtoSetter:
  228. if (value.is_object() || value.is_null())
  229. MUST(object->internal_set_prototype_of(value.is_object() ? &value.as_object() : nullptr));
  230. break;
  231. }
  232. return {};
  233. }
  234. ThrowCompletionOr<Value> perform_call(Interpreter& interpreter, Value this_value, Op::CallType call_type, Value callee, ReadonlySpan<Value> argument_values)
  235. {
  236. auto& vm = interpreter.vm();
  237. auto& function = callee.as_function();
  238. Value return_value;
  239. if (call_type == Op::CallType::DirectEval) {
  240. if (callee == interpreter.realm().intrinsics().eval_function())
  241. return_value = TRY(perform_eval(vm, !argument_values.is_empty() ? argument_values[0].value_or(JS::js_undefined()) : js_undefined(), vm.in_strict_mode() ? CallerMode::Strict : CallerMode::NonStrict, EvalMode::Direct));
  242. else
  243. return_value = TRY(JS::call(vm, function, this_value, argument_values));
  244. } else if (call_type == Op::CallType::Call)
  245. return_value = TRY(JS::call(vm, function, this_value, argument_values));
  246. else
  247. return_value = TRY(construct(vm, function, argument_values));
  248. return return_value;
  249. }
  250. static Completion throw_type_error_for_callee(Bytecode::Interpreter& interpreter, Value callee, StringView callee_type, Optional<StringTableIndex> const& expression_string)
  251. {
  252. auto& vm = interpreter.vm();
  253. if (expression_string.has_value())
  254. return vm.throw_completion<TypeError>(ErrorType::IsNotAEvaluatedFrom, callee.to_string_without_side_effects(), callee_type, interpreter.current_executable().get_string(expression_string->value()));
  255. return vm.throw_completion<TypeError>(ErrorType::IsNotA, callee.to_string_without_side_effects(), callee_type);
  256. }
  257. ThrowCompletionOr<void> throw_if_needed_for_call(Interpreter& interpreter, Value callee, Op::CallType call_type, Optional<StringTableIndex> const& expression_string)
  258. {
  259. if ((call_type == Op::CallType::Call || call_type == Op::CallType::DirectEval)
  260. && !callee.is_function())
  261. return throw_type_error_for_callee(interpreter, callee, "function"sv, expression_string);
  262. if (call_type == Op::CallType::Construct && !callee.is_constructor())
  263. return throw_type_error_for_callee(interpreter, callee, "constructor"sv, expression_string);
  264. return {};
  265. }
  266. ThrowCompletionOr<Value> typeof_variable(VM& vm, DeprecatedFlyString const& string)
  267. {
  268. // 1. Let val be the result of evaluating UnaryExpression.
  269. auto reference = TRY(vm.resolve_binding(string));
  270. // 2. If val is a Reference Record, then
  271. // a. If IsUnresolvableReference(val) is true, return "undefined".
  272. if (reference.is_unresolvable())
  273. return PrimitiveString::create(vm, "undefined"_string);
  274. // 3. Set val to ? GetValue(val).
  275. auto value = TRY(reference.get_value(vm));
  276. // 4. NOTE: This step is replaced in section B.3.6.3.
  277. // 5. Return a String according to Table 41.
  278. return PrimitiveString::create(vm, value.typeof());
  279. }
  280. ThrowCompletionOr<void> set_variable(
  281. VM& vm,
  282. DeprecatedFlyString const& name,
  283. Value value,
  284. Op::EnvironmentMode mode,
  285. Op::SetVariable::InitializationMode initialization_mode,
  286. EnvironmentVariableCache& cache)
  287. {
  288. auto environment = mode == Op::EnvironmentMode::Lexical ? vm.running_execution_context().lexical_environment : vm.running_execution_context().variable_environment;
  289. auto reference = TRY(vm.resolve_binding(name, environment));
  290. if (reference.environment_coordinate().has_value())
  291. cache = reference.environment_coordinate();
  292. switch (initialization_mode) {
  293. case Op::SetVariable::InitializationMode::Initialize:
  294. TRY(reference.initialize_referenced_binding(vm, value));
  295. break;
  296. case Op::SetVariable::InitializationMode::Set:
  297. TRY(reference.put_value(vm, value));
  298. break;
  299. }
  300. return {};
  301. }
  302. Value new_function(VM& vm, FunctionExpression const& function_node, Optional<IdentifierTableIndex> const& lhs_name, Optional<Register> const& home_object)
  303. {
  304. Value value;
  305. if (!function_node.has_name()) {
  306. DeprecatedFlyString name = {};
  307. if (lhs_name.has_value())
  308. name = vm.bytecode_interpreter().current_executable().get_identifier(lhs_name.value());
  309. value = function_node.instantiate_ordinary_function_expression(vm, name);
  310. } else {
  311. value = ECMAScriptFunctionObject::create(*vm.current_realm(), function_node.name(), function_node.source_text(), function_node.body(), function_node.parameters(), function_node.function_length(), function_node.local_variables_names(), vm.lexical_environment(), vm.running_execution_context().private_environment, function_node.kind(), function_node.is_strict_mode(), function_node.might_need_arguments_object(), function_node.contains_direct_call_to_eval(), function_node.is_arrow_function());
  312. }
  313. if (home_object.has_value()) {
  314. auto home_object_value = vm.bytecode_interpreter().reg(home_object.value());
  315. static_cast<ECMAScriptFunctionObject&>(value.as_function()).set_home_object(&home_object_value.as_object());
  316. }
  317. return value;
  318. }
  319. ThrowCompletionOr<void> put_by_value(VM& vm, Value base, Value property_key_value, Value value, Op::PropertyKind kind)
  320. {
  321. // OPTIMIZATION: Fast path for simple Int32 indexes in array-like objects.
  322. if ((kind == Op::PropertyKind::KeyValue || kind == Op::PropertyKind::DirectKeyValue)
  323. && base.is_object() && property_key_value.is_int32() && property_key_value.as_i32() >= 0) {
  324. auto& object = base.as_object();
  325. auto* storage = object.indexed_properties().storage();
  326. auto index = static_cast<u32>(property_key_value.as_i32());
  327. // For "non-typed arrays":
  328. if (storage
  329. && storage->is_simple_storage()
  330. && !object.may_interfere_with_indexed_property_access()
  331. && storage->has_index(index)) {
  332. auto existing_value = storage->get(index)->value;
  333. if (!existing_value.is_accessor()) {
  334. storage->put(index, value);
  335. return {};
  336. }
  337. }
  338. // For typed arrays:
  339. if (object.is_typed_array()) {
  340. auto& typed_array = static_cast<TypedArrayBase&>(object);
  341. auto canonical_index = CanonicalIndex { CanonicalIndex::Type::Index, index };
  342. if (value.is_int32() && is_valid_integer_index(typed_array, canonical_index)) {
  343. switch (typed_array.kind()) {
  344. case TypedArrayBase::Kind::Uint8Array:
  345. fast_typed_array_set_element<u8>(typed_array, index, static_cast<u8>(value.as_i32()));
  346. return {};
  347. case TypedArrayBase::Kind::Uint16Array:
  348. fast_typed_array_set_element<u16>(typed_array, index, static_cast<u16>(value.as_i32()));
  349. return {};
  350. case TypedArrayBase::Kind::Uint32Array:
  351. fast_typed_array_set_element<u32>(typed_array, index, static_cast<u32>(value.as_i32()));
  352. return {};
  353. case TypedArrayBase::Kind::Int8Array:
  354. fast_typed_array_set_element<i8>(typed_array, index, static_cast<i8>(value.as_i32()));
  355. return {};
  356. case TypedArrayBase::Kind::Int16Array:
  357. fast_typed_array_set_element<i16>(typed_array, index, static_cast<i16>(value.as_i32()));
  358. return {};
  359. case TypedArrayBase::Kind::Int32Array:
  360. fast_typed_array_set_element<i32>(typed_array, index, value.as_i32());
  361. return {};
  362. case TypedArrayBase::Kind::Uint8ClampedArray:
  363. fast_typed_array_set_element<u8>(typed_array, index, clamp(value.as_i32(), 0, 255));
  364. return {};
  365. default:
  366. // FIXME: Support more TypedArray kinds.
  367. break;
  368. }
  369. }
  370. switch (typed_array.kind()) {
  371. #define __JS_ENUMERATE(ClassName, snake_name, PrototypeName, ConstructorName, Type) \
  372. case TypedArrayBase::Kind::ClassName: \
  373. return typed_array_set_element<Type>(typed_array, canonical_index, value);
  374. JS_ENUMERATE_TYPED_ARRAYS
  375. #undef __JS_ENUMERATE
  376. }
  377. return {};
  378. }
  379. }
  380. auto property_key = kind != Op::PropertyKind::Spread ? TRY(property_key_value.to_property_key(vm)) : PropertyKey {};
  381. TRY(put_by_property_key(vm, base, base, value, property_key, kind));
  382. return {};
  383. }
  384. ThrowCompletionOr<Value> get_variable(Bytecode::Interpreter& interpreter, DeprecatedFlyString const& name, EnvironmentVariableCache& cache)
  385. {
  386. auto& vm = interpreter.vm();
  387. if (cache.has_value()) {
  388. auto environment = vm.running_execution_context().lexical_environment;
  389. for (size_t i = 0; i < cache->hops; ++i)
  390. environment = environment->outer_environment();
  391. VERIFY(environment);
  392. VERIFY(environment->is_declarative_environment());
  393. if (!environment->is_permanently_screwed_by_eval()) {
  394. return TRY(verify_cast<DeclarativeEnvironment>(*environment).get_binding_value_direct(vm, cache.value().index, vm.in_strict_mode()));
  395. }
  396. cache = {};
  397. }
  398. auto reference = TRY(vm.resolve_binding(name));
  399. if (reference.environment_coordinate().has_value())
  400. cache = reference.environment_coordinate();
  401. return TRY(reference.get_value(vm));
  402. }
  403. ThrowCompletionOr<CalleeAndThis> get_callee_and_this_from_environment(Bytecode::Interpreter& interpreter, DeprecatedFlyString const& name, EnvironmentVariableCache& cache)
  404. {
  405. auto& vm = interpreter.vm();
  406. Value callee = js_undefined();
  407. Value this_value = js_undefined();
  408. if (cache.has_value()) {
  409. auto environment = vm.running_execution_context().lexical_environment;
  410. for (size_t i = 0; i < cache->hops; ++i)
  411. environment = environment->outer_environment();
  412. VERIFY(environment);
  413. VERIFY(environment->is_declarative_environment());
  414. if (!environment->is_permanently_screwed_by_eval()) {
  415. callee = TRY(verify_cast<DeclarativeEnvironment>(*environment).get_binding_value_direct(vm, cache.value().index, vm.in_strict_mode()));
  416. this_value = js_undefined();
  417. if (auto base_object = environment->with_base_object())
  418. this_value = base_object;
  419. return CalleeAndThis {
  420. .callee = callee,
  421. .this_value = this_value,
  422. };
  423. }
  424. cache = {};
  425. }
  426. auto reference = TRY(vm.resolve_binding(name));
  427. if (reference.environment_coordinate().has_value())
  428. cache = reference.environment_coordinate();
  429. callee = TRY(reference.get_value(vm));
  430. if (reference.is_property_reference()) {
  431. this_value = reference.get_this_value();
  432. } else {
  433. if (reference.is_environment_reference()) {
  434. if (auto base_object = reference.base_environment().with_base_object(); base_object != nullptr)
  435. this_value = base_object;
  436. }
  437. }
  438. return CalleeAndThis {
  439. .callee = callee,
  440. .this_value = this_value,
  441. };
  442. }
  443. // 13.2.7.3 Runtime Semantics: Evaluation, https://tc39.es/ecma262/#sec-regular-expression-literals-runtime-semantics-evaluation
  444. Value new_regexp(VM& vm, ParsedRegex const& parsed_regex, ByteString const& pattern, ByteString const& flags)
  445. {
  446. // 1. Let pattern be CodePointsToString(BodyText of RegularExpressionLiteral).
  447. // 2. Let flags be CodePointsToString(FlagText of RegularExpressionLiteral).
  448. // 3. Return ! RegExpCreate(pattern, flags).
  449. auto& realm = *vm.current_realm();
  450. Regex<ECMA262> regex(parsed_regex.regex, parsed_regex.pattern, parsed_regex.flags);
  451. // NOTE: We bypass RegExpCreate and subsequently RegExpAlloc as an optimization to use the already parsed values.
  452. auto regexp_object = RegExpObject::create(realm, move(regex), pattern, flags);
  453. // RegExpAlloc has these two steps from the 'Legacy RegExp features' proposal.
  454. regexp_object->set_realm(realm);
  455. // We don't need to check 'If SameValue(newTarget, thisRealm.[[Intrinsics]].[[%RegExp%]]) is true'
  456. // here as we know RegExpCreate calls RegExpAlloc with %RegExp% for newTarget.
  457. regexp_object->set_legacy_features_enabled(true);
  458. return regexp_object;
  459. }
  460. // 13.3.8.1 https://tc39.es/ecma262/#sec-runtime-semantics-argumentlistevaluation
  461. MarkedVector<Value> argument_list_evaluation(VM& vm, Value arguments)
  462. {
  463. // Note: Any spreading and actual evaluation is handled in preceding opcodes
  464. // Note: The spec uses the concept of a list, while we create a temporary array
  465. // in the preceding opcodes, so we have to convert in a manner that is not
  466. // visible to the user
  467. MarkedVector<Value> argument_values { vm.heap() };
  468. auto& argument_array = arguments.as_array();
  469. auto array_length = argument_array.indexed_properties().array_like_size();
  470. argument_values.ensure_capacity(array_length);
  471. for (size_t i = 0; i < array_length; ++i) {
  472. if (auto maybe_value = argument_array.indexed_properties().get(i); maybe_value.has_value())
  473. argument_values.append(maybe_value.release_value().value);
  474. else
  475. argument_values.append(js_undefined());
  476. }
  477. return argument_values;
  478. }
  479. ThrowCompletionOr<void> create_variable(VM& vm, DeprecatedFlyString const& name, Op::EnvironmentMode mode, bool is_global, bool is_immutable, bool is_strict)
  480. {
  481. if (mode == Op::EnvironmentMode::Lexical) {
  482. VERIFY(!is_global);
  483. // Note: This is papering over an issue where "FunctionDeclarationInstantiation" creates these bindings for us.
  484. // Instead of crashing in there, we'll just raise an exception here.
  485. if (TRY(vm.lexical_environment()->has_binding(name)))
  486. return vm.throw_completion<InternalError>(TRY_OR_THROW_OOM(vm, String::formatted("Lexical environment already has binding '{}'", name)));
  487. if (is_immutable)
  488. return vm.lexical_environment()->create_immutable_binding(vm, name, is_strict);
  489. return vm.lexical_environment()->create_mutable_binding(vm, name, is_strict);
  490. }
  491. if (!is_global) {
  492. if (is_immutable)
  493. return vm.variable_environment()->create_immutable_binding(vm, name, is_strict);
  494. return vm.variable_environment()->create_mutable_binding(vm, name, is_strict);
  495. }
  496. // NOTE: CreateVariable with m_is_global set to true is expected to only be used in GlobalDeclarationInstantiation currently, which only uses "false" for "can_be_deleted".
  497. // The only area that sets "can_be_deleted" to true is EvalDeclarationInstantiation, which is currently fully implemented in C++ and not in Bytecode.
  498. return verify_cast<GlobalEnvironment>(vm.variable_environment())->create_global_var_binding(name, false);
  499. }
  500. ThrowCompletionOr<ECMAScriptFunctionObject*> new_class(VM& vm, Value super_class, ClassExpression const& class_expression, Optional<IdentifierTableIndex> const& lhs_name)
  501. {
  502. auto& interpreter = vm.bytecode_interpreter();
  503. auto name = class_expression.name();
  504. // NOTE: NewClass expects classEnv to be active lexical environment
  505. auto* class_environment = vm.lexical_environment();
  506. vm.running_execution_context().lexical_environment = interpreter.saved_lexical_environment_stack().take_last();
  507. DeprecatedFlyString binding_name;
  508. DeprecatedFlyString class_name;
  509. if (!class_expression.has_name() && lhs_name.has_value()) {
  510. class_name = interpreter.current_executable().get_identifier(lhs_name.value());
  511. } else {
  512. binding_name = name;
  513. class_name = name.is_null() ? ""sv : name;
  514. }
  515. return TRY(class_expression.create_class_constructor(vm, class_environment, vm.lexical_environment(), super_class, binding_name, class_name));
  516. }
  517. // 13.3.7.1 Runtime Semantics: Evaluation, https://tc39.es/ecma262/#sec-super-keyword-runtime-semantics-evaluation
  518. ThrowCompletionOr<NonnullGCPtr<Object>> super_call_with_argument_array(VM& vm, Value argument_array, bool is_synthetic)
  519. {
  520. // 1. Let newTarget be GetNewTarget().
  521. auto new_target = vm.get_new_target();
  522. // 2. Assert: Type(newTarget) is Object.
  523. VERIFY(new_target.is_object());
  524. // 3. Let func be GetSuperConstructor().
  525. auto* func = get_super_constructor(vm);
  526. // 4. Let argList be ? ArgumentListEvaluation of Arguments.
  527. MarkedVector<Value> arg_list { vm.heap() };
  528. if (is_synthetic) {
  529. VERIFY(argument_array.is_object() && is<Array>(argument_array.as_object()));
  530. auto const& array_value = static_cast<Array const&>(argument_array.as_object());
  531. auto length = MUST(length_of_array_like(vm, array_value));
  532. for (size_t i = 0; i < length; ++i)
  533. arg_list.append(array_value.get_without_side_effects(PropertyKey { i }));
  534. } else {
  535. arg_list = argument_list_evaluation(vm, argument_array);
  536. }
  537. // 5. If IsConstructor(func) is false, throw a TypeError exception.
  538. if (!Value(func).is_constructor())
  539. return vm.throw_completion<TypeError>(ErrorType::NotAConstructor, "Super constructor");
  540. // 6. Let result be ? Construct(func, argList, newTarget).
  541. auto result = TRY(construct(vm, static_cast<FunctionObject&>(*func), arg_list.span(), &new_target.as_function()));
  542. // 7. Let thisER be GetThisEnvironment().
  543. auto& this_environment = verify_cast<FunctionEnvironment>(*get_this_environment(vm));
  544. // 8. Perform ? thisER.BindThisValue(result).
  545. TRY(this_environment.bind_this_value(vm, result));
  546. // 9. Let F be thisER.[[FunctionObject]].
  547. auto& f = this_environment.function_object();
  548. // 10. Assert: F is an ECMAScript function object.
  549. // NOTE: This is implied by the strong C++ type.
  550. // 11. Perform ? InitializeInstanceElements(result, F).
  551. TRY(result->initialize_instance_elements(f));
  552. // 12. Return result.
  553. return result;
  554. }
  555. ThrowCompletionOr<NonnullGCPtr<Array>> iterator_to_array(VM& vm, Value iterator)
  556. {
  557. auto& iterator_record = verify_cast<IteratorRecord>(iterator.as_object());
  558. auto array = MUST(Array::create(*vm.current_realm(), 0));
  559. size_t index = 0;
  560. while (true) {
  561. auto iterator_result = TRY(iterator_next(vm, iterator_record));
  562. auto complete = TRY(iterator_complete(vm, iterator_result));
  563. if (complete)
  564. return array;
  565. auto value = TRY(iterator_value(vm, iterator_result));
  566. MUST(array->create_data_property_or_throw(index, value));
  567. index++;
  568. }
  569. }
  570. ThrowCompletionOr<void> append(VM& vm, Value lhs, Value rhs, bool is_spread)
  571. {
  572. // Note: This OpCode is used to construct array literals and argument arrays for calls,
  573. // containing at least one spread element,
  574. // Iterating over such a spread element to unpack it has to be visible by
  575. // the user courtesy of
  576. // (1) https://tc39.es/ecma262/#sec-runtime-semantics-arrayaccumulation
  577. // SpreadElement : ... AssignmentExpression
  578. // 1. Let spreadRef be ? Evaluation of AssignmentExpression.
  579. // 2. Let spreadObj be ? GetValue(spreadRef).
  580. // 3. Let iteratorRecord be ? GetIterator(spreadObj).
  581. // 4. Repeat,
  582. // a. Let next be ? IteratorStep(iteratorRecord).
  583. // b. If next is false, return nextIndex.
  584. // c. Let nextValue be ? IteratorValue(next).
  585. // d. Perform ! CreateDataPropertyOrThrow(array, ! ToString(𝔽(nextIndex)), nextValue).
  586. // e. Set nextIndex to nextIndex + 1.
  587. // (2) https://tc39.es/ecma262/#sec-runtime-semantics-argumentlistevaluation
  588. // ArgumentList : ... AssignmentExpression
  589. // 1. Let list be a new empty List.
  590. // 2. Let spreadRef be ? Evaluation of AssignmentExpression.
  591. // 3. Let spreadObj be ? GetValue(spreadRef).
  592. // 4. Let iteratorRecord be ? GetIterator(spreadObj).
  593. // 5. Repeat,
  594. // a. Let next be ? IteratorStep(iteratorRecord).
  595. // b. If next is false, return list.
  596. // c. Let nextArg be ? IteratorValue(next).
  597. // d. Append nextArg to list.
  598. // ArgumentList : ArgumentList , ... AssignmentExpression
  599. // 1. Let precedingArgs be ? ArgumentListEvaluation of ArgumentList.
  600. // 2. Let spreadRef be ? Evaluation of AssignmentExpression.
  601. // 3. Let iteratorRecord be ? GetIterator(? GetValue(spreadRef)).
  602. // 4. Repeat,
  603. // a. Let next be ? IteratorStep(iteratorRecord).
  604. // b. If next is false, return precedingArgs.
  605. // c. Let nextArg be ? IteratorValue(next).
  606. // d. Append nextArg to precedingArgs.
  607. // Note: We know from codegen, that lhs is a plain array with only indexed properties
  608. auto& lhs_array = lhs.as_array();
  609. auto lhs_size = lhs_array.indexed_properties().array_like_size();
  610. if (is_spread) {
  611. // ...rhs
  612. size_t i = lhs_size;
  613. TRY(get_iterator_values(vm, rhs, [&i, &lhs_array](Value iterator_value) -> Optional<Completion> {
  614. lhs_array.indexed_properties().put(i, iterator_value, default_attributes);
  615. ++i;
  616. return {};
  617. }));
  618. } else {
  619. lhs_array.indexed_properties().put(lhs_size, rhs, default_attributes);
  620. }
  621. return {};
  622. }
  623. ThrowCompletionOr<Value> delete_by_id(Bytecode::Interpreter& interpreter, Value base, IdentifierTableIndex property)
  624. {
  625. auto& vm = interpreter.vm();
  626. auto const& identifier = interpreter.current_executable().get_identifier(property);
  627. bool strict = vm.in_strict_mode();
  628. auto reference = Reference { base, identifier, {}, strict };
  629. return TRY(reference.delete_(vm));
  630. }
  631. ThrowCompletionOr<Value> delete_by_value(Bytecode::Interpreter& interpreter, Value base, Value property_key_value)
  632. {
  633. auto& vm = interpreter.vm();
  634. auto property_key = TRY(property_key_value.to_property_key(vm));
  635. bool strict = vm.in_strict_mode();
  636. auto reference = Reference { base, property_key, {}, strict };
  637. return Value(TRY(reference.delete_(vm)));
  638. }
  639. ThrowCompletionOr<Value> delete_by_value_with_this(Bytecode::Interpreter& interpreter, Value base, Value property_key_value, Value this_value)
  640. {
  641. auto& vm = interpreter.vm();
  642. auto property_key = TRY(property_key_value.to_property_key(vm));
  643. bool strict = vm.in_strict_mode();
  644. auto reference = Reference { base, property_key, this_value, strict };
  645. return Value(TRY(reference.delete_(vm)));
  646. }
  647. // 14.7.5.9 EnumerateObjectProperties ( O ), https://tc39.es/ecma262/#sec-enumerate-object-properties
  648. ThrowCompletionOr<Object*> get_object_property_iterator(VM& vm, Value value)
  649. {
  650. // While the spec does provide an algorithm, it allows us to implement it ourselves so long as we meet the following invariants:
  651. // 1- Returned property keys do not include keys that are Symbols
  652. // 2- Properties of the target object may be deleted during enumeration. A property that is deleted before it is processed by the iterator's next method is ignored
  653. // 3- If new properties are added to the target object during enumeration, the newly added properties are not guaranteed to be processed in the active enumeration
  654. // 4- A property name will be returned by the iterator's next method at most once in any enumeration.
  655. // 5- Enumerating the properties of the target object includes enumerating properties of its prototype, and the prototype of the prototype, and so on, recursively;
  656. // but a property of a prototype is not processed if it has the same name as a property that has already been processed by the iterator's next method.
  657. // 6- The values of [[Enumerable]] attributes are not considered when determining if a property of a prototype object has already been processed.
  658. // 7- The enumerable property names of prototype objects must be obtained by invoking EnumerateObjectProperties passing the prototype object as the argument.
  659. // 8- EnumerateObjectProperties must obtain the own property keys of the target object by calling its [[OwnPropertyKeys]] internal method.
  660. // 9- Property attributes of the target object must be obtained by calling its [[GetOwnProperty]] internal method
  661. // Invariant 3 effectively allows the implementation to ignore newly added keys, and we do so (similar to other implementations).
  662. auto object = TRY(value.to_object(vm));
  663. // Note: While the spec doesn't explicitly require these to be ordered, it says that the values should be retrieved via OwnPropertyKeys,
  664. // so we just keep the order consistent anyway.
  665. OrderedHashTable<PropertyKey> properties;
  666. OrderedHashTable<PropertyKey> non_enumerable_properties;
  667. HashTable<NonnullGCPtr<Object>> seen_objects;
  668. // Collect all keys immediately (invariant no. 5)
  669. for (auto object_to_check = GCPtr { object.ptr() }; object_to_check && !seen_objects.contains(*object_to_check); object_to_check = TRY(object_to_check->internal_get_prototype_of())) {
  670. seen_objects.set(*object_to_check);
  671. for (auto& key : TRY(object_to_check->internal_own_property_keys())) {
  672. if (key.is_symbol())
  673. continue;
  674. auto property_key = TRY(PropertyKey::from_value(vm, key));
  675. // If there is a non-enumerable property higher up the prototype chain with the same key,
  676. // we mustn't include this property even if it's enumerable (invariant no. 5 and 6)
  677. if (non_enumerable_properties.contains(property_key))
  678. continue;
  679. if (properties.contains(property_key))
  680. continue;
  681. auto descriptor = TRY(object_to_check->internal_get_own_property(property_key));
  682. if (!*descriptor->enumerable)
  683. non_enumerable_properties.set(move(property_key));
  684. else
  685. properties.set(move(property_key));
  686. }
  687. }
  688. auto& realm = *vm.current_realm();
  689. auto callback = NativeFunction::create(
  690. *vm.current_realm(), [items = move(properties)](VM& vm) mutable -> ThrowCompletionOr<Value> {
  691. auto& realm = *vm.current_realm();
  692. auto iterated_object_value = vm.this_value();
  693. if (!iterated_object_value.is_object())
  694. return vm.throw_completion<InternalError>("Invalid state for GetObjectPropertyIterator.next"sv);
  695. auto& iterated_object = iterated_object_value.as_object();
  696. auto result_object = Object::create(realm, nullptr);
  697. while (true) {
  698. if (items.is_empty()) {
  699. result_object->define_direct_property(vm.names.done, JS::Value(true), default_attributes);
  700. return result_object;
  701. }
  702. auto key = items.take_first();
  703. // If the property is deleted, don't include it (invariant no. 2)
  704. if (!TRY(iterated_object.has_property(key)))
  705. continue;
  706. result_object->define_direct_property(vm.names.done, JS::Value(false), default_attributes);
  707. if (key.is_number())
  708. result_object->define_direct_property(vm.names.value, PrimitiveString::create(vm, TRY_OR_THROW_OOM(vm, String::number(key.as_number()))), default_attributes);
  709. else if (key.is_string())
  710. result_object->define_direct_property(vm.names.value, PrimitiveString::create(vm, key.as_string()), default_attributes);
  711. else
  712. VERIFY_NOT_REACHED(); // We should not have non-string/number keys.
  713. return result_object;
  714. }
  715. },
  716. 1, vm.names.next);
  717. return vm.heap().allocate<IteratorRecord>(realm, realm, object, callback, false).ptr();
  718. }
  719. }