1 // Copyright 2011 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
4 // met:
5 //
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
15 //
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
28 #include "src/v8.h"
29 #include "test/cctest/cctest.h"
30
31 #include "src/api.h"
32 #include "src/debug.h"
33 #include "src/execution.h"
34 #include "src/factory.h"
35 #include "src/global-handles.h"
36 #include "src/macro-assembler.h"
37 #include "src/objects.h"
38
39 using namespace v8::internal;
40
41 namespace {
42
43
44 template<typename HashMap>
TestHashMap(Handle<HashMap> table)45 static void TestHashMap(Handle<HashMap> table) {
46 Isolate* isolate = CcTest::i_isolate();
47 Factory* factory = isolate->factory();
48
49 Handle<JSObject> a = factory->NewJSArray(7);
50 Handle<JSObject> b = factory->NewJSArray(11);
51 table = HashMap::Put(table, a, b);
52 CHECK_EQ(table->NumberOfElements(), 1);
53 CHECK_EQ(table->Lookup(a), *b);
54 // When the key does not exist in the map, Lookup returns the hole.
55 CHECK_EQ(table->Lookup(b), CcTest::heap()->the_hole_value());
56
57 // Keys still have to be valid after objects were moved.
58 CcTest::heap()->CollectGarbage(NEW_SPACE);
59 CHECK_EQ(table->NumberOfElements(), 1);
60 CHECK_EQ(table->Lookup(a), *b);
61 CHECK_EQ(table->Lookup(b), CcTest::heap()->the_hole_value());
62
63 // Keys that are overwritten should not change number of elements.
64 table = HashMap::Put(table, a, factory->NewJSArray(13));
65 CHECK_EQ(table->NumberOfElements(), 1);
66 CHECK_NE(table->Lookup(a), *b);
67
68 // Keys that have been removed are mapped to the hole.
69 bool was_present = false;
70 table = HashMap::Remove(table, a, &was_present);
71 CHECK(was_present);
72 CHECK_EQ(table->NumberOfElements(), 0);
73 CHECK_EQ(table->Lookup(a), CcTest::heap()->the_hole_value());
74
75 // Keys should map back to their respective values and also should get
76 // an identity hash code generated.
77 for (int i = 0; i < 100; i++) {
78 Handle<JSReceiver> key = factory->NewJSArray(7);
79 Handle<JSObject> value = factory->NewJSArray(11);
80 table = HashMap::Put(table, key, value);
81 CHECK_EQ(table->NumberOfElements(), i + 1);
82 CHECK_NE(table->FindEntry(key), HashMap::kNotFound);
83 CHECK_EQ(table->Lookup(key), *value);
84 CHECK(key->GetIdentityHash()->IsSmi());
85 }
86
87 // Keys never added to the map which already have an identity hash
88 // code should not be found.
89 for (int i = 0; i < 100; i++) {
90 Handle<JSReceiver> key = factory->NewJSArray(7);
91 CHECK(JSReceiver::GetOrCreateIdentityHash(key)->IsSmi());
92 CHECK_EQ(table->FindEntry(key), HashMap::kNotFound);
93 CHECK_EQ(table->Lookup(key), CcTest::heap()->the_hole_value());
94 CHECK(key->GetIdentityHash()->IsSmi());
95 }
96
97 // Keys that don't have an identity hash should not be found and also
98 // should not get an identity hash code generated.
99 for (int i = 0; i < 100; i++) {
100 Handle<JSReceiver> key = factory->NewJSArray(7);
101 CHECK_EQ(table->Lookup(key), CcTest::heap()->the_hole_value());
102 Object* identity_hash = key->GetIdentityHash();
103 CHECK_EQ(identity_hash, CcTest::heap()->undefined_value());
104 }
105 }
106
107
TEST(HashMap)108 TEST(HashMap) {
109 LocalContext context;
110 v8::HandleScope scope(context->GetIsolate());
111 Isolate* isolate = CcTest::i_isolate();
112 TestHashMap(ObjectHashTable::New(isolate, 23));
113 TestHashMap(isolate->factory()->NewOrderedHashMap());
114 }
115
116
117 class ObjectHashTableTest: public ObjectHashTable {
118 public:
insert(int entry,int key,int value)119 void insert(int entry, int key, int value) {
120 set(EntryToIndex(entry), Smi::FromInt(key));
121 set(EntryToIndex(entry) + 1, Smi::FromInt(value));
122 }
123
lookup(int key)124 int lookup(int key) {
125 Handle<Object> key_obj(Smi::FromInt(key), GetIsolate());
126 return Smi::cast(Lookup(key_obj))->value();
127 }
128
capacity()129 int capacity() {
130 return Capacity();
131 }
132 };
133
134
TEST(HashTableRehash)135 TEST(HashTableRehash) {
136 LocalContext context;
137 Isolate* isolate = CcTest::i_isolate();
138 v8::HandleScope scope(context->GetIsolate());
139 // Test almost filled table.
140 {
141 Handle<ObjectHashTable> table = ObjectHashTable::New(isolate, 100);
142 ObjectHashTableTest* t = reinterpret_cast<ObjectHashTableTest*>(*table);
143 int capacity = t->capacity();
144 for (int i = 0; i < capacity - 1; i++) {
145 t->insert(i, i * i, i);
146 }
147 t->Rehash(handle(Smi::FromInt(0), isolate));
148 for (int i = 0; i < capacity - 1; i++) {
149 CHECK_EQ(i, t->lookup(i * i));
150 }
151 }
152 // Test half-filled table.
153 {
154 Handle<ObjectHashTable> table = ObjectHashTable::New(isolate, 100);
155 ObjectHashTableTest* t = reinterpret_cast<ObjectHashTableTest*>(*table);
156 int capacity = t->capacity();
157 for (int i = 0; i < capacity / 2; i++) {
158 t->insert(i, i * i, i);
159 }
160 t->Rehash(handle(Smi::FromInt(0), isolate));
161 for (int i = 0; i < capacity / 2; i++) {
162 CHECK_EQ(i, t->lookup(i * i));
163 }
164 }
165 }
166
167
168 #ifdef DEBUG
169 template<class HashSet>
TestHashSetCausesGC(Handle<HashSet> table)170 static void TestHashSetCausesGC(Handle<HashSet> table) {
171 Isolate* isolate = CcTest::i_isolate();
172 Factory* factory = isolate->factory();
173
174 Handle<JSObject> key = factory->NewJSArray(0);
175 v8::Handle<v8::Object> key_obj = v8::Utils::ToLocal(key);
176
177 // Force allocation of hash table backing store for hidden properties.
178 key_obj->SetHiddenValue(v8_str("key 1"), v8_str("val 1"));
179 key_obj->SetHiddenValue(v8_str("key 2"), v8_str("val 2"));
180 key_obj->SetHiddenValue(v8_str("key 3"), v8_str("val 3"));
181
182 // Simulate a full heap so that generating an identity hash code
183 // in subsequent calls will request GC.
184 SimulateFullSpace(CcTest::heap()->new_space());
185 SimulateFullSpace(CcTest::heap()->old_pointer_space());
186
187 // Calling Contains() should not cause GC ever.
188 int gc_count = isolate->heap()->gc_count();
189 CHECK(!table->Contains(key));
190 CHECK(gc_count == isolate->heap()->gc_count());
191
192 // Calling Remove() will not cause GC in this case.
193 bool was_present = false;
194 table = HashSet::Remove(table, key, &was_present);
195 CHECK(!was_present);
196 CHECK(gc_count == isolate->heap()->gc_count());
197
198 // Calling Add() should cause GC.
199 table = HashSet::Add(table, key);
200 CHECK(gc_count < isolate->heap()->gc_count());
201 }
202
203
TEST(ObjectHashSetCausesGC)204 TEST(ObjectHashSetCausesGC) {
205 i::FLAG_stress_compaction = false;
206 LocalContext context;
207 v8::HandleScope scope(context->GetIsolate());
208 Isolate* isolate = CcTest::i_isolate();
209 TestHashSetCausesGC(isolate->factory()->NewOrderedHashSet());
210 }
211 #endif
212
213
214 #ifdef DEBUG
215 template<class HashMap>
TestHashMapCausesGC(Handle<HashMap> table)216 static void TestHashMapCausesGC(Handle<HashMap> table) {
217 Isolate* isolate = CcTest::i_isolate();
218 Factory* factory = isolate->factory();
219
220 Handle<JSObject> key = factory->NewJSArray(0);
221 v8::Handle<v8::Object> key_obj = v8::Utils::ToLocal(key);
222
223 // Force allocation of hash table backing store for hidden properties.
224 key_obj->SetHiddenValue(v8_str("key 1"), v8_str("val 1"));
225 key_obj->SetHiddenValue(v8_str("key 2"), v8_str("val 2"));
226 key_obj->SetHiddenValue(v8_str("key 3"), v8_str("val 3"));
227
228 // Simulate a full heap so that generating an identity hash code
229 // in subsequent calls will request GC.
230 SimulateFullSpace(CcTest::heap()->new_space());
231 SimulateFullSpace(CcTest::heap()->old_pointer_space());
232
233 // Calling Lookup() should not cause GC ever.
234 CHECK(table->Lookup(key)->IsTheHole());
235
236 // Calling Put() should request GC by returning a failure.
237 int gc_count = isolate->heap()->gc_count();
238 HashMap::Put(table, key, key);
239 CHECK(gc_count < isolate->heap()->gc_count());
240 }
241
242
TEST(ObjectHashTableCausesGC)243 TEST(ObjectHashTableCausesGC) {
244 i::FLAG_stress_compaction = false;
245 LocalContext context;
246 v8::HandleScope scope(context->GetIsolate());
247 Isolate* isolate = CcTest::i_isolate();
248 TestHashMapCausesGC(ObjectHashTable::New(isolate, 1));
249 TestHashMapCausesGC(isolate->factory()->NewOrderedHashMap());
250 }
251 #endif
252
253
254 }
255