HeadersIterator.cpp 2.9 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788
  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"_fly_string, prototype);
  17. }
  18. }
  19. namespace Web::Fetch {
  20. JS_DEFINE_ALLOCATOR(HeadersIterator);
  21. JS::NonnullGCPtr<HeadersIterator> HeadersIterator::create(Headers const& headers, JS::Object::PropertyKind iteration_kind)
  22. {
  23. return headers.heap().allocate<HeadersIterator>(headers.realm(), headers, iteration_kind);
  24. }
  25. HeadersIterator::HeadersIterator(Headers const& headers, JS::Object::PropertyKind iteration_kind)
  26. : PlatformObject(headers.realm())
  27. , m_headers(headers)
  28. , m_iteration_kind(iteration_kind)
  29. {
  30. }
  31. HeadersIterator::~HeadersIterator() = default;
  32. void HeadersIterator::initialize(JS::Realm& realm)
  33. {
  34. Base::initialize(realm);
  35. WEB_SET_PROTOTYPE_FOR_INTERFACE(HeadersIterator);
  36. }
  37. void HeadersIterator::visit_edges(JS::Cell::Visitor& visitor)
  38. {
  39. Base::visit_edges(visitor);
  40. visitor.visit(m_headers);
  41. }
  42. // https://webidl.spec.whatwg.org/#es-iterable, Step 2
  43. JS::ThrowCompletionOr<JS::Object*> HeadersIterator::next()
  44. {
  45. // The value pairs to iterate over are the return value of running sort and combine with this’s header list.
  46. auto value_pairs_to_iterate_over = [&]() -> JS::ThrowCompletionOr<Vector<Fetch::Infrastructure::Header>> {
  47. auto headers_or_error = m_headers->m_header_list->sort_and_combine();
  48. if (headers_or_error.is_error())
  49. return vm().throw_completion<JS::InternalError>(JS::ErrorType::NotEnoughMemoryToAllocate);
  50. return headers_or_error.release_value();
  51. };
  52. auto pairs = TRY(value_pairs_to_iterate_over());
  53. if (m_index >= pairs.size())
  54. return create_iterator_result_object(vm(), JS::js_undefined(), true).ptr();
  55. auto const& pair = pairs[m_index++];
  56. StringView pair_name { pair.name };
  57. StringView pair_value { pair.value };
  58. switch (m_iteration_kind) {
  59. case JS::Object::PropertyKind::Key:
  60. return create_iterator_result_object(vm(), JS::PrimitiveString::create(vm(), pair_name), false).ptr();
  61. case JS::Object::PropertyKind::Value:
  62. return create_iterator_result_object(vm(), JS::PrimitiveString::create(vm(), pair_value), false).ptr();
  63. case JS::Object::PropertyKind::KeyAndValue: {
  64. auto array = JS::Array::create_from(realm(), { JS::PrimitiveString::create(vm(), pair_name), JS::PrimitiveString::create(vm(), pair_value) });
  65. return create_iterator_result_object(vm(), array, false).ptr();
  66. }
  67. default:
  68. VERIFY_NOT_REACHED();
  69. }
  70. }
  71. }