build: Enable auto raw pointer deduction check on linux.

components/omnibox/browser/in_memory_url_index_unittest.cc

 // 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.
 
 #include <stddef.h>
 #include <stdint.h>
 
 #include <algorithm>
 #include <fstream>
 
@@ skipping 774 matching lines @@
 
   // First group. Because number of entries is small enough no trimming occurs.
   {
     auto ids = GetHistoryIdsUpTo(item_groups[0].max_id);
     EXPECT_FALSE(GetPrivateData()->TrimHistoryIdsPool(&ids));
     EXPECT_EQ(kAlmostLimit, ids.size());
   }
 
   // Each next group should fill almost everything, while the previous group
   // should occupy what's left.
-  auto error_position = std::adjacent_find(
+  auto* error_position = std::adjacent_find(
       std::begin(item_groups), std::end(item_groups),
       [&](const ItemGroup& previous, const ItemGroup& current) {
         auto ids = GetHistoryIdsUpTo(current.max_id);
         EXPECT_TRUE(GetPrivateData()->TrimHistoryIdsPool(&ids));
 
         size_t current_count = CountGroupElementsInIds(current, ids);
         EXPECT_EQ(kAlmostLimit, current_count);
         if (current_count != kAlmostLimit)
           return true;
 
@@ skipping 636 matching lines @@
   ASSERT_TRUE(GetCacheFilePath(&full_file_path));
   std::vector<base::FilePath::StringType> actual_parts;
   full_file_path.GetComponents(&actual_parts);
   ASSERT_EQ(expected_parts.size(), actual_parts.size());
   size_t count = expected_parts.size();
   for (size_t i = 0; i < count; ++i)
     EXPECT_EQ(expected_parts[i], actual_parts[i]);
   // Must clear the history_dir_ to satisfy the dtor's DCHECK.
   set_history_dir(base::FilePath());
 }