Fix compilation of heap compaction debug diagnostics code.

third_party/WebKit/Source/platform/heap/HeapPage.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 514 matching lines @@
           payload + allocation_point, freed_size);
     }
   }
 
   // Return available pages to the free page pool, decommitting them from
   // the pagefile.
   BasePage* available_pages = context.available_pages_;
   while (available_pages) {
     size_t page_size = available_pages->size();
 #if DEBUG_HEAP_COMPACTION
-    if (!freedPageCount)
+    if (!freed_page_count)
       LOG_HEAP_COMPACTION("Releasing:");
-    LOG_HEAP_COMPACTION(" [%p, %p]", availablePages, availablePages + pageSize);
+    LOG_HEAP_COMPACTION(" [%p, %p]", available_pages,
+                        available_pages + page_size);
 #endif
     freed_size += page_size;
     freed_page_count++;
     BasePage* next_page;
     available_pages->Unlink(&next_page);
 #if !(DCHECK_IS_ON() || defined(LEAK_SANITIZER) || \
       defined(ADDRESS_SANITIZER) || defined(MEMORY_SANITIZER))
     // Clear out the page before adding it to the free page pool, which
     // decommits it. Recommitting the page must find a zeroed page later.
     // We cannot assume that the OS will hand back a zeroed page across
@@ skipping 634 matching lines @@
 size_t FreeList::FreeListSize() const {
   size_t free_size = 0;
   for (unsigned i = 0; i < kBlinkPageSizeLog2; ++i) {
     FreeListEntry* entry = free_lists_[i];
     while (entry) {
       free_size += entry->size();
       entry = entry->Next();
     }
   }
 #if DEBUG_HEAP_FREELIST
-  if (freeSize) {
-    LOG_HEAP_FREELIST_VERBOSE("FreeList(%p): %zu\n", this, freeSize);
-    for (unsigned i = 0; i < blinkPageSizeLog2; ++i) {
-      FreeListEntry* entry = m_freeLists[i];
+  if (free_size) {
+    LOG_HEAP_FREELIST_VERBOSE("FreeList(%p): %zu\n", this, free_size);
+    for (unsigned i = 0; i < kBlinkPageSizeLog2; ++i) {
+      FreeListEntry* entry = free_lists_[i];
       size_t bucket = 0;
       size_t count = 0;
       while (entry) {
         bucket += entry->size();
         count++;
-        entry = entry->next();
+        entry = entry->Next();
       }
       if (bucket) {
         LOG_HEAP_FREELIST_VERBOSE("[%d, %d]: %zu (%zu)\n", 0x1 << i,
                                   0x1 << (i + 1), bucket, count);
       }
     }
   }
 #endif
   return free_size;
 }
@@ skipping 627 matching lines @@
 
   has_entries_ = true;
   size_t index = GetHash(address);
   DCHECK(!(index & 1));
   Address cache_page = RoundToBlinkPageStart(address);
   entries_[index + 1] = entries_[index];
   entries_[index] = cache_page;
 }
 
 }  // namespace blink