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
|
/*
* Copyright (C) 2013 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 "SlotVisitor.h"
namespace JSC {
static const bool verbose = false;
CodeBlockSet::CodeBlockSet() { }
CodeBlockSet::~CodeBlockSet()
{
HashSet<CodeBlock*>::iterator iter = m_set.begin();
HashSet<CodeBlock*>::iterator end = m_set.end();
for (; iter != end; ++iter)
(*iter)->deref();
}
void CodeBlockSet::add(PassRefPtr<CodeBlock> codeBlock)
{
CodeBlock* block = codeBlock.leakRef();
bool isNewEntry = m_set.add(block).isNewEntry;
ASSERT_UNUSED(isNewEntry, isNewEntry);
}
void CodeBlockSet::clearMarks()
{
HashSet<CodeBlock*>::iterator iter = m_set.begin();
HashSet<CodeBlock*>::iterator end = m_set.end();
for (; iter != end; ++iter) {
CodeBlock* codeBlock = *iter;
codeBlock->m_mayBeExecuting = false;
codeBlock->m_visitAggregateHasBeenCalled = false;
}
}
void CodeBlockSet::deleteUnmarkedAndUnreferenced()
{
// This needs to be a fixpoint because code blocks that are unmarked may
// refer to each other. For example, a DFG code block that is owned by
// the GC may refer to an FTL for-entry code block that is also owned by
// the GC.
Vector<CodeBlock*, 16> toRemove;
if (verbose)
dataLog("Fixpointing over unmarked, set size = ", m_set.size(), "...\n");
for (;;) {
HashSet<CodeBlock*>::iterator iter = m_set.begin();
HashSet<CodeBlock*>::iterator end = m_set.end();
for (; iter != end; ++iter) {
CodeBlock* codeBlock = *iter;
if (!codeBlock->hasOneRef())
continue;
if (codeBlock->m_mayBeExecuting)
continue;
codeBlock->deref();
toRemove.append(codeBlock);
}
if (verbose)
dataLog(" Removing ", toRemove.size(), " blocks.\n");
if (toRemove.isEmpty())
break;
for (unsigned i = toRemove.size(); i--;)
m_set.remove(toRemove[i]);
toRemove.resize(0);
}
}
void CodeBlockSet::traceMarked(SlotVisitor& visitor)
{
if (verbose)
dataLog("Tracing ", m_set.size(), " code blocks.\n");
HashSet<CodeBlock*>::iterator iter = m_set.begin();
HashSet<CodeBlock*>::iterator end = m_set.end();
for (; iter != end; ++iter) {
CodeBlock* codeBlock = *iter;
if (!codeBlock->m_mayBeExecuting)
continue;
codeBlock->visitAggregate(visitor);
}
}
void CodeBlockSet::rememberCurrentlyExecutingCodeBlocks(Heap* heap)
{
#if ENABLE(GGC)
for (size_t i = 0; i < m_currentlyExecuting.size(); ++i)
heap->addToRememberedSet(m_currentlyExecuting[i]->ownerExecutable());
m_currentlyExecuting.clear();
#else
UNUSED_PARAM(heap);
#endif // ENABLE(GGC)
}
} // namespace JSC
|
