Merge r77 from upstream tcmalloc to the local chromium branch....

third_party/tcmalloc/chromium/src/debugallocation.cc

 // Copyright (c) 2000, 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 656 matching lines @@
         symbolization_table[pc] = "";
       }
       int sym_buffer_len = kSymbolSize * num_symbols;
       char *sym_buffer = new char[sym_buffer_len];
       if (FLAGS_symbolize_stacktrace)
         Symbolize(sym_buffer, sym_buffer_len, &symbolization_table);
       for (int i = 0; i < num_symbols; i++) {
         uintptr_t pc =
             reinterpret_cast<uintptr_t>(queue_entry.deleter_pcs[i]) - 1;
         TracePrintf(STDERR_FILENO, "    @ %p %s\n",
-                    reinterpret_cast<void*>(pc), symbolization_table[pc]);
+                    pc, symbolization_table[pc]);
       }
     } else {
       RAW_LOG(ERROR,
               "Skipping the printing of the deleter's stack!  Its stack was "
               "not found; either the corruption occurred too early in "
               "execution to obtain a stack trace or --max_free_queue_size was "
               "set to 0.");
     }
 
     RAW_LOG(FATAL,
@@ skipping 694 matching lines @@
   void  __libc_cfree(void* ptr)                 { cfree(ptr);                }
   void* __libc_memalign(size_t align, size_t s) { return memalign(align, s); }
   void* __libc_valloc(size_t size)              { return valloc(size);       }
   void* __libc_pvalloc(size_t size)             { return pvalloc(size);      }
   int __posix_memalign(void** r, size_t a, size_t s) {
     return posix_memalign(r, a, s);
   }
 }
 
 #endif  // #ifdef TCMALLOC_FOR_DEBUGALLOCATION