]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * Copyright (C) 2011 Apple Inc. All rights reserved. | |
3 | * | |
4 | * Redistribution and use in source and binary forms, with or without | |
5 | * modification, are permitted provided that the following conditions | |
6 | * are met: | |
7 | * 1. Redistributions of source code must retain the above copyright | |
8 | * notice, this list of conditions and the following disclaimer. | |
9 | * 2. Redistributions in binary form must reproduce the above copyright | |
10 | * notice, this list of conditions and the following disclaimer in the | |
11 | * documentation and/or other materials provided with the distribution. | |
12 | * | |
13 | * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY | |
14 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
15 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | |
16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR | |
17 | * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | |
18 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | |
19 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | |
20 | * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | |
21 | * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
22 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
23 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
24 | */ | |
25 | ||
26 | #include "config.h" | |
27 | #include "DFGCodeBlocks.h" | |
28 | ||
29 | #include "CodeBlock.h" | |
30 | #include "SlotVisitor.h" | |
31 | #include <wtf/Vector.h> | |
32 | ||
33 | namespace JSC { | |
34 | ||
35 | #if ENABLE(DFG_JIT) | |
36 | ||
37 | DFGCodeBlocks::DFGCodeBlocks() { } | |
38 | ||
39 | DFGCodeBlocks::~DFGCodeBlocks() | |
40 | { | |
41 | Vector<CodeBlock*, 16> toRemove; | |
42 | ||
43 | for (HashSet<CodeBlock*>::iterator iter = m_set.begin(); iter != m_set.end(); ++iter) { | |
44 | if ((*iter)->m_dfgData->isJettisoned) | |
45 | toRemove.append(*iter); | |
46 | } | |
47 | ||
48 | WTF::deleteAllValues(toRemove); | |
49 | } | |
50 | ||
51 | void DFGCodeBlocks::jettison(PassOwnPtr<CodeBlock> codeBlockPtr) | |
52 | { | |
53 | // We don't want to delete it now; we just want its pointer. | |
54 | CodeBlock* codeBlock = codeBlockPtr.leakPtr(); | |
55 | ||
56 | ASSERT(codeBlock); | |
57 | ASSERT(codeBlock->getJITType() == JITCode::DFGJIT); | |
58 | ||
59 | // It should not have already been jettisoned. | |
60 | ASSERT(!codeBlock->m_dfgData->isJettisoned); | |
61 | ||
62 | // We should have this block already. | |
63 | ASSERT(m_set.find(codeBlock) != m_set.end()); | |
64 | ||
65 | codeBlock->m_dfgData->isJettisoned = true; | |
66 | } | |
67 | ||
68 | void DFGCodeBlocks::clearMarks() | |
69 | { | |
70 | for (HashSet<CodeBlock*>::iterator iter = m_set.begin(); iter != m_set.end(); ++iter) { | |
71 | (*iter)->m_dfgData->mayBeExecuting = false; | |
72 | (*iter)->m_dfgData->visitAggregateHasBeenCalled = false; | |
73 | } | |
74 | } | |
75 | ||
76 | void DFGCodeBlocks::deleteUnmarkedJettisonedCodeBlocks() | |
77 | { | |
78 | Vector<CodeBlock*, 16> toRemove; | |
79 | ||
80 | for (HashSet<CodeBlock*>::iterator iter = m_set.begin(); iter != m_set.end(); ++iter) { | |
81 | if ((*iter)->m_dfgData->isJettisoned && !(*iter)->m_dfgData->mayBeExecuting) | |
82 | toRemove.append(*iter); | |
83 | } | |
84 | ||
85 | WTF::deleteAllValues(toRemove); | |
86 | } | |
87 | ||
88 | void DFGCodeBlocks::traceMarkedCodeBlocks(SlotVisitor& visitor) | |
89 | { | |
90 | for (HashSet<CodeBlock*>::iterator iter = m_set.begin(); iter != m_set.end(); ++iter) { | |
91 | if ((*iter)->m_dfgData->mayBeExecuting) | |
92 | (*iter)->visitAggregate(visitor); | |
93 | } | |
94 | } | |
95 | ||
96 | #else // ENABLE(DFG_JIT) | |
97 | ||
98 | void DFGCodeBlocks::jettison(PassOwnPtr<CodeBlock>) | |
99 | { | |
100 | } | |
101 | ||
102 | #endif // ENABLE(DFG_JIT) | |
103 | ||
104 | } // namespace JSC | |
105 | ||
106 |