Module.cpp 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121
  1. /*
  2. * Copyright (c) 2021, Andreas Kling <kling@serenityos.org>
  3. * Copyright (c) 2022, David Tuin <davidot@serenityos.org>
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include <LibJS/CyclicModule.h>
  8. #include <LibJS/Module.h>
  9. #include <LibJS/Runtime/ModuleNamespaceObject.h>
  10. namespace JS {
  11. Module::Module(Realm& realm, String filename)
  12. : m_realm(realm)
  13. , m_filename(move(filename))
  14. {
  15. }
  16. Module::~Module() = default;
  17. void Module::visit_edges(Cell::Visitor& visitor)
  18. {
  19. Base::visit_edges(visitor);
  20. visitor.visit(m_realm);
  21. visitor.visit(m_environment);
  22. visitor.visit(m_namespace);
  23. }
  24. // 16.2.1.5.1.1 InnerModuleLinking ( module, stack, index ), https://tc39.es/ecma262/#sec-InnerModuleLinking
  25. ThrowCompletionOr<u32> Module::inner_module_linking(VM& vm, Vector<Module*>&, u32 index)
  26. {
  27. // 1. If module is not a Cyclic Module Record, then
  28. // a. Perform ? module.Link().
  29. TRY(link(vm));
  30. // b. Return index.
  31. return index;
  32. }
  33. // 16.2.1.5.2.1 InnerModuleEvaluation ( module, stack, index ), https://tc39.es/ecma262/#sec-innermoduleevaluation
  34. ThrowCompletionOr<u32> Module::inner_module_evaluation(VM& vm, Vector<Module*>&, u32 index)
  35. {
  36. // 1. If module is not a Cyclic Module Record, then
  37. // a. Let promise be ! module.Evaluate().
  38. auto* promise = TRY(evaluate(vm));
  39. // b. Assert: promise.[[PromiseState]] is not pending.
  40. VERIFY(promise->state() != Promise::State::Pending);
  41. // c. If promise.[[PromiseState]] is rejected, then
  42. if (promise->state() == Promise::State::Rejected) {
  43. // i. Return ThrowCompletion(promise.[[PromiseResult]]).
  44. return throw_completion(promise->result());
  45. }
  46. // d. Return index.
  47. return index;
  48. }
  49. // 16.2.1.10 GetModuleNamespace ( module ), https://tc39.es/ecma262/#sec-getmodulenamespace
  50. ThrowCompletionOr<Object*> Module::get_module_namespace(VM& vm)
  51. {
  52. // 1. Assert: If module is a Cyclic Module Record, then module.[[Status]] is not unlinked.
  53. // FIXME: How do we check this without breaking encapsulation?
  54. // 2. Let namespace be module.[[Namespace]].
  55. auto* namespace_ = m_namespace.ptr();
  56. // 3. If namespace is empty, then
  57. if (!namespace_) {
  58. // a. Let exportedNames be ? module.GetExportedNames().
  59. auto exported_names = TRY(get_exported_names(vm));
  60. // b. Let unambiguousNames be a new empty List.
  61. Vector<FlyString> unambiguous_names;
  62. // c. For each element name of exportedNames, do
  63. for (auto& name : exported_names) {
  64. // i. Let resolution be ? module.ResolveExport(name).
  65. auto resolution = TRY(resolve_export(vm, name));
  66. // ii. If resolution is a ResolvedBinding Record, append name to unambiguousNames.
  67. if (resolution.is_valid())
  68. unambiguous_names.append(name);
  69. }
  70. // d. Set namespace to ModuleNamespaceCreate(module, unambiguousNames).
  71. namespace_ = module_namespace_create(vm, unambiguous_names);
  72. VERIFY(m_namespace);
  73. // Note: This set the local variable 'namespace' and not the member variable which is done by ModuleNamespaceCreate
  74. }
  75. // 4. Return namespace.
  76. return namespace_;
  77. }
  78. // 10.4.6.12 ModuleNamespaceCreate ( module, exports ), https://tc39.es/ecma262/#sec-modulenamespacecreate
  79. Object* Module::module_namespace_create(VM& vm, Vector<FlyString> unambiguous_names)
  80. {
  81. auto& realm = this->realm();
  82. // 1. Assert: module.[[Namespace]] is empty.
  83. VERIFY(!m_namespace);
  84. // 2. Let internalSlotsList be the internal slots listed in Table 34.
  85. // 3. Let M be MakeBasicObject(internalSlotsList).
  86. // 4. Set M's essential internal methods to the definitions specified in 10.4.6.
  87. // 5. Set M.[[Module]] to module.
  88. // 6. Let sortedExports be a List whose elements are the elements of exports ordered as if an Array of the same values had been sorted using %Array.prototype.sort% using undefined as comparefn.
  89. // 7. Set M.[[Exports]] to sortedExports.
  90. // 8. Create own properties of M corresponding to the definitions in 28.3.
  91. Object* module_namespace = vm.heap().allocate<ModuleNamespaceObject>(realm, realm, this, move(unambiguous_names));
  92. // 9. Set module.[[Namespace]] to M.
  93. m_namespace = make_handle(module_namespace);
  94. // 10. Return M.
  95. return module_namespace;
  96. }
  97. }