Clang format slam.

net/disk_cache/blockfile/rankings.h

 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 // See net/disk_cache/disk_cache.h for the public interface.
 
 #ifndef NET_DISK_CACHE_BLOCKFILE_RANKINGS_H_
 #define NET_DISK_CACHE_BLOCKFILE_RANKINGS_H_
 
 #include <list>
@@ skipping 36 matching lines @@
   REMOVE_LOAD_2,
   REMOVE_LOAD_3,
   MAX_CRASH
 };
 
 // This class handles the ranking information for the cache.
 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
   };
 
   // This class provides a specialized version of scoped_ptr, that calls
   // Rankings whenever a CacheRankingsBlock is deleted, to keep track of cache
   // iterators that may go stale.
   class ScopedRankingsBlock : public scoped_ptr<CacheRankingsBlock> {
    public:
     ScopedRankingsBlock();
     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) {
       if (p != get())
         rankings_->FreeRankingsBlock(get());
       scoped_ptr<CacheRankingsBlock>::reset(p);
     }
 
    private:
     Rankings* rankings_;
@@ skipping 69 matching lines @@
   // Makes |rankings| suitable to live a long life.
   void ConvertToLongLived(CacheRankingsBlock* rankings);
 
   // Finishes a list modification after a crash.
   void CompleteTransaction();
   void FinishInsert(CacheRankingsBlock* rankings);
   void RevertRemove(CacheRankingsBlock* 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);
 
   // Peforms a simple check of the list, and returns the number of items or an
   // error code (negative value).
   int CheckList(List list);
 
   // 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|.
   bool IsHead(CacheAddr addr, List* list) const;
   bool IsTail(CacheAddr addr, List* list) const;
 
   // Updates the iterators whenever node is being changed.
   void UpdateIterators(CacheRankingsBlock* node);
 
   // Invalidates the iterators pointing to this node.
@@ skipping 10 matching lines @@
   BackendImpl* backend_;
   LruData* control_data_;  // Data related to the LRU lists.
   IteratorList iterators_;
 
   DISALLOW_COPY_AND_ASSIGN(Rankings);
 };
 
 }  // namespace disk_cache
 
 #endif  // NET_DISK_CACHE_BLOCKFILE_RANKINGS_H_