]>
Commit | Line | Data |
---|---|---|
9dae56ea A |
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 | ||
ba379fdc | 23 | #include "JSFunction.h" |
9dae56ea A |
24 | #include "PrototypeFunction.h" |
25 | ||
26 | namespace JSC { | |
27 | ||
28 | void HashTable::createTable(JSGlobalData* globalData) const | |
29 | { | |
9dae56ea A |
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 | UString::Rep* identifier = Identifier::add(globalData, values[i].key).releaseRef(); | |
f9bf01c6 | 37 | int hashIndex = identifier->existingHash() & compactHashSizeMask; |
9dae56ea A |
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 | ||
4e4e5a6f A |
49 | entry->initialize(identifier, values[i].attributes, values[i].value1, values[i].value2 |
50 | #if ENABLE(JIT) | |
51 | , values[i].generator | |
52 | #endif | |
53 | ); | |
9dae56ea A |
54 | } |
55 | table = entries; | |
9dae56ea A |
56 | } |
57 | ||
58 | void HashTable::deleteTable() const | |
59 | { | |
60 | if (table) { | |
9dae56ea | 61 | int max = compactSize; |
9dae56ea A |
62 | for (int i = 0; i != max; ++i) { |
63 | if (UString::Rep* key = table[i].key()) | |
64 | key->deref(); | |
65 | } | |
66 | delete [] table; | |
67 | table = 0; | |
68 | } | |
69 | } | |
70 | ||
71 | void setUpStaticFunctionSlot(ExecState* exec, const HashEntry* entry, JSObject* thisObj, const Identifier& propertyName, PropertySlot& slot) | |
72 | { | |
73 | ASSERT(entry->attributes() & Function); | |
ba379fdc | 74 | JSValue* location = thisObj->getDirectLocation(propertyName); |
9dae56ea A |
75 | |
76 | if (!location) { | |
4e4e5a6f A |
77 | InternalFunction* function; |
78 | #if ENABLE(JIT) && ENABLE(JIT_OPTIMIZE_NATIVE_CALL) | |
79 | if (entry->generator()) | |
80 | function = new (exec) NativeFunctionWrapper(exec, exec->lexicalGlobalObject()->prototypeFunctionStructure(), entry->functionLength(), propertyName, exec->globalData().getThunk(entry->generator()), entry->function()); | |
81 | else | |
82 | #endif | |
83 | function = new (exec) NativeFunctionWrapper(exec, exec->lexicalGlobalObject()->prototypeFunctionStructure(), entry->functionLength(), propertyName, entry->function()); | |
ba379fdc A |
84 | |
85 | thisObj->putDirectFunction(propertyName, function, entry->attributes()); | |
9dae56ea A |
86 | location = thisObj->getDirectLocation(propertyName); |
87 | } | |
88 | ||
89 | slot.setValueSlot(thisObj, location, thisObj->offsetForLocation(location)); | |
90 | } | |
91 | ||
92 | } // namespace JSC |