Removed transitions from the accessor pair descriptors.

src/objects-debug.cc

 // Copyright 2012 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 931 matching lines @@
   return !target->IsMap() || Map::cast(target)->GetBackPointer() == current_map;
 }
 
 
 bool TransitionArray::IsConsistentWithBackPointers(Map* current_map) {
   if (HasElementsTransition() &&
       !CheckOneBackPointer(current_map, elements_transition())) {
     return false;
   }
   for (int i = 0; i < number_of_transitions(); ++i) {
-    Object* value = GetValue(i);
-    if (value->IsAccessorPair()) {
-      AccessorPair* accessors = AccessorPair::cast(value);
-      if (!CheckOneBackPointer(current_map, accessors->getter())) return false;
-      if (!CheckOneBackPointer(current_map, accessors->setter())) return false;
-    } else {
-      ASSERT(value->IsMap());
-      if (!CheckOneBackPointer(current_map, value)) return false;
-    }
+    if (!CheckOneBackPointer(current_map, GetTarget(i))) return false;
   }
   return true;
 }
 
 
 void JSFunctionResultCache::JSFunctionResultCacheVerify() {
   JSFunction::cast(get(kFactoryIndex))->Verify();
 
   int size = Smi::cast(get(kCacheSizeIndex))->value();
   ASSERT(kEntriesIndex <= size);
@@ skipping 45 matching lines @@
   FixedArray* proto_transitions = GetPrototypeTransitions();
   MemsetPointer(proto_transitions->data_start(),
                 GetHeap()->the_hole_value(),
                 proto_transitions->length());
 }
 
 
 #endif  // DEBUG
 
 } }  // namespace v8::internal