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
|
/*
* 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.
*/
#pragma once
#include "MarkingConstraint.h"
#include "MarkingConstraintExecutorPair.h"
#include <wtf/BitVector.h>
#include <wtf/TZoneMalloc.h>
#include <wtf/Vector.h>
namespace JSC {
class Heap;
class MarkingConstraintSolver;
class MarkingConstraintSet {
WTF_MAKE_TZONE_ALLOCATED(MarkingConstraintSet);
WTF_MAKE_NONCOPYABLE(MarkingConstraintSet);
public:
MarkingConstraintSet(Heap&);
~MarkingConstraintSet();
void didStartMarking();
void add(
CString abbreviatedName,
CString name,
MarkingConstraintExecutorPair&&,
ConstraintVolatility,
ConstraintConcurrency = ConstraintConcurrency::Concurrent,
ConstraintParallelism = ConstraintParallelism::Sequential);
void add(
CString abbreviatedName, CString name,
MarkingConstraintExecutorPair&& executors,
ConstraintVolatility volatility,
ConstraintParallelism parallelism)
{
add(abbreviatedName, name, WTFMove(executors), volatility, ConstraintConcurrency::Concurrent, parallelism);
}
void add(std::unique_ptr<MarkingConstraint>);
// The following functions are only used by the real GC via the MarkingConstraintSolver.
// Hence, we only need the SlotVisitor version.
// Assuming that the mark stacks are all empty, this will give you a guess as to whether or
// not the wavefront is advancing.
bool isWavefrontAdvancing(SlotVisitor&);
bool isWavefrontRetreating(SlotVisitor& visitor) { return !isWavefrontAdvancing(visitor); }
// Returns true if this executed all constraints and none of them produced new work. This
// assumes that you've alraedy visited roots and drained from there.
bool executeConvergence(SlotVisitor&);
// This function is only used by the verifier GC via Heap::verifyGC().
// Hence, we only need the AbstractSlotVisitor version.
// Simply runs all constraints without any shenanigans.
void executeAllSynchronously(AbstractSlotVisitor&);
private:
friend class MarkingConstraintSolver;
bool executeConvergenceImpl(SlotVisitor&);
JSC::Heap& m_heap;
BitVector m_unexecutedRoots;
BitVector m_unexecutedOutgrowths;
Vector<std::unique_ptr<MarkingConstraint>> m_set;
Vector<MarkingConstraint*> m_ordered;
Vector<MarkingConstraint*> m_outgrowths;
unsigned m_iteration { 1 };
};
} // namespace JSC
|
