/* * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2009 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 "HeapRootVisitor.h" #include "JSCJSValue.h" #include "JSObject.h" #include "Operations.h" using std::min; namespace JSC { void ArgList::getSlice(int startIndex, ArgList& result) const { if (startIndex = m_argCount) { result = ArgList(); return; } result.m_args = m_args + startIndex; result.m_argCount = m_argCount - startIndex; } void MarkedArgumentBuffer::markLists(HeapRootVisitor& heapRootVisitor, ListSet& markSet) { ListSet::iterator end = markSet.end(); for (ListSet::iterator it = markSet.begin(); it != end; ++it) { MarkedArgumentBuffer* list = *it; for (int i = 0; i m_size; ++i) heapRootVisitor.visit(reinterpret_cast(&list->slotFor(i))); } } void MarkedArgumentBuffer::slowAppend(JSValue v) { int newCapacity = m_capacity * 4; EncodedJSValue* newBuffer = new EncodedJSValue[newCapacity]; for (int i = 0; i markListSet(); m_markSet->add(this); break; } } } // namespace JSC