HeadersIterator.cpp 2.9 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586
  1. /*
  2. * Copyright (c) 2022, Linus Groh <linusg@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <LibJS/Runtime/Array.h>
  7. #include <LibJS/Runtime/Iterator.h>
  8. #include <LibWeb/Bindings/HeadersIteratorPrototype.h>
  9. #include <LibWeb/Bindings/Intrinsics.h>
  10. #include <LibWeb/Fetch/HeadersIterator.h>
  11. namespace Web::Bindings {
  12. template<>
  13. void Intrinsics::create_web_prototype_and_constructor<HeadersIteratorPrototype>(JS::Realm& realm)
  14. {
  15. auto prototype = heap().allocate<HeadersIteratorPrototype>(realm, realm);
  16. m_prototypes.set("HeadersIterator"sv, prototype);
  17. }
  18. }
  19. namespace Web::Fetch {
  20. JS::NonnullGCPtr<HeadersIterator> HeadersIterator::create(Headers const& headers, JS::Object::PropertyKind iteration_kind)
  21. {
  22. return headers.heap().allocate<HeadersIterator>(headers.realm(), headers, iteration_kind);
  23. }
  24. HeadersIterator::HeadersIterator(Headers const& headers, JS::Object::PropertyKind iteration_kind)
  25. : PlatformObject(headers.realm())
  26. , m_headers(headers)
  27. , m_iteration_kind(iteration_kind)
  28. {
  29. }
  30. HeadersIterator::~HeadersIterator() = default;
  31. void HeadersIterator::initialize(JS::Realm& realm)
  32. {
  33. Base::initialize(realm);
  34. set_prototype(&Bindings::ensure_web_prototype<Bindings::HeadersIteratorPrototype>(realm, "HeadersIterator"));
  35. }
  36. void HeadersIterator::visit_edges(JS::Cell::Visitor& visitor)
  37. {
  38. Base::visit_edges(visitor);
  39. visitor.visit(m_headers);
  40. }
  41. // https://webidl.spec.whatwg.org/#es-iterable, Step 2
  42. JS::ThrowCompletionOr<JS::Object*> HeadersIterator::next()
  43. {
  44. // The value pairs to iterate over are the return value of running sort and combine with this’s header list.
  45. auto value_pairs_to_iterate_over = [&]() -> JS::ThrowCompletionOr<Vector<Fetch::Infrastructure::Header>> {
  46. auto headers_or_error = m_headers->m_header_list->sort_and_combine();
  47. if (headers_or_error.is_error())
  48. return vm().throw_completion<JS::InternalError>(JS::ErrorType::NotEnoughMemoryToAllocate);
  49. return headers_or_error.release_value();
  50. };
  51. auto pairs = TRY(value_pairs_to_iterate_over());
  52. if (m_index >= pairs.size())
  53. return create_iterator_result_object(vm(), JS::js_undefined(), true).ptr();
  54. auto const& pair = pairs[m_index++];
  55. StringView pair_name { pair.name };
  56. StringView pair_value { pair.value };
  57. switch (m_iteration_kind) {
  58. case JS::Object::PropertyKind::Key:
  59. return create_iterator_result_object(vm(), JS::PrimitiveString::create(vm(), pair_name), false).ptr();
  60. case JS::Object::PropertyKind::Value:
  61. return create_iterator_result_object(vm(), JS::PrimitiveString::create(vm(), pair_value), false).ptr();
  62. case JS::Object::PropertyKind::KeyAndValue: {
  63. auto array = JS::Array::create_from(realm(), { JS::PrimitiveString::create(vm(), pair_name), JS::PrimitiveString::create(vm(), pair_value) });
  64. return create_iterator_result_object(vm(), array, false).ptr();
  65. }
  66. default:
  67. VERIFY_NOT_REACHED();
  68. }
  69. }
  70. }