Fix Windows compilation after r15750

src/circular-queue.cc

 // Copyright 2010 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 17 matching lines @@
 #include "v8.h"
 
 #include "circular-queue-inl.h"
 
 namespace v8 {
 namespace internal {
 
 
 SamplingCircularQueue::SamplingCircularQueue(size_t record_size_in_bytes,
                                              size_t desired_chunk_size_in_bytes,
-                                             int buffer_size_in_chunks)
+                                             unsigned buffer_size_in_chunks)
     : record_size_(record_size_in_bytes / sizeof(Cell)),
       chunk_size_in_bytes_(desired_chunk_size_in_bytes / record_size_in_bytes *
                         record_size_in_bytes + sizeof(Cell)),
       chunk_size_(chunk_size_in_bytes_ / sizeof(Cell)),
       buffer_size_(chunk_size_ * buffer_size_in_chunks),
       buffer_(NewArray<Cell>(buffer_size_)) {
   ASSERT(record_size_ * sizeof(Cell) == record_size_in_bytes);
   ASSERT(chunk_size_ * sizeof(Cell) == chunk_size_in_bytes_);
   ASSERT(buffer_size_in_chunks > 2);
   // Mark all chunks as clear.
-  for (int i = 0; i < buffer_size_; i += chunk_size_) {
+  for (size_t i = 0; i < buffer_size_; i += chunk_size_) {
     buffer_[i] = kClear;
   }
 
   // Layout producer and consumer position pointers each on their own
   // cache lines to avoid cache lines thrashing due to simultaneous
   // updates of positions by different processor cores.
   const int positions_size =
       RoundUp(1, kProcessorCacheLineSize) +
       RoundUp(static_cast<int>(sizeof(ProducerPosition)),
               kProcessorCacheLineSize) +
@@ skipping 56 matching lines @@
 }
 
 
 void SamplingCircularQueue::FlushResidualRecords() {
   // Eliminate producer / consumer distance.
   consumer_pos_->dequeue_chunk_poll_pos = consumer_pos_->dequeue_chunk_pos;
 }
 
 
 } }  // namespace v8::internal