Replace our home-grown BitCast with bit_cast from Chrome/Google3.

src/handles-inl.h

 // Copyright 2006-2008 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.
 //
 
 #ifndef V8_HANDLES_INL_H_
 #define V8_HANDLES_INL_H_
 
 #include "src/api.h"
 #include "src/handles.h"
@@ skipping 23 matching lines @@
       (o.location_ == NULL || o.IsDereferenceAllowed(NO_DEFERRED_CHECK)));
   if (location_ == o.location_) return true;
   if (location_ == NULL || o.location_ == NULL) return false;
   return *location_ == *o.location_;
 }
 
 
 template <typename T>
 inline T* Handle<T>::operator*() const {
   SLOW_DCHECK(IsDereferenceAllowed(INCLUDE_DEFERRED_CHECK));
-  return *BitCast<T**>(location_);
+  return *bit_cast<T**>(location_);
 }
 
 template <typename T>
 inline T** Handle<T>::location() const {
   SLOW_DCHECK(location_ == NULL ||
               IsDereferenceAllowed(INCLUDE_DEFERRED_CHECK));
   return location_;
 }
 
 #ifdef DEBUG
 template <typename T>
 bool Handle<T>::IsDereferenceAllowed(DereferenceCheckMode mode) const {
   DCHECK(location_ != NULL);
-  Object* object = *BitCast<T**>(location_);
+  Object* object = *bit_cast<T**>(location_);
   if (object->IsSmi()) return true;
   HeapObject* heap_object = HeapObject::cast(object);
   Heap* heap = heap_object->GetHeap();
   Object** handle = reinterpret_cast<Object**>(location_);
   Object** roots_array_start = heap->roots_array_start();
   if (roots_array_start <= handle &&
       handle < roots_array_start + Heap::kStrongRootListLength &&
       heap->RootCanBeTreatedAsConstant(
         static_cast<Heap::RootListIndex>(handle - roots_array_start))) {
     return true;
@@ skipping 105 matching lines @@
   current->level = level_;
   DCHECK_EQ(current->next, current->limit);
   current->limit = limit_;
 }
 
 #endif
 
 } }  // namespace v8::internal
 
 #endif  // V8_HANDLES_INL_H_