]> git.saurik.com Git - apple/javascriptcore.git/blame_incremental - runtime/Lookup.cpp
JavaScriptCore-1097.13.tar.gz
[apple/javascriptcore.git] / runtime / Lookup.cpp
... / ...
CommitLineData
1/*
2 * Copyright (C) 2008 Apple Inc. All rights reserved.
3 *
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
8 *
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
13 *
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
17 *
18 */
19
20#include "config.h"
21#include "Lookup.h"
22
23#include "Executable.h"
24#include "JSFunction.h"
25
26namespace JSC {
27
28void HashTable::createTable(JSGlobalData* globalData) const
29{
30 ASSERT(!table);
31 int linkIndex = compactHashSizeMask + 1;
32 HashEntry* entries = new HashEntry[compactSize];
33 for (int i = 0; i < compactSize; ++i)
34 entries[i].setKey(0);
35 for (int i = 0; values[i].key; ++i) {
36 StringImpl* identifier = Identifier::add(globalData, values[i].key).leakRef();
37 int hashIndex = identifier->existingHash() & compactHashSizeMask;
38 HashEntry* entry = &entries[hashIndex];
39
40 if (entry->key()) {
41 while (entry->next()) {
42 entry = entry->next();
43 }
44 ASSERT(linkIndex < compactSize);
45 entry->setNext(&entries[linkIndex++]);
46 entry = entry->next();
47 }
48
49 entry->initialize(identifier, values[i].attributes, values[i].value1, values[i].value2, values[i].intrinsic);
50 }
51 table = entries;
52}
53
54void HashTable::deleteTable() const
55{
56 if (table) {
57 int max = compactSize;
58 for (int i = 0; i != max; ++i) {
59 if (StringImpl* key = table[i].key())
60 key->deref();
61 }
62 delete [] table;
63 table = 0;
64 }
65}
66
67bool setUpStaticFunctionSlot(ExecState* exec, const HashEntry* entry, JSObject* thisObj, const Identifier& propertyName, PropertySlot& slot)
68{
69 ASSERT(thisObj->globalObject());
70 ASSERT(entry->attributes() & Function);
71 WriteBarrierBase<Unknown>* location = thisObj->getDirectLocation(exec->globalData(), propertyName);
72
73 if (!location) {
74 // If a property is ever deleted from an object with a static table, then we reify
75 // all static functions at that time - after this we shouldn't be re-adding anything.
76 if (thisObj->staticFunctionsReified())
77 return false;
78
79 JSFunction* function = JSFunction::create(exec, thisObj->globalObject(), entry->functionLength(), propertyName, entry->function(), entry->intrinsic());
80 thisObj->putDirect(exec->globalData(), propertyName, function, entry->attributes());
81 location = thisObj->getDirectLocation(exec->globalData(), propertyName);
82 }
83
84 slot.setValue(thisObj, location->get(), thisObj->offsetForLocation(location));
85 return true;
86}
87
88} // namespace JSC