mirror of
https://github.com/darlinghq/darling-JavaScriptCore.git
synced 2024-11-23 04:09:40 +00:00
71 lines
2.5 KiB
C++
71 lines
2.5 KiB
C++
/*
|
|
* Copyright (C) 2017 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 "FreeList.h"
|
|
#include "MarkedBlock.h"
|
|
|
|
namespace JSC {
|
|
|
|
template<typename Func>
|
|
ALWAYS_INLINE HeapCell* FreeList::allocate(const Func& slowPath)
|
|
{
|
|
unsigned remaining = m_remaining;
|
|
if (remaining) {
|
|
unsigned cellSize = m_cellSize;
|
|
remaining -= cellSize;
|
|
m_remaining = remaining;
|
|
return bitwise_cast<HeapCell*>(m_payloadEnd - remaining - cellSize);
|
|
}
|
|
|
|
FreeCell* result = head();
|
|
if (UNLIKELY(!result))
|
|
return slowPath();
|
|
|
|
m_scrambledHead = result->scrambledNext;
|
|
return bitwise_cast<HeapCell*>(result);
|
|
}
|
|
|
|
template<typename Func>
|
|
void FreeList::forEach(const Func& func) const
|
|
{
|
|
if (m_remaining) {
|
|
for (unsigned remaining = m_remaining; remaining; remaining -= m_cellSize)
|
|
func(bitwise_cast<HeapCell*>(m_payloadEnd - remaining));
|
|
} else {
|
|
for (FreeCell* cell = head(); cell;) {
|
|
// We can use this to overwrite free objects before destroying the free list. So, we need
|
|
// to get next before proceeding further.
|
|
FreeCell* next = cell->next(m_secret);
|
|
func(bitwise_cast<HeapCell*>(cell));
|
|
cell = next;
|
|
}
|
|
}
|
|
}
|
|
|
|
} // namespace JSC
|
|
|