AllocationProfiler: introduce allocation_profiler flag in V8 api.

src/heap-snapshot-generator.cc

 // Copyright 2013 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 466 matching lines @@
                                                 unsigned int size,
                                                 bool accessed) {
   ASSERT(static_cast<uint32_t>(entries_.length()) > entries_map_.occupancy());
   HashMap::Entry* entry = entries_map_.Lookup(addr, ComputePointerHash(addr),
                                               true);
   if (entry->value != NULL) {
     int entry_index =
         static_cast<int>(reinterpret_cast<intptr_t>(entry->value));
     EntryInfo& entry_info = entries_.at(entry_index);
     entry_info.accessed = accessed;
-    if (FLAG_heap_profiler_trace_objects) {
+    if (FLAG_heap_profiler_trace_objects && entry_info.size != size) {
       PrintF("Update object size : %p with old size %d and new size %d\n",
              addr,
              entry_info.size,
              size);
     }
     entry_info.size = size;
     return entry_info.id;
   }
   entry->value = reinterpret_cast<void*>(entries_.length());
   SnapshotObjectId id = next_id_;
@@ skipping 113 matching lines @@
   }
   if (FLAG_heap_profiler_trace_objects) {
     PrintF("\nBegin HeapObjectsMap::FindUntrackedObjects. %d entries in map.\n",
            entries_map_.occupancy());
     heap_objects.Sort(comparator);
     int last_printed_object = -1;
     bool print_next_object = false;
     for (int i = 0; i < heap_objects.length(); ++i) {
       const HeapObjectInfo& object_info = heap_objects[i];
       if (!object_info.IsValid()) {
-        ++untracked;
         if (last_printed_object != i - 1) {
           if (i > 0) {
             PrintF("%d objects were skipped\n", i - 1 - last_printed_object);
             heap_objects[i - 1].Print();
           }
         }
         object_info.Print();
         last_printed_object = i;
         print_next_object = true;
       } else if (print_next_object) {
@@ skipping 2394 matching lines @@
   writer_->AddString("\"<dummy>\"");
   for (int i = 1; i < sorted_strings.length(); ++i) {
     writer_->AddCharacter(',');
     SerializeString(sorted_strings[i]);
     if (writer_->aborted()) return;
   }
 }
 
 
 } }  // namespace v8::internal