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

tools/gn/input_file_manager.cc

 // Copyright (c) 2013 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 "tools/gn/input_file_manager.h"
 
+#include <utility>
+
 #include "base/bind.h"
 #include "base/stl_util.h"
 #include "tools/gn/filesystem_utils.h"
 #include "tools/gn/parser.h"
 #include "tools/gn/scheduler.h"
 #include "tools/gn/scope_per_file_provider.h"
 #include "tools/gn/tokenizer.h"
 #include "tools/gn/trace.h"
 
 namespace {
@@ skipping 263 matching lines @@
 
   std::vector<FileLoadCallback> callbacks;
   {
     base::AutoLock lock(lock_);
     DCHECK(input_files_.find(name) != input_files_.end());
 
     InputFileData* data = input_files_[name];
     data->loaded = true;
     if (success) {
       data->tokens.swap(tokens);
-      data->parsed_root = root.Pass();
+      data->parsed_root = std::move(root);
     } else {
       data->parse_error = *err;
     }
 
     // Unblock waiters on this event.
     //
     // It's somewhat bad to signal this inside the lock. When it's used, it's
     // lazily created inside the lock. So we need to do the check and signal
     // inside the lock to avoid race conditions on the lazy creation of the
     // lock.
@@ skipping 10 matching lines @@
 
   // Run pending invocations. Theoretically we could schedule each of these
   // separately to get some parallelism. But normally there will only be one
   // item in the list, so that's extra overhead and complexity for no gain.
   if (success) {
     for (const auto& cb : callbacks)
       cb.Run(unowned_root);
   }
   return success;
 }