Fix formatting.

src/profile-generator.cc

 // Copyright 2012 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 913 matching lines @@
     // If no frames were symbolized, put the VM state entry in.
     if (no_symbolized_entries) {
       *entry++ = EntryForVMState(sample.state);
     }
   }
 
   profiles_->AddPathToCurrentProfiles(entries);
 }
 
 
-HeapGraphEdge::HeapGraphEdge(
-    Type type, const char* name, int from, int to) :
-    type_(type),
-    from_index_(from),
-    to_index_(to),
-    name_(name) {
+HeapGraphEdge::HeapGraphEdge(Type type, const char* name, int from, int to)
+    : type_(type),
+      from_index_(from),
+      to_index_(to),
+      name_(name) {
   ASSERT(type == kContextVariable
       || type == kProperty
       || type == kInternal
       || type == kShortcut);
 }
 
 
-HeapGraphEdge::HeapGraphEdge(Type type, int index, int from, int to) :
-    type_(type),
-    from_index_(from),
-    to_index_(to),
-    index_(index) {
+HeapGraphEdge::HeapGraphEdge(Type type, int index, int from, int to)
+    : type_(type),
+      from_index_(from),
+      to_index_(to),
+      index_(index) {
   ASSERT(type == kElement || type == kHidden || type == kWeak);
 }
 
 
 void HeapGraphEdge::ReplaceToIndexWithEntry(HeapSnapshot* snapshot) {
   to_entry_ = &snapshot->entries()[to_index_];
 }
 
 
 const int HeapEntry::kNoEntry = -1;
 
 HeapEntry::HeapEntry(HeapSnapshot* snapshot,
                      Type type,
                      const char* name,
                      SnapshotObjectId id,
-                     int self_size) :
-    painted_(false),
-    user_reachable_(false),
-    dominator_(kNoEntry),
-    type_(type),
-    retainers_count_(0),
-    retainers_index_(-1),
-    children_count_(0),
-    children_index_(-1),
-    self_size_(self_size),
-    retained_size_(0),
-    id_(id),
-    snapshot_(snapshot),
-    name_(name) { }
+                     int self_size)
+    : painted_(false),
+      user_reachable_(false),
+      dominator_(kNoEntry),
+      type_(type),
+      retainers_count_(0),
+      retainers_index_(-1),
+      children_count_(0),
+      children_index_(-1),
+      self_size_(self_size),
+      retained_size_(0),
+      id_(id),
+      snapshot_(snapshot),
+      name_(name) { }
 
 
 void HeapEntry::SetNamedReference(HeapGraphEdge::Type type,
                                   const char* name,
                                   HeapEntry* entry) {
   HeapGraphEdge edge(type, name, this->index(), entry->index());
   snapshot_->edges().Add(edge);
   ++children_count_;
   ++entry->retainers_count_;
 }
@@ skipping 277 matching lines @@
   return &sorted_entries_;
 }
 
 
 void HeapSnapshot::Print(int max_depth) {
   root()->Print("", "", max_depth, 0);
 }
 
 
 template<typename T, class P>
-static size_t GetMemoryUsedByList(const List<T,P>& list) {
+static size_t GetMemoryUsedByList(const List<T, P>& list) {
   return list.capacity() * sizeof(T);
 }
 
 
 size_t HeapSnapshot::RawSnapshotSize() const {
   return
       GetMemoryUsedByList(entries_) +
       GetMemoryUsedByList(edges_) +
       GetMemoryUsedByList(children_) +
       GetMemoryUsedByList(retainers_) +
@@ skipping 2490 matching lines @@
 
 
 void HeapSnapshotJSONSerializer::SortHashMap(
     HashMap* map, List<HashMap::Entry*>* sorted_entries) {
   for (HashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p))
     sorted_entries->Add(p);
   sorted_entries->Sort(SortUsingEntryValue);
 }
 
 } }  // namespace v8::internal