1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
|
/*
* Copyright (C) 2025 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "MicrotaskQueue.h"
#include "Debugger.h"
#include "DeferTermination.h"
#include "JSCJSValueInlines.h"
#include "JSGlobalObject.h"
#include "JSMicrotask.h"
#include "JSObject.h"
#include "SlotVisitorInlines.h"
#include <wtf/SetForScope.h>
#include <wtf/TZoneMallocInlines.h>
WTF_ALLOW_UNSAFE_BUFFER_USAGE_BEGIN
namespace JSC {
WTF_MAKE_TZONE_ALLOCATED_IMPL(MicrotaskQueue);
WTF_MAKE_COMPACT_TZONE_ALLOCATED_IMPL(MicrotaskDispatcher);
WTF_MAKE_COMPACT_TZONE_ALLOCATED_IMPL(DebuggableMicrotaskDispatcher);
bool QueuedTask::isRunnable() const
{
if (RefPtr dispatcher = m_dispatcher.pointer())
return dispatcher->isRunnable();
return true;
}
QueuedTaskResult DebuggableMicrotaskDispatcher::run(QueuedTask& task)
{
auto* globalObject = task.globalObject();
VM& vm = globalObject->vm();
auto catchScope = DECLARE_CATCH_SCOPE(vm);
auto identifier = task.identifier();
if (auto* debugger = globalObject->debugger(); debugger && identifier) [[unlikely]] {
DeferTerminationForAWhile deferTerminationForAWhile(vm);
debugger->willRunMicrotask(globalObject, identifier.value());
if (!catchScope.clearExceptionExceptTermination()) [[unlikely]]
return QueuedTask::Result::Executed;
}
runInternalMicrotask(globalObject, task.job(), task.arguments());
if (!catchScope.clearExceptionExceptTermination()) [[unlikely]]
return QueuedTask::Result::Executed;
if (auto* debugger = globalObject->debugger(); debugger && identifier) [[unlikely]] {
DeferTerminationForAWhile deferTerminationForAWhile(vm);
debugger->didRunMicrotask(globalObject, identifier.value());
if (!catchScope.clearExceptionExceptTermination()) [[unlikely]]
return QueuedTask::Result::Executed;
}
return QueuedTask::Result::Executed;
}
bool DebuggableMicrotaskDispatcher::isRunnable() const
{
return true;
}
MicrotaskQueue::MicrotaskQueue(VM& vm)
{
vm.m_microtaskQueues.append(this);
}
MicrotaskQueue::~MicrotaskQueue()
{
if (isOnList())
remove();
}
template<typename Visitor>
void MicrotaskQueue::visitAggregateImpl(Visitor& visitor)
{
m_queue.visitAggregate(visitor);
m_toKeep.visitAggregate(visitor);
}
DEFINE_VISIT_AGGREGATE(MicrotaskQueue);
void MicrotaskQueue::enqueue(QueuedTask&& task)
{
auto* globalObject = task.globalObject();
auto identifier = task.identifier();
m_queue.enqueue(WTFMove(task));
if (globalObject) {
if (auto* debugger = globalObject->debugger(); debugger && identifier) [[unlikely]]
debugger->didQueueMicrotask(globalObject, identifier.value());
}
}
bool MarkedMicrotaskDeque::hasMicrotasksForFullyActiveDocument() const
{
for (auto& task : m_queue) {
if (task.isRunnable())
return true;
}
return false;
}
template<typename Visitor>
void MarkedMicrotaskDeque::visitAggregateImpl(Visitor& visitor)
{
// Because content in the queue will not be changed, we need to scan it only once per an entry during one GC cycle.
// We record the previous scan's index, and restart scanning again in CollectorPhase::FixPoint from that.
// When new GC phase begins, this cursor is reset to zero (beginMarking). This optimization is introduced because
// some of application have massive size of MicrotaskQueue depth. For example, in parallel-promises-es2015-native.js
// benchmark, it becomes 251670 at most.
// This cursor is adjusted when an entry is dequeued. And we do not use any locking here, and that's fine: these
// values are read by GC when CollectorPhase::FixPoint and CollectorPhase::Begin, and both suspend the mutator, thus,
// there is no concurrency issue.
for (auto iterator = m_queue.begin() + m_markedBefore, end = m_queue.end(); iterator != end; ++iterator) {
auto& task = *iterator;
visitor.appendUnbarriered(task.m_globalObject);
visitor.appendUnbarriered(task.m_arguments, QueuedTask::maxArguments);
}
m_markedBefore = m_queue.size();
}
DEFINE_VISIT_AGGREGATE(MarkedMicrotaskDeque);
} // namespace JSC
WTF_ALLOW_UNSAFE_BUFFER_USAGE_END
|
