Make Win64 compile.

src/spaces-inl.h

 // 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 150 matching lines @@
 // PagedSpace
 Page* Page::Initialize(Heap* heap,
                        MemoryChunk* chunk,
                        Executability executable,
                        PagedSpace* owner) {
   Page* page = reinterpret_cast<Page*>(chunk);
   ASSERT(chunk->size() == static_cast<size_t>(kPageSize));
   ASSERT(chunk->owner() == owner);
   owner->IncreaseCapacity(Page::kObjectAreaSize);
   owner->Free(page->ObjectAreaStart(),
-              page->ObjectAreaEnd() - page->ObjectAreaStart());
+              static_cast<int>(page->ObjectAreaEnd() -
+                               page->ObjectAreaStart()));
 
   heap->incremental_marking()->SetOldSpacePageFlags(chunk);
 
   return page;
 }
 
 
 bool PagedSpace::Contains(Address addr) {
   Page* p = Page::FromAddress(addr);
   if (!p->is_valid()) return false;
@@ skipping 112 matching lines @@
   Address old_top = allocation_info_.top;
   if (allocation_info_.limit - old_top < size_in_bytes) {
     Address new_top = old_top + size_in_bytes;
     Address high = to_space_.page_high();
     if (allocation_info_.limit < high) {
       // Incremental marking has lowered the limit to get a
       // chance to do a step.
       allocation_info_.limit = Min(
           allocation_info_.limit + inline_allocation_limit_step_,
           high);
-      int bytes_allocated = new_top - top_on_previous_step_;
+      int bytes_allocated = static_cast<int>(new_top - top_on_previous_step_);
       heap()->incremental_marking()->Step(bytes_allocated);
       top_on_previous_step_ = new_top;
       return AllocateRawInternal(size_in_bytes);
     } else if (AddFreshPage()) {
       // Switched to new page. Try allocating again.
-      int bytes_allocated = old_top - top_on_previous_step_;
+      int bytes_allocated = static_cast<int>(old_top - top_on_previous_step_);
       heap()->incremental_marking()->Step(bytes_allocated);
       top_on_previous_step_ = to_space_.page_low();
       return AllocateRawInternal(size_in_bytes);
     } else {
       return Failure::RetryAfterGC();
     }
   }
 
   Object* obj = HeapObject::FromAddress(allocation_info_.top);
   allocation_info_.top += size_in_bytes;
@@ skipping 34 matching lines @@
 bool FreeListNode::IsFreeListNode(HeapObject* object) {
   // TODO(gc) ISOLATES MERGE
   return object->map() == HEAP->raw_unchecked_free_space_map()
       || object->map() == HEAP->raw_unchecked_one_pointer_filler_map()
       || object->map() == HEAP->raw_unchecked_two_pointer_filler_map();
 }
 
 } }  // namespace v8::internal
 
 #endif  // V8_SPACES_INL_H_