Using PropertyKind in transitions instead of PropertyType.

test/cctest/test-transitions.cc

 // 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 <stdlib.h>
 #include <utility>
 
 #include "src/v8.h"
 
 #include "src/compilation-cache.h"
@@ skipping 41 matching lines @@
 
   CHECK(!map0->HasTransitionArray());
   Handle<TransitionArray> transitions = TransitionArray::Allocate(isolate, 0);
   CHECK(transitions->IsFullTransitionArray());
 
   int transition;
   transitions =
       transitions->Insert(map0, name1, map1, SIMPLE_PROPERTY_TRANSITION);
   ConnectTransition(map0, transitions, map1);
   CHECK(transitions->IsSimpleTransition());
-  transition = transitions->Search(FIELD, *name1, attributes);
+  transition = transitions->Search(DATA, *name1, attributes);
   CHECK_EQ(TransitionArray::kSimpleTransitionIndex, transition);
   CHECK_EQ(*name1, transitions->GetKey(transition));
   CHECK_EQ(*map1, transitions->GetTarget(transition));
 
   transitions =
       transitions->Insert(map0, name2, map2, SIMPLE_PROPERTY_TRANSITION);
   ConnectTransition(map0, transitions, map2);
   CHECK(transitions->IsFullTransitionArray());
 
-  transition = transitions->Search(FIELD, *name1, attributes);
+  transition = transitions->Search(DATA, *name1, attributes);
   CHECK_EQ(*name1, transitions->GetKey(transition));
   CHECK_EQ(*map1, transitions->GetTarget(transition));
 
-  transition = transitions->Search(FIELD, *name2, attributes);
+  transition = transitions->Search(DATA, *name2, attributes);
   CHECK_EQ(*name2, transitions->GetKey(transition));
   CHECK_EQ(*map2, transitions->GetTarget(transition));
 
   DCHECK(transitions->IsSortedNoDuplicates());
 }
 
 
 TEST(TransitionArray_FullFieldTransitions) {
   CcTest::InitializeVM();
   v8::HandleScope scope(CcTest::isolate());
@@ skipping 15 matching lines @@
                          OMIT_TRANSITION).ToHandleChecked();
 
   CHECK(!map0->HasTransitionArray());
   Handle<TransitionArray> transitions = TransitionArray::Allocate(isolate, 0);
   CHECK(transitions->IsFullTransitionArray());
 
   int transition;
   transitions = transitions->Insert(map0, name1, map1, PROPERTY_TRANSITION);
   ConnectTransition(map0, transitions, map1);
   CHECK(transitions->IsFullTransitionArray());
-  transition = transitions->Search(FIELD, *name1, attributes);
+  transition = transitions->Search(DATA, *name1, attributes);
   CHECK_EQ(*name1, transitions->GetKey(transition));
   CHECK_EQ(*map1, transitions->GetTarget(transition));
 
   transitions = transitions->Insert(map0, name2, map2, PROPERTY_TRANSITION);
   ConnectTransition(map0, transitions, map2);
   CHECK(transitions->IsFullTransitionArray());
 
-  transition = transitions->Search(FIELD, *name1, attributes);
+  transition = transitions->Search(DATA, *name1, attributes);
   CHECK_EQ(*name1, transitions->GetKey(transition));
   CHECK_EQ(*map1, transitions->GetTarget(transition));
 
-  transition = transitions->Search(FIELD, *name2, attributes);
+  transition = transitions->Search(DATA, *name2, attributes);
   CHECK_EQ(*name2, transitions->GetKey(transition));
   CHECK_EQ(*map2, transitions->GetTarget(transition));
 
   DCHECK(transitions->IsSortedNoDuplicates());
 }
 
 
 TEST(TransitionArray_DifferentFieldNames) {
   CcTest::InitializeVM();
   v8::HandleScope scope(CcTest::isolate());
@@ skipping 19 matching lines @@
                            attributes, Representation::Tagged(),
                            OMIT_TRANSITION).ToHandleChecked();
     names[i] = name;
     maps[i] = map;
 
     transitions = transitions->Insert(map0, name, map, PROPERTY_TRANSITION);
     ConnectTransition(map0, transitions, map);
   }
 
   for (int i = 0; i < PROPS_COUNT; i++) {
-    int transition = transitions->Search(FIELD, *names[i], attributes);
+    int transition = transitions->Search(DATA, *names[i], attributes);
     CHECK_EQ(*names[i], transitions->GetKey(transition));
     CHECK_EQ(*maps[i], transitions->GetTarget(transition));
   }
 
   DCHECK(transitions->IsSortedNoDuplicates());
 }
 
 
 TEST(TransitionArray_SameFieldNamesDifferentAttributesSimple) {
   CcTest::InitializeVM();
@@ skipping 22 matching lines @@
     attr_maps[i] = map;
 
     transitions = transitions->Insert(map0, name, map, PROPERTY_TRANSITION);
     ConnectTransition(map0, transitions, map);
   }
 
   // Ensure that transitions for |name| field are valid.
   for (int i = 0; i < ATTRS_COUNT; i++) {
     PropertyAttributes attributes = static_cast<PropertyAttributes>(i);
 
-    int transition = transitions->Search(FIELD, *name, attributes);
+    int transition = transitions->Search(DATA, *name, attributes);
     CHECK_EQ(*name, transitions->GetKey(transition));
     CHECK_EQ(*attr_maps[i], transitions->GetTarget(transition));
   }
 
   DCHECK(transitions->IsSortedNoDuplicates());
 }
 
 
 TEST(TransitionArray_SameFieldNamesDifferentAttributes) {
   CcTest::InitializeVM();
@@ skipping 42 matching lines @@
     attr_maps[i] = map;
 
     transitions = transitions->Insert(map0, name, map, PROPERTY_TRANSITION);
     ConnectTransition(map0, transitions, map);
   }
 
   // Ensure that transitions for |name| field are valid.
   for (int i = 0; i < ATTRS_COUNT; i++) {
     PropertyAttributes attributes = static_cast<PropertyAttributes>(i);
 
-    int transition = transitions->Search(FIELD, *name, attributes);
+    int transition = transitions->Search(DATA, *name, attributes);
     CHECK_EQ(*name, transitions->GetKey(transition));
     CHECK_EQ(*attr_maps[i], transitions->GetTarget(transition));
   }
 
   // Ensure that info about the other fields still valid.
   for (int i = 0; i < PROPS_COUNT; i++) {
-    int transition = transitions->Search(FIELD, *names[i], NONE);
+    int transition = transitions->Search(DATA, *names[i], NONE);
     CHECK_EQ(*names[i], transitions->GetKey(transition));
     CHECK_EQ(*maps[i], transitions->GetTarget(transition));
   }
 
   DCHECK(transitions->IsSortedNoDuplicates());
 }