blob: 99fa40ebb442d05af11507b0d08e2afac9aaf401 [file] [log] [blame]
/*
* Copyright (C) 2016-2019 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. ``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
* 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.
*/
#pragma once
#include "BlockDirectory.h"
#include "JSCast.h"
#include "MarkedBlock.h"
#include "MarkedSpace.h"
#include "Operations.h"
#include "SuperSampler.h"
#include "VM.h"
namespace JSC {
inline unsigned MarkedBlock::Handle::cellsPerBlock()
{
return MarkedSpace::blockPayload / cellSize();
}
inline bool MarkedBlock::isNewlyAllocatedStale() const
{
return footer().m_newlyAllocatedVersion != space()->newlyAllocatedVersion();
}
inline bool MarkedBlock::hasAnyNewlyAllocated()
{
return !isNewlyAllocatedStale();
}
inline Heap* MarkedBlock::heap() const
{
return &vm().heap;
}
inline MarkedSpace* MarkedBlock::space() const
{
return &heap()->objectSpace();
}
inline MarkedSpace* MarkedBlock::Handle::space() const
{
return &heap()->objectSpace();
}
inline bool MarkedBlock::marksConveyLivenessDuringMarking(HeapVersion markingVersion)
{
return marksConveyLivenessDuringMarking(footer().m_markingVersion, markingVersion);
}
inline bool MarkedBlock::marksConveyLivenessDuringMarking(HeapVersion myMarkingVersion, HeapVersion markingVersion)
{
// This returns true if any of these is true:
// - We just created the block and so the bits are clear already.
// - This block has objects marked during the last GC, and so its version was up-to-date just
// before the current collection did beginMarking(). This means that any objects that have
// their mark bit set are valid objects that were never deleted, and so are candidates for
// marking in any conservative scan. Using our jargon, they are "live".
// - We did ~2^32 collections and rotated the version back to null, so we needed to hard-reset
// everything. If the marks had been stale, we would have cleared them. So, we can be sure that
// any set mark bit reflects objects marked during last GC, i.e. "live" objects.
// It would be absurd to use this method when not collecting, since this special "one version
// back" state only makes sense when we're in a concurrent collection and have to be
// conservative.
ASSERT(space()->isMarking());
if (heap()->collectionScope() != CollectionScope::Full)
return false;
return myMarkingVersion == MarkedSpace::nullVersion
|| MarkedSpace::nextVersion(myMarkingVersion) == markingVersion;
}
inline bool MarkedBlock::Handle::isAllocated()
{
return m_directory->isAllocated(NoLockingNecessary, this);
}
ALWAYS_INLINE bool MarkedBlock::Handle::isLive(HeapVersion markingVersion, HeapVersion newlyAllocatedVersion, bool isMarking, const HeapCell* cell)
{
if (directory()->isAllocated(NoLockingNecessary, this))
return true;
// We need to do this while holding the lock because marks might be stale. In that case, newly
// allocated will not yet be valid. Consider this interleaving.
//
// One thread is doing this:
//
// 1) IsLiveChecksNewlyAllocated: We check if newly allocated is valid. If it is valid, and the bit is
// set, we return true. Let's assume that this executes atomically. It doesn't have to in general,
// but we can assume that for the purpose of seeing this bug.
//
// 2) IsLiveChecksMarks: Having failed that, we check the mark bits. This step implies the rest of
// this function. It happens under a lock so it's atomic.
//
// Another thread is doing:
//
// 1) AboutToMarkSlow: This is the entire aboutToMarkSlow function, and let's say it's atomic. It
// sorta is since it holds a lock, but that doesn't actually make it atomic with respect to
// IsLiveChecksNewlyAllocated, since that does not hold a lock in our scenario.
//
// The harmful interleaving happens if we start out with a block that has stale mark bits that
// nonetheless convey liveness during marking (the off-by-one version trick). The interleaving is
// just:
//
// IsLiveChecksNewlyAllocated AboutToMarkSlow IsLiveChecksMarks
//
// We started with valid marks but invalid newly allocated. So, the first part doesn't think that
// anything is live, but dutifully drops down to the marks step. But in the meantime, we clear the
// mark bits and transfer their contents into newlyAllocated. So IsLiveChecksMarks also sees nothing
// live. Ooops!
//
// Fortunately, since this is just a read critical section, we can use a CountingLock.
//
// Probably many users of CountingLock could use its lambda-based and locker-based APIs. But here, we
// need to ensure that everything is ALWAYS_INLINE. It's hard to do that when using lambdas. It's
// more reliable to write it inline instead. Empirically, it seems like how inline this is has some
// impact on perf - around 2% on splay if you get it wrong.
MarkedBlock& block = this->block();
MarkedBlock::Footer& footer = block.footer();
auto count = footer.m_lock.tryOptimisticFencelessRead();
if (count.value) {
Dependency fenceBefore = Dependency::fence(count.input);
MarkedBlock& fencedBlock = *fenceBefore.consume(&block);
MarkedBlock::Footer& fencedFooter = fencedBlock.footer();
MarkedBlock::Handle* fencedThis = fenceBefore.consume(this);
ASSERT_UNUSED(fencedThis, !fencedThis->isFreeListed());
HeapVersion myNewlyAllocatedVersion = fencedFooter.m_newlyAllocatedVersion;
if (myNewlyAllocatedVersion == newlyAllocatedVersion) {
bool result = fencedBlock.isNewlyAllocated(cell);
if (footer.m_lock.fencelessValidate(count.value, Dependency::fence(result)))
return result;
} else {
HeapVersion myMarkingVersion = fencedFooter.m_markingVersion;
if (myMarkingVersion != markingVersion
&& (!isMarking || !fencedBlock.marksConveyLivenessDuringMarking(myMarkingVersion, markingVersion))) {
if (footer.m_lock.fencelessValidate(count.value, Dependency::fence(myMarkingVersion)))
return false;
} else {
bool result = fencedFooter.m_marks.get(block.atomNumber(cell));
if (footer.m_lock.fencelessValidate(count.value, Dependency::fence(result)))
return result;
}
}
}
auto locker = holdLock(footer.m_lock);
ASSERT(!isFreeListed());
HeapVersion myNewlyAllocatedVersion = footer.m_newlyAllocatedVersion;
if (myNewlyAllocatedVersion == newlyAllocatedVersion)
return block.isNewlyAllocated(cell);
if (block.areMarksStale(markingVersion)) {
if (!isMarking)
return false;
if (!block.marksConveyLivenessDuringMarking(markingVersion))
return false;
}
return footer.m_marks.get(block.atomNumber(cell));
}
inline bool MarkedBlock::Handle::isLiveCell(HeapVersion markingVersion, HeapVersion newlyAllocatedVersion, bool isMarking, const void* p)
{
if (!m_block->isAtom(p))
return false;
return isLive(markingVersion, newlyAllocatedVersion, isMarking, static_cast<const HeapCell*>(p));
}
inline bool MarkedBlock::Handle::isLive(const HeapCell* cell)
{
return isLive(space()->markingVersion(), space()->newlyAllocatedVersion(), space()->isMarking(), cell);
}
inline bool MarkedBlock::Handle::isLiveCell(const void* p)
{
return isLiveCell(space()->markingVersion(), space()->newlyAllocatedVersion(), space()->isMarking(), p);
}
inline bool MarkedBlock::Handle::areMarksStaleForSweep()
{
return marksMode() == MarksStale;
}
// The following has to be true for specialization to kick in:
//
// sweepMode == SweepToFreeList
// scribbleMode == DontScribble
// newlyAllocatedMode == DoesNotHaveNewlyAllocated
// destructionMode != BlockHasDestrictorsAndCollectorIsRunning
//
// emptyMode = IsEmpty
// destructionMode = DoesNotNeedDestruction
// marksMode = MarksNotStale (1)
// marksMode = MarksStale (2)
// emptyMode = NotEmpty
// destructionMode = DoesNotNeedDestruction
// marksMode = MarksNotStale (3)
// marksMode = MarksStale (4)
// destructionMode = NeedsDestruction
// marksMode = MarksNotStale (5)
// marksMode = MarksStale (6)
//
// Only the DoesNotNeedDestruction one should be specialized by MarkedBlock.
template<bool specialize, MarkedBlock::Handle::EmptyMode specializedEmptyMode, MarkedBlock::Handle::SweepMode specializedSweepMode, MarkedBlock::Handle::SweepDestructionMode specializedDestructionMode, MarkedBlock::Handle::ScribbleMode specializedScribbleMode, MarkedBlock::Handle::NewlyAllocatedMode specializedNewlyAllocatedMode, MarkedBlock::Handle::MarksMode specializedMarksMode, typename DestroyFunc>
void MarkedBlock::Handle::specializedSweep(FreeList* freeList, MarkedBlock::Handle::EmptyMode emptyMode, MarkedBlock::Handle::SweepMode sweepMode, MarkedBlock::Handle::SweepDestructionMode destructionMode, MarkedBlock::Handle::ScribbleMode scribbleMode, MarkedBlock::Handle::NewlyAllocatedMode newlyAllocatedMode, MarkedBlock::Handle::MarksMode marksMode, const DestroyFunc& destroyFunc)
{
if (specialize) {
emptyMode = specializedEmptyMode;
sweepMode = specializedSweepMode;
destructionMode = specializedDestructionMode;
scribbleMode = specializedScribbleMode;
newlyAllocatedMode = specializedNewlyAllocatedMode;
marksMode = specializedMarksMode;
}
RELEASE_ASSERT(!(destructionMode == BlockHasNoDestructors && sweepMode == SweepOnly));
SuperSamplerScope superSamplerScope(false);
MarkedBlock& block = this->block();
MarkedBlock::Footer& footer = block.footer();
if (false)
dataLog(RawPointer(this), "/", RawPointer(&block), ": MarkedBlock::Handle::specializedSweep!\n");
unsigned cellSize = this->cellSize();
VM& vm = this->vm();
auto destroy = [&] (void* cell) {
JSCell* jsCell = static_cast<JSCell*>(cell);
if (!jsCell->isZapped()) {
destroyFunc(vm, jsCell);
jsCell->zap(HeapCell::Destruction);
}
};
m_directory->setIsDestructible(NoLockingNecessary, this, false);
if (Options::useBumpAllocator()
&& emptyMode == IsEmpty
&& newlyAllocatedMode == DoesNotHaveNewlyAllocated) {
// This is an incredibly powerful assertion that checks the sanity of our block bits.
if (marksMode == MarksNotStale && !footer.m_marks.isEmpty()) {
WTF::dataFile().atomically(
[&] (PrintStream& out) {
out.print("Block ", RawPointer(&block), ": marks not empty!\n");
out.print("Block lock is held: ", footer.m_lock.isHeld(), "\n");
out.print("Marking version of block: ", footer.m_markingVersion, "\n");
out.print("Marking version of heap: ", space()->markingVersion(), "\n");
UNREACHABLE_FOR_PLATFORM();
});
}
char* startOfLastCell = static_cast<char*>(cellAlign(block.atoms() + m_endAtom - 1));
char* payloadEnd = startOfLastCell + cellSize;
RELEASE_ASSERT(payloadEnd - MarkedBlock::blockSize <= bitwise_cast<char*>(&block));
char* payloadBegin = bitwise_cast<char*>(block.atoms());
if (sweepMode == SweepToFreeList)
setIsFreeListed();
if (space()->isMarking())
footer.m_lock.unlock();
if (destructionMode != BlockHasNoDestructors) {
for (char* cell = payloadBegin; cell < payloadEnd; cell += cellSize)
destroy(cell);
}
if (sweepMode == SweepToFreeList) {
if (scribbleMode == Scribble)
scribble(payloadBegin, payloadEnd - payloadBegin);
freeList->initializeBump(payloadEnd, payloadEnd - payloadBegin);
}
if (false)
dataLog("Quickly swept block ", RawPointer(this), " with cell size ", cellSize, " and attributes ", m_attributes, ": ", pointerDump(freeList), "\n");
return;
}
// This produces a free list that is ordered in reverse through the block.
// This is fine, since the allocation code makes no assumptions about the
// order of the free list.
FreeCell* head = 0;
size_t count = 0;
uintptr_t secret;
cryptographicallyRandomValues(&secret, sizeof(uintptr_t));
bool isEmpty = true;
Vector<size_t> deadCells;
auto handleDeadCell = [&] (size_t i) {
HeapCell* cell = reinterpret_cast_ptr<HeapCell*>(&block.atoms()[i]);
if (destructionMode != BlockHasNoDestructors)
destroy(cell);
if (sweepMode == SweepToFreeList) {
FreeCell* freeCell = reinterpret_cast_ptr<FreeCell*>(cell);
if (scribbleMode == Scribble)
scribble(freeCell, cellSize);
freeCell->setNext(head, secret);
head = freeCell;
++count;
}
};
for (size_t i = 0; i < m_endAtom; i += m_atomsPerCell) {
if (emptyMode == NotEmpty
&& ((marksMode == MarksNotStale && footer.m_marks.get(i))
|| (newlyAllocatedMode == HasNewlyAllocated && footer.m_newlyAllocated.get(i)))) {
isEmpty = false;
continue;
}
if (destructionMode == BlockHasDestructorsAndCollectorIsRunning)
deadCells.append(i);
else
handleDeadCell(i);
}
// We only want to discard the newlyAllocated bits if we're creating a FreeList,
// otherwise we would lose information on what's currently alive.
if (sweepMode == SweepToFreeList && newlyAllocatedMode == HasNewlyAllocated)
footer.m_newlyAllocatedVersion = MarkedSpace::nullVersion;
if (space()->isMarking())
footer.m_lock.unlock();
if (destructionMode == BlockHasDestructorsAndCollectorIsRunning) {
for (size_t i : deadCells)
handleDeadCell(i);
}
if (sweepMode == SweepToFreeList) {
freeList->initializeList(head, secret, count * cellSize);
setIsFreeListed();
} else if (isEmpty)
m_directory->setIsEmpty(NoLockingNecessary, this, true);
if (false)
dataLog("Slowly swept block ", RawPointer(&block), " with cell size ", cellSize, " and attributes ", m_attributes, ": ", pointerDump(freeList), "\n");
}
template<typename DestroyFunc>
void MarkedBlock::Handle::finishSweepKnowingHeapCellType(FreeList* freeList, const DestroyFunc& destroyFunc)
{
SweepMode sweepMode = freeList ? SweepToFreeList : SweepOnly;
SweepDestructionMode destructionMode = this->sweepDestructionMode();
EmptyMode emptyMode = this->emptyMode();
ScribbleMode scribbleMode = this->scribbleMode();
NewlyAllocatedMode newlyAllocatedMode = this->newlyAllocatedMode();
MarksMode marksMode = this->marksMode();
auto trySpecialized = [&] () -> bool {
if (scribbleMode != DontScribble)
return false;
if (newlyAllocatedMode != DoesNotHaveNewlyAllocated)
return false;
if (destructionMode != BlockHasDestructors)
return false;
switch (emptyMode) {
case IsEmpty:
switch (sweepMode) {
case SweepOnly:
switch (marksMode) {
case MarksNotStale:
specializedSweep<true, IsEmpty, SweepOnly, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksNotStale>(freeList, IsEmpty, SweepOnly, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksNotStale, destroyFunc);
return true;
case MarksStale:
specializedSweep<true, IsEmpty, SweepOnly, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksStale>(freeList, IsEmpty, SweepOnly, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksStale, destroyFunc);
return true;
}
RELEASE_ASSERT_NOT_REACHED();
case SweepToFreeList:
switch (marksMode) {
case MarksNotStale:
specializedSweep<true, IsEmpty, SweepToFreeList, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksNotStale>(freeList, IsEmpty, SweepToFreeList, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksNotStale, destroyFunc);
return true;
case MarksStale:
specializedSweep<true, IsEmpty, SweepToFreeList, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksStale>(freeList, IsEmpty, SweepToFreeList, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksStale, destroyFunc);
return true;
}
}
RELEASE_ASSERT_NOT_REACHED();
case NotEmpty:
switch (sweepMode) {
case SweepOnly:
switch (marksMode) {
case MarksNotStale:
specializedSweep<true, NotEmpty, SweepOnly, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksNotStale>(freeList, NotEmpty, SweepOnly, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksNotStale, destroyFunc);
return true;
case MarksStale:
specializedSweep<true, NotEmpty, SweepOnly, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksStale>(freeList, NotEmpty, SweepOnly, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksStale, destroyFunc);
return true;
}
RELEASE_ASSERT_NOT_REACHED();
case SweepToFreeList:
switch (marksMode) {
case MarksNotStale:
specializedSweep<true, NotEmpty, SweepToFreeList, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksNotStale>(freeList, NotEmpty, SweepToFreeList, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksNotStale, destroyFunc);
return true;
case MarksStale:
specializedSweep<true, NotEmpty, SweepToFreeList, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksStale>(freeList, NotEmpty, SweepToFreeList, BlockHasDestructors, DontScribble, DoesNotHaveNewlyAllocated, MarksStale, destroyFunc);
return true;
}
}
}
return false;
};
if (trySpecialized())
return;
// The template arguments don't matter because the first one is false.
specializedSweep<false, IsEmpty, SweepOnly, BlockHasNoDestructors, DontScribble, HasNewlyAllocated, MarksStale>(freeList, emptyMode, sweepMode, destructionMode, scribbleMode, newlyAllocatedMode, marksMode, destroyFunc);
}
inline MarkedBlock::Handle::SweepDestructionMode MarkedBlock::Handle::sweepDestructionMode()
{
if (m_attributes.destruction == NeedsDestruction) {
if (space()->isMarking())
return BlockHasDestructorsAndCollectorIsRunning;
return BlockHasDestructors;
}
return BlockHasNoDestructors;
}
inline bool MarkedBlock::Handle::isEmpty()
{
return m_directory->isEmpty(NoLockingNecessary, this);
}
inline MarkedBlock::Handle::EmptyMode MarkedBlock::Handle::emptyMode()
{
// It's not obvious, but this is the only way to know if the block is empty. It's the only
// bit that captures these caveats:
// - It's true when the block is freshly allocated.
// - It's true if the block had been swept in the past, all destructors were called, and that
// sweep proved that the block is empty.
return isEmpty() ? IsEmpty : NotEmpty;
}
inline MarkedBlock::Handle::ScribbleMode MarkedBlock::Handle::scribbleMode()
{
return scribbleFreeCells() ? Scribble : DontScribble;
}
inline MarkedBlock::Handle::NewlyAllocatedMode MarkedBlock::Handle::newlyAllocatedMode()
{
return block().hasAnyNewlyAllocated() ? HasNewlyAllocated : DoesNotHaveNewlyAllocated;
}
inline MarkedBlock::Handle::MarksMode MarkedBlock::Handle::marksMode()
{
HeapVersion markingVersion = space()->markingVersion();
bool marksAreUseful = !block().areMarksStale(markingVersion);
if (space()->isMarking())
marksAreUseful |= block().marksConveyLivenessDuringMarking(markingVersion);
return marksAreUseful ? MarksNotStale : MarksStale;
}
inline void MarkedBlock::Handle::setIsFreeListed()
{
m_directory->setIsEmpty(NoLockingNecessary, this, false);
m_isFreeListed = true;
}
template <typename Functor>
inline IterationStatus MarkedBlock::Handle::forEachLiveCell(const Functor& functor)
{
// FIXME: This is not currently efficient to use in the constraint solver because isLive() grabs a
// lock to protect itself from concurrent calls to aboutToMarkSlow(). But we could get around this by
// having this function grab the lock before and after the iteration, and check if the marking version
// changed. If it did, just run again. Inside the loop, we only need to ensure that if a race were to
// happen, we will just overlook objects. I think that because of how aboutToMarkSlow() does things,
// a race ought to mean that it just returns false when it should have returned true - but this is
// something that would have to be verified carefully.
//
// NOTE: Some users of forEachLiveCell require that their callback is called exactly once for
// each live cell. We could optimize this function for those users by using a slow loop if the
// block is in marks-mean-live mode. That would only affect blocks that had partial survivors
// during the last collection and no survivors (yet) during this collection.
//
// https://bugs.webkit.org/show_bug.cgi?id=180315
HeapCell::Kind kind = m_attributes.cellKind;
for (size_t i = 0; i < m_endAtom; i += m_atomsPerCell) {
HeapCell* cell = reinterpret_cast_ptr<HeapCell*>(&m_block->atoms()[i]);
if (!isLive(cell))
continue;
if (functor(i, cell, kind) == IterationStatus::Done)
return IterationStatus::Done;
}
return IterationStatus::Continue;
}
template <typename Functor>
inline IterationStatus MarkedBlock::Handle::forEachDeadCell(const Functor& functor)
{
HeapCell::Kind kind = m_attributes.cellKind;
for (size_t i = 0; i < m_endAtom; i += m_atomsPerCell) {
HeapCell* cell = reinterpret_cast_ptr<HeapCell*>(&m_block->atoms()[i]);
if (isLive(cell))
continue;
if (functor(cell, kind) == IterationStatus::Done)
return IterationStatus::Done;
}
return IterationStatus::Continue;
}
template <typename Functor>
inline IterationStatus MarkedBlock::Handle::forEachMarkedCell(const Functor& functor)
{
HeapCell::Kind kind = m_attributes.cellKind;
MarkedBlock& block = this->block();
bool areMarksStale = block.areMarksStale();
WTF::loadLoadFence();
if (areMarksStale)
return IterationStatus::Continue;
for (size_t i = 0; i < m_endAtom; i += m_atomsPerCell) {
if (!block.footer().m_marks.get(i))
continue;
HeapCell* cell = reinterpret_cast_ptr<HeapCell*>(&m_block->atoms()[i]);
if (functor(i, cell, kind) == IterationStatus::Done)
return IterationStatus::Done;
}
return IterationStatus::Continue;
}
} // namespace JSC