Patch (SSE3) for faster To(U)Int32 conversion in bit

src/serialize.cc

 // Copyright 2006-2008 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 912 matching lines @@
 
 Serializer::~Serializer() {
   for (int i = 0; i <= LAST_SPACE; i++) {
     delete allocator_[i];
   }
   if (reference_encoder_) delete reference_encoder_;
   delete writer_;
 }
 
 
-bool Serializer::serialization_enabled_ = true;
+bool Serializer::serialization_enabled_ = false;
 
 
 #ifdef DEBUG
 static const int kMaxTagLength = 32;
 
 void Serializer::Synchronize(const char* tag) {
   if (FLAG_debug_serialization) {
     int length = strlen(tag);
     ASSERT(length <= kMaxTagLength);
     writer_->PutC('S');
@@ skipping 42 matching lines @@
   // We need a counter function during serialization to resolve the
   // references to counters in the code on the heap.
   CHECK(StatsTable::HasCounterFunction());
   CHECK(enabled());
   InitializeAllocators();
   reference_encoder_ = new ExternalReferenceEncoder();
   PutHeader();
   Heap::IterateRoots(this);
   PutLog();
   PutContextStack();
-  disable();
+  Disable();
 }
 
 
 void Serializer::Finalize(byte** str, int* len) {
   writer_->GetBytes(str, len);
 }
 
 
 // Serialize objects by writing them into the stream.
 
@@ skipping 580 matching lines @@
         ASSERT(index < large_objects_.length());
       }
       return large_objects_[index];  // s.page_offset() is ignored.
   }
   UNREACHABLE();
   return NULL;
 }
 
 
 } }  // namespace v8::internal