12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091 |
- /*
- * Copyright (c) 2021-2024, Andreas Kling <kling@serenityos.org>
- *
- * SPDX-License-Identifier: BSD-2-Clause
- */
- #include <LibJS/Heap/MarkedVector.h>
- #include <LibWeb/HTML/EventLoop/EventLoop.h>
- #include <LibWeb/HTML/EventLoop/TaskQueue.h>
- namespace Web::HTML {
- JS_DEFINE_ALLOCATOR(TaskQueue);
- TaskQueue::TaskQueue(HTML::EventLoop& event_loop)
- : m_event_loop(event_loop)
- {
- }
- TaskQueue::~TaskQueue() = default;
- void TaskQueue::visit_edges(Visitor& visitor)
- {
- Base::visit_edges(visitor);
- visitor.visit(m_event_loop);
- visitor.visit(m_tasks);
- }
- void TaskQueue::add(JS::NonnullGCPtr<Task> task)
- {
- m_tasks.append(task);
- m_event_loop->schedule();
- }
- JS::GCPtr<Task> TaskQueue::take_first_runnable()
- {
- if (m_event_loop->execution_paused())
- return nullptr;
- for (size_t i = 0; i < m_tasks.size(); ++i) {
- if (m_tasks[i]->is_runnable())
- return m_tasks.take(i);
- }
- return nullptr;
- }
- bool TaskQueue::has_runnable_tasks() const
- {
- if (m_event_loop->execution_paused())
- return false;
- for (auto& task : m_tasks) {
- if (task->is_runnable())
- return true;
- }
- return false;
- }
- void TaskQueue::remove_tasks_matching(Function<bool(HTML::Task const&)> filter)
- {
- m_tasks.remove_all_matching([&](auto& task) {
- return filter(*task);
- });
- }
- JS::MarkedVector<JS::NonnullGCPtr<Task>> TaskQueue::take_tasks_matching(Function<bool(HTML::Task const&)> filter)
- {
- JS::MarkedVector<JS::NonnullGCPtr<Task>> matching_tasks(heap());
- for (size_t i = 0; i < m_tasks.size();) {
- auto& task = m_tasks.at(i);
- if (filter(*task)) {
- matching_tasks.append(task);
- m_tasks.remove(i);
- } else {
- ++i;
- }
- }
- return matching_tasks;
- }
- Task const* TaskQueue::last_added_task() const
- {
- if (m_tasks.is_empty())
- return nullptr;
- return m_tasks.last();
- }
- }
|