// Copyright 2014 the V8 project authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #include #include #include "src/v8.h" #include "src/compilation-cache.h" #include "src/execution.h" #include "src/field-type.h" #include "src/global-handles.h" #include "src/heap/factory.h" #include "src/objects-inl.h" #include "src/transitions.h" #include "test/cctest/cctest.h" #include "test/cctest/test-transitions.h" namespace v8 { namespace internal { TEST(TransitionArray_SimpleFieldTransitions) { CcTest::InitializeVM(); v8::HandleScope scope(CcTest::isolate()); Isolate* isolate = CcTest::i_isolate(); Factory* factory = isolate->factory(); Handle name1 = factory->InternalizeUtf8String("foo"); Handle name2 = factory->InternalizeUtf8String("bar"); PropertyAttributes attributes = NONE; Handle map0 = Map::Create(isolate, 0); Handle map1 = Map::CopyWithField(map0, name1, handle(FieldType::Any(), isolate), attributes, PropertyConstness::kMutable, Representation::Tagged(), OMIT_TRANSITION) .ToHandleChecked(); Handle map2 = Map::CopyWithField(map0, name2, handle(FieldType::Any(), isolate), attributes, PropertyConstness::kMutable, Representation::Tagged(), OMIT_TRANSITION) .ToHandleChecked(); CHECK(map0->raw_transitions()->IsSmi()); { TestTransitionsAccessor transitions(isolate, map0); transitions.Insert(name1, map1, SIMPLE_PROPERTY_TRANSITION); } { TestTransitionsAccessor transitions(isolate, map0); CHECK(transitions.IsWeakRefEncoding()); CHECK_EQ(*map1, transitions.SearchTransition(*name1, kData, attributes)); CHECK_EQ(1, transitions.NumberOfTransitions()); CHECK_EQ(*name1, transitions.GetKey(0)); CHECK_EQ(*map1, transitions.GetTarget(0)); transitions.Insert(name2, map2, SIMPLE_PROPERTY_TRANSITION); } { TestTransitionsAccessor transitions(isolate, map0); CHECK(transitions.IsFullTransitionArrayEncoding()); CHECK_EQ(*map1, transitions.SearchTransition(*name1, kData, attributes)); CHECK_EQ(*map2, transitions.SearchTransition(*name2, kData, attributes)); CHECK_EQ(2, transitions.NumberOfTransitions()); for (int i = 0; i < 2; i++) { Name* key = transitions.GetKey(i); Map* target = transitions.GetTarget(i); CHECK((key == *name1 && target == *map1) || (key == *name2 && target == *map2)); } DCHECK(transitions.IsSortedNoDuplicates()); } } TEST(TransitionArray_FullFieldTransitions) { CcTest::InitializeVM(); v8::HandleScope scope(CcTest::isolate()); Isolate* isolate = CcTest::i_isolate(); Factory* factory = isolate->factory(); Handle name1 = factory->InternalizeUtf8String("foo"); Handle name2 = factory->InternalizeUtf8String("bar"); PropertyAttributes attributes = NONE; Handle map0 = Map::Create(isolate, 0); Handle map1 = Map::CopyWithField(map0, name1, handle(FieldType::Any(), isolate), attributes, PropertyConstness::kMutable, Representation::Tagged(), OMIT_TRANSITION) .ToHandleChecked(); Handle map2 = Map::CopyWithField(map0, name2, handle(FieldType::Any(), isolate), attributes, PropertyConstness::kMutable, Representation::Tagged(), OMIT_TRANSITION) .ToHandleChecked(); CHECK(map0->raw_transitions()->IsSmi()); { TestTransitionsAccessor transitions(isolate, map0); transitions.Insert(name1, map1, PROPERTY_TRANSITION); } { TestTransitionsAccessor transitions(isolate, map0); CHECK(transitions.IsFullTransitionArrayEncoding()); CHECK_EQ(*map1, transitions.SearchTransition(*name1, kData, attributes)); CHECK_EQ(1, transitions.NumberOfTransitions()); CHECK_EQ(*name1, transitions.GetKey(0)); CHECK_EQ(*map1, transitions.GetTarget(0)); transitions.Insert(name2, map2, PROPERTY_TRANSITION); } { TestTransitionsAccessor transitions(isolate, map0); CHECK(transitions.IsFullTransitionArrayEncoding()); CHECK_EQ(*map1, transitions.SearchTransition(*name1, kData, attributes)); CHECK_EQ(*map2, transitions.SearchTransition(*name2, kData, attributes)); CHECK_EQ(2, transitions.NumberOfTransitions()); for (int i = 0; i < 2; i++) { Name* key = transitions.GetKey(i); Map* target = transitions.GetTarget(i); CHECK((key == *name1 && target == *map1) || (key == *name2 && target == *map2)); } DCHECK(transitions.IsSortedNoDuplicates()); } } TEST(TransitionArray_DifferentFieldNames) { CcTest::InitializeVM(); v8::HandleScope scope(CcTest::isolate()); Isolate* isolate = CcTest::i_isolate(); Factory* factory = isolate->factory(); const int PROPS_COUNT = 10; Handle names[PROPS_COUNT]; Handle maps[PROPS_COUNT]; PropertyAttributes attributes = NONE; Handle map0 = Map::Create(isolate, 0); CHECK(map0->raw_transitions()->IsSmi()); for (int i = 0; i < PROPS_COUNT; i++) { EmbeddedVector buffer; SNPrintF(buffer, "prop%d", i); Handle name = factory->InternalizeUtf8String(buffer.start()); Handle map = Map::CopyWithField(map0, name, handle(FieldType::Any(), isolate), attributes, PropertyConstness::kMutable, Representation::Tagged(), OMIT_TRANSITION) .ToHandleChecked(); names[i] = name; maps[i] = map; TransitionsAccessor(isolate, map0).Insert(name, map, PROPERTY_TRANSITION); } TransitionsAccessor transitions(isolate, map0); for (int i = 0; i < PROPS_COUNT; i++) { CHECK_EQ(*maps[i], transitions.SearchTransition(*names[i], kData, attributes)); } for (int i = 0; i < PROPS_COUNT; i++) { Name* key = transitions.GetKey(i); Map* target = transitions.GetTarget(i); for (int j = 0; j < PROPS_COUNT; j++) { if (*names[i] == key) { CHECK_EQ(*maps[i], target); break; } } } DCHECK(transitions.IsSortedNoDuplicates()); } TEST(TransitionArray_SameFieldNamesDifferentAttributesSimple) { CcTest::InitializeVM(); v8::HandleScope scope(CcTest::isolate()); Isolate* isolate = CcTest::i_isolate(); Factory* factory = isolate->factory(); Handle map0 = Map::Create(isolate, 0); CHECK(map0->raw_transitions()->IsSmi()); const int ATTRS_COUNT = (READ_ONLY | DONT_ENUM | DONT_DELETE) + 1; STATIC_ASSERT(ATTRS_COUNT == 8); Handle attr_maps[ATTRS_COUNT]; Handle name = factory->InternalizeUtf8String("foo"); // Add transitions for same field name but different attributes. for (int i = 0; i < ATTRS_COUNT; i++) { PropertyAttributes attributes = static_cast(i); Handle map = Map::CopyWithField(map0, name, FieldType::Any(isolate), attributes, PropertyConstness::kMutable, Representation::Tagged(), OMIT_TRANSITION) .ToHandleChecked(); attr_maps[i] = map; TransitionsAccessor(isolate, map0).Insert(name, map, PROPERTY_TRANSITION); } // Ensure that transitions for |name| field are valid. TransitionsAccessor transitions(isolate, map0); for (int i = 0; i < ATTRS_COUNT; i++) { PropertyAttributes attributes = static_cast(i); CHECK_EQ(*attr_maps[i], transitions.SearchTransition(*name, kData, attributes)); // All transitions use the same key, so this check doesn't need to // care about ordering. CHECK_EQ(*name, transitions.GetKey(i)); } DCHECK(transitions.IsSortedNoDuplicates()); } TEST(TransitionArray_SameFieldNamesDifferentAttributes) { CcTest::InitializeVM(); v8::HandleScope scope(CcTest::isolate()); Isolate* isolate = CcTest::i_isolate(); Factory* factory = isolate->factory(); const int PROPS_COUNT = 10; Handle names[PROPS_COUNT]; Handle maps[PROPS_COUNT]; Handle map0 = Map::Create(isolate, 0); CHECK(map0->raw_transitions()->IsSmi()); // Some number of fields. for (int i = 0; i < PROPS_COUNT; i++) { EmbeddedVector buffer; SNPrintF(buffer, "prop%d", i); Handle name = factory->InternalizeUtf8String(buffer.start()); Handle map = Map::CopyWithField(map0, name, handle(FieldType::Any(), isolate), NONE, PropertyConstness::kMutable, Representation::Tagged(), OMIT_TRANSITION) .ToHandleChecked(); names[i] = name; maps[i] = map; TransitionsAccessor(isolate, map0).Insert(name, map, PROPERTY_TRANSITION); } const int ATTRS_COUNT = (READ_ONLY | DONT_ENUM | DONT_DELETE) + 1; STATIC_ASSERT(ATTRS_COUNT == 8); Handle attr_maps[ATTRS_COUNT]; Handle name = factory->InternalizeUtf8String("foo"); // Add transitions for same field name but different attributes. for (int i = 0; i < ATTRS_COUNT; i++) { PropertyAttributes attributes = static_cast(i); Handle map = Map::CopyWithField(map0, name, handle(FieldType::Any(), isolate), attributes, PropertyConstness::kMutable, Representation::Tagged(), OMIT_TRANSITION) .ToHandleChecked(); attr_maps[i] = map; TransitionsAccessor(isolate, map0).Insert(name, map, PROPERTY_TRANSITION); } // Ensure that transitions for |name| field are valid. TransitionsAccessor transitions(isolate, map0); for (int i = 0; i < ATTRS_COUNT; i++) { PropertyAttributes attr = static_cast(i); CHECK_EQ(*attr_maps[i], transitions.SearchTransition(*name, kData, attr)); } // Ensure that info about the other fields still valid. CHECK_EQ(PROPS_COUNT + ATTRS_COUNT, transitions.NumberOfTransitions()); for (int i = 0; i < PROPS_COUNT + ATTRS_COUNT; i++) { Name* key = transitions.GetKey(i); Map* target = transitions.GetTarget(i); if (key == *name) { // Attributes transition. PropertyAttributes attributes = target->GetLastDescriptorDetails().attributes(); CHECK_EQ(*attr_maps[static_cast(attributes)], target); } else { for (int j = 0; j < PROPS_COUNT; j++) { if (*names[j] == key) { CHECK_EQ(*maps[j], target); break; } } } } DCHECK(transitions.IsSortedNoDuplicates()); } } // namespace internal } // namespace v8