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
|
/*
* Copyright (C) 2013-2015 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. ``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
* 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 "CodeBlockSet.h"
#include "CodeBlock.h"
#include "JSCInlines.h"
#include "SlotVisitor.h"
#include <wtf/CommaPrinter.h>
namespace JSC {
static const bool verbose = false;
CodeBlockSet::CodeBlockSet()
{
}
CodeBlockSet::~CodeBlockSet()
{
}
void CodeBlockSet::add(CodeBlock* codeBlock)
{
LockHolder locker(&m_lock);
bool isNewEntry = m_newCodeBlocks.add(codeBlock).isNewEntry;
ASSERT_UNUSED(isNewEntry, isNewEntry);
}
void CodeBlockSet::promoteYoungCodeBlocks(const LockHolder&)
{
ASSERT(m_lock.isLocked());
m_oldCodeBlocks.add(m_newCodeBlocks.begin(), m_newCodeBlocks.end());
m_newCodeBlocks.clear();
}
void CodeBlockSet::clearMarksForFullCollection()
{
LockHolder locker(&m_lock);
for (CodeBlock* codeBlock : m_oldCodeBlocks)
codeBlock->clearVisitWeaklyHasBeenCalled();
// We promote after we clear marks on the old generation CodeBlocks because
// none of the young generations CodeBlocks need to be cleared.
promoteYoungCodeBlocks(locker);
}
void CodeBlockSet::lastChanceToFinalize()
{
LockHolder locker(&m_lock);
for (CodeBlock* codeBlock : m_newCodeBlocks)
codeBlock->classInfo()->methodTable.destroy(codeBlock);
for (CodeBlock* codeBlock : m_oldCodeBlocks)
codeBlock->classInfo()->methodTable.destroy(codeBlock);
}
void CodeBlockSet::deleteUnmarkedAndUnreferenced(HeapOperation collectionType)
{
LockHolder locker(&m_lock);
HashSet<CodeBlock*>& set = collectionType == EdenCollection ? m_newCodeBlocks : m_oldCodeBlocks;
Vector<CodeBlock*> unmarked;
for (CodeBlock* codeBlock : set) {
if (Heap::isMarked(codeBlock))
continue;
unmarked.append(codeBlock);
}
for (CodeBlock* codeBlock : unmarked) {
codeBlock->classInfo()->methodTable.destroy(codeBlock);
set.remove(codeBlock);
}
// Any remaining young CodeBlocks are live and need to be promoted to the set of old CodeBlocks.
if (collectionType == EdenCollection)
promoteYoungCodeBlocks(locker);
}
bool CodeBlockSet::contains(const LockHolder&, void* candidateCodeBlock)
{
RELEASE_ASSERT(m_lock.isLocked());
CodeBlock* codeBlock = static_cast<CodeBlock*>(candidateCodeBlock);
if (!HashSet<CodeBlock*>::isValidValue(codeBlock))
return false;
return m_oldCodeBlocks.contains(codeBlock) || m_newCodeBlocks.contains(codeBlock) || m_currentlyExecuting.contains(codeBlock);
}
void CodeBlockSet::writeBarrierCurrentlyExecutingCodeBlocks(Heap* heap)
{
LockHolder locker(&m_lock);
if (verbose)
dataLog("Remembering ", m_currentlyExecuting.size(), " code blocks.\n");
for (CodeBlock* codeBlock : m_currentlyExecuting)
heap->writeBarrier(codeBlock);
// It's safe to clear this set because we won't delete the CodeBlocks
// in it until the next GC, and we'll recompute it at that time.
m_currentlyExecuting.clear();
}
void CodeBlockSet::dump(PrintStream& out) const
{
CommaPrinter comma;
out.print("{old = [");
for (CodeBlock* codeBlock : m_oldCodeBlocks)
out.print(comma, pointerDump(codeBlock));
out.print("], new = [");
comma = CommaPrinter();
for (CodeBlock* codeBlock : m_newCodeBlocks)
out.print(comma, pointerDump(codeBlock));
out.print("], currentlyExecuting = [");
comma = CommaPrinter();
for (CodeBlock* codeBlock : m_currentlyExecuting)
out.print(comma, pointerDump(codeBlock));
out.print("]}");
}
} // namespace JSC
|
