MarkedBlock.cpp 6.2 KB
Newer Older
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
/*
 * Copyright (C) 2011 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. AND ITS CONTRIBUTORS ``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 ITS 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 "MarkedBlock.h"

29
#include "IncrementalSweeper.h"
30
#include "JSCell.h"
31
#include "JSObject.h"
32

33

34
35
namespace JSC {

36
MarkedBlock* MarkedBlock::create(const PageAllocationAligned& allocation, Heap* heap, size_t cellSize, bool cellsNeedDestruction, bool onlyContainsStructures)
37
{
38
    return new (NotNull, allocation.base()) MarkedBlock(allocation, heap, cellSize, cellsNeedDestruction, onlyContainsStructures);
39
40
}

41
MarkedBlock::MarkedBlock(const PageAllocationAligned& allocation, Heap* heap, size_t cellSize, bool cellsNeedDestruction, bool onlyContainsStructures)
42
    : HeapBlock<MarkedBlock>(allocation)
43
    , m_atomsPerCell((cellSize + atomSize - 1) / atomSize)
44
    , m_endAtom(atomsPerBlock - m_atomsPerCell + 1)
45
46
    , m_cellsNeedDestruction(cellsNeedDestruction)
    , m_onlyContainsStructures(onlyContainsStructures)
47
    , m_state(New) // All cells start out unmarked.
48
    , m_weakSet(heap->globalData())
49
{
50
    ASSERT(heap);
51
    HEAP_LOG_BLOCK_STATE_TRANSITION(this);
52
53
}

54
inline void MarkedBlock::callDestructor(JSCell* cell)
55
{
56
57
    // A previous eager sweep may already have run cell's destructor.
    if (cell->isZapped())
58
        return;
59

60
#if ENABLE(SIMPLE_HEAP_PROFILING)
61
    m_heap->m_destroyedTypeCounts.countVPtr(vptr);
62
#endif
63

64
    cell->methodTable()->destroy(cell);
65
    cell->zap();
66
67
}

68
template<MarkedBlock::BlockState blockState, MarkedBlock::SweepMode sweepMode, bool destructorCallNeeded>
69
MarkedBlock::FreeList MarkedBlock::specializedSweep()
70
{
71
    ASSERT(blockState != Allocated && blockState != FreeListed);
72
    ASSERT(destructorCallNeeded || sweepMode != SweepOnly);
73

74
    // This produces a free list that is ordered in reverse through the block.
75
76
    // This is fine, since the allocation code makes no assumptions about the
    // order of the free list.
77
    FreeCell* head = 0;
78
    size_t count = 0;
79
    for (size_t i = firstAtom(); i < m_endAtom; i += m_atomsPerCell) {
80
81
82
        if (blockState == Marked && m_marks.get(i))
            continue;

83
        JSCell* cell = reinterpret_cast_ptr<JSCell*>(&atoms()[i]);
84

85
        if (destructorCallNeeded && blockState != New)
86
            callDestructor(cell);
87
88

        if (sweepMode == SweepToFreeList) {
89
            FreeCell* freeCell = reinterpret_cast<FreeCell*>(cell);
90
91
            freeCell->next = head;
            head = freeCell;
92
            ++count;
93
94
        }
    }
95

96
    m_state = ((sweepMode == SweepToFreeList) ? FreeListed : Marked);
97
    return FreeList(head, count * cellSize());
98
99
}

100
MarkedBlock::FreeList MarkedBlock::sweep(SweepMode sweepMode)
101
{
102
103
    HEAP_LOG_BLOCK_STATE_TRANSITION(this);

104
105
    m_weakSet.sweep();

106
    if (sweepMode == SweepOnly && !m_cellsNeedDestruction)
107
        return FreeList();
108

109
110
111
    if (m_cellsNeedDestruction)
        return sweepHelper<true>(sweepMode);
    return sweepHelper<false>(sweepMode);
112
113
}

114
template<bool destructorCallNeeded>
115
MarkedBlock::FreeList MarkedBlock::sweepHelper(SweepMode sweepMode)
116
{
117
118
119
    switch (m_state) {
    case New:
        ASSERT(sweepMode == SweepToFreeList);
120
        return specializedSweep<New, SweepToFreeList, destructorCallNeeded>();
121
122
123
    case FreeListed:
        // Happens when a block transitions to fully allocated.
        ASSERT(sweepMode == SweepToFreeList);
124
        return FreeList();
125
126
    case Allocated:
        ASSERT_NOT_REACHED();
127
        return FreeList();
128
    case Marked:
129
        ASSERT(!m_onlyContainsStructures || heap()->isSafeToSweepStructures());
130
        return sweepMode == SweepToFreeList
131
132
            ? specializedSweep<Marked, SweepToFreeList, destructorCallNeeded>()
            : specializedSweep<Marked, SweepOnly, destructorCallNeeded>();
133
    }
ggaren@apple.com's avatar
ggaren@apple.com committed
134
135

    ASSERT_NOT_REACHED();
136
    return FreeList();
137
138
}

139
140
141
142
143
144
145
146
147
class SetAllMarksFunctor : public MarkedBlock::VoidFunctor {
public:
    void operator()(JSCell* cell)
    {
        MarkedBlock::blockFor(cell)->setMarked(cell);
    }
};

void MarkedBlock::canonicalizeCellLivenessData(const FreeList& freeList)
148
{
149
    HEAP_LOG_BLOCK_STATE_TRANSITION(this);
150
    FreeCell* head = freeList.head;
151

152
153
154
155
156
157
158
    if (m_state == Marked) {
        // If the block is in the Marked state then we know that:
        // 1) It was not used for allocation during the previous allocation cycle.
        // 2) It may have dead objects, and we only know them to be dead by the
        //    fact that their mark bits are unset.
        // Hence if the block is Marked we need to leave it Marked.
        
159
        ASSERT(!head);
160
161
        return;
    }
162
   
163
164
    ASSERT(m_state == FreeListed);
    
165
166
    // Roll back to a coherent state for Heap introspection. Cells newly
    // allocated from our free list are not currently marked, so we need another
167
    // way to tell what's live vs dead. 
168
    
169
170
171
    SetAllMarksFunctor functor;
    forEachCell(functor);

172
    FreeCell* next;
173
    for (FreeCell* current = head; current; current = next) {
174
175
        next = current->next;
        reinterpret_cast<JSCell*>(current)->zap();
176
        clearMarked(current);
177
    }
178
    
179
    m_state = Marked;
180
181
}

182
} // namespace JSC