]>
Commit | Line | Data |
---|---|---|
6fe7ccc8 A |
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 | #ifndef CopiedSpace_h | |
27 | #define CopiedSpace_h | |
28 | ||
29 | #include "CopiedAllocator.h" | |
30 | #include "HeapBlock.h" | |
81345200 | 31 | #include "HeapOperation.h" |
6fe7ccc8 A |
32 | #include "TinyBloomFilter.h" |
33 | #include <wtf/Assertions.h> | |
34 | #include <wtf/CheckedBoolean.h> | |
35 | #include <wtf/DoublyLinkedList.h> | |
36 | #include <wtf/HashSet.h> | |
37 | #include <wtf/OSAllocator.h> | |
38 | #include <wtf/PageAllocationAligned.h> | |
39 | #include <wtf/PageBlock.h> | |
40 | #include <wtf/StdLibExtras.h> | |
93a37866 | 41 | #include <wtf/TCSpinLock.h> |
6fe7ccc8 A |
42 | #include <wtf/ThreadingPrimitives.h> |
43 | ||
44 | namespace JSC { | |
45 | ||
46 | class Heap; | |
47 | class CopiedBlock; | |
6fe7ccc8 A |
48 | |
49 | class CopiedSpace { | |
93a37866 A |
50 | friend class CopyVisitor; |
51 | friend class GCThreadSharedData; | |
6fe7ccc8 A |
52 | friend class SlotVisitor; |
53 | friend class JIT; | |
54 | public: | |
55 | CopiedSpace(Heap*); | |
93a37866 | 56 | ~CopiedSpace(); |
6fe7ccc8 A |
57 | void init(); |
58 | ||
59 | CheckedBoolean tryAllocate(size_t, void**); | |
60 | CheckedBoolean tryReallocate(void**, size_t, size_t); | |
61 | ||
62 | CopiedAllocator& allocator() { return m_allocator; } | |
63 | ||
81345200 A |
64 | void didStartFullCollection(); |
65 | ||
66 | template <HeapOperation collectionType> | |
6fe7ccc8 | 67 | void startedCopying(); |
81345200 A |
68 | void startedEdenCopy(); |
69 | void startedFullCopy(); | |
6fe7ccc8 A |
70 | void doneCopying(); |
71 | bool isInCopyPhase() { return m_inCopyingPhase; } | |
72 | ||
73 | void pin(CopiedBlock*); | |
74 | bool isPinned(void*); | |
75 | ||
93a37866 | 76 | bool contains(CopiedBlock*); |
6fe7ccc8 | 77 | bool contains(void*, CopiedBlock*&); |
93a37866 A |
78 | |
79 | void pinIfNecessary(void* pointer); | |
6fe7ccc8 A |
80 | |
81 | size_t size(); | |
82 | size_t capacity(); | |
83 | ||
6fe7ccc8 | 84 | bool isPagedOut(double deadline); |
93a37866 | 85 | bool shouldDoCopyPhase() { return m_shouldDoCopyPhase; } |
6fe7ccc8 A |
86 | |
87 | static CopiedBlock* blockFor(void*); | |
88 | ||
81345200 A |
89 | Heap* heap() const { return m_heap; } |
90 | ||
6fe7ccc8 | 91 | private: |
93a37866 A |
92 | static bool isOversize(size_t); |
93 | ||
94 | JS_EXPORT_PRIVATE CheckedBoolean tryAllocateSlowCase(size_t, void**); | |
6fe7ccc8 A |
95 | CheckedBoolean tryAllocateOversize(size_t, void**); |
96 | CheckedBoolean tryReallocateOversize(void**, size_t, size_t); | |
97 | ||
93a37866 A |
98 | void allocateBlock(); |
99 | CopiedBlock* allocateBlockForCopyingPhase(); | |
100 | ||
101 | void doneFillingBlock(CopiedBlock*, CopiedBlock**); | |
81345200 | 102 | void recycleEvacuatedBlock(CopiedBlock*, HeapOperation collectionType); |
93a37866 | 103 | void recycleBorrowedBlock(CopiedBlock*); |
6fe7ccc8 A |
104 | |
105 | Heap* m_heap; | |
106 | ||
107 | CopiedAllocator m_allocator; | |
108 | ||
93a37866 | 109 | HashSet<CopiedBlock*> m_blockSet; |
6fe7ccc8 | 110 | |
93a37866 | 111 | SpinLock m_toSpaceLock; |
6fe7ccc8 | 112 | |
81345200 A |
113 | struct CopiedGeneration { |
114 | CopiedGeneration() | |
115 | : toSpace(0) | |
116 | , fromSpace(0) | |
117 | { | |
118 | } | |
119 | ||
120 | DoublyLinkedList<CopiedBlock>* toSpace; | |
121 | DoublyLinkedList<CopiedBlock>* fromSpace; | |
122 | ||
123 | DoublyLinkedList<CopiedBlock> blocks1; | |
124 | DoublyLinkedList<CopiedBlock> blocks2; | |
125 | DoublyLinkedList<CopiedBlock> oversizeBlocks; | |
126 | ||
127 | TinyBloomFilter blockFilter; | |
128 | }; | |
129 | ||
130 | CopiedGeneration m_oldGen; | |
131 | CopiedGeneration m_newGen; | |
6fe7ccc8 A |
132 | |
133 | bool m_inCopyingPhase; | |
93a37866 | 134 | bool m_shouldDoCopyPhase; |
6fe7ccc8 A |
135 | |
136 | Mutex m_loanedBlocksLock; | |
137 | ThreadCondition m_loanedBlocksCondition; | |
138 | size_t m_numberOfLoanedBlocks; | |
139 | ||
93a37866 | 140 | static const size_t s_maxAllocationSize = CopiedBlock::blockSize / 2; |
6fe7ccc8 | 141 | static const size_t s_initialBlockNum = 16; |
93a37866 | 142 | static const size_t s_blockMask = ~(CopiedBlock::blockSize - 1); |
6fe7ccc8 A |
143 | }; |
144 | ||
145 | } // namespace JSC | |
146 | ||
147 | #endif |