mirror of
https://github.com/darlinghq/darling-JavaScriptCore.git
synced 2024-11-23 04:09:40 +00:00
118 lines
3.4 KiB
C++
118 lines
3.4 KiB
C++
/*
|
|
* Copyright (C) 2003-2017 Apple Inc. All rights reserved.
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Library General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2 of the License, or (at your option) any later version.
|
|
*
|
|
* This library is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Library General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Library General Public License
|
|
* along with this library; see the file COPYING.LIB. If not, write to
|
|
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
|
* Boston, MA 02110-1301, USA.
|
|
*
|
|
*/
|
|
|
|
#include "config.h"
|
|
#include "ArgList.h"
|
|
|
|
#include "JSCJSValueInlines.h"
|
|
|
|
using std::min;
|
|
|
|
namespace JSC {
|
|
|
|
void MarkedArgumentBuffer::addMarkSet(JSValue v)
|
|
{
|
|
if (m_markSet)
|
|
return;
|
|
|
|
Heap* heap = Heap::heap(v);
|
|
if (!heap)
|
|
return;
|
|
|
|
m_markSet = &heap->markListSet();
|
|
m_markSet->add(this);
|
|
}
|
|
|
|
void ArgList::getSlice(int startIndex, ArgList& result) const
|
|
{
|
|
if (startIndex <= 0 || startIndex >= m_argCount) {
|
|
result = ArgList();
|
|
return;
|
|
}
|
|
|
|
result.m_args = m_args + startIndex;
|
|
result.m_argCount = m_argCount - startIndex;
|
|
}
|
|
|
|
void MarkedArgumentBuffer::markLists(SlotVisitor& visitor, ListSet& markSet)
|
|
{
|
|
ListSet::iterator end = markSet.end();
|
|
for (ListSet::iterator it = markSet.begin(); it != end; ++it) {
|
|
MarkedArgumentBuffer* list = *it;
|
|
for (int i = 0; i < list->m_size; ++i)
|
|
visitor.appendUnbarriered(JSValue::decode(list->slotFor(i)));
|
|
}
|
|
}
|
|
|
|
void MarkedArgumentBuffer::slowEnsureCapacity(size_t requestedCapacity)
|
|
{
|
|
setNeedsOverflowCheck();
|
|
auto checkedNewCapacity = Checked<int, RecordOverflow>(requestedCapacity);
|
|
if (UNLIKELY(checkedNewCapacity.hasOverflowed()))
|
|
return this->overflowed();
|
|
expandCapacity(checkedNewCapacity.unsafeGet());
|
|
}
|
|
|
|
void MarkedArgumentBuffer::expandCapacity()
|
|
{
|
|
setNeedsOverflowCheck();
|
|
auto checkedNewCapacity = Checked<int, RecordOverflow>(m_capacity) * 2;
|
|
if (UNLIKELY(checkedNewCapacity.hasOverflowed()))
|
|
return this->overflowed();
|
|
expandCapacity(checkedNewCapacity.unsafeGet());
|
|
}
|
|
|
|
void MarkedArgumentBuffer::expandCapacity(int newCapacity)
|
|
{
|
|
setNeedsOverflowCheck();
|
|
ASSERT(m_capacity < newCapacity);
|
|
auto checkedSize = CheckedSize(newCapacity) * sizeof(EncodedJSValue);
|
|
if (UNLIKELY(checkedSize.hasOverflowed()))
|
|
return this->overflowed();
|
|
EncodedJSValue* newBuffer = static_cast<EncodedJSValue*>(Gigacage::malloc(Gigacage::JSValue, checkedSize.unsafeGet()));
|
|
for (int i = 0; i < m_size; ++i) {
|
|
newBuffer[i] = m_buffer[i];
|
|
addMarkSet(JSValue::decode(m_buffer[i]));
|
|
}
|
|
|
|
if (EncodedJSValue* base = mallocBase())
|
|
Gigacage::free(Gigacage::JSValue, base);
|
|
|
|
m_buffer = newBuffer;
|
|
m_capacity = newCapacity;
|
|
}
|
|
|
|
void MarkedArgumentBuffer::slowAppend(JSValue v)
|
|
{
|
|
ASSERT(m_size <= m_capacity);
|
|
if (m_size == m_capacity)
|
|
expandCapacity();
|
|
if (UNLIKELY(Base::hasOverflowed())) {
|
|
ASSERT(m_needsOverflowCheck);
|
|
return;
|
|
}
|
|
|
|
slotFor(m_size) = JSValue::encode(v);
|
|
++m_size;
|
|
addMarkSet(v);
|
|
}
|
|
|
|
} // namespace JSC
|