Changed the dictionary code to use original hash value when starting linear s...

src/objects.cc

 // Copyright 2006-2009 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 6503 matching lines @@
 
 
 
 // Find entry for key otherwise return -1.
 template<typename Shape, typename Key>
 int HashTable<Shape, Key>::FindEntry(Key key) {
   uint32_t mask = Capacity() - 1;
   uint32_t hash = Shape::Hash(key);
 
   // For the first probes rotate the hash to ensure a proper spread.
+  uint32_t h = hash;
   for (uint32_t i = 0; i < kNofFastProbes; i++) {
-    int entry = hash & mask;
+    int entry = h & mask;
     Object* element = KeyAt(entry);
     if (element->IsUndefined()) return kNotFound;
     if (!element->IsNull() && Shape::IsMatch(key, element)) return entry;
-    hash = RotateRight(hash, kHashRotateShift);
+    h = RotateRight(h, kHashRotateShift);
   }
 
-
   // In this unlikely event, do a linear scan.
   for (uint32_t i = 1; i <= mask; i++) {
     int entry = ++hash & mask;
     Object* element = KeyAt(entry);
     if (element->IsUndefined()) return kNotFound;
     if (!element->IsNull() && Shape::IsMatch(key, element)) return entry;
   }
   return kNotFound;
 }
 
@@ skipping 34 matching lines @@
 }
 
 
 template<typename Shape, typename Key>
 uint32_t HashTable<Shape, Key>::FindInsertionEntry(uint32_t hash) {
   uint32_t mask = Capacity() - 1;
   int entry;
   Object* element;
 
   // For the first probes rotate the hash to ensure a proper spread.
+  uint32_t h = hash;
   for (uint32_t i = 0; i < kNofFastProbes; i++) {
-    entry = hash & mask;
+    entry = h & mask;
     element = KeyAt(entry);
     if (element->IsUndefined() || element->IsNull()) return entry;
-    hash = RotateRight(hash, kHashRotateShift);
+    h = RotateRight(h, kHashRotateShift);
   }
 
   do {
     entry = ++hash & mask;
     element = KeyAt(entry);
   } while (!(element->IsUndefined() || element->IsNull()));
 
   return entry;
 }
 
@@ skipping 1157 matching lines @@
   if (break_point_objects()->IsUndefined()) return 0;
   // Single beak point.
   if (!break_point_objects()->IsFixedArray()) return 1;
   // Multiple break points.
   return FixedArray::cast(break_point_objects())->length();
 }
 #endif
 
 
 } }  // namespace v8::internal