SessionHistoryTraversalQueue.cpp 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
  1. /*
  2. * Copyright (c) 2024, Aliaksandr Kalenik <kalenik.aliaksandr@gmail.com>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <LibWeb/HTML/Navigable.h>
  7. #include <LibWeb/HTML/SessionHistoryTraversalQueue.h>
  8. namespace Web::HTML {
  9. JS_DEFINE_ALLOCATOR(SessionHistoryTraversalQueue);
  10. JS_DEFINE_ALLOCATOR(SessionHistoryTraversalQueueEntry);
  11. JS::NonnullGCPtr<SessionHistoryTraversalQueueEntry> SessionHistoryTraversalQueueEntry::create(JS::VM& vm, Function<void()> steps, JS::GCPtr<HTML::Navigable> target_navigable)
  12. {
  13. return vm.heap().allocate_without_realm<SessionHistoryTraversalQueueEntry>(JS::create_heap_function(vm.heap(), move(steps)), target_navigable);
  14. }
  15. void SessionHistoryTraversalQueueEntry::visit_edges(JS::Cell::Visitor& visitor)
  16. {
  17. Base::visit_edges(visitor);
  18. visitor.visit(m_steps);
  19. visitor.visit(m_target_navigable);
  20. }
  21. SessionHistoryTraversalQueue::SessionHistoryTraversalQueue()
  22. {
  23. m_timer = Core::Timer::create_single_shot(0, [this] {
  24. if (m_is_task_running && m_queue.size() > 0) {
  25. m_timer->start();
  26. return;
  27. }
  28. while (m_queue.size() > 0) {
  29. m_is_task_running = true;
  30. auto entry = m_queue.take_first();
  31. entry->execute_steps();
  32. m_is_task_running = false;
  33. }
  34. }).release_value_but_fixme_should_propagate_errors();
  35. }
  36. void SessionHistoryTraversalQueue::visit_edges(JS::Cell::Visitor& visitor)
  37. {
  38. Base::visit_edges(visitor);
  39. for (auto const& entry : m_queue) {
  40. visitor.visit(entry);
  41. }
  42. }
  43. void SessionHistoryTraversalQueue::append(Function<void()> steps)
  44. {
  45. m_queue.append(SessionHistoryTraversalQueueEntry::create(vm(), move(steps), nullptr));
  46. if (!m_timer->is_active()) {
  47. m_timer->start();
  48. }
  49. }
  50. void SessionHistoryTraversalQueue::append_sync(Function<void()> steps, JS::GCPtr<Navigable> target_navigable)
  51. {
  52. m_queue.append(SessionHistoryTraversalQueueEntry::create(vm(), move(steps), target_navigable));
  53. if (!m_timer->is_active()) {
  54. m_timer->start();
  55. }
  56. }
  57. // https://html.spec.whatwg.org/multipage/browsing-the-web.html#sync-navigations-jump-queue
  58. JS::GCPtr<SessionHistoryTraversalQueueEntry> SessionHistoryTraversalQueue::first_synchronous_navigation_steps_with_target_navigable_not_contained_in(Vector<JS::GCPtr<Navigable>> const& list)
  59. {
  60. auto index = m_queue.find_first_index_if([&list](auto const& entry) -> bool {
  61. return (entry->target_navigable() != nullptr) && !list.contains_slow(entry->target_navigable());
  62. });
  63. if (index.has_value())
  64. return m_queue.take(*index);
  65. return {};
  66. }
  67. }