TaskQueue.cpp 2.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100
  1. /*
  2. * Copyright (c) 2021-2024, Andreas Kling <andreas@ladybird.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <LibJS/Heap/MarkedVector.h>
  7. #include <LibWeb/HTML/EventLoop/EventLoop.h>
  8. #include <LibWeb/HTML/EventLoop/TaskQueue.h>
  9. namespace Web::HTML {
  10. JS_DEFINE_ALLOCATOR(TaskQueue);
  11. TaskQueue::TaskQueue(HTML::EventLoop& event_loop)
  12. : m_event_loop(event_loop)
  13. {
  14. }
  15. TaskQueue::~TaskQueue() = default;
  16. void TaskQueue::visit_edges(Visitor& visitor)
  17. {
  18. Base::visit_edges(visitor);
  19. visitor.visit(m_event_loop);
  20. visitor.visit(m_tasks);
  21. }
  22. void TaskQueue::add(JS::NonnullGCPtr<Task> task)
  23. {
  24. m_tasks.append(task);
  25. m_event_loop->schedule();
  26. }
  27. JS::GCPtr<Task> TaskQueue::take_first_runnable()
  28. {
  29. if (m_event_loop->execution_paused())
  30. return nullptr;
  31. for (size_t i = 0; i < m_tasks.size(); ++i) {
  32. if (m_tasks[i]->is_runnable())
  33. return m_tasks.take(i);
  34. }
  35. return nullptr;
  36. }
  37. bool TaskQueue::has_runnable_tasks() const
  38. {
  39. if (m_event_loop->execution_paused())
  40. return false;
  41. for (auto& task : m_tasks) {
  42. if (task->is_runnable())
  43. return true;
  44. }
  45. return false;
  46. }
  47. void TaskQueue::remove_tasks_matching(Function<bool(HTML::Task const&)> filter)
  48. {
  49. m_tasks.remove_all_matching([&](auto& task) {
  50. return filter(*task);
  51. });
  52. }
  53. JS::MarkedVector<JS::NonnullGCPtr<Task>> TaskQueue::take_tasks_matching(Function<bool(HTML::Task const&)> filter)
  54. {
  55. JS::MarkedVector<JS::NonnullGCPtr<Task>> matching_tasks(heap());
  56. for (size_t i = 0; i < m_tasks.size();) {
  57. auto& task = m_tasks.at(i);
  58. if (filter(*task)) {
  59. matching_tasks.append(task);
  60. m_tasks.remove(i);
  61. } else {
  62. ++i;
  63. }
  64. }
  65. return matching_tasks;
  66. }
  67. Task const* TaskQueue::last_added_task() const
  68. {
  69. if (m_tasks.is_empty())
  70. return nullptr;
  71. return m_tasks.last();
  72. }
  73. bool TaskQueue::has_rendering_tasks() const
  74. {
  75. for (auto const& task : m_tasks) {
  76. if (task->source() == Task::Source::Rendering)
  77. return true;
  78. }
  79. return false;
  80. }
  81. }