Commit | Line | Data |
---|---|---|
14957cd0 A |
1 | /* |
2 | * Copyright (C) 2010 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. AND ITS CONTRIBUTORS ``AS IS'' | |
14 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, | |
15 | * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | |
16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS | |
17 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | |
18 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | |
19 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | |
20 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | |
21 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
22 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF | |
23 | * THE POSSIBILITY OF SUCH DAMAGE. | |
24 | */ | |
25 | ||
26 | #include "config.h" | |
27 | ||
28 | #include "HandleStack.h" | |
29 | ||
30 | #include "MarkStack.h" | |
31 | ||
32 | namespace JSC { | |
33 | ||
34 | HandleStack::HandleStack() | |
35 | #ifndef NDEBUG | |
36 | : m_scopeDepth(0) | |
37 | #endif | |
38 | { | |
39 | grow(); | |
40 | } | |
41 | ||
42 | void HandleStack::mark(HeapRootVisitor& heapRootMarker) | |
43 | { | |
44 | const Vector<HandleSlot>& blocks = m_blockStack.blocks(); | |
45 | size_t blockLength = m_blockStack.blockLength; | |
46 | ||
47 | int end = blocks.size() - 1; | |
48 | for (int i = 0; i < end; ++i) { | |
49 | HandleSlot block = blocks[i]; | |
50 | heapRootMarker.mark(block, blockLength); | |
51 | } | |
52 | HandleSlot block = blocks[end]; | |
53 | heapRootMarker.mark(block, m_frame.m_next - block); | |
54 | } | |
55 | ||
56 | void HandleStack::grow() | |
57 | { | |
58 | HandleSlot block = m_blockStack.grow(); | |
59 | m_frame.m_next = block; | |
60 | m_frame.m_end = block + m_blockStack.blockLength; | |
61 | } | |
62 | ||
63 | } |