CommonImplementations.cpp 35 KB

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