Clang format slam.

net/disk_cache/blockfile/rankings.h

Index: net/disk_cache/blockfile/rankings.h
diff --git a/net/disk_cache/blockfile/rankings.h b/net/disk_cache/blockfile/rankings.h
index 4224d0058eb0fff00c12345bf82adc88cf78ad47..9a25ed51d35b4c1b476f58cbfcf887546fd9dcaa 100644
--- a/net/disk_cache/blockfile/rankings.h
+++ b/net/disk_cache/blockfile/rankings.h
@@ -54,11 +54,11 @@ class Rankings {
  public:
   // Possible lists of entries.
   enum List {
-    NO_USE = 0,   // List of entries that have not been reused.
-    LOW_USE,      // List of entries with low reuse.
-    HIGH_USE,     // List of entries with high reuse.
-    RESERVED,     // Reserved for future use.
-    DELETED,      // List of recently deleted or doomed entries.
+    NO_USE = 0,  // List of entries that have not been reused.
+    LOW_USE,     // List of entries with low reuse.
+    HIGH_USE,    // List of entries with high reuse.
+    RESERVED,    // Reserved for future use.
+    DELETED,     // List of recently deleted or doomed entries.
     LAST_ELEMENT
   };
 
@@ -71,13 +71,9 @@ class Rankings {
     explicit ScopedRankingsBlock(Rankings* rankings);
     ScopedRankingsBlock(Rankings* rankings, CacheRankingsBlock* node);
 
-    ~ScopedRankingsBlock() {
-      rankings_->FreeRankingsBlock(get());
-    }
+    ~ScopedRankingsBlock() { rankings_->FreeRankingsBlock(get()); }
 
-    void set_rankings(Rankings* rankings) {
-      rankings_ = rankings;
-    }
+    void set_rankings(Rankings* rankings) { rankings_ = rankings; }
 
     // scoped_ptr::reset will delete the object.
     void reset(CacheRankingsBlock* p = NULL) {
@@ -167,8 +163,10 @@ class Rankings {
 
   // Returns false if node is not properly linked. This method may change the
   // provided |list| to reflect the list where this node is actually stored.
-  bool CheckLinks(CacheRankingsBlock* node, CacheRankingsBlock* prev,
-                  CacheRankingsBlock* next, List* list);
+  bool CheckLinks(CacheRankingsBlock* node,
+                  CacheRankingsBlock* prev,
+                  CacheRankingsBlock* next,
+                  List* list);
 
   // Checks the links between two consecutive nodes.
   bool CheckSingleLink(CacheRankingsBlock* prev, CacheRankingsBlock* next);
@@ -180,8 +178,13 @@ class Rankings {
   // Walks a list in the desired direction until the nodes |end1| or |end2| are
   // reached. Returns an error code (0 on success), the number of items verified
   // and the addresses of the last nodes visited.
-  int CheckListSection(List list, Addr end1, Addr end2, bool forward,
-                       Addr* last, Addr* second_last, int* num_items);
+  int CheckListSection(List list,
+                       Addr end1,
+                       Addr end2,
+                       bool forward,
+                       Addr* last,
+                       Addr* second_last,
+                       int* num_items);
 
   // Returns true if addr is the head or tail of any list. When there is a
   // match |list| will contain the list number for |addr|.