OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 2361 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2372 if (i == 1) obj->SetHiddenValue(v8_str("key string"), value); | 2372 if (i == 1) obj->SetHiddenValue(v8_str("key string"), value); |
2373 | 2373 |
2374 // Check values. | 2374 // Check values. |
2375 CHECK_EQ(hash, | 2375 CHECK_EQ(hash, |
2376 internal_obj->GetHiddenProperty(heap->identity_hash_string())); | 2376 internal_obj->GetHiddenProperty(heap->identity_hash_string())); |
2377 CHECK(value->Equals(obj->GetHiddenValue(v8_str("key string")))); | 2377 CHECK(value->Equals(obj->GetHiddenValue(v8_str("key string")))); |
2378 | 2378 |
2379 // Check size. | 2379 // Check size. |
2380 DescriptorArray* descriptors = internal_obj->map()->instance_descriptors(); | 2380 DescriptorArray* descriptors = internal_obj->map()->instance_descriptors(); |
2381 ObjectHashTable* hashtable = ObjectHashTable::cast( | 2381 ObjectHashTable* hashtable = ObjectHashTable::cast( |
2382 internal_obj->FastPropertyAt(descriptors->GetFieldIndex(0))); | 2382 internal_obj->RawFastPropertyAt(descriptors->GetFieldIndex(0))); |
2383 // HashTable header (5) and 4 initial entries (8). | 2383 // HashTable header (5) and 4 initial entries (8). |
2384 CHECK_LE(hashtable->SizeFor(hashtable->length()), 13 * kPointerSize); | 2384 CHECK_LE(hashtable->SizeFor(hashtable->length()), 13 * kPointerSize); |
2385 } | 2385 } |
2386 } | 2386 } |
2387 | 2387 |
2388 | 2388 |
2389 TEST(IncrementalMarkingClearsTypeFeedbackCells) { | 2389 TEST(IncrementalMarkingClearsTypeFeedbackCells) { |
2390 if (i::FLAG_always_opt) return; | 2390 if (i::FLAG_always_opt) return; |
2391 CcTest::InitializeVM(); | 2391 CcTest::InitializeVM(); |
2392 v8::HandleScope scope(CcTest::isolate()); | 2392 v8::HandleScope scope(CcTest::isolate()); |
(...skipping 672 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3065 } | 3065 } |
3066 // An entire block of handles has been filled. | 3066 // An entire block of handles has been filled. |
3067 // Next handle would require a new block. | 3067 // Next handle would require a new block. |
3068 ASSERT(data->next == data->limit); | 3068 ASSERT(data->next == data->limit); |
3069 | 3069 |
3070 DeferredHandleScope deferred(isolate); | 3070 DeferredHandleScope deferred(isolate); |
3071 DummyVisitor visitor; | 3071 DummyVisitor visitor; |
3072 isolate->handle_scope_implementer()->Iterate(&visitor); | 3072 isolate->handle_scope_implementer()->Iterate(&visitor); |
3073 deferred.Detach(); | 3073 deferred.Detach(); |
3074 } | 3074 } |
OLD | NEW |