Minor cleanups of numeric seeded hashing patch.

test/cctest/test-hashing.cc

 // Copyright 2011 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 188 matching lines @@
   HASH_FUNCTION hash = FUNCTION_CAST<HASH_FUNCTION>(code->entry());
 #ifdef USE_SIMULATOR
   uint32_t codegen_hash =
       reinterpret_cast<uint32_t>(CALL_GENERATED_CODE(hash, 0, 0, 0, 0, 0));
 #else
   uint32_t codegen_hash = hash();
 #endif
 
   uint32_t runtime_hash = ComputeIntegerHash(
       key,
-      Isolate::Current()->heap()->StringHashSeed());
+      Isolate::Current()->heap()->HashSeed());
   CHECK(runtime_hash == codegen_hash);
 }
 
 
 void check_twochars(char a, char b) {
   char ab[2] = {a, b};
   check(i::Vector<const char>(ab, 2));
 }
 
 
@@ skipping 31 matching lines @@
   // Some pseudo-random numbers
   static const uint32_t kLimit = 1000;
   for (uint32_t i = 0; i < 5; i++) {
     for (uint32_t j = 0; j < 5; j++) {
       check(PseudoRandom(i, j) % kLimit);
     }
   }
 }
 
 #undef __