Fix compilation failure introduced by r10601.

src/mark-compact.cc

 // Copyright 2012 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 525 matching lines @@
       reduce_memory_footprint_) {
     mode = REDUCE_MEMORY_FOOTPRINT;
 
     // We expect that empty pages are easier to compact so slightly bump the
     // limit.
     max_evacuation_candidates += 2;
 
     if (FLAG_trace_fragmentation) {
       PrintF("Estimated over reserved memory: %.1f MB (setting threshold %d)\n",
              static_cast<double>(over_reserved) / MB,
-             kFreenessThreshold);
+             static_cast<int>(kFreenessThreshold));
     }
   }
 
   intptr_t estimated_release = 0;
 
   Candidate candidates[kMaxMaxEvacuationCandidates];
 
   int count = 0;
   int fragmentation = 0;
   Candidate* least = NULL;
@@ skipping 32 matching lines @@
             (Page::kObjectAreaSize - free_bytes);
         fragmentation = free_pct;
       } else {
         fragmentation = 0;
       }
 
       if (FLAG_trace_fragmentation) {
         PrintF("%p [%s]: %d (%.2f%%) free %s\n",
                reinterpret_cast<void*>(p),
                AllocationSpaceName(space->identity()),
-               free_bytes,
+               static_cast<int>(free_bytes),
                static_cast<double>(free_bytes * 100) / Page::kObjectAreaSize,
                (fragmentation > 0) ? "[fragmented]" : "");
       }
     } else {
       fragmentation = FreeListFragmentation(space, p);
     }
 
     if (fragmentation != 0) {
       if (count < max_evacuation_candidates) {
         candidates[count++] = Candidate(fragmentation, p);
@@ skipping 3476 matching lines @@
   while (buffer != NULL) {
     SlotsBuffer* next_buffer = buffer->next();
     DeallocateBuffer(buffer);
     buffer = next_buffer;
   }
   *buffer_address = NULL;
 }
 
 
 } }  // namespace v8::internal