Revert "TransitionArray now uses <is_data_property, name, attributes> tuple as a key, which allows …

src/objects-debug.cc

 // Copyright 2012 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 "src/v8.h"
 
 #include "src/disasm.h"
 #include "src/disassembler.h"
 #include "src/heap/objects-visiting.h"
 #include "src/jsregexp.h"
@@ skipping 1151 matching lines @@
 }
 
 
 bool DescriptorArray::IsSortedNoDuplicates(int valid_entries) {
   if (valid_entries == -1) valid_entries = number_of_descriptors();
   Name* current_key = NULL;
   uint32_t current = 0;
   for (int i = 0; i < number_of_descriptors(); i++) {
     Name* key = GetSortedKey(i);
     if (key == current_key) {
-      Print();
+      OFStream os(stdout);
+      PrintDescriptors(os);
       return false;
     }
     current_key = key;
     uint32_t hash = GetSortedKey(i)->Hash();
     if (hash < current) {
-      Print();
+      OFStream os(stdout);
+      PrintDescriptors(os);
       return false;
     }
     current = hash;
   }
   return true;
 }
 
 
 bool LayoutDescriptor::IsConsistentWithMap(Map* map) {
   if (FLAG_unbox_double_fields) {
@@ skipping 11 matching lines @@
         if (tagged_actual != tagged_expected) return false;
       }
     }
   }
   return true;
 }
 
 
 bool TransitionArray::IsSortedNoDuplicates(int valid_entries) {
   DCHECK(valid_entries == -1);
-  Name* prev_key = NULL;
-  bool prev_is_data_property = false;
-  PropertyAttributes prev_attributes = NONE;
-  uint32_t prev_hash = 0;
+  Name* current_key = NULL;
+  uint32_t current = 0;
   for (int i = 0; i < number_of_transitions(); i++) {
     Name* key = GetSortedKey(i);
-    uint32_t hash = key->Hash();
-    bool is_data_property = false;
-    PropertyAttributes attributes = NONE;
-    if (!IsSpecialTransition(key)) {
-      Map* target = GetTarget(i);
-      PropertyDetails details = GetTargetDetails(key, target);
-      is_data_property = details.type() == FIELD || details.type() == CONSTANT;
-      attributes = details.attributes();
-    } else {
-      // Duplicate entries are not allowed for non-property transitions.
-      CHECK_NE(prev_key, key);
-    }
-
-    int cmp =
-        CompareKeys(prev_key, prev_hash, prev_is_data_property, prev_attributes,
-                    key, hash, is_data_property, attributes);
-    if (cmp >= 0) {
-      Print();
+    if (key == current_key) {
+      OFStream os(stdout);
+      PrintTransitions(os);
       return false;
     }
-    prev_key = key;
-    prev_hash = hash;
-    prev_attributes = attributes;
-    prev_is_data_property = is_data_property;
+    current_key = key;
+    uint32_t hash = GetSortedKey(i)->Hash();
+    if (hash < current) {
+      OFStream os(stdout);
+      PrintTransitions(os);
+      return false;
+    }
+    current = hash;
   }
   return true;
 }
 
 
 static bool CheckOneBackPointer(Map* current_map, Object* target) {
   return !target->IsMap() || Map::cast(target)->GetBackPointer() == current_map;
 }
 
 
@@ skipping 19 matching lines @@
     while (map != heap->roots_array_start()[i++]) {
       CHECK_LT(i, Heap::kStrongRootListLength);
     }
   }
 }
 
 
 #endif  // DEBUG
 
 } }  // namespace v8::internal