Fix more warnings in wtf

Source/wtf/PartitionAlloc.cpp

 /*
  * Copyright (C) 2013 Google Inc. 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
@@ skipping 341 matching lines @@
             return ret;
         }
         if (LIKELY(next->numUnprovisionedSlots)) {
             bucket->currPage = next;
             return partitionPageAllocAndFillFreelist(next);
         }
         // Pull this page out of the non-full page list, since it has no free
         // slots.
         // This tags the page as full so that free'ing can tell, and move
         // the page back into the non-full page list when appropriate.
-        ASSERT(next->numAllocatedSlots == partitionBucketSlots(bucket));
+        ASSERT(next->numAllocatedSlots == static_cast<int>(partitionBucketSlots(bucket)));
         next->numAllocatedSlots = -next->numAllocatedSlots;
         partitionUnlinkPage(next);
         ++bucket->numFullPages;
 
         next = next->next;
     }
 
     // After we've considered and rejected every partition page in the list,
     // we should by definition have a single self-linked page left. We will
     // replace this single page with the new page we choose.
     ASSERT(page == page->next);
     ASSERT(page == page->prev);
-    ASSERT(page == &bucket->root->seedPage || page->numAllocatedSlots == partitionBucketSlots(bucket));
+    ASSERT(page == &bucket->root->seedPage || page->numAllocatedSlots == static_cast<int>(partitionBucketSlots(bucket)));
     if (LIKELY(page != &bucket->root->seedPage)) {
         page->numAllocatedSlots = -page->numAllocatedSlots;
         ++bucket->numFullPages;
     }
 
     // Third, look in our list of freed but reserved pages.
     PartitionPageHeader* newPage;
     PartitionFreepagelistEntry* pagelist = bucket->freePages;
     if (LIKELY(pagelist != 0)) {
         ASSERT(page != &bucket->root->seedPage);
@@ skipping 48 matching lines @@
         // Ensure that the page is full. That's the only valid case if we
         // arrive here.
         ASSERT(page->numAllocatedSlots < 0);
         // Fully used page became partially used. It must be put back on the
         // non-full page list. Also make it the current page to increase the
         // chances of it being filled up again. The old current page will be
         // the next page.
         partitionLinkPageBefore(page, bucket->currPage);
         bucket->currPage = page;
         page->numAllocatedSlots = -page->numAllocatedSlots - 2;
-        ASSERT(page->numAllocatedSlots == partitionBucketSlots(bucket) - 1);
+        ASSERT(page->numAllocatedSlots == static_cast<int>(partitionBucketSlots(bucket) - 1));
         --bucket->numFullPages;
     }
 }
 
 void* partitionReallocGeneric(PartitionRoot* root, void* ptr, size_t newSize)
 {
 #if defined(MEMORY_TOOL_REPLACES_ALLOCATOR)
     return realloc(ptr, newSize);
 #else
     size_t oldIndex;
@@ skipping 81 matching lines @@
     printf("total live: %ld bytes\n", totalLive);
     printf("total resident: %ld bytes\n", totalResident);
     printf("total freeable: %ld bytes\n", totalFreeable);
     fflush(stdout);
 }
 
 #endif // !NDEBUG
 
 } // namespace WTF