git.saurik.com Git - apple/javascriptcore.git/blob

1 /*

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 */

26 #ifndef WeakSet_h

27 #define WeakSet_h

29 #include "WeakBlock.h"

31 namespace JSC {

33 class Heap;

34 class MarkedBlock;

35 class WeakImpl;

37 class WeakSet {

38 friend class LLIntOffsetsExtractor;

40 public:

     static WeakImpl* allocate(JSValue, WeakHandleOwner* = 0, void* context = 0);

42 static void deallocate(WeakImpl*);

44 WeakSet(VM*, MarkedBlock&);

45 ~WeakSet();

46 void lastChanceToFinalize();

     Heap* heap() const;

     VM* vm() const;

     bool isEmpty() const;

53 void visit(HeapRootVisitor&);

54 void reap();

55 void sweep();

56 void shrink();

57 void resetAllocator();

59 private:

     JS_EXPORT_PRIVATE WeakBlock::FreeCell* findAllocator();

     WeakBlock::FreeCell* tryFindAllocator();

     WeakBlock::FreeCell* addAllocator();

63 void removeAllocator(WeakBlock*);

65 WeakBlock::FreeCell* m_allocator;

66 WeakBlock* m_nextAllocator;

67 DoublyLinkedList<WeakBlock> m_blocks;

68 VM* m_vm;

69 MarkedBlock& m_markedBlock;

70 };

 inline WeakSet::WeakSet(VM* vm, MarkedBlock& markedBlock)

     : m_allocator(0)

     , m_nextAllocator(0)

75 , m_vm(vm)

76 , m_markedBlock(markedBlock)

77 {

78 }

 inline VM* WeakSet::vm() const

81 {

82 return m_vm;

83 }

 inline bool WeakSet::isEmpty() const

86 {

     for (WeakBlock* block = m_blocks.head(); block; block = block->next()) {

         if (!block->isEmpty())

89 return false;

90 }

92 return true;

93 }

 inline void WeakSet::deallocate(WeakImpl* weakImpl)

96 {

     weakImpl->setState(WeakImpl::Deallocated);

98 }

 inline void WeakSet::lastChanceToFinalize()

101 {

     for (WeakBlock* block = m_blocks.head(); block; block = block->next())

103 block->lastChanceToFinalize();

104 }

105

 inline void WeakSet::visit(HeapRootVisitor& visitor)

107 {

     for (WeakBlock* block = m_blocks.head(); block; block = block->next())

109 block->visit(visitor);

110 }

111

 inline void WeakSet::reap()

113 {

     for (WeakBlock* block = m_blocks.head(); block; block = block->next())

115 block->reap();

116 }

117

 inline void WeakSet::shrink()

119 {

120 WeakBlock* next;

     for (WeakBlock* block = m_blocks.head(); block; block = next) {

122 next = block->next();

123

         if (block->isEmpty())

125 removeAllocator(block);

126 }

127

128 resetAllocator();

129 }

130

 inline void WeakSet::resetAllocator()

132 {

133 m_allocator = 0;

134 m_nextAllocator = m_blocks.head();

135 }

136

137 } // namespace JSC

138

139 #endif // WeakSet_h