1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192 |
- /*
- * Copyright (C) 2008, 2012 Apple Inc. All rights reserved.
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser 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
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
- *
- */
- #include "config.h"
- #include "Lookup.h"
- #include "Executable.h"
- #include "JSFunction.h"
- #include "Operations.h"
- namespace JSC {
- void HashTable::createTable(VM* vm) const
- {
- ASSERT(!table);
- int linkIndex = compactHashSizeMask + 1;
- HashEntry* entries = new HashEntry[compactSize];
- for (int i = 0; i < compactSize; ++i)
- entries[i].setKey(0);
- for (int i = 0; values[i].key; ++i) {
- StringImpl* identifier = Identifier::add(vm, values[i].key).leakRef();
- int hashIndex = identifier->existingHash() & compactHashSizeMask;
- HashEntry* entry = &entries[hashIndex];
- if (entry->key()) {
- while (entry->next()) {
- entry = entry->next();
- }
- ASSERT(linkIndex < compactSize);
- entry->setNext(&entries[linkIndex++]);
- entry = entry->next();
- }
- entry->initialize(identifier, values[i].attributes, values[i].value1, values[i].value2, values[i].intrinsic);
- }
- table = entries;
- }
- void HashTable::deleteTable() const
- {
- if (table) {
- int max = compactSize;
- for (int i = 0; i != max; ++i) {
- if (StringImpl* key = table[i].key())
- key->deref();
- }
- delete [] table;
- table = 0;
- }
- }
- bool setUpStaticFunctionSlot(ExecState* exec, const HashEntry* entry, JSObject* thisObj, PropertyName propertyName, PropertySlot& slot)
- {
- ASSERT(thisObj->globalObject());
- ASSERT(entry->attributes() & Function);
- PropertyOffset offset = thisObj->getDirectOffset(exec->vm(), propertyName);
- if (!isValidOffset(offset)) {
- // If a property is ever deleted from an object with a static table, then we reify
- // all static functions at that time - after this we shouldn't be re-adding anything.
- if (thisObj->staticFunctionsReified())
- return false;
-
- thisObj->putDirectNativeFunction(
- exec, thisObj->globalObject(), propertyName, entry->functionLength(),
- entry->function(), entry->intrinsic(), entry->attributes());
- offset = thisObj->getDirectOffset(exec->vm(), propertyName);
- ASSERT(isValidOffset(offset));
- }
- slot.setValue(thisObj, thisObj->getDirect(offset), offset);
- return true;
- }
- } // namespace JSC
|