Clang format slam.

net/disk_cache/blockfile/bitmap_unittest.cc

 // Copyright (c) 2009 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.
 
 #include "net/disk_cache/blockfile/bitmap.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 TEST(BitmapTest, OverAllocate) {
   // Test that we don't over allocate on boundaries.
   disk_cache::Bitmap map32(32, false);
@@ skipping 87 matching lines @@
   for (int i = 0; i < kMapSize; i++) {
     if (i % 2)
       EXPECT_TRUE(bitmap.Get(i * 8));
     else
       EXPECT_FALSE(bitmap.Get(i * 8));
   }
 
   EXPECT_EQ(0, memcmp(local_map, bitmap.GetMap(), kMapSize));
 
   // Now let's create a bitmap that shares local_map as storage.
-  disk_cache::Bitmap bitmap2(reinterpret_cast<uint32*>(local_map),
-                             kMapSize * 8, kMapSize / 4);
+  disk_cache::Bitmap bitmap2(
+      reinterpret_cast<uint32*>(local_map), kMapSize * 8, kMapSize / 4);
   EXPECT_EQ(0, memcmp(local_map, bitmap2.GetMap(), kMapSize));
 
   local_map[kMapSize / 2] = 'a';
   EXPECT_EQ(0, memcmp(local_map, bitmap2.GetMap(), kMapSize));
   EXPECT_NE(0, memcmp(local_map, bitmap.GetMap(), kMapSize));
 }
 
 TEST(BitmapTest, SetAll) {
   // Tests SetAll and Clear.
   const int kMapSize = 80;
@@ skipping 56 matching lines @@
 }
 
 TEST(BitmapTest, FindNextSetBitBeforeLimit) {
   // Test FindNextSetBitBeforeLimit. Only check bits from 111 to 277 (limit
   // bit == 278). Should find all multiples of 27 in that range.
   disk_cache::Bitmap map(500, true);
   for (int i = 0; i < 500; i++)
     map.Set(i, (i % 27) == 0);
 
   int find_me = 135;  // First one expected.
-  for (int index = 111; map.FindNextSetBitBeforeLimit(&index, 278);
-       ++index) {
+  for (int index = 111; map.FindNextSetBitBeforeLimit(&index, 278); ++index) {
     EXPECT_EQ(index, find_me);
     find_me += 27;
   }
   EXPECT_EQ(find_me, 297);  // The next find_me after 278.
 }
 
 TEST(BitmapTest, FindNextSetBitBeforeLimitAligned) {
   // Test FindNextSetBitBeforeLimit on aligned scans.
   disk_cache::Bitmap map(256, true);
   for (int i = 0; i < 256; i++)
@@ skipping 86 matching lines @@
   bitmap.SetMapElement(11, 0xff);
 
   index = 0;
   EXPECT_EQ(16, bitmap.FindBits(&index, 500, true));
   EXPECT_EQ(344, index);
 
   index = 0;
   EXPECT_EQ(4, bitmap.FindBits(&index, 348, true));
   EXPECT_EQ(344, index);
 }