Roll Chrome into Mojo.

net/base/registry_controlled_domains/registry_controlled_domain_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 "net/base/registry_controlled_domains/registry_controlled_domain.h"
 #include "testing/gtest/include/gtest/gtest.h"
 #include "url/gurl.h"
 
 namespace {
 namespace test1 {
@@ skipping 354 matching lines @@
 
 TEST_F(RegistryControlledDomainTest, TestDafsaTwoByteOffsets) {
   UseDomainData(test3::kDafsa);
 
   // Testing to lookup keys in a DAFSA with two byte offsets.
   // This DAFSA is constructed so that labels begin and end with unique
   // characters, which makes it impossible to merge labels. Each inner node
   // is about 100 bytes and a one byte offset can at most add 64 bytes to
   // previous offset. Thus the paths must go over two byte offsets.
 
-  const char* key0 =
+  const char key0[] =
       "a.b.6____________________________________________________"
       "________________________________________________6";
-  const char* key1 =
+  const char key1[] =
       "a.b.7____________________________________________________"
       "________________________________________________7";
-  const char* key2 =
+  const char key2[] =
       "a.b.a____________________________________________________"
       "________________________________________________8";
 
   EXPECT_EQ(102U, GetRegistryLengthFromHost(key0, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(0U, GetRegistryLengthFromHost(key1, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(102U,
             GetRegistryLengthFromHostIncludingPrivate(
                 key1, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(0U, GetRegistryLengthFromHost(key2, EXCLUDE_UNKNOWN_REGISTRIES));
 }
 
 TEST_F(RegistryControlledDomainTest, TestDafsaThreeByteOffsets) {
   UseDomainData(test4::kDafsa);
 
   // Testing to lookup keys in a DAFSA with three byte offsets.
   // This DAFSA is constructed so that labels begin and end with unique
   // characters, which makes it impossible to merge labels. The byte array
   // has a size of ~54k. A two byte offset can add at most add 8k to the
   // previous offset. Since we can skip only forward in memory, the nodes
   // representing the return values must be located near the end of the byte
   // array. The probability that we can reach from an arbitrary inner node to
   // a return value without using a three byte offset is small (but not zero).
   // The test is repeated with some different keys and with a reasonable
   // probability at least one of the tested paths has go over a three byte
   // offset.
 
-  const char* key0 =
+  const char key0[] =
       "a.b.Z6___________________________________________________"
       "_________________________________________________Z6";
-  const char* key1 =
+  const char key1[] =
       "a.b.Z7___________________________________________________"
       "_________________________________________________Z7";
-  const char* key2 =
+  const char key2[] =
       "a.b.Za___________________________________________________"
       "_________________________________________________Z8";
 
   EXPECT_EQ(104U, GetRegistryLengthFromHost(key0, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(0U, GetRegistryLengthFromHost(key1, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(104U,
             GetRegistryLengthFromHostIncludingPrivate(
                 key1, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(0U, GetRegistryLengthFromHost(key2, EXCLUDE_UNKNOWN_REGISTRIES));
 }
 
 TEST_F(RegistryControlledDomainTest, TestDafsaJoinedPrefixes) {
   UseDomainData(test5::kDafsa);
 
   // Testing to lookup keys in a DAFSA with compressed prefixes.
   // This DAFSA is constructed from words with similar prefixes but distinct
   // suffixes. The DAFSA will then form a trie with the implicit source node
   // as root.
 
-  const char* key0 = "a.b.ai";
-  const char* key1 = "a.b.bj";
-  const char* key2 = "a.b.aak";
-  const char* key3 = "a.b.bbl";
-  const char* key4 = "a.b.aaa";
-  const char* key5 = "a.b.bbb";
-  const char* key6 = "a.b.aaaam";
-  const char* key7 = "a.b.bbbbn";
+  const char key0[] = "a.b.ai";
+  const char key1[] = "a.b.bj";
+  const char key2[] = "a.b.aak";
+  const char key3[] = "a.b.bbl";
+  const char key4[] = "a.b.aaa";
+  const char key5[] = "a.b.bbb";
+  const char key6[] = "a.b.aaaam";
+  const char key7[] = "a.b.bbbbn";
 
   EXPECT_EQ(2U, GetRegistryLengthFromHost(key0, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(0U, GetRegistryLengthFromHost(key1, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(2U,
             GetRegistryLengthFromHostIncludingPrivate(
                 key1, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(3U, GetRegistryLengthFromHost(key2, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(0U, GetRegistryLengthFromHost(key3, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(3U,
             GetRegistryLengthFromHostIncludingPrivate(
                 key3, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(0U,
             GetRegistryLengthFromHostIncludingPrivate(
                 key4, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(0U,
             GetRegistryLengthFromHostIncludingPrivate(
                 key5, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(5U, GetRegistryLengthFromHost(key6, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(5U, GetRegistryLengthFromHost(key7, EXCLUDE_UNKNOWN_REGISTRIES));
 }
 
 TEST_F(RegistryControlledDomainTest, TestDafsaJoinedSuffixes) {
   UseDomainData(test6::kDafsa);
 
   // Testing to lookup keys in a DAFSA with compressed suffixes.
   // This DAFSA is constructed from words with similar suffixes but distinct
   // prefixes. The DAFSA will then form a trie with the implicit sink node as
   // root.
 
-  const char* key0 = "a.b.ia";
-  const char* key1 = "a.b.jb";
-  const char* key2 = "a.b.kaa";
-  const char* key3 = "a.b.lbb";
-  const char* key4 = "a.b.aaa";
-  const char* key5 = "a.b.bbb";
-  const char* key6 = "a.b.maaaa";
-  const char* key7 = "a.b.nbbbb";
+  const char key0[] = "a.b.ia";
+  const char key1[] = "a.b.jb";
+  const char key2[] = "a.b.kaa";
+  const char key3[] = "a.b.lbb";
+  const char key4[] = "a.b.aaa";
+  const char key5[] = "a.b.bbb";
+  const char key6[] = "a.b.maaaa";
+  const char key7[] = "a.b.nbbbb";
 
   EXPECT_EQ(2U, GetRegistryLengthFromHost(key0, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(0U, GetRegistryLengthFromHost(key1, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(2U,
             GetRegistryLengthFromHostIncludingPrivate(
                 key1, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(3U, GetRegistryLengthFromHost(key2, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(0U, GetRegistryLengthFromHost(key3, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(3U,
             GetRegistryLengthFromHostIncludingPrivate(
                 key3, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(0U,
             GetRegistryLengthFromHostIncludingPrivate(
                 key4, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(0U,
             GetRegistryLengthFromHostIncludingPrivate(
                 key5, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(5U, GetRegistryLengthFromHost(key6, EXCLUDE_UNKNOWN_REGISTRIES));
   EXPECT_EQ(5U, GetRegistryLengthFromHost(key7, EXCLUDE_UNKNOWN_REGISTRIES));
 }
 }  // namespace registry_controlled_domains
 }  // namespace net