MarkedBlock.cpp 7.21 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
    , m_cellsNeedDestruction(cellsNeedDestruction)
46
    , 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
86
        if (blockState == Zapped && !cell->isZapped())
            continue;

87
        if (destructorCallNeeded && blockState != New)
88
            callDestructor(cell);
89
90

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

    m_state = ((sweepMode == SweepToFreeList) ? FreeListed : Zapped);
99
    return FreeList(head, count * cellSize());
100
101
}

102
MarkedBlock::FreeList MarkedBlock::sweep(SweepMode sweepMode)
103
{
104
105
    HEAP_LOG_BLOCK_STATE_TRANSITION(this);

106
107
    m_weakSet.sweep();

108
    if (sweepMode == SweepOnly && !m_cellsNeedDestruction)
109
        return FreeList();
110
111
112
113
114
115
116

    if (m_cellsNeedDestruction)
        return sweepHelper<true>(sweepMode);
    return sweepHelper<false>(sweepMode);
}

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

    ASSERT_NOT_REACHED();
143
    return FreeList();
144
145
}

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

151
152
153
154
155
156
157
    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.
        
158
        ASSERT(!head);
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
        
        return;
    }
    
    if (m_state == Zapped) {
        // If the block is in the Zapped state then we know that someone already
        // zapped it for us. This could not have happened during a GC, but might
        // be the result of someone having done a GC scan to perform some operation
        // over all live objects (or all live blocks). It also means that somebody
        // had allocated in this block since the last GC, swept all dead objects
        // onto the free list, left the block in the FreeListed state, then the heap
        // scan happened, and canonicalized the block, leading to all dead objects
        // being zapped. Therefore, it is safe for us to simply do nothing, since
        // dead objects will have 0 in their vtables and live objects will have
        // non-zero vtables, which is consistent with the block being zapped.
        
175
        ASSERT(!head);
176
177
178
179
180
181
        
        return;
    }
    
    ASSERT(m_state == FreeListed);
    
182
183
184
    // Roll back to a coherent state for Heap introspection. Cells newly
    // allocated from our free list are not currently marked, so we need another
    // way to tell what's live vs dead. We use zapping for that.
185
    
186
    FreeCell* next;
187
    for (FreeCell* current = head; current; current = next) {
188
189
        next = current->next;
        reinterpret_cast<JSCell*>(current)->zap();
190
    }
191
    
192
    m_state = Zapped;
193
194
}

195
} // namespace JSC