Convert Pass()→std::move() in //net

net/disk_cache/blockfile/index_table_v3_unittest.cc

 // Copyright 2014 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/index_table_v3.h"
+
 #include <stdint.h>
+#include <utility>
 
 #include "base/logging.h"
 #include "base/macros.h"
 #include "net/disk_cache/blockfile/addr.h"
 #include "net/disk_cache/blockfile/disk_format_v3.h"
-#include "net/disk_cache/blockfile/index_table_v3.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 using disk_cache::EntryCell;
 using disk_cache::IndexCell;
 using disk_cache::IndexTable;
 using disk_cache::IndexTableInitData;
 
 namespace {
 
 int GetChecksum(const IndexCell& source) {
@@ skipping 555 matching lines @@
 // Tests doubling of the table.
 TEST(DiskCacheIndexTable, Doubling) {
   IndexTable index(NULL);
   int size = 1024;
   scoped_ptr<TestCacheTables> cache(new TestCacheTables(size));
   int entry_id = 0;
   disk_cache::CellList entries;
 
   // Go from 1024 to 256k cells.
   for (int resizes = 0; resizes <= 8; resizes++) {
-    scoped_ptr<TestCacheTables> old_cache(cache.Pass());
+    scoped_ptr<TestCacheTables> old_cache(std::move(cache));
     cache.reset(new TestCacheTables(size));
     cache.get()->CopyFrom(*old_cache.get());
 
     IndexTableInitData init_data;
     cache.get()->GetInitData(&init_data);
     index.Init(&init_data);
 
     // Write some entries.
     for (int i = 0; i < 250; i++, entry_id++) {
       SCOPED_TRACE(entry_id);
@@ skipping 34 matching lines @@
     uint32_t hash = i * 256;
     disk_cache::Addr addr(disk_cache::BLOCK_ENTRIES, 1, 5, i * 7 + 1);
     EntryCell entry = index.CreateEntryCell(hash, addr);
     EXPECT_TRUE(entry.IsValid());
 
     disk_cache::CellInfo info = { hash, addr };
     entries.push_back(info);
   }
 
   // Double the size.
-  scoped_ptr<TestCacheTables> old_cache(cache.Pass());
+  scoped_ptr<TestCacheTables> old_cache(std::move(cache));
   cache.reset(new TestCacheTables(size * 2));
   cache.get()->CopyFrom(*old_cache.get());
 
   cache.get()->GetInitData(&init_data);
   index.Init(&init_data);
 
   // Write more entries, starting with the upper half of the table.
   for (int i = 9; i < 11; i++) {
     SCOPED_TRACE(i);
     uint32_t hash = i * 256;
@@ skipping 47 matching lines @@
 
   uint32_t hash = 0;
   disk_cache::Addr addr(disk_cache::BLOCK_ENTRIES, 1, 5, 6);
   EntryCell entry = index.CreateEntryCell(hash, addr);
   EXPECT_TRUE(entry.IsValid());
 
   index.OnBackupTimer();
   int expected = (1024 + 512) / 8 + sizeof(disk_cache::IndexHeaderV3);
   EXPECT_EQ(expected, backend.buffer_len());
 }