Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 1 | // Copyright 2014 the V8 project authors. All rights reserved. |
| 2 | // Use of this source code is governed by a BSD-style license that can be |
| 3 | // found in the LICENSE file. |
| 4 | |
| 5 | #include <stdlib.h> |
| 6 | #include <utility> |
| 7 | |
| 8 | #include "src/v8.h" |
| 9 | |
| 10 | #include "src/compilation-cache.h" |
| 11 | #include "src/execution.h" |
| 12 | #include "src/factory.h" |
| 13 | #include "src/global-handles.h" |
| 14 | #include "test/cctest/cctest.h" |
| 15 | |
| 16 | using namespace v8::internal; |
| 17 | |
| 18 | |
| 19 | // |
| 20 | // Helper functions. |
| 21 | // |
| 22 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 23 | static void CheckPropertyDetailsFieldsConsistency(PropertyType type, |
| 24 | PropertyKind kind, |
| 25 | PropertyLocation location) { |
| 26 | int type_value = PropertyDetails::TypeField::encode(type); |
| 27 | int kind_location_value = PropertyDetails::KindField::encode(kind) | |
| 28 | PropertyDetails::LocationField::encode(location); |
| 29 | CHECK_EQ(type_value, kind_location_value); |
| 30 | } |
| 31 | |
| 32 | |
| 33 | TEST(PropertyDetailsFieldsConsistency) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 34 | CheckPropertyDetailsFieldsConsistency(DATA, kData, kField); |
| 35 | CheckPropertyDetailsFieldsConsistency(DATA_CONSTANT, kData, kDescriptor); |
| 36 | CheckPropertyDetailsFieldsConsistency(ACCESSOR, kAccessor, kField); |
| 37 | CheckPropertyDetailsFieldsConsistency(ACCESSOR_CONSTANT, kAccessor, |
| 38 | kDescriptor); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 39 | } |
| 40 | |
| 41 | |
| 42 | TEST(TransitionArray_SimpleFieldTransitions) { |
| 43 | CcTest::InitializeVM(); |
| 44 | v8::HandleScope scope(CcTest::isolate()); |
| 45 | Isolate* isolate = CcTest::i_isolate(); |
| 46 | Factory* factory = isolate->factory(); |
| 47 | |
| 48 | Handle<String> name1 = factory->InternalizeUtf8String("foo"); |
| 49 | Handle<String> name2 = factory->InternalizeUtf8String("bar"); |
| 50 | PropertyAttributes attributes = NONE; |
| 51 | |
| 52 | Handle<Map> map0 = Map::Create(isolate, 0); |
| 53 | Handle<Map> map1 = |
| 54 | Map::CopyWithField(map0, name1, handle(HeapType::Any(), isolate), |
| 55 | attributes, Representation::Tagged(), |
| 56 | OMIT_TRANSITION).ToHandleChecked(); |
| 57 | Handle<Map> map2 = |
| 58 | Map::CopyWithField(map0, name2, handle(HeapType::Any(), isolate), |
| 59 | attributes, Representation::Tagged(), |
| 60 | OMIT_TRANSITION).ToHandleChecked(); |
| 61 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 62 | CHECK(map0->raw_transitions()->IsSmi()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 63 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 64 | TransitionArray::Insert(map0, name1, map1, SIMPLE_PROPERTY_TRANSITION); |
| 65 | CHECK(TransitionArray::IsSimpleTransition(map0->raw_transitions())); |
| 66 | CHECK_EQ(*map1, |
| 67 | TransitionArray::SearchTransition(*map0, kData, *name1, attributes)); |
| 68 | CHECK_EQ(1, TransitionArray::NumberOfTransitions(map0->raw_transitions())); |
| 69 | CHECK_EQ(*name1, TransitionArray::GetKey(map0->raw_transitions(), 0)); |
| 70 | CHECK_EQ(*map1, TransitionArray::GetTarget(map0->raw_transitions(), 0)); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 71 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 72 | TransitionArray::Insert(map0, name2, map2, SIMPLE_PROPERTY_TRANSITION); |
| 73 | CHECK(TransitionArray::IsFullTransitionArray(map0->raw_transitions())); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 74 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 75 | CHECK_EQ(*map1, |
| 76 | TransitionArray::SearchTransition(*map0, kData, *name1, attributes)); |
| 77 | CHECK_EQ(*map2, |
| 78 | TransitionArray::SearchTransition(*map0, kData, *name2, attributes)); |
| 79 | CHECK_EQ(2, TransitionArray::NumberOfTransitions(map0->raw_transitions())); |
| 80 | for (int i = 0; i < 2; i++) { |
| 81 | Name* key = TransitionArray::GetKey(map0->raw_transitions(), i); |
| 82 | Map* target = TransitionArray::GetTarget(map0->raw_transitions(), i); |
| 83 | CHECK((key == *name1 && target == *map1) || |
| 84 | (key == *name2 && target == *map2)); |
| 85 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 86 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 87 | #ifdef DEBUG |
| 88 | CHECK(TransitionArray::IsSortedNoDuplicates(*map0)); |
| 89 | #endif |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 90 | } |
| 91 | |
| 92 | |
| 93 | TEST(TransitionArray_FullFieldTransitions) { |
| 94 | CcTest::InitializeVM(); |
| 95 | v8::HandleScope scope(CcTest::isolate()); |
| 96 | Isolate* isolate = CcTest::i_isolate(); |
| 97 | Factory* factory = isolate->factory(); |
| 98 | |
| 99 | Handle<String> name1 = factory->InternalizeUtf8String("foo"); |
| 100 | Handle<String> name2 = factory->InternalizeUtf8String("bar"); |
| 101 | PropertyAttributes attributes = NONE; |
| 102 | |
| 103 | Handle<Map> map0 = Map::Create(isolate, 0); |
| 104 | Handle<Map> map1 = |
| 105 | Map::CopyWithField(map0, name1, handle(HeapType::Any(), isolate), |
| 106 | attributes, Representation::Tagged(), |
| 107 | OMIT_TRANSITION).ToHandleChecked(); |
| 108 | Handle<Map> map2 = |
| 109 | Map::CopyWithField(map0, name2, handle(HeapType::Any(), isolate), |
| 110 | attributes, Representation::Tagged(), |
| 111 | OMIT_TRANSITION).ToHandleChecked(); |
| 112 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 113 | CHECK(map0->raw_transitions()->IsSmi()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 114 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 115 | TransitionArray::Insert(map0, name1, map1, PROPERTY_TRANSITION); |
| 116 | CHECK(TransitionArray::IsFullTransitionArray(map0->raw_transitions())); |
| 117 | CHECK_EQ(*map1, |
| 118 | TransitionArray::SearchTransition(*map0, kData, *name1, attributes)); |
| 119 | CHECK_EQ(1, TransitionArray::NumberOfTransitions(map0->raw_transitions())); |
| 120 | CHECK_EQ(*name1, TransitionArray::GetKey(map0->raw_transitions(), 0)); |
| 121 | CHECK_EQ(*map1, TransitionArray::GetTarget(map0->raw_transitions(), 0)); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 122 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 123 | TransitionArray::Insert(map0, name2, map2, PROPERTY_TRANSITION); |
| 124 | CHECK(TransitionArray::IsFullTransitionArray(map0->raw_transitions())); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 125 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 126 | CHECK_EQ(*map1, |
| 127 | TransitionArray::SearchTransition(*map0, kData, *name1, attributes)); |
| 128 | CHECK_EQ(*map2, |
| 129 | TransitionArray::SearchTransition(*map0, kData, *name2, attributes)); |
| 130 | CHECK_EQ(2, TransitionArray::NumberOfTransitions(map0->raw_transitions())); |
| 131 | for (int i = 0; i < 2; i++) { |
| 132 | Name* key = TransitionArray::GetKey(map0->raw_transitions(), i); |
| 133 | Map* target = TransitionArray::GetTarget(map0->raw_transitions(), i); |
| 134 | CHECK((key == *name1 && target == *map1) || |
| 135 | (key == *name2 && target == *map2)); |
| 136 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 137 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 138 | #ifdef DEBUG |
| 139 | CHECK(TransitionArray::IsSortedNoDuplicates(*map0)); |
| 140 | #endif |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 141 | } |
| 142 | |
| 143 | |
| 144 | TEST(TransitionArray_DifferentFieldNames) { |
| 145 | CcTest::InitializeVM(); |
| 146 | v8::HandleScope scope(CcTest::isolate()); |
| 147 | Isolate* isolate = CcTest::i_isolate(); |
| 148 | Factory* factory = isolate->factory(); |
| 149 | |
| 150 | const int PROPS_COUNT = 10; |
| 151 | Handle<String> names[PROPS_COUNT]; |
| 152 | Handle<Map> maps[PROPS_COUNT]; |
| 153 | PropertyAttributes attributes = NONE; |
| 154 | |
| 155 | Handle<Map> map0 = Map::Create(isolate, 0); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 156 | CHECK(map0->raw_transitions()->IsSmi()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 157 | |
| 158 | for (int i = 0; i < PROPS_COUNT; i++) { |
| 159 | EmbeddedVector<char, 64> buffer; |
| 160 | SNPrintF(buffer, "prop%d", i); |
| 161 | Handle<String> name = factory->InternalizeUtf8String(buffer.start()); |
| 162 | Handle<Map> map = |
| 163 | Map::CopyWithField(map0, name, handle(HeapType::Any(), isolate), |
| 164 | attributes, Representation::Tagged(), |
| 165 | OMIT_TRANSITION).ToHandleChecked(); |
| 166 | names[i] = name; |
| 167 | maps[i] = map; |
| 168 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 169 | TransitionArray::Insert(map0, name, map, PROPERTY_TRANSITION); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 170 | } |
| 171 | |
| 172 | for (int i = 0; i < PROPS_COUNT; i++) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 173 | CHECK_EQ(*maps[i], TransitionArray::SearchTransition( |
| 174 | *map0, kData, *names[i], attributes)); |
| 175 | } |
| 176 | for (int i = 0; i < PROPS_COUNT; i++) { |
| 177 | Name* key = TransitionArray::GetKey(map0->raw_transitions(), i); |
| 178 | Map* target = TransitionArray::GetTarget(map0->raw_transitions(), i); |
| 179 | for (int j = 0; j < PROPS_COUNT; j++) { |
| 180 | if (*names[i] == key) { |
| 181 | CHECK_EQ(*maps[i], target); |
| 182 | break; |
| 183 | } |
| 184 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 185 | } |
| 186 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 187 | #ifdef DEBUG |
| 188 | CHECK(TransitionArray::IsSortedNoDuplicates(*map0)); |
| 189 | #endif |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 190 | } |
| 191 | |
| 192 | |
| 193 | TEST(TransitionArray_SameFieldNamesDifferentAttributesSimple) { |
| 194 | CcTest::InitializeVM(); |
| 195 | v8::HandleScope scope(CcTest::isolate()); |
| 196 | Isolate* isolate = CcTest::i_isolate(); |
| 197 | Factory* factory = isolate->factory(); |
| 198 | |
| 199 | Handle<Map> map0 = Map::Create(isolate, 0); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 200 | CHECK(map0->raw_transitions()->IsSmi()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 201 | |
| 202 | const int ATTRS_COUNT = (READ_ONLY | DONT_ENUM | DONT_DELETE) + 1; |
| 203 | STATIC_ASSERT(ATTRS_COUNT == 8); |
| 204 | Handle<Map> attr_maps[ATTRS_COUNT]; |
| 205 | Handle<String> name = factory->InternalizeUtf8String("foo"); |
| 206 | |
| 207 | // Add transitions for same field name but different attributes. |
| 208 | for (int i = 0; i < ATTRS_COUNT; i++) { |
| 209 | PropertyAttributes attributes = static_cast<PropertyAttributes>(i); |
| 210 | |
| 211 | Handle<Map> map = |
| 212 | Map::CopyWithField(map0, name, handle(HeapType::Any(), isolate), |
| 213 | attributes, Representation::Tagged(), |
| 214 | OMIT_TRANSITION).ToHandleChecked(); |
| 215 | attr_maps[i] = map; |
| 216 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 217 | TransitionArray::Insert(map0, name, map, PROPERTY_TRANSITION); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 218 | } |
| 219 | |
| 220 | // Ensure that transitions for |name| field are valid. |
| 221 | for (int i = 0; i < ATTRS_COUNT; i++) { |
| 222 | PropertyAttributes attributes = static_cast<PropertyAttributes>(i); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 223 | CHECK_EQ(*attr_maps[i], TransitionArray::SearchTransition( |
| 224 | *map0, kData, *name, attributes)); |
| 225 | // All transitions use the same key, so this check doesn't need to |
| 226 | // care about ordering. |
| 227 | CHECK_EQ(*name, TransitionArray::GetKey(map0->raw_transitions(), i)); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 228 | } |
| 229 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 230 | #ifdef DEBUG |
| 231 | CHECK(TransitionArray::IsSortedNoDuplicates(*map0)); |
| 232 | #endif |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 233 | } |
| 234 | |
| 235 | |
| 236 | TEST(TransitionArray_SameFieldNamesDifferentAttributes) { |
| 237 | CcTest::InitializeVM(); |
| 238 | v8::HandleScope scope(CcTest::isolate()); |
| 239 | Isolate* isolate = CcTest::i_isolate(); |
| 240 | Factory* factory = isolate->factory(); |
| 241 | |
| 242 | const int PROPS_COUNT = 10; |
| 243 | Handle<String> names[PROPS_COUNT]; |
| 244 | Handle<Map> maps[PROPS_COUNT]; |
| 245 | |
| 246 | Handle<Map> map0 = Map::Create(isolate, 0); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 247 | CHECK(map0->raw_transitions()->IsSmi()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 248 | |
| 249 | // Some number of fields. |
| 250 | for (int i = 0; i < PROPS_COUNT; i++) { |
| 251 | EmbeddedVector<char, 64> buffer; |
| 252 | SNPrintF(buffer, "prop%d", i); |
| 253 | Handle<String> name = factory->InternalizeUtf8String(buffer.start()); |
| 254 | Handle<Map> map = |
| 255 | Map::CopyWithField(map0, name, handle(HeapType::Any(), isolate), NONE, |
| 256 | Representation::Tagged(), |
| 257 | OMIT_TRANSITION).ToHandleChecked(); |
| 258 | names[i] = name; |
| 259 | maps[i] = map; |
| 260 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 261 | TransitionArray::Insert(map0, name, map, PROPERTY_TRANSITION); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 262 | } |
| 263 | |
| 264 | const int ATTRS_COUNT = (READ_ONLY | DONT_ENUM | DONT_DELETE) + 1; |
| 265 | STATIC_ASSERT(ATTRS_COUNT == 8); |
| 266 | Handle<Map> attr_maps[ATTRS_COUNT]; |
| 267 | Handle<String> name = factory->InternalizeUtf8String("foo"); |
| 268 | |
| 269 | // Add transitions for same field name but different attributes. |
| 270 | for (int i = 0; i < ATTRS_COUNT; i++) { |
| 271 | PropertyAttributes attributes = static_cast<PropertyAttributes>(i); |
| 272 | |
| 273 | Handle<Map> map = |
| 274 | Map::CopyWithField(map0, name, handle(HeapType::Any(), isolate), |
| 275 | attributes, Representation::Tagged(), |
| 276 | OMIT_TRANSITION).ToHandleChecked(); |
| 277 | attr_maps[i] = map; |
| 278 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 279 | TransitionArray::Insert(map0, name, map, PROPERTY_TRANSITION); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 280 | } |
| 281 | |
| 282 | // Ensure that transitions for |name| field are valid. |
| 283 | for (int i = 0; i < ATTRS_COUNT; i++) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 284 | PropertyAttributes attr = static_cast<PropertyAttributes>(i); |
| 285 | CHECK_EQ(*attr_maps[i], |
| 286 | TransitionArray::SearchTransition(*map0, kData, *name, attr)); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 287 | } |
| 288 | |
| 289 | // Ensure that info about the other fields still valid. |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 290 | CHECK_EQ(PROPS_COUNT + ATTRS_COUNT, |
| 291 | TransitionArray::NumberOfTransitions(map0->raw_transitions())); |
| 292 | for (int i = 0; i < PROPS_COUNT + ATTRS_COUNT; i++) { |
| 293 | Name* key = TransitionArray::GetKey(map0->raw_transitions(), i); |
| 294 | Map* target = TransitionArray::GetTarget(map0->raw_transitions(), i); |
| 295 | if (key == *name) { |
| 296 | // Attributes transition. |
| 297 | PropertyAttributes attributes = |
| 298 | target->GetLastDescriptorDetails().attributes(); |
| 299 | CHECK_EQ(*attr_maps[static_cast<int>(attributes)], target); |
| 300 | } else { |
| 301 | for (int j = 0; j < PROPS_COUNT; j++) { |
| 302 | if (*names[j] == key) { |
| 303 | CHECK_EQ(*maps[j], target); |
| 304 | break; |
| 305 | } |
| 306 | } |
| 307 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 308 | } |
| 309 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame^] | 310 | #ifdef DEBUG |
| 311 | CHECK(TransitionArray::IsSortedNoDuplicates(*map0)); |
| 312 | #endif |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 313 | } |