forked from WebKit/WebKit
-
Notifications
You must be signed in to change notification settings - Fork 56
Expand file tree
/
Copy pathMarkingConstraint.cpp
More file actions
114 lines (97 loc) · 4.53 KB
/
Copy pathMarkingConstraint.cpp
File metadata and controls
114 lines (97 loc) · 4.53 KB
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
/*
* Copyright (C) 2017-2023 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 "MarkingConstraint.h"
#include "JSCInlines.h"
#include "VisitCounter.h"
#include <wtf/Atomics.h>
#include <wtf/TZoneMallocInlines.h>
namespace JSC {
static constexpr bool verboseMarkingConstraint = false;
WTF_MAKE_TZONE_ALLOCATED_IMPL(MarkingConstraint);
MarkingConstraint::MarkingConstraint(CString abbreviatedName, CString name, ConstraintVolatility volatility, ConstraintConcurrency concurrency, ConstraintParallelism parallelism)
: m_abbreviatedName(abbreviatedName)
, m_name(WTF::move(name))
, m_volatility(volatility)
, m_concurrency(concurrency)
, m_parallelism(parallelism)
{
}
MarkingConstraint::~MarkingConstraint() = default;
void MarkingConstraint::resetStats()
{
WTF::atomicStore(&m_lastVisitCount, static_cast<size_t>(0), std::memory_order_relaxed);
}
void MarkingConstraint::execute(SlotVisitor& visitor)
{
ASSERT(!visitor.heap()->isMarkingForGCVerifier());
VisitCounter visitCounter(visitor);
executeImpl(visitor);
// m_lastVisitCount is a stats counter feeding workEstimate() heuristics;
// concurrent execute()/doParallelWork() updates are tolerated by design.
// Relaxed atomic RMW makes that well-defined (no lost updates, no UB).
WTF::atomicExchangeAdd(&m_lastVisitCount, visitCounter.visitCount(), std::memory_order_relaxed);
if (verboseMarkingConstraint && visitCounter.visitCount())
dataLog("(", abbreviatedName(), " visited ", visitCounter.visitCount(), " in execute)");
}
void MarkingConstraint::executeSynchronously(AbstractSlotVisitor& visitor)
{
prepareToExecuteImpl(NoLockingNecessary, visitor);
executeImpl(visitor);
}
double MarkingConstraint::quickWorkEstimate(SlotVisitor&)
{
return 0;
}
double MarkingConstraint::workEstimate(SlotVisitor& visitor)
{
return lastVisitCount() + quickWorkEstimate(visitor);
}
void MarkingConstraint::prepareToExecute(const AbstractLocker& constraintSolvingLocker, SlotVisitor& visitor)
{
ASSERT(!visitor.heap()->isMarkingForGCVerifier());
dataLogIf(Options::logGC(), abbreviatedName());
VisitCounter visitCounter(visitor);
prepareToExecuteImpl(constraintSolvingLocker, visitor);
WTF::atomicStore(&m_lastVisitCount, visitCounter.visitCount(), std::memory_order_relaxed);
if (verboseMarkingConstraint && visitCounter.visitCount())
dataLog("(", abbreviatedName(), " visited ", visitCounter.visitCount(), " in prepareToExecute)");
}
void MarkingConstraint::doParallelWork(SlotVisitor& visitor, SharedTask<void(SlotVisitor&)>& task)
{
ASSERT(!visitor.heap()->isMarkingForGCVerifier());
VisitCounter visitCounter(visitor);
task.run(visitor);
if (verboseMarkingConstraint && visitCounter.visitCount())
dataLog("(", abbreviatedName(), " visited ", visitCounter.visitCount(), " in doParallelWork)");
// The relaxed atomic RMW supersedes the m_lock critical section that used
// to guard this add (doParallelWork was m_lock's only user; the member
// stays declared in MarkingConstraint.h pending a header-side pass).
WTF::atomicExchangeAdd(&m_lastVisitCount, visitCounter.visitCount(), std::memory_order_relaxed);
}
void MarkingConstraint::prepareToExecuteImpl(const AbstractLocker&, AbstractSlotVisitor&)
{
}
} // namespace JSC